Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(37), pp. 25–26 — weak duality with M=N

Proved
WaitJudge.Generic.weak_duality_N

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

dualitymoment-problemp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1scenario-optimization

Fix N and thresholds ε(k)∈[0,1]. Let μ_k be finite nonnegative measures whose first N+1 moment equations agree with the truncated primal problem (35). Let λ_0,…,λ_N satisfy the pointwise dual inequalities (36) with M=N. Then

∑k=0N(Nk)∫(ε(k),1](1−v)N−k dμk(v)≤∑m=0Nλm.\sum_{k=0}^{N}{N\choose k}\int_{(\varepsilon(k),1]}(1-v)^{N-k}\,d\mu_k(v) \le \sum_{m=0}^{N}\lambda_m.k=0∑N​(kN​)∫(ε(k),1]​(1−v)N−kdμk​(v)≤m=0∑N​λm​.

This is the finite weak-duality inequality used to pass from the distributional representation of the violation probability to the dual value γ*_N.

Formalization Note The dual variable is a function on natural numbers, but only indices at most N occur. The dual inequalities use t=1−v, so v∈(ε(k),1] becomes t∈[0,1−ε(k)). Finiteness of the measures ensures the displayed real integrals have their intended values.

Preamble
import Mathlib
import Definitions.Def_WaitJudge_Generic_Setting
Formal statement
namespace WaitJudge.Generic

open MeasureTheory

theorem weak_duality_N
    (N : ℕ) (ε : ℕ → ℝ)
    (hε : ∀ k ≤ N, 0 ≤ ε k ∧ ε k ≤ 1)
    (μ : ℕ → Measure ℝ)
    (hfinite : ∀ k ≤ N, μ k Set.univ < ⊤)
    (hmoment : ∀ m ≤ N,
      ∑ k ∈ Finset.range (m + 1), (m.choose k : ℝ) *
        ∫ v in Set.Icc (0 : ℝ) 1, (1 - v) ^ (m - k) ∂(μ k) = 1)
    (lam : ℕ → ℝ) (hdual : IsFeasibleDualN N ε lam) :
    ∑ k ∈ Finset.range (N + 1), (N.choose k : ℝ) *
      ∫ v in Set.Ioc (ε k) 1, (1 - v) ^ (N - k) ∂(μ k) ≤
    ∑ m ∈ Finset.range (N + 1), lam m := by sorry

end WaitJudge.Generic
Source
Campi & Garatti, Wait-and-judge scenario optimization, Math. Program. (2018), doi:10.1007/s10107-016-1056-9 (accepted manuscript), PDF pp. 25–26, (35)–(37), specialized to M=N
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