Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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.

Lifting an idempotent recovers a product decomposition

Example

Let A=k⟦t⟧×k⟦t⟧,I=(t)k⟦t⟧×(t)k⟦t⟧. Then A/I≅k×k has the nontrivial idempotent (1,0), and lifting that idempotent recovers the product decomposition of A itself.

Facts & Assumptions

Given: The complete pair (A,I) above.

[L1]

Every complete separated adic pair is Henselian (Complete separated adic pairs are Henselian).

[L2]

Idempotents lift uniquely in a Henselian pair (Idempotents lift uniquely in a Henselian pair).

Verification

technique · lift the visible residue idempotent and read off its two summands
1.1L1givenalgebra

For every n≥1 one has In=(tn)k⟦t⟧×(tn)k⟦t⟧, so A/In≅k⟦t⟧/(tn)×k⟦t⟧/(tn). Thus A is the inverse limit of the quotients A/In coordinatewise, and ⋂n≥1In=0×0, again coordinatewise. Hence A is I-adically complete and separated, so [L1] shows that (A,I) is Henselian.

2.1L2step 1.1givenalgebra

The residue ring is A/I≅k×k, and (1,0) is an idempotent there. The obvious lift in A is e=(1,0), which indeed satisfies e2=e. By [L2], that lift is the unique idempotent of A reducing to (1,0). Its complement is 1−e=(0,1).

3.1step 2.1algebra∎

Multiplication by e and 1−e gives A=eA×(1−e)A=(k⟦t⟧×0)×(0×k⟦t⟧). Thus the lifted idempotent exactly recovers the original product decomposition.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 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