Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(18), Sect. 5.1.2, p. 15 — moment conditions Σ_{k≤min{m,d}} C(m,k) ∫_[0,1] (1−v)^(m−k) dF_k(v) = 1

Proved
WaitJudge.Convex.moment_conditions

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

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

Consider a convex scenario problem: X\mathcal XX, every Xδ\mathcal X_\deltaXδ​ and the tie-break functions are convex, P\mathbb PP is a probability measure, and Assumptions 1 and 2 and the measurability conditions hold. Then the generalized distribution functions F0,…,FdF_0,\dots,F_dF0​,…,Fd​ of (12) satisfy, for every m=0,1,2,…m=0,1,2,\dotsm=0,1,2,…,

∑k=0min⁡{m,d}(mk)∫[0,1](1−v)m−k dFk(v)=1.\sum_{k=0}^{\min\{m,d\}}\binom mk\int_{[0,1]}(1-v)^{m-k}\,\mathrm dF_k(v)=1.k=0∑min{m,d}​(km​)∫[0,1]​(1−v)m−kdFk​(v)=1.

These infinitely many moment equations are necessary conditions on the (d+1)(d+1)(d+1)-tuples (F0,…,Fd)(F_0,\dots,F_d)(F0​,…,Fd​) that can arise from a convex scenario problem. They are the constraints of the generalized moment problem (19) whose value bounds PN{V(xN∗)>ϵ(sN∗)}\mathbb P^N\{V(x^*_N)>\epsilon(s^*_N)\}PN{V(xN∗​)>ϵ(sN∗​)}.

Formalization Note FkF_kFk​ is a finite measure on R\mathbb RR and the integral is over the closed interval [0,1][0,1][0,1]. The identity is stated for every mmm, with no relation between mmm and ddd assumed.

Preamble
import Mathlib
import Definitions.Def_ScenarioApproach_Generalization_violation
import Definitions.Def_WaitJudge_Convex_Setting

open MeasureTheory ScenarioApproach.Generalization
Formal statement
namespace WaitJudge.Convex

theorem moment_conditions {d p : ℕ} {Δ : Type*} [MeasurableSpace Δ] (P : Measure Δ) [IsProbabilityMeasure P]
    (c : E d) (X : Set (E d)) (Xδ : Δ → Set (E d)) (tb : Fin p → E d → ℝ)
    (hX : Convex ℝ X) (hXδ : ∀ δ, Convex ℝ (Xδ δ))
    (htb : ∀ j, ConvexOn ℝ Set.univ (tb j))
    (hA1 : Assumption1 c X Xδ tb) (hA2 : Assumption2 c X Xδ tb P)
    (hmeas : MeasurabilityPins c X Xδ tb) :
    ∀ m : ℕ, ∑ k ∈ Finset.range (min m d + 1),
      (m.choose k : ℝ) * ∫ v in Set.Icc 0 1, (1 - v) ^ (m - k) ∂(Fk P c X Xδ tb k) = 1 := by sorry

end WaitJudge.Convex
Source
Campi & Garatti, Wait-and-judge scenario optimization, Math. Program. (2018), doi:10.1007/s10107-016-1056-9 (accepted manuscript), PDF p. 15, Sect. 5.1.2, (18)
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