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.
Singular product chain equivalence by simplex models
Statement
For all spaces , the singular shuffle map is a natural chain homotopy equivalence. The tensor complex has differential and direct-sum totalization. A natural inverse and natural homotopies can be specified without AC. Extension of scalars gives the same assertion over every commutative unital ring.
Facts & Assumptions
The singular chain cross product on generators gives the shuffle map, equal to the vertex-pair identification in degree zero. The singular chain cross product satisfies the boundary formula proves its tensor differential identity, and Singular chain cross products are natural proves naturality.
The singular chain homotopy formula supplies the explicit prism homotopy for any specified homotopy of spaces, including its degree-zero identity.
Singular chains are free on singular simplices and coefficients are obtained by scalar extension, as recalled in Singular cochain complex with coefficients.
Proof
Given: Put and , initially over . All complexes have zero negative degrees and ordinary, unnormalized singular chains.
Let be a standard simplex or a product of two standard simplices, with first vertex . The specified affine homotopy is continuous and takes values in by convexity. Let and be induced by collapse and inclusion of . By [F2], its prism satisfies . The point complex has a generator in every degree; for positive even and zero for odd . Define for odd , and zero for even . If and are identity in degree zero, direct substitution in even, odd and zero degrees gives . Therefore satisfies . Put ; this is the degree-zero augmentation projection onto the vertex. This contraction treats the nonzero higher chains of a point explicitly.
In degree , the basis of consists of maps . Each is the unique pushforward under the pair map of the diagonal simplex in . The basis of consists of pairs of simplices of degrees with . Each is the unique pushforward under its pair map of . Accordingly any specified value on each of these universal generators defines a linear natural transformation, by pushing the value forward and extending linearly. Composition of pair maps proves naturality; even coincident image simplices cause no ambiguity because the maps define the basis elements themselves.
For a model pair , use step 1.1 to obtain contractions of its two factors, with projections . On their tensor complex set . The second term is zero unless . In , the mixed terms from the first summand cancel because their signs are and . The mixed terms of the second cancel because is a chain map, leaving . Thus on every model has a specified contraction onto its vertex in degree zero. Step 1.1 gives such a contraction for on every model as well. In either target, every positive-degree cycle has ; a degree-zero cycle has the same property if its augmentation is zero.
Define by sending the vertex to , inverse to . Suppose is a natural chain map below degree . In the model put . For , . For , has augmentation zero since the two endpoint vertices have opposite coefficients and preserves their augmentations. Apply the specified contraction of the target to define , so . Define on every simplex by pushing forward as in step 1.2. Naturality of lower , the boundary, and pushforward gives on every generator. Induction constructs a natural chain map in every degree. No choice of a filling is made: the contraction gives its formula.
Here is the homotopy construction needed for the composites. Let be natural chain maps, where is or with the universal generators of step 1.2, and is or with the model contractions of step 2.1. Suppose preserve the same augmentation in degree zero. Start with . Given below degree , for each universal generator of degree put . For , applying and using the chain-map identities and in degree gives . For , the augmentation of is zero by hypothesis. Define in the target model, and push forward to all generators. Then by the contraction, proving . Naturality follows from the prescribed pushforward rule; hence the induction gives a natural chain homotopy.
The map is a natural chain map by [F1], and is one by step 3.1. The composites and are the identity on degree-zero generators, so they and the appropriate identities have the same augmentation. Apply step 3.2 first with and then . This supplies natural homotopies and , proving the integral equivalence. In particular the construction has not inferred a chain equivalence merely from an isomorphism in homology.
Tensor all the integral maps and homotopies with . Chain-homotopy identities remain identities under any additive functor. The canonical map sends to ; its inverse sends to . Tensor relations make these well-defined inverses, commuting with the signed differential. Thus the extended equivalence is exactly the asserted coefficient version.
If either space is empty, both complexes are zero and all maps are unique. For two points, higher singular generators remain present, with the contraction calculated in step 1.1; degree zero is the identity on the single vertex pair. The zero ring gives zero complexes. Each tensor-degree diagonal has finitely many pairs , and all image chains are finite because each prism and each input chain is finite. The recursion uses uniquely specified model contractions in every degree and no arbitrary selection, hence no AC.
Depends on
Used by
- Additive singular cohomology cross product Definition
- The additive singular cohomology cross product is well-defined Lemma
- The homology Kunneth sequence splits nonnaturally Proposition
- Alexander--Whitney and shuffle are natural chain-homotopy inverses Theorem
- Cohomological Kunneth isomorphism under finite free hypotheses Theorem
- Topological Kunneth short exact sequence for homology Theorem
Dependency tree · two levels
12 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
- Miller, section 25, Lemma 25.10 through Theorem 25.13, printed pages 64–66 (standard reference, not scraped)