There are nilpotent matrices of size n over . Every matrix has a unique invariant direct sum on which it is nilpotent and invertible. Counting those ordered decompositions gives . Subtraction at n and n−1 yields . Translation by the identity counts unipotent matrices.
Elementary unipotent generators of SL2R 2026-10-14
The upper and lower unipotent matrices generate SL2R. For , let ; multiplication gives and . A determinant-one matrix with upper-left entry factors as . If that entry vanishes, first add the second row to the first by . Lower unipotents are conjugates of upper unipotents, so the latter also generate the whole group normally.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 1 2 b i Solution Created 2026-10-03 Updated 2026-10-14
Let , so and . Multiplication givesThe 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 .
Past exam of the mathematics course of the University of Cambridge 2002 ib Paper 2 15G a Solution Created 2026-09-24 Updated 2026-10-14
If is a unipotent matrix, is a nilpotent matrix. If for a nonzero eigenvector, then for some , forcing .
Conversely, suppose the only eigenvalue is . Over , the characteristic polynomial is then . The Cayley-Hamilton theorem gives , so is nilpotent. Thus is unipotent if and only if its only eigenvalue is one.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 2 5 c Solution Created 2026-10-03 Updated 2026-10-14
Translation is a bijection from nilpotent matrices to unipotent matrices. We can count the former without requiring a further partition identity. Let be their number, with .
Every linear operator has a unique decomposition from the Fitting lemmaon which it is respectively nilpotent and invertible. To justify the decomposition, kernels and images stabilize by step ; if , then , so . The dimensions then show the sum is all of , and stabilization makes invertible on the image. These two summands are determined by , so there is no overcounting.
For a nilpotent summand of dimension , the number of ordered complementary subspaces is , by transporting two fixed bases. The restrictions of have and choices. Summing all matrices givesWrite , so . Subtract the same equation for :Thus counting nilpotent matrices by the Fitting decomposition provesThe supplied product identity is consistent with the resulting mass series: taking its variables to be , gives .
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 2 5 d Solution Created 2026-10-03 Updated 2026-10-14
For the fixed degree-two irreducible polynomial , a matrix with minimal polynomial a power of has only one primary component. Its conjugacy classes correspond to integer partitions of . By the primary matrix centralizer formula, its centralizer has exactly the same order as the centralizer of the corresponding unipotent matrix in .
Sum the conjugacy class sizes:The same sum times is the number of unipotent matrices of , which 5(c) shows is . Hence counting matrices with a fixed primary polynomial givesIn particular the exponent of the minimal polynomial is not fixed in advance: summing all integer partitions includes every possible largest block size. The usual statement takes ; dimension zero can instead be included with its identity convention.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 3 4 Solution Created 2026-10-03 Updated 2026-10-06
A unipotent algebraic group admits a faithful linear representation in which every group element is a unipotent matrix. For , invertibility is the nonvanishing condition . Therefore is a nonempty Zariski-open subset of the vector space .
Take a Krull-Schmidt decomposition , with pairwise nonisomorphic indecomposable modules. The Fitting lemma makes each a local endomorphism ring. Its residue division algebra is : over an algebraically closed field, every element of a finite-dimensional division algebra has an eigenvalue and hence must be scalar. The semisimple quotient of a module endomorphism algebra consequently gives, for the Jacobson radical ,is surjective with kernel . The nilpotence of makes finite and each unipotent. The kernel is closed and normal. Acting on the multiplicity spaces embeds the product of general linear groups back into and splits this quotient. This proves the Levi decomposition of a quiver automorphism groupSince is the unipotent radical, a nonzero is indecomposable exactly when : the product has a single factor of size one.
For the base change action on quiver representations, the orbit map is . Substituting , with , shows its differential isIts kernel is . The stabilizer is smooth because it is open in that vector space. Hence the differential has rank , and its image is the Zariski tangent space . The normal space to a quiver orbit is thereforeThe ambient quiver representation space is an irreducible affine space, and orbits are locally closed. An orbit is open exactly when its dimension equals that ambient dimension, equivalently when . This proves that rigid quiver representations have open orbits. Such an orbit is dense and unique, since two nonempty open subsets of an irreducible space intersect.
Unipotent conjugacy in SL2 over a finite field Created 2026-10-07 Updated 2026-10-14
For a finite field of odd characteristic and nonzero , let . An arbitrary determinant-one matrix satisfies only if and . The determinant condition then gives . Conversely . Thus nonzero upper unipotent matrices fall into two conjugacy classes under this square-class criterion. For example, and are conjugate over because , but not over . The criterion compares these particular upper unipotent representatives; it does not classify all determinant-one matrices.