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 additive singular cohomology cross product is well-defined
Statement
Over a commutative unital ring , the additive singular cohomology cross product is well-defined on both cocycle classes, independent of the chain homotopy inverse to shuffle, -bilinear and natural in both spaces. With positive coboundary, its tensor functional satisfies No AC is required.
Facts & Assumptions
Additive singular cohomology cross product specifies and the quotient product via a shuffle inverse .
Singular product chain equivalence by simplex models gives natural maps and homotopies , , with tensor differential .
Singular cochain complex with coefficients uses ; Singular cohomology with coefficients identifies representatives modulo coboundaries.
Proof
Given: , homogeneous cochains of degrees , and the maps in [F1]–[F3]. Put and .
On a tensor of bidegree , has only the term . On bidegree , only remains, equal to . On every other bidegree of total degree , all terms vanish by the support definition of . Homogeneous tensors generate the total complex, proving the asserted identity. In particular is closed when both inputs are closed; its composite with is closed because is a chain map.
If changes to with while is closed, step 1.1 gives . After composing with the change is . If changes by while is closed, step 1.1 gives , yielding the coboundary . A changed cocycle is still closed because , so applying the two calculations successively handles simultaneous changes. When an input degree is zero, its negative-degree cochain is zero and the corresponding change is absent. This proves descent through both cohomology quotients.
Let be another chain homotopy inverse of . Choose the supplied homotopies and (negating a homotopy if needed). Then has , using the chain-map identities. For a closed functional , since . Thus both inverse choices give the same class. In total degree zero, the potential primitive has negative degree and is zero; the same identity gives equality directly.
On cochains, is additive and -linear in each variable by its evaluation formula and commutativity of . Precomposition with is linear, so step 2.1 descends this bilinearity to cohomology and hence to the tensor product of cohomology modules. For maps and , naturality of the specified gives . Evaluation on homogeneous tensors gives . Combining these equalities and passing to classes proves . Independence in step 2.2 makes this naturality independent of the particular inverse used to express the classes.
If either factor space is empty or either cochain class is zero, the product is zero by step 2.1 and bilinearity; the zero ring likewise gives zero modules. At , is the inverse vertex-pair identification, so the product value is and the two unit values on points multiply to . Steps 1.1 and 2.1 separately cover or , with no missing negative cochains. All chosen homotopies in step 2.2 are supplied as part of the inverse data, and the canonical inverse in [F2] is explicit, so no family of arbitrary choices or AC is used.
Depends on
Used by
- Singular cup product on cochains Definition
- Cohomological Kunneth cross product is a ring isomorphism Theorem
- Cohomological Kunneth isomorphism under finite free hypotheses Theorem
- Cup product Leibniz identity Theorem
Cited to discharge well-definedness by Additive singular cohomology cross product.
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, Construction 28.1, printed page 76; positive differential convention verified locally (standard reference, not scraped)