Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Plane Drawing Dart Geometric Clockwise Sectors

Open
PlaneDrawingDartGeometricClockwiseSectors

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

crossing-consequencestrellis-port

Let GGG be a finite simple graph, let DDD be a crossing-free ordinary polygonal drawing of GGG, and let AAA be dart-arc data for DDD. Then there exists a dart vertex-sector geometry package CCC for G,D,AG,D,AG,D,A with the following explicit local sector model. For each dart d=(u,v)d=(u,v)d=(u,v), let dˉ=(v,u)\bar d=(v,u)dˉ=(v,u), put

bd=C.star.germDirection(v,dˉ),od=C.star.germDirection(v,C.star.successor(d)),b_d=C.star.germDirection(v,\bar d), \qquad o_d=C.star.germDirection(v,C.star.successor(d)),bd​=C.star.germDirection(v,dˉ),od​=C.star.germDirection(v,C.star.successor(d)),

and write ρv=C.star.localDiskRadius(v)\rho_v=C.star.localDiskRadius(v)ρv​=C.star.localDiskRadius(v). If dˉ\bar ddˉ is the only outgoing dart at vvv, then C.successorSector(d)C.successorSector(d)C.successorSector(d) is the slit disk

B(D(v),ρv)∖({D(v)+tbd:t>0}∪{D(v)}).B(D(v),\rho_v)\setminus \bigl(\{D(v)+t b_d:t>0\}\cup\{D(v)\}\bigr).B(D(v),ρv​)∖({D(v)+tbd​:t>0}∪{D(v)}).

Otherwise there are real numbers cd,sdc_d,s_dcd​,sd​, with sd≠0s_d\ne0sd​=0 or cd<0c_d<0cd​<0, such that

od=cdbd−sdrot⁡90(bd),o_d=c_d b_d-s_d\operatorname{rot}_{90}(b_d),od​=cd​bd​−sd​rot90​(bd​),

and, for Φd(x,y)=D(v)+xbd+yrot⁡90(bd)\Phi_d(x,y)=D(v)+x b_d+y\operatorname{rot}_{90}(b_d)Φd​(x,y)=D(v)+xbd​+yrot90​(bd​),

C.successorSector(d)={Φd{(x,y):x2+y2<(ρv/∥bd∥)2, y<0, cdy+sdx>0},sd>0,Φd{(x,y):x2+y2<(ρv/∥bd∥)2, (y<0 or cdy+sdx>0)},sd<0,Φd{(x,y):x2+y2<(ρv/∥bd∥)2, y<0},sd=0.C.successorSector(d)= \begin{cases} \Phi_d\{(x,y):x^2+y^2<(\rho_v/\|b_d\|)^2,\ y<0,\ c_dy+s_dx>0\}, & s_d>0,\\ \Phi_d\{(x,y):x^2+y^2<(\rho_v/\|b_d\|)^2,\ (y<0\text{ or }c_dy+s_dx>0)\}, & s_d<0,\\ \Phi_d\{(x,y):x^2+y^2<(\rho_v/\|b_d\|)^2,\ y<0\}, & s_d=0. \end{cases}C.successorSector(d)=⎩⎨⎧​Φd​{(x,y):x2+y2<(ρv​/∥bd​∥)2, y<0, cd​y+sd​x>0},Φd​{(x,y):x2+y2<(ρv​/∥bd​∥)2, (y<0 or cd​y+sd​x>0)},Φd​{(x,y):x2+y2<(ρv​/∥bd​∥)2, y<0},​sd​>0,sd​<0,sd​=0.​

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

Preamble
import Mathlib.Tactic
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.Combinatorics.SimpleGraph.DegreeSum
import Mathlib.Algebra.Group.Fin.Basic
import Mathlib.Analysis.SpecialFunctions.Complex.Arg
import Mathlib.Topology.Order.Compact
import Mathlib.Analysis.Normed.Module.Convex
import Definitions.Def_OrdinaryPolygonalDrawing
import Definitions.Def_PlanarRot90
import Definitions.Def_PlaneDrawingDartArcData
import Definitions.Def_PlaneDrawingDartVertexSectorGeometry

open Classical
noncomputable section
Formal statement
lemma PlaneDrawingDartGeometricClockwiseSectors {V : Type*} [Fintype V]
    (G : SimpleGraph V) [Fintype G.edgeSet] [DecidableRel G.Adj]
    (D : OrdinaryPolygonalDrawing G) (hD : D.crossingSet.card = 0)
    (A : PlaneDrawingDartArcData G D) :
    ∃ C : PlaneDrawingDartVertexSectorGeometry G D A,
      ∀ d : G.Dart,
        let rev : {e : G.Dart // e.toProd.1 = d.toProd.2} :=
          ⟨d.symm, by simp [SimpleGraph.Dart.symm]⟩
        let nxt : {e : G.Dart // e.toProd.1 = d.toProd.2} :=
          ⟨C.star.successor d, C.star.successor_tail d⟩
        ((∀ e : {e : G.Dart // e.toProd.1 = d.toProd.2}, e = rev) ∧
          C.successorSector d =
            Metric.ball (D.vertexPlacement d.toProd.2)
                (C.star.localDiskRadius d.toProd.2) \
              ({q | ∃ t : ℝ, 0 < t ∧
                q = D.vertexPlacement d.toProd.2 +
                  t • C.star.germDirection d.toProd.2 rev} ∪
                ({D.vertexPlacement d.toProd.2} :
                  Set (EuclideanSpace ℝ (Fin 2)))))
        ∨
        (∃ c s : ℝ,
          (s ≠ 0 ∨ c < 0) ∧
          C.star.germDirection d.toProd.2 nxt =
            c • C.star.germDirection d.toProd.2 rev -
              s • PlanarRot90 (C.star.germDirection d.toProd.2 rev) ∧
          C.successorSector d =
            (let base : EuclideanSpace ℝ (Fin 2) :=
              C.star.germDirection d.toProd.2 rev
             let baseChart : EuclideanSpace ℝ (Fin 2) →
                EuclideanSpace ℝ (Fin 2) :=
              fun z => D.vertexPlacement d.toProd.2 +
                z 0 • base + z 1 • PlanarRot90 base
             if 0 < s then
               baseChart ''
                {z : EuclideanSpace ℝ (Fin 2) |
                  z 0 ^ 2 + z 1 ^ 2 <
                    (C.star.localDiskRadius d.toProd.2 / ‖base‖) ^ 2 ∧
                  z 1 < 0 ∧ 0 < c * z 1 + s * z 0}
             else if s < 0 then
               baseChart ''
                {z : EuclideanSpace ℝ (Fin 2) |
                  z 0 ^ 2 + z 1 ^ 2 <
                    (C.star.localDiskRadius d.toProd.2 / ‖base‖) ^ 2 ∧
                  (z 1 < 0 ∨ 0 < c * z 1 + s * z 0)}
             else
               baseChart ''
                {z : EuclideanSpace ℝ (Fin 2) |
                  z 0 ^ 2 + z 1 ^ 2 <
                    (C.star.localDiskRadius d.toProd.2 / ‖base‖) ^ 2 ∧
                  z 1 < 0})) := by sorry
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/PlaneDrawingDartGeometricClockwiseSectors.lean#L1-L1226

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