Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2, p. 1215 — Q(b, c) → 2 as c → ∞ and b → 0

Proved
SamuelCahnProphet.IID.tendsto_Q_two

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

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

Let

Q(b,c)=1+e−b−e−b−c1−e−b−c−b(e−b−e−b−c)2c(1−e−b−c)(1−e−b).Q(b, c) = 1 + \frac{e^{-b} - e^{-b-c}}{1 - e^{-b-c}} - \frac{b(e^{-b} - e^{-b-c})^2}{c(1 - e^{-b-c})(1 - e^{-b})}.Q(b,c)=1+1−e−b−ce−b−e−b−c​−c(1−e−b−c)(1−e−b)b(e−b−e−b−c)2​.

Then Q(b,c)→2Q(b, c) \to 2Q(b,c)→2 as b→0+b \to 0^+b→0+ and c→∞c \to \inftyc→∞ jointly:

lim⁡b→0+, c→∞Q(b,c)=2.\lim_{b \to 0^+,\ c \to \infty} Q(b, c) = 2 .b→0+, c→∞lim​Q(b,c)=2.

Together with the preceding milestone, this shows that the ratio of the prophet's value to the best threshold value can be made arbitrarily close to 222, which is the lower half of Theorem 2.

Formalization Note. The joint limit is taken along the product filter of b→0b \to 0b→0 from the right and c→∞c \to \inftyc→∞. The paper's numerical illustration Q(10−2,103)=1.99Q(10^{-2}, 10^3) = 1.99Q(10−2,103)=1.99 is a rounded value and is not formalized.

Preamble
import Mathlib
import Definitions.Def_SamuelCahnProphet_IID_Setting

open MeasureTheory Filter Topology
Formal statement
namespace SamuelCahnProphet.IID

theorem tendsto_Q_two :
    Tendsto (fun p : ℝ × ℝ => Q p.1 p.2) ((𝓝[>] (0 : ℝ)) ×ˢ atTop) (𝓝 2) := 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, last sentence ("as c → ∞ and b → 0, Q(b, c) → 2")
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