Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Decompositions of the identity into primitive central idempotents are unique

Statement

Let A be a unital ring (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides), with centre Z(A):={z∈A:za=az for all a∈A}. Suppose that 1=e1+⋯+ek=f1+⋯+fℓ where {e1,…,ek} and {f1,…,fℓ} are finite families of pairwise orthogonal central idempotents of A that are primitive among central idempotents: each is nonzero and admits no decomposition as a sum of two nonzero orthogonal central idempotents (zero parts are omitted). Then k=ℓ and there is a bijection σ of the index sets with ei=fσ(i) for all i; in particular the decomposition of 1 into primitive central idempotents is unique up to order. No choice principle is used, the families being finite.

Facts & Assumptions

Given: A unital ring A with centre Z(A)={z∈A:za=az for all a∈A}; finite families e1,…,ek and f1,…,fℓ of pairwise orthogonal nonzero central idempotents of A that are primitive among central idempotents, with 1=e1+⋯+ek=f1+⋯+fℓ.

[F1]

Ring axioms and the zero ring: (A,+,0) is an abelian group, multiplication is associative with two-sided identity 1 and distributes over addition on both sides, and a ring in which 1=0 has exactly one element (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides).

Proof

technique · direct
1.1givenF1

If k=0 or ℓ=0 then 1=0 in A, so A has exactly one element by [F1], namely 0; then no nonzero idempotent exists and the two families are empty, k=ℓ=0, and the empty map is the required bijection. Assume henceforth that k,ℓ≥1.

1.2F1givenalgebra

For central idempotents e,f∈A the products ef and e(1−f) are central idempotents with ef+e(1−f)=e and ef⋅e(1−f)=0: centrality gives (ef)a=e(fa)=e(af)=(ea)f=(ae)f=a(ef) and (1−f)a=a−af=a−fa=a(1−f) for all a∈A; idempotence gives (ef)2=efef=e2f2=ef and (1−f)2=1−2f+f2=1−f, hence e(1−f)e(1−f)=e2(1−f)2=e(1−f); distributivity gives ef+e(1−f)=e(f+1−f)=e and ef⋅e(1−f)=e2f(1−f)=0.

2.1step 1.2given

If e is primitive and f is a central idempotent, then ef∈{0,e}: by step 1.2, e=ef+e(1−f) exhibits e as a sum of the two orthogonal central idempotents ef and e(1−f), so primitivity forces ef=0 or e(1−f)=0; in the second case step 1.2 gives ef=ef+0=ef+e(1−f)=e.

3.1givenstep 2.1F1algebra

Fix j∈{1,…,ℓ}. Since 1=e1+⋯+ek, distributivity and centrality give fj=fj⋅1=∑ifjei=∑ieifj, and step 2.1 gives eifj∈{0,ei} for every i; since fj≠0, the set Sj:={i:eifj=ei} is nonempty and fj=∑i∈Sjei.

4.1step 3.1givenalgebra

For every j the set Sj is a singleton: its elements ei are pairwise orthogonal nonzero central idempotents summing to fj by step 3.1, so if Sj contained distinct i≠i′ then fj=ei+∑i′′∈Sj, i′′≠iei′′ would exhibit fj as a sum of the two orthogonal central idempotents ei and fj−ei, both nonzero since multiplying the second sum by the nonzero idempotent ei′ retrieves ei′, contradicting primitivity of fj; hence Sj={i(j)} and fj=ei(j).

5.1step 4.1givenalgebra

The map j↦i(j) is injective: if i(j)=i(j′)=i with j≠j′, then ei=ei2=fjfj′=0 by idempotence, centrality and pairwise orthogonality of the f's, contradicting ei≠0.

5.2step 4.1givenF1algebra

The map j↦i(j) is surjective: from fj=ei(j) for all j and both decompositions, ∑jei(j)=1=∑iei; multiplying this equality by the central idempotent ei and using pairwise orthogonality of the e's gives ei on the left when i lies in the image of j↦i(j) and 0 otherwise, while the right side is ei≠0; hence every i lies in the image.

6.1step 4.1step 5.1step 5.2∎

Steps 5.1 and 5.2 make j↦i(j) a bijection {1,…,ℓ}→{1,…,k} with fj=ei(j) for all j by step 4.1; its inverse σ satisfies ei=fσ(i) for all i, and k=ℓ. Since the families were arbitrary, the decomposition of 1 into primitive central idempotents is unique up to order, as claimed.

Depends on

Used by

Dependency tree · two levels

8 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources