The binary candidate rules are exactly the native tight-block bag choices
ProvedStableMSR.Recovery.Supplement.BinaryRecovery.Regional.BlockSearch.tight_bag_options_exactalgorithmsclusteringdynamic-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.