Use the conjugation relations to move every occurrence of to the right and the commuting generators into order. Every element has a normal form
The nine are distinct because their restrictions to the disjoint three-letter supports determine and . Also : its restriction to the first three letters is a transposition, whereas every restriction from this subgroup is a three-cycle or the identity. Consequently the two cosets and are disjoint and have nine elements each. Thus .
In structural terms, , where the element of order two inverts both coordinates. This is a generalized dihedral group. The normal-form count also proves that the listed relations are a complete presentation, rather than merely some relations holding in the permutation group.
Let be the stated diagonal matrices and the interchange matrix. Since , direct matrix multiplication gives
The complete presentation established by the preceding normal-form argument therefore defines a group homomorphism . More explicitly, set
Multiplication of normal forms uses , and the matrices obey exactly the same rule, so this is well-defined and multiplicative. It is the required complex group representation.
On the normal subgroup , the first diagonal entry is the linear character . Its image has order at most three, although , so its kernel of a group homomorphism has order at least three. The second entry is the inverse character and has the same kernel of a group homomorphism. Thus
Elements of the other coset have off-diagonal image and cannot be the identity. If , the kernel of a group homomorphism has order exactly three; otherwise it is all of .
When both roots equal one, only acts nontrivially and its eigenlines spanned by and are invariant, so the representation is reducible. Otherwise one of has two distinct eigenvalues. Any invariant line would be one of its coordinate eigenlines, but interchanges these two lines. Hence no invariant line exists, and

Articles by others on the same topic (0)

There are currently no matching articles.