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.
The kernel of a monomorphism is zero and the cokernel of an epimorphism is zero
Statement
Let be a category with a zero object and the needed kernels and cokernels. If is monic and is a kernel of , then is a zero object and is the zero morphism into .
Dually, if is epic and is a cokernel of , then is a zero object and is the zero morphism out of .
Facts & Assumptions
Given: A zero object , a monomorphism with kernel , and an epimorphism with cokernel .
A zero object is both initial and terminal, so there are unique morphisms and for every object (Initial object, terminal object, and zero object).
Monomorphisms are left-cancellable and epimorphisms are right-cancellable (Monomorphism and epimorphism by left and right cancellation).
A kernel of is a morphism with through which every morphism with factors uniquely; a cokernel is dual (Kernels and cokernels in a category with zero morphisms as equalizers and coequalizers).
Proof
If satisfies , then also , so [L2] gives . Therefore the unique map from [L1] has the kernel universal property for , because every morphism killed by factors uniquely through .
Kernels are unique up to a unique compatible isomorphism, so the displayed kernel is isomorphic to the zero morphism from step 1.1. Hence is a zero object and is the zero map into . The cokernel claim is the formal dual of the same argument with right cancellation in [L2].
Depends on
Used by
Dependency tree · two levels
7 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, VIII.1 (standard reference, not scraped)
- Gautam Tamme, Algebra II Lecture 9 (standard reference, not scraped)