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 long exact Tor sequence in the left-module variable
Statement
Assume the Axiom of Dependent Choice. For of left -modules and a right module , there is the natural long exact sequence .
Proof
Given: the stated short exact sequence, a right module , and supplied projective resolutions of its three left modules.
By The horseshoe lemma for projective resolutions, choose a projective horseshoe resolution of the middle module that fits with resolutions of the outer modules into a degreewise split short exact sequence. Tensoring it with preserves the degreewise splittings, hence gives a short exact sequence of chain complexes.
The homology long-exact-sequence construction supplies the displayed connecting maps and exactness.
Change-of-resolution coherence identifies the three homology families with the fixed balanced Tor functor and makes the sequence natural. Its degree-zero tail is , so no unclaimed left exactness is introduced.
Depends on
Used by
- The Tor boundary is exactly the obstruction to left exactness after tensoring a fixed short exact sequence Corollary
- Tor admits dimension shifting in either variable Proposition
- A right module is flat exactly when Tor one against every left module vanishes Theorem
- Flat dimension at most n is equivalent to the prescribed higher Tor vanishing Theorem
- The long exact Tor sequence in the right-module variable Theorem
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
- Charles A. Weibel, An Introduction to Homological Algebra (standard reference, not scraped)