KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesMinimal Left Ideals in Semiprime RingsEngineering · Engineering MathematicsLesson 409/884← PrevNext →
ArticlePublished 8 Aug 202616 min readBy KEVOS®
On this page

Ask about this page

KEVOS AIMinimal Left Ideals in Semiprime Rings

KEVOS knowledge first · trusted web sources when needed

Skip to content

Engineering Mathematics Core Prime ideals

Minimal Left Ideals

Brauer's Lemma splits every minimal left ideal into two cases — square zero, or generated by an idempotent — and semiprimeness eliminates the first. The pay-off is a semiprime replacement for the Jacobson-radical hypothesis in the characterisation of semisimple rings.

Page ID
KEVOS-ENG-MATH-NCR-0081
Taxonomy
ENG / ENG-MATH
Collection
noncommutative-rings-core
Source
(10.22)–(10.24), §10 (pp. 176–178)
Reviewed
2026-08-08
Version
1.0.0

01Executive Summary

A minimal left ideal is the smallest interesting piece of a ring, and there are exactly two kinds. Brauer's Lemma says a minimal left ideal 𝔄 either satisfies 𝔄2=0 — it is a square-zero fragment carrying no idempotent — or it is Re for an idempotent e∈𝔄, in which case it is a direct summand of the ring and a projective simple module.

Semiprimeness is exactly the hypothesis that forbids the first case, since a square-zero left ideal is a nilpotent left ideal. That single deletion is enough to rerun the classical argument for semisimplicity with semiprime in place of Jacobson semisimple, giving (10.24): semisimple = semiprime + DCC on principal left ideals.

2Cases in Brauer's Lemma
𝔄=ReSemiprime case
eReIs a division ring
(10.24)Semisimplicity criterion

02Overview

Minimal left ideals are the simple submodules of RR. Their sum is the left socle, and a ring is semisimple precisely when the socle is everything. The obstruction to that is not the existence of few minimal left ideals but the existence of bad ones: minimal left ideals that are not summands cannot be assembled into a decomposition of R.

𝔄 minimal left ideal⟹𝔄2=0or𝔄=Re with e2=e∈𝔄,
(10.22)

Brauer's Lemma. No hypothesis on R beyond having an identity.

The whole page in one implication

In a semiprime ring the first alternative is impossible, because 𝔄2=0 makes 𝔄 a nonzero nilpotent left ideal, which (10.16) forbids. So every minimal left ideal of a semiprime ring is Re, hence a direct summand.

This is the semiprime counterpart of a familiar argument: in a Jacobson semisimple ring, a minimal left ideal cannot be square zero either, because a square-zero left ideal is nil and therefore inside radR. Semiprimeness is a weaker hypothesis than radR=0 and does the same job here, which is why (10.24) improves on (4.14).

03Learning Objectives

  • Prove Brauer's Lemma by producing an idempotent from a nonvanishing product 𝔄a.
  • Deduce (10.23): minimal left ideals in a semiprime ring are generated by idempotents.
  • Show R=Re⊕R(1−e) and that eRe≅EndR(Re) is a division ring.
  • Prove that a semiprime ring with DCC on principal left ideals is semisimple.
  • Decide, for ℤ/12, M2(k), T2(k), ℤ and EndD(V), which minimal left ideals exist and which branch applies.

04Definitions

Minimal left ideal
A left ideal 𝔄≠0 with no left ideal strictly between 0 and 𝔄; equivalently, 𝔄 is simple as a left R-module.
𝔄2
The additive group generated by all products aa′ with a,a′∈𝔄. For a left ideal this is again a left ideal.
soc(RR)
The left socle: the sum of all minimal left ideals of R. It is a two-sided ideal.
Principal left ideal
A left ideal of the form Ra for a single a∈R.
Semisimple ring
A ring that is a direct sum of minimal left ideals as a left module over itself; equivalently left artinian with zero Jacobson radical.

Semisimple here means semisimple as a ring, in the Wedderburn–Artin sense; some older sources use the word for what this collection calls semiprimitive.

05Core Concepts

Where the idempotent comes from

The proof of Brauer's Lemma is a compressed version of an argument used throughout module theory: minimality turns a surjection into an isomorphism, and an isomorphism of a module onto itself produces a fixed point. Concretely, if 𝔄a≠0 then 𝔄a is a nonzero left ideal inside 𝔄, so 𝔄a=𝔄; in particular a=ea for some e∈𝔄, and e acts as an identity on a.

The element e2−e then annihilates a, and the annihilator {x∈𝔄:xa=0} is a left ideal strictly inside 𝔄 — strictly, because e is not in it. Minimality kills the annihilator and hence kills e2−e.

𝔄2≠0⟹𝔄a=𝔄 for some a⟹a=ea⟹e2=e≠0⟹𝔄=Re

What an idempotent generator buys

Once 𝔄=Re with e2=e, three things follow immediately. First, R=Re⊕R(1−e) as left modules, so 𝔄 is a direct summand and in particular a projective simple module. Second, EndR(Re)≅eRe, and since Re is simple, Schur's Lemma makes eRe a division ring. Third, 𝔄 contributes a genuine block to any decomposition of R — which is what makes the socle argument of (10.24) terminate.

Square-zero minimal left ideals are not exotic

In T2(k) the strictly upper triangular matrices form a minimal left ideal with square zero, and in ℤ/12 the ideal {0,6} does the same. Both rings fail to be semiprime, exactly as (10.23) predicts.

06Key Results

Lemma(10.22)Brauer's Lemma

Let 𝔄 be a minimal left ideal in a ring R. Then either 𝔄2=0, or 𝔄=Re for some idempotent e∈𝔄.

Proof

Assume 𝔄2≠0. Then 𝔄a≠0 for some a∈𝔄, and in particular a≠0. Now 𝔄a is a left ideal contained in 𝔄 and nonzero, so minimality gives 𝔄a=𝔄. Since a∈𝔄, there exists e∈𝔄 with a=ea.

Consider ℑ={x∈𝔄:xa=0}, a left ideal contained in 𝔄. It is proper: e∉ℑ because ea=a≠0. By minimality ℑ=0.

Now e2−e∈𝔄 and (e2−e)a=e(ea)−ea=ea−ea=0, so e2−e∈ℑ=0, i.e. e is idempotent, and e≠0 since ea=a≠0. Finally Re⊆𝔄 is a nonzero left ideal, because e=e⋅e∈Re, so minimality gives 𝔄=Re.

Corollary(10.23)Minimal left ideals in a semiprime ring

If 𝔄 is a minimal left ideal in a semiprime ring R, then 𝔄=Re for some idempotent e∈𝔄 with e≠0. Consequently R=Re⊕R(1−e), the module 𝔄 is simple and projective, and eRe is a division ring.

Proof

If 𝔄2=0 then 𝔄 is a nonzero nilpotent left ideal, which (10.16) forbids in a semiprime ring. So Brauer's Lemma leaves only the second alternative. The decomposition R=Re⊕R(1−e) holds for any idempotent, and EndR(Re)≅eRe; since Re is a simple module, Schur's Lemma makes this endomorphism ring a division ring.

Theorem(10.24)Semiprime criterion for semisimplicity

For any ring R the following are equivalent:

  1. R is semisimple;
  2. R is semiprime and left artinian;
  3. R is semiprime and satisfies DCC on principal left ideals.

This is the exact analogue of (4.14), with Jacobson semisimple replaced by the weaker hypothesis semiprime.

Proof

**(1) ⇒ (2).** A semisimple ring is left artinian and has radR=0; since Nil∗R⊆radR, it is semiprime. **(2) ⇒ (3)** is immediate, principal left ideals being left ideals.

**(3) ⇒ (1).** *Step 1: every nonzero left ideal 𝔅 contains a minimal left ideal.* The set {Rb:0≠b∈𝔅} is a nonempty family of principal left ideals, so DCC provides a minimal member Rb. If 0≠ℭ⊆Rb is a left ideal, pick 0≠c∈ℭ; then Rc⊆Rb is nonzero, so Rc=Rb by minimality, whence ℭ⊇Rc=Rb and ℭ=Rb. So Rb is a minimal left ideal inside 𝔅.

Step 2: minimal left ideals are generated by idempotents. This is (10.23), and it is the only place semiprimeness is used.

Step 3: the socle is everything. Let 𝔖=soc(RR) and consider the family {R(1−e):e2=e,Re⊆𝔖}, nonempty because e=0 qualifies. By DCC choose e with R(1−e) minimal in this family, and suppose R(1−e)≠0. By Step 1 it contains a minimal left ideal 𝔄, and by Step 2 𝔄=Rg with g2=g≠0. Since g∈R(1−e) we have ge=0.

Put u=(1−e)g. Then eu=0, ue=(1−e)ge=0 and u2=(1−e)g(1−e)g=(1−e)(g−ge)g=(1−e)g⋅g=u, so u is an idempotent orthogonal to e. Moreover u≠0: otherwise g=eg, and then g=g2=(eg)(eg)=e(ge)g=0. Since u∈𝔄 and Ru≠0, minimality gives Ru=𝔄.

Set f=e+u. Orthogonality makes f idempotent with Rf=Re⊕Ru⊆𝔖. Also 1−f=(1−e)−u∈R(1−e), so R(1−f)⊆R(1−e). The inclusion is strict: if R(1−f)=R(1−e) then R=Rf⊕R(1−f)=Rf⊕R(1−e), yet 0≠𝔄=Ru⊆Rf∩R(1−e), contradicting directness. This contradicts the minimality of R(1−e).

Therefore R(1−e)=0, so 1−e=0 and R=Re⊆𝔖. Thus R is a sum of minimal left ideals, i.e. RR is a semisimple module, i.e. R is a semisimple ring.

Remark—Left and right socles

For a semiprime ring the left socle and the right socle coincide, so the socle is an unambiguous two-sided invariant — a standard result of socle theory, and a further dividend of (10.23). Outside the semiprime world the equality can fail, and the socle must then be qualified by side; triangular rings over a pair of unequal coefficient rings supply the standard counterexamples.

07Proof Techniques and Method

The reusable moves behind the proofs above.

Move 1

Minimality turns onto into iso

A nonzero left ideal inside a minimal one equals it. Applied to 𝔄a, this yields a left identity for a, and left identities are the raw material for idempotents.

Move 2

Kill the error term in an annihilator

To prove e2=e, show e2−e annihilates a witness and that the annihilator is a proper subideal of a minimal ideal, hence zero. This pattern recurs whenever an idempotent must be manufactured.

Move 3

Grow an idempotent

Given orthogonal idempotents e,u, the sum e+u is idempotent and R(e+u)=Re⊕Ru. Iterating under a chain condition on the complements R(1−e) terminates and yields a decomposition of R.

Move 3 is the engine of every semisimplicity by chain condition argument. Note what it requires: not merely that minimal left ideals exist, but that each is a summand. That is precisely the content of (10.23), and it is why the hypothesis is semiprimeness rather than something weaker.

Note also that the orthogonalisation step u=(1−e)g is forced: g itself need not be orthogonal to e, and replacing g by (1−e)g is the standard correction, valid because ge=0 already holds.

08Worked Example

Both branches of Brauer's Lemma inside one ring

Take R=ℤ/12ℤ, which is commutative, so left ideals are ideals. Its minimal ideals are (4)={0,4,8} and (6)={0,6}.

(6)2=(36)=0,4⋅4=16=4, so (4)=R⋅4 with 42=4.
(E.1)

(6) is the square-zero branch; (4) is the idempotent branch, with e=4 corresponding to (0,1) under ℤ/12≅ℤ/4×ℤ/3.

So ℤ/12 is not semiprime — consistent with Nil∗(ℤ/12)=(6)≠0 — and (10.23) correctly refuses to apply to (6). Note also R⋅4≅ℤ/3 is simple, and R=R⋅4⊕R⋅9 where 9=1−4 satisfies 92=81=9.

The archetype: columns in a matrix ring

In R=M2(k) for a field k, the first column 𝔄=RE11={(a0c0)} is a minimal left ideal. It is idempotent-generated with e=E11, its square is nonzero, and eRe=kE11≅k is a division ring — Schur's Lemma in the simplest possible instance. Here R is semiprime and indeed semisimple, and R=RE11⊕RE22.

Failure modes

  • T2(k): the strictly upper triangular matrices form a minimal left ideal 𝔑 with 𝔑2=0. The ring is left artinian but not semiprime, so (10.24) correctly denies semisimplicity.
  • ℤ: semiprime, but 2ℤ⊋4ℤ⊋8ℤ⊋⋯ shows DCC on principal ideals fails, and indeed ℤ has no minimal ideals at all — its socle is zero.
  • EndD(V) for dimDV infinite: semiprime (it is even primitive) with plenty of minimal left ideals Re, e a rank-one idempotent, but no DCC; the socle is the ideal of finite-rank endomorphisms and is a proper ideal.
  • ℤ/6ℤ: semiprime and finite, hence artinian, so (10.24) gives semisimplicity — and indeed ℤ/6≅ℤ/2×ℤ/3.

Sanity check

Every example above obeys the rule: a minimal left ideal is a summand exactly when the ring has no nonzero nilpotent left ideal in which that minimal ideal could hide.

09Frameworks and Models

Classify a ring by what its minimal left ideals do. Three regimes cover everything.

  • Minimal left ideals of R
    • None at all — soc(RR)=0
      • ℤ, k[x], k[[x]]
      • any domain that is not a division ring
      • no chain condition on principal left ideals
    • Some, all square zero or mixed — R not semiprime
      • ℤ/12 — one of each kind
      • Tn(k) for n≥2
      • the square-zero ones lie in Nil∗R
    • All idempotent-generated — R semiprime
      • Mn(D) and every semisimple ring
      • EndD(V), socle proper
      • semisimple exactly when the socle is all of R

The third regime splits by size of the socle, and (10.24) says the split is governed by a chain condition: semiprime plus DCC on principal left ideals forces soc(RR)=R.

10Comparison and Classification

Minimal left ideals in standard rings
RingSemiprime?A minimal left idealBranch of (10.22)
Mn(D)yesa column RE11idempotent
ℤ/6yes(2) and (3)idempotent (32=3, 42=4)
ℤ/12no(4) and (6)one of each
T2(k)nostrictly upper triangularsquare zero
EndD(V), dimV infiniteyesRe, e of rank oneidempotent
ℤyesnone existsnot applicable
k[[x]]yesnone existsnot applicable
Which hypothesis delivers which conclusion
Minimal left ideals existThey are summandsR semisimple
Semiprime○no●yes○no
radR=0○no●yes○no
DCC on principal left ideals●yes○no○no
Left artinian●yes○no○no
Semiprime + DCC on principal left ideals●yes●yes●yes

Which hypothesis delivers which conclusion

11Relationship Map

All ringsBrauer's Lemma applies: two branches
Semiprimeonly the idempotent branch survives; socle is a two-sided ideal, left socle = right socle
Semiprime + DCC on principal left idealssocle is all of R
SemisimpleR≅Mn1(D1)×⋯×Mnr(Dr)

The same picture with Jacobson semisimple in place of semiprime is (4.14); since radR=0 implies Nil∗R=0 but not conversely, (10.24) is the stronger statement. Both collapse to Wedderburn–Artin at the bottom.

𝔄 minimal left ideal⟹𝔄=Re⟹𝔄 projective simple⟹𝔄 is a summand of RR

12Design Considerations

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

  • Which chain condition? DCC on principal left ideals is much weaker than left artinian and is all that (10.24) needs. State the weaker hypothesis when you can: it applies to rings of endomorphisms and to many rings of operators where full artinian-ness fails.
  • Which zero-radical hypothesis? If your ring is known to have no nilpotent ideals, use semiprimeness; reaching for radR=0 imposes a condition you may not be able to verify and do not need.
  • Which side? Semiprimeness is side-symmetric, so the left-handed statements here have right-handed twins. The socle is genuinely side-dependent in general, but not for semiprime rings.
  • Idempotents or modules? Working with Re keeps everything inside the ring and makes decompositions explicit; working with simple modules is cleaner for functorial arguments. Brauer's Lemma is the bridge, and it is the ring-side statement.

13Failure Modes and Common Mistakes

Minimal left ideals need not exist

Brauer's Lemma is a conditional statement. In ℤ, k[x] or k[[x]] there are no minimal left ideals at all and the socle is zero, even though all three rings are semiprime. Existence is supplied by a chain condition, not by semiprimeness.

𝔄2≠0 is not a2≠0

The first branch of Brauer's Lemma concerns the product of the ideal with itself, not squares of individual elements. A minimal left ideal can contain elements a with a2=0 while 𝔄2≠0; in M2(k) the column RE11 contains E21, and E212=0.

Do not weaken semiprime to semiprimitive-free

(10.24) fails without semiprimeness even under full left artinian-ness: T2(k) is finite-dimensional and not semisimple. The hypothesis is doing real work, and the failure is precisely the square-zero minimal left ideal.

  • Do not assume eRe is a division ring for an arbitrary idempotent; that requires Re to be a minimal left ideal.
  • Do not confuse the socle of the ring with Nil∗R; in ℤ/12 the socle contains both (4) and (6) while the prime radical is (6).
  • Do not assume the socle is a direct summand as a two-sided ideal; it is a sum of left-module summands, which is weaker.

14Best Practices

  • When you find a minimal left ideal, immediately test 𝔄2; the answer decides everything else about it.
  • Use (10.23) to convert existence statements about simple modules into explicit idempotents, which are computable objects.
  • State chain conditions in the weakest form your proof uses — DCC on principal left ideals rather than left artinian — so the result applies more widely.
  • In examples, always exhibit the complementary idempotent 1−e; it is the quickest check that the decomposition is genuine.

15Quick Reference

Brauer's Lemma𝔄 minimal left ideal ⇒𝔄2=0 or 𝔄=Re
Semiprime casealways 𝔄=Re, e2=e≠0
ConsequenceR=Re⊕R(1−e); 𝔄 simple projective
SchurEndR(Re)≅eRe is a division ring
Semisimplicitysemiprime + DCC on principal left ideals
Compare(4.14): radR=0 + same DCC
Soclesoc(RR)=soc(RR) for semiprime R
Warningminimal left ideals may not exist (ℤ, k[[x]])
Proof map
StepHypothesis usedOutput
𝔄a=𝔄minimality of 𝔄left identity e for a
Annihilator vanishesminimality of 𝔄e2=e
Exclude 𝔄2=0semiprimeness, via (10.16)𝔄=Re
Minimal ideal inside any 𝔅DCC on principal left idealssocle is large
Grow e to e+uorthogonalisation u=(1−e)gR(1−e) shrinks strictly
TerminateDCC againR=soc(RR)

16Frequently Asked Questions

Why is the second branch of Brauer's Lemma stated as 𝔄=Re rather than just contains an idempotent?

Because containing an idempotent is not enough for the applications. The point is that a single idempotent e∈𝔄 generates all of 𝔄, which is what makes 𝔄 a direct summand of RR via R=Re⊕R(1−e). Minimality upgrades containment to equality for free: Re is a nonzero left ideal inside a minimal one.

Does (10.24) really improve on the Jacobson-radical version?

Yes, strictly. Semiprimeness is weaker than radR=0, since Nil∗R⊆radR can be a strict inclusion — ℤ(p) is semiprime with nonzero Jacobson radical. So (10.24) concludes semisimplicity from less. Under the chain condition the two hypotheses turn out to be equivalent, but that is a consequence of the theorem, not an assumption.

What replaces Brauer's Lemma for minimal right ideals?

The mirror statement, proved by the same argument in Rop: a minimal right ideal 𝔄 satisfies 𝔄2=0 or 𝔄=eR for an idempotent e∈𝔄. Since semiprimeness is left-right symmetric, the semiprime corollary is symmetric too, and in that case the left and right socles agree.

Where does the socle appear elsewhere in the theory?

It is the object that measures how much of a ring is semisimple. For left primitive rings the socle is either zero or a minimal two-sided ideal isomorphic to a ring of finite-rank operators, which is the content of the structure theory in Minimal Ideals and the Socle of a Primitive Ring. The module-level notion is developed in The Socle of a Module and of a Ring.

Is DCC on principal left ideals a natural hypothesis?

It is exactly the condition needed to run the descent in Step 3, and it is genuinely weaker than left artinian. It also has an independent life: rings satisfying it are the left perfect-adjacent objects studied by Bass, and DCC on principal right ideals is one of the standard equivalent forms of left perfectness.

17Related KEVOS Topics

The SocleThe socle soc(M) is the sum of all simple submodules of M — the largest semisimple part of an otherwise arbitrary moduleSocle of a Primitive RingIn a semiprime ring, Ra minimal forces aR minimal, so the left and right socles coincide. For a ring with a minimal leftPrime 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, (10.22)–(10.24).
  2. T. Y. Lam, Lectures on Modules and Rings, Graduate Texts in Mathematics 189, Springer-Verlag, 1999, Chapters 3 and 4 (socles and Goldie theory).
  3. N. Jacobson, Structure of Rings, American Mathematical Society Colloquium Publications 37, revised edition, 1964, Chapter IV.
  4. F. W. Anderson and K. R. Fuller, Rings and Categories of Modules, 2nd edition, Graduate Texts in Mathematics 13, Springer-Verlag, 1992, §9 and §13.
  5. L. H. Rowen, Ring Theory, Volume I, Academic Press, 1988, Chapter 2.

19AI Suggested Questions

  • Give a ring with a minimal left ideal but no minimal right ideal, and explain why semiprimeness rules this out.
  • Prove that the socle of a semiprime ring is a two-sided ideal and equals the right socle.
  • How does Brauer's Lemma specialise to group algebras kG with chark dividing |G|?
  • Work out the socle of EndD(V) for infinite-dimensional V and check it is a minimal two-sided ideal.
  • Explain the relationship between (10.24) and Bass's characterisation of left perfect rings by DCC on principal right ideals.
  • Which parts of the proof of (10.24) survive for rings without identity?
Page
KEVOS-ENG-MATH-NCR-0081
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. Frameworks and Models
  10. Comparison and Classification
  11. Relationship Map
  12. Design Considerations
  13. Failure Modes and Common Mistakes
  14. Best Practices
  15. Quick Reference
  16. Frequently Asked Questions
  17. Related KEVOS Topics
  18. References
  19. AI Suggested Questions

Continue learning

The Lower Nilradical of Polynomial and Matrix RingsArticle · Engineering MathematicsNEXT LESSON →The Upper Nilradical and the Köthe ConjectureArticle · Engineering MathematicsPrime and Semiprime RingsArticle · Engineering MathematicsThe Levitzki Radical and Locally Nilpotent IdealsArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®