Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1 — every PHA price vector yields a lower bound

Proved
PHLowerBound.TwoStage.pha_lower_bound

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

lagrangian-dualitylower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1progressive-hedgingstochastic-programming

Let a finite-support two-stage SMIP have a feasible, attained finite optimum z∗z^*z∗ and nonempty scenario sets X(ξ)X(\xi)X(ξ). Run Algorithm 1 through any iteration N≥1N\ge1N≥1, starting with zero prices and using its exact scenario minimizers, aggregation, and price updates. Its scenario dual bound satisfies

D(wN)=∑ξ∈Ξpξinf⁡(x,y)∈X(ξ)(c⊤x+g(ξ)⊤y+wN(ξ)⊤x)≤z∗.D(w^N)=\sum_{\xi\in\Xi}p_\xi\inf_{(x,y)\in X(\xi)}\bigl(c^\top x+g(\xi)^\top y+w^N(\xi)^\top x\bigr)\le z^*.D(wN)=ξ∈Ξ∑​pξ​(x,y)∈X(ξ)inf​(c⊤x+g(ξ)⊤y+wN(ξ)⊤x)≤z∗.

Thus a lower bound on the optimal cost is available after every completed price update of progressive hedging, regardless of whether its first-stage scenario decisions have converged.

Formalization Note A finite run prefix records all of Algorithm 1's exact minimization clauses through NNN. Its final price vector is computed at iteration NNN; Step 6 can stop the run there. The page does not restrict the sign of ρ\rhoρ, and neither does the theorem.

Preamble
import Mathlib
import Definitions.Def_PHLowerBound_TwoStage_Setting
Formal statement
namespace PHLowerBound.TwoStage

attribute [local instance] Classical.decEq

theorem pha_lower_bound {Ξ : Type*} [Fintype Ξ]
    {n₁ p₁ n₂ p₂ m₁ m₂ : ℕ} (P : SMIP Ξ n₁ p₁ n₂ p₂ m₁ m₂)
    (hX : ∀ ξ, (P.X ξ).Nonempty) (hopt : P.HasOptimalSolution)
    (ρ : ℝ) (x : ℕ → Ξ → Fin n₁ → ℝ) (y : ℕ → Ξ → Fin n₂ → ℝ)
    (xhat : ℕ → Fin n₁ → ℝ) (w : ℕ → Ξ → Fin n₁ → ℝ)
    (N : ℕ) (hN : 1 ≤ N) (hrun : P.IsPHARun ρ x y xhat w N) :
    P.D (w N) ≤ P.zStar := by sorry

end PHLowerBound.TwoStage
Source
Gade et al., Obtaining Lower Bounds from the Progressive Hedging Algorithm for Stochastic Mixed-Integer Programs, author manuscript SAND2013-9195J (OSTI 1310314), p. 7, §3.1, paragraph after Proposition 1, with p. 6, Proposition 1
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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