Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(1.3), p. 1214 — expected maximum bounded by threshold excess

Proved
SamuelCahnProphet.Median.eq_1_3

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

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

For any real mmm and a nonempty finite family of measurable observations X1,…,XnX_1,\ldots,X_nX1​,…,Xn​ on a probability space, let Xn∗=max⁡iXiX_n^*=\max_i X_iXn∗​=maxi​Xi​ and β(m)=∑iE(Xi−m)+\beta(m)=\sum_i E(X_i-m)^+β(m)=∑i​E(Xi​−m)+. Then

EXn∗≤m++E(Xn∗−m)+≤m++β(m).E X_n^*\le m^+ + E(X_n^*-m)^+\le m^+ + \beta(m).EXn∗​≤m++E(Xn∗​−m)+≤m++β(m).

Here the expectations are extended nonnegative expectations of positive parts; when m≥0m\ge0m≥0, the display is exactly the paper's (1.3). The bound supplies the upper estimate on the prophet's expected reward.

Formalization Note The statement allows arbitrary real mmm; m+m^+m+ is the extended nonnegative representation of the paper's mmm, which is nonnegative when mmm is a median of nonnegative observations. Neither independence nor observation nonnegativity is needed for this inequality.

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

open MeasureTheory ProbabilityTheory

theorem eq_1_3 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    {n : ℕ} [NeZero n] (X : Fin n → Ω → ℝ) (hXm : ∀ i, Measurable (X i)) (m : ℝ) :
    (∫⁻ ω, ENNReal.ofReal (maxX X ω) ∂P) ≤
        ENNReal.ofReal m + ∫⁻ ω, ENNReal.ofReal (maxX X ω - m) ∂P ∧
    ENNReal.ofReal m + (∫⁻ ω, ENNReal.ofReal (maxX X ω - m) ∂P) ≤
        ENNReal.ofReal m + beta P 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, (1.3)
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