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 cone connecting map agrees with the shifted identity up to the declared sign
Statement
For the canonical short exact sequence of a chain map in a module category, the connecting morphism corresponds under the shift isomorphism to the homology map . In particular, when , the connecting morphism is the shifted identity up to the sign built into the shift convention.
Facts & Assumptions
Given: A chain map of module complexes and an integer .
The cone long exact sequence is obtained from the canonical short exact cone sequence (The cone long exact sequence).
In module categories, the connecting map is computed by lifting a cycle and taking its boundary class (Elementwise formula for the connecting map in module categories).
The shift isomorphism identifies with using the sign convention fixed for shifts (Homology of a shift is shifted homology).
Proof
A class in is represented by a cycle . In the canonical cone sequence, the element lifts that class, and its boundary is By [L2], the connecting morphism sends to .
Step 1.1 is exactly the formula for after identifying with via [L3]. Hence the connecting map of the cone sequence agrees with under that shift identification. When , this becomes the shifted identity with precisely the sign encoded in [L3].
Depends on
Used by
Dependency tree · two levels
13 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
- Charles A. Weibel, Chapter 1 of An Introduction to Homological Algebra (standard reference, not scraped)