Each finite round exactly implements the tight-block acceptance recurrence
ProvedStableMSR.Recovery.Supplement.BinaryRecovery.Regional.BlockSearch.tight_rule_saturation_exactalgorithmsclusteringdynamic-programming
After m rounds, the represented interiors are exactly the tight components of boundary size at most t accepted by the native depth-m recurrence.
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_rule_saturation_exact (z : GraphInput) (t m : ℕ) (C : Finset (Vertex z)) :
let G := scopeGraph z.1 z.2
(∃ r∈winners z t m,cuts z r.1=C) ↔
Havens.IsFlap G (boundary G C) C ∧ (boundary G C).card≤t ∧ accepts G t m (boundary G C) C := 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.