The group order of a finite group is its number of elements, . A subgroup is normal when conjugation by any group element leaves it unchanged:Equivalently, its left and right cosets agree: for every .
Label the triangle's vertices counterclockwise as . Let rotate it by and let reflect it in the axis through vertex 1 and the midpoint of the opposite side. ThenThe six dihedral group elements areThe first three are the identity and the rotations by ; the last three are reflections fixing vertices , respectively. These are all possible symmetries: the image of one vertex has three choices, and the order of the other two has two choices.
Use rightmost-first composition. From the generator relation,with exponents reduced modulo three and two. The row-times-column multiplication table isThus every symmetry is expressed in the two group generators .
Each reflection has order two, giving exactly the three order-two subgroupsConjugation by sends to , cycling the three reflections. None of these subgroups is therefore normal.
The two nonidentity rotations generate the same order-three subgroup:It is invariant under conjugation by , and shows invariance under as well; since generate the group, this proves normality. The complete partition into conjugacy classes isThe rotations are mutually conjugate by , and the reflections by ; no rotation is conjugate to a reflection because conjugation preserves the order of a group element.
Map each symmetry to the permutation it induces on the three vertices. This is a group homomorphism, because composing geometric motions composes their vertex permutations. In the labels chosen in (b), the map isAll six images are distinct and exhaust the symmetric group . Equivalently, the kernel is trivial because a triangle symmetry fixing all three vertices is the identity. Thus the map is bijective and
Articles by others on the same topic
There are currently no matching articles.