Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

The idempotent completion is idempotent complete and its inclusion is fully faithful and universal

Statement

For a preadditive category C, the idempotent completion Kar(C) is preadditive and idempotent complete, and the inclusion

I:CKar(C),A(A,1A),

is fully faithful and additive.

More generally, let F:CD be an additive functor. Suppose that for every object (A,e) of Kar(C) a splitting of F(e) has been supplied in D,

F(A)peSeieF(A),iepe=F(e), peie=1Se.

Then there is an additive functor F~:Kar(C)D with F~(A,e)=Se and F~(u)=pfF(u)ie, extending F along I up to natural isomorphism. Different supplied splitting families give naturally isomorphic extensions. If C is small and the Axiom of Choice is assumed, one may choose such a splitting family whenever D is idempotent complete.

Facts & Assumptions

Given: A preadditive category C, its idempotent completion, and an additive functor F:CD with a supplied splitting family for the idempotents F(e).

[L1]

The objects, morphisms, and identities of Kar(C) are given by the Karoubi-envelope construction (The idempotent completion of a preadditive category).

[L2]

A category is idempotent complete when every idempotent splits, and an additive functor preserves sums on hom-groups (Idempotent complete category, Additive functor).

[L3]

Proof

technique · direct
1.1

By [L1], each hom-set of Kar(C) is the subgroup fC(A,B)e of the ambient hom-group, so it is an abelian group and composition is inherited bilinearly. Also Kar(C)((A,1A),(B,1B))=C(A,B), so the inclusion I is fully faithful and additive.

L1L2
1.2

Let u:(A,e)(A,e) be an idempotent in Kar(C). Then u=eu=ue and u2=u. The object (A,u) of [L1] together with the morphisms u:(A,e)(A,u) and u:(A,u)(A,e) satisfies the splitting equations uu=u on both sides, so u splits. Hence Kar(C) is idempotent complete by [L2].

L1L2
2.1

Define F~(A,e):=Se and for u:(A,e)(B,f) set F~(u):=pfF(u)ie. This is well defined because F(f)F(u)F(e)=F(u), so ifpfF(u)ie=F(u)ie and pfF(u)ie lands between the chosen splitting objects. For composable u:(A,e)(B,f) and v:(B,f)(C,g) one has F~(v)F~(u)=pgF(v)ifpfF(u)ie=pgF(v)F(f)F(u)ie=pgF(vu)ie=F~(vu), and the identity case is similar. Additivity follows from [L2].

L2step 1.1
3.1

For each object A of C, the identity pair F(A)1F(A)1F(A) is a splitting of F(1A)=1F(A). Since the supplied family also splits F(1A), [L3] gives a unique isomorphism ηA:F~(I(A))=S1AF(A) commuting with the two splittings. For a morphism u:AB, step 2.1 gives F~(I(u))=p1BF(u)i1A, and the defining commutativities of ηA and ηB imply ηBF~(I(u))=F(u)ηA. So η:F~ ⁣IF is a natural isomorphism.

L3step 2.1
3.2

If a second splitting family is chosen, then [L3] gives for each object (A,e) a unique isomorphism θe:SeSe commuting with the two splittings of F(e). For a morphism u:(A,e)(B,f), the composites θfF~(u) and F~(u)θe are both maps SeSf compatible with those two splittings, so the same uniqueness forces θfF~(u)=F~(u)θe. Hence the two extensions are naturally isomorphic.

L3step 2.1
4.1

If C is small and the Axiom of Choice is assumed, then one may choose a splitting of each idempotent F(e) whenever D is idempotent complete. Applying steps 2.1-3.2 to such a choice gives the asserted universal extension.

L2step 2.1step 3.2

Depends on

Used by

Dependency tree · two levels

9 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