Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A logarithmic scale bound gives rational multiplicative endpoints

Proved
PGDRevision20261113.rational_scale_enclosure

by Somehow · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

bregman-geometryconvex-optimizationformalization

For positive p,p^p,\widehat pp,p​ and 0≤b<10\le b<10≤b<1, a logarithmic scale bound implies

∣log⁡(p/p^)∣≤b⟹p^(1−b)≤p≤p^1−b.|\log(p/\widehat p)|\le b \quad\Longrightarrow\quad \widehat p(1-b)\le p\le\frac{\widehat p}{1-b}.∣log(p/p​)∣≤b⟹p​(1−b)≤p≤1−bp​​.

When bbb and p^\widehat pp​ are rational, both endpoints are rational. This implication is the scale conversion used in the approximate-contact parameter certificates.

Related results. Parameter localization (Theorem 7.1) · Error-band equivalence

Preamble
import Definitions.Def_PGDRevision20261113_NumericalCertificates
open PGDRevision20261113
Formal statement
theorem PGDRevision20261113.rational_scale_enclosure : RationalScaleEnclosureClaim := by sorry
Source
Author manuscript, Exact Residual Bounds and Optimal Geometry Selection for Proximal Gradient Methods, revised reading edition, 13 November 2026; Section 7, rational scale enclosure; sections/07_quantitative_certificates.tex, eq:bg_rational_scale.

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