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.
Cochain cup product is not strictly graded commutative
Statement refuted
The singular cochain cup product satisfies for every pair of cochains of degrees .
Facts & Assumptions
Singular cup product on cochains defines the product by evaluating on the front and back faces and multiplying coefficient values.
Singular cohomology is graded commutative proves the signed identity for cohomology classes represented by cocycles.
Counterexample
Given: with vertices , integral coefficients, and the identity singular two-simplex . Write for its affine edge from to .
Define the integral one-cochain to have value on the singular simplex and value on every other singular one-simplex; define similarly with support . Each extends uniquely to a homomorphism on the free group of finite singular one-chains. The two edges are distinct maps (their initial vertices differ), so No choice of a basis is involved: singular simplex maps are the specified generators.
Formula [F1] gives Since , graded commutativity would require the first value to be the negative of the second. But in . Thus these are unequal cochains, even with the required sign.
Here , so and . Neither cochain is a cocycle, and [F2] does not assert the refuted identity for them. This calculation uses two nondegenerate one-faces of a single nondegenerate two-simplex. Mixed degree-zero and positive-degree cochains can also witness failure when the zero-cochain takes different values at the two endpoints of an edge; the present example instead keeps both cochains in degree one. Empty spaces and the zero coefficient ring cannot furnish this witness. All faces include their endpoints, and all other simplex values, including degenerate ones, were explicitly set to zero. No AC is used.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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 proof of Theorem 3.11 and cup formula (standard reference, not scraped)