Polygonal Path Ordered First Hit Prefix
ProvedPolygonalPathOrderedFirstHitPrefixcrossing-consequencestrellis-port
Let be a polygonal path in the sense of
PolygonalPath. Let be a closed straight segment, and
let be open with . If
and , then there are
a point and a set such that
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 PolygonalPathOrderedFirstHitPrefix.
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.Analysis.Convex.Between import Mathlib.Topology.MetricSpace.Thickening import Mathlib.Topology.Order.IntermediateValue import Definitions.Def_PolygonalPath open Classical noncomputable section
Formal statement
lemma PolygonalPathOrderedFirstHitPrefix
(γ : PolygonalPath)
(a b : EuclideanSpace ℝ (Fin 2))
(U : Set (EuclideanSpace ℝ (Fin 2)))
(hUopen : IsOpen U)
(hsegment_subset_U : segment ℝ a b ⊆ U)
(hsource_not : γ.source ∉ segment ℝ a b)
(htarget_mem : γ.target ∈ segment ℝ a b) :
∃ (y : EuclideanSpace ℝ (Fin 2)) (P : Set (EuclideanSpace ℝ (Fin 2))),
y ∈ γ.carrier ∧ y ∈ U ∧ y ∉ segment ℝ a b ∧
IsConnected P ∧ γ.source ∈ P ∧ y ∈ P ∧
P ⊆ γ.carrier ∩ (segment ℝ a b)ᶜ := by sorrySource