Cyclic and dihedral groups are two of the most important families of groups in abstract algebra. Cyclic groups model repeated application of one operation, while dihedral groups model the symmetries of regular polygons. This cheat sheet helps students quickly compare definitions, presentations, element orders, subgroups, and common computations.
It is especially useful for proofs involving generators, isomorphism classes, and symmetry actions.
A cyclic group has the form , meaning every element is for some integer . A dihedral group is usually written , where is a rotation and is a reflection. Key formulas include in a cyclic group of order , and in .
Understanding these identities makes it easier to classify elements, compute products, and describe subgroup structure.
Key Facts
- A group is cyclic if there exists such that .
- If , then and exactly when .
- In a cyclic group of order , the order of is .
- The element generates a cyclic group of order exactly when .
- Every subgroup of a cyclic group is cyclic, and for each divisor there is exactly one subgroup of order in .
- The dihedral group of a regular -gon has presentation and order .
- Every element of has exactly one of the forms or , where .
- In , the main multiplication rules are , , and , with exponents taken modulo .
Vocabulary
- Cyclic group
- A group generated by a single element, so every element can be written as for some .
- Generator
- An element of a group such that .
- Order of an element
- The least positive integer such that , if such an integer exists.
- Dihedral group
- The group of all rotations and reflections of a regular -gon, with .
- Rotation
- An element of representing a turn of a regular -gon by radians.
- Reflection
- An element of with order that flips a regular -gon across a symmetry axis.
Common Mistakes to Avoid
- Confusing with a group of order is wrong because the standard convention in many algebra courses is for the symmetries of a regular -gon.
- Assuming every element of is a generator is wrong because generates only when .
- Using is wrong because the correct formula is when .
- Commuting and in is wrong because generally , so and are not usually equal.
- Forgetting to reduce exponents modulo is wrong because , so powers such as must be simplified to .
Practice Questions
- 1 In the cyclic group , find the order of and decide whether is a generator.
- 2 Let with . Compute and determine whether generates .
- 3 In , simplify .
- 4 Explain why is nonabelian for most values of , even though its rotation subgroup is cyclic.
Understanding Group Theory Cyclic & Dihedral Groups
A useful way to picture a cyclic group is as movement around a clock face. Start at one position and repeat the same step. The positions eventually repeat because the group is finite.
The size of the step determines whether every position is reached or only part of the clock. A step of one place reaches all positions. A step of two places on a clock with six positions reaches only three.
This is why common divisors control generators and element orders. The arithmetic is really tracking when repeated motion returns to the starting point.
Cyclic groups appear whenever a system has one repeating cycle. Clock arithmetic, repeating schedules, music rhythms, computer counters, and the roots of a complex number all give examples. In modular arithmetic, addition by a fixed amount behaves like taking powers of a generator.
Students should separate the group operation from ordinary multiplication. In an additive group, repeated use of an element is written as repeated addition.
In a multiplicative group, it is written with powers. The same group structure can use different notation, so focus on the operation rather than the symbols.
Dihedral groups add a new feature that cyclic groups do not have. Reflections reverse direction. If a rotation moves around a polygon in one direction, performing a reflection before or after that rotation usually gives different results.
This lack of commutativity is central. It explains why the reflection relation changes a rotation into its inverse. A reliable calculation method is to move every reflection symbol to one side using the relation.
Then reduce the rotation exponent by the number of sides of the polygon. This produces a standard form and prevents counting the same symmetry twice.
The geometry changes slightly when the polygon has an even number of sides. Some reflections pass through opposite vertices. Others pass through the midpoints of opposite edges.
These two types can behave differently under conjugation, even though each reflection has order two. When the number of sides is odd, every reflection has the same geometric type. Subgroups of a dihedral group often come from selecting some rotations, then possibly including a reflection.
The selected rotations form a cyclic subgroup. Adding a compatible reflection creates a smaller dihedral subgroup.
When solving proof problems, check closure carefully and state whether a subgroup contains reflections. Drawing a labeled polygon is often faster and safer than relying only on symbolic manipulation.