Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 6.1 — X* is δ′-locally optimal for F(X) + ½r‖X − X*‖² = E{f̃_s(X(s))} over 𝒞 ∩ 𝒩

Proved
ProgHedging.Nonconvex.local_opt_tilde

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

local-optimalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1progressive-hedging

Let r>0r>0r>0, δ>0\delta>0δ>0, and let (Xν)(X^\nu)(Xν), (Wν)(W^\nu)(Wν) be a run of progressive hedging with δ\deltaδ-locally optimal subproblem solutions, with Xν→X∗X^\nu\to X^*Xν→X∗ and Wν→W∗W^\nu\to W^*Wν→W∗. Let δ′=δmin⁡sps1/2\delta'=\delta\min_s p_s^{1/2}δ′=δmins​ps1/2​ and f~s(x)=fs(x)+12r∣x−X∗(s)∣2\tilde f_s(x)=f_s(x)+\tfrac12 r|x-X^*(s)|^2f~​s​(x)=fs​(x)+21​r∣x−X∗(s)∣2. Then

  1. F(X∗)≤F(X)+12r∥X−X∗∥2F(X^*)\le F(X)+\tfrac12 r\|X-X^*\|^2F(X∗)≤F(X)+21​r∥X−X∗∥2 for all X∈C∩NX\in\mathcal C\cap\mathcal NX∈C∩N with ∥X−X∗∥<δ′\|X-X^*\|<\delta'∥X−X∗∥<δ′;
  2. for every policy XXX,
F(X)+12r∥X−X∗∥2=∑s∈Sps f~s(X(s))=E{f~s(X(s))}.F(X)+\tfrac12 r\|X-X^*\|^2=\sum_{s\in S}p_s\,\tilde f_s(X(s))=E\{\tilde f_s(X(s))\}.F(X)+21​r∥X−X∗∥2=s∈S∑​ps​f~​s​(X(s))=E{f~​s​(X(s))}.

Together these say that X∗X^*X∗ is a local minimizer of the modified problem (P~)(\tilde P)(P~), in which each fsf_sfs​ is replaced by f~s\tilde f_sf~​s​.

Formalization Note As in (6.6), the paper's closed ball ∥X−X∗∥≤δ′\|X-X^*\|\le\delta'∥X−X∗∥≤δ′ is replaced by the open ball; see the note on (6.6) for why the closed-ball version can fail. ∥⋅∥\|\cdot\|∥⋅∥ is the weighted norm (pnorm).

Preamble
import Mathlib
import Definitions.Def_ProgHedging_Convex_Problem
import Definitions.Def_ProgHedging_Nonconvex_Algorithm
import Definitions.Def_ClarkeGradients_Shared_generalizedGradient
import Definitions.Def_ClarkeGradients_FlowInvariance_normalCone

open Filter Topology
Formal statement
namespace ProgHedging.Nonconvex

/-- Proof of Theorem 6.1, p. 31: `X*` is `δ′`-locally optimal (open `δ′`-ball of the norm (2.3))
for minimizing `F(X) + ½r‖X − X*‖² = E{f̃_s(X(s))}` over `𝒞 ∩ 𝒩`, and that identity holds. -/
theorem local_opt_tilde {S : Type*} [Fintype S] {n T : ℕ} (pr : Problem S n T) {r δ : ℝ}
    (hr : 0 < r) (hδ : 0 < δ) (X W : ℕ → ProgHedging.Convex.Policy S n) (hseq : pr.IsLocalPHSeq r δ X W)
    (Xs Ws : ProgHedging.Convex.Policy S n) (hX : Tendsto X atTop (𝓝 Xs)) (hW : Tendsto W atTop (𝓝 Ws)) :
    (∀ Y ∈ pr.adm ∩ pr.N, pr.pnorm (Y - Xs) < pr.deltaPrime δ →
      pr.F Xs ≤ pr.F Y + r / 2 * pr.pnorm (Y - Xs) ^ 2) ∧
    ∀ Y : ProgHedging.Convex.Policy S n, pr.F Y + r / 2 * pr.pnorm (Y - Xs) ^ 2 = ∑ s, pr.p s * pr.fTilde r Xs s (Y s) := by sorry

end ProgHedging.Nonconvex
Source
Rockafellar and Wets, Scenarios and policy aggregation in optimization under uncertainty, IIASA Working Paper WP-87-119 (1987), p. 31, proof of Theorem 6.1, last paragraph
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