Every part of a legal full labeling passes the explicit message bounds
ProvedStableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree.legal_witness_subword_boundsalgorithmsclusteringdynamic-programming
A legal labeling selects one indexed cell per vertex. Its distinct keys appear in the catalog, and its selected cell payloads use no more blocks than the list of all payloads. These bounds apply to every partial word contained in a full labeling.
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.legal_witness_subword_bounds (I : Instance) (x : Block) (hx : Legal I x) :
mass I (canonical I x)=total I x ∧ ∀w : Word, (w : Multiset Key)≤(canonical I x : Multiset Key) →
fitsB I w=true ∧ load I w≤(resources I).length := by
sorry
Source
Complete-witness invariant for tree message elimination in the stable sum-of-radii mission, Appendix A.6 of arXiv:2611.03547.