Plane Drawing Dart Vertex Local Disk Identity
ProvedPlaneDrawingDartVertexLocalDiskIdentitycrossing-consequencestrellis-port
Let be a finite simple graph, let be a crossing-free ordinary polygonal drawing of , and let be dart-arc data for . Then one can choose, for every vertex , a radius , and, for every outgoing dart with tail , a unit first-germ direction
and a radial germ
such that is contained in the carrier of the edge of 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 PlaneDrawingDartVertexLocalDiskIdentity.
Preamble
import Mathlib.Tactic 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.Analysis.Normed.Module.Convex import Definitions.Def_OrdinaryPolygonalDrawing import Definitions.Def_PlaneDrawingDartArcData import Definitions.Def_PlaneFaceData open Classical noncomputable section
Formal statement
lemma PlaneDrawingDartVertexLocalDiskIdentity {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) :
∃ localDiskRadius : V → ℝ,
∃ germDirection :
∀ v : V, {d : G.Dart // d.toProd.1 = v} → EuclideanSpace ℝ (Fin 2),
∃ radialGerm :
∀ v : V, {d : G.Dart // d.toProd.1 = v} →
Set (EuclideanSpace ℝ (Fin 2)),
(∀ v : V, 0 < localDiskRadius v) ∧
(∀ (v : V) (d : {d : G.Dart // d.toProd.1 = v}),
germDirection v d ≠ 0) ∧
(∀ (v : V) (d : {d : G.Dart // d.toProd.1 = v}),
germDirection v d =
(‖(A.dartArc d.1).vertices[1]'(Nat.lt_of_succ_le
(A.dartArc d.1).length_ge_two) - D.vertexPlacement v‖)⁻¹ •
((A.dartArc d.1).vertices[1]'(Nat.lt_of_succ_le
(A.dartArc d.1).length_ge_two) - D.vertexPlacement v)) ∧
(∀ (v : V) (d : {d : G.Dart // d.toProd.1 = v}),
radialGerm v d =
openSegment ℝ (D.vertexPlacement v)
(D.vertexPlacement v + localDiskRadius v • germDirection v d)) ∧
(∀ (v : V) (d : {d : G.Dart // d.toProd.1 = v}),
radialGerm v d ⊆ (D.edgeArc (A.dartEdge d.1)).carrier) ∧
(∀ v : V,
Metric.ball (D.vertexPlacement v) (localDiskRadius v) ∩
OrdinaryDrawingImage G D =
{D.vertexPlacement v} ∪
⋃ d : {d : G.Dart // d.toProd.1 = v}, radialGerm v d) := by sorrySource