← LibraryPrime and Semiprime RingsEngineering · Engineering MathematicsLesson 335/812← PrevNext →
ArticlePublished 8 Aug 2026Updated 9 Aug 202618 min readBy KEVOS®
Skip to content

Engineering Mathematics Core Prime ideals

Prime and Semiprime Rings

A ring is prime when (0) is a prime ideal and semiprime when (0) is semiprime. The element tests aRb=0a=0 or b=0, and aRa=0a=0, are the noncommutative replacements for integral domain and reduced ring.

Page ID
KEVOS-ENG-MATH-NCR-0079
Taxonomy
ENG / ENG-MATH
Collection
noncommutative-rings-core
Source
(10.15)–(10.17), §10 (pp. 172–174)
Reviewed
2026-08-08
Version
1.0.0

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 — M2(k) 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.

aRb=0Prime test
aRa=0Semiprime test
NilR=0Semiprime, radically
(10.15)Lam's definition

Overview

Recall the ideal-theoretic definitions. An ideal 𝔭R is prime if 𝔄𝔅𝔭 implies 𝔄𝔭 or 𝔅𝔭 for ideals 𝔄,𝔅; an ideal is semiprime if 𝔄2 implies 𝔄. Applying these to 𝔭==(0) gives the two ring classes of this page.

R primeiff(𝔄𝔅=0𝔄=0 or 𝔅=0),R semiprimeiff(𝔄2=0𝔄=0)
(10.15)

Ideals 𝔄,𝔅 range over two-sided ideals; by (10.2) and (10.9) one may equally let them range over left ideals or over right ideals.

The definitions transfer to quotients without friction: for an ideal 𝔄R, the ring R/𝔄 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 R/NilR is always semiprime, since NilR 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 NilR collapses to the ideal Nil(R) of nilpotent elements. Noncommutatively all three statements fail as stated, and the failures are instructive rather than pathological.

Learning Objectives

  • State Definition (10.15) and translate it into the element tests aRb=0 and aRa=0.
  • Prove the equivalence of semiprimeness with NilR=0 and with the absence of nonzero nilpotent left ideals.
  • Explain why Mn(D) 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 kG to be prime, respectively semiprime.

Definitions

Definition(10.15)Prime and semiprime rings

A ring R is called a prime ring if the zero ideal is a prime ideal of R, and a semiprime ring if the zero ideal is a semiprime ideal of R. Since a prime ideal is by definition proper, a prime ring is nonzero; the zero ring is semiprime by the empty-intersection convention.

(a)
The two-sided ideal generated by a; in a ring with identity, (a)=RaR.
𝔄n
The additive subgroup generated by all products a1a2an with ai𝔄. Nilpotent means 𝔄n=0 for some n; nil means every element of 𝔄 is nilpotent.
Domain
A nonzero ring in which ab=0 implies a=0 or b=0. Strictly stronger than prime.
Reduced
No nonzero nilpotent elements. Strictly stronger than semiprime.
NilR
The lower nilradical, equal to (0) and to the intersection of all prime ideals of R.

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 ab𝔭 forces a𝔭 or b𝔭. Transporting that verbatim to 𝔭=(0) 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.

aRb=0a=0 or b=0

The prime test. It says (a)(b)=RaRbR=0 forces a=0 or b=0, so it is exactly primeness of (0) read on principal ideals.

The gap between ab=0 and aRb=0 is precisely the room in which matrix rings live: in M2(k) one has E11E22=0, but E11M2(k)E22E11E12E22=E120.

Semiprimeness is the absence of nilpotence, at the ideal level

Semiprimeness admits a formulation that mentions no test elements at all: R 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.

No nilpotent left idealNo nilpotent ideal(0) semiprimeNilR=0

Key Results

Proposition(10.2), (10.9)Element characterisations

For a nonzero ring R the following are equivalent: (1) R is prime; (2) 𝔄𝔅=0 for ideals implies 𝔄=0 or 𝔅=0; (3) aRb=0 for a,bR implies a=0 or b=0; (4) 𝔄𝔅=0 for left ideals implies 𝔄=0 or 𝔅=0; (4) the same for right ideals.

For any ring R the following are equivalent: (1) R is semiprime; (2) (a)2=0 implies a=0; (3) aRa=0 implies a=0; (4) 𝔄2=0 for a left ideal 𝔄 implies 𝔄=0; (4) the same for right ideals.

These are the specialisations to 𝔭=(0) and =(0) of the general characterisations of prime and semiprime ideals.

Proposition(10.16)Semiprimeness and nilpotent left ideals

For any ring R the following are equivalent:

  1. R is a semiprime ring;
  2. NilR=0;
  3. R has no nonzero nilpotent ideal;
  4. R has no nonzero nilpotent left ideal.
Proof

**(1) (2).** By definition NilR=(0) is the smallest semiprime ideal of R, so it is zero exactly when (0) 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 𝔄2=0.

**(1) (4).** Let 𝔄 be a nilpotent left ideal and choose n1 minimal with 𝔄n=0. Suppose n>1. Then (𝔄n1)2=𝔄2n2𝔄n=0, because 2n2n for n2. Since 𝔄n1 is again a left ideal and R is semiprime, characterisation (4) of semiprime ideals gives 𝔄n1=0, contradicting minimality of n. Hence n=1 and 𝔄=0.

CorollaryCentral elements of a prime ring

If R is a prime ring, every nonzero element of the centre Z(R) is a non-zero-divisor in R. In particular Z(R) is an integral domain.

Proof

Let 0zZ(R) and suppose za=0 for some aR. For every rR we have zra=rza=0, so zRa=0; primeness forces z=0 or a=0, hence a=0. The same computation with az=0 gives aRz=0 and a=0. Restricting to Z(R) shows Z(R) has no zero divisors, and Z(R)0 since 1Z(R).

CorollaryArtinian prime rings are simple

A left artinian prime ring R is simple artinian, hence RMn(D) for a division ring D and an integer n1.

Proof

A prime ring is semiprime. Since R is left artinian, radR is a nilpotent ideal, and by (10.16) a semiprime ring has no nonzero nilpotent ideal, so radR=0. A left artinian ring with zero radical is semisimple, hence a finite product Mn1(D1)××Mnr(Dr) by Wedderburn–Artin. If r2, the two nonzero ideals given by the first factor and by the product of the remaining factors multiply to zero, contradicting primeness. So r=1.

Example(10.17)The standard list
  • 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 𝔄,𝔅not𝔪 then 𝔪+𝔄=R=𝔪+𝔅, so R=(𝔪+𝔄)(𝔪+𝔅)𝔪+𝔄𝔅 and 𝔄𝔅not𝔪.
  • R/NilR is semiprime for every R, and a surjection f:RS satisfies f(NilR)NilS, so it descends to a surjection of semiprime rings.
  • radR=0 implies NilR=0, since NilRradR. 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 R×0 and 0×S are nonzero with product zero.
Theorem(10.17g)Connell's criterion

Let k be a ring and G a group. The group ring kG is prime if and only if k is prime and G has no finite normal subgroup other than {1}.

The easy direction is instructive. If HG is finite, let 𝔄 be the ideal of kG generated by all h1 with hH and 𝔅 the ideal generated by hHh. Normality of H makes both two-sided, and (h1)hHh=0 gives 𝔄𝔅=0. Primeness forces 𝔄=0, i.e. H={1}. The converse rests on the structure of the f.c. centre Δ(G): Dietzmann's Lemma makes Δ(G) torsion-free, hence abelian, and the argument used for the group-ring zero-divisor analysis then shows γkGγ=0 only for γ=γ=0.

Theorem(10.17h)Passman's criterion

Let k be a ring and G a group. The group ring kG is semiprime if and only if k is semiprime and, for every finite normal subgroup HG, the integer |H| is not a zero divisor in k.

With 𝔄,𝔅 as in Connell's proof one has (𝔄𝔅)2𝔄𝔅=0, so semiprimeness gives 𝔄𝔅=0; if ak satisfies |H|a=0 then ahHh lies in 𝔄𝔅 and hence vanishes, forcing a=0. Over a field this reads: kG is semiprime iff chark=0, or chark=p>0 and G has no finite normal subgroup of order divisible by p.

Proof Techniques and Method

The reusable moves behind the proofs above.

Move 1

Sandwich the ring

Replace a product ab by the set aRb. Every commutative primeness argument transports if you make this substitution, and the resulting condition is automatically side-symmetric.

Move 2

Take a minimal nilpotency index

Given 𝔄n=0 with n minimal, square 𝔄n1: the exponent 2n2 already exceeds n, so semiprimeness collapses 𝔄n1 and contradicts minimality. This one-line trick is what promotes ideals to one-sided ideals.

Move 3

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 /12 and its quotients

Take R=/12. Its prime ideals are (2) and (3), both maximal, so

NilR=(2)(3)={0,6}=(6),
(E.1)

and (6)2=(36)=0, so R carries a nonzero nilpotent ideal and is not semiprime — consistent with (10.16). Passing to the quotient, R/(6)/6/2×/3 is reduced, hence semiprime, but it is not prime: the nonzero ideals (2) and (3) of /6 satisfy (2)(3)=(6)=0.

A prime ring that is not a domain

Let R=M2(). Every ideal of R is M2(n) for some n0, and M2(m)M2(n)=M2(mn), which is nonzero whenever m,n0. So R is prime. It is not a domain: E11E22=0. It is not reduced either, since E122=0, yet it is semiprime — a single nilpotent element is not a nilpotent ideal, and indeed E12RE12E12E21E12=E120.

A ring that fails semiprimeness for structural reasons

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

𝔑=(0k00),𝔑2=0,T/𝔑k×ksemiprime, not prime.
(E.2)

For T2(k) the lower nilradical, upper nilradical, Levitzki radical and Jacobson radical all coincide with 𝔑.

Comparison and Classification

Prime and semiprime status of standard rings
RingPrime?Semiprime?NilR
Division ring Dyesyes0
Mn(D), n2yes (not a domain)yes (not reduced)0
yesyes0
/6noyes0
/12nono(6)
T2(k), k a fieldnonostrictly upper triangular
k[[x]]yesyes0 (but rad=(x))
R×S, both nonzeronoiff both areNilR×NilS
kG, G finite of order nno for |G|>1iff k is semiprime and each |H|, HG, is a non-zero-divisor in kdepends on chark
Which implications hold in which direction
PrimeSemiprimeDomainReduced
Domainyesyesyes
Reducednoyesno
Simpleyesyesnono
Semisimplenoyesnono
Semiprimitivenoyesnono
Left primitiveyesyesnono
Von Neumann regularnoyesnono

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

SimpleLeft primitivePrimeSemiprime

Each arrow is strict. M2(k[x]) is prime but not primitive over a field k; EndD(V) for infinite-dimensional V is primitive but not simple; /6 is semiprime but not prime. The full picture is drawn in Primitive, Simple, Prime and Semiprimitive: How the Classes Relate.

  • Semiprime rings NilR=0
    • 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
      • /n for n not squarefree
      • triangular rings Tn(k) for n2
    • are closed under
      • matrix rings Mn()
      • polynomial rings R[T]
      • direct products
      • passing to R/NilR from any ring

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.

Rings of quotients

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.

Group algebras

Connell and Passman

The prime and semiprime questions for kG are completely settled, in contrast to the semiprimitivity question, which remains open. Modular representation theory uses the semiprime criterion to decide when kG has no nilpotent ideals.

Operator algebras

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.

Noncommutative geometry

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 =0* 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 chark alone; over a general coefficient ring the condition is that |H| 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 aRb=0 and semiprimeness with aRa=0; the ideal-theoretic definitions are for proofs, the element tests are for computation.
  • When a ring is presented as a quotient R/𝔄, 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 k and a condition on G.
  • 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

Prime ring(0) is a prime ideal; aRb=0a=0 or b=0
Semiprime ring(0) is a semiprime ideal; aRa=0a=0
Radical formR semiprime iffNilR=0
Nilpotence formR semiprime iff no nonzero nilpotent left ideal
Commutative caseprime = domain, semiprime = reduced
QuotientsR/𝔄 prime (semiprime) iff𝔄 prime (semiprime)
ClosureMn(R) and R[T] inherit both properties from R
Group ringsConnell (10.17g) for prime; Passman (10.17h) for semiprime
Tests at a glance
PropertyTestReference
PrimeaRb=0a=0 or b=0(10.2)(3)
Primeproduct of two nonzero left ideals is nonzero(10.2)(4)
SemiprimeaRa=0a=0(10.9)(3)
Semiprimeno nonzero nilpotent left ideal(10.16)(4)
SemiprimeNilR=0(10.16)(2)
Domainprime and reducedExercise 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 Mn(D) with n2, hence every simple artinian ring except division rings. Primeness weakens the test from ab=0 to aRb=0, 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. NilRradR always, so radR=0 forces semiprimeness. The converse fails: (p) and k[[x]] are domains, hence prime and semiprime, but have nonzero Jacobson radical. The two conditions coincide when R is left artinian.

Does semiprimeness pass to subrings?

Not in general. T2(k) is a subring of M2(k); 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 a with aRa=0; then Ra is a left ideal with (Ra)2=RaRa=0. This turns a global search over left ideals into an element-wise condition, which is why (10.16) 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 𝔭R is prime exactly when R/𝔭 is a prime ring, and the primes of R are therefore the kernels of the surjections from R onto prime rings. The intersection of all of them is NilR.

Is there a version of Passman's criterion over a field?

Yes, and it is the form most often quoted: for a field k, the group ring kG is semiprime if chark=0, with no condition on G; and for chark=p>0, kG is semiprime exactly when G has no finite normal subgroup whose order is divisible by p.

References

  1. T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §10, especially (10.15)–(10.17).
  2. N. H. McCoy, “Prime ideals in general rings”, American Journal of Mathematics 71 (1949), 823–833.
  3. I. G. Connell, “On the group ring”, Canadian Journal of Mathematics 15 (1963), 650–685.
  4. D. S. Passman, The Algebraic Structure of Group Rings, Wiley-Interscience, 1977, Chapter 4.
  5. L. H. Rowen, Ring Theory, Volume I, Academic Press, 1988, Chapter 2.
  6. 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 /n and of Tn(k), and check that their intersection is the lower nilradical.
  • Why is the semiprimitivity problem for kG still open when the prime and semiprime problems are solved?
  • Compare completely prime ideals with prime ideals in the Weyl algebra A1(k).
  • Show that a ring is a domain if and only if it is prime and reduced.
Page
KEVOS-ENG-MATH-NCR-0079
Path
Engineering / Mathematics
Template
kevos-knowledge-article-v2
KEVOS® Knowledge Library — reviewed 2026-08-08

Continue learning

The Lower Nilradical (Baer Radical)Article · Engineering MathematicsNEXT LESSON →The Lower Nilradical of Polynomial and Matrix RingsArticle · Engineering MathematicsSemiprime Ideals and n-SystemsArticle · Engineering MathematicsMinimal Left Ideals in Semiprime RingsArticle · Engineering Mathematics