Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unit Circle Cyclic Angle Data

Definition
UnitCircleCyclicAngleData

by moona3k · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

crossing-consequencestrellis-port

For a point p∈R2p\in\mathbb R^2p∈R2 and a finite set S⊂R2S\subset\mathbb R^2S⊂R2, UnitCircleCyclicAngleData⁡(p,S)\operatorname{UnitCircleCyclicAngleData}(p,S)UnitCircleCyclicAngleData(p,S) is the following cyclic angular data on the points of SSS. It consists of a successor map σ:S→S\sigma:S\to Sσ:S→S, a starting angle θx∈R\theta_x\in\mathbb Rθx​∈R and a lifted terminal angle Θx∈R\Theta_x\in\mathbb RΘx​∈R for every x∈Sx\in Sx∈S, such that:

σ is bijective,x≠σ(x)(x∈S),\sigma \text{ is bijective},\qquad x\ne\sigma(x)\quad (x\in S),σ is bijective,x=σ(x)(x∈S),

and the unordered endpoint pair determines the starting point,

{x,σ(x)}={y,σ(y)}⟹x=y.\{x,\sigma(x)\}=\{y,\sigma(y)\}\Longrightarrow x=y .{x,σ(x)}={y,σ(y)}⟹x=y.

Every starting angle lies in the fundamental interval,

0≤θx<2π,0\le \theta_x<2\pi,0≤θx​<2π,

and the start and terminal endpoint are represented by the corresponding unit-circle coordinates about ppp:

x=p+(cos⁡θx,sin⁡θx),σ(x)=p+(cos⁡Θx,sin⁡Θx).x=p+(\cos\theta_x,\sin\theta_x),\qquad \sigma(x)=p+(\cos\Theta_x,\sin\Theta_x).x=p+(cosθx​,sinθx​),σ(x)=p+(cosΘx​,sinΘx​).

The terminal lift is compatible with the successor's fundamental angle,

Θx=θσ(x)orΘx=θσ(x)+2π,\Theta_x=\theta_{\sigma(x)} \quad\text{or}\quad \Theta_x=\theta_{\sigma(x)}+2\pi,Θx​=θσ(x)​orΘx​=θσ(x)​+2π,

and the lifted gap is positive and shorter than a full turn,

θx<Θx<θx+2π.\theta_x<\Theta_x<\theta_x+2\pi .θx​<Θx​<θx​+2π.

Finally, the open lifted gaps encode cyclic consecutiveness: for every x,y∈Sx,y\in Sx,y∈S and 0<t<10<t<10<t<1,

y≠p+(cos⁡((1−t)θx+tΘx),sin⁡((1−t)θx+tΘx)),y\ne p+\bigl(\cos((1-t)\theta_x+t\Theta_x), \sin((1-t)\theta_x+t\Theta_x)\bigr),y=p+(cos((1−t)θx​+tΘx​),sin((1−t)θx​+tΘx​)),

and for distinct x,y∈Sx,y\in Sx,y∈S and 0<s,t<10<s,t<10<s,t<1, the two open-gap points

p+(cos⁡((1−s)θx+sΘx),sin⁡((1−s)θx+sΘx))andp+(cos⁡((1−t)θy+tΘy),sin⁡((1−t)θy+tΘy))p+\bigl(\cos((1-s)\theta_x+s\Theta_x), \sin((1-s)\theta_x+s\Theta_x)\bigr) \quad\text{and}\quad p+\bigl(\cos((1-t)\theta_y+t\Theta_y), \sin((1-t)\theta_y+t\Theta_y)\bigr)p+(cos((1−s)θx​+sΘx​),sin((1−s)θx​+sΘx​))andp+(cos((1−t)θy​+tΘy​),sin((1−t)θy​+tΘy​))

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.

Definition code
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))
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/UnitCircleCyclicAngleData.lean#L1-L74

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me