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.
Cohomological Kunneth isomorphism under finite free hypotheses
Statement
Assume AC. Let be a commutative PID and spaces such that every is a finite free -module. For every the additive singular cohomology cross product gives an isomorphism All indices are nonnegative. The symmetric assertion holds when every is finite free instead. No bound on the number of nonzero homology degrees and no finite-rank hypothesis on the singular chain groups is required.
Facts & Assumptions
A free PID complex decomposes into two-term cycle-boundary pieces supplies free cycles/boundaries and sections under The Axiom of Choice. Free modules are projective, with the exact choice boundary supplies sections of surjections onto free homology modules.
Additive singular cohomology cross product and The additive singular cohomology cross product is well-defined specify the natural product by tensor evaluation followed by a shuffle inverse, with positive coboundary.
Singular product chain equivalence by simplex models gives that shuffle equivalence and its homotopies over .
Singular cochain complex with coefficients identifies singular cochains with -linear Hom on free coefficient chains and gives the positive differential.
Proof
Given: Write , and . For the first assertion all are finite free. Let denote this graded module with zero differential. Assume AC.
Choose the sections from [F1] and put . Since is free, choose a section of the homology quotient , using [F1]. AC permits these choices in every degree. Set and , where the last corestriction is valid because . We have , and : a boundary is fixed by and killed by . Thus and are chain maps.
Fix and choose a finite basis of with coordinate duals . For every -module , the map sends to . An explicit inverse sends to , where . Substitution using proves one composite is identity. For the other, write and use tensor bilinearity. Thus this is an isomorphism for arbitrary , including infinitely generated . It is its formula, not the chosen basis, that specifies the map. Finite rank is used in this finite inverse sum.
Define . Then , while because lands in boundaries. Hence and . Also by step 1.1. This is an explicit chain deformation retraction of onto , not merely an isomorphism of its homology groups. The same calculation works at with negative terms zero.
In degree , is the finite direct sum of for . Since , the differential preserves and is the positive coboundary. Step 1.2 identifies each fixed- complex with copies of the cochain complex shifted in degree by . Kernels and images of maps on finitely many coordinates are taken coordinatewise, so its cohomology is . Taking the finite degree diagonal gives an isomorphism from to , represented by the evaluation functionals. The absence of a degree- coordinate at agrees with the zero incoming coboundaries in .
Tensor with : on a homogeneous tensor define . In , the two terms involving cancel, while the other two give . Thus and are chain homotopy inverses between and . Precomposition with these maps gives cochain homotopy inverses on Hom into : if , the operator in degree minus one obeys . In particular no tensor exactness or Hom exactness is needed to preserve this specified homotopy equivalence. Combining with [F3], is a chain homotopy equivalence, so is a cohomology isomorphism.
On , gives by step 2.1, while . These identities identify with : a functional corresponds to the cohomology class , with inverse induced by . Since has zero differential, its Hom cohomology is exactly its Hom graded module.
Combine step 2.2 with of step 3.1 and replace by using step 3.2. A representative is carried to the class of the functional . By [F2] this is precisely . Consequently the resulting isomorphism is the cross product in the statement, independent of every auxiliary basis and section used to prove it is bijective.
For the symmetric case, carry out steps 1.1 and 2.1 on instead, obtaining a deformation retraction onto . Tensoring its homotopy with has , with mixed terms cancelling. Thus reduce to . On the fixed- summand its differential is times the coboundary. Multiplication by this unit changes neither kernels nor images. A finite basis of gives the analogue of step 1.2 with the finite free factor first, hence cohomology . Its evaluation functional is , exactly the same ordered cross product by [F2]. This proves the symmetric assertion without assuming a symmetry theorem for that product.
Empty or gives zero complexes. A zero-rank contributes an empty basis and a zero summand in steps 1.2 and 2.2; rank one gives the evident identification with a single copy of . At , the only diagonal is and all constructions retain the usual product of values at vertices. Although there may be infinitely many nonzero , each total degree uses only finitely many, so no exchange of an infinite product with tensor is asserted. AC is used for the arbitrary-rank PID cycle/boundary sections and for simultaneous homology sections and finite bases across degrees; all dual and tensor calculations are explicit after those choices.
Depends on
- Additive singular cohomology cross product
- A free PID complex decomposes into two-term cycle-boundary pieces
- The Axiom of Choice
- The additive singular cohomology cross product is well-defined
- Singular product chain equivalence by simplex models
- Free modules are projective, with the exact choice boundary
- Singular cochain complex with coefficients
Used by
Dependency tree · two levels
21 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
- Hatcher, Theorem 3.15, printed pages 215–218; different CW hypothesis, local proof establishes the stated finite-free homology version (standard reference, not scraped)