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.
Rotation index of a regular closed plane curve
Definition
Let be a closed, piecewise- regular curve with a finite subdivision . On every smooth piece up to its one-sided endpoints, and with matching unit tangents ; the identified endpoint is taken in a smooth piece. Write on smooth pieces. At each interior vertex , require the one-sided unit tangents and not to be antipodal. Define its signed corner jump to be the unique number in for which the positive rotation sends to . Self-intersections are allowed.
An angle lift of this tangent data is a real-valued continuous angle along each smooth piece such that , with the right-hand value at each vertex set to . The rotation index is
The definition is independent of the initial angle; the proof below establishes that the lift exists and that the displayed value is an integer.
Facts & Assumptions
Given: A closed piecewise- regular curve, with matching endpoint tangents and no antipodal corner jump.
Every open cover of a compact metric space has a positive Lebesgue number: all sufficiently small nonempty subsets lie in one cover member (Every open cover of a compact metric space has a Lebesgue number: a such that every nonempty subset of diameter less than lies inside a single member of the cover).
Proof
Fix one smooth piece and its continuous unit tangent . For each , the set is relatively open and contains , so these sets cover . By [F1] the cover has a Lebesgue number ; choose a finite uniform partition of mesh less than . Each subinterval lies in some , and the finitely many such centers can be chosen by finite induction, without an axiom of choice.
On each subinterval contained in , the unique relative angle from to is continuous. After choosing any initial angle for , define recursively on a subinterval with center by . Then there, and the endpoint values agree across the finite partition, giving a continuous lift on the whole smooth piece.
Apply step 2.1 successively to the finitely many smooth pieces, carrying the last angle to the next piece by adding the prescribed at each vertex. Since , the resulting total increment satisfies , hence for an integer . Thus , including the case , and the single-piece case with no corners.
Any two initial angles for differ by for some integer ; the unique local relative angles in step 2.1 and the fixed corner jumps add that same constant on every later piece. Their endpoint difference is therefore unchanged. Changing the smooth starting point only splits one arc increment into two additive increments, and an orientation-preserving reparametrization preserves the oriented unit-tangent path; the cyclic total increment is unchanged. Reversing the curve reverses the increment and negates the index.
Source locator
Lee, Riemannian Manifolds: An Introduction to Curvature, Chapter 9, §“Some Plane Geometry,” printed pp. 156–161, defines the tangent angle of a regular curve, treats corner jumps in with cusps excluded, and proves the rotation-angle theorem. Datar, Lectures on Riemannian Geometry, Lecture 1, §§1.1–1.3, printed pp. 3–8, gives the corresponding regular-curve, no-cusp, tangent-angle and piecewise-corner conventions. Those sources use covering-space lifting in the tangent-angle argument; the finite local semicircle construction above proves the needed lift directly from the Lebesgue-number lemma.
Depends on
Used by
Dependency tree · two levels
16 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
- John M. Lee, Riemannian Manifolds: An Introduction to Curvature, Chapter 9 (standard reference, not scraped)
- Ved Datar, Lectures on Riemannian Geometry, Lectures 1–2 (standard reference, not scraped)