← LibraryBasic Idempotents | KEVOS® MathematicsProject Delivery · Project ManagementLesson 40/352← PrevNext →
ArticlePublished 9 Aug 202616 min readBy Kevin Jogin
Skip to content

Engineering Mathematics Advanced Basic rings

Basic Idempotents

A basic idempotent of a semiperfect ring is a sum of orthogonal primitive idempotents picking out each principal indecomposable exactly once; it is automatically full, and the corner ring eRe it determines is independent of the choice.

Page ID
KVS-ENG-MATH-0310
Taxonomy
ENG / ENG-MATH
Collection
noncommutative-rings-core
Source
(25.5)–(25.7), §25 (pp. 374–376)
Reviewed
2026-08-08
Version
1.0.0

Executive Summary

In a semiperfect ring R the identity decomposes as 1=e1++en into orthogonal primitive idempotents, but the modules ejR repeat: each isomorphism type occurs with a multiplicity. A basic idempotent is a subsum that keeps exactly one representative of each type.

Lam's (25.6) says the resulting idempotent e is fullReR=R — and that the corner ring eRe is determined up to isomorphism, independently of every choice made along the way, and is itself semiperfect. That corner ring is the basic ring of R, the smallest ring carrying the same module theory.

e=e1++erOne per isomorphism type
ReR=RAlways full
eReUnique up to isomorphism
(25.5)–(25.7)Lam's definition and results

Overview

The classification of principal indecomposables says that the projective right modules over a semiperfect ring are governed by a finite list e1R,,erR. The regular module RR realises that list with multiplicities n1,,nr, and those multiplicities are exactly the matrix sizes in R¯=R/radRiMni(Di).

Multiplicities carry no information about the module category — Mn(R) and R have equivalent module categories for every n. Deleting them is the point of a basic idempotent.

RRn1(e1R)nr(erR)eR=e1RerR,
(25.5)

The passage from the regular module to a basic idempotent: keep the list, discard the multiplicities.

Right modules throughout. A basic idempotent defined by the right principal indecomposables also works on the left, because e and the corner ring eRe are two-sided objects; only the labelling of the list changes.

Learning Objectives

  • State the definition (25.5) of a basic idempotent and of a basic ring.
  • Explain why a basic idempotent exists in every semiperfect ring.
  • Prove ReR=R using the semisimple quotient and Nakayama's Lemma.
  • Prove that two basic idempotents give isomorphic corner rings.
  • Compute a basic idempotent of Mn(k), of a semisimple ring and of a product.
  • Explain why eRe is itself a basic semiperfect ring.

Definitions

Definition(25.5)Basic idempotent, basic ring

Let R be a semiperfect ring. An idempotent eR is basic if it can be written e=e1++er with the ei mutually orthogonal primitive idempotents such that e1R,,erR represent a complete set of isomorphism classes of principal indecomposable right R-modules — each class occurring exactly once. A basic ring of R is any ring of the form eRe with e a basic idempotent.

Existence is immediate: take any decomposition 1=e1++en into orthogonal primitive idempotents, which (23.6) supplies, and keep one ej from each isomorphism class of the modules ejR. The number of summands is then r, the number of simple right R-modules.

Full idempotent
ReR=R. Equivalently the right module eR generates every right R-module, i.e. eR is a generator.
eRe
The corner ring, with identity e. Its radical is e(radR)e=eReradR, and eRe/rad(eRe)e¯R¯e¯.
Multiplicity ni
The number of times eiR occurs in a decomposition of RR into principal indecomposables; equal to the matrix size in the i-th Wedderburn factor of R¯.
Basic ring
eRe for e basic. Determined up to isomorphism by R alone, by (25.6).

Core Concepts

Why fullness is the right property

For an arbitrary idempotent e, the corner ring eRe can be much poorer than R: taking e to be a primitive idempotent of Mn(k) collapses everything to k, which is fine, but taking e to miss an isomorphism class of principal indecomposables loses a simple module for good. Fullness ReR=R is exactly the condition that no information is lost, and the corner ring theory of §21 is stated in those terms.

e basicR¯e¯R¯=R¯ReR+J=RReR=R

The chain is the proof of (25.6) in miniature: verify fullness in the semisimple quotient, where it is a statement about simple rings, then remove the radical with Nakayama's Lemma.

The corner ring as an endomorphism ring

The identification eReEndR(eR) converts uniqueness of the basic ring into uniqueness of the module eR. Two basic idempotents give modules eR and eR that are isomorphic — both are the direct sum of one copy of each principal indecomposable — so their endomorphism rings are isomorphic. No compatibility between the two idempotents is needed.

Minimal progenerators

A finitely generated projective module is a generator precisely when every principal indecomposable occurs in it. So eR for e basic is a projective generator with all multiplicities equal to 1 — the smallest one available. This is the reason eRe deserves the name basic ring, and the reason it is Morita equivalent to R.

Key Results

Proposition(25.6)Fullness and uniqueness of the basic ring

Let R be a semiperfect ring and eR a basic idempotent. Then:

  1. e is full, i.e. ReR=R;
  2. if e is any other basic idempotent of R then eReeRe as rings;
  3. eRe is a semiperfect ring.
Proof

Write e=e1++er as in (25.5), put J=radR and R¯=R/JS1××Sr with each Si simple artinian. Each e¯i is a primitive idempotent of R¯, so e¯iR¯ is a simple right ideal and e¯i lies in exactly one component; because e1R,,erR is a complete irredundant list of principal indecomposables, the modules e¯iR¯ exhaust the simple right R¯-modules without repetition, so after relabelling e¯iSi for each i.

(1). The two-sided ideal R¯e¯iR¯ is a nonzero ideal of R¯ contained in Si; as Si is a simple ring, R¯e¯iR¯=Si. Summing over i gives R¯e¯R¯=S1Sr=R¯, that is, ReR+J=R. The right R-module R/ReR is cyclic, hence finitely generated, and (R/ReR)J=(J+ReR)/ReR=R/ReR; Nakayama's Lemma forces R/ReR=0, i.e. ReR=R.

(2). Let e=e1++er be a second basic idempotent. Both lists of principal indecomposables are complete and irredundant, so r=r and, after reindexing, eiReiR for every i. Hence eR=ieiRieiR=eR, and therefore

eReEndR(eR)EndR(eR)eRe.
(25.6)

(3). eR is a finitely generated projective right R-module, so EndR(eR)eRe is semiperfect by (25.3)(3); equivalently, eR is a finite direct sum of strongly indecomposable modules and (23.8) applies.

CorollaryA basic ring is basic

Let R be semiperfect with basic idempotent e and B=eRe. Then B/radB is a finite direct product of division rings, so 1B=e is a basic idempotent of B and B is its own basic ring.

Proof

By the corner ring theory, radB=eJe and B/radBe¯R¯e¯. With the labelling of the previous proof, e¯iR¯e¯j=0 for ij because e¯i and e¯j lie in different simple components, while e¯iSie¯iEnd(e¯iR¯) is a division ring since e¯iR¯ is simple. Hence

B/radBD1××Dr,Di=e¯iR¯e¯ia division ring,
(E.0)

A finite product of division rings — exactly the criterion for a semiperfect ring to be basic.

Example(25.7)Three standard computations
  1. R=Mn(k) with k local. There is a single principal indecomposable, so e=E11 is basic and eRe=kE11k: the basic ring of a matrix ring over a local ring is that local ring.
  2. R commutative semiperfect. By (23.11), R is a finite product of local rings, whose primitive idempotents give pairwise non-isomorphic principal indecomposables; hence 1 is the only basic idempotent and R is its own basic ring.
  3. R=i=1tMni(Di) semisimple. Applying the first computation componentwise, any basic ring of R is isomorphic to D1××Dt.
RemarkBasic idempotents are not unique

Only the ring eRe is canonical. In M2(k) both E11 and E22 are basic, as is (1000) conjugated by any invertible matrix; all give corner rings isomorphic to k. There is in general no canonical choice, and none is needed.

Proof Techniques and Method

How these proofs work, and which move to reuse.

Move 1

Prove ideal identities modulo the radical

An equality of ideals 𝔄=R is proved by checking 𝔄+J=R and applying Nakayama to the cyclic module R/𝔄. Downstairs the statement is about simple rings, where every nonzero ideal is everything.

Move 2

Replace a ring by an endomorphism ring

eReEndR(eR) turns a question about idempotents into a question about a module. Modules are easier to compare, because isomorphism of modules is exactly what the classification theorem controls.

Move 3

Compute corners componentwise

Over a product of simple rings, e¯iR¯e¯j vanishes unless i=j, so a corner of a semisimple ring is a product of the diagonal corners. Each diagonal corner is a division ring when the idempotent is primitive.

Move 1 is the workhorse of the whole chapter. It is worth noticing that it needs finite generation of R/𝔄 — free here, since the module is cyclic — and nothing else; no chain condition is used anywhere in (25.6).

Worked Example

A ring with repeated and unrepeated types

Let k be a division ring and take

R=M2(k)×T2(k),dimkR=4+3=7,
(E.1)

T2(k) is the ring of upper triangular 2×2 matrices. Both factors are finite-dimensional, hence semiperfect, hence so is the product.

Write f1=(E11,0), f2=(E22,0), f3=(0,E11), f4=(0,E22). These are orthogonal primitive idempotents with f1+f2+f3+f4=1, so RR=f1Rf2Rf3Rf4R with k-dimensions 2,2,2,1.

The types: f1Rf2R (the two rows of M2(k) are isomorphic modules), while f3R and f4R are non-isomorphic to each other and to f1R, since they are annihilated by the first factor. Hence r=3 and the multiplicities are n=(2,1,1), matching

R¯=R/radRM2(k)×k×k,radR=0×(0k00).
(E.2)

A basic idempotent is therefore e=f1+f3+f4=(E11,1), and

eRe=E11M2(k)E11×T2(k)k×T2(k),dimkeRe=1+3=4.
(E.3)

The multiplicity 2 has been removed from the first factor; the second factor was already basic.

Checking fullness by hand

In the first coordinate, M2(k)E11M2(k) contains Ei1E11E1j=Eij for all i,j, hence is all of M2(k). In the second coordinate e acts as the identity. So ReR=R, as (25.6) predicts. Note also e¯R¯e¯k×k×k, a product of division rings, confirming that eRe is basic.

Process and Workflow

Split the identityWrite 1=e1++en with orthogonal primitive idempotents. For a matrix presentation the diagonal matrix units usually work.
Group by isomorphism typeDecide which ejR are isomorphic. Equivalently, compare e¯jR¯ inside the semisimple quotient, or test the criterion of (21.20).
Select representativesChoose one idempotent per class and add them up. Any choice works; the sum is a basic idempotent.
Form the cornerCompute eRe. Verify e¯R¯e¯ is a product of division rings as a check that the selection was irredundant.

Is a given idempotent e basic?

Check the quotientCompute e¯R¯e¯. If it is a finite product of division rings and R¯e¯R¯=R¯, then e is basic.
Count summandsDecompose eR into principal indecomposables. e is basic exactly when every type occurs, and occurs once.
Full but not basicFullness alone is weaker: e=1 is always full, and so is any idempotent whose module eR contains every type with any multiplicities.

Comparison and Classification

Basic idempotents and basic rings in examples
Ring RTypes rA basic idempotentBasic ring eRe
Division ring D11D
Mn(D)1E11D
Mn(k), k local1E11k
i=1tMni(Di)tone E11 per factorD1××Dt
Tn(k), k a division ringn1Tn(k) itself
Commutative semiperfectnumber of local factors1R itself
M2(k)×T2(k)3(E11,1)k×T2(k)
Properties of an idempotent e in a semiperfect ring
e primitivee basice=1e central
ReR=R automaticnoyesyesno
eRe semiperfectyesyesyesyes
eRe localyesnonono
eRe determined by R alonepartialyesyesno
eR a generator of the module categorynoyesyesno

Properties of an idempotent e in a semiperfect ring

The row *eRe determined by R alone* is marked part for primitive e: the corner ring is determined once the isomorphism type of e is fixed, but different primitive idempotents can give non-isomorphic local rings when R has several types.

Relationship Map

  • Idempotents of a semiperfect ring R
    • Primitive eRe local; eR a principal indecomposable
      • sums of these give every idempotent up to isomorphism
      • not full in general
    • Basic — one summand per isomorphism type
      • always full: ReR=R
      • eR is a minimal progenerator
      • eRe unique up to isomorphism, semiperfect and basic
    • Central — gives block decompositions
      • eRe=eR is a two-sided ideal and a ring
      • full only if e=1
e basice fullideal lattices of eRe and R agreeblocks correspond

The final implication is the content of the basic ring theorem, which uses fullness through the corner ring correspondence 𝔄R𝔄R.

Design Considerations

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

  • Whether to pass to the basic ring at all. Do it when the question is categorical — modules, Ext groups, block structure. Do not do it when the question concerns R itself as a ring, such as its centre's dimension, its cardinality, or a specific matrix realisation.
  • Which representatives to pick. Any selection works, so pick the ones with the simplest description: diagonal matrix units, vertex idempotents of a quiver, or the idempotents already used to present R.
  • Left or right. The list of principal indecomposables can be indexed by either side; the resulting basic idempotents are basic for both, since eRe does not know which side defined it.
  • Keeping the multiplicities. The data lost is exactly the tuple (n1,,nr) of matrix sizes in R¯. Record it separately if the original ring must be reconstructed.

Failure Modes and Common Mistakes

  • Do not expect a canonical basic idempotent. Only the isomorphism class of eRe is well defined.
  • Do not apply the construction to a ring that is merely semilocal: without idempotent lifting, the list of principal indecomposables may not exist.
  • Do not assume dimeRe divides dimR or bears any simple relation to it; the example above has 7 and 4.
  • Do not confuse the multiplicity ni of a type in RR with the composition multiplicity of a simple module in a principal indecomposable.

Quick Reference

HypothesisR semiperfect, J=radR, r = number of simple right R-modules
Definitione=e1++er orthogonal primitive, the eiR a complete irredundant list
ExistenceTake a subsum of any decomposition 1=e1++en
FullnessReR=R, proved via R¯ and Nakayama
UniquenesseReEndR(eR) is independent of the choice
SemiperfectnesseRe is semiperfect, and is its own basic ring
Radicalrad(eRe)=e(radR)e; eRe/rad(eRe)D1××Dr
Trivial casee=1 is basic exactly when R is a basic ring
Statement locator
FactStatementReference
Definitionbasic idempotent, basic ring eRe(25.5)
Fullnesse basic ReR=R(25.6)
UniquenesseReeRe for basic e,e(25.6)
Semiperfect cornerEndR(P) semiperfect for f.g. projective P(25.3)(3), (23.8)
Corner radicalrad(eRe)=e(radR)e(21.10)
Ideal correspondence𝔄R𝔄R bijective for full e(21.11)
ExamplesMn(k), commutative, semisimple(25.7)

Frequently Asked Questions

Why is a basic idempotent automatically full?

Because in the semisimple quotient each e¯i sits in a different simple component and generates it as a two-sided ideal, so the e¯i together generate all of R¯. Lifting is then a one-line application of Nakayama's Lemma to the cyclic module R/ReR. Irredundancy is not needed for fullness — completeness is.

Can two different basic idempotents give non-isomorphic corner rings?

No, and that is the point of (25.6). Both corner rings are endomorphism rings of the module e1RerR, which is determined up to isomorphism by R alone.

Is a basic idempotent unique up to conjugation by a unit?

Not in general. Two basic idempotents are built from isomorphic idempotents in the sense of (21.20), which gives an isomorphism of the corresponding modules but not automatically an inner automorphism of R. Conjugacy holds in favourable cases, such as matrix rings over local rings, but should not be assumed.

What happens if I select two idempotents from the same isomorphism class?

The resulting idempotent is still full, and the corner ring is still semiperfect and Morita equivalent to R, but it is no longer basic: its semisimple quotient acquires a matrix factor of size at least 2. The construction degrades gracefully, but the minimality is lost.

How do I recognise a basic ring without computing idempotents?

Reduce modulo the radical: a semiperfect ring is basic exactly when R/radR is a finite direct product of division rings. That criterion is proved on the Basic Rings and Morita Reduction page and needs no idempotent bookkeeping.

Does the basic idempotent depend on choosing right modules rather than left?

No. The number of isomorphism classes of principal indecomposables is the same on both sides — it is the number of simple components of R/radR — and an idempotent basic for the right theory is basic for the left theory as well.

References

  1. T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §25 (pp. 374–376).
  2. T. Y. Lam, Lectures on Modules and Rings, Graduate Texts in Mathematics 189, Springer-Verlag, 1999, §18 (Morita theory).
  3. F. W. Anderson and K. R. Fuller, Rings and Categories of Modules, 2nd edition, Graduate Texts in Mathematics 13, Springer-Verlag, 1992, §21 and §27.
  4. C. W. Curtis and I. Reiner, Methods of Representation Theory, Volume I, Wiley-Interscience, 1981, §6.
  5. L. H. Rowen, Ring Theory, Volume I, Academic Press, 1988, Chapter 2.

AI Suggested Questions

  • Prove that eR is a generator for the category of right R-modules if and only if ReR=R.
  • Compute a basic idempotent and the basic ring of the group algebra kCp over a field of characteristic p, and then of M3(kCp).
  • Give an example of a full idempotent that is not basic and describe how its corner ring differs.
  • Show that a semiperfect ring and its basic ring have the same number of blocks.
  • How does one recover R from its basic ring together with the multiplicities n1,,nr?
  • Explain the relation between basic idempotents and the vertex idempotents of a quiver presentation.
  • For which semiperfect rings is every full idempotent basic?
Page
KVS-ENG-MATH-0310
Path
Engineering / Mathematics
Template
kevos-knowledge-article-v2
KEVOS® Knowledge Library — reviewed 2026-08-08

Continue learning

Absolutely Irreducible Modules | KEVOS® MathematicsArticle · Project ManagementAdditive Commutators | KEVOS® MathematicsArticle · Project ManagementAlgebraic and Geometric Multiplicities of Eigenvalues | KEVOS® MathematicsArticle · Project ManagementAlgebraically Closed Division Rings | KEVOS® MathematicsArticle · Project Management