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.
A regular reparametrization of a connected parameter region has a constant orientation sign
Statement
Every regular reparametrization of a connected parameter region is either orientation-preserving everywhere or orientation-reversing everywhere.
Facts & Assumptions
Given: A regular reparametrization induced by a diffeomorphism between neighbourhoods of compact Jordan parameter regions whose interiors are nonempty and connected.
If a map has invertible derivative throughout a connected open set, then its Jacobian determinant is everywhere positive or everywhere negative (The Jacobian sign of a regular map is constant on a connected domain).
A reparametrization is orientation-preserving where and orientation-reversing where (Surface reparametrizations and their orientation sign).
Proof
Restrict to the nonempty connected interior of the source region. Its derivative is invertible there, so [L1] gives a constant positive or negative determinant sign.
Because the compact region is the closure of its interior and is continuous and nonzero on a neighbourhood of it, the same strict sign holds on its boundary.
In the positive case [assume-case pos], [F1] makes the reparametrization orientation-preserving everywhere; in the negative case [assume-case neg], [F1] makes it orientation-reversing everywhere. These cases exhaust [L1].
Depends on
Used by
Dependency tree · two levels
10 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
- University of Toronto MAT237 notes, Section 5.3, An Invariance Property (standard reference, not scraped)