B.9, p. 37 — for and the log term is at least
ProvedSampleDrivenOS.Linear.b9_numericalnumerical-boundoptimal-stoppingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysis
For every and every ,
The paper states this as a numerical check, for any value in the interval . Combined with the integral bound it gives the final upper bound on .
Formalization Note The claim is quantified over the whole interval , as printed, not only over . . For in this range , so every division and the logarithm's argument (which exceeds ) 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.