Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 4.1 — Kim's coefficients (25) with ai=2(i−1)iN2a_i=\frac{2(i-1)i}{N^2}ai​=N22(i−1)i​, bN=2Nb_N=\frac2NbN​=N2​, c=1N2c=\frac1{N^2}c=N21​ are feasible for (D)

Proved
AccelPPM.FPR.lemma4_1_dual_feasible

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1performance-estimationproximal-point-methodsemidefinite-programming

Let N≥1N\ge1N≥1. Take Kim's step coefficients

hi,k={−2ki(i+1),k=1,…,i−1,2ii+1,k=i,i=1,…,N−1,h_{i,k}=\begin{cases}-\dfrac{2k}{i(i+1)}, & k=1,\dots,i-1,\\[2mm] \dfrac{2i}{i+1}, & k=i,\end{cases}\qquad i=1,\dots,N-1,hi,k​=⎩⎨⎧​−i(i+1)2k​,i+12i​,​k=1,…,i−1,k=i,​i=1,…,N−1,

and the dual variables

ai=2(i−1)iN2 (i=2,…,N),bN=2N,c=1N2.a_i=\frac{2(i-1)i}{N^2}\ (i=2,\dots,N),\qquad b_N=\frac2N,\qquad c=\frac1{N^2}.ai​=N22(i−1)i​ (i=2,…,N),bN​=N2​,c=N21​.

Then (a2,…,aN,bN,c)(a_2,\dots,a_N,b_N,c)(a2​,…,aN​,bN​,c) is a feasible point of the dual problem (D) for hhh: all dual variables are nonnegative and

∑i=2NaiAi−1,i(h)+bNBN(h)+cC−uNuN⊤⪰0.\sum_{i=2}^{N}a_iA_{i-1,i}(h)+b_NB_N(h)+cC-u_Nu_N^\top\succeq0 .i=2∑N​ai​Ai−1,i​(h)+bN​BN​(h)+cC−uN​uN⊤​⪰0.

Consequently (h;a,bN,c)(h;a,b_N,c)(h;a,bN​,c) is a feasible point of the joint problem (HD) =min⁡hBD(h)=\min_h\mathcal B_D(h)=minh​BD​(h), and BD(h)≤1/N2\mathcal B_D(h)\le1/N^2BD​(h)≤1/N2.

This dual certificate is the source of the accelerated O(1/N2)O(1/N^2)O(1/N2) rate of the fixed-point residual.

Formalization Note A feasible point of (HD) is a pair (hhh, dual variables) feasible for (D), so the single statement IsDualFeasible N kimCoeff a b c covers both halves of "a feasible point of (D) and (HD)". aia_iai​ is the function fun i => 2 * ((i:ℝ) - 1) * i / N^2, with iii cast to R\mathbb RR before subtracting; only i=2,…,Ni=2,\dots,Ni=2,…,N is read.

Preamble
import Mathlib
import Definitions.Def_AccelPPM_FPR_kimCoeff
import Definitions.Def_AccelPPM_FPR_boundBD
Formal statement
namespace AccelPPM.FPR

/-- **Lemma 4.1** (Kim, arXiv:1905.05149v4, p. 8). For every `N ≥ 1`, the step coefficients
`h = (25)` (`kimCoeff`) together with the dual variables (26),
`a_i = 2(i − 1)i/N²` (`i = 2, …, N`), `b_N = 2/N`, `c = 1/N²`,
form a feasible point of the dual problem (D), hence (with `h`) of (HD). -/
theorem lemma4_1_dual_feasible (N : ℕ) (hN : 1 ≤ N) :
    IsDualFeasible N kimCoeff (fun i => 2 * ((i : ℝ) - 1) * (i : ℝ) / (N : ℝ) ^ 2)
      (2 / (N : ℝ)) (1 / (N : ℝ) ^ 2) := by sorry

end AccelPPM.FPR
Source
Kim, Accelerated proximal point method for maximally monotone operators, arXiv:1905.05149v4, p. 8, Lemma 4.1 (Eqs. (25), (26))
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me