Executive Summary
A transformation of an -dimensional space is **-potent** if its characteristic polynomial is , that is, with nilpotent. For this is the classical notion of a unipotent transformation.
The theorem of Lie, Kolchin and Suprunenko says that a group of -potent transformations can be triangularised all at once: in a suitable basis, . Nothing is assumed about — no algebraic closure, no characteristic restriction — and nothing about beyond -potency of its elements.
Overview
Unipotent elements are the part of a linear group that no amount of semisimplicity can absorb. In characteristic they are exactly the -elements , so a unipotent group is the infinite-field analogue of a -subgroup of ; in characteristic zero they are torsion-free, and a nontrivial unipotent group is automatically infinite.
The structure theorem is essentially Lie's theorem for solvable Lie algebras, transported to groups. Lie proved the triangularisation for connected solvable groups over ; Kolchin removed all analytic input in 1948 in the paper that began the algebraic theory of matrix groups; Suprunenko gave the -potent form. The proof here uses only Burnside's theorem and the Trace Lemma.
The immediate payoffs are that is a maximal unipotent subgroup of and all such are conjugate — a Sylow theorem valid for infinite groups — and that every -potent group is nilpotent of class less than .
Learning Objectives
- State Definition and show that a -potent with is invertible, with given by a finite geometric series.
- Prove : over a field of characteristic , unipotent -element.
- State correctly, including the hypothesis that acts -potently on the module in question.
- Follow the three-step proof: reduction to one-dimensional constituents, the algebraically closed case, and the descent argument.
- Deduce : is a group, is a homomorphism, and maximal unipotent subgroups are conjugate to .
- Verify that is a Sylow -subgroup, and that nilpotency class is at most .
Definitions
Let be a field, an -dimensional -vector space and . A linear transformation is **-potent** if with nilpotent; equivalently, if its characteristic polynomial is .
*-potent* means nilpotent, and *-potent* is called unipotent. For a subset , a group is **-potent** (with respect to a surjection ) if every is -potent. When , is a unipotent group.
If with and , then and the geometric series terminates:
So , and is -potent precisely when is unipotent. The unipotent case therefore carries all the content.
- Upper triangular matrices with all diagonal entries . A group under multiplication, and manifestly unipotent.
- Invertible upper triangular matrices with constant diagonal. A -potent group; every -potent group embeds in a conjugate of one of its subgroups.
- Lower central series
- , . is nilpotent of class if .
- -element
- An element whose order is a finite power of . In characteristic these are exactly the unipotent elements of .
- Borel subgroup
- The full upper triangular group ; is its unipotent radical, and is the diagonal torus.
The groups UT(n,k) and k-times-UT(n,k) are defined only up to conjugacy in GL(V), since they depend on a chosen full flag of subspaces.
Core Concepts
Unipotent means -element, and only in characteristic
In characteristic the two notions coincide , because Frobenius makes inside the commutative algebra . In characteristic zero the picture is opposite: a nontrivial unipotent satisfies for , so unipotent groups are torsion-free.
Why the theorem is a statement about constituents
Triangularising a group is the same as producing a full flag of invariant subspaces, that is, a composition series of with one-dimensional factors. So part (2) of the theorem is a formal consequence of part (1): once all composition factors are lines, an adapted basis makes every upper triangular, and -potency forces its diagonal entries all to equal .
Traces do the work again
On a module where acts -potently, where is the dimension. Restricting to the elements of determinant forces , so only traces occur and the Trace Lemma bounds the group. Finiteness then collides with -potency and collapses the module to a line.
Key Results
Let be a field of characteristic and finite-dimensional over . Then is unipotent iff is a -element, i.e. for some . Consequently a linear group is unipotent iff it is a -group.
If , then in the commutative ring of characteristic we have , so is nilpotent and is unipotent.
Conversely let with . Choose with . Then , so has order a power of .
Let be a field, with , and a -potent group with respect to a surjection . Then:
- if is a finite-dimensional irreducible -module on which each acts as a -potent operator — for example any composition factor of — then and acts on as the scalar ;
- with respect to a suitable -basis of , .
In the unipotent case this is Kolchin's theorem: a unipotent group is conjugate into .
Step 1: (1) implies (2)
Take a -composition series . Every factor is an irreducible -module on which acts -potently, because the characteristic polynomial of on a subquotient divides . By (1) each factor is one-dimensional, so and a basis adapted to the flag makes every upper triangular. Since is -potent, its eigenvalues — the diagonal entries — all equal . Hence .
Step 2: proof of (1) when is algebraically closed
Let be as in (1), . Replacing by its image in changes nothing: a -potent operator determines as its unique eigenvalue, so descends. Enlarge to , still -potent with , and note is still simple and by Burnside's Theorem .
Let . Because is algebraically closed, every can be scaled into , so and hence : the module is absolutely irreducible over the semigroup . For we have and , so at most traces occur, and the Trace Lemma gives .
Now let have finite order prime to (every order if ). Then satisfies both , which is separable, and ; their greatest common divisor is , so is a scalar.
If this makes — and hence — consist of scalars, so and . If , let , a finite subgroup of and therefore of order prime to . Every element of is a -element by the previous paragraph, so is a finite -group and for a Sylow -subgroup , with central. Then , so is absolutely irreducible over ; each element of is -potent with , hence , hence unipotent with . Only one trace occurs, so the Trace Lemma gives . Thus is scalar and again .
Step 3: descent to an arbitrary field
Let be as in (1) over an arbitrary , with acting faithfully, and let . Steps 1 and 2 applied over give an -basis of in which ; so each is strictly upper triangular and any product of of them vanishes. These operators are defined over , so the vanishing holds over .
Choose minimal with for all . If then consists of scalars, every subspace is a submodule, and simplicity gives . If , minimality provides and with
while for every by minimality of . Thus , so is a nonzero -submodule of , and simplicity forces and .
- is a subgroup of and is a group homomorphism.
- Any unipotent subgroup of is conjugate in to a subgroup of .
- is a maximal unipotent subgroup of , and every maximal unipotent subgroup of is conjugate to .
For (1) and (2), read off the conclusion of : for in the scalar is the common diagonal entry, and is then visibly multiplicative.
For (3): a union of a chain of unipotent subgroups is unipotent, so Zorn's Lemma provides maximal unipotent subgroups, and every unipotent subgroup lies in one. Let be maximal unipotent. By (2) there is with . Since is unipotent and is again maximal unipotent, . This shows simultaneously that every maximal unipotent subgroup is conjugate to and — since a conjugate of a maximal unipotent subgroup is maximal unipotent — that is itself maximal unipotent.
For ,
Writing shows the -part of the order is . So is a Sylow -subgroup, and is Sylow's conjugacy theorem for this one prime — but valid over every field, where no Sylow theory exists.
For , every -potent subgroup of is nilpotent of class at most .
Indeed is nilpotent of class exactly , and adjoining central scalars does not change the lower central series, since . Now apply . In characteristic this generalises the fact that finite -groups are nilpotent, via .
Proof Techniques and Method
How these proofs work, and which move to reuse.
Triangularise via constituents
Simultaneous triangularisation is never proved directly. Prove instead that all irreducible constituents are lines; the flag and the basis follow formally.
Normalise the determinant
Over an algebraically closed field, scaling by th roots moves any group into the determinant-one subgroup without changing the spanned algebra. This is what makes the trace set finite.
Descend by minimal vanishing product
To get from back to , take the least with all products of operators vanishing. The vectors killed at level span a line, and simplicity finishes.
Move 3 is the reusable gem. It replaces a Galois descent argument by an entirely elementary one: the identity *products of shifted operators vanish* is defined over even though it was verified over , so the minimal-length argument can be run over .
Worked Example
as a Sylow subgroup
Take , . Then
So is a Sylow -subgroup of , as predicts. Which group of order is it? Put , so and , and let . Then
in characteristic ; so has order .
The group is nonabelian of order with more than one involution — , and all square to the identity — so , the dihedral group of order . Its nilpotency class is , matching exactly.
A -potent group and its class
Let . Every element has characteristic polynomial , so is -potent with and .
Here is checked directly: is multiplicative because the product of two such matrices has diagonal . And predicts nilpotency class at most , i.e. abelian — which is correct, since is symmetric in the two factors.
A group that is not -potent
In the elements and are each unipotent, but
characteristic polynomial , with distinct real roots .
So is not -potent and is not a unipotent group — as it must not be, since it acts irreducibly on and would otherwise force . Generated by unipotent elements is much weaker than unipotent.
Comparison and Classification
| Property | ||
|---|---|---|
| unipotent, | infinite order | order a power of |
| Unipotent groups | torsion-free | exactly the -groups |
| finite? | never for | iff is finite |
| Maximal unipotent subgroups | all conjugate to | all conjugate to |
| Sylow interpretation | none | is a Sylow -subgroup |
| Nilpotency class | ||
| Divisible? | yes, and torsion-free (Exercise 9.4) | no — every element has -power order |
| unipotent | -potent | completely reducible | |
|---|---|---|---|
| , | yes | yes | no |
| no | yes | no | |
| Scalars | no | yes | yes |
| Full upper triangular | no | no | no |
| in | no | no | yes |
| Diagonal matrices, | no | no | yes |
Which groups are λ-potent, unipotent, or neither
Relationship Map
Unipotent groups sit inside the Borel and are detected by the radical of the spanned algebra.
- unipotent — nilpotent
- equivalently
- characteristic polynomial
- is a -element, if
- fixes a full flag with trivial action on the factors
- implies
- when is unipotent
- does not imply
- that is unipotent for another unipotent
- that has finite order — false in characteristic
- equivalently
Applications and Industry Use
Applications here means where this structure is used — inside mathematics and in the engineering and computing disciplines that consume it.
Borel and parabolic structure
Kolchin's theorem is the group-theoretic input to the Lie–Kolchin theorem for connected solvable algebraic groups, and hence to the definition of Borel subgroups, the unipotent radical and reductive groups. Kolchin's 1948 paper is one of the founding documents of the subject.
Picard–Vessiot groups
Kolchin developed this material to study differential equations. A Picard–Vessiot group that is unipotent corresponds to an equation solvable by iterated integration, and triangularisation of the group is triangularisation of the system.
Sylow subgroups of
identifies the Sylow -subgroup of explicitly as , which is the starting point for the modular representation theory of groups of Lie type and for many computations in the classification programme.
Unitriangular matrix groups
is a standard source of finite nilpotent -groups of controlled class, used in the construction of test cases for nilpotent quotient algorithms, in polycyclic presentations, and in proposals for non-abelian key exchange.
Within this collection the theorem's role is to supply the obstruction: the largest normal unipotent subgroup of a linear group is precisely what stops it from being completely reducible, and is the tool that identifies it.
Standards and Notation
Standards here covers notation, symbol and markup standards, and reference implementations, rather than material or design codes.
SylowSubgroup(GL(n,q), p) returns a conjugate of the unitriangular groupFailure Modes and Common Mistakes
- Do not assume is a homomorphism before proving the theorem — that is a consequence , not part of the definition.
- Do not expect to be the unique maximal unipotent subgroup; there are many, all conjugate, one for each full flag.
- Do not transfer the Sylow reading to characteristic : there is infinite and torsion-free, and no Sylow theory is in play.
- Do not confuse nilpotent element (, hence not invertible) with unipotent element ( nilpotent, hence invertible).
- Do not conclude from that all maximal unipotent subgroups of an arbitrary linear group are conjugate; the statement is about .
Historical Notes and Lessons Learned
- 1876LieLie's theorem: a solvable Lie algebra of operators over C is simultaneously triangularisable, with one-dimensional common eigenspaces. The infinitesimal ancestor of everything on this page.
- 1937Zassenhaus and othersTriangularisability of nil and unipotent groups of matrices is studied over general fields; the connection with p-groups in characteristic p becomes explicit.
- 1948KolchinKolchin proves that a unipotent matrix group over any field is conjugate into the unitriangular group, in a paper motivated by differential algebra and widely regarded as founding the algebraic theory of matrix groups.
- 1950sSuprunenkoThe lambda-potent generalisation and a systematic study of solvable and locally nilpotent matrix groups over arbitrary fields.
- 1956BorelThe Lie-Kolchin theorem for connected solvable algebraic groups becomes the foundation of Borel subgroup theory, and unipotent radicals enter the definition of reductive groups.
- 1975HumphreysThe textbook treatment in Linear Algebraic Groups fixes the modern terminology: unipotent radical, reductive quotient, Borel and parabolic subgroups.
The lesson worth carrying: the analytic hypotheses of Lie's theorem — connectedness, the complex numbers, a Lie algebra — were all removable. What remained after Kolchin was a purely algebraic statement provable with traces, and it is stronger, because it holds in characteristic where exponentials do not exist.
Quick Reference
| Reference | Statement |
|---|---|
| definition of -potent and unipotent | |
| unipotent -element in characteristic | |
| Lie–Kolchin–Suprunenko triangularisation | |
| is a homomorphism; conjugacy of maximal unipotent subgroups | |
| orders of and | |
| nilpotency class at most | |
| , | Trace Lemma and Burnside's theorem — the tools |
Frequently Asked Questions
Does the theorem require the field to be algebraically closed?
No, and that is the point of Step 3. The algebraically closed case is proved first because Burnside's theorem and the Trace Lemma need it; the descent then uses only the elementary observation that a minimal-length vanishing product of the operators produces a common eigenvector defined over . Contrast the Lie–Kolchin theorem for connected solvable algebraic groups, which genuinely needs algebraic closure.
Why is nilpotent of class exactly ?
Write elements as with strictly upper triangular. Commutators push the nonzero entries further from the diagonal: the th term of the lower central series consists of matrices with supported on the diagonals at distance at least from the main one. Those vanish once the distance exceeds , and not before, as the matrices witness. For the group is abelian, class .
How does this relate to the Sylow theorems?
Over with , says unipotent means -element and says is exactly the -part of . So specialises to Sylow's theorems for the prime . Over an infinite field there are no Sylow theorems, yet the conjugacy statement survives — the theorem is genuinely stronger than what Sylow theory can give.
Is every element of a -potent group of the form scalar times unipotent?
Yes, and that is essentially the definition: is -potent with iff is unipotent. The subtlety is that the map is only proved to be a homomorphism after the theorem, so one cannot simply factor as scalars times a unipotent group at the outset.
What happens for a group of nilpotent — that is -potent — elements?
Nothing, because such elements are not invertible and cannot form a group inside . The corresponding statement for multiplicatively closed sets of nilpotent matrices is Levitzki's theorem: a semigroup of nilpotent matrices is simultaneously strictly triangularisable. It is proved by the same trace argument.
Why does the theorem fail if I only assume the generators are unipotent?
Because unipotency is not preserved by products. is generated by the unipotent elementary matrices and acts irreducibly, so no invariant flag exists. The hypothesis must be checked on the whole group; in practice one verifies it structurally, for instance by knowing that is a -group in characteristic .
References
- T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §9 (pp. 158–161).
- E. R. Kolchin, “Algebraic matric groups and the Picard-Vessiot theory of homogeneous linear ordinary differential equations”, Annals of Mathematics 49 (1948), 1–42.
- J. E. Humphreys, Linear Algebraic Groups, Graduate Texts in Mathematics 21, Springer-Verlag, 1975, §17.
- D. A. Suprunenko, Matrix Groups, Translations of Mathematical Monographs 45, American Mathematical Society, 1976.
- B. A. F. Wehrfritz, Infinite Linear Groups, Ergebnisse der Mathematik 76, Springer-Verlag, 1973, Chapter 1.
- H. Radjavi and P. Rosenthal, Simultaneous Triangularization, Universitext, Springer-Verlag, 2000.
AI Suggested Questions
- Prove Levitzki's theorem on semigroups of nilpotent matrices using the same trace argument.
- Show that a unipotent group in characteristic zero is torsion-free and divisible, as Lam's Exercise 9.4 asks.
- How does the Lie-Kolchin theorem for connected solvable algebraic groups differ in proof from Kolchin's theorem?
- Compute the conjugacy classes of UT(4,q) and explain why the class number is a polynomial in q.
- What is the largest nilpotency class achievable by a subgroup of GL(n,k), and is it attained by unitriangular groups?
- Describe the irreducible complex representations of the discrete Heisenberg group and reconcile them with (9.18)(1).
- How are unipotent subgroups used in the Picard-Vessiot theory of linear differential equations?
