Let , so and . Multiplication gives
The nilpotence also gives for every nonnegative integer , since all higher binomial terms vanish. Hence, for each positive integer ,
These are unipotent matrices in SL2R. The integer is positive, since the displayed diagonal matrix is undefined at .
Put . Applying the group homomorphism to the identity just proved shows that is conjugate to for every positive integer . Thus the multiset of its eigenvalues is unchanged by taking their th powers.
Take . The fourth-power operation permutes this finite multiset. For each eigenvalue , iterating its permutation cycle gives for some positive integer . Since is unitary, , so : every eigenvalue is a root of unity. Choose a positive integer divisible by all their orders. Every eigenvalue of is then one. Because its eigenvalue multiset is also the original one, we obtain
This is square-power rigidity of a finite nonzero spectrum. Finiteness of the dimension is essential to the permutation-cycle argument.
Let be the normal closure of the upper unipotents . Conjugation by gives
Thus also contains every lower unipotent . We prove explicitly that these elementary unipotent generators of SL2R generate the full group.
For , multiplication gives
So all determinant-one diagonal matrices lie in . If has and , then
because its lower-right entry is . If , then and left multiplication by makes the upper-left entry equal to . The resulting matrix lies in by the preceding factorization, and restores . Therefore
Every unitary matrix is unitarily diagonalizable. Part (ii) therefore proves the stronger matrix statement , not merely a statement about its eigenvalues. The kernel of a group homomorphism is a normal subgroup, and it contains every upper unipotent. By part (iii) their normal closure is the entire group. Thus
This proves the triviality of finite-dimensional unitary representations of SL2R. In fact the argument used only the algebraic homomorphism property and finite-dimensional unitarity; it did not need continuity.

Articles by others on the same topic (0)

There are currently no matching articles.