Plane Drawing Dart Source Endpoint Ray Covers
ProvedPlaneDrawingDartSourceEndpointRayCoverscrossing-consequencestrellis-port
Let be a finite simple graph, let be an ordinary polygonal drawing
of , and let be dart-arc data
PlaneDrawingDartArcData. For every outgoing dart at a
vertex , there is a positive radius around on which the carrier
of the corresponding drawn edge lies on the source ray determined by the first
segment of the dart arc .
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 PlaneDrawingDartSourceEndpointRayCovers.
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 open Classical noncomputable section
Formal statement
lemma PlaneDrawingDartSourceEndpointRayCovers {V : Type*} [Fintype V]
(G : SimpleGraph V) [Fintype G.edgeSet] [DecidableRel G.Adj]
(D : OrdinaryPolygonalDrawing G)
(A : PlaneDrawingDartArcData G D) :
∃ sourceRayRadius :
∀ v : V, {d : G.Dart // d.toProd.1 = v} → ℝ,
(∀ (v : V) (d : {d : G.Dart // d.toProd.1 = v}),
0 < sourceRayRadius v d) ∧
∀ (v : V) (d : {d : G.Dart // d.toProd.1 = v}),
let γ := A.dartArc d.1
let hfirst : 1 < γ.vertices.length :=
Nat.lt_of_succ_le γ.length_ge_two
Metric.ball (D.vertexPlacement v) (sourceRayRadius v d) ∩
(D.edgeArc (A.dartEdge d.1)).carrier ⊆
{x | ∃ c : ℝ, 0 ≤ c ∧
x = D.vertexPlacement v +
c • (γ.vertices[1]'hfirst - D.vertexPlacement v)} := by sorrySource