Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sect. 7.1, p. 25 — moment equations for all sample sizes

Proved
WaitJudge.Generic.moment_conditions

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1scenario-optimizationsupport-constraintswait-and-judge

For every generic scenario program satisfying Assumptions 1–2 and the stated measurability convention, the generalized distribution measures F_k obey, for every nonnegative integer m,

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

These equations express the total probability of all support counts and constrain the infinite family F_0,F_1,… used in the primal moment problem.

Formalization Note The paper's Stieltjes integral is represented by integration against F_k. The sample size m includes zero. The hypotheses include Assumptions 1–2 and the three measurability pins.

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

open MeasureTheory

theorem moment_conditions
    {S Δ : Type*} [Nonempty S] [MeasurableSpace S] [MeasurableSpace Δ]
    (P : Measure Δ) [IsProbabilityMeasure P]
    (f : S → ℝ) (X : Set S) (Xδ : Δ → Set S)
    {p : ℕ} (tb : Fin p → S → ℝ)
    (hA1 : Assumption1 f X Xδ tb)
    (hA2 : Assumption2 f X Xδ tb P)
    (hmeas : MeasurabilityPins f X Xδ tb) :
    ∀ m : ℕ, ∑ k ∈ Finset.range (m + 1), (m.choose k : ℝ) *
      ∫ v in Set.Icc (0 : ℝ) 1, (1 - v) ^ (m - k) ∂(Fk f X Xδ tb P k) =
      1 := 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 p. 25, Sect. 7.1, display before (34)
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