Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Plane Drawing Dart Arc Data

Definition
PlaneDrawingDartArcData

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

crossing-consequencestrellis-port

Let GGG be a finite simple graph and let DDD be an ordinary polygonal drawing of GGG. Oriented dart-arc data for DDD consists of the following choices. For each dart ddd, it chooses the underlying edge of ddd, with the assertion that this edge has unordered endpoint pair equal to the edge of ddd. It also chooses an oriented polygonal arc γd\gamma_dγd​ whose carrier is the carrier of the drawn edge of ddd, whose source is the placement of the tail of ddd, and whose target is the placement of the head of ddd. Moreover, this oriented arc is publicly identified with the stored edge arc in the dart orientation: for each dart d=(u,v)d=(u,v)d=(u,v), either γd\gamma_dγd​ is exactly the stored arc D(ed)D(e_d)D(ed​) and the stored source is D(u)D(u)D(u), or γd\gamma_dγd​ is exactly PolygonalArcReverse⁡(D(ed))\operatorname{PolygonalArcReverse}(D(e_d))PolygonalArcReverse(D(ed​)) and the stored target is D(u)D(u)D(u). Thus the first segment of γd\gamma_dγd​ can be rewritten as the stored first segment of D(ed)D(e_d)D(ed​) in the first case, and as the reversed stored last segment of D(ed)D(e_d)D(ed​) in the second case. Finally the two orientations of the same drawn edge are required to be coherent: for every dart ddd,

γdˉ=PolygonalArcReverse⁡(γd).\gamma_{\bar d}=\operatorname{PolygonalArcReverse}(\gamma_d).γdˉ​=PolygonalArcReverse(γd​).

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

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_PolygonalArc
import Definitions.Def_PolygonalArcReverse

open Classical
noncomputable section

-- [TABLET NODE: PlaneDrawingDartArcData]
structure PlaneDrawingDartArcData {V : Type*} [Fintype V] (G : SimpleGraph V)
    [Fintype G.edgeSet] [DecidableRel G.Adj] (D : OrdinaryPolygonalDrawing G) where
-- BODY
  dartEdge : G.Dart → G.edgeFinset
  dartEdge_eq : ∀ d : G.Dart, (dartEdge d).1 = d.edge
  dartArc : G.Dart → PolygonalArc
  dartArc_orientation :
    ∀ d : G.Dart,
      (dartArc d = D.edgeArc (dartEdge d) ∧
        (D.edgeArc (dartEdge d)).source = D.vertexPlacement d.toProd.1) ∨
      (dartArc d = PolygonalArcReverse (D.edgeArc (dartEdge d)) ∧
        (D.edgeArc (dartEdge d)).target = D.vertexPlacement d.toProd.1)
  dartArc_carrier :
    ∀ d : G.Dart, (dartArc d).carrier = (D.edgeArc (dartEdge d)).carrier
  dartArc_source :
    ∀ d : G.Dart, (dartArc d).source = D.vertexPlacement d.toProd.1
  dartArc_target :
    ∀ d : G.Dart, (dartArc d).target = D.vertexPlacement d.toProd.2
  dartArc_symm_eq_reverse :
    ∀ d : G.Dart, dartArc d.symm = PolygonalArcReverse (dartArc d)
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/PlaneDrawingDartArcData.lean#L1-L28

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