Section 2, Eq. (2) — p_{i+1} = (α+β−1)p_i + (α+β−2αβ) under R₁
ProvedRobbinsSeqDesign.StayOrSwitch.head_prob_recursionbandit-algorithmsmarkov-chainsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let coins and have head probabilities , not both and not both , and let be the probability of heads on the -th toss when the rule (stay on heads, switch on tails, fair first choice) is used. Then for every ,
This affine recursion is the operating characteristic of from which the closed form (3) and the limits (4) and (6) follow.
Formalization Note The two excluded corners are the standing hypothesis stated immediately before Eq. (2). Tosses are indexed from .
Preamble
import Mathlib import Definitions.Def_RobbinsSeqDesign_StayOrSwitch_Rules open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace RobbinsSeqDesign.StayOrSwitch
/-- Section 2, Eq. (2), p. 530: under rule `R₁`, when `α, β` are not both `0` and not both
`1`, for every `i ≥ 1`,
`p_{i+1} = (α + β − 1) p_i + (α + β − 2αβ)`. -/
theorem head_prob_recursion (α β : unitInterval)
(hnot0 : ¬((α : ℝ) = 0 ∧ (β : ℝ) = 0)) (hnot1 : ¬((α : ℝ) = 1 ∧ (β : ℝ) = 1))
(i : ℕ) (hi : 1 ≤ i) :
headProb ruleR1 α β (i + 1) =
((α : ℝ) + β - 1) * headProb ruleR1 α β i + ((α : ℝ) + β - 2 * α * β) := by sorry
end RobbinsSeqDesign.StayOrSwitch
Source
Robbins, Some aspects of the sequential design of experiments, Bull. Amer. Math. Soc. 58 (1952), p. 530, Section 2, Eq. (2)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.