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.

The identity of a finite-dimensional algebra decomposes into primitive central idempotents

Statement

Let F be a field and A a finite-dimensional unital F-algebra with centre Z(A):={z∈A:za=az for all a∈A} (Algebras over a commutative ring, central structure maps, and algebra homomorphisms). Then Z(A) is a finite-dimensional commutative F-algebra, and the identity 1∈Z(A) admits a decomposition 1=e1+⋯+ek into pairwise orthogonal primitive central idempotents of A: each ei is a nonzero idempotent of Z(A) that is not the sum of two nonzero orthogonal idempotents of Z(A). No semisimplicity of A is assumed and no choice principle is used.

Facts & Assumptions

Given: A field F, a finite-dimensional unital F-algebra A, and the centre C:=Z(A)={z∈A:za=az for all a∈A}.

[F1]

F-algebra conventions: a unital F-algebra A is a unital ring together with a unital ring homomorphism η:F→A whose image is central, and the induced scalar action ra:=η(r)a makes A an F-module with multiplication A×A→A bilinear (Algebras over a commutative ring, central structure maps, and algebra homomorphisms).

[F2]

Subspace dimension: if V is a finite-dimensional vector space over F with dim⁡FV=n and U a linear subspace of V, then U is finite-dimensional with dim⁡FU≤n, and dim⁡FU=n if and only if U=V (If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V).

[F3]

Well-ordering principle: every nonempty subset of N has a least element (The well-ordering principle).

Proof

technique · direct
1.1givenF1

If A=0, then C=Z(A)={0} and the empty family (k=0) satisfies 1=e1+⋯+ek with the stated conditions vacuously, so assume A≠0; then in A one has 1≠0 and hence 1≠0 in C.

1.2givenF1algebra

The centre C is a commutative unital F-subalgebra of A and, in particular, a linear subspace of the F-vector space A: 1∈C; if x,y∈C, α∈F and a∈A, then (x+y)a=xa+ya=ax+ay=a(x+y), (αx)a=α(xa)=α(ax)=a(αx) and (xy)a=x(ya)=x(ay)=(xa)y=(ax)y=a(xy), while 0∈C; and distinct elements of C commute with each other because each commutes with all of A.

1.3givenF3

Suppose, for contradiction, that the following general claim fails: every finite-dimensional commutative unital F-algebra D with 1D≠0 and dim⁡FD≥1 admits a decomposition of 1D into pairwise orthogonal idempotents of D that are primitive in D. Let S⊆N be the nonempty set of F-dimensions of such counterexamples; by [F3] let d∈S be least and fix a counterexample D with dim⁡FD=d.

2.1step 1.2F2

The centre C is finite-dimensional over F with dim⁡FC≤dim⁡FA, by [F2] applied to the linear subspace C of the finite-dimensional space A.

2.2step 1.3given

Since D is a counterexample, 1D is not primitive in D: otherwise k=1, e1=1D would be the required decomposition. Hence there are nonzero orthogonal idempotents u,v∈D with 1D=u+v.

3.1step 2.2F1algebra

The set Du:=uD={ux:x∈D} is a linear subspace of D and, with the inherited operations, a commutative unital F-algebra with identity u: it is closed since ux+uy=u(x+y), α(ux)=u(αx) and (ux)(uy)=u2xy=u(xy) for x,y∈D, α∈F, while u⋅ux=ux; and u≠0. The same holds for Dv:=vD with identity v.

4.1step 3.1step 1.3F2algebra

One has Du≠D because v∉Du: if v=ux then 0=uv=u2x=ux=v≠0, a contradiction using uv=0 and u2=u. Hence by [F2], applied to the subspace Du of D with dim⁡FD=d, one has dim⁡FDu<d; the same argument gives dim⁡FDv<d.

5.1step 4.1step 1.3given

By the minimality of d in S, no counterexample has dimension <d, and since dim⁡FDu<d and dim⁡FDv<d with 1Du=u≠0, 1Dv=v≠0, the general claim holds for Du and for Dv: there are pairwise orthogonal idempotents f1,…,fa of Du primitive in Du with u=f1+⋯+fa, and pairwise orthogonal idempotents g1,…,gb of Dv primitive in Dv with v=g1+⋯+gb.

6.1step 5.1step 3.1algebra

The combined family f1,…,fa,g1,…,gb is a decomposition of 1D into pairwise orthogonal idempotents of D that are primitive in D: the elements lie in Du∪Dv⊆D; distinct f's are orthogonal and distinct g's are orthogonal by step 5.1; figj=(ufi)(vgj)=uvfigj=0; and if fi=p+q with p,q nonzero orthogonal idempotents of D, then p=fip=ufip=up∈Du and likewise q=uq∈Du, contradicting primitivity of fi in Du (and symmetrically for gj in Dv).

7.1step 6.1step 1.3

Step 6.1 contradicts the choice of D as a counterexample, so no counterexample exists and the general claim of step 1.3 holds: every finite-dimensional commutative unital F-algebra D with 1D≠0 and dim⁡FD≥1 decomposes its identity into pairwise orthogonal primitive idempotents.

8.1step 7.1step 2.1step 1.1∎

Apply step 7.1 to D=C=Z(A): by steps 1.1 and 1.2, C is a commutative unital F-algebra with 1≠0 and dim⁡FC≥1; by step 2.1 it is finite-dimensional. This produces 1=e1+⋯+ek with the ei pairwise orthogonal idempotents of C=Z(A) primitive in C; idempotents of Z(A) are exactly the central idempotents of A, and primitive in C says precisely that ei is not the sum of two nonzero orthogonal idempotents of Z(A). Since no semisimplicity was used and the only invoked principles are the choice-free subspace theorem [F2], the choice-free well-ordering principle [F3] and finite selections, the proof is complete.

Depends on

Used by

Dependency tree · two levels

30 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