Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unit Circle Retained Arc Drawing Assembly

Proved
UnitCircleRetainedArcDrawingAssembly

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

crossing-consequencestrellis-port

Let P⊂R2P\subset\mathbb R^2P⊂R2 be finite. Let AAA be a finite set of arc indices, let ϵ:A→Sym⁡2(P)\epsilon:A\to\operatorname{Sym}^2(P)ϵ:A→Sym2(P) be an endpoint map, and suppose that each index i∈Ai\in Ai∈A is equipped with a center ci∈Pc_i\in Pci​∈P, endpoint vertices xi,yi∈Px_i,y_i\in Pxi​,yi​∈P, a carrier CiC_iCi​, a relative interior IiI_iIi​, and a parametrization γi:[0,1]→R2\gamma_i:[0,1]\to\mathbb R^2γi​:[0,1]→R2. Assume that

ϵ(i)={xi,yi},xi≠yi,\epsilon(i)=\{x_i,y_i\},\qquad x_i\ne y_i,ϵ(i)={xi​,yi​},xi​=yi​,

that xix_ixi​ and yiy_iyi​ lie on UnitCircle⁡(ci)\operatorname{UnitCircle}(c_i)UnitCircle(ci​), and that γi\gamma_iγi​ is a continuous injective parametrization lying on UnitCircle⁡(ci)\operatorname{UnitCircle}(c_i)UnitCircle(ci​), starting at xix_ixi​, ending at yiy_iyi​, with

Ci=γi([0,1]),Ii=γi((0,1)),Ci⊆UnitCircle⁡(ci).C_i=\gamma_i([0,1]),\qquad I_i=\gamma_i((0,1)),\qquad C_i\subseteq\operatorname{UnitCircle}(c_i).Ci​=γi​([0,1]),Ii​=γi​((0,1)),Ci​⊆UnitCircle(ci​).

Assume also that no vertex of PPP lies in any IiI_iIi​, and that whenever two distinct indices of AAA have the same center their relative interiors are disjoint.

Then, for every finite simple graph GGG on vertex set PPP whose edge set is exactly ϵ(A)\epsilon(A)ϵ(A), there is a finite geometric-arc drawing DDD of GGG in the sense of GeometricArcDrawing such that

D.localPairCount⁡≤2∣P∣2.D.\operatorname{localPairCount}\le 2|P|^2 .D.localPairCount≤2∣P∣2.

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

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 Definitions.Def_GeometricArcDrawing
import Definitions.Def_UnitCircle

open Classical
open scoped BigOperators
open scoped Real
noncomputable section
Formal statement
lemma UnitCircleRetainedArcDrawingAssembly
    (P : Finset (EuclideanSpace ℝ (Fin 2)))
    {ι : Type} (A : Finset ι) (endpoint : ι → Sym2 P)
    (center arcStart arcEnd : ι → P)
    (carrier arcInterior : ι → Set (EuclideanSpace ℝ (Fin 2)))
    (γ : ι → Set.Icc (0 : ℝ) 1 → EuclideanSpace ℝ (Fin 2))
    (h_endpoint_eq : ∀ i ∈ A, endpoint i = Sym2.mk (arcStart i) (arcEnd i))
    (h_endpoints_distinct : ∀ i ∈ A,
      (arcStart i : EuclideanSpace ℝ (Fin 2)) ≠
        (arcEnd i : EuclideanSpace ℝ (Fin 2)))
    (h_endpoints_on_circle : ∀ i ∈ A,
      (arcStart i : EuclideanSpace ℝ (Fin 2)) ∈
          UnitCircle (center i : EuclideanSpace ℝ (Fin 2)) ∧
        (arcEnd i : EuclideanSpace ℝ (Fin 2)) ∈
          UnitCircle (center i : EuclideanSpace ℝ (Fin 2)))
    (h_arc_param : ∀ i ∈ A,
      Continuous (γ i) ∧
        Function.Injective (γ i) ∧
          (∀ t, γ i t ∈ UnitCircle (center i : EuclideanSpace ℝ (Fin 2))) ∧
            γ i ⟨0, by simp⟩ =
              (arcStart i : EuclideanSpace ℝ (Fin 2)) ∧
              γ i ⟨1, by simp⟩ =
                (arcEnd i : EuclideanSpace ℝ (Fin 2)) ∧
                carrier i = Set.range (γ i) ∧
                  arcInterior i =
                    Set.range
                      (fun t : {t : ℝ // 0 < t ∧ t < 1} =>
                        γ i
                          ⟨t.1, ⟨le_of_lt t.2.1,
                            le_of_lt t.2.2⟩⟩))
    (h_carrier_circle : ∀ i ∈ A, carrier i ⊆
      UnitCircle (center i : EuclideanSpace ℝ (Fin 2)))
    (h_no_vertex_in_interior : ∀ i ∈ A, ∀ v : P,
      (v : EuclideanSpace ℝ (Fin 2)) ∉ arcInterior i)
    (h_same_center_disjoint : ∀ i ∈ A, ∀ j ∈ A,
      center i = center j → i ≠ j →
        arcInterior i ∩ arcInterior j = ∅) :
    ∀ (G : SimpleGraph P) [Fintype G.edgeSet],
      G.edgeFinset = A.image endpoint →
        ∃ D : GeometricArcDrawing G,
          (D.localPairCount : ℝ) ≤ 2 * (P.card : ℝ) ^ 2 := by sorry
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/UnitCircleRetainedArcDrawingAssembly.lean#L1-L579

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