Label the triangle vertices counterclockwise. Let rotate by counterclockwise and let reflect across the line through vertex 1 and the midpoint of the opposite side. The dihedral group has elements , with and .
The action on vertices identifies them with these permutations, with the rightmost operation applied first:
The minimal number of generators is two, and is one minimal generating set. They produce every displayed element. A one-element generating set would make the group cyclic, but every nonidentity element has order two or three, never six.
The vertex-action map preserves composition, hence is a group homomorphism from to the symmetric group . The displayed actions are all six distinct permutations of three vertices, so the map is both injective and surjective. Therefore
This identification uses the convention , with the subscript counting polygon vertices.

Articles by others on the same topic (0)

There are currently no matching articles.