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.
Additive singular cohomology cross product
Definition
Let be a commutative unital ring, spaces and . Use the positive coboundary convention of Singular cochain complex with coefficients. For homogeneous cochains and , define a functional on the tensor chain complex by Extend linearly. The formula is -balanced, since multiplying either input chain by multiplies its value by ; commutativity of is used here. Each total degree is a finite direct sum.
Let be the natural chain homotopy inverse of shuffle supplied by Singular product chain equivalence by simplex models. For cocycles define the additive singular cohomology cross product by using Singular cohomology with coefficients. The next lemma The additive singular cohomology cross product is well-defined ↗ proves that the cochain is closed, that both changes of representatives yield coboundaries, that another chain homotopy inverse gives the same class, and that the resulting -bilinear map is natural. These verifications precede every use of the quotient product.
This convention puts no extra in : its differential obeys with positive coboundaries. It is an additive cross product only; cup products and cohomology-ring assertions are not part of this definition. Negative-degree inputs, empty factors or the zero ring give zero products. In degree zero, the vertex formula gives . No AC is required.
Depends on
Used by
Dependency tree · two levels
11 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 coboundary convention translated locally (standard reference, not scraped)