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.
Snake lemma under the weaker Stacks hypotheses
Statement
For snake data in the weaker Stacks shape
there is an exact sequence
If is monic, then is monic. If is epic, then is epic.
Facts & Assumptions
Given: The weaker snake-data diagram in the statement.
In an exact sequence ending in , the last map is epic; in an exact sequence beginning at , the first map is monic (Degenerate exactness criteria).
Kernels and cokernels are characterized by their universal properties (Kernels and cokernels in a category with zero morphisms as equalizers and coequalizers).
Pullbacks of epimorphisms are epimorphisms, and in a pullback square the induced map on kernels is an isomorphism (The pullback of an epimorphism is an epimorphism, In a pullback square, the induced map on the kernels of the two parallel arrows is an isomorphism).
Under the endpoint hypotheses, the induced kernel and cokernel sequences are exact (Exactness of kernel and cokernel sequences under endpoint hypotheses).
Epicity is equivalent to the member-lifting property (Epimorphy is detected by members).
The subtraction surrogate produces a member mapping to zero from two members with the same image (The subtraction surrogate).
Exactness is self-dual (Exactness is self-dual).
Proof
Because the top row is exact and ends in , the map is epic by [L1]. Because the bottom row is exact and begins at , the map is monic by [L1]. Choose a kernel of and a cokernel of . Form the pullback tikzcd P \arrow[r, "\pi'"] \arrow[d, "\pi"'] & Y \arrow[d, "b"] \\ K \arrow[r, "k_\gamma"'] & Z. By [L3], is epic. Since the kernel property of gives a unique map such that
Let be a kernel of . By [L3], the induced map is an isomorphism. Exactness of the top row at says that is the image of , so there is an epimorphism with Then and monicity of gives . Therefore Because is epic, . Since is epic, it is the cokernel of its kernel , so there is a unique morphism with
Applying [L4] to the given diagram gives exactness of and of If is monic, then the sequence is exact, so the same theorem gives that is monic. Dually, if is epic, then is epic. Thus only exactness at and at remains.
Let be a kernel of , and let be the induced map with . Because , the pair factors through the pullback, giving with Then so monicity of gives . Therefore which proves that kills the image of .
Conversely, let be a member of with . Because is epic, [L5] gives a member of with . Then so the cokernel property of gives a member of with . Hence Applying [L6] to and with respect to , obtain a member of with and Since , the member factors through and maps to in . Thus every member of lies in the image of , so the sequence is exact at .
The exactness at is the formal dual of step 3.3 in the opposite abelian category. By [L7], that dual exactness transports back to the statement that
Hence the displayed six-term sequence is exact under the weaker Stacks hypotheses, with the additional endpoint monic and epic clauses already proved in step 3.1.
Depends on
- Snake data
- Kernels and cokernels in a category with zero morphisms as equalizers and coequalizers
- Degenerate exactness criteria
- The pullback of an epimorphism is an epimorphism
- In a pullback square, the induced map on the kernels of the two parallel arrows is an isomorphism
- Exactness of kernel and cokernel sequences under endpoint hypotheses
- Epimorphy is detected by members
- The subtraction surrogate
- Exactness is self-dual
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
30 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, Section 12.5, Lemma 12.5.17(2) (standard reference, not scraped)
- David Mehrle, Category Theory, Part III, Lemma 7.24 (standard reference, not scraped)