Bounded distance-oracle expressions for the regional Bellman transition
ProvedStableMSR.Recovery.RegionalBallDP.ball_transition_expressionsalgorithmsclusteringdynamic-programmingformal-verification
Construct the initialization, synchronous minimum-weight edge selection, and endpoint normalization out of bounded integer reads, oracle distance comparisons, and finite summation. Equal-price alternatives are resolved by their edge index.
Preamble
import Definitions.Def_StableMSR_RegionalBallDP open StableMSR.Recovery StableMSR.Recovery.Compiler StableMSR.Recovery.OracleQueries open StableMSR.Recovery.BallCoverCatalog StableMSR.Recovery.CartesianBallRows StableMSR.Recovery.FewBallRows open StableMSR.Recovery.RegionalBallDP open scoped Classical set_option autoImplicit false set_option maxHeartbeats 2200000 set_option maxRecDepth 12000
Formal statement
theorem StableMSR.Recovery.RegionalBallDP.ball_transition_expressions :
(∀w : Bool,Form (fun x ρ=>iv (seedTable x (ρ 0) (ρ 1) w))) ∧
(∀w : Bool,Form (fun x ρ=>iv (tick x (ρ 0) (ρ 1) w))) ∧
(∀w : Bool,Form (fun x ρ=>iv (clean x (ρ 0) (ρ 1) w))) := by
sorrySource
Exact Sum-of-Radii Clustering under Any Constant Stability, arXiv:2611.03547, Algorithm 1, equation (2), and Appendix A.4–A.6. Real-distance oracle implementation and witness reconstruction for the Prove2Me recovery mission.