KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesCentral Idempotents and Ring Direct DecompositionsEngineering · Engineering MathematicsLesson 490/884← PrevNext →
ArticlePublished 8 Aug 202620 min readBy KEVOS®
On this page

Ask about this page

KEVOS AICentral Idempotents and Ring Direct Decompositions

KEVOS knowledge first · trusted web sources when needed

Skip to content

Engineering Mathematics Core Block theory

Central Idempotents

A ring splits as a direct product exactly when its identity splits into orthogonal central idempotents — and when the identity is a sum of centrally primitive idempotents, that splitting is unique.

Page ID
KEVOS-ENG-MATH-NCR-0162
Taxonomy
ENG / ENG-MATH
Collection
noncommutative-rings-core
Source
(22.1)–(22.2), §22 (pp. 336–338)
Reviewed
2026-08-08
Version
1.0.0

01Executive Summary

Every way of writing a ring R as a direct product of two rings is encoded by a single element: a central idempotent c, with the two factors being cR and (1−c)R. The dictionary is exact and cheap to use, and it turns a question about ring decompositions into a question about one distinguished set of elements of the centre Z(R).

The content of §22 is what happens when the process is pushed to the end. If 1 can be written as a sum of finitely many orthogonal centrally primitive idempotents, then that expression is unique up to order, every central idempotent is a partial sum of it, and R is a direct product of indecomposable rings in exactly one way. A chain condition on the ideals of R guarantees this happens.

c=c2∈Z(R)The splitting datum
2rCentral idempotents when there are r blocks
UniqueDecomposition into blocks
ACC or DCCSufficient condition on ideals

02Overview

Let R be a ring with identity and let e=e2∈R with complementary idempotent f=1−e. The Peirce decomposition writes R=eRe⊕eRf⊕fRe⊕fRf as abelian groups. The idempotent e is central precisely when the two off-diagonal corners vanish, eRf=fRe=0; in that case the coarser decomposition R=eR⊕fR has both summands two-sided ideals, and multiplication is componentwise.

e centraliffeRf=fRe=0iffR=eR×fR as rings,f=1−e
(22.0)

The summand eR is a ring in its own right, with identity element e rather than 1.

The converse direction is the reason the dictionary is useful: a direct sum decomposition R=A⊕B into two-sided ideals produces the idempotent, by splitting 1=e+f with e∈A and f∈B. Nothing is lost in either direction, so ring-theoretic decompositions and central idempotents are the same data.

The one thing to remember

Direct product decompositions of R correspond bijectively to central idempotents. Finest decompositions correspond to centrally primitive idempotents, and — when they exist — they are unique.

Two warnings frame the rest of this collection. First, R can be riddled with idempotents and still be indecomposable: Mn(D) has an abundance of them but a field as its centre. Second, finest decompositions need not exist at all — an infinite direct product of fields has no finite one — which is exactly why a chain condition is imposed. The pages The Block Decomposition of a Ring and Indecomposable Rings and Connectedness take these two points further.

03Learning Objectives

  • State the equivalence between central idempotents, ideal direct sums, and ring product decompositions.
  • Recognise when a central idempotent c is centrally primitive by testing cR for indecomposability.
  • Prove that every central idempotent is a partial sum of a given decomposition of 1 into centrally primitive idempotents.
  • Deduce uniqueness of the block decomposition up to a permutation of the factors.
  • Apply the chain condition criterion (22.2) to a noetherian or artinian ring.
  • Compute all central idempotents of ℤ/12ℤ and identify the corresponding factors.

04Definitions

Definition(22.0)Indecomposable ring, centrally primitive idempotent

A ring R≠0 is indecomposable if it is not the direct sum of two nonzero two-sided ideals; equivalently, if its only central idempotents are 0 and 1.

A central idempotent c∈R is centrally primitive if c≠0 and c cannot be written as c=α+β with α,β nonzero orthogonal central idempotents of R.

Z(R)
The centre of R. Every central idempotent lies here, and idempotents of Z(R) are exactly the central idempotents of R.
Orthogonal
Idempotents e,f with ef=fe=0. For central idempotents ef=fe automatically, so orthogonality is the single condition ef=0.
cR as a ring
For c a central idempotent, cR is closed under multiplication and c acts on it as an identity; it is a ring in its own right, and simultaneously an ideal of R.
Primitive idempotent
An idempotent e≠0 that is not a sum of two nonzero orthogonal idempotents — no centrality required. This is a different and weaker-sounding but incomparable condition; see the pitfalls below.
Block
A summand ciR arising from a decomposition of 1 into orthogonal centrally primitive idempotents.

Rings have an identity and are not assumed commutative. The zero ring is excluded from the definition of indecomposable, exactly as 1 is excluded from the primes.

05Core Concepts

From an idempotent to a product, and back

Suppose c is a central idempotent and d=1−c. Then cd=c−c2=0, so cR and dR meet in 0, and r=cr+dr for every r, so R=cR⊕dR. Both summands are two-sided ideals because c is central, and (cr)(cs)=c(rs) shows cR is closed under multiplication with c as identity. Multiplication in R is componentwise, so R≅cR×dR as rings.

Conversely let R=A⊕B with A,B ideals, and write 1=e+f with e∈A, f∈B. For a∈A we get a=ae+af; but af∈A∩B=0, so a=ae, and symmetrically a=ea. Thus e is an identity for A; taking a=e gives e2=e. For arbitrary r∈R write r=a+b; then er=ea+eb=a=ae+be=re, using eb∈A∩B=0. Hence e is central, A=eR, and likewise for f and B.

R=A⊕B (ideals)⟺1=e+f⟺e,f central orthogonal idempotents⟺R≅eR×fR

Decompositions of c happen inside cR

This small observation is what makes the theory finite and local. Let c be a central idempotent and suppose c=α+β with α,β orthogonal central idempotents of R. Then

α=α2=(α+β)α=cα∈cR,
(22.0a)

and symmetrically β=cβ∈cR.

So any splitting of c already lives in the ring cR. Because central idempotents of R lying in cR are precisely the central idempotents of the ring cR — centrality transfers both ways, since c is central and acts as the identity of cR — we obtain the working criterion: **c is centrally primitive in R if and only if the ring cR is indecomposable.**

The Boolean algebra of central idempotents

Write S for the set of central idempotents of R. It is closed under multiplication, and under the operation e∨e′=e+e′−ee′. With these two operations and complement e↦1−e, S becomes a Boolean ring: every element satisfies x2=x, and S is the Boolean algebra of "clopen pieces" of R. Centrally primitive idempotents are exactly its atoms, and a block decomposition exists precisely when S is a finite Boolean algebra with 1 the join of its atoms.

Why 2r

If 1=c1+⋯+cr with the ci orthogonal centrally primitive, then by (22.1) the central idempotents are exactly the 2r partial sums ∑i∈Tci for T⊆{1,…,r}. So counting central idempotents counts blocks.

06Key Results

Proposition(22.1)Uniqueness of a centrally primitive decomposition

Let R be a ring and suppose that 1=c1+⋯+cr where c1,…,cr are pairwise orthogonal centrally primitive idempotents of R. Then:

  1. every central idempotent c∈R equals ∑i∈Tci for a unique subset T⊆{1,…,r};
  2. c1,…,cr are the only centrally primitive idempotents of R; in particular any two distinct centrally primitive idempotents of R are orthogonal;
  3. the decomposition 1=c1+⋯+cr is unique up to a permutation of its summands.
Proof

(1). Let c be a central idempotent and fix i. The element cci is idempotent, since c and ci commute, and it is central in the ring ciR: for x∈ciR we have (cci)x=cx=xc=x(cci), because ci acts as the identity of ciR. Since ci is centrally primitive, ciR is indecomposable, so its only central idempotents are 0 and ci. Hence cci∈{0,ci} for each i. Now

c=c⋅1=c(c1+⋯+cr)=∑i:cci≠0ci.
(22.1a)

Uniqueness of T follows on multiplying ∑i∈Tci by cj: the product is cj if j∈T and 0 otherwise, so T is recovered from c.

(2). Let c be centrally primitive. By (1), c=∑i∈Tci with T≠∅ since c≠0. If |T|≥2, pick j∈T and split c=cj+∑i∈T∖{j}ci into two nonzero orthogonal central idempotents, contradicting central primitivity. So |T|=1 and c=cj.

(3). If 1=d1+⋯+ds is another such decomposition, then each dj is centrally primitive, hence equals some ci by (2); distinct dj give distinct ci by orthogonality, and summing shows the two index sets coincide. So s=r and the families agree up to order.

Corollary(22.1a)Existence criterion

A ring R≠0 is a finite direct product of indecomposable rings if and only if 1∈R is a sum of finitely many pairwise orthogonal centrally primitive idempotents. When this holds, the factors and the idempotents are uniquely determined, and one writes R=c1R⊕⋯⊕crR for the block decomposition of R.

Counterexample(22.1b)Block decompositions need not exist

Let R=∏n≥1ℚ, the full direct product of countably many copies of ℚ. The elements εn (the identity in slot n, zero elsewhere) form an infinite family of pairwise orthogonal centrally primitive idempotents. No finite subfamily sums to 1, and by (22.1)(2) any decomposition of 1 into orthogonal centrally primitive idempotents would have to use all of them. So R has no block decomposition. The failure is a failure of finiteness: the ideals of R satisfy neither chain condition.

Proposition(22.2)Chain conditions force a block decomposition

Let R≠0 be a ring whose two-sided ideals satisfy either the ascending chain condition or the descending chain condition — for instance, R right noetherian, left noetherian, right artinian or left artinian. Then 1 is a sum of finitely many orthogonal centrally primitive idempotents, so R has a block decomposition, and all conclusions of (22.1) apply.

Proof

Assume the DCC on ideals. Call a nonzero central idempotent c good if it is a finite sum of orthogonal centrally primitive idempotents, and suppose some central idempotent is not good. Among the ideals cR with c a nonzero central idempotent that is not good, choose one minimal, say cR.

Then c is not centrally primitive (otherwise c is good, being its own one-term decomposition), so c=a+b with a,b nonzero orthogonal central idempotents. Both lie in cR by (22.0a), so aR⊆cR, and the inclusion is strict: b lies in cR but not in aR, since b=ax would give b=ab=a2x=ax=b together with ab=0, forcing b=0. Likewise bR⊊cR. By minimality a and b are good, and concatenating their decompositions gives one for c: the pieces coming from a and from b are orthogonal because they lie in aR and bR respectively and ab=0. This contradicts the choice of c. Hence every nonzero central idempotent, 1 included, is good.

Assume instead the ACC on ideals, and suppose 1 is not good. A nonzero central idempotent that is not good is in particular not centrally primitive, so it splits as a+b with a,b nonzero orthogonal central idempotents, and at least one of the two pieces is again not good — otherwise concatenation would make the original good. Starting from b0=1 and applying this repeatedly gives nonzero central idempotents a1,a2,… with bn−1=an+bn and bn never good. The an are pairwise orthogonal, since an+1∈bnR and anbn=0, so the sums below are direct and each inclusion is strict:

a1R⊊a1R⊕a2R⊊a1R⊕a2R⊕a3R⊊⋯
(22.2a)

This is an infinite strictly ascending chain of two-sided ideals, contradicting the ACC. Hence 1 is good.

Remark(22.2b)What the chain condition is really for

Only chain conditions on two-sided ideals are needed, which is much weaker than a chain condition on one-sided ideals. Commutative noetherian rings, artinian rings, and finite-dimensional algebras all qualify. Rings that fail badly, such as infinite products, fail exactly here.

07Proof Techniques and Method

How these proofs work, and which move to reuse.

Move 1

Multiply by the pieces of 1

Given 1=c1+⋯+cr, the identity c=∑icci turns a global statement about c into r local statements inside the rings ciR. Every part of (22.1) is this move.

Move 2

Localise centrality

A central idempotent of R lying in cR is a central idempotent of the ring cR, and conversely when c is central. Centrality is therefore not lost when passing to a direct factor, which is what makes indecomposability of cR the right test.

Move 3

Minimal counterexample under DCC

To prove every object of a class decomposes, take a minimal offender and split it; the two smaller pieces decompose by minimality, and reassembling contradicts the choice. The same skeleton proves the Krull–Schmidt existence statement for modules.

The third move is worth isolating because it is the only place a hypothesis enters. Results (22.0) and (22.1) are hypothesis-free bookkeeping; all the mathematical content about existence sits in (22.2).

08Worked Example

All central idempotents of ℤ/12ℤ

Take R=ℤ/12ℤ, which is commutative, so every idempotent is central. Solving x2≡x(mod12), that is 12∣x(x−1), gives x∈{0,1,4,9}: indeed 42=16=4 and 92=81=9 in ℤ/12. Four central idempotents, so by the count 2r we expect r=2 blocks.

1=4+9,4⋅9=36=0in ℤ/12ℤ.
(E.1)

An orthogonal decomposition of the identity.

The two factors are 4R={0,4,8} with identity 4, and 9R={0,3,6,9} with identity 9. As rings, 4R≅𝔽3 and 9R≅ℤ/4ℤ — check the identities: 4⋅8=32=8 and 9⋅3=27=3 in ℤ/12, as required. Both factors are indecomposable, the first because it is a field, the second because it is local. So 4 and 9 are centrally primitive and

ℤ/12ℤ≅ℤ/4ℤ×ℤ/3ℤ
(E.2)

The Chinese Remainder Theorem, read as a block decomposition.

Every central idempotent is a partial sum of {4,9}, as (22.1)(1) predicts: ∅↦0, {4}↦4, {9}↦9, {4,9}↦1.

Many idempotents, no decomposition

Now let R=M3(ℚ). It contains a great many idempotents — every projection onto a subspace of ℚ3 along a complement — but Z(R)=ℚ⋅I3 is a field, whose only idempotents are 0 and I3. Hence R is indecomposable: the abundance of idempotents produces module decompositions of RR, not ring decompositions.

Sanity check

For any ring, central idempotents of R are exactly the idempotents of Z(R). So computing Z(R) first and looking for its idempotents is always a legitimate — and usually much shorter — route.

09Comparison and Classification

Central idempotents and blocks in familiar rings
RingCentreCentral idempotentsBlocks
Division ring Da field0,11
Mn(D)Z(D)0,11
Upper triangular Tn(k), k a division ringZ(k)0,11
Any local ringlocal0,11
ℤ/12ℤitself0,4,9,12
M2(ℚ)×ℚ[x]/(x2)ℚ×ℚ[x]/(x2)four of them2
Semisimple ring with n simple componentsn fields2nn
∏n≥1ℚitselfone per subset of ℕnone exists

The table makes the two independent phenomena visible. Rows one to four are indecomposable for very different internal reasons; the last row is not indecomposable at all, yet still has no block decomposition.

10Relationship Map

  • Central idempotent c of R — equivalently an idempotent of Z(R)
    • gives
      • an ideal direct sum R=cR⊕(1−c)R
      • a ring isomorphism R≅cR×(1−c)R
      • a splitting of every R-module M=cM⊕(1−c)M
    • is centrally primitive when
      • cR is an indecomposable ring
      • c is an atom of the Boolean algebra of central idempotents
    • exists in abundance when
      • R is semisimple: 2n of them
      • R is a finite product of local rings

The module-splitting bullet deserves emphasis. Because c is central, cM is a submodule for every R-module M, and M=cM⊕(1−c)M. So a block decomposition of R decomposes the entire module category into a product of the module categories of the blocks — this is the categorical content of the theory, and it is why representation theorists work one block at a time.

Chain condition on ideals⟹1 = sum of orthogonal centrally primitive idempotents⟹Block decomposition exists⟹Uniqueness by (22.1)

11Applications and Industry Use

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

Representation theory

Working one block at a time

Because a central idempotent splits every module, the representation theory of a finite group over a field of characteristic p decomposes into independent problems, one per block of kG. Brauer's theory of blocks, defect groups and defect zero all begin here.

Coding theory

Idempotent generators of cyclic codes

A cyclic code of length n over 𝔽q with gcd(n,q)=1 is an ideal of 𝔽q[x]/(xn−1), hence generated by an idempotent. The primitive idempotents of that commutative ring are the block idempotents, and they give the minimal cyclic codes into which every cyclic code decomposes.

Symbolic computation

Splitting an algebra before working with it

Computer algebra systems decompose a finite-dimensional algebra into blocks before doing anything else, because linear algebra of size dimR is replaced by independent problems of size dimciR. The block idempotents are computed from the centre.

Commutative algebra

Connected components of a scheme

For commutative R, idempotents correspond to clopen subsets of SpecR, and a block decomposition is a decomposition into connected components. The finiteness supplied by (22.2) is the statement that a noetherian scheme has finitely many connected components.

The honest summary: this is infrastructure. Central idempotents are almost never the object of study; they are the first thing you compute so that the object of study breaks into independent pieces.

12Standards and Notation

Standards here covers notation, symbol and markup standards, and reference implementations, rather than material or design codes.

Block idempotentci or ei; in group representation theory usually eB for the block B
BlocksR=R1⊕⋯⊕Rr with Ri=ciR; some authors write B0 for the principal block
CentreZ(R) here; C in Lam's §22, Cent(R) elsewhere
OrthogonalityFor central idempotents ef=fe is automatic, so many sources write only ef=0
GAPCentralIdempotentsOfAlgebra, PrimitiveIdempotentsOfAlgebra
Magma / SageCentralIdempotents, A.central_orthogonal_idempotents()

A terminology clash

"Primitive central idempotent" and "centrally primitive idempotent" mean the same thing in the modern literature: a central idempotent primitive among central idempotents. It does not mean a central idempotent that happens to be primitive as an idempotent — the identity of Mn(D) for n≥2 is centrally primitive but not primitive.

13Computational Notes

Computational notes cover algorithms, cost and library behaviour rather than manufacturing process.

For a finite-dimensional algebra R over a field k given by structure constants with dimkR=n, the standard route to the block decomposition is:

  1. Compute Z(R) as the nullspace of the linear map x↦(xbi−bix)i for a basis b1,…,bn; this is one nullspace computation on an n2×n matrix.
  2. Compute radZ(R); since Z(R) is commutative and finite-dimensional, Z(R)/radZ(R) is a product of fields.
  3. Find the primitive idempotents of that product of fields — a factorisation problem over k — and lift them through the nilpotent ideal radZ(R) by Newton iteration, using e↦3e2−2e3.
  4. The lifted idempotents are the centrally primitive idempotents of R, and the blocks are ciR.

Step 3 is the only step whose cost is not polynomial linear algebra: it needs factorisation of polynomials over k, which is fast over finite fields and over ℚ but is exactly where the difficulty concentrates over general fields. The Newton iteration doubles the precision each round, so O(logm) steps suffice when (radZ(R))m=0.

Blocks are not determined by the semisimple quotient

Computing the blocks of R/radR and lifting is not a valid shortcut: central idempotents do not lift through the radical. See Lifting Central Idempotents for what does lift and what the correct quotient to use is.

14Failure Modes and Common Mistakes

Primitive does not imply centrally primitive, nor the reverse

In M2(k) the matrix unit E11 is a primitive idempotent but not central; the identity is centrally primitive but not primitive. The two notions are tested against different sets — all idempotents versus central ones — and neither implies the other.

Having no nontrivial idempotents is much stronger than indecomposable

Indecomposable means no nontrivial central idempotents. A ring with no nontrivial idempotents at all is precisely one whose RR is indecomposable as a module, which for semiperfect rings means local. Mn(D) separates the two conditions.

Finiteness is not free

Nothing in (22.1) asserts existence. An infinite product of fields has plenty of centrally primitive idempotents and no block decomposition, so never invoke (22.1) before checking that 1 really is a finite sum — a chain condition on ideals (22.2) is the usual justification.

  • Do not assume a direct sum decomposition into right ideals gives central idempotents; it gives orthogonal idempotents summing to 1, which is a much weaker structure. Centrality requires the summands to be two-sided ideals.
  • Do not confuse cR, a ring with identity c, with a unital subring of R: it does not contain 1 unless c=1.
  • Two distinct block decompositions cannot coexist, but a ring may admit many decompositions into non-primitive factors — (22.1)(3) is uniqueness of the finest one only.

15Quick Reference

Central idempotentc2=c, cr=rc for all r; equivalently cRf=fRc=0 with f=1−c
SplittingR=cR⊕(1−c)R, both ideals, R≅cR×(1−c)R
IndecomposableR≠0 with only central idempotents 0,1
Centrally primitivec≠0 central idempotent with cR indecomposable
Uniqueness(22.1): partial sums, only centrally primitive idempotents, unique up to order
Existence(22.2): ACC or DCC on two-sided ideals suffices
Countingr blocks ⇒ exactly 2r central idempotents
Failure case∏nℚ: infinitely many blocks-to-be, no decomposition
Which statement to cite
NeedStatementHypotheses
Split R using an elementR≅cR×(1−c)Rc a central idempotent
Recognise the finest splittingc centrally primitive iff cR indecomposablenone
List all central idempotents(22.1)(1)1 a finite sum of orthogonal centrally primitive idempotents
Uniqueness of blocks(22.1)(3)same as above
Existence of blocks(22.2)ACC or DCC on two-sided ideals

16Frequently Asked Questions

Why insist on central idempotents when ordinary idempotents already decompose the ring?

An arbitrary idempotent e decomposes R as a right module, R=eR⊕(1−e)R, but eR is then only a right ideal and the decomposition carries no ring structure. Centrality is exactly the condition making both summands two-sided ideals, so that multiplication is componentwise and R≅eR×(1−e)R as rings.

Is a ring with no nontrivial idempotents the same as an indecomposable ring?

No, it is strictly stronger. Indecomposability only forbids nontrivial idempotents in the centre. Mn(D) for n≥2 has many idempotents yet is indecomposable, since its centre is a field.

Does a block decomposition always exist?

No. An infinite direct product of fields has none. A chain condition on two-sided ideals — ACC or DCC, so in particular one-sided noetherian or artinian — is enough (22.2), and it is the hypothesis used in practice.

How do I know I have found all the central idempotents?

Once you exhibit a decomposition 1=c1+⋯+cr into orthogonal centrally primitive idempotents, (22.1) tells you the complete list: the 2r partial sums, and nothing else. Before that, the reliable method is to compute the centre and find its idempotents.

Do the blocks of R correspond to the blocks of R/radR?

In general no, and this is the main subtlety of §22. Upper triangular n×n matrices over a field form an indecomposable ring whose radical quotient is a product of n copies of the field, with 2n central idempotents. Only quotients by the square of a nilpotent ideal preserve central idempotents; see the page on lifting central idempotents.

What happens to modules under a block decomposition?

Every R-module M splits as M=c1M⊕⋯⊕crM, with ciM a module over the block ciR on which the other blocks act as zero. The module category of R is therefore the product of the module categories of the blocks, which is why representation theory is done one block at a time.

17Related KEVOS Topics

Block DecompositionLink primitive idempotents by the rule eRf ≠ 0, take the transitive closure, and the equivalence classes are exactly theIdempotents and Peirce DecompositionA single idempotent e = e^2 splits a ring into four additive pieces eRe, eRf, fRe, fRf with f = 1-e, turning R into a geBlocks of AlgebrasOver an algebraically closed field the centre decides everything: each simple module gives a k-algebra map Z(R) → k, twoLifting Central IdempotentsIdempotents lift through a nilpotent ideal; central idempotents do not. Two theorems say exactly when they do: pass to RIndecomposable RingsA ring is indecomposable when it is not a direct sum of two nonzero ideals — equivalently, when its only central idempot

18References

  1. T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §22 (pp. 336–344), especially (22.1) and (22.2).
  2. T. Y. Lam, A First Course in Noncommutative Rings, §21, for the Peirce decomposition and the criterion that an idempotent is central if and only if its off-diagonal Peirce corners vanish.
  3. 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.
  4. L. H. Rowen, Ring Theory, Volume I, Academic Press, 1988, Chapter 1, on idempotents and Peirce decompositions.
  5. C. W. Curtis and I. Reiner, Methods of Representation Theory, Volume I, Wiley-Interscience, 1981, on central idempotents and block decompositions of algebras.

19AI Suggested Questions

  • Show that the central idempotents of R form a Boolean ring under e∨f=e+f−ef and ordinary multiplication.
  • Prove that two central idempotents e and f are isomorphic as idempotents if and only if e=f.
  • For which commutative rings does the set of idempotents form a finite Boolean algebra, and how does this relate to connectedness of the spectrum?
  • Give an example of a ring whose two-sided ideals satisfy the DCC but whose one-sided ideals do not.
  • How are the central idempotents of Mn(R) related to those of R, and why does the matrix construction not create new blocks?
  • Work out the block decomposition of ℤ/nℤ for a general n and relate it to the prime factorisation.
  • What is the analogue of a central idempotent for a ring without identity, and how much of (22.1) survives?
Page
KEVOS-ENG-MATH-NCR-0162
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. Comparison and Classification
  10. Relationship Map
  11. Applications and Industry Use
  12. Standards and Notation
  13. Computational Notes
  14. Failure Modes and Common Mistakes
  15. Quick Reference
  16. Frequently Asked Questions
  17. Related KEVOS Topics
  18. References
  19. AI Suggested Questions

Continue learning

Idempotents in Module-Finite Algebras over Complete Local RingsArticle · Engineering MathematicsNEXT LESSON →The Block Decomposition of a RingArticle · Engineering MathematicsIdempotents in I-Adically Complete RingsArticle · Engineering MathematicsBlocks of Finite-Dimensional Algebras and Group AlgebrasArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®