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.
A subcomplex is the kernel of its quotient map
Statement
If is a subcomplex, then the quotient map has kernel . Conversely, every monomorphism of complexes identifies its source, up to unique isomorphism, with a subcomplex of its target.
Facts & Assumptions
Given: A subcomplex and a monomorphism .
The quotient complex is defined degreewise from the quotients (Quotient complex).
Kernels of chain maps are computed degreewise (The kernel of a chain map is computed degreewise).
In , monomorphisms are morphisms in an abelian category (The category of complexes in an abelian category is abelian).
In an abelian category, a morphism is monic exactly when its kernel is zero (In an abelian category, monic means zero kernel and epic means zero cokernel).
Proof
Let be the quotient map. By [L1], each component has kernel represented by . Then [L2] says the kernel complex of is exactly .
Now let be monic. Its kernel in is therefore the zero complex. By [L2], that kernel is assembled degreewise from the kernels of the component maps , so each is zero. Then [L4] makes every monic in . Since is a chain map, the commuting squares show that the family of monomorphisms is stable under the differentials. Hence these degreewise monomorphisms exhibit as a subcomplex of , unique up to the usual unique isomorphism of represented subobjects.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
16 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
- The Stacks Project, Lemma 12.13.3 (standard reference, not scraped)
- Charles A. Weibel, Chapter 1 of An Introduction to Homological Algebra (standard reference, not scraped)