Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Plane Drawing Dart Coherent Side Strips For Pair

Open
PlaneDrawingDartCoherentSideStripsForPair

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

crossing-consequencestrellis-port

Let GGG be a finite simple graph, DDD a crossing-free ordinary polygonal drawing, AAA dart-arc data, and CCC a dart vertex-sector geometry package. For a dart ddd, one can choose side-strip data SdS_dSd​ for A.dartArc(d)A.dartArc(d)A.dartArc(d) and SdˉS_{\bar d}Sdˉ​ for A.dartArc(dˉ)A.dartArc(\bar d)A.dartArc(dˉ) such that

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

Both left strips are nonempty and lie in (OrdinaryDrawingImage(G,D))c(\mathsf{OrdinaryDrawingImage}(G,D))^c(OrdinaryDrawingImage(G,D))c. Near every relative-interior point of either oriented arc, the drawing complement is contained in the union of the two left strips. Moreover the terminal successor sector of each of ddd and dˉ\bar ddˉ meets its own left strip inside the corresponding local disk, and whenever a dart ppp has C.star.successor(p)=dC.star.successor(p)=dC.star.successor(p)=d, respectively C.star.successor(p)=dˉC.star.successor(p)=\bar dC.star.successor(p)=dˉ, the sector C.successorSector(p)C.successorSector(p)C.successorSector(p) meets the left strip of ddd, respectively of dˉ\bar ddˉ, inside the local disk at the head of ppp.

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

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

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