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.
Every morphism factors as an epimorphism followed by a monomorphism, uniquely up to unique isomorphism
Statement
Every morphism in an abelian category admits a factorization
with epic and monic. If also with epic and monic, then there is a unique isomorphism such that
Facts & Assumptions
Given: An abelian category and a morphism .
The canonical coimage-to-image map exists (The canonical morphism from the coimage to the image exists and is unique).
The coimage projection is epic and the image inclusion is monic (The coimage projection is epic and the image inclusion is monic).
In an abelian category the canonical coimage-to-image map is an isomorphism (Abelian category).
Abelian categories are balanced (An abelian category is balanced).
Every monomorphism is the kernel of its cokernel (Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel).
Proof
Let and be the defining maps. By [L1], factors as , and [L2] makes epic and monic. Since is an isomorphism by [L3], the composite is epic, so is an epic-monic factorization.
Suppose also with epic and monic. Then , so , and the epicity of gives . Since is a kernel of its cokernel by [L5], factors uniquely through as . Reversing the roles of and gives for a unique .
From step 2.1 one gets and , so monicity gives and . Thus is an isomorphism. Finally, , and monicity of gives . Any other comparison map with the same property equals by the uniqueness in step 2.1.
Depends on
Used by
- A chain map carries cycles to cycles and boundaries to boundaries Lemma
- The boundary subobject factors through the cycle subobject Lemma
- Exactness is detected by members Theorem
- Intrinsic finite category hypotheses give a finite projective generator Theorem
- Members modulo equivalence correspond to subobjects Theorem
- Snake lemma in an abelian category Theorem
- Snake lemma under the weaker Stacks hypotheses Theorem
- The image is the least subobject through which a morphism factors Theorem
- The quotient by the kernel followed by the image inclusion is the canonical epi-mono factorization Theorem
- The subobject inequalities underlying exactness Theorem
Dependency tree · two levels
13 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
- Saunders Mac Lane, Categories for the Working Mathematician, Proposition VIII.3.1 (standard reference, not scraped)