B.6, p. 33 — for Lemma 6's times, for
ProvedSampleDrivenOS.Limit.b6_product_identityoptimal-stoppingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sequences
Let , let and be as in Lemma 6, and . Then for every ,
This product identity is the step of the proof of Lemma 6 (iii) that evaluates the terms of and the right-hand side of (16) 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. 33): for the sequence of Lemma 6 and every `i ≥ 2`,
`T_i / t_i^{i-1} = p γ_{i-1}`. -/
theorem b6_product_identity (p α : ℝ) (hp : p ∈ Set.Ioo (0:ℝ) 1) (hα : α ∈ Set.Ioo (0:ℝ) 1) :
∀ i : ℕ, 2 ≤ i →
SampleDrivenOS.Structure.thresholdProd (tSeq p α) i / tSeq p α i ^ (i - 1) = p * gammaK p α (i - 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. 33, B.6 (proof of Lemma 6), last display
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.