Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2, p. 1215 — only two competing rules in T*ₙ, viz. t(a) and t(1)

Proved
SamuelCahnProphet.IID.supE_threePoint_eq_max

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

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

Fix reals 0<a<10 < a < 10<a<1, b>0b > 0b>0, c>0c > 0c>0 and an integer n≥1n \ge 1n≥1 with b+c<nb + c < nb+c<n. Let X1,…,XnX_1, \dots, X_nX1​,…,Xn​ be i.i.d., taking the values 000, aaa and 111 with probabilities 1−(b+c)/n1 - (b+c)/n1−(b+c)/n, c/nc/nc/n and b/nb/nb/n. Then the best threshold rule in Tn∗T_n^*Tn∗​ is t(a)t(a)t(a) or t(1)t(1)t(1):

sup⁡t∈Tn∗EXt=max⁡{EXt(a), EXt(1)}.\sup_{t \in T_n^*} EX_t = \max\{EX_{t(a)},\ EX_{t(1)}\}.t∈Tn∗​sup​EXt​=max{EXt(a)​, EXt(1)​}.

The paper states that "there are essentially only two competing rules in Tn∗T_n^*Tn∗​, viz. t(a)t(a)t(a) and t(1)t(1)t(1)"; the identity above is that claim. It reduces the gambler's side of the extremal example to two explicit expectations.

Formalization Note. Tn∗T_n^*Tn∗​ consists of t(c)t(c)t(c) and s(c)s(c)s(c) for all c≥0c \ge 0c≥0, both families included. The hypothesis b+c<nb + c < nb+c<n is the page's, and makes the law a probability measure.

Preamble
import Mathlib
import Definitions.Def_SamuelCahnProphet_IID_Setting

open MeasureTheory Filter Topology
Formal statement
namespace SamuelCahnProphet.IID

theorem supE_threePoint_eq_max (a b c : ℝ) (ha : 0 < a) (ha1 : a < 1) (hb : 0 < b)
    (hc : 0 < c) (n : ℕ) [NeZero n] (hn : b + c < n) :
    supE (threePoint n a b c) n =
      max (EstopT (threePoint n a b c) n a) (EstopT (threePoint n a b c) n 1) := 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 ("There are essentially only two competing rules in T*ₙ, viz. t(a) and t(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