Executive Summary
Commutative algebra has two ring-level conditions that make everything work: being a domain and being reduced. Neither survives the passage to noncommutative rings — is as well-behaved as a ring can be and is neither. The right replacements are obtained by demanding that the zero ideal be prime, respectively semiprime, in the ideal-theoretic sense of Prime Ideals in Noncommutative Rings.
What results is a pair of classes closed under matrix rings, polynomial rings and (for semiprimeness) arbitrary direct products, containing all simple rings, all domains and all semiprimitive rings, and characterised by transparent element tests. Semiprimeness has an extra face that primeness does not: it is exactly the vanishing of every nilpotent one-sided ideal, which is why it is the hypothesis under which Wedderburn-style arguments restart.
Overview
Recall the ideal-theoretic definitions. An ideal is prime if implies or for ideals ; an ideal is semiprime if implies . Applying these to gives the two ring classes of this page.
Ideals range over two-sided ideals; by and one may equally let them range over left ideals or over right ideals.
The definitions transfer to quotients without friction: for an ideal , the ring is prime exactly when is a prime ideal, and semiprime exactly when is a semiprime ideal. Everything proved about prime ideals therefore becomes a statement about prime rings, and conversely. In particular is always semiprime, since is the smallest semiprime ideal — see The Lower Nilradical (Baer Radical).
In the commutative category the two classes are the familiar ones: prime rings are the integral domains, semiprime rings are the reduced rings, and collapses to the ideal of nilpotent elements. Noncommutatively all three statements fail as stated, and the failures are instructive rather than pathological.
Learning Objectives
- State Definition and translate it into the element tests and .
- Prove the equivalence of semiprimeness with and with the absence of nonzero nilpotent left ideals.
- Explain why is prime but not a domain, and semiprime but not reduced.
- Show that a nonzero central element of a prime ring is a non-zero-divisor.
- Deduce that a left artinian prime ring is simple artinian.
- State the Connell and Passman criteria for to be prime, respectively semiprime.
Definitions
A ring is called a prime ring if the zero ideal is a prime ideal of , and a semiprime ring if the zero ideal is a semiprime ideal of . Since a prime ideal is by definition proper, a prime ring is nonzero; the zero ring is semiprime by the empty-intersection convention.
- The two-sided ideal generated by ; in a ring with identity, .
- The additive subgroup generated by all products with . Nilpotent means for some ; nil means every element of is nilpotent.
- Domain
- A nonzero ring in which implies or . Strictly stronger than prime.
- Reduced
- No nonzero nilpotent elements. Strictly stronger than semiprime.
- The lower nilradical, equal to and to the intersection of all prime ideals of .
Rings have an identity and modules are unital. Ideal means two-sided ideal unless the word left or right appears.
Core Concepts
Why the element test is not the naive one
In a commutative ring, is prime iff forces or . Transporting that verbatim to would define domain, and the class of noncommutative domains is far too small: it excludes every matrix ring. The correct test inserts the whole ring between the two elements.
The prime test. It says forces or , so it is exactly primeness of read on principal ideals.
The gap between and is precisely the room in which matrix rings live: in one has , but .
Semiprimeness is the absence of nilpotence, at the ideal level
Semiprimeness admits a formulation that mentions no test elements at all: is semiprime iff it has no nonzero nilpotent ideal, and — this is the part that takes an argument — iff it has no nonzero nilpotent one-sided ideal. That upgrade is what makes semiprimeness usable in module theory, where left ideals are the natural objects.
Key Results
For a nonzero ring the following are equivalent: (1) is prime; (2) for ideals implies or ; (3) for implies or ; (4) for left ideals implies or ; (4) the same for right ideals.
For any ring the following are equivalent: (1) is semiprime; (2) implies ; (3) implies ; (4) for a left ideal implies ; (4) the same for right ideals.
These are the specialisations to and of the general characterisations of prime and semiprime ideals.
For any ring the following are equivalent:
- is a semiprime ring;
- ;
- has no nonzero nilpotent ideal;
- has no nonzero nilpotent left ideal.
**(1) (2).** By definition is the smallest semiprime ideal of , so it is zero exactly when is already semiprime.
**(4) (3)** is trivial, an ideal being in particular a left ideal, and **(3) (1)** is immediate from the definition of a semiprime ideal applied to .
**(1) (4).** Let be a nilpotent left ideal and choose minimal with . Suppose . Then , because for . Since is again a left ideal and is semiprime, characterisation (4) of semiprime ideals gives , contradicting minimality of . Hence and .
If is a prime ring, every nonzero element of the centre is a non-zero-divisor in . In particular is an integral domain.
Let and suppose for some . For every we have , so ; primeness forces or , hence . The same computation with gives and . Restricting to shows has no zero divisors, and since .
A left artinian prime ring is simple artinian, hence for a division ring and an integer .
A prime ring is semiprime. Since is left artinian, is a nilpotent ideal, and by a semiprime ring has no nonzero nilpotent ideal, so . A left artinian ring with zero radical is semisimple, hence a finite product by Wedderburn–Artin. If , the two nonzero ideals given by the first factor and by the product of the remaining factors multiply to zero, contradicting primeness. So .
- Every domain is prime, and every reduced ring is semiprime; neither converse holds.
- Every simple ring is prime, because a maximal ideal is always prime: if then , so and .
- is semiprime for every , and a surjection satisfies , so it descends to a surjection of semiprime rings.
- implies , since . Hence semiprimitive rings — in particular semisimple rings and von Neumann regular rings — are semiprime.
- Any direct product of semiprime rings is semiprime. By contrast a direct product of two or more nonzero rings is never prime: the ideals and are nonzero with product zero.
Let be a ring and a group. The group ring is prime if and only if is prime and has no finite normal subgroup other than .
The easy direction is instructive. If is finite, let be the ideal of generated by all with and the ideal generated by . Normality of makes both two-sided, and gives . Primeness forces , i.e. . The converse rests on the structure of the f.c. centre : Dietzmann's Lemma makes torsion-free, hence abelian, and the argument used for the group-ring zero-divisor analysis then shows only for .
Let be a ring and a group. The group ring is semiprime if and only if is semiprime and, for every finite normal subgroup , the integer is not a zero divisor in .
With as in Connell's proof one has , so semiprimeness gives ; if satisfies then lies in and hence vanishes, forcing . Over a field this reads: is semiprime iff , or and has no finite normal subgroup of order divisible by .
Proof Techniques and Method
The reusable moves behind the proofs above.
Sandwich the ring
Replace a product by the set . Every commutative primeness argument transports if you make this substitution, and the resulting condition is automatically side-symmetric.
Take a minimal nilpotency index
Given with minimal, square : the exponent already exceeds , so semiprimeness collapses and contradicts minimality. This one-line trick is what promotes ideals to one-sided ideals.
Build an annihilating pair
To defeat primeness, exhibit two nonzero ideals with zero product. For group rings the pair is the augmentation-type ideal of a finite normal subgroup and the ideal generated by its element sum.
Move 2 explains a recurring asymmetry in the literature: statements about nilpotent one-sided ideals are elementary, while the corresponding statements about nil one-sided ideals are open. Nothing in Move 2 survives when is merely nil, because there is no index to minimise.
Worked Example
Three rings on and its quotients
Take . Its prime ideals are and , both maximal, so
and , so carries a nonzero nilpotent ideal and is not semiprime — consistent with . Passing to the quotient, is reduced, hence semiprime, but it is not prime: the nonzero ideals and of satisfy .
A prime ring that is not a domain
Let . Every ideal of is for some , and , which is nonzero whenever . So is prime. It is not a domain: . It is not reduced either, since , yet it is semiprime — a single nilpotent element is not a nilpotent ideal, and indeed .
A ring that fails semiprimeness for structural reasons
Let be a field and the upper triangular matrices. The strictly upper triangular matrices form an ideal with , so is not semiprime, and because is reduced.
For the lower nilradical, upper nilradical, Levitzki radical and Jacobson radical all coincide with .
Comparison and Classification
| Ring | Prime? | Semiprime? | |
|---|---|---|---|
| Division ring | yes | yes | |
| , | yes (not a domain) | yes (not reduced) | |
| yes | yes | ||
| no | yes | ||
| no | no | ||
| , a field | no | no | strictly upper triangular |
| yes | yes | (but ) | |
| , both nonzero | no | iff both are | |
| , finite of order | no for | iff is semiprime and each , , is a non-zero-divisor in | depends on |
| Prime | Semiprime | Domain | Reduced | |
|---|---|---|---|---|
| Domain | yes | yes | — | yes |
| Reduced | no | yes | no | — |
| Simple | yes | yes | no | no |
| Semisimple | no | yes | no | no |
| Semiprimitive | no | yes | no | no |
| Left primitive | yes | yes | no | no |
| Von Neumann regular | no | yes | no | no |
Which implications hold in which direction
Read the table as: does the row class force the column class? The entry prime and reduced is worth isolating — a ring is a domain precisely when it is both.
Relationship Map
Each arrow is strict. is prime but not primitive over a field ; for infinite-dimensional is primitive but not simple; is semiprime but not prime. The full picture is drawn in Primitive, Simple, Prime and Semiprimitive: How the Classes Relate.
- Semiprime rings —
- contain
- all prime rings
- all reduced rings, in particular all domains
- all semiprimitive rings, hence all semisimple and all von Neumann regular rings
- arbitrary direct products of semiprime rings
- exclude
- any ring with a nonzero nilpotent left ideal
- for not squarefree
- triangular rings for
- are closed under
- matrix rings
- polynomial rings
- direct products
- passing to from any ring
- contain
The closure properties in the last branch are the content of The Lower Nilradical of Polynomial and Matrix Rings; they fail for the Jacobson radical, which is one reason the prime radical is the more computable invariant.
Applications and Industry Use
Applications here means where this structure is used — inside mathematics and in the engineering and computing disciplines that consume it.
Goldie's theorem
A ring has a semisimple artinian classical left ring of quotients exactly when it is semiprime left Goldie; it has a simple artinian one exactly when it is prime left Goldie. Semiprimeness is the hypothesis that makes noncommutative localisation behave.
Connell and Passman
The prime and semiprime questions for are completely settled, in contrast to the semiprimitivity question, which remains open. Modular representation theory uses the semiprime criterion to decide when has no nilpotent ideals.
Prime C*-algebras
A C*-algebra is semiprime automatically, and primeness of the algebra corresponds to the primitive-ideal space being irreducible. The ideal-theoretic language on this page is the algebraic shadow of that topology.
Spectra and supports
Prime ideals are the points of the noncommutative spectrum; semiprime ideals are the closed sets. Computer algebra systems that manipulate ideals in Weyl algebras and enveloping algebras use exactly this correspondence.
Honestly stated, prime and semiprime rings are infrastructure. They are where the structure theory of noncommutative rings begins once artinian hypotheses are dropped, and their industrial reach is via the objects built on them — quotient rings, PI theory, and the ideal-theoretic engines inside symbolic computation systems.
Failure Modes and Common Mistakes
- Do not conclude *nil one-sided ideal * from semiprimeness alone; that implication is Köthe's Conjecture and is available only under extra hypotheses such as ACC on right annihilators.
- Do not assume a product of prime rings is prime — it never is once two factors are nonzero, although the product of semiprime rings is semiprime.
- Do not read Passman's criterion as a statement about alone; over a general coefficient ring the condition is that is a non-zero-divisor, which is finer.
- Do not forget that a prime ring is nonzero by convention, since a prime ideal must be proper.
Best Practices
- Verify primeness with and semiprimeness with ; the ideal-theoretic definitions are for proofs, the element tests are for computation.
- When a ring is presented as a quotient , decide primeness of the ideal rather than of the ring; the two questions are the same and the ideal is usually the concrete object.
- Record the coefficient ring's own status before applying Connell or Passman: both criteria have a condition on and a condition on .
- When you need both no-nilpotents and no-zero-divisors, say domain; the words prime and semiprime should be reserved for their technical meanings.
Quick Reference
| Property | Test | Reference |
|---|---|---|
| Prime | or | (10.2)(3) |
| Prime | product of two nonzero left ideals is nonzero | (10.2)(4) |
| Semiprime | (10.9)(3) | |
| Semiprime | no nonzero nilpotent left ideal | (10.16)(4) |
| Semiprime | (10.16)(2) | |
| Domain | prime and reduced | Exercise 10.3 |
Frequently Asked Questions
Why not simply define a prime ring as one with no zero divisors?
That defines a domain, and the class of noncommutative domains is far too restrictive to carry a structure theory: it excludes every matrix ring with , hence every simple artinian ring except division rings. Primeness weakens the test from to , which keeps matrix rings inside the class while retaining the property that makes prime ideals useful — an ideal-theoretic irreducibility.
Is a semiprime ring the same as a ring with zero Jacobson radical?
No, and the implication goes only one way. always, so forces semiprimeness. The converse fails: and are domains, hence prime and semiprime, but have nonzero Jacobson radical. The two conditions coincide when is left artinian.
Does semiprimeness pass to subrings?
Not in general. is a subring of ; the larger ring is semiprime and the smaller one is not. What does pass are the constructions that preserve the ideal lattice in a controlled way: matrix rings, polynomial rings, direct products, and centres in the prime case.
How do I recognise a nonzero nilpotent left ideal in practice?
Look for an element with ; then is a left ideal with . This turns a global search over left ideals into an element-wise condition, which is why is stated with condition (4) and proved with condition (3).
What is the relationship between prime rings and prime ideals?
They are the same information viewed twice. An ideal is prime exactly when is a prime ring, and the primes of are therefore the kernels of the surjections from onto prime rings. The intersection of all of them is .
Is there a version of Passman's criterion over a field?
Yes, and it is the form most often quoted: for a field , the group ring is semiprime if , with no condition on ; and for , is semiprime exactly when has no finite normal subgroup whose order is divisible by .
References
- T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §10, especially (10.15)–(10.17).
- N. H. McCoy, “Prime ideals in general rings”, American Journal of Mathematics 71 (1949), 823–833.
- I. G. Connell, “On the group ring”, Canadian Journal of Mathematics 15 (1963), 650–685.
- D. S. Passman, The Algebraic Structure of Group Rings, Wiley-Interscience, 1977, Chapter 4.
- L. H. Rowen, Ring Theory, Volume I, Academic Press, 1988, Chapter 2.
- T. Y. Lam, Lectures on Modules and Rings, Graduate Texts in Mathematics 189, Springer-Verlag, 1999, Chapter 4 (Goldie's theorem).
AI Suggested Questions
- Give an example of a prime ring that is not left primitive, and explain what obstructs primitivity.
- How does Goldie's theorem use semiprimeness, and what fails for rings that are merely nonsingular?
- Prove that the centre of a prime ring is an integral domain and that the ring embeds in a ring over its central quotient field.
- Describe the minimal prime ideals of and of , and check that their intersection is the lower nilradical.
- Why is the semiprimitivity problem for still open when the prime and semiprime problems are solved?
- Compare completely prime ideals with prime ideals in the Weyl algebra .
- Show that a ring is a domain if and only if it is prime and reduced.
