Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

B.6, p. 34 — for Lemma 6's times, μk=p(1−α+αpk−2)/(k−2)\mu_k=p(1-\alpha+\alpha p^{k-2})/(k-2)μk​=p(1−α+αpk−2)/(k−2) for k≥3k\ge3k≥3

Proved
SampleDrivenOS.Limit.b6_mu_closed_form

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

optimal-stoppingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1series

Let p,α∈(0,1)p,\alpha\in(0,1)p,α∈(0,1), let (tk)(t_k)(tk​) be the times of Lemma 6, Ti=∏j=1itjT_i=\prod_{j=1}^i t_jTi​=∏j=1i​tj​, and μk=∑i=k∞Titii−1⋅1(i−2)(i−1)\mu_k=\sum_{i=k}^{\infty}\frac{T_i}{t_i^{i-1}}\cdot\frac{1}{(i-2)(i-1)}μk​=∑i=k∞​tii−1​Ti​​⋅(i−2)(i−1)1​. Then for every k≥3k\ge3k≥3,

μk=p (1−α+αpk−2)k−2.\mu_k=\frac{p\,(1-\alpha+\alpha p^{k-2})}{k-2}.μk​=k−2p(1−α+αpk−2)​.

With this closed form, (15) and (16) of Lemma 5 become direct algebraic identities for Lemma 6's times.

Preamble
import Mathlib
import Definitions.Def_SampleDrivenOS_Limit_Setting

open MeasureTheory Filter Topology
Formal statement
namespace SampleDrivenOS.Limit

/-- B.6 (p. 34): for the sequence of Lemma 6 and every `k ≥ 3`,
`µ_k = p(1 - α + α p^{k-2}) / (k - 2)`. -/
theorem b6_mu_closed_form (p α : ℝ) (hp : p ∈ Set.Ioo (0:ℝ) 1) (hα : α ∈ Set.Ioo (0:ℝ) 1) :
    ∀ k : ℕ, 3 ≤ k →
      mu (tSeq p α) k = p * (1 - α + α * p ^ (k - 2)) / ((k : ℝ) - 2) := by sorry

end SampleDrivenOS.Limit
Source
Correa, Cristi, Epstein & Soto, Sample-Driven Optimal Stopping: From the Secretary Problem to the i.i.d. Prophet Inequality, arXiv:2011.06516v2, p. 34, B.6 (proof of Lemma 6), first display
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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