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.
Degree is homotopy invariant and multiplicative under composition
Statement
For and continuous sphere self-maps , homotopic maps have the same degree and . Every homotopy equivalence has degree or .
Facts & Assumptions
Given: The objects and hypotheses in the statement above.
Let . Choose a generator of , using cor-homology-of-spheres. For a continuous self-map , its degree is the unique integer satisfying The induced map is furnished by prop-relative-homology-is-functorial-for-maps-of-pairs with empty subspaces. Replacing the same generator in source and target by its negative does not change the integer. For a map between separately oriented copies of , use their separately specified generators; reversing just one orientation changes the sign. The unreduced definition here is restricted to . (Degree of a self map of an oriented sphere)
If are homotopic continuous maps, then for every and every abelian group the induced homomorphisms on singular homology agree: (Homotopic maps induce the same map on singular homology)
Proof
Homotopic maps induce the same homomorphism on integral , so their multiples of the orientation generator agree. This proves homotopy invariance, including constant maps.
Functoriality gives , so the integers multiply. The identity has degree .
If is a homotopy inverse of , then . The only units of are , proving the last assertion without a converse.
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, Degree properties (c),(d), p.134 (standard reference, not scraped)