A cyclic group is a group in which every element is an integer power of a single element, called a generator. In multiplicative notation, a group is cyclic if there exists such that
In additive notation, the same condition is written . Cyclic groups are among the basic objects of group theory: their structure is completely determined, up to isomorphism, by their number of elements, and they describe modular addition, repeated rotations, and many periodic processes.
Definition and notation
For any element of a group, the set of all integer powers of is a subgroup, called the cyclic subgroup generated by . Here , where is the identity element, and negative powers are defined using the inverse of . The ambient group need not itself be cyclic.
The order of an element is the least positive integer satisfying , if such an integer exists; otherwise, has infinite order. Consequently:
- If has finite order , then has exactly elements.
- If has infinite order, all powers , for , are distinct.
A finite cyclic group of order is commonly denoted . The infinite cyclic group is sometimes denoted , although , viewed as an additive group, is more usual. The trivial group, containing only its identity element, is cyclic and is denoted .
Every cyclic group is an abelian group, because
The converse is false: an abelian group need not have a single generator.
Classification
There is exactly one cyclic group of each positive finite order, and exactly one infinite cyclic group, up to isomorphism.
Infinite cyclic groups
Every infinite cyclic group is isomorphic to the additive group of integers:
If , the isomorphism sends to . Multiplication of powers corresponds to addition of exponents.
The infinite cyclic group has precisely two generators: and . In , these are and .
Finite cyclic groups
Every cyclic group of order is isomorphic to
the group of residue classes modulo under addition. This is the basic group underlying additive modular arithmetic.
For example, can be represented by
with addition performed modulo . The element generates all six residues, as does , but generates only .
The classification follows from the homomorphism
This map is surjective. Its kernel is either , giving the infinite case, or for a unique positive integer , giving the finite case.
Examples
Rotations of a regular polygon
For , the rotations carrying a regular polygon to itself form a cyclic group of order , generated by rotation through radians.
This is the rotation group, not the full symmetry group of the polygon. The full symmetry group also contains reflections and is a dihedral group.
Roots of unity
The complex th roots of unity form a cyclic group under multiplication:
A generator is . Thus the same abstract group can appear either as addition of residues or as multiplication of particular complex numbers.
A single permutation
Any permutation generates a cyclic subgroup of a symmetric group. For instance, the cycle generates a cyclic group of order .
A permutation need not consist of one cycle to generate a cyclic subgroup. Every group element generates one, regardless of how that element is represented.
Generators and element orders
Let have finite order . For any integer ,
where denotes the greatest common divisor.
To see this, holds exactly when divides . The smallest positive such is .
It follows that generates if and only if
The number of generators of is therefore , where is Euler’s totient function.
More generally, for each positive divisor of , a cyclic group of order contains exactly elements of order . Counting all elements by their orders gives the identity
For example, in :
- are the four generators.
- and have order .
- has order .
- The identity has order .
Subgroups and quotient groups
Every subgroup of a cyclic group is cyclic.
For an infinite cyclic group , every nontrivial subgroup has the form
for a unique positive integer . In additive notation, the subgroups of are precisely , with , where .
A standard proof chooses the least positive exponent for which lies in the subgroup. Division with remainder then shows that every exponent occurring in the subgroup is a multiple of .
If has finite order , then for each divisor of , it has exactly one subgroup of order :
There are no other subgroups. Their inclusion relations correspond exactly to divisibility:
Because cyclic groups are abelian, every subgroup is a normal subgroup, so every subgroup defines a quotient group. Every quotient of a cyclic group is cyclic, generated by the coset of a generator. In the finite case,
In particular, if is a prime number, has no proper nontrivial subgroups. Conversely, every group of prime order is cyclic.
Homomorphisms and automorphisms
A homomorphism from a cyclic group is completely determined by the image of a generator.
For the infinite cyclic group, any choice of an element in a target group defines a unique homomorphism
For , an assignment defines a homomorphism precisely when
Thus, for positive integers , the number of homomorphisms from to is
An automorphism is an isomorphism from a group to itself. An automorphism of must send a generator to another generator, so it has the form
Under composition, these automorphisms correspond to multiplication of invertible residue classes:
There are therefore automorphisms of .
The infinite cyclic group has exactly two automorphisms, corresponding in additive notation to and .
Products and finite abelian groups
The direct product , whose elements are pairs with componentwise operations, is cyclic if and only if
Indeed, the order of a pair of generators is the least common multiple of and . This equals the total group order exactly when and are relatively prime.
This gives the group-theoretic form of the Chinese remainder theorem:
For example, , whereas is not cyclic: each nonidentity element has order , so none generates all four elements.
Cyclic groups are also the components in the structure theorem for finite abelian groups. Every finite abelian group can be expressed as a direct product of cyclic groups of prime-power order. Such a product need not itself be cyclic.
Applications and distinctions
Number theory and finite fields
The multiplicative group of nonzero elements of a finite field is cyclic. A field with elements therefore has a multiplicative generator of order .
For a prime , this means that the nonzero residues modulo , under multiplication, form a cyclic group of order . A generator is called a primitive root modulo .
By contrast, the invertible residues modulo a composite integer need not form a cyclic group. Additive and multiplicative groups modulo the same integer are different constructions.
Cryptography
Many cryptographic constructions use finite cyclic groups in which exponentiation is efficient but the discrete logarithm problem is believed to be difficult for suitably chosen parameters. Given and , this problem asks for modulo the order of .
The abstract classification of cyclic groups does not provide an efficient algorithm for finding this exponent in every representation. Computational difficulty depends on the representation and parameters, not merely on the abstract group order. Common settings include subgroups of finite-field multiplicative groups and cyclic subgroups of elliptic curve groups.
Fourier analysis
The discrete Fourier transform can be viewed as Fourier analysis on . Its basic functions are the complex-valued group homomorphisms
These encode the periodic structure of data indexed modulo .
Algebraic versus topological generation
In a topological setting, a distinction is necessary between being cyclic and having a dense cyclic subgroup.
The unit circle under complex multiplication is not cyclic as an abstract group: a cyclic group is at most countable, whereas the circle is uncountable. Nevertheless, if is irrational, the powers of form a dense subset of the circle.
Thus, a group can be topologically generated by one element without every element being an integer power of that element. The unqualified term “cyclic group” refers to exact algebraic generation.