Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Plane Drawing Dart Coherent Side Strips Exist

Open
PlaneDrawingDartCoherentSideStripsExist

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, let AAA be dart-arc data, and let CCC be a dart vertex-sector geometry package. Then one can choose, for each dart ddd, polygonal side-strip data SdS_dSd​ for A.dartArc(d)A.dartArc(d)A.dartArc(d) such that:

Sd.rightStrip=Sdˉ.leftStrip,S_d.rightStrip=S_{\bar d}.leftStrip ,Sd​.rightStrip=Sdˉ​.leftStrip,

each exported left strip is nonempty and lies in the complement of the whole drawing image, near every relative-interior point of A.dartArc(d)A.dartArc(d)A.dartArc(d) the drawing complement is contained in

Sd.leftStrip∪Sdˉ.leftStrip,S_d.leftStrip\cup S_{\bar d}.leftStrip ,Sd​.leftStrip∪Sdˉ​.leftStrip,

and for every dart ddd the successor sector C.successorSector(d)C.successorSector(d)C.successorSector(d) meets both Sd.leftStripS_d.leftStripSd​.leftStrip and SC.star.successor(d).leftStripS_{C.star.successor(d)}.leftStripSC.star.successor(d)​.leftStrip inside the local disk at the head of ddd.

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

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.Combinatorics.SimpleGraph.DegreeSum
import Mathlib.Topology.Order.Compact
import Mathlib.Tactic
import Mathlib.Analysis.Normed.Module.Convex
import Mathlib.Analysis.Convex.PathConnected
import Mathlib.LinearAlgebra.FiniteDimensional.Lemmas
import Mathlib.Topology.Algebra.Module.FiniteDimension
import Definitions.Def_OrdinaryPolygonalDrawing
import Definitions.Def_PlaneDrawingDartArcData
import Definitions.Def_PlaneDrawingDartVertexSectorGeometry
import Definitions.Def_PlaneFaceData

open Classical
noncomputable section
Formal statement
lemma PlaneDrawingDartCoherentSideStripsExist {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) :
    ∃ sideStrips : ∀ d : G.Dart, PolygonalSideStrips (A.dartArc d),
      (∀ d : G.Dart, ((sideStrips d).leftStrip).Nonempty) ∧
        (∀ d : G.Dart, (sideStrips d).leftStrip ⊆
          (OrdinaryDrawingImage G D)ᶜ) ∧
          (∀ (d : G.Dart) (x : EuclideanSpace ℝ (Fin 2)),
            x ∈ (A.dartArc d).relativeInterior →
              ∃ U : Set (EuclideanSpace ℝ (Fin 2)),
                IsOpen U ∧ x ∈ U ∧
                  U ∩ (OrdinaryDrawingImage G D)ᶜ ⊆
                    (sideStrips d).leftStrip ∪
                      (sideStrips d.symm).leftStrip) ∧
            (∀ d : G.Dart,
              (sideStrips d).rightStrip = (sideStrips d.symm).leftStrip) ∧
              (∀ d : G.Dart,
                (C.successorSector d ∩ (sideStrips d).leftStrip ∩
                  Metric.ball (D.vertexPlacement d.toProd.2)
                    (C.star.localDiskRadius d.toProd.2)).Nonempty) ∧
                (∀ d : G.Dart,
                  (C.successorSector d ∩
                    (sideStrips (C.star.successor d)).leftStrip ∩
                      Metric.ball (D.vertexPlacement d.toProd.2)
                        (C.star.localDiskRadius d.toProd.2)).Nonempty) := by sorry
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/PlaneDrawingDartCoherentSideStripsExist.lean#L1-L273

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