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 PID Kunneth sequence admits a section after choices
Statement
Assume AC. Let be a commutative PID and nonnegative complexes of arbitrary-rank free -modules, with direct-sum tensor totalization and Koszul differential. For every , the Tor quotient in the natural PID Kunneth sequence admits an -linear section Specifically, chosen degreewise cycle retractions determine a retraction of the cross product , and a section satisfying . This asserts existence after choices, with no claim of a natural choice of section.
Facts & Assumptions
Given: The ring, complexes and AC in the statement. All sums are on nonnegative finite diagonals and empty sums are zero.
The natural sequence is exact, where and : The natural PID Kunneth sequence is exact.
Under AC, sections of give cycle retractions ; the same holds for : A free PID complex decomposes into two-term cycle-boundary pieces.
Chain maps induce well-defined homology maps: A chain map induces a well-defined map on homology.
AC permits the simultaneous degreewise choices: The Axiom of Choice.
The tensor differential is the Koszul differential: The tensor product of a right and a left chain complex is totalized by direct sums with the Koszul differential.
Proof
Select the sections of [F2] for both complexes, using [F4], and denote the resulting cycle retractions by and . Define and . Since a boundary is a cycle, , whose homology class is zero. Thus ; likewise . With zero differentials on and , these are chain maps.
Define by . This descends to tensors because the formula is bilinear and balanced: replacing by gives the same tensor by linearity of . On a homogeneous tensor, . The target differential is zero, so is a chain map.
The target has zero differential, hence its degree- homology is exactly , even if its modules are not free. By [F3], induces . For cycles the retractions fix them, so . Elementary tensors of homology classes generate , proving .
Put . If and , exactness gives for some . Applying gives , so . Therefore is injective.
Given , surjectivity of supplies with . Set . Then and , since . Thus is surjective. Its inverse is linear: sums and scalar multiples of inverse images are inverse images of the corresponding sums and scalar multiples, and uniqueness identifies them. This inverse needs no further selection of representatives.
By definition . For any , the element lies in and maps to , so uniqueness gives . Hence both asserted composites hold. The maps and are inverse: use these two identities, , , and .
For , , the section is the unique zero-domain map, and follows from step 6.1. The same proof handles a zero complex or a zero or , including degree one. The choice of occurs in and therefore in ; no compatibility of those choices with arbitrary chain maps was imposed. This proves the stated existence without asserting naturality of the chosen section.
Depends on
Used by
Dependency tree · two levels
18 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
- tom Dieck, Algebraic Topology, final paragraph of proof of Theorem 11.10.1, printed p.299 (standard reference, not scraped)
- Friedman, Singular Intersection Homology, §6.4.5, Splitting, printed p.318 (standard reference, not scraped)