Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1, p. 7 — weighted PHA prices sum to zero in every iteration

Proved
PHLowerBound.TwoStage.price_invariant

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

dual-feasibilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1progressive-hedgingstochastic-programming

Consider a finite-support two-stage stochastic mixed-integer program with scenario probabilities pξ>0p_\xi>0pξ​>0 summing to one. Let (xν,yν,x^ν,wν)(x^\nu,y^\nu,\hat x^\nu,w^\nu)(xν,yν,x^ν,wν) be a run of Algorithm 1 through iteration NNN. Then the prices satisfy

∑ξ∈Ξpξwν(ξ)=0(0≤ν≤N).\sum_{\xi\in\Xi}p_\xi w^\nu(\xi)=0\qquad(0\le\nu\le N).ξ∈Ξ∑​pξ​wν(ξ)=0(0≤ν≤N).

This invariant supplies the dual-feasibility condition used to turn scenario subproblem values into lower bounds. It includes the zero initial prices at ν=0\nu=0ν=0.

Formalization Note The assertion does not require the paper's separate assumptions that every X(ξ)X(\xi)X(ξ) is nonempty and that the original SMIP attains its optimum; the stated run already records its own minimizers. No sign restriction on ρ\rhoρ is imposed.

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

attribute [local instance] Classical.decEq

theorem price_invariant {Ξ : Type*} [Fintype Ξ]
    {n₁ p₁ n₂ p₂ m₁ m₂ : ℕ} (P : SMIP Ξ n₁ p₁ n₂ p₂ m₁ m₂)
    (ρ : ℝ) (x : ℕ → Ξ → Fin n₁ → ℝ) (y : ℕ → Ξ → Fin n₂ → ℝ)
    (xhat : ℕ → Fin n₁ → ℝ) (w : ℕ → Ξ → Fin n₁ → ℝ)
    (N : ℕ) (hrun : P.IsPHARun ρ x y xhat w N) :
    ∀ ν ≤ N, ∑ ξ, P.p ξ • w ν ξ = 0 := 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
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