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.
Objects of finite length form an abelian subcategory
Statement
In an abelian category, the full subcategory whose objects have finite length is an abelian subcategory.
Facts & Assumptions
Given: An abelian category .
Finite length is the property defined in Object of finite length.
Finite length is stable under passing to subobjects and quotients, and is additive across a subobject (Length is additive along a subobject).
A full subcategory is abelian precisely when it is closed under kernels, cokernels, and finite biproducts computed in the ambient abelian category (Abelian subcategory and exact embedding).
Proof
Let be a morphism between finite-length objects. Since and , [L2] makes both and finite length. The quotient is then finite length by [L2], so the cokernel of is finite length as well.
If and have finite length, then the inclusion has quotient . Applying [L2] to that inclusion shows that has finite length. So the finite-length objects are closed under finite biproducts.
Steps 1.1 and 1.2 are exactly the kernel, cokernel, and finite-biproduct closures required by [L3]. Therefore the full subcategory of finite-length objects is an abelian subcategory.
Depends on
Used by
Nothing in the library uses this result yet.
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
- Pavel Etingof, Shlomo Gelaki, Dmitri Nikshych, and Victor Ostrik, Tensor Categories, Section 1.5 (standard reference, not scraped)