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 positively oriented convex polygon has winding index one inside and zero outside
Statement
Let , , be the cyclically ordered vertices of a simple strictly convex polygon whose edges are traversed counterclockwise. Let be its filled convex hull and let be the concatenation of its oriented edges. For every , the winding number is if and if .
Facts & Assumptions
Given: A simple strictly convex polygon with rational vertices, its positive boundary orientation, its filled convex hull , and the winding number of the resulting closed contour.
For a closed contour and a point off its trace, (The winding number of a closed contour about a point off its trace).
The winding number is constant on each connected component of the complement of the trace (The winding number is constant on each connected component of the complement of the trace).
The winding number is zero on the unbounded connected component of the complement (The winding number vanishes on the unbounded component of the complement of the trace).
At a single regular arc traversed with positive real tangent, the index on the left side minus the index on the right side is one (The winding number jumps by one across a regular planar arc).
Proof
Fix exterior points and choose , which exists because is compact. For each , compactness gives a nearest point . For every , convexity puts in for ; minimality of gives . Expanding, dividing by , and letting yields . Hence the ray , , avoids and, being unbounded, meets the circle . The circle is disjoint from and connected, so these two rays and an arc of join to in . Thus is path-connected and unbounded.
By [F1], is the winding index of the contour. Since , the exterior lies in the unbounded component of ; [F3] gives for every .
Fix . Choose a ray from whose direction is not aimed at a vertex. Its intersection with the convex polygon is a bounded interval starting at , so the ray exits at the interior of a single edge with directed tangent . The polygon interior lies locally to the left of this positively oriented edge. Apply the orientation-preserving similarity , which sends to and the edge tangent to the positive real direction. For every , put . Parametrizing the transformed contour and using [F1] gives , so . For sufficiently small , the points and lie respectively on the interior and exterior local sides of the edge. Applying [F4] to gives ; the just-proved invariance rewrites this as . The exterior-side index is zero by step 2.1. Thus an interior point near that edge has winding number one.
The interior of a convex polygon is connected. Its points avoid , so [F2] makes the winding number constant throughout the interior. Step 3.1 identifies this constant as one. Together with step 2.1 this proves both cases.
Depends on
Used by
Dependency tree · two levels
36 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
- J. Lebl, Guide to Cultivating Complex Analysis (standard reference, not scraped)