Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.2, p. 24 — for monotone α\alphaα-Lipschitz minorants on a compact set, f(xk)−fk(xk)→0f(x^k)-f^k(x^k)\to0f(xk)−fk(xk)→0 iff f(xk)−fk−κ(xk)→0f(x^k)-f^{k-\kappa}(x^k)\to0f(xk)−fk−κ(xk)→0

Proved
ConvexSDDP.Det.lemma_5_2

by mikedeng1 · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

convergenceconvex-analysislipschitzp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let X⊆Rd\mathcal X\subseteq\mathbb R^dX⊆Rd be compact, f:Rd→Rf:\mathbb R^d\to\mathbb Rf:Rd→R convex, α≥0\alpha\ge0α≥0, and (fk)k∈N(f^k)_{k\in\mathbb N}(fk)k∈N​ a sequence of convex α\alphaα-Lipschitz functions Rd→R\mathbb R^d\to\mathbb RRd→R. Fix an integer κ≥0\kappa\ge0κ≥0 and suppose

fk−κ(x)≤fk(x)≤f(x)for all x∈Xf^{k-\kappa}(x)\le f^k(x)\le f(x)\qquad\text{for all }x\in\mathcal Xfk−κ(x)≤fk(x)≤f(x)for all x∈X

(the left inequality for k≥κk\ge\kappak≥κ, the right one for all kkk). Then for every sequence (xk)(x^k)(xk) in X\mathcal XX,

lim⁡k→∞f(xk)−fk(xk)=0  ⟺  lim⁡k→∞f(xk)−fk−κ(xk)=0.\lim_{k\to\infty}f(x^k)-f^k(x^k)=0\iff\lim_{k\to\infty}f(x^k)-f^{k-\kappa}(x^k)=0.k→∞lim​f(xk)−fk(xk)=0⟺k→∞lim​f(xk)−fk−κ(xk)=0.

In the proof of Theorem 2.1 it is applied with κ=1\kappa=1κ=1, f=Vt+1f=V_{t+1}f=Vt+1​ and fk=Vt+1kf^k=V^k_{t+1}fk=Vt+1k​ to pass from the current approximation to the previous one (p. 12).

Formalization Note "For any integer κ\kappaκ" is a fixed κ∈N\kappa\in\mathbb Nκ∈N. In Lean k - κ is truncated subtraction, which differs from the page only for k<κk<\kappak<κ; the monotonicity hypothesis is required only for k≥κk\ge\kappak≥κ and no limit sees finitely many indices. The functions are real valued, as in the lemma; convexity is on all of Rd\mathbb R^dRd and the Lipschitz property is global (LipschitzWith α).

Preamble
import Mathlib
open Filter Topology
Formal statement
namespace ConvexSDDP.Det

theorem lemma_5_2 {d : ℕ} (X : Set (EuclideanSpace ℝ (Fin d))) (hX : IsCompact X)
    (f : EuclideanSpace ℝ (Fin d) → ℝ) (hf : ConvexOn ℝ Set.univ f)
    (fk : ℕ → EuclideanSpace ℝ (Fin d) → ℝ) (α : NNReal)
    (hfk : ∀ k, ConvexOn ℝ Set.univ (fk k) ∧ LipschitzWith α (fk k))
    (κ : ℕ) (hmono : ∀ k, κ ≤ k → ∀ y ∈ X, fk (k - κ) y ≤ fk k y)
    (hle : ∀ k, ∀ y ∈ X, fk k y ≤ f y)
    (xs : ℕ → EuclideanSpace ℝ (Fin d)) (hxs : ∀ k, xs k ∈ X) :
    Tendsto (fun k => f (xs k) - fk k (xs k)) atTop (𝓝 0) ↔
      Tendsto (fun k => f (xs k) - fk (k - κ) (xs k)) atTop (𝓝 0) := by sorry

end ConvexSDDP.Det
Source
Girardeau, Leclère & Philpott, On the Convergence of Decomposition Methods for Multistage Stochastic Convex Programs, author's version hal-01208295v1, p. 24, Lemma 5.2
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 10, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me