One Edge Raw Local Finite Cover
ProvedOneEdgeRawLocalFiniteCoverLet , let be a complement component of , and let with endpoint radii . Suppose we are given finite endpoint-sector families and , a middle rectangle , and two middle side pieces and . Assume that each endpoint sector is open, connected, and contained in the corresponding endpoint ball and in the complement of (for the -sectors, written with the opposite orientation ); that and are connected subsets of ; that
that the -sectors cover and the -sectors cover ; and that each middle side piece meets at least one -sector and at least one -sector.
Then there is a finite indexed raw local family , whose members are exactly the endpoint sectors and the two middle side pieces that meet , with the following properties. An index is retained precisely when . Every retained is nonempty, connected, contained in , and contained in . Moreover every point of
that is not on lies in some retained . Finally, if either middle side piece is retained, then it meets a retained -sector and a retained -sector.
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 OneEdgeRawLocalFiniteCover.
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 Definitions.Def_PlaneFaceData open Classical noncomputable section
lemma OneEdgeRawLocalFiniteCover
(A Csigma : Set (EuclideanSpace ℝ (Fin 2)))
(a b : EuclideanSpace ℝ (Fin 2)) (ra rb : ℝ)
{ιA ιB : Type} [Fintype ιA] [Fintype ιB]
(sectorA : ιA → Set (EuclideanSpace ℝ (Fin 2)))
(sectorB : ιB → Set (EuclideanSpace ℝ (Fin 2)))
(middleRect middleLeft middleRight : Set (EuclideanSpace ℝ (Fin 2)))
(hCsigma : ComplementComponent A Csigma)
(hsectorA_data :
∀ i, IsOpen (sectorA i) ∧ IsConnected (sectorA i) ∧
sectorA i ⊆ Metric.ball a ra ∧
sectorA i ⊆ (A ∪ segment ℝ a b)ᶜ)
(hsectorB_data :
∀ i, IsOpen (sectorB i) ∧ IsConnected (sectorB i) ∧
sectorB i ⊆ Metric.ball b rb ∧
sectorB i ⊆ (A ∪ segment ℝ b a)ᶜ)
(hmiddleLeft_connected : IsConnected middleLeft)
(hmiddleRight_connected : IsConnected middleRight)
(hmiddleLeft_subset_compl : middleLeft ⊆ (A ∪ segment ℝ a b)ᶜ)
(hmiddleRight_subset_compl : middleRight ⊆ (A ∪ segment ℝ a b)ᶜ)
(hmiddle_cover : middleRect \ segment ℝ a b ⊆ middleLeft ∪ middleRight)
(hsectorA_cover :
∀ x : EuclideanSpace ℝ (Fin 2),
x ∈ Metric.ball a ra → x ∈ (A ∪ segment ℝ a b)ᶜ →
∃ i, x ∈ sectorA i)
(hsectorB_cover :
∀ x : EuclideanSpace ℝ (Fin 2),
x ∈ Metric.ball b rb → x ∈ (A ∪ segment ℝ b a)ᶜ →
∃ i, x ∈ sectorB i)
(hmiddleLeft_sectorA : ∃ i, (middleLeft ∩ sectorA i).Nonempty)
(hmiddleRight_sectorA : ∃ i, (middleRight ∩ sectorA i).Nonempty)
(hmiddleLeft_sectorB : ∃ i, (middleLeft ∩ sectorB i).Nonempty)
(hmiddleRight_sectorB : ∃ i, (middleRight ∩ sectorB i).Nonempty) :
∃ rawPieces : Finset ((ιA ⊕ ιB) ⊕ Bool),
∃ piece : ((ιA ⊕ ιB) ⊕ Bool) → Set (EuclideanSpace ℝ (Fin 2)),
(∀ i, piece (Sum.inl (Sum.inl i)) = sectorA i) ∧
(∀ i, piece (Sum.inl (Sum.inr i)) = sectorB i) ∧
piece (Sum.inr false) = middleLeft ∧
piece (Sum.inr true) = middleRight ∧
(∀ k, k ∈ rawPieces ↔ (Csigma ∩ piece k).Nonempty) ∧
(∀ k ∈ rawPieces,
(piece k).Nonempty ∧ IsConnected (piece k) ∧
piece k ⊆ (A ∪ segment ℝ a b)ᶜ ∧ piece k ⊆ Csigma) ∧
(∀ x : EuclideanSpace ℝ (Fin 2),
x ∈ ((Metric.ball a ra ∪ middleRect) ∪ Metric.ball b rb) ∩
Csigma →
x ∉ segment ℝ a b →
∃ k ∈ rawPieces, x ∈ piece k) ∧
(((Sum.inr false : ((ιA ⊕ ιB) ⊕ Bool)) ∈ rawPieces →
((∃ i, (Sum.inl (Sum.inl i) : ((ιA ⊕ ιB) ⊕ Bool)) ∈ rawPieces ∧
(middleLeft ∩ sectorA i).Nonempty) ∧
(∃ i, (Sum.inl (Sum.inr i) : ((ιA ⊕ ιB) ⊕ Bool)) ∈ rawPieces ∧
(middleLeft ∩ sectorB i).Nonempty))) ∧
((Sum.inr true : ((ιA ⊕ ιB) ⊕ Bool)) ∈ rawPieces →
((∃ i, (Sum.inl (Sum.inl i) : ((ιA ⊕ ιB) ⊕ Bool)) ∈ rawPieces ∧
(middleRight ∩ sectorA i).Nonempty) ∧
(∃ i, (Sum.inl (Sum.inr i) : ((ιA ⊕ ιB) ⊕ Bool)) ∈ rawPieces ∧
(middleRight ∩ sectorB i).Nonempty)))) := by sorry