Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 v0,…,vm−1∈Q+iQ, m≥3, be the cyclically ordered vertices of a simple strictly convex polygon whose edges are traversed counterclockwise. Let P be its filled convex hull and let Γ be the concatenation of its oriented edges. For every z∉Γ, the winding number n(Γ,z) is 1 if z∈int⁡P and 0 if z∉P.

Facts & Assumptions

Given: A simple strictly convex polygon with rational vertices, its positive boundary orientation, its filled convex hull P, and the winding number of the resulting closed contour.

[F1]

For a closed contour and a point off its trace, n(Γ,z)=(2πi)−1∫Γ(w−z)−1 dw (The winding number of a closed contour about a point off its trace).

[F2]

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).

[F3]

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).

[F4]

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

1.1givenconstructalgebra

Fix exterior points q1,q2∉P and choose R>max⁡{max⁡u∈P∥u∥2,∥q1∥2,∥q2∥2}, which exists because P is compact. For each j∈{1,2}, compactness gives a nearest point pj∈P. For every u∈P, convexity puts pj+t(u−pj) in P for 0≤t≤1; minimality of pj gives ∥qj−pj∥22≤∥qj−pj−t(u−pj)∥22. Expanding, dividing by t>0, and letting t↓0 yields ⟨qj−pj,u−pj⟩≤0. Hence the ray qj+s(qj−pj), s≥0, avoids P and, being unbounded, meets the circle CR={w:∣w∣=R}. The circle CR is disjoint from P and connected, so these two rays and an arc of CR join q1 to q2 in C∖P. Thus C∖P is path-connected and unbounded.

2.1F1F3step 1.1

By [F1], n(Γ,q) is the winding index of the contour. Since Γ⊂P, the exterior C∖P lies in the unbounded component of C∖Γ; [F3] gives n(Γ,q)=0 for every q∉P.

3.1F1F4step 2.1choosealgebra

Fix z∈int⁡P. Choose a ray from z whose direction is not aimed at a vertex. Its intersection with the convex polygon is a bounded interval starting at z, so the ray exits at the interior p of a single edge with directed tangent v≠0. The polygon interior lies locally to the left of this positively oriented edge. Apply the orientation-preserving similarity ρ(w)=v‾(w−p)/∣v∣, which sends p to 0 and the edge tangent to the positive real direction. For every a∉Γ, put c=v‾/∣v∣. Parametrizing the transformed contour and using [F1] gives ∫ρ∘Γdζζ−ρ(a)=∫Γc dwc(w−a)=∫Γdww−a, so n(ρ∘Γ,ρ(a))=n(Γ,a). For sufficiently small ε>0, the points ρ−1(iε) and ρ−1(−iε) lie respectively on the interior and exterior local sides of the edge. Applying [F4] to ρ∘Γ gives n(ρ∘Γ,iε)−n(ρ∘Γ,−iε)=1; the just-proved invariance rewrites this as n(Γ,ρ−1(iε))−n(Γ,ρ−1(−iε))=1. The exterior-side index is zero by step 2.1. Thus an interior point near that edge has winding number one.

4.1F2step 2.1step 3.1∎

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