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.
Singular cohomology is homotopy invariant
Statement
Homotopic continuous maps induce the same pullback on in every integer degree. Consequently a homotopy equivalence induces an isomorphism of real singular cohomology.
Facts & Assumptions
Given: A supplied continuous homotopy from to .
Postcomposition is a real-linear chain map and respects composition and identities (Singular chains are covariantly functorial).
Real cohomology is the quotient of cocycles by coboundaries (Real singular cohomology).
The supplied signed prism has , with the zero-degree formula (The singular chain homotopy formula).
Proof
Set . The chain equation [F1] gives , hence preserves cocycles and coboundaries and induces a real-linear map on the quotient [F2]. The generator identity and composition laws in [F1] become and .
Put for and for . For a degree- cochain and , [F3] gives . In degree zero the second summand is zero, exactly as in [F3]; negative degrees are zero.
If is a cocycle, step 1.2 says , so their classes coincide. If has a supplied homotopy inverse , apply this equality to and ; step 1.1 yields and . Thus is an isomorphism.
Empty spaces and negative groups have only zero maps, and on a point the identity acts identically on . Constant homotopies and degenerate simplices need no normalization: [F3] applies to their full signed prisms as well. Only the given homotopy and its explicit finite prism are used, so no AC is needed.
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
- DG-16 design; Hatcher/Park control (standard reference, not scraped)