Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2, p. 1215 — "because of Theorem 1": EX*ₙ ≤ 2 sup_{t∈T*ₙ} E⁺X_t for i.i.d. Xᵢ ≥ 0

Proved
SamuelCahnProphet.IID.upper_bound

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

iidp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1prophet-inequalitythreshold-rule

Let n≥1n \ge 1n≥1 and let X1,…,XnX_1, \dots, X_nX1​,…,Xn​ be i.i.d. nonnegative random variables with common law μ\muμ, a probability measure on [0,∞)[0, \infty)[0,∞). Let Tn∗T_n^*Tn∗​ be the class of threshold rules t(c)t(c)t(c), s(c)s(c)s(c) with c≥0c \ge 0c≥0. Then

EXn∗≤2sup⁡t∈Tn∗E+Xt.EX_n^* \le 2 \sup_{t \in T_n^*} E^+X_t .EXn∗​≤2t∈Tn∗​sup​E+Xt​.

This is the upper half of Theorem 2, which the proof attributes to Theorem 1 (p. 1214). It is the i.i.d. case of the goal of the companion mission I of this series.

Formalization Note. The i.i.d. variables are the coordinates of Rn\mathbb R^nRn under the product measure μ⊗n\mu^{\otimes n}μ⊗n, the standard model of an i.i.d. sample; every quantity involved depends only on the joint law. "Nonnegative" is μ((−∞,0))=0\mu((-\infty, 0)) = 0μ((−∞,0))=0. Expectations are in [0,∞][0, \infty][0,∞], so the bound also covers EXn∗=∞EX_n^* = \inftyEXn∗​=∞.

Preamble
import Mathlib
import Definitions.Def_SamuelCahnProphet_IID_Setting

open MeasureTheory Filter Topology
Formal statement
namespace SamuelCahnProphet.IID

theorem upper_bound (n : ℕ) [NeZero n] (μ : Measure ℝ) [IsProbabilityMeasure μ]
    (hμ : μ (Set.Iio 0) = 0) :
    Emax μ n ≤ 2 * supEplus μ n := by sorry

end SamuelCahnProphet.IID
Source
Samuel-Cahn, Comparison of threshold stop rules and maximum for independent nonnegative random variables, Ann. Probab. 12 (1984), p. 1215, proof of Theorem 2, first sentence ("Because of Theorem 1"); Theorem 1, p. 1214
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