Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, p. 1459 — nonadaptive thresholds attain (1 − 1/e) E[max_i X_i]

Proved
CorreaThreshold.Nonadaptive.theorem_1

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

independencep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1prophet-inequalityprophet-secretarythreshold-rule

Let X1,…,XnX_1,\ldots,X_nX1​,…,Xn​ be independent nonnegative random variables, with n≥1n\ge1n≥1. There exist fixed thresholds τ1,…,τn∈[0,∞]\tau_1,\ldots,\tau_n\in[0,\infty]τ1​,…,τn​∈[0,∞] such that, writing Yi=1{Xi>τi}Y_i=\mathbf1_{\{X_i>\tau_i\}}Yi​=1{Xi​>τi​}​,

E ⁣[∑iXiYi∑iYi]≥(1−1e)E ⁣[max⁡iXi],0/0:=0.\mathbb E\!\left[\frac{\sum_i X_iY_i}{\sum_iY_i}\right]\ge\left(1-\frac1e\right)\mathbb E\!\left[\max_i X_i\right],\qquad 0/0:=0.E[∑i​Yi​∑i​Xi​Yi​​]≥(1−e1​)E[imax​Xi​],0/0:=0.

Under uniformly random arrival, the left side is the expected prize of taking the first observation above its assigned threshold. The theorem gives the paper's guarantee for nonadaptive stopping.

Formalization Note Indices are 0-based. Nonnegativity is assumed almost surely, a distributionally equivalent version of the paper's nonnegative random variables. The thresholds are chosen before seeing the sample, may equal ∞\infty∞, and use strict acceptance. Both expectations are extended nonnegative integrals, so heavy-tailed variables remain in scope. The statement covers atoms and makes no continuity assumption.

Preamble
import Mathlib
import Definitions.Def_CorreaThreshold_Nonadaptive_Setting
Formal statement
namespace CorreaThreshold.Nonadaptive

open MeasureTheory ProbabilityTheory

/-- Theorem 1: deterministic nonadaptive thresholds attain `1 - 1/e` of the prophet's reward. -/
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) :
    ∃ τ : Fin n → ENNReal,
      ENNReal.ofReal (1 - Real.exp (-1)) *
        (∫⁻ ω, ENNReal.ofReal (SamuelCahnProphet.Median.maxX X ω) ∂P) ≤
      (∫⁻ ω, ENNReal.ofReal (ratio τ X ω) ∂P) := by sorry

end CorreaThreshold.Nonadaptive
Source
Correa, Foncea, Hoeksma, Oosterwijk, Vredeveld, Posted price mechanisms and optimal threshold strategies for random arrivals, Math. Oper. Res. 46 (2021), p. 1459, Theorem 1 (first stated p. 1455); https://doi.org/10.1287/moor.2020.1105
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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