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.

Simple classes freely generate the Grothendieck group of a length category

Statement

Let C be an essentially small abelian category in which every object has finite length. Let Simp⁡(C) be the set of isomorphism classes of simple objects. The homomorphism

Φ:Z[Simp⁡(C)]⟶G0(C),e[S]⟼[S],

is an isomorphism. For any object M and simple object S, the coordinate of [M] under Φ−1 at e[S] is [M:S], the number of composition factors isomorphic to S in a composition series of M.

Facts & Assumptions

Given: An essentially small abelian category C in which every object has finite length. G0(C) uses the short-exact-sequence relations.

[F1]

Iso⁡(C) is a set, and G0(C) is formed by imposing [Y]=[X]+[Z] for every short exact sequence 0→X→Y→Z→0 (Grothendieck group of an essentially small abelian category).

[F2]

Every object of finite length admits a composition series (Object of finite length).

[F3]

A composition series is a finite strict chain whose successive quotient objects are simple (Composition series and composition factors of an object).

[F4]

Any two composition series of the same object have the same simple composition factors up to permutation and isomorphism (Jordan-Holder theorem in an abelian category).

[F5]

A simple object is nonzero and has no subobjects other than zero and itself (Simple object).

[F6]

Pullbacks are limits of cospans and have their usual universal property (Pullbacks and pushouts as limits and colimits of cospans and spans).

[F7]

The pullback of an epimorphism in an abelian category is epic (The pullback of an epimorphism is an epimorphism).

[F8]

Every epimorphism in an abelian category is the cokernel of its kernel (Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel).

[F9]

The quotient by a subobject is the cokernel of its representing monomorphism (The quotient of an object by a subobject).

[F10]

Any function on Iso⁡(C) that is additive on short exact sequences factors uniquely through G0(C) (Universal properties and functoriality of G0 and split K0).

[F11]

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).

[F12]

Every coequalizer morphism, hence every cokernel morphism, is epic (Every equalizer is a monomorphism, and every coequalizer is an epimorphism).

Proof

technique · direct
1.1F1F11construct

Since C is essentially small, Iso⁡(C) is a set by [F1]. Simplicity is invariant under isomorphism, so Simp⁡(C)⊆Iso⁡(C) is a set. Put F:=Z[Simp⁡(C)]. The universal property of the free abelian group defines Φ:F→G0(C) by e[S]↦[S].

1.2F2F3F4construct

For M∈C, choose a composition series 0=M0<M1<⋯<Mn=M. Define [M:S] to be the number of indices i for which Mi/Mi−1≅S. By [F4], this number is independent of the chosen series and of the representative of [M]. Only finitely many factors occur, so μ([M]):=∑[S]∈Simp⁡(C)[M:S]e[S] is a well-defined finite-support element of F. Since this value is unique, no composition series is selected simultaneously for all isomorphism classes.

1.3F3F6F7F8F9F12constructalgebra

The class function [M]↦μ([M]) is additive on short exact sequences. Indeed, take 0→X→iY→pZ→0 and composition series 0=X0<⋯<Xr=X and 0=Z0<⋯<Zs=Z. Regard the first series as a series in Y through the kernel isomorphism i:X≅ker⁡p. For each j, let Yj be the inverse-image subobject of Zj under p, formed by the pullback of p along Zj↪Z. Then Y0=i(X) and Ys=Y. The projection Yj→Zj is epic by [F7]; composing it with the quotient epimorphism Zj→Zj/Zj−1 gives an epimorphism with kernel Yj−1. The kernel assertion follows from the pullback universal property [F6]: a map into Yj is killed by the composite precisely when its Zj-component factors through Zj−1, which is precisely the defining property of Yj−1. By [F8] this composite is a cokernel of Yj−1↪Yj, and by [F9] it therefore identifies Yj/Yj−1≅Zj/Zj−1. These quotients are simple. Thus the chain 0=i(X0)<⋯<i(Xr)=Y0<Y1<⋯<Ys=Y is a composition series of Y, with the factors of the chosen X-series followed by those of the chosen Z-series.

2.1F4step 1.3algebra

The spliced series in step 1.3 has, for each simple S, exactly [X:S]+[Z:S] factors isomorphic to S. Jordan-Hölder [F4] identifies these counts with the counts from any composition series of Y. Therefore [Y:S]=[X:S]+[Z:S] for every simple S, so μ([Y])=μ([X])+μ([Z]). If X=0 or Z=0, the corresponding series is empty and the same argument gives the endpoint identity. Only two finite composition series are chosen for this one sequence; no arbitrary-index choice is used.

3.1F10step 1.2step 2.1

By steps 1.2 and 2.1, μ is an additive class function on Iso⁡(C). The universal property [F10] gives a unique homomorphism μ‾:G0(C)→F with μ‾([M])=μ([M]).

4.1F5step 1.1step 3.1algebra

If S is simple, then 0<S is a composition series with sole factor S by [F5]. Hence μ‾Φ(e[S])=e[S] for every basis vector, so μ‾Φ=1F.

4.2F1step 1.2step 3.1algebra

For a composition series 0=M0<⋯<Mn=M, each short exact sequence 0→Mi−1→Mi→Mi/Mi−1→0 gives [Mi]=[Mi−1]+[Mi/Mi−1] in G0(C) by [F1]. Since [M0]=[0]=0, telescoping gives [M]=∑i=1n[Mi/Mi−1]=Φμ‾([M]). The classes [M] generate G0(C), so Φμ‾=1G0(C).

5.1step 4.1step 4.2F1F2F3F5algebra∎

Steps 4.1 and 4.2 show that Φ and μ‾ are inverse isomorphisms. If Simp⁡(C) is empty, every nonzero object would have a nonempty composition series with a simple first factor; thus every object is zero up to isomorphism, F=0, and the same inverse identities give G0(C)=0. For M=0, the empty composition series gives μ([0])=0, consistent with [0]=0 from [F1]. The theorem is not an iff statement.

Depends on

Used by

Dependency tree · two levels

38 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