Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Minimum-weight tree labelings for every attainable unary total

Proved
StableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree.explicit_tree_menu_optimizer

by lreyzin · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmsclusteringdynamic-programming

The input explicitly lists a finite tree, finite menus with unary resource contributions and signed rational weights, and allowed pairs on edges. Output legal state-index vectors attaining the least total weight at each attainable resource total.

Preamble
import Definitions.Def_StableMSR_Recovery_Supplement_FiniteMenuTrees
import Definitions.Def_QuantumMaxCutFiniteNumericRuntime
open StableMSR.Recovery.Supplement.BinaryRecovery.Regional
open StableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree
open OAI.MetricKMedian.Binary.Automatic
Formal statement
theorem StableMSR.Recovery.Supplement.BinaryRecovery.Regional.MenuTree.explicit_tree_menu_optimizer : ∃ A : Instance→List Block, Poly A ∧ ∀ I, (layoutTree I.1).IsTree → Optima I (A I) := 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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me