Canonical vertex traces synchronize within each component and strictly descend
ProvedStableMSR.Recovery.Supplement.BinaryRecovery.Regional.BlockSearch.tight_component_traces_refinealgorithmsclusteringdynamic-programming
The first matching rule is the same for all vertices in one live component. The next round stops precisely at introduced vertices. Every live child strictly shrinks its interior and has its boundary in its parent bag.
Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_BlockTraceSemantics 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_component_traces_refine (z : GraphInput) (t : ℕ) (rs : List Rule) (cert : Presents z t rs) : TraceFacts z rs := 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.