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.
Global sphere degree is the sum of local degrees
Statement
Let be continuous, , with source and target orientations fixed. If is finite, then The sum over an empty fibre is .
Facts & Assumptions
Given: The objects and hypotheses in the statement above.
For , , with generator the restriction of the global sphere orientation. The local degree in def-local-degree-at-an-isolated-preimage is independent of shrinking its neighborhood. For every finite nonempty , and the global orientation maps to the tuple of local orientation generators. (Local sphere orientations and finite puncture excision)
A continuous map between oriented -spheres, , whose degree is nonzero must be surjective. (A map of nonzero degree between spheres is surjective)
Proof
If the fibre is empty, omits a point, so its degree is zero by F2. This equals the empty sum.
For a nonempty finite fibre , use the global-to-relative maps for and . Functoriality makes the square with commute. By F1, the source global generator maps to and the target global generator maps to .
On the summand indexed by , the lower map in this square is multiplication by , by the local definition and excision. Its value on the diagonal is the sum of these integers. The other route through the square gives , proving the formula, also for a singleton fibre.
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, Proposition 2.30, p.136 (standard reference, not scraped)