Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A bounded progress bag for a tight connected region

Proved
StableMSR.Recovery.DecompositionSearch.exists_progress_bag

by lreyzin · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

Let a finite tree decomposition have bags of size at most w+1w+1w+1. Let CCC be a nonempty connected vertex set disjoint from SSS, suppose one bag contains SSS, and suppose every vertex of SSS has a neighbor in CCC. There exists a set BBB satisfying

S⊆B⊆S∪C,∣B∣≤w+1,B∩C≠∅.S\subseteq B\subseteq S\cup C,\quad |B|\le w+1,\quad B\cap C\ne\varnothing.S⊆B⊆S∪C,∣B∣≤w+1,B∩C=∅.

Moreover ∣S∣≤w|S|\le w∣S∣≤w and ∣C∖B∣<∣C∣|C\setminus B|<|C|∣C∖B∣<∣C∣. Thus a rooted tight boundary admits a candidate bag that makes strict recursive progress without increasing the width. This is a structural lemma for constructing a small tree decomposition; it does not assert that the complete search algorithm has been implemented.

Preamble
import Definitions.Def_SeymourThomas1993_Brambles
import Definitions.Def_RobertsonSeymour1986_GM5_IsTreeDecomposition
open RobertsonSeymour1986.GM5 StableMSR.Recovery.Havens
Formal statement
theorem StableMSR.Recovery.DecompositionSearch.exists_progress_bag {V T : Type} [DecidableEq V]
    [Fintype T] [DecidableEq T] {G : SimpleGraph V} {tree : SimpleGraph T}
    {bags : T → Finset V} (htd : IsTreeDecomposition G tree bags)
    (S C : Finset V) (w : ℕ) (hC : ConnectedSet G C) (hdisj : Disjoint S C)
    (hroot : ∃ r, S ⊆ bags r) (htouch : ∀ s ∈ S, ∃ c ∈ C, G.Adj s c)
    (hwidth : ∀ t, (bags t).card ≤ w+1) :
    ∃ B : Finset V, S ⊆ B ∧ B ⊆ S ∪ C ∧ B.card ≤ w+1 ∧
      (B ∩ C).Nonempty ∧ S.card ≤ w ∧ (C \ B).card < C.card := by sorry
Source
Supporting construction lemma for Prove2Me mission Exact Sum-of-Radii Clustering under Any Constant Stability; derived from the Helly property of subtrees and the canonical tree-decomposition axioms.

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