Section 2, Eq. (3) — closed form of p_i under R₁
ProvedRobbinsSeqDesign.StayOrSwitch.head_prob_closed_formbandit-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 under the rule . Then , and for every ,
Since under the hypothesis, the first term decays geometrically; this gives the limit (4).
Formalization Note The exclusion "not both or both " is the paper's standing hypothesis stated just before (2); it makes the denominator positive. At the power is when , which is the reading the formula needs.
Preamble
import Mathlib import Definitions.Def_RobbinsSeqDesign_StayOrSwitch_Rules open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace RobbinsSeqDesign.StayOrSwitch
/-- Section 2, Eq. (3), p. 530: if `α, β` are not both `0` and not both `1`, then under rule
`R₁`, for every `i ≥ 1`,
`p_i = (α + β − 1)^{i−1} [p₁ − (α + β − 2αβ)/(2 − (α + β))] + (α + β − 2αβ)/(2 − (α + β))`. -/
theorem head_prob_closed_form (α β : unitInterval)
(hnot0 : ¬((α : ℝ) = 0 ∧ (β : ℝ) = 0)) (hnot1 : ¬((α : ℝ) = 1 ∧ (β : ℝ) = 1))
(i : ℕ) (hi : 1 ≤ i) :
headProb ruleR1 α β i =
((α : ℝ) + β - 1) ^ (i - 1) *
(headProb ruleR1 α β 1 - ((α : ℝ) + β - 2 * α * β) / (2 - ((α : ℝ) + β))) +
((α : ℝ) + β - 2 * α * β) / (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. (3)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.