Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Plane Drawing Dart Sector Witness Data

Definition
PlaneDrawingDartSectorWitnessData

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

crossing-consequencestrellis-port

Let GGG be a finite simple graph, let DDD be an ordinary polygonal drawing of GGG, and suppose oriented dart-arc data, vertex-star data, and compatible side-strip data have been fixed. Sector-witness data consists of the two local sector certificates needed at vertices.

First, for each dart d=(u,v)d=(u,v)d=(u,v), it gives an open connected sector contained in the local ball around D(v)D(v)D(v), contained in the complement of the drawing image, and disjoint from every radial germ at vvv. This sector meets, inside that same local ball, both the left side strip of ddd and the left side strip of the successor dart ϕ(d)\phi(d)ϕ(d).

Second, it gives vertex-sector coverage. If a vertex vvv is the head of at least one dart, then every nonvertex point of the local ball around D(v)D(v)D(v) which lies in the drawing complement belongs to one of these open connected sectors for some incoming dart ddd with head vvv, and the sector has the same complement containment, side-strip intersection, and radial-germ disjointness properties.

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

Definition code
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 Definitions.Def_OrdinaryPolygonalDrawing
import Definitions.Def_PlaneDrawingDartArcData
import Definitions.Def_PlaneDrawingDartSideStripData
import Definitions.Def_PlaneDrawingDartVertexStarData
import Definitions.Def_PlaneFaceData

open Classical
noncomputable section

-- [TABLET NODE: PlaneDrawingDartSectorWitnessData]
structure PlaneDrawingDartSectorWitnessData {V : Type*} [Fintype V] (G : SimpleGraph V)
    [Fintype G.edgeSet] [DecidableRel G.Adj] (D : OrdinaryPolygonalDrawing G)
    (A : PlaneDrawingDartArcData G D)
    (B : PlaneDrawingDartVertexStarData G D A)
    (S : PlaneDrawingDartSideStripData G D A B) where
-- BODY
  successor_clockwise_sector :
    ∀ d : G.Dart,
      ∃ sector : Set (EuclideanSpace ℝ (Fin 2)),
        IsOpen sector ∧ IsConnected sector ∧
          sector ⊆ Metric.ball (D.vertexPlacement d.toProd.2)
            (B.localDiskRadius d.toProd.2) ∧
          sector ⊆ (OrdinaryDrawingImage G D)ᶜ ∧
          (sector ∩ S.leftSideStrip d ∩
            Metric.ball (D.vertexPlacement d.toProd.2)
              (B.localDiskRadius d.toProd.2)).Nonempty ∧
          (sector ∩ S.leftSideStrip (B.successor d) ∩
            Metric.ball (D.vertexPlacement d.toProd.2)
              (B.localDiskRadius d.toProd.2)).Nonempty ∧
          (∀ e : {e : G.Dart // e.toProd.1 = d.toProd.2},
            Disjoint sector (B.radialGerm d.toProd.2 e))
  vertex_sector_coverage :
    ∀ (v : V) (y : EuclideanSpace ℝ (Fin 2)),
      (∃ d : G.Dart, d.toProd.2 = v) →
        y ∈ Metric.ball (D.vertexPlacement v) (B.localDiskRadius v) →
          y ≠ D.vertexPlacement v →
            y ∈ (OrdinaryDrawingImage G D)ᶜ →
              ∃ d : G.Dart,
                d.toProd.2 = v ∧
                  ∃ sector : Set (EuclideanSpace ℝ (Fin 2)),
                    y ∈ sector ∧ IsOpen sector ∧ IsConnected sector ∧
                      sector ⊆ Metric.ball (D.vertexPlacement v)
                        (B.localDiskRadius v) ∧
                      sector ⊆ (OrdinaryDrawingImage G D)ᶜ ∧
                      (sector ∩ S.leftSideStrip d ∩
                        Metric.ball (D.vertexPlacement v)
                          (B.localDiskRadius v)).Nonempty ∧
                      (sector ∩ S.leftSideStrip (B.successor d) ∩
                        Metric.ball (D.vertexPlacement v)
                          (B.localDiskRadius v)).Nonempty ∧
                      (∀ e : {e : G.Dart // e.toProd.1 = v},
                        Disjoint sector (B.radialGerm v e))
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/PlaneDrawingDartSectorWitnessData.lean#L1-L52

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