← LibraryUnipotent Elements and the Lie–Kolchin–Suprunenko Theorem | KEVOS®Project Delivery · Project ManagementLesson 238/249← PrevNext →
ArticlePublished 9 Aug 202621 min readBy Kevin Jogin
Skip to content

Engineering Mathematics Advanced Linear groups

Unipotent Elements and Lie–Kolchin

An operator with a single eigenvalue λ is λ times a unipotent. A whole group of such operators can be put simultaneously into upper triangular form with constant diagonals — the Lie–Kolchin–Suprunenko theorem, valid over any field and in any characteristic.

Page ID
KEVOS-ENG-MATH-NCR-0072
Taxonomy
ENG / ENG-MATH
Collection
noncommutative-rings-core
Source
(9.16)–(9.21), §9 (pp. 158–161)
Reviewed
2026-08-08
Version
1.0.0

Executive Summary

A transformation g of an n-dimensional space is **λ-potent** if its characteristic polynomial is (tλ)n, that is, g=λ+g0 with g0 nilpotent. For λ=1 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, Gk×UTn(k). Nothing is assumed about k — no algebraic closure, no characteristic restriction — and nothing about G beyond λ-potency of its elements.

(tλ)nCharacteristic polynomial
qn(n1)/2|UTn(𝔽q)|
n1Nilpotency class
1948Kolchin

Overview

Unipotent elements are the part of a linear group that no amount of semisimplicity can absorb. In characteristic p they are exactly the p-elements (9.17), so a unipotent group is the infinite-field analogue of a p-subgroup of GLn(𝔽q); 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 UTn(k) is a maximal unipotent subgroup of GLn(k) and all such are conjugate — a Sylow theorem valid for infinite groups — and that every λ-potent group is nilpotent of class less than n.

Learning Objectives

  • State Definition (9.16) and show that a λ-potent g with λ0 is invertible, with g1 given by a finite geometric series.
  • Prove (9.17): over a field of characteristic p, unipotent p-element.
  • State (9.18) correctly, including the hypothesis that G 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 (9.19): Λ is a group, λ is a homomorphism, and maximal unipotent subgroups are conjugate to UTn(k).
  • Verify (9.20) that UTn(𝔽q) is a Sylow p-subgroup, and (9.21) that nilpotency class is at most n1.

Definitions

Definition(9.16)λ-potent and unipotent

Let k be a field, V an n-dimensional k-vector space and λk. A linear transformation gEndkV is **λ-potent** if g=λ+g0 with g0 nilpotent; equivalently, if its characteristic polynomial is (tλ)n.

*0-potent* means nilpotent, and *1-potent* is called unipotent. For a subset Λk×, a group GGL(V) is **Λ-potent** (with respect to a surjection λ:GΛ) if every gG is λ(g)-potent. When Λ={1}, G is a unipotent group.

Remarkλ-potent elements are invertible for λ ≠ 0

If g=λ+g0 with λ0 and g0m=0, then g=λ(1+λ1g0) and the geometric series terminates:

g1=λ1(1λ1g0+λ2g02+(1)m1λ(m1)g0m1).

So gGL(V), and g is λ-potent precisely when λ1g is unipotent. The unipotent case therefore carries all the content.

UTn(k)
Upper triangular matrices with all diagonal entries 1. A group under multiplication, and manifestly unipotent.
k×UTn(k)
Invertible upper triangular matrices with constant diagonal. A k×-potent group; every λ-potent group embeds in a conjugate of one of its subgroups.
Lower central series
G(1)=G, G(i+1)=[G,G(i)]. G is nilpotent of class r if G(r+1)=1G(r).
p-element
An element whose order is a finite power of p. In characteristic p these are exactly the unipotent elements of GL(V).
Borel subgroup
The full upper triangular group Bn(k); UTn(k) is its unipotent radical, and Bn/UTn 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 p-element, and only in characteristic p

In characteristic p the two notions coincide (9.17), because Frobenius makes (g1)ps=gps1 inside the commutative algebra k[g]. In characteristic zero the picture is opposite: a nontrivial unipotent g=1+g0 satisfies gm=1+mg0+(m2)g02+1 for m0, so unipotent groups are torsion-free.

chark=p>0:gps=1(g1)ps=0;chark=0:g unipotent,g1ord(g)=.
(9.17a)

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 V 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 g upper triangular, and λ-potency forces its diagonal entries all to equal λ(g).

every irreducible constituent is a lineV has a full G-invariant flagG is upper triangular in an adapted basisdiagonal entries all equal λ(g)Gk×UTn(k)

Traces do the work again

On a module where g acts λ(g)-potently, tr(g)=mλ(g) where m is the dimension. Restricting to the elements of determinant 1 forces λ(g)m=1, so only m traces occur and the Trace Lemma (9.3) bounds the group. Finiteness then collides with λ-potency and collapses the module to a line.

Key Results

Proposition(9.17)Unipotent = p-element in characteristic p

Let k be a field of characteristic p>0 and V finite-dimensional over k. Then gGL(V) is unipotent iff g is a p-element, i.e. ord(g)=ps for some s0. Consequently a linear group GGL(V) is unipotent iff it is a p-group.

Proof

If gps=1, then in the commutative ring k[g] of characteristic p we have (g1)ps=gps1ps=0, so g1 is nilpotent and g is unipotent.

Conversely let g=1+g0 with g0m=0. Choose s with psm. Then gps=(1+g0)ps=1+g0ps=1, so g has order a power of p.

Theorem(9.18)Lie–Kolchin–Suprunenko

Let k be a field, V0 with dimkV=n, and GGL(V) a λ-potent group with respect to a surjection λ:GΛk×. Then:

  1. if M is a finite-dimensional irreducible kG-module on which each gG acts as a λ(g)-potent operator — for example any composition factor of V — then dimkM=1 and g acts on M as the scalar λ(g);
  2. with respect to a suitable k-basis of V, Gk×UTn(k).

In the unipotent case Λ={1} this is Kolchin's theorem: a unipotent group is conjugate into UTn(k).

Proof

Step 1: (1) implies (2)

Take a kG-composition series V=V0V1Vt=0. Every factor Vi/Vi+1 is an irreducible kG-module on which G acts λ-potently, because the characteristic polynomial of g on a subquotient divides (tλ(g))n. By (1) each factor is one-dimensional, so t=n and a basis adapted to the flag makes every gG upper triangular. Since g is λ(g)-potent, its eigenvalues — the diagonal entries — all equal λ(g). Hence Gk×UTn(k).

Step 2: proof of (1) when k is algebraically closed

Let M be as in (1), m=dimkM. Replacing G by its image in GL(M) changes nothing: a λ(g)-potent operator determines λ(g) as its unique eigenvalue, so λ descends. Enlarge G to G~=k×G, still λ-potent with λ(cg)=cλ(g), and note M is still simple and Spank(G~)=Spank(G)=EndkM by Burnside's Theorem (7.3).

Let G~0={gG~:detg=1}. Because k is algebraically closed, every gG~ can be scaled into G~0, so G~=k×G~0 and hence Spank(G~0)=EndkM: the module M is absolutely irreducible over the semigroup G~0. For gG~0 we have λ(g)m=detg=1 and tr(g)=mλ(g), so at most m traces occur, and the Trace Lemma (9.3) gives |G~0|mm2<.

Now let gG~0 have finite order r prime to p=chark (every order if p=0). Then g satisfies both tr1, which is separable, and (tλ(g))m; their greatest common divisor is tλ(g), so g=λ(g)1 is a scalar.

If p=0 this makes G~0 — and hence G~ — consist of scalars, so EndkM=Spank(G~)=k and m=1. If p>0, let Z=G~0k×, a finite subgroup of k× and therefore of order prime to p. Every element of G~0/Z is a p-element by the previous paragraph, so G~0/Z is a finite p-group and G~0=ZP for a Sylow p-subgroup P, with Z central. Then Spank(P)=Spank(G~0)=EndkM, so M is absolutely irreducible over P; each element of P is λ-potent with λps=1, hence λ=1, hence unipotent with tr=m1. Only one trace occurs, so the Trace Lemma gives |P|1. Thus G~0=Z is scalar and again m=1.

Step 3: descent to an arbitrary field

Let M be as in (1) over an arbitrary k, with G acting faithfully, and let E=k¯. Steps 1 and 2 applied over E give an E-basis of MkE in which GE×UTm(E); so each gλ(g) is strictly upper triangular and any product of m of them vanishes. These operators are defined over k, so the vanishing holds over k.

Choose r1 minimal with (g1λ(g1))(grλ(gr))=0 for all g1,,grG. If r=1 then G consists of scalars, every subspace is a submodule, and simplicity gives m=1. If r2, minimality provides g2,,grG and vM with

w=(g2λ(g2))(grλ(gr))v0,

while (gλ(g))w=0 for every gG by minimality of r. Thus gw=λ(g)w, so kw is a nonzero kG-submodule of M, and simplicity forces M=kw and m=1.

Corollary(9.19)Consequences
  1. Λ is a subgroup of k× and λ:GΛ is a group homomorphism.
  2. Any unipotent subgroup of GLn(k) is conjugate in GLn(k) to a subgroup of UTn(k).
  3. UTn(k) is a maximal unipotent subgroup of GLn(k), and every maximal unipotent subgroup of GLn(k) is conjugate to UTn(k).

For (1) and (2), read off the conclusion of (9.18)(2): for g in k×UTn(k) the scalar λ(g) is the common diagonal entry, and gλ(g) is then visibly multiplicative.

Proof

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 G be maximal unipotent. By (2) there is ρGLn(k) with ρGρ1UTn(k). Since UTn(k) is unipotent and ρGρ1 is again maximal unipotent, ρGρ1=UTn(k). This shows simultaneously that every maximal unipotent subgroup is conjugate to UTn(k) and — since a conjugate of a maximal unipotent subgroup is maximal unipotent — that UTn(k) is itself maximal unipotent.

Remark(9.20)Sylow theory for GLn(𝔽q)

For q=pf,

|GLn(𝔽q)|=(qn1)(qnq)(qnq2)(qnqn1),|UTn(𝔽q)|=qn(n1)/2.

Writing qnqi=qi(qni1) shows the p-part of the order is q0+1++(n1)=qn(n1)/2. So UTn(𝔽q) is a Sylow p-subgroup, and (9.19)(3) is Sylow's conjugacy theorem for this one prime — but valid over every field, where no Sylow theory exists.

Corollary(9.21)Nilpotency

For n2, every λ-potent subgroup of GLn(k) is nilpotent of class at most n1.

Indeed UTn(k) is nilpotent of class exactly n1, and adjoining central scalars does not change the lower central series, since [k×UTn,k×UTn]=[UTn,UTn]. Now apply (9.18)(2). In characteristic p this generalises the fact that finite p-groups are nilpotent, via (9.17).

Proof Techniques and Method

How these proofs work, and which move to reuse.

Move 1

Triangularise via constituents

Simultaneous triangularisation is never proved directly. Prove instead that all irreducible constituents are lines; the flag and the basis follow formally.

Move 2

Normalise the determinant

Over an algebraically closed field, scaling by mth roots moves any group into the determinant-one subgroup without changing the spanned algebra. This is what makes the trace set finite.

Move 3

Descend by minimal vanishing product

To get from k¯ back to k, take the least r with all products of r operators gλ(g) vanishing. The vectors killed at level r1 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 m shifted operators vanish* is defined over k even though it was verified over k¯, so the minimal-length argument can be run over k.

Worked Example

UT3(𝔽2) as a Sylow subgroup

Take q=p=2, n=3. Then

|GL3(𝔽2)|=(81)(82)(84)=764=168=2337,|UT3(𝔽2)|=232/2=23=8.
(E.1)

So UT3(𝔽2) is a Sylow 2-subgroup of GL3(𝔽2), as (9.20) predicts. Which group of order 8 is it? Put N=E12+E23, so N2=E13 and N3=0, and let g=I+N. Then

g2=I+2N+N2=I+E13I,g4=(I+E13)2=I+2E13=I,
(E.2)

in characteristic 2; so g has order 4.

The group is nonabelian of order 8 with more than one involution — I+E12, I+E23 and I+E13 all square to the identity — so UT3(𝔽2)D4, the dihedral group of order 8. Its nilpotency class is 2=n1, matching (9.21) exactly.

A k×-potent group and its class

Let G={(ab0a):ak×,bk}GL2(k). Every element has characteristic polynomial (ta)2, so G is λ-potent with λ(ab0a)=a and Λ=k×.

Here (9.19)(1) is checked directly: λ is multiplicative because the product of two such matrices has diagonal aa. And (9.21) predicts nilpotency class at most n1=1, i.e. abelian — which is correct, since (ab0a)(ab0a)=(aaab+ab0aa) is symmetric in the two factors.

A group that is not λ-potent

In GL2() the elements A=(1101) and B=(1011) are each unipotent, but

BA=(1112),tr(BA)=3,det(BA)=1,
(E.3)

characteristic polynomial t23t+1, with distinct real roots (3±5)/2.

So BA is not λ-potent and A,B=SL2() is not a unipotent group — as it must not be, since it acts irreducibly on 2 and (9.18)(1) would otherwise force dim=1. Generated by unipotent elements is much weaker than unipotent.

Comparison and Classification

Unipotent elements across characteristics
Propertychark=0chark=p>0
g unipotent, g1infinite orderorder a power of p
Unipotent groupstorsion-freeexactly the p-groups (9.17)
UTn(k) finite?never for n2iff k is finite
Maximal unipotent subgroupsall conjugate to UTn(k)all conjugate to UTn(k)
Sylow interpretationnoneUTn(𝔽q) is a Sylow p-subgroup
Nilpotency classn1n1
Divisible?yes, and torsion-free (Exercise 9.4)no — every element has p-power order
Which groups are λ-potent, unipotent, or neither
unipotentλ-potentcompletely reducible
UTn(k), n2yesyesno
k×UTn(k)noyesno
Scalars k×Inoyesyes
Full upper triangular Bn(k)nonono
SL2() in GL2()nonoyes
Diagonal matrices, n2nonoyes

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.

GLn(k)all invertible transformations
Borel Bn(k)upper triangular; solvable
k×UTn(k)constant diagonal; λ-potent, nilpotent of class n1
UTn(k)unipotent radical of the Borel; maximal unipotent; Sylow p over 𝔽q
Any unipotent subgroupconjugate into UTn(k) by Kolchin (9.19)(2)
  • g unipotent (g1) nilpotent
    • equivalently
      • characteristic polynomial (t1)n
      • g is a p-element, if chark=p
      • g fixes a full flag with trivial action on the factors
    • implies
      • g1radSpank(G) when G is unipotent
      • tr(g)=n1k
      • detg=1
    • does not imply
      • that g,h is unipotent for another unipotent h
      • that g has finite order — false in characteristic 0

Applications and Industry Use

Applications here means where this structure is used — inside mathematics and in the engineering and computing disciplines that consume it.

Algebraic groups

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.

Differential Galois theory

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.

Finite group theory

Sylow subgroups of GLn(q)

(9.20) identifies the Sylow p-subgroup of GLn(𝔽q) explicitly as UTn(𝔽q), which is the starting point for the modular representation theory of groups of Lie type and for many computations in the classification programme.

Cryptography and computing

Unitriangular matrix groups

UTn(𝔽q) is a standard source of finite nilpotent p-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 (9.18)(1) 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.

Preferred notationUTn(k) for the unitriangular group (Lam)
Common variantsUn(k), Nn(k), 𝒰n; in algebraic groups U for the unipotent radical of a Borel B
Element terminologyunipotent is universal; *λ-potent* is Lam's; Suprunenko writes quasi-unipotent for related notions — check definitions before quoting
Lie sidea nilpotent endomorphism g0 corresponds to unipotent exp(g0) when chark=0 or chark>n
GAPSylowSubgroup(GL(n,q), p) returns a conjugate of the unitriangular group
MarkupPresentation MathML per ISO/IEC 40314; matrix and operator symbols per ISO 80000-2

Failure Modes and Common Mistakes

  • Do not assume λ is a homomorphism before proving the theorem — that is a consequence (9.19)(1), not part of the definition.
  • Do not expect UTn(k) 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 0: there UTn(k) is infinite and torsion-free, and no Sylow theory is in play.
  • Do not confuse nilpotent element (gm=0, hence not invertible) with unipotent element (g1 nilpotent, hence invertible).
  • Do not conclude from (9.19)(3) that all maximal unipotent subgroups of an arbitrary linear group G are conjugate; the statement is about GLn(k).

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 p where exponentials do not exist.

Quick Reference

λ-potentcharacteristic polynomial (tλ)n; g=λ+ nilpotent
Unipotentλ=1; equivalently a p-element when chark=p
(9.18)λ-potent group k×UTn(k) in a suitable basis
(9.19)(1)Λk× and λ is a homomorphism
(9.19)(3)maximal unipotent subgroups of GLn(k) are the conjugates of UTn(k)
(9.20)|UTn(𝔽q)|=qn(n1)/2, the p-part of |GLn(𝔽q)|
(9.21)class n1; UTn(k) has class exactly n1
Characteristic 0unipotent groups are torsion-free and divisible
Numbered results used on this page
ReferenceStatement
(9.16)definition of λ-potent and unipotent
(9.17)unipotent p-element in characteristic p
(9.18)Lie–Kolchin–Suprunenko triangularisation
(9.19)λ is a homomorphism; conjugacy of maximal unipotent subgroups
(9.20)orders of GLn(𝔽q) and UTn(𝔽q)
(9.21)nilpotency class at most n1
(9.3), (7.3)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 gλ(g) produces a common eigenvector defined over k. Contrast the Lie–Kolchin theorem for connected solvable algebraic groups, which genuinely needs algebraic closure.

Why is UTn(k) nilpotent of class exactly n1?

Write elements as 1+N with N strictly upper triangular. Commutators push the nonzero entries further from the diagonal: the ith term of the lower central series consists of matrices 1+N with N supported on the diagonals at distance at least i from the main one. Those vanish once the distance exceeds n1, and not before, as the matrices 1+E1,n witness. For n=2 the group is abelian, class 1.

How does this relate to the Sylow theorems?

Over 𝔽q with q=pf, (9.17) says unipotent means p-element and (9.20) says |UTn(𝔽q)| is exactly the p-part of |GLn(𝔽q)|. So (9.19)(3) specialises to Sylow's theorems for the prime p. 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: g is λ-potent with λ0 iff λ1g is unipotent. The subtlety is that the map gλ(g) is only proved to be a homomorphism after the theorem, so one cannot simply factor G as scalars times a unipotent group at the outset.

What happens for a group of nilpotent — that is 0-potent — elements?

Nothing, because such elements are not invertible and cannot form a group inside GL(V). 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. SLn(k) 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 G is a p-group in characteristic p.

References

  1. T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §9 (pp. 158–161).
  2. E. R. Kolchin, “Algebraic matric groups and the Picard-Vessiot theory of homogeneous linear ordinary differential equations”, Annals of Mathematics 49 (1948), 1–42.
  3. J. E. Humphreys, Linear Algebraic Groups, Graduate Texts in Mathematics 21, Springer-Verlag, 1975, §17.
  4. D. A. Suprunenko, Matrix Groups, Translations of Mathematical Monographs 45, American Mathematical Society, 1976.
  5. B. A. F. Wehrfritz, Infinite Linear Groups, Ergebnisse der Mathematik 76, Springer-Verlag, 1973, Chapter 1.
  6. 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?
Page
KEVOS-ENG-MATH-NCR-0072
Path
Engineering / Mathematics
Template
kevos-knowledge-article-v2
KEVOS® Knowledge Library — reviewed 2026-08-08

Continue learning

Absolutely Irreducible Modules and Schur’s Lemma over a Field | KEVOS®Article · Project ManagementAlgebraic and Geometric Multiplicities of Eigenvalues | KEVOS® MathematicsArticle · Project ManagementAmitsur’s Theorem on the Radical of a Polynomial Ring | KEVOS®Article · Project ManagementAmitsur’s Theorem on the Radical of an Algebra of Small Dimension | KEVOS®Article · Project Management