Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Idempotents lift through finite commutative algebra quotients

Statement

For a finite-dimensional commutative unital k-algebra A and any ideal I, every idempotent of A/I lifts to an idempotent of A.

Facts & Assumptions

Given: The stated algebra, ideal, and eˉ2=eˉ in A/I.

[F1]

The algebra and its quotient decompose into local factors, with zero quotient factors allowed. (Finite-dimensional commutative algebras decompose into local factors)

Proof

technique · direct
1.1

Use [F1] to write A=Ai and A/I=Ai/Ii. In a nonzero local quotient, x and 1x cannot both be nonunits: their sum is 1 and nonunits form its maximal ideal. For an idempotent x, x(1x)=0, so if x is a unit then x=1, and if 1x is a unit then x=0. Thus each nonzero quotient coordinate of eˉ is 0 or 1.

F1
2.1

In each factor Ai choose the same coordinate 0 or 1, choosing 0 for a zero quotient factor. Their finite tuple e satisfies e2=e coordinatewise and maps to eˉ. If A=0, the empty tuple is its sole idempotent and is already a lift.

F1step 1.1

Sources

Jacobsen, Block fusion systems and the center of the group ring, Lemma 2.32 and Theorem 2.33, pp.18–19; general-field lifting proved locally. Local argument and conventions as displayed above.

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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