Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Projective epimorphisms onto the simples generate every finite-length object

Statement

Let C be a locally finite k-linear abelian category with finitely many isomorphism classes of simple objects, represented by S1,…,Sn, and suppose that for each i a projective epimorphism Qi↠Si is chosen (for instance the projective cover supplied by Superfluous subobjects and projective covers in an abelian category when C is finite in the intrinsic sense). Then for every object X of finite length there are integers mi≥0 and an epimorphism ⨁i=1nQimi↠X; in particular, with P=⨁iQi, every object of C admits an epimorphism Pm↠X for some m≥0. Only the finitely many chosen maps Qi↠Si are selected, and no other choice is used.

Facts & Assumptions

Given: A field k, a locally finite k-linear abelian category C, simple representatives S1,…,Sn for all isomorphism classes of simple objects of C, and chosen projective epimorphisms φi:Qi↠Si, i=1,…,n.

[F1]

An object has finite length exactly when it admits a composition series 0=X0<X1<⋯<Xℓ=X with simple factors Xj/Xj−1; the length ℓ(X) is the number of factors, the truncation 0=X0<⋯<Xj is a composition series of Xj so that ℓ(Xj)=j, and lengths are additive along a subobject (Object of finite length, Composition series and composition factors of an object, Length is additive along a subobject).

[F2]

The quotient of an object X by a subobject represented by m:M↣X is coker⁡(m), written X/M, and its defining map is the cokernel map (The quotient of an object by a subobject, Subobject and quotient object as mutual-factorisation classes of monomorphisms and epimorphisms).

[F3]

A cokernel c:B→C of f:A→B satisfies cf=0, and every h with hf=0 factors as h=hˉc for a unique hˉ (Kernels and cokernels in a category with zero morphisms as equalizers and coequalizers).

[F4]

A projective object Q has the lifting property: for every epimorphism e:E↠M and every f:Q→M there is f~:Q→E with ef~=f (Projective object).

[F5]
[F6]

A biproduct ⨁iAi is simultaneously a product and a coproduct with injections and projections satisfying the biproduct identities, and biproducts are associative and commutative up to canonical isomorphism; in particular a morphism out of a biproduct is determined by its components, and an inclusion of a subfamily of summands is split by the corresponding projection (Biproduct, Biproducts are associative, commutative, and unital up to canonical isomorphism, An additive category is an Ab-enriched category with a zero object and finite biproducts).

[F7]

C is abelian, hence additive and preadditive: its hom-sets are abelian groups, composition is bilinear, and there is a zero object (Abelian category, Additive category, Preadditive category).

[F8]

A simple object is nonzero and has exactly two subobjects, the zero subobject and its identity; by hypothesis every simple object of C is isomorphic to one of S1,…,Sn (Simple object, given).

Proof

technique · induction
1.1baseF1F5F6given

The assertion to be proved by induction on the natural number p is: for every object Y of C of length p there are integers mi≥0 and an epimorphism ⨁iQimi↠Y. At p=0 a composition series of Y has no factors, so Y=0 by [F1]; taking all mi=0, the empty biproduct is the zero object and the identity 0→Y is an epimorphism by [F5], so the assertion holds at p=0.

1.2ih

Assume the assertion at the natural number p: for every object Y of C with ℓ(Y)=p there are integers mi≥0 and an epimorphism ⨁iQimi↠Y.

1.3F1F8given

Suppose X has length p+1 and let 0=X0<⋯<Xp+1=X be a composition series of X; then the last factor S=Xp+1/Xp is simple by [F1], hence S≅Si for some i by [F8], and ℓ(Xp)=p by [F1].

2.1step 1.2step 1.3F2F4F6constructgiven

Successor step. Let X have length p+1, with composition series, last simple factor S≅Si and Y:=Xp of length p as in step 1.3. By the induction hypothesis of step 1.2 applied to Y there are integers mj≥0 and an epimorphism e:W↠Y, where W:=⨁jQjmj is a finite biproduct of the chosen projectives. The quotient π:X↠X/Xp=S of [F2] is an epimorphism, and composing the chosen epimorphism φi:Qi↠Si with an isomorphism Si≅S gives an epimorphism φ:Qi↠S, so by the lifting property [F4] of the projective Qi there is ψ:Qi→X with πψ=φ. Let u:W⊕Qi→X be the morphism with components the composite W→eY↣X and ψ, which exists and is unique by the biproduct property [F6].

3.1step 2.1F3F5F7algebra

The morphism u of step 2.1 is an epimorphism. Let c:X→C be a morphism with cu=0. Composing with the first biproduct injection gives c∘u∘injW=c∘(inclusion∘e)=0, and e is epic, so c∘inclusion=0 for the inclusion Xp↣X; since π is a cokernel of that inclusion by [F2], the universal property [F3] gives c=cˉ∘π for some cˉ:S→C. Then 0=cu composed with the second biproduct injection gives cˉ∘π∘ψ=cˉ∘φ=0, and φ is epic, so cˉ=0 and therefore c=0. Since C is preadditive [F7], a morphism u with the property that every c satisfying cu=0 is zero is an epimorphism: from gu=hu one gets (g−h)u=0, hence g−h=0.

4.1step 3.1F6given

The source of the epimorphism u of step 3.1 is a finite biproduct of the chosen objects Q1,…,Qn: regrouping its summands by index, W⊕Qi≅⨁i=1nQimi′ for integers mi′≥0 by the associativity and commutativity of biproducts [F6]. Hence the successor case holds: X of length p+1 admits an epimorphism ⨁iQimi′↠X.

5.1step 1.1step 4.1F5F6discharge-induction∎

Step 1.1 is the base case and steps 1.3, 2.1, 3.1 and 4.1 pass from p to p+1 using the induction hypothesis of step 1.2, so by induction on p every object X of finite length admits an epimorphism ⨁iQimi↠X for suitable integers mi≥0. For the final clause put P=⨁iQi and m=∑imi; by [F6] the power Pm is the biproduct ⨁iQim, whose subfamily of summands Qimi has ⨁iQimi as a biproduct, and the corresponding projection Pm↠⨁iQimi is a split epimorphism, hence epic by [F5]; composing it with an epimorphism onto X gives an epimorphism Pm↠X by [F5]. The proof selects only finite data (a composition series of the object at hand, finitely many summand indices and biproduct structure maps, and the n supplied epimorphisms φi), so no choice principle is used.

Depends on

Used by

Dependency tree · two levels

40 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