How Are Cyclic Subgroups and Their Generators Related?
At a glance
- 1. Start with a generator
Write the cyclic group as powers of one element, or as integer multiples in additive notation.
- 2. Find the subgroup order
In a finite cyclic group of order n, the subgroup generated by g to the k has order n divided by gcd(n, k).
- 3. Identify its generators
The generators of a subgroup of order d are the powers of its standard generator with exponents relatively prime to d.
- 4. Use uniqueness
A finite cyclic group has exactly one subgroup of each order dividing its group order.
A cyclic subgroup is generated by taking all powers of one group element. The same subgroup can have more than one generator, so an element that belongs to a subgroup need not generate it. The key facts below tell you how to calculate a generated subgroup’s order, list its generators, and count the subgroups of a finite cyclic group.
The order of a generated subgroup
Suppose is a finite cyclic group of order . Every element of is a power of . For an integer , the subgroup generated by has order
Here, the greatest common divisor is taken using if is negative; if , the formula gives the trivial subgroup of order 1. The formula follows because exactly when divides . The smallest positive such is .
In particular, generates all of exactly when . Thus a cyclic group of order has generators, where is Euler’s totient function.
Generators of a particular subgroup
If is a cyclic subgroup of order , it has a generator , and its elements are
The element generates exactly when . If the gcd is greater than 1, taking powers of cannot reach every element of . Therefore, has exactly generators.
For example, let have order 8. Its generators are , , , and , because those are the powers whose exponents are relatively prime to 8. Powers such as and generate proper subgroups instead.
The unique subgroup of each possible order
A finite cyclic group of order has exactly one subgroup of order for each positive divisor of G=\langle g\rangled$ is
To see why it has order , apply the order formula: since divides , the order of is . For uniqueness, any subgroup of a cyclic group is cyclic. If a subgroup has order , its generator must have order , and the elements of order in generate the same subgroup .
Worked example: a cyclic group of order 12
Let with . The subgroup generated by has order
It consists of , , and . Its two generators are and : within this group, their exponents 1 and 2 are both relatively prime to 3.
The subgroup of order 4 is . Its elements are , and its generators are and , corresponding to exponents 1 and 3, both coprime to 4. The subgroup orders in are precisely the divisors of 12: 1, 2, 3, 4, 6, and 12.
The generators of the whole group are for exponents relatively prime to 12. Taking exponents from 0 through 11 gives , so has generators.
Infinite cyclic groups
The same ideas have an additive version. An infinite cyclic group is isomorphic to the integers . Its subgroups are for integers . When , the subgroup has two generators, and . The zero subgroup has just one generator, 0. Equivalently, in multiplicative notation, an infinite cyclic group has two generators of the whole group: and .
Common mistakes
- Confusing membership with generation: An element can belong to without generating all of . For instance, belongs to in the example, but it does not generate that order-4 subgroup.
- Using the wrong exponent test: To check whether generates a group of order , test . For a subgroup of order generated by , test for .
- Assuming different generators give different subgroups: Several elements can generate the same subgroup. In a finite cyclic group, each possible subgroup order gives only one subgroup.
References
- Contemporary Abstract Algebra, Joseph A. Gallian
- Abstract Algebra, David S. Dummit and Richard M. Foote
Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.