Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

B.9, p. 37 — for α∗∈[0.74,0.75]\alpha^*\in[0.74,0.75]α∗∈[0.74,0.75] and p∈(0,1)p\in(0,1)p∈(0,1) the log term is at least 0.80.80.8

Proved
SampleDrivenOS.Linear.b9_numerical

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

numerical-boundoptimal-stoppingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysis

For every s∈[0.74, 0.75]s\in[0.74,\,0.75]s∈[0.74,0.75] and every p∈(0,1)p\in(0,1)p∈(0,1),

(1ps−1e)ln⁡(1ps+pe1ps+pe−1)≥0.8.\Bigl(\frac1{ps}-\frac1e\Bigr)\ln\left(\frac{\tfrac1{ps}+\tfrac pe}{\tfrac1{ps}+\tfrac pe-1}\right)\ge 0.8 .(ps1​−e1​)ln(ps1​+ep​−1ps1​+ep​​)≥0.8.

The paper states this as a numerical check, for any value α∗=s\alpha^*=sα∗=s in the interval [0.74,0.75][0.74,0.75][0.74,0.75]. Combined with the integral bound it gives the final upper bound on c(p)c(p)c(p).

Formalization Note The claim is quantified over the whole interval s∈[0.74,0.75]s\in[0.74,0.75]s∈[0.74,0.75], as printed, not only over α∗\alpha^*α∗. e=exp⁡1e=\exp 1e=exp1. For s,ps,ps,p in this range 1/(ps)>11/(ps)>11/(ps)>1, so every division and the logarithm's argument (which exceeds 111) are well defined.

Preamble
import Mathlib
import Definitions.Def_SampleDrivenOS_Linear_Setting
Formal statement
namespace SampleDrivenOS.Linear

theorem b9_numerical (s : ℝ) (hs : s ∈ Set.Icc (0.74 : ℝ) 0.75) (p : ℝ)
    (hp : p ∈ Set.Ioo (0 : ℝ) 1) :
    (0.8 : ℝ) ≤ (1 / (p * s) - 1 / Real.exp 1) *
      Real.log ((1 / (p * s) + p / Real.exp 1) / (1 / (p * s) + p / Real.exp 1 - 1)) := by sorry

end SampleDrivenOS.Linear
Source
Correa, Cristi, Epstein & Soto, Sample-Driven Optimal Stopping: From the Secretary Problem to the i.i.d. Prophet Inequality, arXiv:2011.06516v2, p. 37, B.9 (Proof of Theorem 9), sentence after the 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