Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 10, proof of Theorem 2 — weak duality at feasible points

Proved
NonlinSSD.Optimality.weak_duality

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

lagrangian-dualityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-dominance

For any feasible pair (z,X)(z,X)(z,X) of (11)–(14), utilities ui∈U1([ai,bi])u_i\in\mathcal U_1([a_i,b_i])ui​∈U1​([ai​,bi​]), and essentially bounded multipliers θi≥0\theta_i\ge0θi​≥0 almost surely,

E[H(z)]≤L(z,X,u,θ).\mathbb E[H(z)]\le L(z,X,u,\theta).E[H(z)]≤L(z,X,u,θ).

This inequality is the comparison used in the sufficiency direction of Theorem 2.

Formalization Note Feasibility includes integrability of every XiX_iXi​, interval restricted dominance, and Xi≤Gi(z)X_i\le G_i(z)Xi​≤Gi​(z) almost surely. Essential boundedness and almost sure nonnegativity of θ\thetaθ make the product terms integrable and nonnegative in expectation.

Preamble
import Mathlib
import Definitions.Def_NonlinSSD_Optimality_Basic
Formal statement
namespace NonlinSSD.Optimality

open MeasureTheory

/-- p. 10, proof of Theorem 2 (converse): at a feasible point the Lagrangian
dominates the primal objective for every dual-feasible pair. -/
theorem weak_duality
    {Ω 𝒵 : Type*} [MeasurableSpace Ω]
    [AddCommGroup 𝒵] [Module ℝ 𝒵] [TopologicalSpace 𝒵]
    [IsTopologicalAddGroup 𝒵] [ContinuousSMul ℝ 𝒵]
    [LocallyConvexSpace ℝ 𝒵] [T2Space 𝒵]
    [TopologicalSpace.SeparableSpace 𝒵]
    {P : Measure Ω} [IsProbabilityMeasure P] {m : ℕ}
    (pr : Problem Ω 𝒵 P m) (z : 𝒵) (X : Fin m → Ω → ℝ)
    (u : Fin m → ℝ → ℝ) (θ : Fin m → Ω → ℝ)
    (hfeas : pr.Feasible z X)
    (hu : pr.UtilityAdmissible u)
    (hθ : pr.MultiplierAdmissible θ) :
    (∫ ω, pr.H z ω ∂P) ≤ pr.L z X u θ := by sorry

end NonlinSSD.Optimality
Source
Dentcheva, Ruszczyński, Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints, author manuscript (rev. April 2003; Math. Program. 2004, DOI 10.1007/s10107-003-0453-z), p. 10, proof of Theorem 2 (converse)
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