Initial assemblies and completed words encode precisely the legal labelings
ProvedStableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree.initial_and_final_tree_assembliesalgorithmsclusteringdynamic-programming
Initially each real state emits its own key and the synthetic root emits the empty word. At the end only the root remains. Reading its word by vertex index recovers the same labeling even when the keys were accumulated in a different order.
Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_MenuAssembly open StableMSR.Recovery.Supplement.BinaryRecovery.Regional open StableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree
Formal statement
theorem StableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree.initial_and_final_tree_assemblies (I : Instance) :
(∀ xs : Block, xs.Perm (List.range I.1.length) → RepresentsOptima I (Assembly I xs (lookup (initial I)))) ∧
∀ R : Messages, RepresentsOptima I (Assembly I [] (lookup R)) →
Optima I ((lookup R (I.1.length,0)).map (readLabels I)) := by
sorry
Source
Complete-witness invariant for tree message elimination in the stable sum-of-radii mission, Appendix A.6 of arXiv:2611.03547.