Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(5.26) — one exact iteration is firmly nonexpansive in ‖·‖_r on 𝒩 × ℳ (proof of Theorem 5.1)

Proved
ProgHedging.Convex.eq_5_26

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

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

Assume the convex case and r>0r>0r>0. Let (V,W),(V′,W′)∈N×M(V,W),(V',W')\in\mathcal N\times\mathcal M(V,W),(V′,W′)∈N×M, and let one exact iteration of progressive hedging take (V,W)(V,W)(V,W) to (V1,W1)(V_1,W_1)(V1​,W1​) and (V′,W′)(V',W')(V′,W′) to (V1′,W1′)(V_1',W_1')(V1′​,W1′​). Then

∥(V1′,W1′)−(V1,W1)∥r2+∥((V′,W′)−(V1′,W1′))−((V,W)−(V1,W1))∥r2≤∥(V′,W′)−(V,W)∥r2,\|(V_1',W_1')-(V_1,W_1)\|_r^2+\bigl\|\bigl((V',W')-(V_1',W_1')\bigr)-\bigl((V,W)-(V_1,W_1)\bigr)\bigr\|_r^2\le\|(V',W')-(V,W)\|_r^2,∥(V1′​,W1′​)−(V1​,W1​)∥r2​+​((V′,W′)−(V1′​,W1′​))−((V,W)−(V1​,W1​))​r2​≤∥(V′,W′)−(V,W)∥r2​,

where ∥(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.

This is the firm nonexpansiveness of the iteration map, from which the monotonicity statements (5.3) and (5.4) of Theorem 5.1 follow.

Formalization Note. The paper states (5.26) for Mr=(I+Tr)−1M_r=(I+T_r)^{-1}Mr​=(I+Tr​)−1 acting on Z=(V,Wˉ)Z=(V,\bar W)Z=(V,Wˉ) with Wˉ=r−1W\bar W=r^{-1}WWˉ=r−1W, in the norm ∥(V,Wˉ)∥=(∥V∥2+∥Wˉ∥2)1/2\|(V,\bar W)\|=(\|V\|^2+\|\bar W\|^2)^{1/2}∥(V,Wˉ)∥=(∥V∥2+∥Wˉ∥2)1/2. By (5.5)–(5.7) and (5.22), Mr(V,r−1W)=(V1,r−1W1)M_r(V,r^{-1}W)=(V_1,r^{-1}W_1)Mr​(V,r−1W)=(V1​,r−1W1​) exactly when one exact iteration takes (V,W)(V,W)(V,W) to (V1,W1)(V_1,W_1)(V1​,W1​), and ∥(X,Wˉ)∥=∥(X,W)∥r\|(X,\bar W)\|=\|(X,W)\|_r∥(X,Wˉ)∥=∥(X,W)∥r​; the statement above is (5.26) in these original variables. The operator TrT_rTr​ itself is not introduced.

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

/-- (5.26), proof of Theorem 5.1, p. 23, in the original variables. In the convex case with
`r > 0`, let one exact iteration take `(V, W) ∈ 𝒩 × ℳ` to `(V₁, W₁)` and `(V', W') ∈ 𝒩 × ℳ` to
`(V₁', W₁')`. Then, in the norm `‖·‖_r` of (5.2),
`‖(V₁', W₁') − (V₁, W₁)‖_r² + ‖((V', W') − (V₁', W₁')) − ((V, W) − (V₁, W₁))‖_r² ≤ ‖(V', W') − (V, W)‖_r²`. -/
theorem eq_5_26 {S : Type*} [Fintype S] {n T : ℕ} (pr : Problem S n T)
    (hconv : pr.ConvexCase) {r : ℝ} (hr : 0 < r)
    (V W V' W' V₁ W₁ V₁' W₁' : Policy S n)
    (hV : V ∈ pr.N) (hW : W ∈ pr.M) (hV' : V' ∈ pr.N) (hW' : W' ∈ pr.M)
    (hstep : pr.IsStep r V W V₁ W₁) (hstep' : pr.IsStep r V' W' V₁' W₁') :
    pr.rnorm r (V₁' - V₁) (W₁' - W₁) ^ 2 +
        pr.rnorm r ((V' - V₁') - (V - V₁)) ((W' - W₁') - (W - W₁)) ^ 2 ≤
      pr.rnorm r (V' - V) (W' - W) ^ 2 := by sorry

end ProgHedging.Convex
Source
Rockafellar and Wets, Scenarios and policy aggregation in optimization under uncertainty, IIASA Working Paper WP-87-119 (1987), p. 23, (5.26) in the proof of Theorem 5.1, with (5.5)–(5.7) p. 21 and (5.22)–(5.23)
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