Independent compression of active rows preserves all attainable optima
ProvedStableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree.row_compression_preserves_assembliesalgorithmsclusteringdynamic-programming
Every word in a legal complete assembly lies within the unary resource and witness bounds. Independently replace each chosen word by a no-more-expensive word in the same state row and count bin. Boundary compatibility is unchanged and rational costs add.
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.row_compression_preserves_assemblies (I : Instance) (xs : Block) (R : Key→List Word)
(correct : RepresentsOptima I (Assembly I xs R)) :
RepresentsOptima I (Assembly I xs (fun k => compress I (R k))) := by
sorry
Source
Complete-witness invariant for tree message elimination in the stable sum-of-radii mission, Appendix A.6 of arXiv:2611.03547.