Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The binary candidate rules are exactly the native tight-block bag choices

Proved
StableMSR.Recovery.Supplement.BinaryRecovery.Regional.BlockSearch.tight_bag_options_exact

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

algorithmsclusteringdynamic-programming

Enumerate separators of size at most t and bags of size at most t+1 by fixed-length-bounded tuples. A rule records its interior, bag, and exactly the components to be solved after choosing that bag. Each native admissible tight-state choice has a rule.

Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_TightBlockPolicies
open StableMSR.Recovery StableMSR.Recovery.Supplement.BinaryRecovery
open StableMSR.Recovery.Supplement.BinaryRecovery.Regional
open StableMSR.Recovery.Supplement.BinaryRecovery.Regional.BlockSearch
open StableMSR.Recovery.DecompositionSearch RobertsonSeymour1986.GM5
Formal statement
theorem StableMSR.Recovery.Supplement.BinaryRecovery.Regional.BlockSearch.tight_bag_options_exact (z : GraphInput) (t : ℕ) :
    let G := scopeGraph z.1 z.2
    (∀r∈rules z t, let C := cuts z r.1
      let B := cuts z r.2.1
      Havens.IsFlap G (boundary G C) C ∧ (boundary G C).card≤t ∧
      boundary G C⊆B ∧ B⊆boundary G C∪C ∧ B.card≤t+1 ∧ (B∩C).Nonempty ∧
      ∀D, D∈children G B C ↔ ∃d∈r.2.2,cuts z d=D) ∧
    ∀ (C B : Finset (Vertex z)), Havens.IsFlap G (boundary G C) C →
      (boundary G C).card≤t → boundary G C⊆B → B⊆boundary G C∪C →
      B.card≤t+1 → (B∩C).Nonempty →
      ∃r∈rules z t,cuts z r.1=C ∧ cuts z r.2.1=B := by
  sorry
Source
Constructive binary implementation of the tight-block recurrence in StableMSR.Recovery.DecompositionSearch.finite_decomposition_search, https://prove2.me/theorems/d4f2a14a-b18f-44f7-966a-d1411797cf17.

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