Cosets and counting. A left coset of a subgroup in a group is . The left cosets partition and each has elements. Lagrange's theorem states that for a finite group, ; in particular, the subgroup order divides the group order.
The matrix group. Work throughout in the finite field , so every nonzero entry has a multiplicative inverse. Denote a matrix by , with . Ordinary matrix multiplication, interpreted using modular arithmetic, givesIts diagonal entries remain nonzero, proving closure. Associativity is inherited from matrix multiplication, is the identity element, andThis lies in the same set and multiplication checks the inverse in either order. Thus these matrices form a group. There are four choices each for and and five for , giving .
The subgroup. Write . ThenIt contains the identity , is closed, and has inverse . Interchanging the two factors leaves the product unchanged because multiplication in is commutative. Therefore is an abelian subgroup, withEquivalently is isomorphic to by , which also explains its abelian property. Its order divides , verifying Lagrange's theorem.
There are five distinct left cosets. Representatives can be taken as , : indeedEvery matrix lies in exactly the coset specified by this unique .
Elements whose square is the identity. Squaring givesThus and . For equal signs, in , so . For opposite signs, and all five values work. The complete set is thereforeIt contains elements, including the identity; the other eleven are involutions. Since does not divide , Lagrange's theorem proves that this set is not a subgroup.
Articles by others on the same topic
There are currently no matching articles.