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 Kunneth Tor map
Statement
Assume the Axiom of Choice. Let be a PID and complexes of free -modules with finite diagonals. For every , the cycle-boundary presentations induce a natural surjection
Facts & Assumptions
Given: The stated ring, complexes, Choice hypothesis, and degree ; all tensor complexes use the direct sum and Koszul differential.
The cycle-boundary sequences are exact: The cycle-boundary short exact sequences for a free complex over a PID.
Under Choice, all are free by Boundaries and cycles in a free complex over a PID are free, hence projective by Free modules are projective, with the exact choice boundary.
A short exact sequence of complexes gives a long exact homology sequence The long exact sequence in homology, naturally in its maps The long exact homology sequence is natural.
Tor can be computed from a projective resolution of its first variable: The balanced Tor bifunctor.
Proof
Let and be the complexes with zero differential and , . Inclusion and the corestriction of give . This is a sequence of chain complexes because vanishes on cycles and . Each degree sequence splits by [F2]. Tensoring with and taking direct-sum total complexes therefore gives a short exact sequence .
Since and are free, tensoring with either is a direct sum of copies and commutes with homology. Thus and . The differential on a fixed summand is , which has the same cycles and boundaries as .
The connecting map is the direct sum of the maps induced by . Indeed, represent a summand by a finite sum of with a cycle in , and lift to with . Then , with no second term. This is the defining connecting-map calculation, so its sign is positive.
The free presentation is a length-one projective resolution. Hence [F4] identifies with . Therefore is exactly the displayed Tor sum after reindexing .
By [F3], has image . Define as corestricted to this kernel and followed by the identification in step 4.1. It is well defined on homology and surjective. A pair of chain maps induces maps of the sequence in step 1.1 and of the free presentations in step 4.1, so [F3] and the comparison naturality in [F4] prove naturality of . Empty sums and zero modules cause no exception.
Depends on
Used by
Dependency tree · two levels
23 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
- Weibel, An Introduction to Homological Algebra (standard reference, not scraped)