Unit Circle Cyclic Angle Basic Order
ProvedUnitCircleCyclicAngleBasicOrdercrossing-consequencestrellis-port
Let , let be a finite set, and suppose . Assume that each has been assigned an angle such that
and that the map is injective. Then the elements of admit a cyclic successor map and lifted endpoint angles with the following properties: is bijective, , unordered consecutive endpoint pairs determine , is either or ,
and
for every . Moreover the open angular gap from to contains no point of : for all and ,
and distinct open gaps are disjoint: if and , then
Formalization Note This node is ported from the Trellis formalization of the crossing lemma and its consequences (wpegden/crossing-consequences, commit 8769d142, W. Pegden, Apache-2.0); the statement is the Trellis node UnitCircleCyclicAngleBasicOrder.
Preamble
import Mathlib.Analysis.InnerProductSpace.PiL2 import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Combinatorics.SimpleGraph.Finite import Mathlib.Data.Finset.Prod import Mathlib.Data.Set.Finite.Basic import Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Basic import Mathlib.Algebra.Group.Fin.Basic import Mathlib.Data.Finset.Sort open Classical open scoped Fin.NatCast noncomputable section
Formal statement
lemma UnitCircleCyclicAngleBasicOrder
(p : EuclideanSpace ℝ (Fin 2))
(S : Finset (EuclideanSpace ℝ (Fin 2)))
(θ : {x : EuclideanSpace ℝ (Fin 2) // x ∈ S} → ℝ)
(hθ_mem : ∀ x, 0 ≤ θ x ∧ θ x < 2 * Real.pi)
(hθ_point : ∀ x,
x.1 =
p + WithLp.toLp 2
(fun i : Fin 2 =>
if i = 0 then Real.cos (θ x) else Real.sin (θ x)))
(hθ_inj : Function.Injective θ)
(hcard : 3 ≤ S.card) :
∃ (succ :
{x : EuclideanSpace ℝ (Fin 2) // x ∈ S} →
{x : EuclideanSpace ℝ (Fin 2) // x ∈ S})
(startAngle endAngle :
{x : EuclideanSpace ℝ (Fin 2) // x ∈ S} → ℝ),
Function.Bijective succ ∧
(∀ x, x.1 ≠ (succ x).1) ∧
(∀ x y,
(Sym2.mk x.1 (succ x).1 :
Sym2 (EuclideanSpace ℝ (Fin 2))) =
Sym2.mk y.1 (succ y).1 →
x = y) ∧
(∀ x, 0 ≤ startAngle x ∧ startAngle x < 2 * Real.pi) ∧
(∀ x,
x.1 =
p + WithLp.toLp 2
(fun i : Fin 2 =>
if i = 0 then Real.cos (startAngle x) else
Real.sin (startAngle x))) ∧
(∀ x,
(succ x).1 =
p + WithLp.toLp 2
(fun i : Fin 2 =>
if i = 0 then Real.cos (endAngle x) else
Real.sin (endAngle x))) ∧
(∀ x, endAngle x = startAngle (succ x) ∨
endAngle x = startAngle (succ x) + 2 * Real.pi) ∧
(∀ x, startAngle x < endAngle x) ∧
(∀ x, endAngle x < startAngle x + 2 * Real.pi) ∧
(∀ (x y : {x : EuclideanSpace ℝ (Fin 2) // x ∈ S}) (t : ℝ),
0 < t → t < 1 →
y.1 ≠
p + WithLp.toLp 2
(fun i : Fin 2 =>
if i = 0 then
Real.cos ((1 - t) * startAngle x + t * endAngle x)
else
Real.sin ((1 - t) * startAngle x + t * endAngle x))) ∧
(∀ (x y : {x : EuclideanSpace ℝ (Fin 2) // x ∈ S}) (s t : ℝ),
x ≠ y → 0 < s → s < 1 → 0 < t → t < 1 →
p + WithLp.toLp 2
(fun i : Fin 2 =>
if i = 0 then
Real.cos ((1 - s) * startAngle x + s * endAngle x)
else
Real.sin ((1 - s) * startAngle x + s * endAngle x)) ≠
p + WithLp.toLp 2
(fun i : Fin 2 =>
if i = 0 then
Real.cos ((1 - t) * startAngle y + t * endAngle y)
else
Real.sin ((1 - t) * startAngle y + t * endAngle y))) := by sorrySource