B.6, p. 34 — for Lemma 6's times, for
ProvedSampleDrivenOS.Limit.b6_mu_closed_formoptimal-stoppingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1series
Let , let be the times of Lemma 6, , and . Then for every ,
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.