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).
Exactness identifies images with kernels, and each morphism factors through its image by an epimorphism (Exactness at a node, Every morphism factors as an epimorphism followed by a monomorphism, uniquely up to unique isomorphism).
Epimorphisms are preserved by pullback; every image inclusion is a kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel (The pullback of an epimorphism is an epimorphism, Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel).
Pullback diagram
The proof uses the pullback of along :
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 displayed above. 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, [L6] makes it 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 .
Let be a kernel of . Pull back along , obtaining an epimorphism and with . Then . By [L5], , so factors through the image inclusion of . Pull back the epic image projection along that factorization. This gives an epimorphism and with .
Let be a cokernel of , and let be induced by , so . Since , one has , and epicity of gives . Let be a kernel of . Pull back the epimorphism along , giving an epimorphism and with . Then , so factors through . Pull back the epic image projection to obtain an epimorphism and with .
Put . Since , it factors through a kernel of as . Let be the induced arrow. Then . Monicity of gives . Since is epic, . By [L6], factors through ; with from step 3.2, this proves .
The square and bottom-row relation give . Thus factors through as for a unique . The pair gives with and . Since and is monic, . Hence . The composite is epic, so . By [L6], factors through ; together with , this proves .
The two central nodes are exact by steps 4.1 and 4.2; the other nodes and the endpoint clauses follow from step 3.1. Thus the stated sequence is exact.
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
- Exactness at a node
- Every morphism factors as an epimorphism followed by a monomorphism, uniquely up to unique isomorphism
- Every monomorphism is the kernel of its cokernel, and dually every epimorphism is the cokernel of its kernel
Used by
- The preconnecting arrow on cycles Definition
- Exactness at the homology of the left complex Lemma
- Exactness at the homology of the middle complex Lemma
- Exactness at the homology of the right complex Lemma
- Exactness at the target of the connecting map Lemma
- The exact couple and subquotient constructions of the filtered complex spectral sequence agree Proposition
- Naturality of the homology connecting morphism Theorem
- The cone long exact sequence Theorem
Dependency tree · two levels
28 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)