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.
Relative cup products are natural and connector-compatible
Statement
Relative cup products are natural for maps of excisive triples: if takes into and into , then Use the excisive comparisons in the relative-product definition for both triples. In particular these exist when each pair of subspaces is open in its union.
Here are explicit domains for connector compatibility. Write , , and let be the pair connector. Let be the connector obtained by extending to a cochain on vanishing on , taking its coboundary, and using the small-chain quotient comparison. Then and For these are the ordinary pair identities. All coboundaries have the positive sign convention; is commutative unital. No AC is needed.
Facts & Assumptions
Relative cup product for an excisive triad constructs the target through the canonical quotient , whose dual induces an isomorphism.
Long exact sequence of a pair in singular cohomology defines by any extension and proves independence by changing lifts and cocycle representatives.
Cup product Leibniz identity supplies the positive-coboundary Leibniz rule.
Cup product is natural, unital and associative proves the termwise cochain pullback identity.
Proof
Given: The triples and coefficient ring as stated. Put and .
Pullback of a cochain vanishing on vanishes on , and similarly for . It also maps to the primed quotient-functional complex. By [F4] it commutes with the cup formula on cochains. The quotient maps in [F1] commute with , since all maps are induced by the same map of chains on . Their induced cohomology maps commute as well, and their inverses commute because they are isomorphisms. Transporting the cochain equality through these inverses proves relative naturality.
Restriction gives a termwise exact sequence . To prove surjectivity, extend a cochain from simplices in by zero off . It already vanishes on simplices in , so the extension vanishes on . Its kernel consists exactly of cochains vanishing on both and , namely . Restriction commutes with coboundary; the extension need not. For a relative cocycle , a lift has . Changing lifts changes this by a Q-coboundary; changing by and lifting leaves the connecting class unchanged. These are exactly the lift calculations of [F2]. Composing this well-defined connecting class with [F1]'s inverse defines the displayed .
For the first identity represent by a cocycle on and by a cocycle on vanishing on . Extend to on . The cochain vanishes on and restricts to , so it is an admissible lift for step 1.2. Its coboundary is because . By [F2], represents and vanishes on . Hence the very same Q-cocycle computes both sides after applying [F1]'s comparison.
For the second identity represent by a cocycle on vanishing on , and by a cocycle on . Extend to on . Now is a lift vanishing on , and its coboundary is , because . The last factor represents and vanishes on . Transporting this Q-cocycle gives precisely the asserted sign and factor order.
If , the restriction sequence in step 1.2 is the pair sequence and [F1]'s comparison is the identity. If , its right-hand complex is zero and both formulas have zero sides. If , every and the displayed relative target are zero. For the second sign is positive, and degree-zero cocycles/lifts require no negative cochain. Zero ring, empty space and zero inputs give zero identities. On point spaces these are the empty/full cases; degenerate simplices are included in each extension rule. All extensions can be the stated zero extensions, so no AC or family of arbitrary lift choices is used.
Depends on
Used by
Dependency tree · two levels
18 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 relative cup products; Miller Lecture 34 (standard reference, not scraped)