Plane Drawing Dart Arc Endpoint Away Separation
ProvedPlaneDrawingDartArcEndpointAwaySeparationcrossing-consequencestrellis-port
Let be a crossing-free ordinary polygonal drawing, let be dart-arc data, let be a dart, and let . Then there is a positive number such that every point of
has distance at least from every point of the carrier of .
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 PlaneDrawingDartArcEndpointAwaySeparation.
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 Definitions.Def_OrdinaryDrawingImageWithoutEdge import Definitions.Def_OrdinaryPolygonalDrawing import Definitions.Def_PlaneDrawingDartArcData open Classical noncomputable section
Formal statement
lemma PlaneDrawingDartArcEndpointAwaySeparation {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) (d : G.Dart) (r₀ r₁ : ℝ) :
0 < r₀ →
0 < r₁ →
∃ δ : ℝ, 0 < δ ∧
∀ x : EuclideanSpace ℝ (Fin 2),
x ∈ OrdinaryDrawingImageWithoutEdge G D (A.dartEdge d) →
x ∉ Metric.ball (A.dartArc d).source r₀ ∪
Metric.ball (A.dartArc d).target r₁ →
∀ p : EuclideanSpace ℝ (Fin 2),
p ∈ (A.dartArc d).carrier →
δ ≤ dist x p := by sorrySource