logo

Infinite Cyclic groups in Abstract Algebra 📂Abstract Algebra

Infinite Cyclic groups in Abstract Algebra

Definition 1

A subgroup DnSnD_{n} \leqslant S_{n} of the symmetric group comprised solely of permutations that rotate and reflect a nn-sided polygon is defined as the Dihedral group.

Description

Since it is derived from geometrical figures, it’s hard to explain just with words.

D3=S3D_{3} = S_{3}

An example of the smallest dihedral group is the symmetric group D3=S3D_{3} = S_{3}.

20180204\_125857.png 20180204\_125905.png

Dn=2n| D_{n} | =2n

Such permutations for a nn-sided polygon can relatively easily be guessed to exist in 2n2n. For instance, the group based on a square D4D_{4} has 88 elements and is hence also known by the nickname Octic group.

20180207\_004238.png

As shown in the above figure, elements of D4D_{4} include μ1,μ2,δ1,δ2\mu_{1}, \mu_{2}, \delta_{1}, \delta_{2} and rotation ρ0,ρ1,ρ2,ρ3\rho_{0} , \rho_{1} , \rho_{2} , \rho_{3}.


  1. Fraleigh. (2003). A first course in abstract algebra(7th Edition): p79. ↩︎