Executive Summary
Let be any linear group over any field, with . Among the normal subgroups of that are unipotent there is a largest one, — the unipotent radical — and is isomorphic to a completely reducible linear group over .
Two descriptions make computable. It is the set of elements acting trivially on every composition factor of ; equivalently, writing , it is . The obstruction to complete reducibility that lives inside the group is therefore visible in the radical of an algebra of dimension at most .
Overview
Complete reducibility is the property one wants and rarely has. It is natural to ask what part of is responsible for its failure, and to hope for a normal subgroup that carries the blame — a radical in the group-theoretic sense, mirroring for rings.
The unipotent radical is that subgroup, and Kolchin's theorem is what makes it exist. A normal unipotent subgroup must act trivially on every composition factor of : Clifford's theorem makes the restriction semisimple, and makes each constituent a line with trivial action. So all normal unipotent subgroups are contained in one explicit subgroup, which is itself normal and unipotent.
The notion is borrowed by, and named for, the theory of linear algebraic groups, where connected groups with trivial unipotent radical are precisely the reductive groups.
Learning Objectives
- Prove : a unique maximal normal unipotent subgroup exists and is completely reducible.
- Identify the mechanism: Clifford's theorem plus force a normal unipotent subgroup to act trivially on composition factors.
- State with the correct reference class of modules.
- Prove : .
- Exhibit a linear group with that is not completely reducible.
- Compute , and for on a two-dimensional module over .
Definitions
- Normal unipotent subgroup
- with every element unipotent. In characteristic this means a normal -subgroup, by .
- Unipotent radical
- The unique maximal element of the set of normal unipotent subgroups of ; written here, and in the algebraic groups literature.
- The Jacobson radical of the finite-dimensional algebra ; a nilpotent ideal, equal to the set of elements annihilating every composition factor of .
- Composition factors of
- The simple subquotients in a -composition series of ; well defined up to isomorphism and order by Jordan–Hölder.
- Reductive
- Trivial unipotent radical, for a connected linear algebraic group. The analogue for abstract linear groups is the necessary condition .
The unipotent radical depends on the module V, not only on the abstract group G — except for finite groups in characteristic p, where it is always the largest normal p-subgroup.
Core Concepts
Why a largest normal unipotent subgroup exists
Define directly as the set of elements acting trivially on every composition factor of . This is the kernel of , so it is normal without argument, and it is unipotent because shifts each term of a composition series into the next, giving where is the length of .
The work is in showing contains every normal unipotent subgroup. That is where Clifford's theorem and Kolchin's theorem combine: restricted to a normal unipotent , each composition factor becomes semisimple; each of its simple -constituents is a subquotient of , hence carries a -potent action of with , hence is a line with trivial action by ; and a semisimple module all of whose constituents are trivial is itself trivial.
The radical of the span, in two lines
Let and let be the set of elements of annihilating every composition factor of . Then where is the length of , and is a faithful -module, so and ; the reverse inclusion is automatic because the composition factors are simple -modules. Hence , and follows immediately.
Key Results
Let be an arbitrary field, a finite-dimensional -vector space, and a linear group. Then has a unique maximal normal unipotent subgroup , called the unipotent radical of . Moreover is isomorphic to a completely reducible linear group over .
Let be the composition factors of as a -module (a composition series exists because ), and put
** is normal**, being a kernel. ** is unipotent**: fix a composition series ; for the operator maps into , so on .
** contains every normal unipotent subgroup.** Let be unipotent and let be any composition factor of . Then is a finite-dimensional simple -module, so by Clifford's Theorem the restriction is a semisimple -module. Each simple -constituent of is a subquotient of as a -module, so acts on it unipotently, and makes it one-dimensional with acting by the scalar . A semisimple module whose constituents are all trivial is trivial, so acts trivially on . As was arbitrary, .
The quotient. Put . By construction is the kernel of the representation , so embeds in as a linear group. Since is a direct sum of simple -modules, it is a semisimple -module, and is completely reducible.
With as above,
For a finite group in characteristic acting faithfully on , every simple -module occurs among the composition factors, so in that case is exactly the set of elements acting trivially on all simple -modules — the statement to be compared with .
The characterisation is about the composition factors of the given , not about all finite-dimensional irreducible representations of the abstract group . The discrete Heisenberg group is unipotent, so it is its own unipotent radical, and the composition factors of are three trivial modules; yet has irreducible -modules of every finite dimension , on which it acts faithfully. Those modules are not unipotent, so does not apply to them and they are irrelevant to .
Let with and . Then the unipotent radical of is
In particular, if is completely reducible then by and hence : triviality of the unipotent radical is a necessary condition for complete reducibility.
The composition factors of as a -module are exactly its composition factors as an -module, and they are simple -modules. Let , the intersection of their annihilators.
Then is clear, since is contained in the annihilator of every simple module and conversely annihilates the simple modules occurring. For the reverse inclusion: with a composition series of length , maps each term into the next, so ; since acts faithfully, , so is a nilpotent ideal and . Hence .
Now iff acts as the identity on each , iff for all , iff .
Let have characteristic and let be a finite group with and with no nontrivial normal -subgroup. Let with acting by left multiplication; the action is faithful, so .
By the normal unipotent subgroups of are exactly its normal -subgroups, so the unipotent radical is . But makes non-semisimple , so is not a semisimple -module and is not a completely reducible linear group.
Concretely, take , , : the only proper nontrivial normal subgroup of is of order , so , while has nonzero radical.
If is finite and , then for every faithful finite-dimensional representation the unipotent radical of equals , because normal unipotent subgroups are normal -subgroups by and this is a property of the abstract group. For infinite linear groups no such module-independence holds.
Proof Techniques and Method
How these proofs work, and which move to reuse.
The reusable pattern is define by an action, prove maximality by a restriction theorem. It is the same shape as the definition of as the annihilator of all simple modules: an invariant defined by what it does to representations is easier to prove maximal than one defined by an internal property such as nilpotence.
Worked Example
on a two-dimensional module over
Let , let permute , and let
Write for the images, so . In the basis , with and ,
Composition factors
The line is -invariant: , while in characteristic . So is the sign module. Since and , the quotient is the trivial module. These are the two composition factors.
The unipotent radical
By , consists of the elements acting trivially on both factors, i.e. of the kernel of the sign character: , of order . This agrees with the general principle for finite groups: .
The spanned algebra and its radical
From one gets , and a direct check gives . So spans , and these three are linearly independent, whence . Indeed is the algebra of all matrices preserving the line .
A one-dimensional square-zero ideal; .
Now check element by element. is nilpotent and lies in , so . For ,
eigenvalues and : not nilpotent, so and .
So , exactly as the composition factor computation gave. And since , says is not completely reducible on — consistent with and .
A trivial radical without complete reducibility
Change the field to and the module to , the regular module of dimension . Then , so the unipotent radical is trivial, yet divides and is not semisimple. The group is not completely reducible even though its unipotent radical vanishes.
Process and Workflow
What does the pair tell you?
Comparison and Classification
| Unipotent radical | Completely reducible? | |
|---|---|---|
| on | all of | no |
| on | no | |
| Borel on | no | |
| or on | yes — irreducible | |
| Diagonal group on | yes | |
| on the -dimensional module over | no | |
| on | no — the converse fails | |
| finite, | yes, by Maschke |
| sees normal unipotent part | sees gluing of factors | module independent | |
|---|---|---|---|
| Unipotent radical | yes | no | for finite only |
| yes | yes | no | |
| Composition factors of | partial | no | no |
| Complete reducibility | yes | yes | no |
What each invariant detects
Relationship Map
The unipotent radical sits between the trivial subgroup and the whole group, and its two descriptions bracket the algebra.
- , the unipotent radical of — largest normal unipotent subgroup
- equals
- when is finite and
- contains
- every normal unipotent subgroup of
- every normal -subgroup, in characteristic
- controls
- is completely reducible on
- is necessary for to be completely reducible
- does not control
- complete reducibility of on itself
- the algebra , which can be nonzero with
- equals
Applications and Industry Use
Applications here means where this structure is used — inside mathematics and in the engineering and computing disciplines that consume it.
Reductive groups
A connected linear algebraic group with trivial unipotent radical is reductive; the Levi decomposition writes a general group as a semidirect product of a reductive group by its unipotent radical. The entire classification of reductive groups by root data presupposes that the unipotent part has been quotiented away.
Parabolic subgroups and Eisenstein series
Parabolic subgroups have as their unipotent radical, and constant terms along are the basic operation in the theory of automorphic forms and the Langlands programme.
acts trivially on simple modules
For a finite group in characteristic , the unipotent radical of the regular representation is , and recovers the classical statement that acts trivially on every simple -module — the starting point of block theory and of the Green correspondence.
Structural decomposition of matrix groups
Algorithms that analyse a matrix group given by generators compute a composition series of the natural module, then the kernel of the action on the factors. That kernel is the unipotent radical, and it is the first splitting in the matrix group recognition project implemented in GAP and Magma.
Inside this collection the notion completes the analogy with ring theory begun by the Jacobson radical: an obstruction that is always defined, always normal, always quotient-able — and, as here, not always a complete answer.
Design Considerations
Design considerations here means the choices made when modelling a problem with these algebraic structures.
- Decide whether the group or the algebra is your object. If you need the gluing data, keep and its radical. If you need a normal subgroup to quotient by, take . They are not interchangeable.
- Fix the module before speaking of the radical. Except for finite groups in characteristic , the unipotent radical depends on ; the same abstract group can have trivial radical in one representation and be its own radical in another.
- Do not expect a Levi complement. For algebraic groups over a perfect field, Mostow's theorem provides a Levi decomposition; for an abstract linear group there is no reason for to split, and the extension must be handled on its own terms.
- **Use as a filter, not a certificate.** It is cheap to test and eliminates many groups, but a positive answer still requires computing to decide complete reducibility.
- Choose the characteristic deliberately. In characteristic a nontrivial unipotent radical is torsion-free and infinite; in characteristic it is a -group and may be finite. Which of these you want often determines the right field to work over.
Failure Modes and Common Mistakes
- Do not assume is generated by ; the containment can be strict, and that gap is exactly the case with nonzero radical.
- Do not confuse the unipotent radical with the solvable radical or with the Fitting subgroup; they agree in special cases only.
- Do not expect to be closed under passing to overgroups: a normal unipotent subgroup of need not be normal in a larger linear group containing .
- Do not conflate this with the unipotent radical of an algebraic group, which is defined as a closed connected normal unipotent subgroup; for abstract subgroups of no topology is involved.
Quick Reference
| Description | Best for | Reference |
|---|---|---|
| Largest normal unipotent subgroup | structural statements, quotients | |
| Trivial on all composition factors | computing from a composition series | |
| membership tests, machine computation | ||
| finite groups in characteristic | plus |
Frequently Asked Questions
Why is a trivial unipotent radical not enough for complete reducibility?
Because the unipotent radical is a group-level invariant and complete reducibility is a module-level one. The radical of records how the composition factors of are glued together; the subgroup records only those gluings realised by group elements of the form . When is a finite group with in characteristic dividing , the gluing is present and the subgroup is not: while .
Does the unipotent radical depend on the representation?
Yes in general, no for finite groups. For finite in characteristic , normal unipotent subgroups are exactly normal -subgroups by , so whatever the faithful module. For infinite groups the module matters: has trivial unipotent radical when acting by on and is its own unipotent radical when acting unitriangularly.
Is there a Levi decomposition ?
Not for abstract linear groups. For linear algebraic groups over a field of characteristic zero, Mostow's theorem provides a Levi decomposition, and in characteristic it can fail even there. The theorem proved here gives only that is completely reducible; the extension of by need not split.
How does this relate to the Jacobson radical of a group algebra?
For a finite group in characteristic , the augmentation ideal of generates a nilpotent ideal of contained in , which is why acts trivially on all simple modules. Corollary is the linear group version: is what the radical of contributes to the group. The correspondence is one-way, since the radical carries more information.
What is the unipotent radical of a Borel subgroup?
For , the full upper triangular group acting on , the composition factors are the coordinate lines, and an element acts trivially on all of them exactly when its diagonal entries are all . So , matching the algebraic groups definition where is the unipotent radical of the standard Borel and is the diagonal torus.
Can I compute from generators?
Yes. Spin up from the generators — at most basis elements — compute by a nullspace computation, and then . Equivalently, compute a composition series of with the MeatAxe and take the kernel of the induced action on the factors, which is how matrix group recognition software proceeds.
References
- T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §9 (pp. 161–162).
- J. E. Humphreys, Linear Algebraic Groups, Graduate Texts in Mathematics 21, Springer-Verlag, 1975, §19 and §30.
- A. Borel, Linear Algebraic Groups, 2nd enlarged edition, Graduate Texts in Mathematics 126, Springer-Verlag, 1991.
- C. W. Curtis and I. Reiner, Methods of Representation Theory, Volume I, Wiley-Interscience, 1981, §5 and §8.
- B. A. F. Wehrfritz, Infinite Linear Groups, Ergebnisse der Mathematik 76, Springer-Verlag, 1973.
- D. F. Holt, B. Eick and E. A. O'Brien, Handbook of Computational Group Theory, Chapman and Hall/CRC, 2005.
AI Suggested Questions
- State Mostow's theorem on Levi decompositions and explain what fails in characteristic p.
- Prove that the augmentation ideal of O_p(G) generates an ideal contained in the radical of kG for a finite group G.
- How do matrix group recognition algorithms in GAP and Magma compute the unipotent radical in practice?
- Compare the unipotent radical with the solvable radical and the Fitting subgroup for solvable linear groups.
- Give an infinite linear group whose unipotent radical is trivial but whose spanned algebra has nonzero radical.
- What is the unipotent radical of a parabolic subgroup of GL(n,k), and how does it appear in the theory of Eisenstein series?
- For which finite groups G and fields k of characteristic p is the regular module a faithful module with trivial unipotent radical and nonzero radical of the span?
