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 of the circle power map
Example
For every , the continuous map , , has degree when both circles have their counterclockwise orientations. This includes and negative exponents.
Facts & Assumptions
Given: The objects and hypotheses in the statement above.
Let be continuous, , with source and target orientations fixed. If is finite, then The sum over an empty fibre is . (Global sphere degree is the sum of local degrees)
On for , the identity, a constant map, any single coordinate reflection, and the antipodal map have degrees , , , and respectively. (Degree of identity constant reflection and antipodal sphere maps)
Verification
If , the fibre of consists of the roots , . In positively oriented angular coordinates centered at such a point and at , the local map is . The homotopy , , never sends a nonzero sufficiently small to zero, so it preserves the local pair and identifies the local action with that of the identity. Each local degree is therefore , and the finite-fibre formula gives .
If , the same -point fibre has angular formula . Homotoping its positive factor to leaves the reflection . Complex conjugation is a coordinate reflection on , of degree ; its singleton fibre and the local-sum formula give local sign . Thus . For , is constant and has degree zero. In particular is the identity.
Depends on
Used by
Nothing in the library uses this result yet.
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, Example 2.32, p.137 (standard reference, not scraped)