A nonidentity transvection is a linear automorphism with and . Equivalently, it fixes a hyperplane pointwise and its displacement has image in a line lying in that hyperplane. The notation allows the identity as a degenerate transvection; use that convention here, with also allowed.
For a nonidentity transvection, choose spanning the image of . There is a unique nonzero linear functional such that . Since , we have , so . Conversely, this condition makes and gives inverse . The identity is represented by and any . ThusWhen , the two displacement maps have zero product, givingFor clarity use left actions of linear maps. Applying , then , then givesWith the alternative conjugation notation , the answer is . In either convention the transformed direction lies in the kernel of the transformed functional.
For a nonidentity transvection , take and choose with . Complete to a basis of using . Then is a basis of , and the matrix of the transvection is : it sends to and fixes the other basis vectors. Consequently all nonidentity transvections form one conjugacy class in . This matrix has determinant one, and conjugation preserves determinant, soFor , let be any GL-conjugator carrying one transvection to another. In an adapted basis for the first, the matrix centralizes it and has determinant . Set . Then gives the same conjugation as . This proves the stronger transvection conjugacy over a finite field resultThe extra coordinate is essential to this determinant adjustment; no such claim is required in dimension two.
Write for . For these are transvections, and for they are the identity. Left multiplication by adds times row to row . We show that these elementary transvection matrices generate the special linear group.
Apply Gaussian elimination using only row additions. If a pivot is zero, invertibility ensures some lower entry in its column is nonzero; adding that row produces a nonzero pivot without interchanging or scaling rows. Clear entries below each pivot, and then above pivots in reverse order. This reduces any invertible matrix to a diagonal matrix , with all , preserving determinant throughout. For a determinant-one matrix, .
A two-coordinate diagonal block is itself a product of elementary transvection matrices. On those two coordinates putThis formula is valid in characteristic two as well. For , multiply the diagonal blocks with entries on coordinates for . Their product is , because its last entry is . Thus and the original matrix lie in the subgroup generated by transvections. Conversely every transvection has determinant one by part ii. HenceFor , both the special linear group and the subgroup generated by the degenerate identity transvection are trivial. The argument also establishes transvections generate the special linear group over any field.
Use the group commutator convention . If , choose distinct . Multiplying elementary matrices, using and all reverse or repeated products here equal to zero, givesEvery elementary generator is therefore in the commutator subgroup. Part iii shows these generators generate , proving it is a perfect group.
It remains to handle and . The polynomial has at most two roots, whereas has more than two elements, so choose with . For , direct conjugation givesBoth coefficients are nonzero. As varies, these group commutators give every upper and lower elementary transvection, which generate . Thus the perfectness of the special linear group is established in all requested cases:The two pairs in the PDF are exclusions, not a literal logical disjunction. They really are exceptions: has a nontrivial sign quotient. Also maps onto , which has the nontrivial abelian quotient . For the latter identification, the faithful projective action has degree four and image of order 12, hence the index-two subgroup of . Neither exceptional group is perfect.
Articles by others on the same topic
There are currently no matching articles.