Lemma 6 (i) — the times , , (17) are increasing
ProvedSampleDrivenOS.Limit.lemma_6_ioptimal-stoppingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sequences
Let , let , and let , and, for , with
Then the sequence is increasing:
Monotonicity is what makes the times admissible thresholds for the form (12).
Formalization Note "Increasing" is rendered as , the inequality the paper's proof establishes; for these the inequalities are in fact strict. All lie in , so (17) has the unique positive solution , which is the definition used.
Preamble
import Mathlib import Definitions.Def_SampleDrivenOS_Limit_Setting open MeasureTheory Filter Topology
Formal statement
namespace SampleDrivenOS.Limit
/-- Lemma 6 (i) (p. 16): for `p, α ∈ (0, 1)`, the sequence `(t_k)_{k ≥ 1}` defined by
`t_1 = p`, `t_2 = p exp(α(1-p)²/p)` and (17) is increasing (`t_k ≤ t_{k+1}` for all `k ≥ 1`). -/
theorem lemma_6_i (p α : ℝ) (hp : p ∈ Set.Ioo (0:ℝ) 1) (hα : α ∈ Set.Ioo (0:ℝ) 1) :
∀ k : ℕ, 1 ≤ k → tSeq p α k ≤ tSeq p α (k + 1) := 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. 16, Lemma 6 (i), (17)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.