Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite Connected Intersection Grouping

Proved
FiniteConnectedIntersectionGrouping

by moona3k · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

crossing-consequencestrellis-port

Let XXX be a topological space, let sss be a finite set of indices, and let {Pi}i∈s\{P_i\}_{i\in s}{Pi​}i∈s​ be a finite indexed family of subsets of XXX. Let K⊆XK\subseteq XK⊆X. Assume that every PiP_iPi​, i∈si\in si∈s, is nonempty, connected, and contained in KKK. Put an adjacency relation on sss by joining iii to jjj when Pi∩Pj≠∅P_i\cap P_j\ne\varnothingPi​∩Pj​=∅, 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 i∈si\in si∈s a grouped union GiG_iGi​, such that

Gi=⋃j∈si⇝jPj,G_i=\bigcup_{\substack{j\in s\\ i\leadsto j}} P_j,Gi​=j∈si⇝j​⋃​Pj​,

where i⇝ji\leadsto ji⇝j means that jjj is reachable from iii by a finite chain of nonempty intersections. Every grouped union in the finite family is one of the GiG_iGi​'s, every GiG_iGi​ belongs to the finite family, and every member of the finite family is nonempty, connected, and contained in KKK. Moreover Pi⊆GiP_i\subseteq G_iPi​⊆Gi​ for every i∈si\in si∈s, 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.

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

open Classical
noncomputable section
Formal statement
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
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/FiniteConnectedIntersectionGrouping.lean#L1-L102

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me