Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2, p. 1215 — with a = a*, W(1) = W(a*) and 0 < a* < 1

Proved
SamuelCahnProphet.IID.aStarIID_spec

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1prophet-inequalityreal-analysis

For reals b>0b > 0b>0 and c>0c > 0c>0 let

a∗=c(1−e−b)−be−b(1−e−c)c(1−e−b−c).a^* = \frac{c(1 - e^{-b}) - b e^{-b}(1 - e^{-c})}{c(1 - e^{-b-c})}.a∗=c(1−e−b−c)c(1−e−b)−be−b(1−e−c)​.

Then W(a∗)=W(1)W(a^*) = W(1)W(a∗)=W(1), that is,

(1−e−b−c)(b+a∗c)b+c=1−e−b,\frac{(1 - e^{-b-c})(b + a^* c)}{b + c} = 1 - e^{-b},b+c(1−e−b−c)(b+a∗c)​=1−e−b,

and 0<a∗<10 < a^* < 10<a∗<1.

Choosing a=a∗a = a^*a=a∗ makes the two competing threshold rules asymptotically equally good, and 0<a∗<10 < a^* < 10<a∗<1 makes a∗a^*a∗ an admissible middle value of the three-point law.

Formalization Note. W(a)W(a)W(a) and W(1)W(1)W(1) are written out as the closed forms of the two preceding milestones, so this is a statement about real numbers only. No hypothesis beyond b,c>0b, c > 0b,c>0 is assumed.

Preamble
import Mathlib
import Definitions.Def_SamuelCahnProphet_IID_Setting

open MeasureTheory Filter Topology
Formal statement
namespace SamuelCahnProphet.IID

theorem aStarIID_spec (b c : ℝ) (hb : 0 < b) (hc : 0 < c) :
    (1 - Real.exp (-b - c)) * (b + aStarIID b c * c) / (b + c) = 1 - Real.exp (-b) ∧
      0 < aStarIID b c ∧ aStarIID b c < 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, display a* and "then W(1) = W(a*), and 0 < a* < 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