The Jacobson and Herstein Commutativity Theorems

Q: Why is Wedderburn's Little Theorem not simply a corollary of Jacobson's theorem?

Formally it is: a finite division ring D satisfies a^|D| = a, and (12.10) then gives commutativity. But the proof of (12.10) passes through the division-ring case of (12.9), whose proof uses Wedderburn's theorem. The derivation is therefore circular, and Lam says so explicitly. Wedderburn must be proved independently, as it is in §13.

Q: Does the exponent in () have to be bounded?

No, and this is the strength of the result. The integer n(a,b) may vary arbitrarily with the pair. Uniform-exponent versions are easier — they can often be attacked by polynomial identity methods — but they are strictly weaker statements.

Q: Why is M_2(k) enough to rule out, rather than all M_m(k)?

The matrix-unit computation is uniform: in M_m(k) with m ≥ 2 the pair E_11, E_12 already violates all three conditions, so no separate argument is needed for larger m. What m = 2 specifically rules out is the non-artinian branch of (11.19), which supplies a subring of R mapping onto M_2(k); once that branch is closed, R ≅ M_n(k) and the same computation forces n = 1.

Executive Summary

A ring is commutative when every additive commutator vanishes. The commutativity theorems replace that demand by something far weaker — each commutator merely satisfies some equation $d^{n} = d$ with $n > 1$ — and conclude the same thing. Lam's $(12.9)$ is the sharpest version in this section, and $(12.10)$ , Jacobson's original theorem, is a special case.

The interest is as much in the method as in the statement. The proof never argues inside $R$ ; it climbs the ladder of $(12.8)$ , checking the hypothesis on division rings, transporting it to left primitive rings via the Density Theorem, to semiprimitive rings via the subdirect decomposition $(12.5)$ , and finally across $rad R$ . The last rung is where such arguments usually fail, and $(12.11)$ shows exactly how.

$d^{n} = d$ Hypothesis on commutators

4Rungs of the ladder

$M_{2} (k)$ The obstruction that fails it

1905Wedderburn, the base case

Overview

Chart $(12.8)$ organises the structure theory of §§10–12 into a route. Each arrow is a theorem proved earlier, and each rung is a class of rings strictly larger than the one below it.

Division rings and their matrix ringsLeft primitive ringsSemiprimitive ringsAll rings, modulo

rad R

The arrows are: the Structure Theorem for left primitive rings $(11.19)$ , which is the Density Theorem in usable form; the subdirect decomposition $(12.5)$ (b) of semiprimitive rings into left primitive factors; and finally the passage from $R$ to $R / rad R$ . Only the last of these is a genuine gamble — the first three are automatic once the hypothesis is inherited by subrings, quotients and products.

The base case is not proved in §12: the truth of the Jacobson–Herstein condition for division rings is deferred to Lam's $(13.9)$ , and the two Herstein–Kaplansky conditions to $(13.5)$ and $(15.15)$ . What this page contributes is the reduction, which is where the subdirect product machinery earns its place.

Learning Objectives

State $(12.9)$ with the correct quantifier on $n (a, b)$ .
Show $M_{m} (k)$ fails the condition for every $m \geq 2$ and every division ring $k$ .
Reconstruct Step 1: a left primitive ring satisfying the condition is a division ring.
Reconstruct Step 3: lift commutativity across $rad R$ using $1 + rad R \subseteq U (R)$ .
State the Herstein–Kaplansky equivalences $(12.11)$ and their semiprimitive hypothesis.
Explain the two counterexamples that stop $(12.11)$ from extending to all rings.

Definitions

Condition $(*)$: For all $a, b \in R$ there is an integer $n = n (a, b) > 1$ with $(a b - b a)^{n} = a b - b a$ . The exponent may depend on the pair; no uniform bound is assumed.
Condition (2) of $(12.11)$: $a b - b a \in Z (R)$ for all $a, b \in R$ ; equivalently every additive commutator is central.
Condition (3) of $(12.11)$: For each $a \in R$ there is $n = n (a) > 1$ with $a^{n} \in Z (R)$ .
$Z (R)$: The centre ${z \in R : z r = r z \forall r \in R}$ , a commutative subring containing $1$ .
$U (R)$: The unit group. The lifting step uses only $1 + rad R \subseteq U (R)$ .

All three conditions are inherited by subrings and by homomorphic images — the property that makes the reduction ladder usable at all.

Core Concepts

Why $M_{m} (k)$ is the universal obstruction

Every rung of the ladder is crossed by ruling out matrix rings of size at least $2$ . The computation is the same in all three commutativity theorems and uses only the matrix units.

a = E_{11}, b = E_{12} ⟹ a b = E_{12}, b a = 0, a b - b a = E_{12}, E_{12}^{2} = 0 .

(12.9)

So $(a b - b a)^{n} = 0 \neq a b - b a$ for every $n \geq 2$ : condition $(*)$ fails in $M_{m} (k)$ for all $m \geq 2$ and every nonzero ring $k$ .

The same pair kills conditions (2) and (3): $a b - b a = E_{12}$ is not central in $M_{m} (k)$ when $m \geq 2$ , and $a^{n} = E_{11}^{n} = E_{11}$ is not central either. One computation, three theorems.

From the obstruction to a division ring

By the Structure Theorem $(11.19)$ , a left primitive ring $R$ with faithful simple module $V$ and division ring $k = End (_{R} V)$ is either $M_{n} (k)$ with $n = \dim_{k} V$ finite, or else, for every $n$ , contains a subring $R_{n}$ mapping onto $M_{n} (k)$ . A hypothesis inherited by subrings and quotients therefore has to hold in $M_{n} (k)$ in every case with $n \geq 2$ . Ruling that out leaves only $n = 1$ , i.e. $R ≅ k$ .

The last rung: what makes a hypothesis liftable

Once $R / rad R$ is known to be commutative, every commutator $d = a b - b a$ lies in $rad R$ . Condition $(*)$ then supplies an equation satisfied by $d$ , namely $d (1 - d^{n - 1}) = 0$ with $d^{n - 1} \in rad R$ , and $1 - d^{n - 1}$ is a unit. Conditions (2) and (3) supply no equation at all — only membership in $Z (R)$ — and that is precisely why $(12.11)$ stops at semiprimitive rings.

Key Results

Theorem(12.9)Jacobson–Herstein

A ring $R$ is commutative iff it satisfies $(*)$ : for all $a, b \in R$ there exists an integer $n = n (a, b) > 1$ with

(a b - b a)^{n (a, b)} = a b - b a .

The exponent is allowed to depend on the pair $(a, b)$ ; no uniform bound and no chain condition is assumed.

Proof

The only if direction is trivial: in a commutative ring $a b - b a = 0$ and $0^{2} = 0$ . For the converse, note first that $(*)$ is inherited by subrings and by homomorphic images, since it is a condition on pairs of elements expressed by an equation.

Step 0 (base case). The theorem holds for division rings. This is Lam's $(13.9)$ , proved in the next chapter; Wedderburn's Little Theorem on finite division rings is used in its proof.

Step 1 (left primitive rings). Let $R$ be left primitive and satisfy $(*)$ , and let $k$ be the division ring furnished by $(11.19)$ . If $R$ were not left artinian, it would contain a subring mapping onto $M_{2} (k)$ , and $(*)$ would descend to $M_{2} (k)$ — impossible by the matrix-unit computation. So $R ≅ M_{n} (k)$ , and $n \geq 2$ is impossible for the same reason. Hence $n = 1$ and $R ≅ k$ is a division ring, so Step 0 applies and $R$ is commutative.

Step 2 (semiprimitive rings). Let $R$ be semiprimitive and satisfy $(*)$ . By $(12.5)$ (b) there is a subdirect representation $R ↪ \prod_{i} R_{i}$ with each $R_{i}$ left primitive. Each $R_{i}$ is a homomorphic image of $R$ , hence satisfies $(*)$ , hence is commutative by Step 1. A subring of a product of commutative rings is commutative, so $R$ is commutative.

Step 3 (all rings). Let $R$ satisfy $(*)$ . Then $R / rad R$ satisfies $(*)$ and is semiprimitive, so it is commutative by Step 2. Given $a, b \in R$ , the commutator $d = a b - b a$ therefore lies in $rad R$ . Choose $n = n (a, b) > 1$ with $d^{n} = d$ , i.e. $d (1 - d^{n - 1}) = 0$ . Since $n - 1 \geq 1$ we have $d^{n - 1} \in rad R$ , so $1 - d^{n - 1} \in 1 + rad R \subseteq U (R)$ . Multiplying by its inverse gives $d = 0$ . As $a, b$ were arbitrary, $R$ is commutative.

Corollary(12.10)Jacobson

Let $R$ be a ring such that for every $a \in R$ there is an integer $n = n (a) > 1$ with $a^{n} = a$ . Then $R$ is commutative.

Proof

Apply the hypothesis to the single element $d = a b - b a$ : there is $n (d) > 1$ with $d^{n (d)} = d$ , which is exactly condition $(*)$ for the pair $(a, b)$ . Now $(12.9)$ applies.

Theorem(12.11)Herstein, Kaplansky

Let $R$ be a semiprimitive ring. The following are equivalent:

$R$ is commutative;
$a b - b a \in Z (R)$ for all $a, b \in R$ ;
for each $a \in R$ there is an integer $n = n (a) > 1$ with $a^{n} \in Z (R)$ .

The hypothesis $rad R = 0$ cannot be removed from either non-trivial implication.

Proof

(1) implies (2) and (3) trivially. For the converses, conditions (2) and (3) are inherited by subrings and by homomorphic images, so Steps 1 and 2 of $(12.9)$ apply verbatim once two things are known.

First, neither condition can hold in $M_{m} (k)$ for $m \geq 2$ and $k$ any nonzero ring: with $a = E_{11}$ and $b = E_{12}$ we get $a b - b a = E_{12} \notin Z (M_{m} (k))$ , and $a^{n} = E_{11} \notin Z (M_{m} (k))$ for every $n \geq 1$ . Hence a left primitive ring satisfying (2) or (3) is a division ring.

Second, the division ring case: (2) $\Rightarrow$ (1) is Lam's $(13.5)$ and (3) $\Rightarrow$ (1) is $(15.15)$ , both proved later in the text. Granting those, Step 1 gives commutativity for left primitive rings and Step 2 transports it to semiprimitive rings through the subdirect representation of $(12.5)$ (b). Note that Step 3 is not available here, which is why the theorem is stated only for semiprimitive rings.

RemarkHerstein's improvement

Lam records that Herstein proved the implication (3) $\Rightarrow$ (1) already for semiprime rings, a hypothesis strictly weaker than semiprimitive. The counterexample below is not semiprime, so there is no conflict.

Proof Techniques and Method

The reduction ladder of (12.8), stated as a procedure.

Check heredityVerify the hypothesis passes to subrings and to homomorphic images. If it does not, the ladder cannot be climbed at all.

Kill the matrix ringsShow

M_{m} (k)

fails the hypothesis for

m \geq 2

. With

(11.19)

this collapses every left primitive example to a division ring.

Settle division ringsProve the statement for division rings by hand. This is the only genuinely hard mathematics, and in §12 it is deferred to Chapter 5.

Spread by subdirect productsUse

(12.5)

(b): a semiprimitive ring embeds in a product of left primitive quotients, each of which inherits the hypothesis.

Attempt the liftAsk whether the conclusion for

R / rad R

forces it for

R

. This needs an equation, not merely a membership condition.

A useful diagnostic: the hypothesis of $(12.9)$ constrains the commutator by an equation $d^{n} = d$ , and inside $rad R$ the factor $1 - d^{n - 1}$ is automatically invertible. Conditions of the form *this element lies in $Z (R)$ * impose nothing inside the radical, because a radical element can be central and nonzero.

Worked Example

Boolean rings: Jacobson's theorem with $n = 2$

Let $R$ satisfy $a^{2} = a$ for all $a$ . Then $(12.10)$ predicts commutativity, and one can see it directly. From $(a + a)^{2} = a + a$ we get $4 a = 2 a$ , so $2 a = 0$ and $R$ has characteristic $2$ . From $(a + b)^{2} = a + b$ we get $a b + b a = 0$ , so $a b = - b a = b a$ . The general theorem replaces this ad hoc computation by the ladder.

A finite field check

In $𝔽_{q}$ every element satisfies $a^{q} = a$ , with $q > 1$ , so $(12.10)$ returns commutativity — correctly, and consistently with Wedderburn's Little Theorem, which says a finite division ring is a field. Lam is explicit that this is not a new proof of Wedderburn: the division-ring case of $(12.9)$ is proved using Wedderburn's result.

Counterexample to (2) $\Rightarrow$ (1) without semiprimitivity

Let $k$ be a field and take the $4$ -dimensional algebra

R = {(\begin{matrix} x & y & z \\ 0 & x & w \\ 0 & 0 & x \end{matrix}) : x, y, z, w \in k} = k \cdot 1 \oplus (k E_{12} + k E_{13} + k E_{23}) .

(E.1)

A direct computation gives $[α E_{12} + β E_{13} + γ E_{23}, α' E_{12} + β' E_{13} + γ' E_{23}] = (α γ' - γ α') E_{13}$ , and $E_{13}$ annihilates and is annihilated by every strictly upper triangular matrix here, so $E_{13} \in Z (R)$ . Hence every additive commutator in $R$ is central: condition (2) holds.

Yet $R$ is not commutative: $E_{12} E_{23} = E_{13}$ while $E_{23} E_{12} = 0$ . There is no contradiction with $(12.11)$ because $rad R$ is the $3$ -dimensional space of strictly upper triangular matrices, with $R / rad R ≅ k$ ; the ring is local, not semiprimitive.

Counterexample to (3) $\Rightarrow$ (1) without semiprimitivity

Let $G$ be a noncommutative finite $p$ -group and $R = 𝔽_{p} G$ ; the smallest instance is $𝔽_{2} D_{8}$ , of dimension $8$ . Then $R$ is noncommutative, and by $(8.8)$ its Jacobson radical $J$ is the augmentation ideal, with $J^{| G |} = 0$ .

Take $a \in R$ and put $n = | G | = p^{m}$ . If $a \in J$ then $a^{n} = 0 \in Z (R)$ . If $a \notin J$ , then since $R / J ≅ 𝔽_{p}$ there is $r \in 𝔽_{p}$ with $a - r \in J$ ; as $r$ is central and the characteristic is $p$ ,

a^{n} = (r + (a - r))^{p^{m}} = r^{p^{m}} + (a - r)^{p^{m}} = r \in 𝔽_{p} \subseteq Z (R) .

(E.2)

The middle equality is the Frobenius expansion, legitimate because $r$ is central; the last uses $(a - r)^{| G |} = 0$ and $r^{p} = r$ in $𝔽_{p}$ .

Process and Workflow

I have a hypothesis $P$ and want to prove it forces commutativity. What can I expect?

$P$ fails in $M_{2} (k)$ and passes to subrings and quotientsThe ladder reduces you to division rings. Everything now depends on the division-ring case, which is a separate and usually harder problem.

$P$ is an equation in the commutatorExpect the result to lift across

rad R

and hold for all rings, as in

(12.9)

. Check that the relevant factor lies in

1 + rad R

$P$ is a membership condition such as centralityExpect the result only for semiprimitive rings, as in

(12.11)

, and look for a local counterexample built from a nilpotent ideal.

$P$ holds in $M_{2} (k)$ The ladder gives nothing — a matrix ring over a field already violates the conclusion. Polynomial identity theory, not this method, is the correct tool.

The third branch is worth internalising. When only a semiprimitive statement is available, the honest form of the result is *a statement about $R / rad R$ *, and the correct next question is whether the radical can be controlled by other means, for instance by nilpotence or by a chain condition.

Comparison and Classification

Behaviour of the four hypotheses under the reduction ladder
	Holds in $M_{2} (k)$	Passes to subrings	Passes to quotients	Lifts across $rad R$
$(a b - b a)^{n} = a b - b a$	no	yes	yes	yes
$a^{n} = a$	no	yes	yes	yes
$a b - b a \in Z (R)$	no	yes	yes	no
$a^{n} \in Z (R)$	no	yes	yes	no

Behaviour of the four hypotheses under the reduction ladder

The three theorems side by side
Result	Hypothesis on $R$	Condition	Conclusion
(12.9) Jacobson–Herstein	none	$(a b - b a)^{n (a, b)} = a b - b a$ , $n > 1$	$R$ commutative
(12.10) Jacobson	none	$a^{n (a)} = a$ , $n > 1$	$R$ commutative
(12.11)(2) Herstein–Kaplansky	semiprimitive	$a b - b a \in Z (R)$	$R$ commutative
(12.11)(3) Herstein–Kaplansky	semiprimitive (semiprime suffices)	$a^{n (a)} \in Z (R)$ , $n > 1$	$R$ commutative

The last row records Herstein's sharpening, which Lam mentions in a footnote: for condition (3) the semiprime hypothesis is already enough.

Relationship Map

The logical dependencies among the results in this circle are worth keeping straight, because several of them look circular and one nearly is.

Base

Wedderburn's Little Theorem

Every finite division ring is a field. Proved independently in §13; it is an ingredient in the division-ring case of $(12.9)$ , not a consequence of it.

Engine

Density and subdirect products

$(11.19)$ turns primitive rings into matrix rings over division rings; $(12.5)$ (b) turns semiprimitive rings into products of primitive ones.

Output

Commutativity theorems

$(12.9)$ – $(12.11)$ , plus a long list of relatives in the literature proved by the same route.

** $(12.10)$ follows from $(12.9)$ ** by applying the hypothesis to the commutator; the converse implication is false as stated, since $(*)$ constrains only commutators.
** $(12.10)$ implies Wedderburn formally** — a finite division ring $D$ satisfies $a^{| D |} = a$ — but the implication is not a proof, because Wedderburn is used upstream.
** $(12.9)$ is unavailable to $(12.11)$ **: centrality of commutators does not produce the equation needed for Step 3.
Kaplansky's PI theory proves a different kind of statement by the same ladder, replacing *fails in $M_{2} (k)$ * by satisfies a polynomial identity of low degree.

Applications and Industry Use

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

Finite algebra

Recognising commutative structure

Jacobson's theorem is the standard tool for proving a finite or torsion algebra is commutative from an identity satisfied by its elements. It is how one shows a finite ring with $a^{n} = a$ is a finite product of finite fields.

Coding theory

Rings behind cyclic codes

Codes are usually built over finite commutative rings. Jacobson's theorem explains why the natural conditions imposed on a finite coefficient ring — every element a root of $x^{n} = x$ — already force commutativity, so no noncommutative alternative is hiding.

PI theory

The template for Kaplansky

Kaplansky's theorem on primitive rings satisfying a polynomial identity is proved by exactly this reduction, and it is the foundation of the structure theory of PI-rings used in invariant theory and in the study of Azumaya algebras.

Symbolic computation

Deciding commutativity

For a finite-dimensional algebra given by structure constants, the ladder is effective: compute $rad A$ , decompose $A / rad A$ into matrix blocks, and read commutativity off the block sizes. This is how CAS implementations answer the question.

The honest summary: these theorems are used less for their statements than for their method. The reduction ladder is the standard way to prove any elementwise hypothesis forces a global structural conclusion, and it is reused throughout the literature on rings with conditions on elements.

Failure Modes and Common Mistakes

Do not assume Step 2 needs the factors to be finite in number or the product to be small — subdirectness alone is enough, since commutativity is inherited by subrings.
Do not forget that $n > 1$ ; with $n = 1$ the condition $d^{1} = d$ is vacuous and the theorem would be false.
Do not apply the ladder to a hypothesis that survives in $M_{2} (k)$ — for instance finite dimensionality — since Step 1 then yields nothing.
Do not conflate $Z (R)$ with $rad R$ : a nonzero central element in the radical is exactly what breaks the lifting step.

Best Practices

Before invoking a commutativity theorem, check whether it is stated for all rings or only for semiprimitive ones; the two are genuinely different results.
When designing a hypothesis, prefer equations to membership conditions if you want the conclusion to lift across the radical.
Verify the matrix-ring obstruction first — it is the cheapest possible test of whether the ladder can be climbed.
State the dependence of the exponent on the elements explicitly; theorems with uniform exponents are strictly weaker and easier.

Historical Notes and Lessons Learned

1905Wedderburn's Little TheoremEvery finite division ring is commutative. It is the base case on which all later commutativity theorems for division rings are built.
1945Jacobson's theoremJacobson proves that $a^{n (a)} = a$ for all $a$ forces commutativity, in his work on algebraic algebras of bounded degree. The radical and the density theorem, both new at the time, are the tools.
1948Kaplansky and polynomial identitiesKaplansky's study of rings satisfying a polynomial identity establishes the same reduction pattern — kill matrix rings, use density, then subdirect products — as a general technique.
early 1950sHerstein's generalisationsHerstein produces a sequence of commutativity theorems weakening the hypothesis from elements to commutators, culminating in the form $(12.9)$ stated here.
1968ConsolidationHerstein's Carus monograph collects the commutativity theorems and their proofs, establishing the reduction ladder as a standard method rather than a sequence of tricks.

The lesson is about where difficulty concentrates. Over sixty years the general ring-theoretic machinery became routine, and the hard content migrated entirely into the division-ring case — which is why Lam can present $(12.9)$ in §12 while deferring its only substantial step to §13.

Quick Reference

(12.9)

(a b - b a)^{n (a, b)} = a b - b a

n > 1

, for all

a, b

\Rightarrow

R

commutative

(12.10)

a^{n (a)} = a

n > 1

, for all

a

\Rightarrow

R

commutative

(12.11)

R

semiprimitive: commutative

iff

commutators central

iff

some

a^{n} \in Z (R)

Obstruction

E_{11} E_{12} - E_{12} E_{11} = E_{12}

, and

E_{12}^{2} = 0

Rung 1

(11.19)

: primitive plus no

M_{2} (k)

inside

\Rightarrow

division ring

Rung 2

(12.5)

(b): semiprimitive

\Rightarrow

subdirect product of primitive rings

Rung 3

d \in rad R

and

d (1 - d^{n - 1}) = 0

\Rightarrow

d = 0

Counterexamples

k \cdot 1 \oplus (k E_{12} + k E_{13} + k E_{23})

;

𝔽_{2} D_{8}

Where each step is proved
Step	Content	Reference in Lam
Base case	$(*)$ forces a division ring to be commutative	(13.9)
Base case (2)	central commutators in a division ring	(13.5)
Base case (3)	$a^{n}$ central in a division ring	(15.15)
Primitive rings	structure theorem and the matrix obstruction	(11.19)
Semiprimitive rings	subdirect decomposition into primitive factors	(12.5)
Lifting	$1 + rad R \subseteq U (R)$	(4.5)

Frequently Asked Questions

Why is Wedderburn's Little Theorem not simply a corollary of Jacobson's theorem?

Formally it is: a finite division ring $D$ satisfies $a^{| D |} = a$ , and $(12.10)$ then gives commutativity. But the proof of $(12.10)$ passes through the division-ring case of $(12.9)$ , whose proof uses Wedderburn's theorem. The derivation is therefore circular, and Lam says so explicitly. Wedderburn must be proved independently, as it is in §13.

Where exactly does the semiprimitive hypothesis enter

(12.11)

Only in the absence of Step 3. Steps 1 and 2 need nothing beyond heredity of the condition and its failure in $M_{2} (k)$ , and they deliver the conclusion for every semiprimitive ring. What is missing is a way to conclude from commutators are central that a commutator lying in $rad R$ vanishes — and the counterexamples show no such argument exists.

Does the exponent in

(*)

have to be bounded?

No, and this is the strength of the result. The integer $n (a, b)$ may vary arbitrarily with the pair. Uniform-exponent versions are easier — they can often be attacked by polynomial identity methods — but they are strictly weaker statements.

Why is

M_{2} (k)

enough to rule out, rather than all

M_{m} (k)

The matrix-unit computation is uniform: in $M_{m} (k)$ with $m \geq 2$ the pair $E_{11}, E_{12}$ already violates all three conditions, so no separate argument is needed for larger $m$ . What $m = 2$ specifically rules out is the non-artinian branch of $(11.19)$ , which supplies a subring of $R$ mapping onto $M_{2} (k)$ ; once that branch is closed, $R ≅ M_{n} (k)$ and the same computation forces $n = 1$ .

Is there a version of

(12.11)

that does hold for all rings?

Herstein proved that (3) implies (1) for semiprime rings, which is weaker than semiprimitive but still a real hypothesis; the group-algebra counterexample $𝔽_{2} D_{8}$ is not semiprime. For (2) the situation is worse: the $4$ -dimensional local algebra shows that no hypothesis-free version can exist.

Can this method prove noncommutative structure theorems too?

Yes — that is its real value. Any conclusion that is inherited by subrings of products and is known for division rings and their matrix rings can be transported to all semiprimitive rings the same way. Kaplansky's theorem on primitive PI-rings is the best known instance, and the same ladder appears throughout the literature on rings with conditions on elements.

References

T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991 — §12, results (12.8) through (12.11), pp. 209–212; the division ring cases are (13.5), (13.9) and (15.15).
N. Jacobson, Structure theory for algebraic algebras of bounded degree, Annals of Mathematics 46 (1945) — the original commutativity theorem for rings with a^n(a) = a.
I. N. Herstein, Noncommutative Rings, Carus Mathematical Monographs 15, Mathematical Association of America, 1968 — the commutativity theorems and the reduction method, collected.
I. Kaplansky, Rings with a polynomial identity, Bulletin of the American Mathematical Society 54 (1948) — the template for reducing an elementwise hypothesis through primitive rings.
N. Jacobson, Structure of Rings, American Mathematical Society Colloquium Publications 37, revised edition 1964 — density, primitive rings and the radical, in the form used here.

AI Suggested Questions

Work through Lam's $(13.9)$ : prove the Jacobson–Herstein condition forces a division ring to be commutative.
Verify by hand that $𝔽_{2} D_{8}$ satisfies $a^{8} \in Z (R)$ for every element, listing the cases.
Find another hypothesis that fails in $M_{2} (k)$ and see how far the reduction ladder carries it.
How does Kaplansky's theorem on primitive PI-rings use the same reduction, and where does it differ?
Give a commutativity theorem whose proof does not go through subdirect products at all.
Under what extra conditions on $rad R$ does condition (2) of $(12.11)$ lift to arbitrary rings?
Explore whether the counterexample algebra generalises to $n \times n$ upper triangular matrices with constant diagonal.

01Executive Summary

02Overview

03Learning Objectives

04Definitions

05Core Concepts

Why Mm(k) is the universal obstruction

From the obstruction to a division ring

The last rung: what makes a hypothesis liftable

06Key Results

07Proof Techniques and Method

08Worked Example

Boolean rings: Jacobson's theorem with n=2

A finite field check

Counterexample to (2) ⇒ (1) without semiprimitivity

Counterexample to (3) ⇒ (1) without semiprimitivity

09Process and Workflow

10Comparison and Classification

11Relationship Map

Wedderburn's Little Theorem

Density and subdirect products

Commutativity theorems

12Applications and Industry Use

Recognising commutative structure

Rings behind cyclic codes

The template for Kaplansky

Deciding commutativity

13Failure Modes and Common Mistakes

14Best Practices

15Historical Notes and Lessons Learned

16Quick Reference

17Frequently Asked Questions

18Related KEVOS Topics

19References

20AI Suggested Questions

Continue learning

Executive Summary

Overview

Learning Objectives

Definitions

Core Concepts

Why $M_{m} (k)$ is the universal obstruction

Key Results

Proof Techniques and Method

Worked Example

Boolean rings: Jacobson's theorem with $n = 2$

Counterexample to (2) $\Rightarrow$ (1) without semiprimitivity

Counterexample to (3) $\Rightarrow$ (1) without semiprimitivity

Process and Workflow

Comparison and Classification

Relationship Map

Applications and Industry Use

Failure Modes and Common Mistakes

Best Practices

Historical Notes and Lessons Learned

Quick Reference

Frequently Asked Questions

Related KEVOS Topics

References

AI Suggested Questions