One Edge Endpoint Nonincident Feature Separation
ProvedOneEdgeEndpointNonincidentFeatureSeparationcrossing-consequencestrellis-port
Let be a finite vertex set and a finite family of old straight edges in the plane. Fix a vertex . Assume that no vertex of lies in the relative interior of any old edge of . Then there is a radius such that the open ball contains no vertex of other than , and is disjoint from every old edge of that is not incident with .
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 OneEdgeEndpointNonincidentFeatureSeparation.
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.Topology.Order.Compact open Classical noncomputable section
Formal statement
lemma OneEdgeEndpointNonincidentFeatureSeparation
(V : Finset (EuclideanSpace ℝ (Fin 2)))
(E : Finset (EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2)))
(p : EuclideanSpace ℝ (Fin 2))
(hNoVertexInEdgeInterior :
∀ e : EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2),
e ∈ E →
∀ v : EuclideanSpace ℝ (Fin 2),
v ∈ V → v ∉ openSegment ℝ e.1 e.2)
(hpV : p ∈ V) :
∃ ρ : ℝ, 0 < ρ ∧
(∀ v : EuclideanSpace ℝ (Fin 2),
v ∈ V → v ≠ p → v ∉ Metric.ball p ρ) ∧
(∀ e : EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2),
e ∈ E → e.1 ≠ p → e.2 ≠ p →
Disjoint (Metric.ball p ρ) (segment ℝ e.1 e.2)) := by sorrySource