Assigning factors to bags preserves exact count and rational cost
ProvedStableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree.owned_factors_preserve_count_and_costalgorithmsclusteringdynamic-programming
Every factor is assigned to one bag containing its scope. A representing label gives the same emitted pack on that factor. Summing both length and rational cost over bags counts each original occurrence exactly once, also when an identifier repeats.
Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_BagMenuEncoding open StableMSR.Recovery.Supplement.BinaryRecovery.Regional open StableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree
Formal statement
theorem StableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree.owned_factors_preserve_count_and_cost (t : ℕ) (z : Data) (ids : Block) (scope : ℕ→Block) (emit : ℕ→Plan→Pack) (cost : Block→ℚ)
(hv : ∀i∈ids, ∀v∈scope i,v∈z.1) (hl : GoodLayout z.1 (ids.map scope) t z.2.2)
(hd : ∀i∈ids, DependsOn z.1 (scope i) (emit i))
(x : Block) (s : Plan) (hx : Legal (encodeMenus t z ids scope emit cost) x)
(hs : RepresentsPlan t z x s) : total (encodeMenus t z ids scope emit cost) x =
((renderFactors ids emit s).length,packCost cost (renderFactors ids emit s)) := by
sorry
Source
Ravichandran and Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, arXiv:2611.03547, Appendix A.6, tree-decomposition dynamic program. Explicit binary witness formulation.