Sign in to save

Bookmark this page so you can find it later.

Sign in to save

Bookmark this page so you can find it later.

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 G=aG = \langle a \rangle, meaning every element is aka^k for some integer kk. A dihedral group is usually written Dn=r,srn=e, s2=e, srs=r1D_n = \langle r,s \mid r^n = e,\ s^2 = e,\ srs = r^{-1} \rangle, where rr is a rotation and ss is a reflection. Key formulas include ak=ngcd(n,k)|a^k| = \frac{n}{\gcd(n,k)} in a cyclic group of order nn, and srk=rkssr^k = r^{-k}s in DnD_n.

Understanding these identities makes it easier to classify elements, compute products, and describe subgroup structure.

Key Facts

  • A group GG is cyclic if there exists aGa \in G such that G=a={ak:kZ}G = \langle a \rangle = \{a^k : k \in \mathbb{Z}\}.
  • If a=n|a| = n, then a={e,a,a2,,an1}\langle a \rangle = \{e,a,a^2,\dots,a^{n-1}\} and am=ea^m = e exactly when nmn \mid m.
  • In a cyclic group of order nn, the order of aka^k is ak=ngcd(n,k)|a^k| = \frac{n}{\gcd(n,k)}.
  • The element aka^k generates a cyclic group of order nn exactly when gcd(n,k)=1\gcd(n,k) = 1.
  • Every subgroup of a cyclic group is cyclic, and for each divisor dnd \mid n there is exactly one subgroup of order dd in Zn\mathbb{Z}_n.
  • The dihedral group of a regular nn-gon has presentation Dn=r,srn=e, s2=e, srs=r1D_n = \langle r,s \mid r^n = e,\ s^2 = e,\ srs = r^{-1} \rangle and order Dn=2n|D_n| = 2n.
  • Every element of DnD_n has exactly one of the forms rkr^k or srksr^k, where 0k<n0 \le k < n.
  • In DnD_n, the main multiplication rules are rarb=ra+br^a r^b = r^{a+b}, rasrb=srbar^a sr^b = sr^{b-a}, and srasrb=rbasr^a sr^b = r^{b-a}, with exponents taken modulo nn.

Vocabulary

Cyclic group
A group generated by a single element, so every element can be written as aka^k for some kZk \in \mathbb{Z}.
Generator
An element aa of a group GG such that a=G\langle a \rangle = G.
Order of an element
The least positive integer mm such that am=ea^m = e, if such an integer exists.
Dihedral group
The group DnD_n of all rotations and reflections of a regular nn-gon, with Dn=2n|D_n| = 2n.
Rotation
An element rkr^k of DnD_n representing a turn of a regular nn-gon by 2πkn\frac{2\pi k}{n} radians.
Reflection
An element srksr^k of DnD_n with order 22 that flips a regular nn-gon across a symmetry axis.

Common Mistakes to Avoid

  • Confusing DnD_n with a group of order nn is wrong because the standard convention in many algebra courses is Dn=2n|D_n| = 2n for the symmetries of a regular nn-gon.
  • Assuming every element of Zn\mathbb{Z}_n is a generator is wrong because kk generates Zn\mathbb{Z}_n only when gcd(n,k)=1\gcd(n,k) = 1.
  • Using ak=ak|a^k| = \frac{|a|}{k} is wrong because the correct formula is ak=ngcd(n,k)|a^k| = \frac{n}{\gcd(n,k)} when a=n|a| = n.
  • Commuting rr and ss in DnD_n is wrong because generally sr=r1ssr = r^{-1}s, so rsrs and srsr are not usually equal.
  • Forgetting to reduce exponents modulo nn is wrong because rn=er^n = e, so powers such as rn+3r^{n+3} must be simplified to r3r^3.

Practice Questions

  1. 1 In the cyclic group Z18\mathbb{Z}_{18}, find the order of 66 and decide whether 66 is a generator.
  2. 2 Let G=aG = \langle a \rangle with a=24|a| = 24. Compute a10|a^{10}| and determine whether a10a^{10} generates GG.
  3. 3 In D8=r,sr8=e, s2=e, srs=r1D_8 = \langle r,s \mid r^8 = e,\ s^2 = e,\ srs = r^{-1} \rangle, simplify (sr3)(sr6)(sr^3)(sr^6).
  4. 4 Explain why DnD_n is nonabelian for most values of nn, even though its rotation subgroup r\langle r \rangle 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.