Executive Summary
Let be a semisimple left -module and let act on from the right, so is an -bimodule. The Density Theorem says the image of in is large: given any and any finitely many , some single satisfies for all .
This is a finite-interpolation statement, not a surjectivity statement. The image of need not be all of — but it is dense in for the finite topology, and it is all of once is finitely generated over . That last clause is the entire content of Wedderburn–Artin for left artinian simple rings.
Overview
Wedderburn–Artin classifies semisimple rings by declaring them to be finite products of matrix rings over division rings. That statement collapses without a chain condition. The Density Theorem is the replacement: it keeps the conclusion locally — on every finite set of vectors the ring behaves like a full matrix ring — and pays for the loss of chain conditions by weakening equality to approximation.
The setting is a bimodule . Two rings act on the same abelian group from opposite sides, and each is constrained by the other. Writing for the natural map, the theorem measures how much of the right-hand centraliser the left-hand ring can see.
Density: finitely many prescribed values can always be realised by a single ring element.
When is simple, Schur's Lemma makes a division ring, so is a right vector space and density becomes a statement of linear algebra: the image of is -transitive for every . That specialisation is what powers Primitive Rings and Primitive Ideals and the structure theorem discussed in Deriving Wedderburn–Artin from the Density Theorem.
Learning Objectives
- Set up the bimodule with acting on the right.
- State with full hypotheses and say exactly where semisimplicity of enters.
- Prove the stabilisation lemma using a projection as an element of .
- Reproduce the Bourbaki proof by transporting the problem to over .
- Deduce : is onto when is finitely generated.
- Interpret density as topological density in the finite topology on .
Definitions
Let and be rings and let be an -bimodule; write for the ring of endomorphisms of as a right -module, acting on the left. Then acts densely on if for every and every finite list there exists with for .
- The ring of -module endomorphisms of , written on the right of so that composition matches multiplication and becomes an -bimodule.
- The ring of additive maps on with for all ; it contains the image of and is the double centraliser of on .
- The natural map . Its kernel is , so is injective exactly when is faithful.
- Finite topology on
- Basic open sets are for finite families of vectors; a subring is dense in this topology precisely when it acts densely.
- -transitive
- For with a division ring: any linearly independent vectors can be sent to any prescribed vectors by a single element of .
Rings have identity and modules are unital. Semisimple module means a direct sum of simple submodules; simple modules are nonzero.
Core Concepts
Two centralisers, one abelian group
Fix a left -module and regard merely as an abelian group with endomorphism ring . The image sits inside it; is precisely the centraliser of ; and is the centraliser of . So is the double centraliser of , and always .
Density says that for semisimple the inclusion is as tight as it can be without being equality: no element of is distinguishable from an element of by finitely many test vectors. The bimodule viewpoint is developed further in Double Centralizers and Density for Bimodules.
Why the topology is the right language
Give the finite topology, in which a map is near when it agrees with on a prescribed finite set. Two maps that agree on every finite set agree everywhere, so the topology is Hausdorff, and the definition of dense action is exactly the statement that has closure . Density is therefore genuinely topological, not merely a figure of speech.
Semisimplicity is what makes submodules complemented
The proof needs one thing from the hypothesis on : every -submodule is a direct summand. A complement gives a projection, the projection is an -endomorphism, hence an element of , and elements of commute with by definition. That short chain is the whole mechanism — everything else in the proof is bookkeeping to reduce the general case to it.
Key Results
Let be a semisimple left -module, and . Then every -submodule satisfies for all ; that is, is an -submodule. Conversely every -submodule is an -submodule, since .
By semisimplicity choose an -submodule with , and let be the projection onto along . Since and are -submodules, is an -endomorphism, so ; writing on the right, . Now take . Right -linearity gives
For the converse, each lies in because for , by definition of as a ring of -endomorphisms.
Let be a ring and let be a semisimple left -module. Put , so that is an -bimodule. Then acts densely on : for every and every finite list there is an with for all .
Fix and . Work with , a finite direct sum of semisimple modules, hence semisimple. Its -endomorphism ring is a matrix ring over :
acting on the right of by for and .
**Step 1: lift to .** Define . Then , because for each coordinate ,
using only that is additive and right -linear.
Step 2: apply the Lemma. Let , the cyclic -submodule of generated by the given vector. By applied to the semisimple module , is stable under , hence under .
Step 3: read off the conclusion. Since has an identity, , so lies in . Thus there exists with for every .
With , , , as in : if is finitely generated as a right -module, then the natural map is onto. If moreover is faithful, is an isomorphism, so .
Let generate as a right -module and let . By pick with for all . Any can be written with , and both and are right -linear, so
Hence . The last sentence follows since .
Let be a simple left -module and , a division ring by Schur's Lemma. If is finite, then . If is infinite, is a proper dense subring of .
A simple module is semisimple, so applies. If then is finitely generated and makes onto; its kernel is and for an -dimensional right -space. The infinite-dimensional case is treated in the structure theorem : there cannot be all of because a surjection would force to be left artinian while the transitivity of the action produces a strictly descending chain of left ideals.
says nothing about . Applied to an arbitrary simple module it describes the primitive quotient rather than itself, which is exactly why left primitive ideals — treated in Primitive Rings and Primitive Ideals — are the right objects to carry the theory.
Proof Techniques and Method
How this proof works, and which moves transfer to other arguments.
A complement is an element of
Semisimplicity converts a submodule into an idempotent with . Anything commuting with then preserves automatically.
Diagonal embedding kills the quantifier
A statement about vectors in becomes a statement about one vector in . The cost is that is only semisimple — which is why the theorem is stated at that generality.
Cyclic submodule as a certificate
Membership of in is the existence of the required . Turning an existence claim into a submodule containment is the reusable trick.
Move 2 is due to Bourbaki and replaces Jacobson's original induction on the number of vectors. The older argument proves -transitivity by induction, and is worth knowing because it exposes what fails without semisimplicity; the Bourbaki form is shorter and coordinate-free.
A fourth habit is worth naming: always check on which side each ring acts. The proof uses and in consecutive lines, and both are definitional only if is written on the right.
Worked Example
The Weyl algebra acting on polynomials
Let be a field of characteristic and let be the first Weyl algebra. Let , with acting by multiplication and acting by formal differentiation . The relation holds: for ,
So really is a left -module.
Step 1 — is simple
Let be a submodule and pick of degree with leading coefficient . Then in characteristic , so contains a nonzero constant, hence , hence every . Thus .
Step 2 — the endomorphism ring is
Let and set . Commuting with multiplication by gives for every . Commuting with gives , so by characteristic . Hence and is an infinite-dimensional -space.
Step 3 — read the Density Theorem
now says: for any -linearly independent polynomials and any prescribed , there is a single differential operator with for all . Take , and the operators
Then and , while and . So behave as a dual basis for , and for prescribed targets the operator
Here and denote multiplication operators, i.e. the corresponding polynomials in inside .
Concretely with and : , and indeed while .
Process and Workflow
Step 4 is where density earns its keep in practice: most applications choose two or three vectors, obtain one ring element, and derive a contradiction or a construction from it. Lam's exercises on rings satisfying and on being a unit both run exactly this way.
Comparison and Classification
| Module | Conclusion | Is onto? | |
|---|---|---|---|
| Simple, | division ring | -transitive for all | yes: |
| Simple, infinite | division ring | -transitive for all | no — proper dense subring |
| Semisimple, finitely generated | any ring | finite interpolation | yes, by |
| Semisimple, not finitely generated | any ring | finite interpolation | not in general |
| Not semisimple | any ring | no conclusion | no — see the triangular example below |
| semisimple | simple | f.g. | faithful | |
|---|---|---|---|---|
| Submodules are -stable | yes | no | no | no |
| Density | yes | no | no | no |
| is a division ring | no | yes | no | no |
| onto | yes | no | yes | no |
| yes | no | yes | yes |
Which hypothesis each conclusion actually needs
Relationship Map
Density sits between Schur's Lemma, which supplies the division ring, and the structure theorem for left primitive rings, which consumes it.
- Density Theorem — semisimple ,
- specialises to
- Burnside's theorem: algebraically closed, , acting irreducibly
- Wedderburn–Artin for simple left artinian rings
- Artin–Whaples theorem for simple rings with centre
- requires
- semisimplicity of (used only through complements)
- taken as the full endomorphism ring
- an identity in , so that
- does not require
- any chain condition on
- faithfulness of
- commutativity or finite dimension anywhere
- specialises to
Applications and Industry Use
Applications here means where this structure is used — inside mathematics and in the engineering and computing disciplines that consume it.
Burnside and absolute irreducibility
If is an algebraically closed field, a finite-dimensional -space and a -subalgebra acting irreducibly, then and density forces . This is the standard test for absolute irreducibility of a representation.
MeatAxe and module recognition
Algorithms that decide irreducibility of a matrix module over a finite field work by spinning up vectors and computing the endomorphism algebra; density is the theoretical guarantee that an irreducible module of endomorphism ring is faithfully described by the full matrix algebra over .
Bicommutant analogy
Von Neumann's bicommutant theorem is the same shape: a self-adjoint algebra of operators is dense in its double commutant for a weak topology. The algebraic theorem is the purely ring-theoretic skeleton of that statement.
Differential operators
For the Weyl algebra acting on polynomials, density says any finite interpolation problem for linear maps is solvable by a differential operator — the algebraic backdrop to D-module implementations in computer algebra systems.
The honest summary: density is infrastructure inside algebra. Its downstream users are structure theorems, representation-theoretic tests and the algorithms built on them, not applications outside mathematics.
Computational Notes
Computational notes cover algorithms, cost and library behaviour rather than manufacturing process.
In the finite-dimensional setting the theorem is effective. Let be the algebra generated by given matrices over a field , acting on .
- Irreducibility. Spinning up a vector — repeatedly applying generators and reducing — decides whether the cyclic submodule is all of in field operations, and Norton's criterion turns one such computation into a full irreducibility test.
- The endomorphism ring. is the solution space of the linear system over the generators: equations in unknowns, solvable in naively and much faster in practice using a spun-up basis.
- Realising an interpolation. Given and targets, the element promised by density is found by linear algebra inside the spanning set of ; the cost is dominated by computing a basis of , which can have dimension up to .
- Infinite dimension. No general algorithm exists: for an arbitrary finitely presented ring even deciding whether a given module is simple is undecidable, so density is a theoretical guarantee only.
Failure Modes and Common Mistakes
- Do not read -transitivity as saying the vectors may be arbitrary: for -transitivity the source vectors must be linearly independent over . The target vectors are unrestricted.
- Do not assume the interpolating is unique — it is unique modulo the left ideal annihilating the chosen vectors, which is usually large.
- Do not confuse with ; they act on opposite sides and are almost never isomorphic.
- Do not apply the theorem to a module you have only shown to be indecomposable. Indecomposable is not semisimple.
Historical Notes and Lessons Learned
- 1905Burnside's irreducibility theoremBurnside proves that an irreducible algebra of matrices over an algebraically closed field is the full matrix algebra — the finite-dimensional shadow of density.
- 1929Von Neumann's bicommutant theoremIn operator algebras, a self-adjoint unital algebra of bounded operators is shown to be dense in its double commutant. The formal analogy with the algebraic statement is exact in shape if not in proof.
- 1945Jacobson's density theoremJacobson removes all finiteness assumptions, proving that a ring acting faithfully and irreducibly on a module acts densely relative to the endomorphism division ring, and builds the structure theory of primitive rings on it.
- 1954Chevalley's versionChevalley gives an independent treatment in his work on spinors, which is why the result carries both names.
- 1950sBourbaki's proofThe reduction to a cyclic submodule of over replaces the original induction on the number of vectors and is the version reproduced in most modern texts.
The methodological lesson is the same one the Jacobson radical teaches: define and prove things through the action on modules rather than through internal features of the ring. Chain conditions then become optional extras that sharpen a conclusion instead of prerequisites that make it possible.
Quick Reference
| You need | Quote | Hypotheses to verify |
|---|---|---|
| Finite interpolation | semisimple; is the full | |
| A surjection onto | as above, plus finitely generated | |
| + faithfulness | faithful simple, | |
| Stability of submodules | semisimple | |
| is a division ring | Schur's Lemma | simple |
Frequently Asked Questions
Why is the theorem stated for semisimple modules when the interesting case is a simple module?
Because the proof of the simple case runs through a module that is not simple. Bourbaki's argument replaces vectors in by one vector in , and is semisimple rather than simple. Stating for semisimple modules costs nothing and makes the proof self-contained.
Does density say the image of is all of ?
No. It says the image is dense in the finite topology: indistinguishable from the whole ring by any finite set of test vectors. Equality holds precisely when is finitely generated as a right -module, which is . The first Weyl algebra acting on is dense but very far from surjective.
What goes wrong if I use a smaller division ring in place of ?
Everything. Shrinking enlarges , so the target of the density statement grows while the image of stays put. The field acting on itself as a -dimensional real vector space is the standard warning: simple as a module, but a -dimensional subring of , hence not dense over .
Is there a right-handed version of the theorem?
Yes, and it is the same theorem read in . A semisimple right -module with acting on the left makes act densely on . What is genuinely asymmetric is not density but primitivity: a ring can have a faithful simple left module and no faithful simple right module.
Where exactly is semisimplicity used in the proof?
In exactly one line of : to produce a complement to the submodule , so that the projection onto is an -endomorphism and therefore an element of . Elements of commute with by definition, so they preserve . No other step uses the hypothesis.
Does the theorem need to have an identity?
The proof as given uses it once, to conclude that lies in the cyclic submodule . For rings without identity the statement is repaired by working with modules that are unital in the appropriate sense, but every result in this collection assumes an identity.
References
- T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §11, especially (11.15)–(11.17) (pp. 191–194).
- N. Jacobson, “Structure theory of simple rings without finiteness assumptions”, Transactions of the American Mathematical Society 57 (1945), 228–245.
- N. Jacobson, Structure of Rings, American Mathematical Society Colloquium Publications 37, revised edition, 1964.
- I. N. Herstein, Noncommutative Rings, Carus Mathematical Monographs 15, Mathematical Association of America, 1968, Chapter 2.
- F. W. Anderson and K. R. Fuller, Rings and Categories of Modules, 2nd edition, Graduate Texts in Mathematics 13, Springer-Verlag, 1992.
- L. H. Rowen, Ring Theory, Volume I, Academic Press, 1988, Chapter 2.
AI Suggested Questions
- Write out Jacobson's original induction proof of -transitivity and compare it with the Bourbaki argument.
- Show that is complete in the finite topology and identify the closure of an arbitrary subring.
- Derive Burnside's theorem on irreducible matrix algebras from the Density Theorem, with all hypotheses.
- Give an example of a simple module whose endomorphism division ring is noncommutative, and compute it.
- How does the Density Theorem specialise when is a group algebra and an irreducible representation?
- What is the precise relationship between the Jacobson Density Theorem and von Neumann's bicommutant theorem?
- For the Weyl algebra acting on , construct explicitly the operator sending three prescribed independent polynomials to three prescribed targets.
