Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedPipeline-generatedprecheck passaudited 2026-08-27
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.

FALSE: every idempotent splits

Statement

False claim: every idempotent in every preadditive category splits.

Facts & Assumptions

Given: The one-object preadditive category attached to the commutative ring R=Z×Z and the idempotent e=(1,0)R.

[L1]

Idempotent completeness means that every idempotent splits (Idempotent complete category).

[L2]

An additive category with kernels is idempotent complete, so the missing hypothesis really is extra structure (An additive category with kernels is idempotent complete).

[L3]

The Karoubi envelope adjoins formal splitting objects for idempotents (The idempotent completion of a preadditive category).

Refutation

technique · direct
1.1

The element e=(1,0) satisfies e2=e, so it is an idempotent endomorphism of the unique object of the one-object preadditive category attached to R.

givenL1
2.1

If e split there as ip=e and pi=1, then commutativity of R would give e=ip=pi=1, contradicting e=(1,0)(1,1). So this idempotent does not split.

step 1.1
3.1

Therefore not every idempotent splits. The point of [L2] is that kernels rule this out in additive categories, while [L3] records the standard repair that adjoins the missing split object.

L2L3step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

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