Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 2, p. 531 — rule R₀ has asymptotic loss L(A, B, R₀) = δ, with maximum M₀ = 1/2 at (0, 1) and (1, 0)

Proved
RobbinsSeqDesign.StayOrSwitch.rule_R0_loss

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

bandit-algorithmsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1sequential-design

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 γ,δ\gamma,\deltaγ,δ be as in (5). Under the rule R0R_0R0​ (choose one of the coins at random and stick to it), the loss per toss tends to δ\deltaδ:

lim⁡n→∞[max⁡(α,β)−E ⁣(Snn)]=L(A,B,R0)=(γ+δ)−γ=δ.\lim_{n\to\infty}\left[\max(\alpha,\beta) - \mathrm E\!\left(\frac{S_n}{n}\right)\right] = L(A,B,R_0) = (\gamma+\delta)-\gamma = \delta .n→∞lim​[max(α,β)−E(nSn​​)]=L(A,B,R0​)=(γ+δ)−γ=δ.

Moreover δ≤12\delta \le \tfrac12δ≤21​ for every admissible (α,β)(\alpha,\beta)(α,β), with δ=12\delta = \tfrac12δ=21​ at α=0,β=1\alpha = 0,\beta = 1α=0,β=1 and at α=1,β=0\alpha = 1,\beta = 0α=1,β=0; so the worst case of R0R_0R0​ is M0=1/2M_0 = 1/2M0​=1/2, against M1=3−23/2M_1 = 3-2^{3/2}M1​=3−23/2 for R1R_1R1​.

Formalization Note "At random" is the fair choice. The paper's parenthetical alternative "(or in tossing the two coins alternately)" is not part of this statement. The standing exclusion of the two corners is kept, as on the page.

Preamble
import Mathlib
import Definitions.Def_RobbinsSeqDesign_StayOrSwitch_Rules

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace RobbinsSeqDesign.StayOrSwitch

/-- Section 2, p. 531, rule `R₀`: if `α, β` are not both `0` and not both `1`, the loss per toss
`max(α, β) − E(S_n/n)` of rule `R₀` tends to `L(A, B, R₀) = (γ + δ) − γ = δ`; and `δ` has the
maximum `M₀ = 1/2` over all admissible `(α, β)`, taken at `α = 0, β = 1` and at
`α = 1, β = 0`. -/
theorem rule_R0_loss :
    (∀ α β : unitInterval, ¬((α : ℝ) = 0 ∧ (β : ℝ) = 0) → ¬((α : ℝ) = 1 ∧ (β : ℝ) = 1) →
        Tendsto (fun n => max (α : ℝ) β - expectedAverage ruleR0 α β n) atTop
          (𝓝 (delta α β))) ∧
      (∀ α β : ℝ, 0 ≤ α → α ≤ 1 → 0 ≤ β → β ≤ 1 → ¬(α = 0 ∧ β = 0) → ¬(α = 1 ∧ β = 1) →
        delta α β ≤ 1 / 2) ∧
      delta 0 1 = 1 / 2 ∧ delta 1 0 = 1 / 2 := by sorry

end RobbinsSeqDesign.StayOrSwitch
Source
Robbins, Some aspects of the sequential design of experiments, Bull. Amer. Math. Soc. 58 (1952), p. 531, Section 2 (rule R₀, L(A, B, R₀), M₀)
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