Unit Circle Cyclic Angle Data
DefinitionUnitCircleCyclicAngleDataFor a point and a finite set , is the following cyclic angular data on the points of . It consists of a successor map , a starting angle and a lifted terminal angle for every , such that:
and the unordered endpoint pair determines the starting point,
Every starting angle lies in the fundamental interval,
and the start and terminal endpoint are represented by the corresponding unit-circle coordinates about :
The terminal lift is compatible with the successor's fundamental angle,
and the lifted gap is positive and shorter than a full turn,
Finally, the open lifted gaps encode cyclic consecutiveness: for every and ,
and for distinct and , the two open-gap points
are distinct.
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 UnitCircleCyclicAngleData.
import Definitions.Def_UnitCircle
open Classical
noncomputable section
-- [TABLET NODE: UnitCircleCyclicAngleData]
structure UnitCircleCyclicAngleData
(p : EuclideanSpace ℝ (Fin 2))
(S : Finset (EuclideanSpace ℝ (Fin 2))) where
-- BODY
succ :
{x : EuclideanSpace ℝ (Fin 2) // x ∈ S} →
{x : EuclideanSpace ℝ (Fin 2) // x ∈ S}
startAngle : {x : EuclideanSpace ℝ (Fin 2) // x ∈ S} → ℝ
endAngle : {x : EuclideanSpace ℝ (Fin 2) // x ∈ S} → ℝ
succ_bijective : Function.Bijective succ
succ_ne :
∀ x : {x : EuclideanSpace ℝ (Fin 2) // x ∈ S}, x.1 ≠ (succ x).1
endpoint_unique :
∀ x y : {x : EuclideanSpace ℝ (Fin 2) // x ∈ S},
(Sym2.mk x.1 (succ x).1 :
Sym2 (EuclideanSpace ℝ (Fin 2))) =
Sym2.mk y.1 (succ y).1 →
x = y
start_mem_fundamental :
∀ x : {x : EuclideanSpace ℝ (Fin 2) // x ∈ S},
0 ≤ startAngle x ∧ startAngle x < 2 * Real.pi
start_point :
∀ x : {x : EuclideanSpace ℝ (Fin 2) // x ∈ S},
x.1 =
p + WithLp.toLp 2
(fun i : Fin 2 =>
if i = 0 then Real.cos (startAngle x) else Real.sin (startAngle x))
end_point :
∀ x : {x : EuclideanSpace ℝ (Fin 2) // x ∈ S},
(succ x).1 =
p + WithLp.toLp 2
(fun i : Fin 2 =>
if i = 0 then Real.cos (endAngle x) else Real.sin (endAngle x))
end_lift :
∀ x : {x : EuclideanSpace ℝ (Fin 2) // x ∈ S},
endAngle x = startAngle (succ x) ∨
endAngle x = startAngle (succ x) + 2 * Real.pi
gap_pos :
∀ x : {x : EuclideanSpace ℝ (Fin 2) // x ∈ S},
startAngle x < endAngle x
gap_short :
∀ x : {x : EuclideanSpace ℝ (Fin 2) // x ∈ S},
endAngle x < startAngle x + 2 * Real.pi
no_S_in_open_gap :
∀ (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))
open_gaps_disjoint :
∀ (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))