Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(1.4), first equality — strict-threshold reward split

Proved
SamuelCahnProphet.Median.eq_1_4_first

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

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

Let m≥0m\ge0m≥0. For measurable observations X1,…,XnX_1,\ldots,X_nX1​,…,Xn​, let s(m)s(m)s(m) be the first index before nnn with Xi>mX_i>mXi​>m, or nnn otherwise, and let p=P(Xn∗>m)p=P(X_n^*>m)p=P(Xn∗​>m). Then

E+Xs(m)=mp+E(Xs(m)−m)+.E^+X_{s(m)}=mp+E(X_{s(m)}-m)^+.E+Xs(m)​=mp+E(Xs(m)​−m)+.

This separates the threshold level from the excess reward in (1.4).

Formalization Note The paper obtains m≥0m\ge0m≥0 from its nonnegative observations and median condition; the identity states just that necessary sign condition. 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 eq_1_4_first {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    {n : ℕ} [NeZero n] (X : Fin n → Ω → ℝ) (hXm : ∀ i, Measurable (X i))
    (m : ℝ) (hm : 0 ≤ m) :
    EplusS P X m = ENNReal.ofReal m * P {ω | m < maxX X ω} +
      ∫⁻ ω, ENNReal.ofReal (X (sRule X m ω) ω - m) ∂P := 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.4), first equality
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