Theorem 1: exact PGD residual curves for every fixed penalty
ProvedPGDMap20261031.pgd_full_curve01 · The problem and its normalization
Let on . The smooth term is convex with gradient Lipschitz constant at most . The fixed penalty is proper, closed and convex, with more than one point in its effective domain. Its best global strong-convexity modulus is .
Run proximal gradient descent with a positive constant step , where , and write . For updates, compare the final residual with the actual cumulative decrease:
The penalty is fixed throughout this supremum; the smooth term and initial point vary.
02 · The exact curve
Put and . For , define
For one update, . Then
Every legitimate strong-convexity lower bound also gives
03 · Sharpness and scope
For a quadratic penalty , one-dimensional instances attain the bound. For an arbitrary fixed penalty, the equality is an equality of suprema: matching ratios may be approached along a sequence of instances. No minimizer of is assumed to exist.
The theorem identifies the dependence on the fixed penalty through its best modulus. The performance measure is the final gradient mapping normalized by the decrease over the same updates.
Formalization note. Extended-valued penalties are represented by an effective domain and a finite value on that domain; closedness means closedness of the epigraph. The main target is stated as a least-upper-bound assertion, avoiding an undefined real supremum on an empty or unbounded feasible set. The proof submission is a reduction with explicitly tracked analytic obligations.
import Definitions.Def_PGDMap20261031_PGD open PGDMap20261031
theorem PGDMap20261031.pgd_full_curve : FullCurveTheorem := by sorry