Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 2, Eqs. (4)–(5) — lim p_i = (α+β−2αβ)/(2−(α+β)) = γ + δ²/(1−γ) under R₁

Proved
RobbinsSeqDesign.StayOrSwitch.head_prob_tendsto

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, let pip_ipi​ be the probability of heads on the iii-th toss under the rule R1R_1R1​, and let γ=(α+β)/2\gamma = (\alpha+\beta)/2γ=(α+β)/2, δ=∣α−β∣/2\delta = |\alpha-\beta|/2δ=∣α−β∣/2 as in (5). Then

lim⁡i→∞pi=α+β−2αβ2−(α+β)=γ+δ21−γ.\lim_{i\to\infty} p_i = \frac{\alpha+\beta-2\alpha\beta}{2-(\alpha+\beta)} = \gamma + \frac{\delta^2}{1-\gamma}.i→∞lim​pi​=2−(α+β)α+β−2αβ​=γ+1−γδ2​.

The limit is the long-run frequency of heads under R1R_1R1​, 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
  • 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