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.
Naturality of the connecting morphism
Statement
Given a morphism between two pieces of snake data in the Mac Lane shape in an abelian category, the induced square between their connecting morphisms commutes.
Facts & Assumptions
Given: A commutative ladder between two Mac Lane snake diagrams.
The arrow category of an abelian category is again abelian (The arrow category of an abelian category).
The connecting morphism exists and is unique for Mac Lane snake diagrams (The connecting morphism exists and is unique).
Proof
Regard each vertical arrow of the given ladder as an object of the arrow category . Because kernels, cokernels, pullbacks, and pushouts in are computed componentwise, the entire ladder is again a Mac Lane snake diagram in .
Applying [L2] in produces a connecting morphism between the arrow objects Read componentwise in , that morphism is exactly the pair consisting of the two ordinary connecting morphisms together with the comparison square between them.
The defining square for the arrow-category connecting morphism commutes by construction, and uniqueness in [L2] forces that componentwise square to be the naturality square for the two ordinary connecting morphisms. Therefore the connecting morphism is natural.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
15 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, Exercise VIII.4.4 (standard reference, not scraped)
- The Stacks Project, Section 12.5, Lemma 12.5.18 (standard reference, not scraped)
- Charles A. Weibel, An Introduction to Homological Algebra, Proposition 1.3.4 (standard reference, not scraped)