Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Universal properties and functoriality of G0 and split K0

Statement

Let C,C′ be essentially small abelian categories and let D,D′ be essentially small additive categories. For any abelian group H, every function χ ⁣:Iso⁡(C)→H satisfying χ(Y)=χ(X)+χ(Z) for every short exact sequence 0→X→Y→Z→0 factors uniquely as a homomorphism χ‾ ⁣:G0(C)→H with χ‾([X])=χ(X). Every function ψ ⁣:Iso⁡(D)→H satisfying ψ(X⊕Y)=ψ(X)+ψ(Y) factors uniquely as a homomorphism ψ‾ ⁣:K0split(D)→H with ψ‾([X])=ψ(X). Here Iso⁡ is the set of isomorphism classes, so these are class functions.

An exact functor between essentially small abelian categories induces a homomorphism on G0, and an additive functor between essentially small additive categories induces a homomorphism on split K0. These assignments preserve identities and composition. Naturally isomorphic exact functors, or naturally isomorphic additive functors, induce equal homomorphisms.

Facts & Assumptions

Given: The categories and abelian group H in the Statement. The free abelian groups are formed on the sets of isomorphism classes, and all quotient relations are the ones in the respective G0 and split-K0 definitions. No choice principle is used.

[F1]

G0(C) is the free abelian group on Iso⁡(C) modulo the relations eY−eX−eZ from short exact sequences (Grothendieck group of an essentially small abelian category).

[F2]

K0split(D) is the free abelian group on Iso⁡(D) modulo eX⊕Y−eX−eY (Split Grothendieck group of an additive category).

[F3]

A function from a set to an abelian group extends uniquely to a homomorphism from the free abelian group on that set (Free abelian group on a set).

[F4]

A homomorphism that kills a normal subgroup factors uniquely through the quotient group (A homomorphism that kills a normal subgroup factors uniquely through the quotient group).

[F5]

In an abelian category, a composable sequence 0→X→iY→pZ→0 is short exact exactly when i is a kernel of p and p is a cokernel of i (A short exact sequence is a kernel-cokernel pair).

[F6]

An exact functor is additive and preserves the finite limits and finite colimits that exist in its source category (Exact functor between abelian categories).

[F7]

An additive functor induces additive homomorphisms on the morphism abelian groups (Additive functor).

[F8]

An additive category is a preadditive category with all finite biproducts (Additive category).

[F9]

A functor preserves identity morphisms and composition (Covariant functor, identity functor, composite functor, and contravariant functor).

[F10]

A natural isomorphism has an inverse natural transformation (Natural isomorphism).

Proof

technique · direct
1.1F1F3F4givenconstructalgebra

Let FC be the free abelian group on Iso⁡(C) and let RC be the subgroup generated by eY−eX−eZ for the short exact sequences of [F1]. By [F3], χ extends uniquely to χ~ ⁣:FC→H. For each generator of RC, χ~(eY−eX−eZ)=χ(Y)−χ(X)−χ(Z)=0, so RC⊆ker⁡χ~. Since H is abelian, RC is normal; [F4] gives a unique homomorphism from FC/RC=G0(C) with the required values. The zero sequence gives χ(0)=χ(0)+χ(0), hence χ(0)=0.

1.2F2F3F4givenconstructalgebra

Let FD be the free abelian group on Iso⁡(D) and let RD be generated by eX⊕Y−eX−eY. By [F3], ψ extends uniquely to ψ~ ⁣:FD→H, and the additivity hypothesis makes every generator of RD lie in its kernel. The subgroup RD is normal because FD is abelian, so [F4] gives a unique homomorphism FD/RD=K0split(D)→H. Taking X=Y=0 gives ψ(0)=0.

2.1F1F5F6F9step 1.1algebra

Let F ⁣:C→C′ be exact. If f is an isomorphism, applying [F9] to ff−1=1 and f−1f=1 shows Ff is an isomorphism, so [X]↦[FX] is a function on Iso⁡(C). In a short exact sequence, [F5] identifies i as ker⁡p and p as coker⁡i. Exactness [F6] preserves these finite limit and colimit diagrams, so 0→FX→FY→FZ→0 is short exact in C′. Thus the image class function is additive, and step 1.1 gives the induced homomorphism G0(F) ⁣:G0(C)→G0(C′) with G0(F)([X])=[FX].

2.2F2F7F8F9step 1.2constructalgebra

Let F ⁣:D→D′ be additive. If f is an isomorphism, applying [F9] to ff−1=1 and f−1f=1 shows Ff is an isomorphism, so [X]↦[FX] is defined on isomorphism classes. For a biproduct X⊕Y, let iX,iY and pX,pY be its inclusions and projections. The equations paib=δab and iXpX+iYpY=1 characterize this biproduct. By [F7], F preserves zero morphisms and addition; by [F9], it preserves identities and composition. The four image maps therefore exhibit F(X⊕Y) as a biproduct of FX and FY, so F(X⊕Y)≅FX⊕FY. The image class function is additive, and step 1.2 gives the induced homomorphism K0split(F) ⁣:K0split(D)→K0split(D′) with K0split(F)([X])=[FX].

3.1F6F7F9step 2.1step 2.2algebra

For identity functors the formulas in steps 2.1–2.2 fix every generator. For composable exact functors F,G, and separately for composable additive functors, the composite is again of the same type. On every generator, [X]↦[FX]↦[G(FX)]=[(GF)X]; hence the induced homomorphism of GF is the composite of the induced homomorphisms of F and G. Equality on generators proves identity and composition laws for both assignments.

4.1F9F10step 2.1step 2.2algebra∎

If η ⁣:F⇒G is a natural isomorphism, [F10] supplies a natural inverse, so each component ηX ⁣:FX→GX is an isomorphism. Thus [FX]=[GX] in the target isomorphism-class set, and the induced homomorphisms agree on every generator of the corresponding G0 or split-K0 group. They are therefore equal.

Depends on

Used by

Dependency tree · two levels

37 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