One Edge Grouped Local Piece Hit
ProvedOneEdgeGroupedLocalPieceHitcrossing-consequencestrellis-port
Let , let be the new closed segment, and let be a polygonally path connected set containing the open segment . Let be a complement component of such that . Let be an open neighborhood of the closed segment .
Suppose a finite retained raw local family covers every point of which is not on . Suppose also that each retained raw piece is contained in a grouped local piece , and that each belongs to a finite family . Then meets some member 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 OneEdgeGroupedLocalPieceHit.
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_PlaneFaceData import Definitions.Def_PolygonallyPathConnected open Classical noncomputable section
Formal statement
lemma OneEdgeGroupedLocalPieceHit
(A Csigma C localUnion : Set (EuclideanSpace ℝ (Fin 2)))
(a b : EuclideanSpace ℝ (Fin 2))
{ι : Type*}
(rawPieces : Finset ι)
(piece : ι → Set (EuclideanSpace ℝ (Fin 2)))
(groupedLocalPieces : Finset (Set (EuclideanSpace ℝ (Fin 2))))
(groupedLocalPieceOf : ι → Set (EuclideanSpace ℝ (Fin 2)))
(hC : ComplementComponent (A ∪ segment ℝ a b) C)
(hC_subset_Csigma : C ⊆ Csigma)
(hCsigma_subset_old_compl : Csigma ⊆ Aᶜ)
(hCsigma_path : PolygonallyPathConnected Csigma)
(hOpenSegment_Csigma : openSegment ℝ a b ⊆ Csigma)
(hLocalUnion_open : IsOpen localUnion)
(hSegment_subset_localUnion : segment ℝ a b ⊆ localUnion)
(hraw_cover :
∀ x : EuclideanSpace ℝ (Fin 2),
x ∈ localUnion ∩ Csigma →
x ∉ segment ℝ a b →
∃ k ∈ rawPieces, x ∈ piece k)
(hgroupedLocalPiece_mem :
∀ i, i ∈ rawPieces → groupedLocalPieceOf i ∈ groupedLocalPieces)
(hrawPiece_subset_groupedLocalPiece :
∀ i, i ∈ rawPieces → piece i ⊆ groupedLocalPieceOf i) :
∃ G ∈ groupedLocalPieces, (C ∩ G).Nonempty := by sorrySource