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.
Higher homotopy groups are functorial and based homotopy invariant
Statement
A based map induces on all pointed component and cubical homotopy sets. For this is a homomorphism, identities and composition are preserved, and based homotopic maps induce equal maps. Based homotopy equivalences induce isomorphisms.
Facts & Assumptions
Cubical concatenation gives the group law. Higher homotopy classes form groups and are abelian above degree one
Continuous precomposition and postcomposition preserve relative homotopies. Precomposition and postcomposition by continuous maps preserve homotopies, including their relative form
Proof
Given: The spaces, maps, and hypotheses in the statement above.
Postcomposition with f sends boundary-fixed homotopies to boundary-fixed homotopies, now with value , by F2. Hence is well-defined. Pointwise on both half-cubes, , so F1 makes it a homomorphism. A path is similarly sent to a path, giving a well-defined map on components.
For based maps f,g one has and , proving functoriality. If is a based homotopy, is continuous by F2 and equals on the cube boundary for every t. Thus its two endpoints define the same class, giving . The same formula on points gives equality on components.
If based maps f and h are inverse up to based homotopy, step 2.1 gives and . Thus these are inverse homomorphisms for positive degrees and inverse pointed bijections in degree zero.
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, Algebraic Topology, Chapter 4 (standard reference, not scraped)