B.9, p. 35 — (19) evaluated at with ≤ implies
ProvedSampleDrivenOS.Linear.b9_reductionoptimal-stoppingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysis
Let and let be a root of (19), i.e. and
Let with . If
then .
Writing , equation (19) becomes , whose left side increases and whose right side decreases in ; so the displayed inequality at forces . With this reduces Theorem 9 to the displayed inequality.
Formalization Note The paper writes and concludes ; the statement is phrased as to avoid the division and holds for every root of (19). The hypothesis keeps every logarithm's argument positive (at least ); holds since . The series are Lean tsums over i : ℕ with shifted by one; both are summable in this range.
Preamble
import Mathlib import Definitions.Def_SampleDrivenOS_Linear_Setting
Formal statement
namespace SampleDrivenOS.Linear
theorem b9_reduction (p : ℝ) (hp : p ∈ Set.Ioo (0 : ℝ) 1) (a : ℝ) (ha : SampleDrivenOS.Limit.IsAlphaTilde p a)
(s : ℝ) (hs0 : 0 < s) (hsp : s * p < 1)
(h : Real.log p + s * (1 - p) ^ 2 ≤
∑' i : ℕ, Real.log (1 - s * p + s * p * ((i + 2) * p ^ (i + 1) - (i + 1) * p ^ (i + 2))) /
((i + 1) * (i + 2))) :
s * p ≤ a := 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. 35, B.9 (Proof of Theorem 9), first paragraph and its two displays
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.