Executive Summary
In a commutative ring, and this happens to be both an ideal and the intersection of the primes above . In a noncommutative ring the element description fails on both counts — it is usually not an ideal — so the definition is taken from the -system side instead.
Definition declares when every -system through meets . Theorem then identifies this set with , which settles at one stroke that it is an ideal, that it is intrinsic, and that it generalises the commutative radical correctly.
Overview
Fix a ring with identity and an ideal .
The definition, together with the containment that justifies the radical notation. The containment can be strict.
The containment is immediate from the standard -system : it contains , so if it must meet , giving for some .
When there are no primes above and the empty intersection is ; consistently, , since every -system is a nonempty subset of and so meets .
Learning Objectives
- Parse : which quantifier is universal, which existential, and why.
- Prove using the doubling-powers -system.
- Prove both inclusions of , identifying where and are used.
- Deduce that is an ideal, that , and that .
- Show that in the commutative case the containment in is an equality.
- Compute inside and exhibit the failure of the element description.
Definitions
For an ideal of a ring , set .
- The lower nilradical , the intersection of all prime ideals of .
- Radical ideal
- An ideal with ; in the noncommutative setting these are exactly the semiprime ideals.
- The set of elements nilpotent modulo . In general only a subset-containing set, not an ideal, and strictly larger than .
- Minimal prime over
- A prime minimal with that property; the intersection in may be restricted to these.
The square-root notation is inherited from commutative algebra, where the radical really is defined by extracting roots. Here it is a name, not a description.
Core Concepts
Why the element description is abandoned
In the elements and both square to zero, so both are nilpotent modulo . Their sum satisfies , so it is a unit. The set of nilpotent elements of a noncommutative ring is therefore not closed under addition and cannot serve as a radical.
Definition sidesteps this by asking a question about all -systems through , a condition strong enough to be stable under the ring operations — though only the identification makes that stability visible.
How the two inclusions are proved
Both directions of are one-line applications of the previous page. That lies in each prime uses : the complement is an -system that misses . That every element outside escapes some prime uses : an -system witnessing can be avoided by a prime above .
The commutative case, recovered
When is commutative the containment of is an equality. Suppose and let be any -system with . Applying the defining property repeatedly produces elements of — commutativity lets the ring elements be collected on the right — so some . Since and is an ideal, , so meets and .
Key Results
Let be a ring with identity and an ideal. Then
In particular is a two-sided ideal of containing .
**.** Let and let be prime. By the complement is an -system, and . If belonged to , then would be an -system containing that misses , contradicting . Hence .
**.** Suppose . By definition there is an -system with and . Order by inclusion the ideals containing and disjoint from ; the set is nonempty (it contains ) and closed under unions of chains, so Zorn's Lemma gives a maximal element . By , is prime, and with ; since we get . So is missing from the intersection.
Both inclusions give the equality. The intersection of two-sided ideals is a two-sided ideal, and every prime above contains , so .
For ideals of a ring :
- implies ;
- ;
- ;
- .
(1) A prime containing contains , so the intersection defining runs over a subfamily of that defining .
(2) The primes above are exactly the primes above : one direction is , the other is , which puts inside every prime above . Equal families give equal intersections.
(3) A prime contains iff it contains or , by ; and shows the same family of primes arises from . Intersecting over the union of the two families gives .
(4) The primes of are the images of the primes of containing , and intersection commutes with the quotient map on ideals containing .
If is commutative then , so recovers the classical radical and recovers the classical theorem that a radical ideal is an intersection of primes.
The inclusion holds in any ring by . For , let and let be an -system containing . Build elements of inductively: , and given choose with . By commutativity , so . Hence meets , and as was arbitrary, .
Every prime above contains a prime minimal over — a descending chain of primes has prime intersection, so Zorn applies downwards. Hence the intersection in may be taken over the minimal primes above alone, which is how radicals are computed in practice.
Proof Techniques and Method
How these proofs work, and which move to reuse.
Define by a universal condition
When a set has no obvious algebraic structure, define it by a condition quantified over all objects of an auxiliary type — here all -systems — and recover the structure by a separate identification theorem.
Test membership by escaping
To show is not in an intersection of primes, produce one prime missing . Existence comes from Zorn plus ; this converts a negative statement into a construction.
Reduce to the quotient
is the preimage of . Any question about radicals of ideals may be moved to a question about the lower nilradical of a quotient ring, and usually should be.
Move 3 explains the architecture of this section: Lam proves everything for a general ideal first, then specialises to to define . Nothing new is needed at the second step.
Worked Example
Computing
Let and . Every ideal of has the form for a unique ideal , and is prime exactly when is prime. The prime ideals of containing are and , so the primes of above are and . Therefore
Equivalently , by property (4) of the corollary.
The element description fails here
Consider . Then , so is nilpotent modulo ; but because its entry is . Hence
The containment of (10.6) is strict, and the larger set is not even closed under addition.
Indeed and both square to , while and no power of lies in . So the nilpotent-modulo set is not closed under addition and cannot be an ideal, whereas always is.
Comparison and Classification
| Feature | Commutative | General |
|---|---|---|
| Definition used | -system condition | |
| Is it an ideal? | yes, directly | yes, but only via |
| Intersection of primes | yes | yes |
| Element description | exact | only an upper bound, often strict |
| Fixed points | radical ideals | semiprime ideals |
| equals the nilpotent-modulo set? | semiprime? | ||
|---|---|---|---|
| yes | yes | ||
| no | yes | ||
| no | yes | ||
| yes | yes | ||
| yes | yes | ||
| yes | yes |
Radicals of some explicit ideals
Relationship Map
Reading outward: , with the middle containment an equality precisely when the nilpotent-modulo set happens to be an ideal — automatic in the commutative case, rare otherwise.
Computational Notes
Computational notes cover algorithms, cost and library behaviour rather than manufacturing process.
- Commutative, finitely generated over a field. is computable: Gröbner-basis algorithms (Krick–Logar, Eisenbud–Huneke–Vasconcelos) are implemented as
radicalin Singular and Macaulay2. Worst-case cost is doubly exponential in the number of variables, and characteristic needs separate handling because of inseparability. - Finite-dimensional algebras over a field. Here , so the radical of an ideal reduces to a Jacobson radical computation in the quotient — polynomial time by the trace form in characteristic and by the Friedl–Rónyai algorithm in characteristic .
- Finitely presented noncommutative algebras. No general algorithm exists: the word problem is already undecidable, so membership in cannot be decided in general. Non-commutative Gröbner bases (
Plural,GBNP) terminate only under favourable term orders and degree bounds. - Practical shortcut. Because is the intersection of the minimal primes above , any algorithm that enumerates minimal primes computes the radical; in the commutative world this is exactly what primary decomposition packages do.
Failure Modes and Common Mistakes
- Do not assume — the correct identity is .
- Do not assume the intersection in is over finitely many primes; it is finite only under strong hypotheses such as Noetherian conditions.
- Do not apply the radical to one-sided ideals. and are statements about two-sided ideals, and the prime ideals involved are two-sided.
- Do not confuse with the Jacobson radical. The containment is usually strict — but .
- Do not forget the degenerate case: , and is not prime, so the empty intersection convention is doing real work.
Quick Reference
| Goal | Cheapest route | Reference |
|---|---|---|
| show lies in every prime above | (10.7) | |
| exhibit one -system through missing | (10.6) | |
| show is semiprime | (10.11) | |
| compute | intersect the minimal primes above | (10.7) plus Zorn |
| identify | (10.13) |
Frequently Asked Questions
Why is an ideal when its definition mentions no ring operations?
Because identifies it with an intersection of prime ideals, and any intersection of two-sided ideals is a two-sided ideal. There is no direct proof from that avoids the prime characterisation, which is precisely why Lam proves the theorem before drawing any consequence.
Is always nil modulo ?
Yes: gives , so every element of is nilpotent in . The converse fails, and need not be nilpotent modulo — nil and nilpotent differ without chain conditions.
What happens if no prime ideal contains ?
That occurs only for , since any proper ideal lies in a maximal ideal and maximal ideals are prime. In that case the intersection is empty and equals by convention, matching from .
Does commute with quotients?
Yes in the form that matters: for , computed in , because the primes above correspond to the primes of above . The special case gives .
Can I use only the minimal primes above ?
Yes. Every prime above contains one that is minimal over , because a descending chain of primes has prime intersection and Zorn applies. So the intersection over minimal primes gives the same ideal, and it is the form used computationally.
Why is the notation a square root?
Historical inheritance from commutative algebra, where is literally obtained by extracting roots of elements. In the noncommutative theory nothing is extracted and the symbol is pure notation; some authors write or instead, at the cost of a clash with the Jacobson radical.
References
- T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §10 (pp. 163–181).
- N. H. McCoy, “Prime ideals in general rings”, American Journal of Mathematics 71 (1949), 823–833.
- R. Baer, “Radical ideals”, American Journal of Mathematics 65 (1943), 537–568.
- L. H. Rowen, Ring Theory, Volume I, Academic Press, 1988, Chapter 2.
- D. Eisenbud, Commutative Algebra with a View Toward Algebraic Geometry, Graduate Texts in Mathematics 150, Springer-Verlag, 1995, Chapter 4 (for the commutative comparison).
AI Suggested Questions
- Show that a descending chain of prime ideals has prime intersection, and deduce the existence of minimal primes over an ideal.
- Find a ring and an ideal for which the set of elements nilpotent modulo the ideal is not closed under multiplication either.
- How is computed for an ideal of a finite-dimensional algebra given by structure constants?
- Is there a noncommutative analogue of primary decomposition that refines the intersection in (10.7)?
- Compare with the set of nilpotent elements for the free algebra and for the Weyl algebra.
- What is the radical of an ideal in a ring without identity, and which steps of the proof of (10.7) change?
- Explain how (10.7) specialises to the commutative Nullstellensatz correspondence between radical ideals and varieties.
