Certified upper and lower constants preserve the localization bounds
OpenPGDRevision20261113.robust_contact_localizationbregman-geometryconvex-optimizationformalization
For a positive kernel , error , and , write
For fixed ordered contacts with signs , let
Assume all hypotheses of the approximate-contact localization theorem on a compact parameter interval , including candidate , signed contact lower bound , global upper bound , and positive lower bands at negative contacts. Replace by upper bounds , each adjacent minimum score gap by a positive lower bound , and the contact score norm by an upper bound .
For , put and ; for , interchange these two radii. Every pair with norm at most satisfies
Related results. Parameter localization (Theorem 7.1) · Error-band equivalence
Preamble
import Definitions.Def_PGDRevision20261113_NumericalCertificates open PGDRevision20261113
Formal statement
theorem PGDRevision20261113.robust_contact_localization : RobustContactLocalizationClaim := by sorry
Source
Author manuscript, Exact Residual Bounds and Optimal Geometry Selection for Proximal Gradient Methods, revised reading edition, 13 November 2026; Section 7, paragraph following the localization proof; sections/07_quantitative_certificates.tex, The bounds remain valid.