One Edge Endpoint Radius Refinement
ProvedOneEdgeEndpointRadiusRefinementcrossing-consequencestrellis-port
Let be the endpoints of a new edge in a finite straight-line complex. Suppose positive radii have already been chosen so that misses every old vertex other than and every old edge not incident with , and similarly misses every old vertex other than and every old edge not incident with . Then there are smaller positive radii such that
and the same vertex-avoidance and nonincident-edge-avoidance conclusions hold with in place 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 OneEdgeEndpointRadiusRefinement.
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 open Classical noncomputable section
Formal statement
lemma OneEdgeEndpointRadiusRefinement
(V : Finset (EuclideanSpace ℝ (Fin 2)))
(E : Finset (EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2)))
(a b : EuclideanSpace ℝ (Fin 2))
(ρa ρb : ℝ)
(hab : a ≠ b)
(hρa_pos : 0 < ρa) (hρb_pos : 0 < ρb)
(hρa_vertices :
∀ v : EuclideanSpace ℝ (Fin 2),
v ∈ V → v ≠ a → v ∉ Metric.ball a ρa)
(hρa_edges :
∀ e : EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2),
e ∈ E → e.1 ≠ a → e.2 ≠ a →
Disjoint (Metric.ball a ρa) (segment ℝ e.1 e.2))
(hρb_vertices :
∀ v : EuclideanSpace ℝ (Fin 2),
v ∈ V → v ≠ b → v ∉ Metric.ball b ρb)
(hρb_edges :
∀ e : EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2),
e ∈ E → e.1 ≠ b → e.2 ≠ b →
Disjoint (Metric.ball b ρb) (segment ℝ e.1 e.2)) :
∃ ra rb : ℝ,
0 < ra ∧ 0 < rb ∧
ra ≤ ρa ∧ rb ≤ ρb ∧
ra < dist a b / 3 ∧ rb < dist a b / 3 ∧
ra + rb < dist a b ∧
(∀ v : EuclideanSpace ℝ (Fin 2),
v ∈ V → v ≠ a → v ∉ Metric.ball a ra) ∧
(∀ e : EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2),
e ∈ E → e.1 ≠ a → e.2 ≠ a →
Disjoint (Metric.ball a ra) (segment ℝ e.1 e.2)) ∧
(∀ v : EuclideanSpace ℝ (Fin 2),
v ∈ V → v ≠ b → v ∉ Metric.ball b rb) ∧
(∀ e : EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2),
e ∈ E → e.1 ≠ b → e.2 ≠ b →
Disjoint (Metric.ball b rb) (segment ℝ e.1 e.2)) := by sorrySource