Section 2, Eqs. (4)–(5) — lim p_i = (α+β−2αβ)/(2−(α+β)) = γ + δ²/(1−γ) under R₁
ProvedRobbinsSeqDesign.StayOrSwitch.head_prob_tendstobandit-algorithmsmarkov-chainsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let coins and have head probabilities , not both and not both , let be the probability of heads on the -th toss under the rule , and let , as in (5). Then
The limit is the long-run frequency of heads under , the quantity the asymptotic loss (8) is computed from.
Formalization Note The statement is the conjunction of the convergence and of the identity of the two closed forms. Both denominators are positive under the exclusion.
Preamble
import Mathlib import Definitions.Def_RobbinsSeqDesign_StayOrSwitch_Rules open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace RobbinsSeqDesign.StayOrSwitch
/-- Section 2, Eqs. (4)–(5), pp. 530–531: if `α, β` are not both `0` and not both `1`, then
under rule `R₁`, `lim_{i→∞} p_i = (α + β − 2αβ)/(2 − (α + β)) = γ + δ²/(1 − γ)`. -/
theorem head_prob_tendsto (α β : unitInterval)
(hnot0 : ¬((α : ℝ) = 0 ∧ (β : ℝ) = 0)) (hnot1 : ¬((α : ℝ) = 1 ∧ (β : ℝ) = 1)) :
Tendsto (fun i => headProb ruleR1 α β i) atTop
(𝓝 (((α : ℝ) + β - 2 * α * β) / (2 - ((α : ℝ) + β)))) ∧
((α : ℝ) + β - 2 * α * β) / (2 - ((α : ℝ) + β)) =
gamma α β + delta α β ^ 2 / (1 - gamma α β) := by sorry
end RobbinsSeqDesign.StayOrSwitch
Source
Robbins, Some aspects of the sequential design of experiments, Bull. Amer. Math. Soc. 58 (1952), pp. 530–531, Section 2, Eqs. (4) and (5)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.