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 theorem for free complexes over a PID
Statement
Let be a PID and be complexes of free -modules for which each total degree has a finite direct-sum diagonal. There is a natural exact sequence .
Proof
Given: free PID-complexes with finite direct-sum diagonal in every total degree.
Every is free, and every boundary module is free by Boundaries and cycles in a free complex over a PID are free; hence all of these modules are flat.
Weibel's cited Kunneth formula for complexes applies to the right complex and left complex under exactly the flatness conditions verified in step 1.1. It gives the displayed natural short exact sequence; its left map is the cross product of The Kunneth cross-product map is well defined and natural, and its right map is the quotient of The Kunneth Tor map. The finite-diagonal hypothesis makes each displayed direct sum finite; an empty diagonal gives the zero module.
Depends on
Used by
- Kunneth over a field Corollary
- Kunneth when one homology family is flat Corollary
- Kunneth for two cyclic two-term complexes Example
- Freeness of chain groups cannot simply be dropped from the classical Kunneth statement False statement
- Kunneth over a PID is not always a tensor-product isomorphism False statement
- Euler characteristic is multiplicative under the finite Kunneth hypotheses Proposition
- The Kunneth sequence splits nonnaturally Theorem
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
- Weibel, An Introduction to Homological Algebra, Theorem 3.6.3, printed p. 88 (standard reference, not scraped)