Cyclic group

Related subjects: Mathematics

Background to the schools Wikipedia

SOS Children, an education charity, organised this selection. See http://www.soschildren.org/sponsor-a-child to find out about child sponsorship.

Group theory
Basic notions Subgroup Normal subgroup Quotient group (Semi-) direct product Group homomorphisms kernel image direct sum wreath product simple finite infinite continuous multiplicative additive cyclic abelian dihedral nilpotent solvable List of group theory topics Glossary of group theory
Finite groups Classification of finite simple groups Cyclic group Z/n Symmetric group S_n Dihedral group D_n Alternating group A_n Mathieu groups M₁₁ M₁₂ M₂₂ M₂₃ M₂₄ Conway groups Co₁ Co₂ Co₃ Janko groups J₁ J₂ J₃ J₄ Fischer groups F₂₂ F₂₃ F₂₄ Baby Monster group (B) Monster group (M)
Discrete groups Lattices Integers (Z) Lattice Modular groups PSL(2,Z) SL(2,Z)
Topological / Lie groups Solenoid Circle General linear GL(n) Special linear SL(n) Orthogonal O(n) Euclidean E(n) Special orthogonal SO(n) Unitary U(n) Special unitary SU(n) Symplectic Sp(n) G₂ F₄ E₆ E₇ E₈ Lorentz Poincaré Conformal Diffeomorphism Loop Infinite dimensional Lie group O(∞) SU(∞) Sp(∞)
Algebraic groups Elliptic curve Linear algebraic group Abelian variety

In group theory, a cyclic group or monogenous group is a group that can be generated by a single element, in the sense that the group has an element g (called a " generator" of the group) such that, when written multiplicatively, every element of the group is a power of g (a multiple of g when the notation is additive).

Definition

A group G is called cyclic if there exists an element g in G such that G = <g> = { gⁿ | n is an integer }. Since any group generated by an element in a group is a subgroup of that group, showing that the only subgroup of a group G that contains g is G itself suffices to show that G is cyclic.

For example, if G = { g⁰, g¹, g², g³, g⁴, g⁵ } is a group, then g⁶ = g⁰, and G is cyclic. In fact, G is essentially the same as (that is, isomorphic to) the set { 0, 1, 2, 3, 4, 5 } with addition modulo 6. For example, 1 + 2 = 3 (mod 6) corresponds to g¹·g² = g³, and 2 + 5 = 1 (mod 6) corresponds to g²·g⁵ = g⁷ = g¹, and so on. One can use the isomorphism φ defined by φ(gⁱ) = i.

For every positive integer n there is exactly one cyclic group (up to isomorphism) whose order is n, and there is exactly one infinite cyclic group (the integers under addition). Hence, the cyclic groups are the simplest groups and they are completely classified.

The name 'cyclic' may be misleading: it is possible to generate infinitely many elements and not form any literal cycles; that is, every $g^n$ is distinct. (It can be said that it has one infinitely long cycle.) A group generated in this way is called an infinite cyclic group, and is isomorphic to the additive group of integers Z.

Since the cyclic groups are abelian, they are often written additively and denoted Z_n. However, this notation can be problematic for number theorists because it conflicts with the usual notation for p-adic number rings or localization at a prime ideal. The quotient notations Z/nZ, Z/n, and Z/(n) are standard alternatives. We adopt the first of these here to avoid the collision of notation. See also the section Subgroups and notation below.

One may write the group multiplicatively, and denote it by C_n, where n is the order (which can be ∞). For example, g³g⁴ = g² in C₅, whereas 3 + 4 = 2 in Z/5Z.

Properties

The fundamental theorem of cyclic groups states that if G is a cyclic group of order n then every subgroup of G is cyclic. Moreover, the order of any subgroup of G is a divisor of n and for each positive divisor k of n the group G has exactly one subgroup of order k. This property characterizes finite cyclic groups: a group of order n is cyclic if and only if for every divisor d of n the group has at most one subgroup of order d. Sometimes the equivalent statement is used: a group of order n is cyclic if and only if for every divisor d of n the group has exactly one subgroup of order d.

Every finite cyclic group is isomorphic to the group { [0], [1], , ..., [n − 1] } of integers modulo n under addition, and any infinite cyclic group is isomorphic to Z (the set of all integers) under addition. Thus, one only needs to look at such groups to understand the properties of cyclic groups in general. Hence, cyclic groups are one of the simplest groups to study and a number of nice properties are known.

Given a cyclic group G of order n (n may be infinity) and for every g in G,

G is abelian; that is, their group operation is commutative: gh = hg (for all h in G). This is so since g + h mod n = h + g mod n.
If n is finite, then gⁿ = g⁰ is the identity element of the group, since n mod n = 0.
If n = ∞, then there are exactly two generators: namely 1 and −1 for Z, and any others mapped to them under an isomorphism in other infinite cyclic groups.
If n is finite, then there are exactly φ(n) generators where φ is the Euler phi function
Every subgroup of G is cyclic. Indeed, each finite subgroup of G is a group of { 0, 1, 2, 3, ... m − 1} with addition modulo m. And each infinite subgroup of G is mZ for some m, which is bijective to (so isomorphic to) Z.
G_n is isomorphic to Z/nZ ( factor group of Z over nZ) since Z/nZ = {0 + nZ, 1 + nZ, 2 + nZ, 3 + nZ, 4 + nZ, ..., n − 1 + nZ} $\cong$ { 0, 1, 2, 3, 4, ..., n − 1} under addition modulo n.

More generally, if d is a divisor of n, then the number of elements in Z/n which have order d is φ(d). The order of the residue class of m is n / gcd(n,m).

If p is a prime number, then the only group ( up to isomorphism) with p elements is the cyclic group C_p or Z/pZ.

The direct product of two cyclic groups Z/nZ and Z/mZ is cyclic if and only if n and m are coprime. Thus e.g. Z/12Z is the direct product of Z/3Z and Z/4Z, but not the direct product of Z/6Z and Z/2Z.

The definition immediately implies that cyclic groups have very simple group presentation C_∞ = < x | > and C_n = < x | xⁿ > for finite n.

A primary cyclic group is a group of the form Z/p^k where p is a prime number. The fundamental theorem of abelian groups states that every finitely generated abelian group is the direct product of finitely many finite primary cyclic and infinite cyclic groups.

Z/nZ and Z are also commutative rings. If p is a prime, then Z/pZ is a finite field, also denoted by F_p or GF(p). Every field with p elements is isomorphic to this one.

The units of the ring Z/nZ are the numbers coprime to n. They form a group under multiplication modulo n with φ(n) elements (see above). It is written as (Z/nZ)^×. For example, we get (Z/nZ)^× = {1,5} when n = 6, and get (Z/nZ)^× = {1,3,5,7} when n = 8.

In fact, it is known that (Z/nZ)^× is cyclic if and only if n is 2 or 4 or p^k or 2 p^k for an odd prime number p and k ≥ 1, in which case every generator of (Z/nZ)^× is called a primitive root modulo n. Thus, (Z/nZ)^× is cyclic for n = 6, but not for n = 8, where it is instead isomorphic to the Klein four-group.

The group (Z/pZ)^× is cyclic with p − 1 elements for every prime p, and is also written (Z/pZ)^* because it consists of the non-zero elements. More generally, every finite subgroup of the multiplicative group of any field is cyclic.

Examples

In 2D and 3D the symmetry group for n-fold rotational symmetry is C_n, of abstract group type Z_n. In 3D there are also other symmetry groups which are algebraically the same, see Cyclic symmetry groups in 3D.

Note that the group S¹ of all rotations of a circle (the circle group) is not cyclic, since it is not even countable.

The n^th roots of unity form a cyclic group of order n under multiplication. e.g., $0 = z^3 - 1 = (z - s^0)(z - s^1)(z - s^2)$ where $s^i = e^{2 \pi i /3}$ and a group of $\{ s^0, s^1, s^2 \}$ under multiplication is cyclic.

The Galois group of every finite field extension of a finite field is finite and cyclic; 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.

Representation

The cycle graphs of finite cyclic groups are all n-sided polygons with the elements at the vertices. The dark vertex in the cycle graphs below stand for the identity element, and the other vertices are the other elements of the group. A cycle consists of successive powers of either of the elements connected to the identity element.


C₁	C₂	C₃	C₄	C₅	C₆	C₇	C₈

The representation theory of the cyclic group is a critical base case for the representation theory of more general finite groups. In the complex case, a representation of a cyclic group decomposes into a direct sum of linear characters, making the connection between character theory and representation theory transparent. In the positive characteristic case, the indecomposable representations of the cyclic group form a model and inductive basis for the representation theory of groups with cyclic Sylow subgroups and more generally the representation theory of blocks of cyclic defect.

Subgroups and notation

All subgroups and quotient groups of cyclic groups are cyclic. Specifically, all subgroups of Z are of the form mZ, with m an integer ≥0. All of these subgroups are different, and apart from the trivial group (for m=0) all are isomorphic to Z. The lattice of subgroups of Z is isomorphic to the dual of the lattice of natural numbers ordered by divisibility. All factor groups of Z are finite, except for the trivial exception Z/{0} = Z/0Z. For every positive divisor d of n, the quotient group Z/nZ has precisely one subgroup of order d, the one generated by the residue class of n/d. There are no other subgroups. The lattice of subgroups is thus isomorphic to the set of divisors of n, ordered by divisibility. In particular, a cyclic group is simple if and only if its order (the number of its elements) is prime.

Using the quotient group formalism, Z/nZ is a standard notation for the additive cyclic group with n elements. In ring terminology, the subgroup nZ is also the ideal (n), so the quotient can also be written Z/(n) or Z/n without abuse of notation. These alternatives does not conflict with the notation for the p-adic integers. The last form has the additional advantage that it reads the same way that the group or ring is often described verbally, "Zee mod en".

As a practical problem, one may be given a finite subgroup C of order n, generated by an element g, and asked to find the size m of the subgroup generated by g^k for some integer k. Here m will be the smallest integer > 0 such that mk is divisible by n. It is therefore n/m where m = (k, n) is the gcd of k and n. Put another way, the index of the subgroup generated by g^k is m. This reasoning is known as the index calculus algorithm, in number theory.

Endomorphisms

The endomorphism ring of the abelian group Z/nZ is isomorphic to Z/nZ itself as a ring. Under this isomorphism, the number r corresponds to the endomorphism of Z/nZ that maps each element to the sum of r copies of it. This is a bijection if and only if r is coprime with n, so the automorphism group of Z/nZ is isomorphic to the unit group (Z/nZ)^× (see above).

Similarly, the endomorphism ring of the additive group Z is isomorphic to the ring Z. Its automorphism group is isomorphic to the group of units of the ring Z, i.e. to {−1, +1} $\cong$ C₂.

Virtually cyclic groups

A group is called virtually cyclic if it contains a cyclic subgroup of finite index. It is known that a finitely generated discrete group with exactly two ends is virtually cyclic. Every abelian subgroup of a Gromov hyperbolic group is virtually cyclic.

Retrieved from " http://en.wikipedia.org/w/index.php?title=Cyclic_group&oldid=200831852"