B.4, p. 32 —
ProvedSampleDrivenOS.Limit.b4_binomial_identitybinomial-identityoptimal-stoppingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
For every integer and every ,
In the proof of Lemma 4 this identity turns the coefficient of in , after has been bounded below by , into the simple weight .
Preamble
import Mathlib import Definitions.Def_SampleDrivenOS_Limit_Setting open MeasureTheory Filter Topology
Formal statement
namespace SampleDrivenOS.Limit
/-- B.4 (p. 32): for all `j ≥ 1` and `t ∈ [0, 1]`,
`∑_{ℓ=1}^{j} C(j-1, ℓ-1) (1-t)^{j-ℓ} t^ℓ = t`. -/
theorem b4_binomial_identity (j : ℕ) (hj : 1 ≤ j) (t : ℝ) (ht : t ∈ Set.Icc (0:ℝ) 1) :
∑ ℓ ∈ Finset.Icc 1 j, ((j - 1).choose (ℓ - 1) : ℝ) * (1 - t) ^ (j - ℓ) * t ^ ℓ = t := 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. 32, B.4 (proof of Lemma 4), last line
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.