Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Geometry design depends only on the curvature relation

Proved
PGDRevision20261113.curvature_relation_reduction

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

bregman-geometryconvex-optimizationproximal-gradient

Consider the real-line penalty-curvature model of the geometry-classification theorem. Thus A≥0A\ge0A≥0 is bounded, nonzero and continuously differentiable; λ>0\lambda>0λ>0; b∈C1b\in C^1b∈C1 has b(0)=1<b(x)b(0)=1<b(x)b(0)=1<b(x) for x≠0x\ne0x=0, derivative negative to the left and positive to the right of zero, and diverges at both ends. Let kc=bck_c=b^ckc​=bc for c≥0c\ge0c≥0.

If A(x)=a(b(x))A(x)=a(b(x))A(x)=a(b(x)), then for all c≥0c\ge0c≥0 and p>0p>0p>0,

ρ(c,p)=sup⁡s≥1∣psc−a(s)psc+λs∣.\boxed{ \rho(c,p)=\sup_{s\ge1} \left|\frac{ps^c-a(s)}{ps^c+\lambda s}\right|.}ρ(c,p)=s≥1sup​​psc+λspsc−a(s)​​.​

Consequently the exact rate and optimal parameter pair depend only on aaa and λ\lambdaλ, independently of the spatial shape of bbb. In particular, two admissible real-line models with the same aaa and λ\lambdaλ have exactly the same optimizing pairs.

This comparison prescribes the loss as a∘ba\circ ba∘b together with the penalty shape.

Related results. Exact profile performance (Theorem 4.1) · Geometry classification (Theorem 5.1)

Further examples and certificates. polynomial penalty models · polynomial quadratic geometry examples · polynomial matched geometry examples · polynomial interior geometry examples

Preamble
import Definitions.Def_PGDRevision20261113_Geometry
open PGDRevision20261113
Formal statement
theorem PGDRevision20261113.curvature_relation_reduction : CurvatureRelationClaim := by sorry
Source
Author manuscript: Exact Residual Bounds and Optimal Geometry Selection for Proximal Gradient Methods, revised reading edition, 13 November 2026, Corollary 6.3, p. 17; source file sections/06_classification_applications.tex, label cor:curvature_relation.

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