Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 2, Eq. (2) — p_{i+1} = (α+β−1)p_i + (α+β−2αβ) under R₁

Proved
RobbinsSeqDesign.StayOrSwitch.head_prob_recursion

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

bandit-algorithmsmarkov-chainsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let coins AAA and BBB have head probabilities α,β∈[0,1]\alpha, \beta\in[0,1]α,β∈[0,1], not both 000 and not both 111, and let pip_ipi​ be the probability of heads on the iii-th toss when the rule R1R_1R1​ (stay on heads, switch on tails, fair first choice) is used. Then for every i≥1i \ge 1i≥1,

pi+1=(α+β−1) pi+(α+β−2αβ).p_{i+1} = (\alpha+\beta-1)\,p_i + (\alpha+\beta-2\alpha\beta).pi+1​=(α+β−1)pi​+(α+β−2αβ).

This affine recursion is the operating characteristic of R1R_1R1​ 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 111.

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
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me