Executive Summary
Burnside's theorem. Let be algebraically closed, a nonzero finite-dimensional -vector space, and a -subalgebra acting irreducibly. Then , .
There is no room between irreducibility and everything. The statement is a rigidity theorem: the only way to be a proper subalgebra is to preserve a subspace. It fails over — the rotation algebra is the standard witness — and it fails in infinite dimension, where irreducibility buys only density.
Overview
Two questions sit behind this theorem. First: given a set of matrices, how big is the algebra they generate? Second: when is a simple module still simple after enlarging the field? Burnside's theorem answers both at once, and the answers are as clean as possible over an algebraically closed field.
The route is the Jacobson density theorem. A simple module over any ring makes dense in , where is a division ring by Schur's lemma. Two extra hypotheses collapse density into equality: algebraic closure forces , and finite dimension turns dense into onto.
For §9 the theorem is used in one specific way: it converts irreducible into *spans all of *, which is exactly the hypothesis the Trace Lemma needs. Everything Burnside proved about linear groups of bounded exponent runs through this conversion.
Learning Objectives
- State Burnside's theorem with the hypotheses , , .
- Prove it from Schur's lemma and the Jacobson density theorem.
- Prove that when is algebraically closed and .
- State the equivalence: absolutely irreducible onto simple with .
- Give the arbitrary-field form and identify in examples.
- Apply the theorem to show that a matrix semigroup acting irreducibly over spans .
Definitions
Let be a -algebra and a finite-dimensional -module, . Call absolutely irreducible if is a simple -module for every field extension . It is enough to test .
- Acts irreducibly
- and the only -invariant subspaces of are and ; equivalently is a simple -module.
- The centraliser: all -linear with . A division ring when is simple.
- For a multiplicatively closed subset of , the -span of — automatically a subalgebra.
- Dense subring
- is dense if for every -independent and arbitrary there is with .
- Split simple module
- A simple module whose centraliser is exactly ; the same thing as absolutely irreducible in finite dimension.
Subalgebras are assumed to contain the identity of End(V). For a subalgebra without identity the same statements hold provided the action is irreducible, since then RV = V.
Core Concepts
Why algebraic closure kills the centraliser
Let be a simple -module with , and . Since is a -algebra, the scalars lie in ; and , so .
Take . Then is a commutative subring of the division ring , finite-dimensional over and without zero divisors, hence a field, hence algebraic over . If is algebraically closed this forces , so is a scalar and .
From density to equality
The Jacobson density theorem says: if is a semisimple left -module and , then for any -independent and any targets there is with .
When , take to be a full -basis: every -linear map is then realised by some , so is onto. Density is an approximation statement; finite dimension removes the approximation.
The trace form as a certificate
Once , the nondegeneracy of becomes available on elements of the generating set: a matrix is determined by its traces against any basis, and the basis may be chosen inside a spanning multiplicative set. This is precisely the mechanism of the Trace Lemma .
Key Results
Let be an algebraically closed field, a -vector space with , and a -subalgebra acting irreducibly on . Then
is a simple -module, so is a division ring by Schur's lemma. As shown above, every generates a finite field extension of the algebraically closed field inside , so .
By the Jacobson density theorem is dense in . Since is finite, choose a -basis of ; density supplies, for each , an with for all , whence . Therefore .
Let be algebraically closed and let be closed under multiplication and act irreducibly on . Then ; in particular some elements of form a -basis of .
Indeed is a subalgebra with the same invariant subspaces as , so Burnside's theorem applies to it. This is the form used throughout §9.
Let be a -algebra and a nonzero -module with . The following are equivalent:
- is absolutely irreducible;
- the structure map is surjective;
- is a simple -module and .
In particular, over an algebraically closed field simple and absolutely irreducible coincide for finite-dimensional modules.
**(2) (1).** If is onto then so is for every extension , and is simple over . Hence is simple over .
**(1) (3).** Simplicity of is the case . Let , a division algebra with . If then is a nonzero finite-dimensional -algebra of dimension which is not a division ring — it contains zero divisors, being either split or non-reduced. But embeds in , which is a division ring by Schur if is simple. Contradiction; so .
**(3) (2).** is simple with centraliser , so by the density theorem is dense in , and finite dimension upgrades this to . (When this step is exactly Burnside's theorem.)
Let be any field, finite-dimensional over and nonzero, and a subalgebra acting irreducibly. Put , a division ring finite-dimensional over . Then
a full matrix ring over a division ring once a -basis of is chosen; and . Burnside's theorem is the case .
Take , , and
acts irreducibly — a nonzero -line is never stable under rotation by — yet . Here and reads , which is correct. The same phenomenon with gives .
If , irreducibility gives only density. For and the Weyl algebra in characteristic zero, is a simple faithful -module with centraliser , and is dense in but very far from equal to it — is countable-dimensional, is not.
Proof Techniques and Method
How these proofs work, and which move to reuse.
The reusable move is step 3: finite dimension makes centralisers algebraic. It is the same move that shows a finite-dimensional division algebra over an algebraically closed field is trivial, that a finite division ring is commutative in the Wedderburn argument, and that endomorphism rings of finite length modules are semiperfect.
Worked Example
The standard representation of spans all of
Let be a field and with permuting coordinates. Take the basis , . Writing matrices in this basis, and act by
Test whether is a basis of by listing coordinates in the order and taking the determinant:
Nonzero exactly when .
So for the four group elements already span : the module is absolutely irreducible, and confirms — over , over , over alike.
What goes wrong in characteristic 3
In characteristic the determinant vanishes, and the span drops to dimension . The reason is structural, not accidental: over the vector satisfies and therefore lies in , spanning a trivial submodule. is no longer simple, Burnside's theorem no longer applies, and is the -dimensional algebra of matrices stabilising that line — a non-semisimple algebra with one-dimensional radical.
Clock and shift: two matrices that generate everything
Let be algebraically closed with , let be a primitive th root of unity, and set and the cyclic shift (indices mod ). Then .
A subspace invariant under is a sum of eigenspaces, i.e. spanned by coordinate vectors; permutes the coordinate vectors in a single cycle; so no proper nonzero subspace is invariant under both. The action is irreducible, and Burnside gives — indeed the monomials form a basis.
Comparison and Classification
| Base field | |||
|---|---|---|---|
| any irreducible subalgebra of | — everything | ||
| rotations in | |||
| in | |||
| in | |||
| image of on the standard module | — everything | ||
| image of on the standard module | not applicable — reducible |
| algebraically closed | simple | ||
|---|---|---|---|
| is a division ring | no | no | yes |
| yes | yes | yes | |
| dense in | no | no | yes |
| no | yes | yes | |
| yes | yes | yes |
Which hypothesis each conclusion needs
Relationship Map
Burnside's theorem is a specialisation of the density theorem, and in turn specialises to the split case of Wedderburn–Artin.
- Jacobson density theorem — semisimple over , : is dense in
- add
- : the arbitrary-field Burnside
- for a division ring
- add as well
- , so : Burnside
- simple absolutely irreducible
- the Trace Lemma becomes applicable
- take V semisimple, R artinian
- Wedderburn–Artin structure theorem
- uniqueness of the simple factors
- add
Applications and Industry Use
Applications here means where this structure is used — inside mathematics and in the engineering and computing disciplines that consume it.
The trace method
Every finiteness theorem in §9 begins by replacing irreducible with *spans *. Without Burnside's theorem the Trace Lemma has no hypothesis it can use.
The MeatAxe
Parker's MeatAxe and Norton's irreducibility criterion decide whether a matrix module over a finite field is irreducible by searching for a singular element of the generated algebra with small kernel. The correctness of the criterion rests on the Burnside dichotomy: either a proper invariant subspace exists, or the algebra is everything.
Universality and controllability
A set of Hamiltonians or gates acting irreducibly on the state space generates the full operator algebra; operator controllability criteria in quantum control are stated exactly as irreducibility conditions, with Burnside's theorem supplying the equivalence.
Invariant subspaces
The Lomonosov–Rosenthal proof extends the statement to algebras of operators on Banach spaces, where it becomes a tool in the invariant subspace problem for algebras of compact-perturbation type.
Inside algebra the theorem is what makes character theory work over : the matrix coefficients of the irreducible representations of a finite group span the full matrix algebra of each block, and the Wedderburn decomposition is exactly Burnside's theorem applied blockwise.
Computational Notes
Computational notes cover algorithms, cost and library behaviour rather than manufacturing process.
Burnside's theorem converts a hard question (is this module irreducible?) into a linear algebra question (does the generated algebra have dimension ?) over an algebraically closed field. Both directions are used in practice.
- Spinning up the algebra. Given generators , maintain an echelonised basis of the algebra they generate: repeatedly multiply current basis elements by generators and reduce. The basis has at most elements; a straightforward implementation costs field operations, dominated by the reductions.
- Spinning up a submodule. Cheaper: from a vector , close under the generators. Cost . If the result is proper and nonzero, the module is reducible and no algebra computation is needed.
- Norton's criterion / MeatAxe. Pick a pseudo-random element of the algebra, factor its characteristic polynomial, and spin up kernel vectors of for irreducible factors . This finds a proper submodule with high probability, or certifies irreducibility. Implemented in GAP (
SMTXpackage), Magma and Sage. - Over non-closed fields. Irreducibility over does not imply absolute irreducibility; the MeatAxe computes the centraliser as well, and the module is absolutely irreducible precisely when that centraliser has dimension .
Failure Modes and Common Mistakes
- Do not conclude from irreducibility of a set of matrices without first checking closure under multiplication — the span of an arbitrary irreducible set need not be an algebra.
- Do not forget that is part of the statement; the zero module is vacuously without proper submodules and is not simple by convention.
- Do not assume that the composition factors of a non-simple module can be read off from the dimension of the span; the span only reveals the flag it preserves.
- Do not confuse Burnside's theorem on matrix algebras with Burnside's theorem or with the Burnside problems on torsion groups. All three are his.
Quick Reference
| Reference | Statement |
|---|---|
| Burnside: irreducible subalgebra over is | |
| Semigroup form: irreducible multiplicative set spans | |
| Arbitrary field: | |
| Absolute irreducibility surjective structure map | |
| Trace Lemma — the main consumer |
Frequently Asked Questions
Is Burnside's theorem just the density theorem?
It is the density theorem plus two hypotheses that each remove one gap. Density holds for any simple module over any ring and says approximates on finite sets. Finite -dimension makes approximation exact; algebraic closure identifies with . Neither is automatic, and each has its own counterexample — the Weyl algebra on , and inside .
How do I check absolute irreducibility in practice?
Compute the centraliser. Solve the linear system ; its solution space always contains the scalars, and the module is absolutely irreducible exactly when the space is one-dimensional. This is an nullspace computation and is what the MeatAxe implementations report.
Does the theorem hold for subalgebras without an identity element?
Yes, provided irreducibility is taken in the strong sense that is a simple module, in particular . Then is a nonzero submodule, so , and the density argument runs unchanged. The pathological case excluded is acting as zero on a one-dimensional space, which has no proper submodules but is not simple.
What replaces the theorem over a non-closed field?
: where is a division algebra, finite-dimensional over . The possible are governed by the Brauer group of ; over only , and occur, over a finite field only fields occur by Wedderburn's little theorem, so every irreducible module over a finite field has .
Why is this the right hypothesis for the Trace Lemma?
The Trace Lemma needs to pick elements of the group or semigroup itself forming a basis of , so that the coordinates are again traces of elements of . That is only possible if spans the full matrix algebra, which is precisely what Burnside's theorem delivers from irreducibility over .
Does irreducibility of a single matrix mean anything?
A single matrix generates a commutative algebra, and a commutative algebra acts irreducibly on a finite-dimensional space over only if that space is one-dimensional — by Burnside, is commutative only for . So irreducibility is intrinsically a statement about a non-commuting family; the clock and shift pair is the minimal interesting example.
References
- T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §7 and §9 (pp. 100–110, 149–162).
- N. Jacobson, Structure of Rings, American Mathematical Society Colloquium Publications 37, revised edition, 1964, Chapter II.
- W. Burnside, “On the condition of reducibility of any group of linear substitutions”, Proceedings of the London Mathematical Society (2) 3 (1905).
- V. Lomonosov and P. Rosenthal, “The simplest proof of Burnside's theorem on matrix algebras”, Linear Algebra and its Applications 383 (2004), 45–47.
- C. W. Curtis and I. Reiner, Representation Theory of Finite Groups and Associative Algebras, Wiley-Interscience, 1962, §27.
- D. F. Holt, B. Eick and E. A. O'Brien, Handbook of Computational Group Theory, Chapman and Hall/CRC, 2005, Chapter 7.
AI Suggested Questions
- Write out the Lomonosov-Rosenthal proof of Burnside's theorem and compare its hypotheses with the density-based proof.
- How does the Brauer group of a field constrain which division algebras can arise as centralisers of irreducible modules?
- Give the precise correctness argument for Norton's irreducibility criterion in the MeatAxe.
- What is the analogue of Burnside's theorem for Lie algebras of operators, and how does Lie's theorem relate to it?
- For which infinite-dimensional Banach space operator algebras does an irreducible algebra have to be dense in the strong operator topology?
- Show that the m squared monomials in the clock and shift matrices form a basis of the matrix algebra, and identify the resulting algebra structure.
- How is Burnside's theorem used to prove that the number of irreducible complex representations of a finite group equals the number of conjugacy classes?
