Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unit Circle Retained Arc Endpoint Quotient

Proved
UnitCircleRetainedArcEndpointQuotient

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

crossing-consequencestrellis-port

Let P⊂R2P\subset\mathbb{R}^2P⊂R2 be finite, and put

R={p∈P:∣P∩UnitCircle⁡(p)∣≥3}.R=\{p\in P: |P\cap\operatorname{UnitCircle}(p)|\ge 3\}.R={p∈P:∣P∩UnitCircle(p)∣≥3}.

There are a finite index type ι\iotaι, a finite set A⊆ιA\subseteq\iotaA⊆ι, an endpoint map ϵ:ι→Sym⁡2(P)\epsilon:\iota\to\operatorname{Sym}^2(P)ϵ:ι→Sym2(P), and, for every index iii, data

ci,xi,yi∈P,Ci,Ii⊆R2,γi:[0,1]→R2,c_i,x_i,y_i\in P,\qquad C_i,I_i\subseteq\mathbb R^2,\qquad \gamma_i:[0,1]\to\mathbb R^2,ci​,xi​,yi​∈P,Ci​,Ii​⊆R2,γi​:[0,1]→R2,

with the following properties. First,

∣A∣=∑p∈R∣P∩UnitCircle⁡(p)∣,|A|=\sum_{p\in R}|P\cap\operatorname{UnitCircle}(p)|,∣A∣=p∈R∑​∣P∩UnitCircle(p)∣,

every endpoint pair ϵ(i)\epsilon(i)ϵ(i), i∈Ai\in Ai∈A, is non-diagonal, and every endpoint pair in ϵ(A)\epsilon(A)ϵ(A) has at most two preimages in AAA. Second, for every i∈Ai\in Ai∈A, the center cic_ici​ is retained, ϵ(i)={xi,yi}\epsilon(i)=\{x_i,y_i\}ϵ(i)={xi​,yi​}, xi≠yix_i\ne y_ixi​=yi​, and xi,yi∈P∩UnitCircle⁡(ci)x_i,y_i\in P\cap\operatorname{UnitCircle}(c_i)xi​,yi​∈P∩UnitCircle(ci​). The map γi\gamma_iγi​ is continuous and injective, lies on UnitCircle⁡(ci)\operatorname{UnitCircle}(c_i)UnitCircle(ci​), starts at xix_ixi​, ends at yiy_iyi​, and

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

No vertex of PPP lies in any IiI_iIi​. If i,j∈Ai,j\in Ai,j∈A have the same center and i≠ji\ne ji=j, then Ii∩Ij=∅I_i\cap I_j=\varnothingIi​∩Ij​=∅. If i,j∈Ai,j\in Ai,j∈A have the same center and ϵ(i)=ϵ(j)\epsilon(i)=\epsilon(j)ϵ(i)=ϵ(j), then i=ji=ji=j.

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

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
import Mathlib.Analysis.SpecialFunctions.Complex.Arg
import Definitions.Def_UnitCircle

open Classical
open scoped BigOperators
open scoped Real
noncomputable section
Formal statement
lemma UnitCircleRetainedArcEndpointQuotient
    (P : Finset (EuclideanSpace ℝ (Fin 2))) :
    ∃ (ι : Type) (instF : Fintype ι) (instD : DecidableEq ι)
      (A : Finset ι) (endpoint : ι → Sym2 P)
      (center arcStart arcEnd : ι → P)
      (carrier arcInterior : ι → Set (EuclideanSpace ℝ (Fin 2)))
      (γ : ι → Set.Icc (0 : ℝ) 1 → EuclideanSpace ℝ (Fin 2)),
      (A.card : ℝ) =
          ∑ p ∈ P.filter
            (fun p => 3 ≤ (P.filter (fun q => q ∈ UnitCircle p)).card),
            ((P.filter (fun q => q ∈ UnitCircle p)).card : ℝ) ∧
        (∀ i ∈ A, ¬ (endpoint i).IsDiag) ∧
          (∀ e ∈ A.image endpoint,
            (A.filter (fun i => endpoint i = e)).card ≤ 2) ∧
            (∀ i ∈ A,
              3 ≤ (P.filter
                (fun q => q ∈ UnitCircle (center i : EuclideanSpace ℝ (Fin 2)))).card) ∧
              (∀ i ∈ A, endpoint i = Sym2.mk (arcStart i) (arcEnd i)) ∧
                (∀ i ∈ A,
                  (arcStart i : EuclideanSpace ℝ (Fin 2)) ≠
                    (arcEnd i : EuclideanSpace ℝ (Fin 2))) ∧
                  (∀ i ∈ A,
                    (arcStart i : EuclideanSpace ℝ (Fin 2)) ∈
                        UnitCircle (center i : EuclideanSpace ℝ (Fin 2)) ∧
                      (arcEnd i : EuclideanSpace ℝ (Fin 2)) ∈
                        UnitCircle (center i : EuclideanSpace ℝ (Fin 2))) ∧
                    (∀ 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⟩⟩)) ∧
                      (∀ i ∈ A, carrier i ⊆
                        UnitCircle (center i : EuclideanSpace ℝ (Fin 2))) ∧
                        (∀ i ∈ A, ∀ v : P,
                          (v : EuclideanSpace ℝ (Fin 2)) ∉ arcInterior i) ∧
                          (∀ i ∈ A, ∀ j ∈ A,
                            center i = center j → i ≠ j →
                              arcInterior i ∩ arcInterior j = ∅) ∧
                            (∀ i ∈ A, ∀ j ∈ A,
                              center i = center j → endpoint i = endpoint j →
                                i = j) := by sorry
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/UnitCircleRetainedArcEndpointQuotient.lean#L1-L411

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