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.
Cup product Leibniz identity
Statement
For cochains and , , over a commutative unital ring with positive coboundary, Thus the product of cocycles is a cocycle, and changing either cocycle representative by a coboundary changes their product by a coboundary.
Facts & Assumptions
Singular cup product on cochains defines , with a chain map.
The additive singular cohomology cross product is well-defined proves on the signed tensor complex.
Proof
Given: as stated. Negative cochain degrees are zero, and .
Since , precomposing the tensor-functional identity with gives By the cup formula this is exactly the asserted identity. If both inputs are closed its right side is zero.
Now assume . Let and . Bilinearity expands the change to . Step 1.1, applied to each pair, identifies this as Indeed the respective other Leibniz terms contain , , or , and vanish. This proves simultaneous descent and, by setting or , each separate descent.
If , then and its two terms in the primitive are absent; if , then and its terms are absent. For both representatives are unchanged, while the Leibniz identity itself still holds, with sign . At zero input or zero coefficient ring the equality is zero by bilinearity. An empty space has zero cochains, and a point or a degenerate simplex satisfies the same chain-map and tensor identities. No representative, basis, or primitive was chosen from an arbitrary family: the primitive is the displayed expression in the given . Thus no AC is used.
Depends on
Used by
Dependency tree · two levels
8 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 Lemma 3.6; Miller Lecture 28 (standard reference, not scraped)