Plane Drawing Dart Collar Choice Data Exists
OpenPlaneDrawingDartCollarChoiceDataExistscrossing-consequencestrellis-port
Let be a finite simple graph, let be a crossing-free ordinary
polygonal drawing of , let be dart-arc data, and let be a
dart vertex-sector geometry package. Then there exists a dart
collar-choice package PlaneDrawingDartCollarChoiceData for
and .
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 PlaneDrawingDartCollarChoiceDataExists.
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.LinearAlgebra.FiniteDimensional.Lemmas import Mathlib.Topology.Algebra.Module.FiniteDimension import Mathlib.Analysis.Normed.Module.Convex import Mathlib.Analysis.Convex.PathConnected import Definitions.Def_OrdinaryPolygonalDrawing import Definitions.Def_PlaneDrawingDartArcData import Definitions.Def_PlaneDrawingDartCollarChoiceData import Definitions.Def_PlaneDrawingDartVertexSectorGeometry open Classical noncomputable section
Formal statement
lemma PlaneDrawingDartCollarChoiceDataExists {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) :
Nonempty (PlaneDrawingDartCollarChoiceData G D A C) := by sorrySource