Agreement across edges propagates to every bag occurrence
ProvedStableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree.overlap_equality_along_treealgorithmsclusteringdynamic-programming
The running-intersection axiom puts a repeated variable in every bag along the tree path. Chaining the edge equalities gives agreement at arbitrary occurrences.
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.overlap_equality_along_tree (vs : Block) (scopes : List Block) (t : ℕ) (L : FactorLayout) (hl : GoodLayout vs scopes t L)
(value : ℕ→ℕ→Value)
(h : ∀ (i j : Fin L.length), (layoutTree L).Adj i j → ∀ v∈vs,
v∈bag L i.val → v∈bag L j.val → value i.val v=value j.val v)
(i j : Fin L.length) (v : ℕ) (hv : v∈vs) (hi : v∈bag L i.val) (hj : v∈bag L j.val) :
value i.val v=value j.val v := 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.