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 Tor boundary is exactly the obstruction to left exactness after tensoring a fixed short exact sequence
Statement
Assume Dependent Choice (DC), with projective resolutions supplied for the Tor long exact sequence. For of left -modules and a right module , the sequence is exact exactly when the connecting homomorphism is zero. This is vanishing of the boundary map, not necessarily of its domain.
Proof
Given: the displayed short exact sequence, , supplied resolutions, and The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain.
Apply the DC-qualified The long exact Tor sequence in the left-module variable. Its exact degree-zero tail is .
By exactness of that tail, exactness already holds at and , including surjectivity of the final tensor map. The kernel of equals . This uses the stated Tor LES tail, not an undeclared tensor theorem for a commutative ring.
Thus injectivity of , and hence exactness of the whole tensor sequence, is equivalent to .
Remarks
For any explicitly supplied exact tail of the form in step 1.1, the equivalence proved in steps 2.1–3.1 is choice-free. DC is invoked only to obtain the quoted natural resolution-independent Tor boundary; it is not asserted necessary for this elementary kernel-image implication.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
20 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)