KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesSemiprime and Semiprimitive Rings as Subdirect ProductsEngineering · Engineering MathematicsLesson 423/884← PrevNext →
ArticlePublished 8 Aug 202618 min readBy KEVOS®
On this page

Ask about this page

KEVOS AISemiprime and Semiprimitive Rings as Subdirect Products

KEVOS knowledge first · trusted web sources when needed

Skip to content

Engineering Mathematics Core Subdirect products

Subdirect Decomposition Theorems

Semiprime rings are exactly the subdirect products of prime rings, and semiprimitive rings are exactly the subdirect products of left primitive rings. Both statements are the radical-theoretic content of ⋂𝔭=0 read as an embedding.

Page ID
KEVOS-ENG-MATH-NCR-0095
Taxonomy
ENG / ENG-MATH
Collection
noncommutative-rings-core
Source
(12.5), §12 (pp. 206–207)
Reviewed
2026-08-08
Version
1.0.0

01Executive Summary

Two radicals are defined as intersections: the lower nilradical Nil∗R is the intersection of all prime ideals, and radR is the intersection of all left primitive ideals. Saying a radical vanishes is therefore the same as saying a family of ideals meets in zero — which is exactly the input a subdirect representation needs.

Lam's (12.5) makes that observation into a two-part characterisation: semiprime = subdirect product of prime rings, semiprimitive = subdirect product of left primitive rings. The proofs are short. The value lies in what follows: any property inherited by subrings and quotients need only be checked on prime or primitive rings, where the structure theory is strong.

Nil∗R=0Semiprime
radR=0Semiprimitive
PrimeFactors in part (a)
Left primitiveFactors in part (b)

02Overview

A subdirect representation of R is the same thing as a family of ideals {𝔄i} with ⋂i𝔄i=0; the factors are the quotients R/𝔄i. To manufacture a useful representation one therefore wants a family of ideals that (i) meets in zero and (ii) has recognisable quotients. Prime ideals and left primitive ideals are the two standard supplies.

Nil∗R=⋂𝔭 prime𝔭,radR=⋂𝔭 left primitive𝔭
(10.13), (11.5)

Both radicals are intersections of ideals with well-understood quotients. Vanishing of the radical is precisely the injectivity condition for the corresponding subdirect map.

Because every left primitive ideal is prime, and Nil∗R⊆radR, the semiprimitive statement is the sharper of the two: it produces better factors under a stronger hypothesis. Neither statement needs chain conditions, finiteness, or commutativity.

The one thing to remember

Radical zero and subdirect product are the same information in two languages. (12.5) is the translation, and the only step in the proof is naming the family of ideals.

The parallel statement for reduced rings — with domains as factors — is genuinely different and needs a lemma about minimal primes; it is treated on Reduced Rings as Subdirect Products of Domains. The atoms of the general theory are on Subdirectly Irreducible Rings.

03Learning Objectives

  • State both halves of (12.5) with full hypotheses.
  • Prove each direction from the two radical identities.
  • Show that the minimal prime ideals already suffice for the semiprime half.
  • Explain why the semiprimitive half is insensitive to the left-right choice.
  • Decide, for a given ring, which of the four decompositions in this section applies.
  • Exhibit a ring admitting no subdirect decomposition into prime factors.

04Definitions

Prime ring
R≠0 and for ideals 𝔄,𝔅, 𝔄𝔅=0⇒𝔄=0 or 𝔅=0. Elementwise: aRb=0⇒a=0 or b=0.
Semiprime ring
No nonzero nilpotent ideal; elementwise aRa=0⇒a=0; equivalently Nil∗R=0.
Left primitive ring
R has a faithful simple left module; equivalently 0 is a left primitive ideal.
Semiprimitive ring
radR=0, where radR is the Jacobson radical, also written J(R).
Nil∗R
The lower nilradical (Baer radical): the smallest semiprime ideal, equal to the intersection of all prime ideals of R.

Nesting of the hypotheses

Every left primitive ideal is prime, so Nil∗R⊆radR and semiprimitive ⇒ semiprime. The converse fails: k[[x]] is a commutative domain, hence semiprime, with radk[[x]]=(x)≠0.

Ideal means two-sided ideal. Rings are associative with identity and nonzero unless said otherwise.

05Key Results

Theorem(12.5)Subdirect decomposition of semiprime and semiprimitive rings

Let R be a nonzero ring.

  1. R is semiprime iff R can be represented as a subdirect product of prime rings.
  2. R is semiprimitive iff R can be represented as a subdirect product of left primitive rings.

In both cases the factors may be taken to be quotients of R: the prime rings R/𝔭 with 𝔭 prime, respectively the left primitive rings R/𝔭 with 𝔭 left primitive.

Proof

**(⇒), part (a).** Let {𝔭i} be the family of all prime ideals of R. Since R≠0 it has a maximal ideal, which is prime, so the family is nonempty. Semiprimeness says Nil∗R=0, and Nil∗R=⋂i𝔭i, so the quotient maps R↠R/𝔭i have kernels intersecting in zero. That is exactly a subdirect representation R↪∏iR/𝔭i, and each R/𝔭i is prime by definition of a prime ideal.

**(⇒), part (b).** Identical with {𝔭i} the family of left primitive ideals and radR=⋂i𝔭i. Each R/𝔭i is left primitive because 𝔭i is the annihilator of a simple left R-module, which becomes a faithful simple R/𝔭i-module.

**(⇐), both parts.** Let ε:R↪∏iRi be a subdirect representation and set 𝔄i=ker(R→Ri), so that R/𝔄i≅Ri and ⋂i𝔄i=0. If every Ri is prime then every 𝔄i is a prime ideal, so Nil∗R⊆⋂i𝔄i=0 and R is semiprime. If every Ri is left primitive then every 𝔄i is a left primitive ideal, so radR⊆⋂i𝔄i=0 and R is semiprimitive.

Corollary(12.5)′Minimal primes suffice

Let R be a nonzero semiprime ring and let {𝔭i} be the set of minimal prime ideals of R. Then ⋂i𝔭i=0 and R↪∏iR/𝔭i is a subdirect representation by prime rings.

Proof

Every prime ideal contains a minimal prime: order the primes inside a given prime 𝔭 by reverse inclusion and apply Zorn's Lemma, the point being that the intersection of a descending chain of prime ideals is again prime. Hence the intersection of the minimal primes equals the intersection of all primes, which is Nil∗R=0.

Corollary(12.5)″Embedding consequences

A nonzero semiprime ring embeds in a direct product of prime rings. A nonzero semiprimitive ring embeds in a direct product of left primitive rings, and hence — applying the Jacobson Density Theorem to each factor — in a direct product of rings of linear transformations, each dense in End(Mi) for a right vector space Mi over a division ring Di.

RemarkLeft, right, and the asymmetry that is not there

Left primitivity is genuinely one-sided: there exist left primitive rings that are not right primitive. Yet (12.5)(b) is side-neutral, because the radical is: radR is simultaneously the intersection of the left primitive ideals and of the right primitive ideals. So a semiprimitive ring is a subdirect product of left primitive rings and, by a different family of ideals, also of right primitive rings.

06Proof Techniques and Method

How this proof works, and where the effort really lies.

The proof of (12.5) occupies a few lines because all the work was done earlier, in establishing the two radical identities. Isolating the pattern makes it reusable.

Pick a class of quotientsChoose the kind of factor you want: prime, primitive, domain, simple.
Name the matching idealsPrime ideals, left primitive ideals, completely prime ideals. The class of factors determines the class of ideals.
Identify the intersectionThat intersection is a radical: Nil∗R, radR, or Nil∗R again in the reduced case.
Assume the radical vanishesThe hypothesis of the theorem is exactly the statement that the intersection is zero.
Read off the embeddingZero intersection of kernels equals injectivity; surjectivity of coordinate maps is free for quotient maps.

Why the converse is even easier

For the converse one never constructs anything. Every kernel belongs to the relevant class of ideals, so the radical — defined as an intersection over all such ideals — is contained in the intersection of that particular subfamily, which is zero.

The same three-step template produces the reduced case with completely prime ideals, and it is what fails for arbitrary rings: there is no radical whose vanishing characterises being a subdirect product of simple rings, because simplicity is not detected by an intersection of ideals of a fixed type.

07Worked Example

The integers: both halves at once

ℤ is a domain, hence prime, hence semiprime; and radℤ=⋂p(p)=0, so it is semiprimitive. The two decompositions are quite different.

  • Prime factors. The minimal prime of ℤ is (0), so (12.5)′ gives the one-factor representation ℤ≅ℤ — trivial, as it must be for a prime ring.
  • Primitive factors. A commutative ring is left primitive iff it is a field, so the left primitive ideals of ℤ are exactly the (p), and the representation is ℤ↪∏p𝔽p, which is genuinely nontrivial.

A group ring: ℤC2

Let G=C2=⟨g⟩ and R=ℤG. The two maps g↦1 and g↦−1 give surjections π±:R→ℤ with kernels (g−1) and (g+1), both nonzero. If a+bg dies under both then a+b=0 and a−b=0, so 2a=0 and a=b=0.

ℤC2↪ℤ×ℤ,a+bg↦(a+b,a−b)
(E.1)

A subdirect representation by two prime rings; the image is {(u,v):u≡v(mod2)}, of index 2 in the product.

So ℤC2 is semiprime, with (g−1) and (g+1) as its two minimal primes. It is also semiprimitive: composing π± with ℤ↠𝔽p gives maximal — hence left primitive — ideals, and their intersection is kerπ+∩kerπ−=0 because ⋂ppℤ=0.

A ring with no prime decomposition

Let k be a field and R=T2(k) the upper triangular 2×2 matrices. The strictly upper triangular matrices form an ideal 𝔑 with 𝔑2=0 and 𝔑≠0, so R is not semiprime.

𝔑=(0k00),𝔑2=0,Nil∗R=radR=𝔑≠0.
(E.2)

Directly: any homomorphism from R onto a prime ring must kill 𝔑, since the image of a nilpotent ideal is a nilpotent ideal and a prime ring has none that is nonzero. So every prime ideal of R contains 𝔑, no family of them can meet in zero, and (12.5) correctly refuses to apply. The two prime ideals here are (0k0k) and (kk00), meeting in 𝔑, and R/radR≅k×k.

Sanity check

The failure is not an artefact of the family chosen. It is structural: a nonzero nilpotent ideal is invisible in every prime quotient, so it survives in the kernel of any candidate embedding.

08Process and Workflow

Which subdirect decomposition should I use for a given ring R≠0?

radR=0Use (12.5)(b): factors are left primitive rings, and the Density Theorem then describes each one as a dense ring of linear transformations over a division ring. This is the strongest routinely available decomposition.
R reducedUse (12.7): factors are domains, obtained from the minimal primes, which are completely prime by (12.6). Better factors than prime rings, at the cost of a stronger hypothesis.
Nil∗R=0 onlyUse (12.5)(a): factors are prime rings; take the minimal primes to keep the family small.
None of theseFall back on Birkhoff (12.3): subdirectly irreducible factors, always available, but the factors may be no simpler than R. Alternatively pass to R/radR and lift afterwards.

In the third and fourth branches it is often worth computing radR first: if radR≠0 one works with R/radR, decomposes that, and then asks separately whether the conclusion lifts. That two-stage strategy is the content of the reduction chart (12.8) used on The Jacobson and Herstein Commutativity Theorems.

09Comparison and Classification

The four subdirect decompositions of §12
Hypothesis on RFamily of idealsIntersection equalsFactorsReference
none (R≠0)𝔪a maximal with a∉𝔪a0 by constructionsubdirectly irreducible rings(12.3)
semiprimeprime ideals (or just the minimal ones)Nil∗Rprime rings(12.5)(a)
semiprimitiveleft primitive idealsradRleft primitive rings(12.5)(b)
reducedminimal prime idealsNil∗Rdomains(12.7)
Where familiar rings sit
SemiprimeSemiprimitivePrimeLeft primitive
ℤ●yes●yes●yes○no
ℤ/6●yes●yes○no○no
ℤ/8○no○no○no○no
k[[x]]●yes○no●yes○no
T2(k)○no○no○no○no
M2(ℚ)●yes●yes●yes●yes
Weyl algebra A1(ℂ)●yes●yes●yes●yes

Where familiar rings sit

Each column is a property of the ring itself, not of a factor. Reading down the first two columns tells you which half of (12.5) is available.

10Relationship Map

The classes involved are strictly nested, and each containment corresponds to trading a hypothesis for better factors.

All nonzero ringsBirkhoff: subdirect product of subdirectly irreducible rings
SemiprimeNil∗R=0; subdirect product of prime rings
SemiprimitiveradR=0; subdirect product of left primitive rings
Von Neumann regularevery a satisfies a=axa; always semiprimitive
SemisimpleradR=0 and left artinian; a finite direct product of matrix rings over division rings
  • **Reduced ⇒ semiprime**, strictly: M2(k) is prime but has nonzero nilpotents.
  • **Semiprimitive ⇒ semiprime**, strictly: k[[x]] is a domain with nonzero radical.
  • **Prime ⇒ semiprime** and **left primitive ⇒ prime**, so the factors produced by part (b) are automatically legitimate factors for part (a).
  • **Semisimple ⇒ semiprimitive** with only finitely many factors, all of them simple artinian — the finite, fully solved case of (12.5)(b).

11Applications and Industry Use

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

Commutativity theorems

Reduction to primitive rings

The Jacobson–Herstein theorem is proved by verifying its hypothesis on division rings, extending to left primitive rings by density, and then to all semiprimitive rings by (12.5)(b). Part (b) is the step that makes the reduction legitimate.

Polynomial identities

PI theory

Kaplansky's theorem on primitive PI-rings becomes a theorem about semiprimitive PI-rings via the same decomposition, because polynomial identities are inherited by quotients and by subrings of products.

Commutative algebra

Minimal primes and irreducible components

For a reduced commutative noetherian ring the minimal primes are finite in number and the subdirect embedding R↪∏iR/𝔭i is the algebraic form of decomposing a variety into irreducible components.

Symbolic computation

Radical and decomposition pipelines

Computer algebra systems compute the nilradical, split a reduced ring along its minimal primes, and work component by component. GAP, Singular, Macaulay2 and Sage all follow this pattern for commutative input.

The honest summary: (12.5) is a licence, not a construction. It tells you that arguing on prime or primitive factors loses nothing, which is what allows the strong structure theory of §10 and §11 to be applied to rings that satisfy no structural hypothesis beyond a vanishing radical.

12Design Considerations

Design considerations here means the choices made when modelling a problem with these algebraic structures.

  • Which family of ideals? All primes give an enormous index set; the minimal primes give the smallest family that still works. For commutative noetherian rings the minimal set is finite, which is usually decisive.
  • Which radical do you actually need to vanish? If the property you are transporting is inherited by subrings and quotients but fails for nilpotents, semiprime is enough. If your argument needs simple modules — density, for instance — you must have radR=0.
  • Quotient first or decompose first? If radR≠0, decompose R/radR and treat lifting as a separate problem. The lifting step is where results genuinely fail, as (12.11) shows.
  • Which side? Part (b) can be run with left or with right primitive ideals; choose whichever side matches the modules you intend to use. The resulting factor rings are generally different.
  • Do not over-decompose. A prime ring is already a one-factor subdirect product of prime rings. Applying (12.5) to it produces nothing, and the redundant factors can obscure the argument.

13Computational Notes

Computational notes cover algorithms, cost and library behaviour rather than manufacturing process.

  • For a commutative ring finitely presented over a field, the minimal primes are computable by primary decomposition over Gröbner bases; the cost is doubly exponential in the number of variables in the worst case, and the decomposition is the expensive step, not the subdirect embedding.
  • For a finite-dimensional algebra over a field, radA is computable in polynomial time — by the trace form in characteristic 0, by the Friedl–Rónyai method in characteristic p — so semiprimitivity is decidable and the primitive factors are the Wedderburn components of A/radA.
  • For finitely presented noncommutative rings there is no algorithm: the word problem is undecidable, so neither Nil∗R nor radR can be computed in general, and (12.5) gives no effective procedure.
  • The index set in (12.5) is typically infinite even for small rings — ℤ needs one factor per prime — so the theorem is a structural statement rather than a data structure.

Not a decision procedure

Deciding whether a given finitely presented ring is semiprime is not algorithmically possible. Every computational use of (12.5) assumes a setting — finite dimension over a field, or a commutative finitely generated algebra — where the relevant radical is computable.

14Failure Modes and Common Mistakes

Subdirect is not direct

ℤ↪∏p𝔽p is a subdirect representation, but ℤ is nothing like the product: the target is uncountable and has idempotents everywhere. Coordinatewise surjectivity says nothing about surjectivity onto the product.

Prime factors do not make the ring prime

ℤ/6 is a subdirect (indeed direct) product of the prime rings 𝔽2 and 𝔽3 and is not prime. (12.5) characterises *semi*primeness, and the prefix is doing real work.

Do not confuse the two radicals

Nil∗R⊆radR and the inclusion is usually strict. Proving Nil∗R=0 gets you prime factors only; density arguments need the stronger radR=0.

  • Do not assume the decomposition is unique. Different families of prime ideals meeting in zero give different, equally valid representations.
  • Do not expect the factors to inherit finiteness. A finitely generated semiprimitive ring can have primitive quotients that are infinite-dimensional over their centres.
  • Do not use the word semisimple for semiprimitive without saying so; the older literature conflates them, and (12.5) is false with the artinian meaning.
  • Do not forget the nonzero hypothesis: the zero ring is vacuously radical-free but has no prime ideals at all.

15Best Practices

  • State which radical you are assuming to vanish before invoking (12.5); the two halves have different strengths and different factors.
  • Prefer minimal primes to all primes — same theorem, far smaller index set, and in the commutative noetherian case a finite one.
  • When transporting a property to the factors, check explicitly that it is inherited by quotients and by subrings of products; that is precisely what the argument consumes.
  • Record whether your conclusion is about R or about R/radR. Lifting across the radical is a separate theorem, and sometimes a false one.

16Quick Reference

Part (a)semiprime iff subdirect product of prime rings
Part (b)semiprimitive iff subdirect product of left primitive rings
Engine (a)Nil∗R=⋂{𝔭:𝔭 prime}
Engine (b)radR=⋂{𝔭:𝔭 left primitive}
Smaller familyminimal primes already intersect to Nil∗R
Nestingsemiprimitive ⇒ semiprime, strictly
Sides(b) holds with right primitive ideals too
Obstructiona nonzero nilpotent ideal blocks all prime factorisations
Checklist before applying (12.5)
QuestionIf yesIf no
Is R≠0?proceedthe theorem does not apply
Is there a nonzero nilpotent ideal?no prime decomposition existsR is semiprime; use part (a)
Is radR=0?use part (b) and then densitydecompose R/radR and lift separately
Is R reduced?upgrade to domains via (12.7)prime factors are the best available

17Frequently Asked Questions

Why is the theorem stated with left primitive rings rather than primitive rings?

Because primitivity is genuinely one-sided — there are left primitive rings that are not right primitive — so the word primitive alone is ambiguous. The statement is nonetheless side-neutral in effect, since radR is the intersection of the left primitive ideals and also of the right primitive ideals. Running the proof on the other side gives a decomposition by right primitive rings.

How is (12.5) different from Birkhoff's theorem?

Birkhoff (12.3) applies to every nonzero ring but delivers subdirectly irreducible factors, which may be as complicated as R. (12.5) assumes a radical vanishes and delivers factors from a class with a real structure theory. The trade is generality for usable factors, and it is the trade that makes the reduction technique of (12.8) work.

Can I always take finitely many factors?

No. ℤ is semiprimitive and every left primitive quotient is some 𝔽p, so any decomposition into primitive factors needs infinitely many. Finiteness of the family is essentially the artinian case: a semiprimitive left artinian ring is semisimple and decomposes into finitely many simple artinian factors.

Does the theorem say anything about how big the image is inside the product?

Nothing at all, and that is the main limitation. The image can be vanishingly small — ℤ is countable inside a product of continuum cardinality. Only coordinatewise surjectivity is guaranteed, which is why properties are transported to the factors rather than recovered from them without further argument.

Why do nilpotent ideals block a decomposition into prime factors?

A prime ring has no nonzero nilpotent ideal, so any surjection onto a prime ring kills every nilpotent ideal of the source. Hence every prime ideal contains Nil∗R, and no family of prime ideals can meet in zero unless Nil∗R=0. The failure is structural, not a defect of the chosen family.

Is the analogous statement true with simple rings as factors?

No. Being a subdirect product of simple rings is a much stronger and less natural condition, and it is not characterised by the vanishing of any of the usual radicals. The maximal ideals of R intersect in the Brown–McCoy radical, so vanishing of that radical characterises subdirect products of simple rings — but that radical is not one of the two used in (12.5), and it is much less well behaved.

18Related KEVOS Topics

Prime and Semiprime RingsA ring is prime when (0) is a prime ideal and semiprime when (0) is semiprime. The element tests aRb = 0 a = 0 oSemiprimitive RingsA ring has zero Jacobson radical exactly when it acts faithfully on some semisimple left module. This one-line reformulaSubdirect ProductsAn injective ring map : R _i R_i all of whose coordinate maps are surjective — equivalently, a family of ideals of R meeSubdirectly Irreducible RingsA nonzero ring admits no informative subdirect decomposition exactly when its nonzero ideals meet in a nonzero ideal — tReduced RingsA nonzero ring has no nilpotent elements exactly when it embeds subdirectly in a product of domains. The bridge is a lem

19References

  1. T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991 — §12, theorem (12.5), pp. 206–207; §10 (definition 10.13) for the lower nilradical and §11 (corollary 11.5) for primitive ideals.
  2. N. Jacobson, Structure of Rings, American Mathematical Society Colloquium Publications 37, revised edition 1964 — the radical as an intersection of primitive ideals.
  3. I. N. Herstein, Noncommutative Rings, Carus Mathematical Monographs 15, Mathematical Association of America, 1968 — semiprime rings and reduction arguments.
  4. L. H. Rowen, Ring Theory, Volume I, Academic Press, 1988 — prime and semiprime radicals, minimal primes.
  5. N. Divinsky, Rings and Radicals, University of Toronto Press, 1965 — comparison of the classical radicals and their subdirect interpretations.

20AI Suggested Questions

  • Write out the subdirect decomposition of ℤ/n into primitive factors for a general n.
  • Show directly that the Brown–McCoy radical characterises subdirect products of simple rings.
  • Give an example of a semiprime ring with infinitely many minimal primes and describe the resulting embedding.
  • How does (12.5) combine with the Jacobson Density Theorem to describe an arbitrary semiprimitive ring?
  • Does a semiprime ring with finitely many minimal primes decompose as a direct product? Under what extra hypotheses?
  • Compare the size of the Birkhoff family of factors with the family of minimal primes for a commutative noetherian ring.
  • What is the analogue of (12.5) for rings without identity, where maximal ideals may not exist?
Page
KEVOS-ENG-MATH-NCR-0095
Path
Engineering / Mathematics
Template
kevos-knowledge-article-v2
KEVOS® Knowledge Library — reviewed 2026-08-08

On this page

  1. Executive Summary
  2. Overview
  3. Learning Objectives
  4. Definitions
  5. Key Results
  6. Proof Techniques and Method
  7. Worked Example
  8. Process and Workflow
  9. Comparison and Classification
  10. Relationship Map
  11. Applications and Industry Use
  12. Design Considerations
  13. Computational Notes
  14. Failure Modes and Common Mistakes
  15. Best Practices
  16. Quick Reference
  17. Frequently Asked Questions
  18. Related KEVOS Topics
  19. References
  20. AI Suggested Questions

Continue learning

Subdirectly Irreducible Rings and the Little IdealArticle · Engineering MathematicsNEXT LESSON →Reduced Rings as Subdirect Products of DomainsArticle · Engineering MathematicsSubdirect Products of RingsArticle · Engineering MathematicsThe Jacobson and Herstein Commutativity TheoremsArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®