Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, p. 1214 — a median threshold earns half the expected maximum

Proved
SamuelCahnProphet.Median.theorem_1

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

independencemedianoptimal-stoppingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1prophet-inequalitythreshold-rule

Let X1,…,XnX_1,\ldots,X_nX1​,…,Xn​ be independent nonnegative random variables, n≥1n\ge1n≥1, let Xn∗=max⁡iXiX_n^*=\max_iX_iXn∗​=maxi​Xi​, and let mmm be a median of Xn∗X_n^*Xn∗​. Write β=∑iE(Xi−m)+\beta=\sum_iE(X_i-m)^+β=∑i​E(Xi​−m)+. Then both conditional conclusions hold:

β≥m  ⟹  EXn∗≤2E+Xs(m)≤2EXs(m),β≤m  ⟹  EXn∗≤2E+Xt(m)≤2EXt(m).\begin{aligned} \beta\ge m&\implies E X_n^*\le 2E^+X_{s(m)}\le2E X_{s(m)},\\ \beta\le m&\implies E X_n^*\le 2E^+X_{t(m)}\le2E X_{t(m)}. \end{aligned}β≥mβ≤m​⟹EXn∗​≤2E+Xs(m)​≤2EXs(m)​,⟹EXn∗​≤2E+Xt(m)​≤2EXt(m)​.​

Thus one of the two median threshold rules guarantees at least half the expected maximum, with the positive stopped reward explicitly retained.

Formalization Note Nonnegativity is almost sure, independence is mutual, and expectations take values in [0,∞][0,\infty][0,∞], so no integrability condition is imposed. Formalization Note Indices are zero based in Lean, so the paper's event s(m)>i−1s(m)>i-1s(m)>i−1 or t(m)>i−1t(m)>i-1t(m)>i−1 becomes i≤s(m)i\le s(m)i≤s(m) or i≤t(m)i\le t(m)i≤t(m). Expectations are extended nonnegative integrals, and the final observation is always taken if no earlier one crosses the threshold.

Preamble
import Mathlib
import Definitions.Def_SamuelCahnProphet_Median_Setting
Formal statement
namespace SamuelCahnProphet.Median

open MeasureTheory ProbabilityTheory

theorem theorem_1 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    {n : ℕ} [NeZero n] (X : Fin n → Ω → ℝ) (hXm : ∀ i, Measurable (X i))
    (hXnn : ∀ i, ∀ᵐ ω ∂P, 0 ≤ X i ω) (hind : iIndepFun X P) (m : ℝ)
    (hmed : IsMedian P (maxX X) m) :
    (ENNReal.ofReal m ≤ beta P X m →
      (∫⁻ ω, ENNReal.ofReal (maxX X ω) ∂P) ≤ 2 * EplusS P X m ∧
      2 * EplusS P X m ≤ 2 * expStop P X (sRule X m)) ∧
    (beta P X m ≤ ENNReal.ofReal m →
      (∫⁻ ω, ENNReal.ofReal (maxX X ω) ∂P) ≤ 2 * EplusT P X m ∧
      2 * EplusT P X m ≤ 2 * expStop P X (tRule X m)) := by sorry
end SamuelCahnProphet.Median
Source
Samuel-Cahn, Comparison of threshold stop rules and maximum for independent nonnegative random variables, Ann. Probab. 12 (1984), p. 1214, Theorem 1
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