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 an orientation-preserving or reversing diffeomorphism
Statement
Let be a diffeomorphism between nonempty connected oriented boundaryless manifolds. If preserves orientation, then ; if it reverses orientation, then .
Facts & Assumptions
Degree of a proper smooth map by compact-support cohomology characterizes the degree of a proper smooth map by its integral identity.
Change of variables on oriented manifolds gives the integral pullback formula with sign or according to orientation behavior.
Proof
Given: The oriented diffeomorphism in the statement.
The inverse is continuous, so for each compact , the set is the continuous image of under that inverse and is compact. Thus is proper and [F1] defines its degree.
If preserves orientation, [F2] gives for every compactly supported top form ; if it reverses orientation, it gives . Uniqueness in [F1] yields respectively and . For dimension zero this compares the two supplied point-orientation signs; connectedness makes the sign constant. Empty manifolds are excluded, the zero form is harmless because an integral-one class supplies uniqueness, and no representatives or families are chosen.
Depends on
Used by
- Degree of a reflection of a sphere Example
- Degree of the antipodal map on the sphere Proposition
Dependency tree · two levels
7 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
- Robbin–Salamon, Introduction to Differential Topology (standard reference, not scraped)