Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

One Edge Raw Local Finite Cover

Proved
OneEdgeRawLocalFiniteCover

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

crossing-consequencestrellis-port

Let A⊆R2A\subseteq\mathbb R^2A⊆R2, let CσC_\sigmaCσ​ be a complement component of AAA, and let a,b∈R2a,b\in\mathbb R^2a,b∈R2 with endpoint radii ra,rbr_a,r_bra​,rb​. Suppose we are given finite endpoint-sector families {Sia}i∈Ia\{S^a_i\}_{i\in I_a}{Sia​}i∈Ia​​ and {Sjb}j∈Ib\{S^b_j\}_{j\in I_b}{Sjb​}j∈Ib​​, a middle rectangle RRR, and two middle side pieces LLL and MMM. Assume that each endpoint sector is open, connected, and contained in the corresponding endpoint ball and in the complement of A∪[a,b]A\cup[a,b]A∪[a,b] (for the bbb-sectors, written with the opposite orientation [b,a][b,a][b,a]); that LLL and MMM are connected subsets of (A∪[a,b])c(A\cup[a,b])^c(A∪[a,b])c; that

R∖[a,b]⊆L∪M;R\setminus[a,b]\subseteq L\cup M;R∖[a,b]⊆L∪M;

that the aaa-sectors cover B(a,ra)∩(A∪[a,b])cB(a,r_a)\cap(A\cup[a,b])^cB(a,ra​)∩(A∪[a,b])c and the bbb-sectors cover B(b,rb)∩(A∪[b,a])cB(b,r_b)\cap(A\cup[b,a])^cB(b,rb​)∩(A∪[b,a])c; and that each middle side piece meets at least one aaa-sector and at least one bbb-sector.

Then there is a finite indexed raw local family QkQ_kQk​, whose members are exactly the endpoint sectors and the two middle side pieces that meet CσC_\sigmaCσ​, with the following properties. An index is retained precisely when Cσ∩Qk≠∅C_\sigma\cap Q_k\ne\varnothingCσ​∩Qk​=∅. Every retained QkQ_kQk​ is nonempty, connected, contained in (A∪[a,b])c(A\cup[a,b])^c(A∪[a,b])c, and contained in CσC_\sigmaCσ​. Moreover every point of

(B(a,ra)∪R∪B(b,rb))∩Cσ(B(a,r_a)\cup R\cup B(b,r_b))\cap C_\sigma(B(a,ra​)∪R∪B(b,rb​))∩Cσ​

that is not on [a,b][a,b][a,b] lies in some retained QkQ_kQk​. Finally, if either middle side piece is retained, then it meets a retained aaa-sector and a retained bbb-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.

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 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
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/OneEdgeRawLocalFiniteCover.lean#L1-L218

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