← LibraryBlocks of Semiperfect Rings | KEVOS® MathematicsProject Delivery · Project ManagementLesson 45/352← PrevNext →
ArticlePublished 9 Aug 202617 min readBy Kevin Jogin
Skip to content

Engineering Mathematics Advanced Basic rings

Blocks of Semiperfect Rings

Every semiperfect ring splits into finitely many indecomposable two-sided ideals, its blocks; the primitive idempotents lying in a given block are exactly one linkage class, so the blocks are the connected components of the graph on principal indecomposables with an edge wherever Hom is nonzero.

Page ID
KVS-ENG-MATH-0309
Taxonomy
ENG / ENG-MATH
Collection
noncommutative-rings-core
Source
(25.4), §25 (pp. 373–374)
Reviewed
2026-08-08
Version
1.0.0

Executive Summary

A semiperfect ring R always decomposes as a finite direct product of indecomposable rings. The summands, its blocks, are the ideals ciR for the centrally primitive idempotents c1,,cs, and the decomposition is unique up to order. This is Lam's (25.4), obtained by feeding the idempotent decomposition of a semiperfect ring into the general block machinery of §22.

The useful content is the combinatorial description of the partition: two primitive idempotents lie in the same block precisely when they are linked, and linkage is connectedness in the graph whose vertices are the principal indecomposable modules and whose edges record nonzero homomorphisms. Everything about R — modules, Cartan invariants, homological algebra — decomposes accordingly.

c1,,csCentrally primitive idempotents
UniqueUp to reordering
Hom0Edge in the linkage graph
(25.4)Lam's theorem

Overview

Decomposing a ring into a direct product is the crudest possible simplification, and it is not always available: i=1 has infinitely many central idempotents and no finest decomposition. What makes a block decomposition exist is the ability to write 1 as a finite sum of orthogonal primitive idempotents, and that is exactly what semiperfectness delivers.

1=e1++en(orthogonal, local)1=c1++cs(orthogonal, centrally primitive),
(23.6) → (22.5)

Each ci is the sum of one linkage class of the ej; the passage from the left-hand decomposition to the right-hand one is the whole content of the block theorem.

Blocks are coarser than the simple components of R¯=R/radR, sometimes strictly so, because a central idempotent of R¯ need not lift to a central idempotent of R. The ring of upper triangular matrices is the standard witness: it is indecomposable, yet its semisimple quotient is a product of n copies of a division ring.

Right modules throughout, following §25. The block decomposition itself is two-sided — the ci are central — so nothing here depends on the side; only the description via right modules does.

Learning Objectives

  • Recall the definitions of central, centrally primitive and linked idempotents.
  • State (25.4) with the hypothesis semiperfect in place and identify where it is used.
  • Prove that a sum of a linkage class of orthogonal primitive idempotents is central.
  • Deduce that HomR(M,N)=0 for modules in distinct blocks.
  • Compare the number of blocks of R with the number of simple components of R/radR.
  • Compute the blocks of Tn(k), of /12 and of a commutative semiperfect ring.

Definitions

Central idempotent
c=c2 with cr=rc for all rR; equivalently cR and (1c)R are two-sided ideals and RcR×(1c)R as rings.
Centrally primitive
c0 central idempotent that cannot be written as a sum of two nonzero orthogonal central idempotents; equivalently the ring cR is indecomposable.
Block
The ring ciR for ci centrally primitive, with identity element ci. It is a two-sided ideal of R but not a subring containing 1 unless ci=1.
ee
For e,eE: there exists fE with eRf0eRf. Reflexive and symmetric, not transitive in general.
Linked
e and e are related by the equivalence relation generated by , that is, by a finite chain eg1gme of primitive idempotents.
Remark(21.6)Linkage is a Hom condition

Since HomR(fR,eR)eRf, the condition eRf0 says exactly that some nonzero homomorphism fReR of principal indecomposables exists. Linkage is therefore a statement about the category of modules, not about the chosen idempotents.

Core Concepts

From orthogonal idempotents to central ones

Fix a decomposition 1=e1++en into orthogonal primitive idempotents, available for any semiperfect ring. Partition {e1,,en} into linkage classes and let c1,,cs be the class sums. Each ci is an idempotent because the ej are orthogonal, and the ci are orthogonal with ici=1. The point of the construction is that ciRcj=0 whenever ij: an element of epReq with ep,eq in different classes must vanish, since epReq0 would link them.

orthogonal primitive ejlinkage classesclass sums cicentral, centrally primitive

The linkage graph

Build a graph Γ with one vertex for each ej and an edge between ep and eq whenever epReq0. Then epeq implies ep and eq lie in the same component of Γ, and conversely — for if eRf0 then also fRff0, so ef directly. A witness fE outside the chosen list may always be replaced by one inside it, because fRekR for some k forces eRfHomR(fR,eR)eRek.

So the blocks of R are the connected components of Γ, and the number of blocks is a purely graph-theoretic count once the products epReq are known.

Why blocks are coarser than Wedderburn components

Reducing modulo J=radR sends the ci to nonzero central idempotents c¯i of R¯ — nonzero because J contains no nonzero idempotent. Hence each block of R accounts for at least one simple component of R¯, and the simple components are partitioned by the blocks. The partition can be non-trivial: nothing forces c¯i to be centrally primitive in R¯, since the central idempotents of R¯ need not lift to central idempotents of R.

Key Results

Theorem(25.4)Block decomposition of a semiperfect ring

Let R0 be a semiperfect ring and let E be its set of primitive idempotents. Then:

  1. 1 is a sum of finitely many orthogonal centrally primitive idempotents c1,,cs, so that R=c1RcsR is a direct sum of indecomposable two-sided ideals;
  2. this decomposition is unique up to a permutation of the summands, and c1,,cs are the only centrally primitive idempotents of R;
  3. two primitive idempotents e,eE lie in the same block ciR if and only if they are linked;
  4. each block ciR, regarded as a ring with identity ci, is itself semiperfect and indecomposable.
Proof

Existence. Because R is semiperfect, (23.6) gives 1=e1++en with the ej mutually orthogonal local idempotents; local idempotents are primitive, so ejE. Let c1,,cs be the sums over the linkage classes of {e1,,en}. These are orthogonal idempotents with ici=1, and ciRcj=0 for ij as observed above.

Centrality. For aR compute, using jcj=1 and ciRcj=0 for ji: cia=cia(jcj)=ciaci=(jcj)aci=aci. Hence each ci is central.

Central primitivity and (3). If c is a nonzero central idempotent, then by (22.4) every eE lies in cR or in (1c)R, and by (22.3) linked idempotents make the same choice. So the set of ej lying in cR is a union of linkage classes, whence c is a sum of some of the ci. Applying this to a hypothetical splitting of a single ci shows ci is centrally primitive, and it shows simultaneously that e,eE belong to the same block exactly when they are linked, which is (22.5).

Uniqueness. By (22.1), once 1 is a sum of orthogonal centrally primitive idempotents, those idempotents are the only centrally primitive ones and the decomposition is unique up to order.

(4). The ring isomorphism Rc1R××csR identifies radR with iciradR, so ciR/ciradR is a direct factor of the semisimple ring R¯ and is semisimple; idempotents lift componentwise. Hence each block is semiperfect, and it is indecomposable because ci is centrally primitive.

CorollaryModules belong to blocks

Let R be semiperfect with blocks c1R,,csR. Every right R-module M decomposes as M=Mc1Mcs, each Mci being a module over the block ciR. Consequently an indecomposable module satisfies M=Mci for exactly one i, and HomR(M,N)=0 whenever M and N belong to distinct blocks.

Proof

The ci are central orthogonal idempotents summing to 1, so each Mci is a submodule and M=iMci. If M is indecomposable exactly one summand is nonzero. For the last claim, let f:MN with M=Mci and N=Ncj, ij; then f(M)=f(Mci)=f(M)ciNci=0.

CorollaryBlocks refine to Wedderburn components

With R semiperfect, s its number of blocks, and R¯j=1tMnj(Dj) the Wedderburn decomposition of R/radR, the images c¯1,,c¯s are nonzero orthogonal central idempotents of R¯ summing to 1. Hence st, and the t simple components are partitioned into s nonempty groups, one per block.

Remark(23.10)The extreme case

If R is semiperfect and R¯ is simple, then t=1, so s=1 and R is indecomposable; in fact RMn(k) for some local ring k and some n1, both uniquely determined. The converse fails: indecomposability of R says nothing about the indecomposability of R¯.

Proof Techniques and Method

How these proofs work, and which move to reuse.

Move 1

Centrality from vanishing corners

To prove an idempotent c is central it suffices to show cRc=cRc=0 for the complementary idempotent c=1c. Inserting 1=c+c on both sides of ca and ac then collapses everything.

Move 2

Equivalence classes as idempotent sums

A relation on a finite orthogonal decomposition of 1 becomes an algebraic object by summing over classes. This is how a combinatorial partition produces genuine ring-theoretic direct factors.

Move 3

Test central idempotents on primitive ones

Any central idempotent c splits each eE: either ce=e or ce=0. Comparing the two options across a linkage chain shows c is a union of classes, which forces both primitivity and uniqueness.

Move 3 is the reusable one. It reduces every question about the lattice of central idempotents to a question about how the finite set E is partitioned, and it is the reason the block decomposition is unique while decompositions into non-central idempotents are not.

Worked Example

Upper triangular matrices: one block, many components

Let k be a division ring and R=Tn(k), with ei=Eii and 1=e1++en. For i<j we have eiRej=kEij0, so consecutive idempotents are linked and the linkage graph is connected.

e1e2ens=1,whileR¯k××kn,t=n.
(E.1)

Tn(k) is indecomposable as a ring for every n, although its semisimple quotient has n simple components. Central idempotents do not lift here.

Concretely for n=2: a central idempotent c=(ab0d) must commute with E12, and cE12=aE12 while E12c=dE12, forcing a=d; idempotency then gives a=d{0,1} and b=0 in either case. So the only central idempotents are 0 and 1.

A commutative example: /12

By the Chinese Remainder Theorem /12/4×/3, and both factors are local, so the ring is semiperfect with exactly two blocks. The centrally primitive idempotents are the CRT idempotents c1=9 and c2=4: indeed 92=81=9 and 42=16=4 in /12, with 9+4=13=1 and 94=36=0.

/12=9(/12)4(/12),9R/4,4R/3.
(E.2)

Here s=t=2: for a commutative semiperfect ring the blocks are the local factors and each is its own Wedderburn component, so the inequality st is an equality.

Process and Workflow

Decompose 1Write 1=e1++en with the ej orthogonal local idempotents; semiperfectness guarantees this exists.
Tabulate the cornersCompute which of the n2 corner spaces epReq are nonzero. For a finite-dimensional algebra this is a table of dimensions.
Take connected componentsThe components of the resulting graph are the linkage classes; there is one block per component.
Sum each classThe class sums ci are the centrally primitive idempotents, and RiciR.

Is R indecomposable?

Linkage graph connectedYes: s=1, the only central idempotents are 0 and 1. This is compatible with R¯ having many components.
R¯ simpleYes, and more: RMn(k) for a local ring k by (23.10).
Graph disconnectedNo: each component contributes a proper direct factor, and the factors are again semiperfect.

Comparison and Classification

Blocks versus Wedderburn components
Ring R (semiperfect)Blocks sComponents t of R¯Comment
Local ring k11Indecomposable and basic
Mn(k), k local11R¯ simple, so s=t=1
Tn(k), k a division ring1nStrict inequality s<t
k×k××knnSemisimple: blocks are the simple components
/1222Commutative: blocks are the local factors
kG, chark|G|number of simple componentssameSemisimple by Maschke
kS3, chark=312One block containing both simple modules

The final row is typical of modular representation theory: the interesting phenomena live in blocks that contain several simple modules, since a block with a single simple module and no radical is just a matrix ring.

Relationship Map

Semiperfect ring Rblock decomposition exists and is unique
Block ciRindecomposable semiperfect ring with identity ci
Linkage class of primitive idempotentsthe ej with ciej=ej
Principal indecomposablesejR for ej in the class
Simple modulesejR/ejJ, the tops

Reading the nesting outwards: simple modules group into principal indecomposables, those group into linkage classes, and the classes are the blocks. Each level of grouping is canonical.

eesame linkage classsame blockHom and Ext can be nonzero

Applications and Industry Use

Applications here means where this structure is used — inside mathematics and in the engineering and computing disciplines that consume it.

Modular representation theory

Brauer blocks

For R=kG with chark=p dividing |G|, the blocks of this theorem are exactly the p-blocks of G. Defect groups, Brauer correspondence and the major conjectures of the subject are all statements about individual blocks.

Computational algebra

Divide and conquer

Algorithms for modules over a finite-dimensional algebra split the problem along blocks first: each block is a smaller algebra, and no information crosses between blocks because the connecting Hom spaces vanish.

Homological algebra

Derived decompositions

Since Ext groups between modules in different blocks vanish, the derived category of R is the product of the derived categories of its blocks. Invariants such as global dimension are computed blockwise.

Order theory and integral representations

Blocks of orders

For an order over a complete discrete valuation ring the ring is semiperfect, so the block decomposition applies and organises the classification of lattices over the order.

Honestly stated, the block decomposition is a bookkeeping theorem — but it is the bookkeeping that makes modular representation theory finite and computable.

Failure Modes and Common Mistakes

  • A block ciR is a ring but not a subring of R in the unital sense: its identity is ci, not 1.
  • Do not expect a block to be a matrix ring. Blocks are indecomposable semiperfect rings, and indecomposable semiperfect rings have not been classified.
  • The number of blocks is not a Morita invariant of anything smaller than R itself — but it is preserved under passage to a basic ring, which is the content of the basic-ring theorem.
  • For rings that are not semiperfect a block decomposition may simply fail to exist; an infinite product of fields has no finest decomposition into indecomposable ideals.

Best Practices

  • Compute the corner spaces epReq before doing anything else: they determine the block structure and the support of the Cartan matrix simultaneously.
  • State whether a claimed decomposition is into blocks (central, unique) or merely into indecomposable modules (non-central, unique only up to isomorphism).
  • When working with a specific block, replace R by ciR and 1 by ci explicitly; silent identification of the two identities is a frequent source of error.
  • Record the partition of simple modules into blocks alongside the list of simple modules; almost every later computation is blockwise.

Quick Reference

HypothesisR0 semiperfect; J=radR; E the primitive idempotents
DecompositionR=c1RcsR, the ci centrally primitive
UniquenessUnique up to order; the ci are the only centrally primitive idempotents
Linkagee,e in the same block linked connected in the graph Γ
Edge testepReq0HomR(eqR,epR)0
ModulesM=iMci; indecomposables live in one block
VanishingHomR(M,N)=0 across distinct blocks
Countingst, where t is the number of simple components of R¯
Statement locator
FactStatementReference
Existence of blocks1 a sum of orthogonal centrally primitive idempotents(25.4), (22.5)
UniquenessBlock decomposition unique up to order(22.1)
Linkage criterionsame block linked(25.4), (22.5)
Idempotent decomposition1=e1++en orthogonal local(23.6)
Central idempotents and Eeach eE lies in cR or (1c)R(22.4)
Linked idempotents agreee linked to e (ecRecR)(22.3)
Simple quotient caseR¯ simple RMn(k), k local(23.10)

Frequently Asked Questions

Why does the block decomposition need semiperfectness rather than just a chain condition?

What is really needed is that 1 be a finite sum of orthogonal primitive idempotents, which is (22.5)'s hypothesis. Chain conditions on ideals also suffice, by (22.2). Semiperfectness delivers the idempotent decomposition without any chain condition, so it covers examples such as local rings that are far from artinian.

Is the block decomposition the same as the Peirce decomposition?

No. The Peirce decomposition of R along a set of orthogonal idempotents splits R as a direct sum of right ideals or of corner bimodules; the block decomposition splits R as a direct sum of two-sided ideals, which happens only for central idempotents. Blocks are always coarser.

Can a block be decomposable as a module?

Yes, and usually is. ciR is indecomposable as a ring — equivalently as a two-sided ideal — but as a right module it decomposes into the principal indecomposables ejR belonging to that block. Indecomposability of a ring and of the module underlying it are different statements.

How do I actually detect a nonzero corner epReq in practice?

For a finite-dimensional algebra, compute the matrix of dimensions dimkepAeq; these are the entries of a Hom table. For a right artinian ring one can instead use the Cartan matrix: the (p,q) entry is nonzero exactly when epReq0, since Vq is a composition factor of epR if and only if epReq0.

Do the blocks of R and of a basic ring of R correspond?

Yes. A basic ring B=eRe has 𝔄R𝔄R as a lattice isomorphism between ideals of B and ideals of R, so indecomposable ideal direct summands correspond, and hence blocks correspond one-to-one. This is part of the basic-ring theorem (25.8).

What does a block look like when R is semisimple?

The blocks are exactly the simple components Mnj(Dj) of the Wedderburn decomposition, and s=t. All the interest in the theory comes from rings where radR0 and the two counts differ.

References

  1. T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §25 (pp. 373–374), with §22 (pp. 336–344).
  2. F. W. Anderson and K. R. Fuller, Rings and Categories of Modules, 2nd edition, Graduate Texts in Mathematics 13, Springer-Verlag, 1992, §7 and §27.
  3. C. W. Curtis and I. Reiner, Methods of Representation Theory, Volume I, Wiley-Interscience, 1981, §55 (blocks and defect groups).
  4. R. Brauer, “Investigations on group characters”, Annals of Mathematics 42 (1941), 936–958.
  5. L. H. Rowen, Ring Theory, Volume I, Academic Press, 1988, Chapter 2.

AI Suggested Questions

  • Give an example of a semiperfect ring with three blocks whose semisimple quotient has five simple components.
  • Prove directly that the relation ee on primitive idempotents fails to be transitive in T3(k) read naively, and identify the correct chain.
  • How are the defect groups of a p-block of kG defined, and what do they measure about the block?
  • Describe the block decomposition of the group algebra kA5 in characteristic 2, 3 and 5.
  • Show that the number of blocks of R equals the number of connected components of the quiver of a basic algebra Morita equivalent to R.
  • Under what conditions on radR do central idempotents of R/radR lift to central idempotents of R?
  • Explain how block decomposition interacts with tensor products of algebras over a field.
Page
KVS-ENG-MATH-0309
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