Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (3.2), p. 23 — the expected minimum of n independent uniforms on [0, 1] is 1/(n + 1)

Proved
RobustPower.CostGap.eq_3_2_expected_min_uniform

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

order-statisticsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let n≥1n\ge1n≥1, let (Ω,μ)(\Omega,\mu)(Ω,μ) be a probability space and let d=(d1,…,dn):Ω→Rnd=(d_1,\dots,d_n):\Omega\to\mathbb R^nd=(d1​,…,dn​):Ω→Rn be a measurable map whose coordinates are independent and each uniformly distributed on [0,1][0,1][0,1], that is, the law of ddd under μ\muμ is the product of nnn copies of the uniform distribution on [0,1][0,1][0,1]. Then

Eμ[min⁡(d1(ω),…,dn(ω))]=1n+1.\mathbb E_\mu\bigl[\min\bigl(d_1(\omega),\dots,d_n(\omega)\bigr)\bigr]=\frac{1}{n+1}.Eμ​[min(d1​(ω),…,dn​(ω))]=n+11​.

This is the computational core of Theorem 3.1: together with Eq. (3.1) it gives zStoch(b,d)≤1/(n+1)z_{\mathrm{Stoch}}(b,d)\le1/(n+1)zStoch​(b,d)≤1/(n+1). The paper calls (3.2) an inequality; it is the equality stated here.

Formalization Note The minimum of the coordinates is written as the infimum over the finite nonempty index set {1,…,n}\{1,\dots,n\}{1,…,n}, which is attained; the hypothesis n≥1n\ge1n≥1 excludes the empty index set.

Preamble
import Mathlib

open MeasureTheory
Formal statement
namespace RobustPower.CostGap

/-- Eq. (3.2), p. 23: if the coordinates of `d(ω)` are independent and uniform on `[0, 1]`, then
`E_μ[min(d₁(ω), …, dₙ(ω))] = 1/(n + 1)`. -/
theorem eq_3_2_expected_min_uniform {n : ℕ} (hn : 0 < n)
    {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) [IsProbabilityMeasure μ]
    (d : Ω → Fin n → ℝ) (hd : Measurable d)
    (hlaw : μ.map d = Measure.pi (fun _ : Fin n => volume.restrict (Set.Icc (0 : ℝ) 1))) :
    ∫ ω, (⨅ j, d ω j) ∂μ = 1 / ((n : ℝ) + 1) := by sorry

end RobustPower.CostGap
Source
Bertsimas & Goyal, On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems, authors' manuscript (MIT DSpace) of Math. Oper. Res. DOI 10.1287/moor.1090.0440, p. 23, proof of Theorem 3.1, Eq. (3.2)
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