Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.1 — convex progressive hedging is bounded iff (P) and (D) have solutions, and then converges to such a pair, monotonically in ‖·‖_r

Proved
ProgHedging.Convex.theorem_5_1

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1progressive-hedgingproximal-pointstochastic-programming

Consider the progressive hedging algorithm in the convex case with exact minimization and a fixed r>0r>0r>0, started from an arbitrary policy X0X^0X0 and a price system W0∈MW^0\in\mathcal MW0∈M, and let X^ν=JXν\hat X^\nu=JX^\nuX^ν=JXν and WνW^\nuWν be the sequences it generates. Then:

  1. the sequences {X^ν}\{\hat X^\nu\}{X^ν} and {Wν}\{W^\nu\}{Wν} are bounded if and only if (P) and (D) both have optimal solutions;
  2. in that case there is a particular pair X∗X^*X∗ optimal for (P) and W∗W^*W∗ optimal for (D) such that
X^ν→X∗,Wν→W∗,\hat X^\nu\to X^*,\qquad W^\nu\to W^*,X^ν→X∗,Wν→W∗,

and, in terms of ∥(X,W)∥r=(∥X∥2+r−2∥W∥2)1/2\|(X,W)\|_r=(\|X\|^2+r^{-2}\|W\|^2)^{1/2}∥(X,W)∥r​=(∥X∥2+r−2∥W∥2)1/2, for every ν=0,1,2,…\nu=0,1,2,\dotsν=0,1,2,…

∥(X^ν+1,Wν+1)−(X∗,W∗)∥r≤∥(X^ν,Wν)−(X∗,W∗)∥r,\|(\hat X^{\nu+1},W^{\nu+1})-(X^*,W^*)\|_r\le\|(\hat X^\nu,W^\nu)-(X^*,W^*)\|_r,∥(X^ν+1,Wν+1)−(X∗,W∗)∥r​≤∥(X^ν,Wν)−(X∗,W∗)∥r​,

with strict inequality unless (X^ν,Wν)=(X∗,W∗)(\hat X^\nu,W^\nu)=(X^*,W^*)(X^ν,Wν)=(X∗,W∗), while for every ν=1,2,…\nu=1,2,\dotsν=1,2,…

∥(X^ν+1,Wν+1)−(X^ν,Wν)∥r≤∥(X^ν,Wν)−(X^ν−1,Wν−1)∥r.\|(\hat X^{\nu+1},W^{\nu+1})-(\hat X^\nu,W^\nu)\|_r\le\|(\hat X^\nu,W^\nu)-(\hat X^{\nu-1},W^{\nu-1})\|_r .∥(X^ν+1,Wν+1)−(X^ν,Wν)∥r​≤∥(X^ν,Wν)−(X^ν−1,Wν−1)∥r​.

This is the main convergence theorem for progressive hedging: every iteration strictly improves the distance to a primal–dual solution until one is reached, and boundedness of the iterates detects solvability.

Formalization Note. Boundedness and convergence of policy sequences use Mathlib's topology on S → EuclideanSpace ℝ (Fin n), which in finite dimension agrees with that of the norm ∥X∥=⟨X,X⟩1/2\|X\|=\langle X,X\rangle^{1/2}∥X∥=⟨X,X⟩1/2; the inequalities use ∥⋅∥r\|\cdot\|_r∥⋅∥r​ built from that weighted norm, never Mathlib's sup norm. The paper adds "i.e. there exist X∗X^*X∗ and W∗W^*W∗ satisfying the optimality conditions in Theorem 4.1, or equivalently the saddle point condition in Theorem 4.2"; that equivalence is the content of Theorems 4.2 and 4.6, and the theorem is stated with the printed condition, existence of optimal solutions of (P) and (D).

Preamble
import Mathlib
import Definitions.Def_ProgHedging_Convex_Problem
import Definitions.Def_ProgHedging_Convex_Duality
import Definitions.Def_ProgHedging_Convex_Algorithm
open scoped RealInnerProductSpace Pointwise Topology
open Filter
Formal statement
namespace ProgHedging.Convex

/-- Theorem 5.1, pp. 20–21. Progressive hedging in the convex case with exact minimization, from
arbitrary `X⁰` and `W⁰ ∈ ℳ`: the sequences `X̂^ν = J X^ν` and `W^ν` are bounded iff (P) and (D) both
have optimal solutions. In that case they converge to some optimal pair `(X*, W*)`, the distance to
it in `‖·‖_r` (5.2) does not increase (5.3), strictly unless `(X̂^ν, W^ν) = (X*, W*)`, and the step
lengths in `‖·‖_r` do not increase from `ν = 1` on (5.4). -/
theorem theorem_5_1 {S : Type*} [Fintype S] {n T : ℕ} (pr : Problem S n T)
    (hconv : pr.ConvexCase) {r : ℝ} (hr : 0 < r)
    (X W : ℕ → Policy S n) (hseq : pr.IsExactPHSeq r X W) :
    ((Bornology.IsBounded (Set.range fun ν => pr.J (X ν)) ∧ Bornology.IsBounded (Set.range W)) ↔
        ((∃ Xs, pr.SolvesP Xs) ∧ ∃ Ws, pr.SolvesD Ws)) ∧
    (((∃ Xs, pr.SolvesP Xs) ∧ ∃ Ws, pr.SolvesD Ws) →
      ∃ Xs Ws, pr.SolvesP Xs ∧ pr.SolvesD Ws ∧
        Tendsto (fun ν => pr.J (X ν)) atTop (𝓝 Xs) ∧ Tendsto W atTop (𝓝 Ws) ∧
        (∀ ν, pr.rnorm r (pr.J (X (ν + 1)) - Xs) (W (ν + 1) - Ws) ≤
              pr.rnorm r (pr.J (X ν) - Xs) (W ν - Ws) ∧
          ((pr.J (X ν), W ν) ≠ (Xs, Ws) →
            pr.rnorm r (pr.J (X (ν + 1)) - Xs) (W (ν + 1) - Ws) <
              pr.rnorm r (pr.J (X ν) - Xs) (W ν - Ws))) ∧
        ∀ ν, 1 ≤ ν →
          pr.rnorm r (pr.J (X (ν + 1)) - pr.J (X ν)) (W (ν + 1) - W ν) ≤
            pr.rnorm r (pr.J (X ν) - pr.J (X (ν - 1))) (W ν - W (ν - 1))) := by sorry

end ProgHedging.Convex
Source
Rockafellar and Wets, Scenarios and policy aggregation in optimization under uncertainty, IIASA Working Paper WP-87-119 (1987), pp. 20–21, Theorem 5.1, (5.1)–(5.4)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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