Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Cyclic group
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Examples== {| class=wikitable align=right |+Examples of cyclic groups in rotational symmetry |- | [[File:Triangle.Scalene.svg|120px]] | [[File:Hubble2005-01-barred-spiral-galaxy-NGC1300.jpg|120px]] | [[File:The armoured triskelion on the flag of the Isle of Man.svg|120px]] |- ![[Scalene triangle|C<sub>1</sub>]] ![[NGC 1300|C<sub>2</sub>]] ![[Flag of the Isle of Man|C<sub>3</sub>]] |- |[[File:Circular-cross-decorative-knot-12crossings.svg|120px]] | [[File:Flag of Hong Kong.svg|120px]] |[[File:Olavsrose.svg|120px]] |- ![[Celtic knot|C<sub>4</sub>]] ![[Flag of Hong Kong|C<sub>5</sub>]] ![[:de:Olavsrose|C<sub>6</sub>]] |} ===Integer and modular addition=== The set of [[integer]]s '''Z''', with the operation of addition, forms a group.<ref name="eom"/> It is an '''infinite cyclic group''', because all integers can be written by repeatedly adding or subtracting the single number 1. In this group, 1 and β1 are the only generators. Every infinite cyclic group is isomorphic to '''Z'''. For every positive integer ''n'', the set of integers [[modular arithmetic|modulo]] ''n'', again with the operation of addition, forms a finite cyclic group, denoted '''Z'''/''n'''''Z'''.<ref name="eom"/> A modular integer ''i'' is a generator of this group if ''i'' is [[relatively prime]] to ''n'', because these elements can generate all other elements of the group through integer addition. (The number of such generators is ''Ο''(''n''), where ''Ο'' is the [[Euler totient function]].) Every finite cyclic group ''G'' is isomorphic to '''Z'''/''n'''''Z''', where ''n'' = {{abs|''G''}} is the order of the group. The addition operations on integers and modular integers, used to define the cyclic groups, are the addition operations of [[commutative ring]]s, also denoted '''Z''' and '''Z'''/''n'''''Z''' or '''Z'''/(''n''). If ''p'' is a [[prime number|prime]], then '''Z'''/''p'''Z''''' is a [[finite field]], and is usually denoted '''F'''<sub>''p''</sub> or GF(''p'') for Galois field. ===Modular multiplication=== {{main|Multiplicative group of integers modulo n}} For every positive integer ''n'', the set of the integers modulo ''n'' that are relatively prime to ''n'' is written as ('''Z'''/''n'''''Z''')<sup>Γ</sup>; it [[Multiplicative group of integers modulo n|forms a group]] under the operation of multiplication. This group is not always cyclic, but is so whenever ''n'' is 1, 2, 4, a [[prime power|power of an odd prime]], or twice a power of an odd prime {{OEIS|A033948}}.<ref>{{Harv|Motwani|Raghavan|1995|p=401}}.</ref><ref>{{Harv|Vinogradov|2003|loc=Β§ VI PRIMITIVE ROOTS AND INDICES|pp=105β132}}.</ref> This is the multiplicative group of [[Unit (ring theory)|units]] of the ring '''Z'''/''n'''''Z'''; there are ''Ο''(''n'') of them, where again ''Ο'' is the [[Euler totient function]]. For example, ('''Z'''/6'''Z''')<sup>Γ</sup> = {{mset|1, 5}}, and since 6 is twice an odd prime this is a cyclic group. In contrast, ('''Z'''/8'''Z''')<sup>Γ</sup> = {{mset|1, 3, 5, 7}} is a [[Klein group|Klein 4-group]] and is not cyclic. When ('''Z'''/''n'''''Z''')<sup>Γ</sup> is cyclic, its generators are called [[primitive root modulo n|primitive roots modulo ''n'']]. For a prime number ''p'', the group ('''Z'''/''p'''''Z''')<sup>Γ</sup> is always cyclic, consisting of the non-zero elements of the [[finite field]] of order ''p''. More generally, every finite [[subgroup]] of the multiplicative group of any [[field (mathematics)|field]] is cyclic.<ref>{{Harv|Rotman|1998|p=65}}.</ref> ===Rotational symmetries=== {{main|Rotational symmetry}} The set of [[rotational symmetry|rotational symmetries]] of a [[polygon]] forms a finite cyclic group.<ref>{{Harv|Stewart|Golubitsky|2010|pp=47β48}}.</ref> If there are ''n'' different ways of moving the polygon to itself by a rotation (including the null rotation) then this symmetry group is isomorphic to '''Z'''/''n'''''Z'''. In three or higher dimensions there exist other [[Point groups in three dimensions#Cyclic 3D symmetry groups|finite symmetry groups that are cyclic]], but which are not all rotations around an axis, but instead [[rotoreflection]]s. The group of all rotations of a [[circle]] (the [[circle group]], also denoted ''S''<sup>1</sup>) is ''not'' cyclic, because there is no single rotation whose integer powers generate all rotations. In fact, the infinite cyclic group C<sub>β</sub> is [[countable]], while ''S''<sup>1</sup> is not. The group of rotations by rational angles ''is'' countable, but still not cyclic. ===Galois theory=== An ''n''th [[root of unity]] is a [[complex number]] whose ''n''th power is 1, a [[root of a polynomial|root]] of the [[polynomial]] {{nowrap|''x''<sup>''n''</sup> β 1}}. The set of all ''n''th roots of unity forms a cyclic group of order ''n'' under multiplication.<ref name="eom"/> The generators of this cyclic group are the ''n''th [[primitive root of unity|primitive roots of unity]]; they are the roots of the ''n''th [[cyclotomic polynomial]]. For example, the polynomial {{nowrap|1=''z''<sup>3</sup> β 1}} factors as {{nowrap|(''z'' β 1)(''z'' β ''Ο'')(''z'' β ''Ο''<sup>2</sup>)}}, where {{nowrap|1=''Ο'' = ''e''<sup>2''Οi''/3</sup>}}; the set {{mset|1, ''Ο'', ''Ο''<sup>2</sup>}} = {{mset|''Ο''<sup>0</sup>, ''Ο''<sup>1</sup>, ''Ο''<sup>2</sup>}} forms a cyclic group under multiplication. The [[Galois group]] of the [[field extension]] of the [[rational number]]s generated by the ''n''th roots of unity forms a different group, isomorphic to the multiplicative group ('''Z/'''''n'''''Z''')<sup>Γ</sup> of order [[Euler's totient function|''Ο''(''n'')]], which is cyclic for some but not all ''n'' (see above). A field extension is called a [[cyclic extension]] if its Galois group is cyclic. For fields of [[Characteristic (algebra)|characteristic zero]], such extensions are the subject of [[Kummer theory]], and are intimately related to [[solvability by radicals]]. For an extension of [[finite field]]s of characteristic ''p'', its Galois group is always finite and cyclic, generated by a power of the [[Frobenius endomorphism|Frobenius mapping]].<ref>{{Harv|Cox|2012|loc = Theorem 11.1.7|p=294}}.</ref> Conversely, given a finite field ''F'' and a finite cyclic group ''G'', there is a finite field extension of ''F'' whose Galois group is ''G''.<ref>{{Harv|Cox|2012|loc=Corollary 11.1.8 and Theorem 11.1.9|p=295}}.</ref>
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
Cyclic group
(section)
Add topic