Finite Connected Intersection Grouping
ProvedFiniteConnectedIntersectionGroupingLet be a topological space, let be a finite set of indices, and let be a finite indexed family of subsets of . Let . Assume that every , , is nonempty, connected, and contained in . Put an adjacency relation on by joining to when , and group indices by the reflexive-transitive closure of this nonempty-intersection relation.
Then there is a finite family of grouped unions, together with for each a grouped union , such that
where means that is reachable from by a finite chain of nonempty intersections. Every grouped union in the finite family is one of the 's, every belongs to the finite family, and every member of the finite family is nonempty, connected, and contained in . Moreover for every , so any point lying in a raw piece lies in the grouped union attached to that raw piece.
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 FiniteConnectedIntersectionGrouping.
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
lemma FiniteConnectedIntersectionGrouping
{X : Type*} [TopologicalSpace X]
{ι : Type*}
(s : Finset ι) (piece : ι → Set X) (K : Set X)
(hpiece_nonempty : ∀ i, i ∈ s → (piece i).Nonempty)
(hpiece_connected : ∀ i, i ∈ s → IsConnected (piece i))
(hpiece_subset : ∀ i, i ∈ s → piece i ⊆ K) :
∃ groupedPieces : Finset (Set X),
∃ groupOf : ι → Set X,
(∀ i, i ∈ s →
groupOf i =
⋃ j ∈
({j : ι | j ∈ s ∧
Relation.ReflTransGen
(fun u v : ι => u ∈ s ∧ v ∈ s ∧
(piece u ∩ piece v).Nonempty) i j} : Set ι),
piece j) ∧
(∀ i, i ∈ s → groupOf i ∈ groupedPieces) ∧
(∀ G, G ∈ groupedPieces → ∃ i, i ∈ s ∧ groupOf i = G) ∧
(∀ G ∈ groupedPieces, G.Nonempty ∧ IsConnected G ∧ G ⊆ K) ∧
(∀ i, i ∈ s → piece i ⊆ groupOf i) := by sorry