Complement Components Finite Hit Family
ProvedComplementComponentsFiniteHitFamilycrossing-consequencestrellis-port
Let , let be a finite type, and let be a finite family of nonempty connected subsets of . Suppose that every complement component of meets at least one . Then there is a finite set of subsets of the plane such that every member of is a complement component of , and every complement component of belongs to .
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 ComplementComponentsFiniteHitFamily.
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 Definitions.Def_PlaneFaceData open Classical noncomputable section
Formal statement
lemma ComplementComponentsFiniteHitFamily
(K : Set (EuclideanSpace ℝ (Fin 2))) {ι : Type} [Fintype ι]
(P : ι → Set (EuclideanSpace ℝ (Fin 2)))
(hPne : ∀ i, (P i).Nonempty)
(hPsub : ∀ i, P i ⊆ Kᶜ)
(hPconn : ∀ i, IsConnected (P i))
(hhit : ∀ C : Set (EuclideanSpace ℝ (Fin 2)),
ComplementComponent K C → ∃ i, (C ∩ P i).Nonempty) :
∃ comps : Finset (Set (EuclideanSpace ℝ (Fin 2))),
(∀ C ∈ comps, ComplementComponent K C) ∧
∀ C : Set (EuclideanSpace ℝ (Fin 2)),
ComplementComponent K C → C ∈ comps := by sorrySource