KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesThe Lower Nilradical (Baer Radical)Engineering · Engineering MathematicsLesson 406/884← PrevNext →
ArticlePublished 8 Aug 202616 min readBy KEVOS®
On this page

Ask about this page

KEVOS AIThe Lower Nilradical (Baer Radical)

KEVOS knowledge first · trusted web sources when needed

Skip to content

Engineering Mathematics Core Prime ideals

The Lower Nilradical

Nil∗R=(0) — the intersection of all prime ideals of R, the smallest semiprime ideal, a nil ideal that need not be nilpotent, and the smallest of the four radicals of this chapter.

Page ID
KEVOS-ENG-MATH-NCR-0078
Taxonomy
ENG / ENG-MATH
Collection
noncommutative-rings-core
Source
(10.13)–(10.14), §10 (pp. 171–172)
Reviewed
2026-08-08
Version
1.0.0

01Executive Summary

Specialising the radical of an ideal to 𝔄=(0) produces the first of the chapter's four radicals. Nil∗R:=(0) is the intersection of all prime ideals of R; by the general theory it is the smallest semiprime ideal of R, and by the containment built into the definition of it is a nil ideal.

Being nil, it is trapped inside the Jacobson radical — that is (10.14). The lower nilradical is therefore the smallest of the natural radicals, the one that measures failure of semiprimeness rather than failure of semisimplicity.

(0)Definition
⋂𝔭All primes
NilAlways
⊆radR(10.14)

02Overview

In a commutative ring the nilradical — the set of nilpotent elements — is an ideal and equals the intersection of the prime ideals. In a noncommutative ring the set of nilpotent elements is not an ideal, so the intersection of the primes is taken as the definition and nilness becomes a theorem rather than a description.

Nil∗R:=(0)=⋂{𝔭⊆R:𝔭 prime}
(10.13)

Baer's lower nilradical, also called the Baer–McCoy radical or the prime radical. For R=0 the empty intersection gives Nil∗R=R=0.

Three descriptions, one ideal

Nil∗R is (i) the radical of the zero ideal, (ii) the intersection of all prime ideals, and (iii) the smallest semiprime ideal of R. The equivalences are (10.7), (10.11) and (10.12) with 𝔠=(0).

Nil∗R⊆radR
(10.14)

Because Nil∗R is a nil ideal, and every nil one-sided ideal lies in the Jacobson radical by (4.11).

The adjective lower records that this is the smallest radical in the family; the upper nilradical Nil∗R is the largest nil ideal, and sits between Nil∗R and radR.

03Learning Objectives

  • State (10.13) and list the three equivalent descriptions of Nil∗R.
  • Prove that Nil∗R is nil and contains every nilpotent left, right or two-sided ideal.
  • Prove (10.14) from the quasi-regularity characterisation of radR.
  • Show that Nil∗(R/Nil∗R)=0 and interpret it as semiprimeness of the quotient.
  • Exhibit a commutative ring whose lower nilradical is nil but not nilpotent.
  • State when Nil∗R, Nil∗R and radR coincide.

04Definitions

Definition(10.13)Lower nilradical

For a ring R, Nil∗R:=(0), the radical of the zero ideal. Equivalently it is the intersection of all prime ideals of R, and it is the smallest semiprime ideal of R. It is called Baer's lower nilradical, the Baer–McCoy radical, or — from the second description — the prime radical.

NilR
The set of nilpotent elements. An ideal when R is commutative, merely a subset in general, and always containing Nil∗R.
Nil∗R
The upper nilradical: the sum of all nil ideals, hence the largest nil ideal of R.
Nil versus nilpotent
𝔄 is nil if each element is nilpotent; nilpotent if 𝔄n=0 for one n. Nilpotent implies nil; the converse needs a chain condition.
T-nilpotent
A strictly intermediate condition used for perfect rings: every sequence from 𝔄 has an eventually vanishing product. Not needed here, but it separates nil from nilpotent in practice.
Prime radical
A synonym for Nil∗R, emphasising the description as an intersection of primes.

Lam writes the subscript star low for the lower nilradical and high for the upper; the two symbols differ only in the position of the star, so read carefully.

05Core Concepts

Why it is nil

This is inherited from (10.6): 𝔄⊆{s:sn∈𝔄}, and with 𝔄=(0) the right-hand side is exactly the set of nilpotent elements. The witnessing m-system is {s,s2,s4,…}: if it must meet (0), some s2i=0.

Why it is not nilpotent

Nilness gives each element its own exponent; nilpotence demands one exponent for all products. Without a chain condition there is no mechanism to make the exponents uniform, and they genuinely are not. The example below has Nil∗R nil with (Nil∗R)N≠0 for every N.

What it measures

Nil∗R=0 says exactly that R is a semiprime ring: no nonzero nilpotent ideals. So the lower nilradical is the obstruction to semiprimeness, in the same way that radR is the obstruction to having a faithful semisimple module. Quotienting by it always produces a semiprime ring, and nothing is lost that a prime-ideal argument can see.

R→R/Nil∗R→semiprime→⋂𝔭=0

Where the four radicals sit

Nil∗R⊆Levitzki(R)⊆Nil∗R⊆radR. The first three are nil; the last need not be. All four coincide for left artinian rings, and the first three coincide for commutative rings, where all equal NilR.

06Key Results

Theorem(10.13)Basic properties of the lower nilradical

Let R be a ring with identity. Then:

  1. Nil∗R is a two-sided ideal, equal to the intersection of the prime ideals of R;
  2. Nil∗R is nil;
  3. Nil∗R contains every nilpotent left ideal, every nilpotent right ideal and every nilpotent two-sided ideal of R;
  4. Nil∗R is the smallest semiprime ideal of R, and Nil∗(R/Nil∗R)=0.
Proof

(1) is (10.7) applied to 𝔄=(0); the intersection of two-sided ideals is a two-sided ideal.

(2) By (10.6), (0)⊆{s:sn=0 for some n≥1}.

(3) Nil∗R is semiprime by (10.11), since it is an intersection of primes. If 𝔄 is a one-sided ideal with 𝔄n=0⊆Nil∗R, pick m with 2m≥n; then (𝔄m)2⊆𝔄n⊆Nil∗R, so 𝔄m⊆Nil∗R by the one-sided form (10.9)(4) or (10.9)(5). Halving the exponent repeatedly gives 𝔄⊆Nil∗R.

(4) Minimality is (10.12) with 𝔠=(0). For the quotient, the primes of R/Nil∗R are the images of the primes of R — all of which contain Nil∗R — so their intersection is Nil∗R/Nil∗R=0.

Proposition(10.14)Inside the Jacobson radical

For every ring R with identity, Nil∗R⊆radR. More generally, by (4.11), every nil left ideal, right ideal or two-sided ideal of R is contained in radR.

Proof

Let 𝔄 be a nil left ideal and y∈𝔄. For any x∈R the element xy again lies in 𝔄, hence is nilpotent: (xy)n=0 for some n. Then

(1−xy)(1+xy+(xy)2+⋯+(xy)n−1)=1−(xy)n=1,

and the same computation with the factors in the other order gives a two-sided inverse. So 1−xy∈U(R) for every x, which by the characterisation of the Jacobson radical means y∈radR. Since Nil∗R is a nil ideal by the theorem, (10.14) follows.

Proposition—Behaviour under surjections

If f:R↠S is a surjective ring homomorphism then f(Nil∗R)⊆Nil∗S, and hence f induces a surjection R/Nil∗R↠S/Nil∗S of semiprime rings.

Proof

Let 𝔮⊆S be prime. Surjectivity gives R/f−1(𝔮)≅S/𝔮, a prime ring, so f−1(𝔮) is a prime ideal of R and therefore contains Nil∗R. Hence f(Nil∗R)⊆𝔮. Intersecting over all primes 𝔮 of S gives f(Nil∗R)⊆Nil∗S.

Remark—When the radicals agree

Nil∗R=Nil∗R=NilR for commutative R; Nil∗R=Nil∗R for right noetherian R, by Levitzki's theorem, and both are then nilpotent; and Nil∗R=Nil∗R=radR for left artinian R, all three being nilpotent. Outside these classes the containments are generally strict — Nil∗⊊rad is easy to see, while separating Nil∗ from Nil∗ requires delicate constructions of nil rings with no nonzero nilpotent ideals.

07Proof Techniques and Method

How these proofs work, and which move to reuse.

Move 1

Specialise the general theory

Nothing on this page is proved from scratch. Every statement is (10.6)–(10.12) with 𝔄=(0), which is why Lam develops the general ideal first.

Move 2

Geometric series for nilpotents

(1−u)−1=1+u+⋯+un−1 whenever un=0. This one identity converts every nilness hypothesis into a unit statement, and is the whole content of (4.11).

Move 3

Pull back primes

For a surjection f, f−1 carries primes to primes. Any radical defined as an intersection of primes is then automatically compatible with quotients.

Move 3 fails for injections: a prime of a subring need not be the contraction of a prime, which is why the lower nilradical behaves well under quotients and badly under subrings.

08Worked Example

Four quick computations

  • Nil∗(ℤ/12ℤ)=6ℤ/12ℤ={0,6}: the primes of ℤ/12 are 2ℤ/12 and 3ℤ/12, and 62=36=0, so here the radical is nilpotent of index 2.
  • Nil∗Mn(D)=0 for a division ring D: Mn(D) is simple, hence prime, so (0) is already the intersection of all primes.
  • Nil∗k[[x]]=0 but radk[[x]]=(x): a domain is a prime ring, so the containment (10.14) is strict and very far from equality.
  • Nil∗Tn(k)= the strictly upper triangular matrices, a nilpotent ideal of index n.

Justifying the triangular case

Let 𝔑⊆Tn(k) be the strictly upper triangular matrices. Then 𝔑 is an ideal with 𝔑n=0, so 𝔑⊆Nil∗Tn(k) by part (3) of the theorem. Conversely Tn(k)/𝔑≅k×⋯×k is a reduced commutative ring, so it is semiprime and 𝔑 is a semiprime ideal; minimality of Nil∗ among semiprime ideals gives the reverse containment.

Nil but not nilpotent

Let k be a field and

R=k[x1,x2,x3,…]/(x11,x22,x33,…),
(E.1)

A commutative ring in countably many variables, each variable killed by its own power.

Write 𝔪=(x1,x2,…), the ideal of elements with zero constant term. Every element of 𝔪 involves only finitely many variables, each nilpotent, so — commutativity being available — every element of 𝔪 is nilpotent and 𝔪 is a nil ideal. Since R/𝔪≅k is a field, 𝔪 is maximal, hence prime, and it is the unique prime: any prime must contain each xi, because xii=0. Therefore Nil∗R=𝔪.

But 𝔪 is not nilpotent: for any N≥1, the element xN+1N is a product of N elements of 𝔪 and is nonzero, since the defining relations kill xN+1 only at exponent N+1. Hence 𝔪N≠0 for all N.

What the example shows

Nil∗R is nil, is the intersection of the primes, is the largest nil ideal here, equals radR in this local ring — and is not nilpotent. Nilpotence of the radical is a consequence of chain conditions, never of the definition.

09Comparison and Classification

The four radicals on familiar rings
Ring RNil∗RNil∗RradR
ℤ000
ℤ/12ℤ{0,6}{0,6}{0,6}
k[[x]]00(x)
ℤ(p)00pℤ(p)
Mn(D)000
Tn(k)strictly upper triangularstrictly upper triangularstrictly upper triangular
k[x1,x2,…]/(xii)(x1,x2,…), nil not nilpotentsamesame
Properties of the lower nilradical by class of ring
nilnilpotentequals Nil∗Requals radR
Arbitrary ring●yes○no○no○no
Commutative ring●yes○no●yes○no
Right noetherian ring●yes●yes●yes○no
Left artinian ring●yes●yes●yes●yes
Semiprime ring●yes●yes○no○no
Finite-dimensional algebra●yes●yes●yes●yes

Properties of the lower nilradical by class of ring

In the semiprime row the lower nilradical is zero, so nilness and nilpotence hold vacuously; equality with Nil∗R would assert that a semiprime ring has no nonzero nil ideal, which does not follow, and equality with radR fails already for ℤ(p). A no in this table means not in general, not never.

10Relationship Map

Nil∗R⊆Levitzki(R)⊆Nil∗R⊆radR
radRquasi-regular; need not be nil
Nil∗Rlargest nil ideal
Levitzki(R)largest locally nilpotent ideal
Nil∗Rintersection of all primes; smallest semiprime ideal
every nilpotent idealone-sided or two-sided
  • Nil∗R — what it does and does not do
    • contains
      • every nilpotent one-sided ideal
      • nothing else in general
    • is contained in
      • every prime ideal
      • every semiprime ideal
      • radR by (10.14)
    • vanishes iff
      • R is a semiprime ring
      • R has no nonzero nilpotent left ideal
    • commutes with
      • matrix rings: Nil∗Mn(R)=Mn(Nil∗R)
      • polynomial rings: Nil∗R[T]=(Nil∗R)[T]

The last branch is proved in The Lower Nilradical of Polynomial and Matrix Rings; both statements are cleaner than their Jacobson-radical counterparts, where the polynomial case requires Amitsur's theorem and gives a less explicit answer.

11Applications and Industry Use

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

Noetherian rings

Reduction to semiprime

Goldie's theory applies to semiprime rings, so the first step in analysing a Noetherian ring is to quotient by Nil∗R — which for a Noetherian ring is nilpotent, so the loss is controlled by a finite filtration.

Computer algebra

Structure of finite-dimensional algebras

For an algebra given by structure constants, Nil∗A=radA, so the radical routines in GAP, Magma and Sage compute the lower nilradical as a by-product of Wedderburn decomposition.

Coding and cryptography

Rings with nilpotent radical

Codes over finite chain rings and over ℤ/pn are analysed through the filtration by powers of the radical, which for these finite rings is exactly Nil∗R and is nilpotent.

Deformation theory

Nilpotent thickenings

Passing from R to R/Nil∗R discards the infinitesimal directions; the difference is precisely the nilpotent data that deformation and obstruction arguments track.

The honest summary: like the Jacobson radical, this radical is infrastructure. It is the ideal you quotient by to make prime-ideal arguments available.

12Computational Notes

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

  • Finite-dimensional algebras over a field. Nil∗A=Nil∗A=radA, computable in polynomial time: by the radical of the trace form in characteristic 0, and by the Friedl–Rónyai method in characteristic p.
  • Commutative finitely generated algebras. Nil∗R=(0) is computed by Gröbner-basis radical algorithms, implemented as radical in Singular and Macaulay2; cost is doubly exponential in the worst case.
  • Finite rings. Enumerate the maximal ideals of the finite quotient; the radical is their intersection and is nilpotent, so the computation terminates with an explicit index of nilpotence.
  • Finitely presented noncommutative algebras. Not computable in general — deciding whether an element is nilpotent already reduces to the word problem.

Library naming

Most systems expose only the radical, meaning the Jacobson radical, because they assume finite dimension where the two coincide. If your ring is infinite-dimensional, check which radical a routine actually computes before trusting the answer.

13Failure Modes and Common Mistakes

Nil is not nilpotent

Nil∗R is always nil and is nilpotent only under hypotheses — right noetherian, left artinian, or finite. The ring k[x1,x2,…]/(xii) is the standard warning, and it is commutative, so noncommutativity is not the culprit.

Nil∗R is not the set of nilpotent elements

In M2(k) every strictly triangular matrix is nilpotent, yet Nil∗M2(k)=0. The set of nilpotent elements is not an ideal in a noncommutative ring: e12+e21 is a unit.

  • Do not read the containment (10.14) as an equality. radk[[x]]=(x) while Nil∗k[[x]]=0.
  • Do not assume Nil∗ is preserved by subrings. It behaves well only under surjections; a subring of a semiprime ring may fail to be semiprime and vice versa.
  • Do not confuse Nil∗ with Nil∗; only the position of the star distinguishes the notation, and the two radicals differ in general.
  • Do not expect Nil∗(R×S) to require separate work — it is Nil∗R×Nil∗S — but do not extend the same reflex to infinite products without checking.
  • Do not use prime radical and Jacobson radical interchangeably when reading older literature; the radical without qualification meant the nilpotent radical before 1945.

14Historical Notes and Lessons Learned

  • 1930Köthe on nil idealsKöthe studies nil ideals in general rings and formulates the conjecture that a ring with no nonzero nil ideals has no nonzero nil one-sided ideals — still open.
  • 1943Baer's lower radicalBaer introduces radical ideals for arbitrary rings by transfinitely iterating the removal of nilpotent ideals, producing what is now the lower nilradical.
  • 1949McCoy's prime descriptionMcCoy shows that Baer's radical is exactly the intersection of the prime ideals, replacing a transfinite construction by a single formula.
  • 1950–51LevitzkiLevitzki's theorem — proved in 1939 but published only in 1950 — shows that in a right noetherian ring every nil one-sided ideal is nilpotent, so the lower and upper nilradicals coincide there.
  • 1956Polynomial ringsAmitsur and McCoy determine the lower nilradical of a polynomial ring, obtaining the clean formula that the Jacobson radical conspicuously lacks.

The lesson repeats the one from the Jacobson radical: a radical defined by an internal construction (iterated removal of nilpotent ideals) became tractable only when it was recharacterised externally, as an intersection of prime ideals. The external description is what makes the quotient behaviour, the matrix formula and the polynomial formula routine.

15Quick Reference

DefinitionNil∗R=(0)
Prime formNil∗R=⋂{𝔭:𝔭 prime}
Minimalitysmallest semiprime ideal of R
Nilnessalways nil; nilpotent only under chain conditions
Containsevery nilpotent left, right or two-sided ideal
JacobsonNil∗R⊆Nil∗R⊆radR
VanishingNil∗R=0⇔R semiprime
QuotientNil∗(R/Nil∗R)=0
Alternative namesBaer radical, Baer–McCoy radical, prime radical
Which radical to reach for
If the question is about…UseKey fact
prime ideals, semiprimeness, Goldie theoryNil∗Rintersection of primes
nil ideals and Köthe's conjectureNil∗Rlargest nil ideal
locally nilpotent idealsLevitzki(R)largest locally nilpotent ideal
simple modules, units, lifting idempotentsradR1+radR⊆U(R)
left artinian ringsany of themall four coincide and are nilpotent

16Frequently Asked Questions

Why is it called the lower nilradical?

Because it is the smallest of the nil radicals: Nil∗R⊆Levitzki(R)⊆Nil∗R. Baer's original construction built it from below by transfinitely adjoining nilpotent ideals, whereas the upper nilradical is obtained from above as the sum of all nil ideals.

Is Nil∗R the same as the set of nilpotent elements?

Only when R is commutative. In general the nilpotent elements do not form an ideal — in M2(k) both e12 and e21 are nilpotent while their sum is a unit — and Nil∗M2(k)=0 even though nilpotent elements abound.

Can Nil∗R equal radR without a chain condition?

Yes, accidentally: in the example k[x1,x2,…]/(xii) the ring is local with maximal ideal nil, so all four radicals coincide although nothing is Noetherian and the radical is not nilpotent. Coincidence of the radicals does not by itself imply any finiteness.

How does Nil∗ behave under ring extensions?

Well under surjections — f(Nil∗R)⊆Nil∗S for surjective f — and under the constructions Mn(−) and −[T], where it commutes exactly. It behaves badly under passage to subrings and under general injections, since primes do not contract to primes in general.

Does a semiprime ring have zero Jacobson radical?

No. ℤ(p) is a domain, hence semiprime, with rad=pℤ(p)≠0. The implication runs the other way: radR=0 forces Nil∗R=0, so every semiprimitive ring is semiprime.

Why does Lam prove everything for a general ideal before specialising to zero?

Because the general statement costs nothing extra and delivers 𝔄/𝔄=Nil∗(R/𝔄) for free. Every result about the lower nilradical then transfers to an arbitrary ideal by passing to the quotient, and vice versa.

17Related KEVOS Topics

Radicals ComparedFour radicals, one chain of inclusions: Nil_* R ⊆ Levitzki(R) ⊆ Nil^* R ⊆ rad R. Each inclusion is strict in general, eaUpper Nilradical and Köthe’s ConjectureThe sum of all nil ideals of R is again nil, so there is a largest nil ideal Nil^* R. Whether it absorbs every nil *one-Prime IdealsIn a noncommutative ring the element test ab ∈ p is the wrong one. The correct definition uses products of ideals, equm-SystemsA multiplicatively closed set is replaced by an m-system: a set S with a, b ∈ S arb ∈ S for some r ∈ R. Prime ideals areRadical of an IdealFor an ideal A of any ring, A is defined by an m-system condition — and turns out to be the intersection of the prime id

18References

  1. T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §10 (pp. 163–181).
  2. R. Baer, “Radical ideals”, American Journal of Mathematics 65 (1943), 537–568.
  3. N. H. McCoy, “Prime ideals in general rings”, American Journal of Mathematics 71 (1949), 823–833.
  4. N. J. Divinsky, Rings and Radicals, Mathematical Expositions 14, University of Toronto Press, 1965.
  5. L. H. Rowen, Ring Theory, Volume I, Academic Press, 1988, Chapter 2.
  6. K. R. Goodearl and R. B. Warfield, Jr., An Introduction to Noncommutative Noetherian Rings, 2nd edition, Cambridge University Press, 2004.

19AI Suggested Questions

  • Construct a nil ring with no nonzero nilpotent ideals, separating the lower and upper nilradicals.
  • Prove that Nil∗Mn(R)=Mn(Nil∗R) directly from the description as an intersection of primes.
  • Why is the formula for the lower nilradical of a polynomial ring simpler than Amitsur's theorem for the Jacobson radical?
  • State Levitzki's theorem precisely and identify where the ascending chain condition on right annihilators is used.
  • For which classes of rings is Köthe's conjecture known, and how does each proof use the lower nilradical?
  • Compare the lower nilradical with the Levitzki radical on group rings of locally finite groups.
  • Is the lower nilradical a Morita invariant, and how does that follow from the matrix formula?
Page
KEVOS-ENG-MATH-NCR-0078
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. Core Concepts
  6. Key Results
  7. Proof Techniques and Method
  8. Worked Example
  9. Comparison and Classification
  10. Relationship Map
  11. Applications and Industry Use
  12. Computational Notes
  13. Failure Modes and Common Mistakes
  14. Historical Notes and Lessons Learned
  15. Quick Reference
  16. Frequently Asked Questions
  17. Related KEVOS Topics
  18. References
  19. AI Suggested Questions

Continue learning

Semiprime Ideals and n-SystemsArticle · Engineering MathematicsNEXT LESSON →Prime and Semiprime RingsArticle · Engineering MathematicsThe Radical of an Ideal as an Intersection of PrimesArticle · Engineering MathematicsThe Lower Nilradical of Polynomial and Matrix RingsArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®