Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 2, Eq. (15) — under Rˉ\bar RRˉ, E(Sn/n)→max⁡(α,β)E(S_n/n) \to \max(\alpha,\beta)E(Sn​/n)→max(α,β)

Proved
RobbinsSeqDesign.ForcedSampling.expected_average_tendsto_max

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

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

Let AAA and BBB be two populations whose expectations α\alphaα and β\betaβ exist (are finite), let 1=a1<a2<⋯1 = a_1 < a_2 < \cdots1=a1​<a2​<⋯ and 2=b1<b2<⋯2 = b_1 < b_2 < \cdots2=b1​<b2​<⋯ be disjoint sequences of density 000, and sample according to Robbins' rule Rˉ\bar RRˉ. Then

lim⁡n→∞E ⁣(Snn)=max⁡(α,β),\lim_{n\to\infty} E\!\left(\frac{S_n}{n}\right) = \max(\alpha, \beta),n→∞lim​E(nSn​​)=max(α,β),

where EEE is the expectation under the sampling process generated by Rˉ\bar RRˉ and Sn=x1+⋯+xnS_n = x_1 + \cdots + x_nSn​=x1​+⋯+xn​.

This is the expectation form of display (14); Robbins notes that (14) "can be shown to imply" it. It turns the almost-sure statement into the statement about the expected average reward that the loss (9) is built from.

Formalization Note. Finite expectations are the hypothesis that both reward laws are integrable, and nothing more. The expectation is the integral against the trajectory law banditTrajMeasure ν (rule σ); under the integrability hypothesis Sn/nS_n/nSn​/n is integrable for every nnn, so the integral is not a junk value.

Preamble
import Mathlib
import Definitions.Def_RobbinsSeqDesign_ForcedSampling_Rule
import Definitions.Def_RobbinsSeqDesign_ForcedSampling_Loss
Formal statement
namespace RobbinsSeqDesign.ForcedSampling

open MeasureTheory ProbabilityTheory Filter Topology BanditAlgorithm

/-- Robbins (1952), Section 2, Eq. (15), p. 532: for any two populations A, B whose
expectations `α`, `β` exist (are finite) and any pair of sequences (13), under the rule `R̄`,
`E(S_n / n) → max(α, β)`. -/
theorem expected_average_tendsto_max (ν : StochasticBandit 2)
    (hint : ∀ i, Integrable id (ν.P i)) (σ : ForcedSchedule) :
    Tendsto (fun n : ℕ => ∫ ω, partialSum n ω / (n : ℝ) ∂(banditTrajMeasure ν (rule σ)))
      atTop (𝓝 (max (banditArmMean ν 0) (banditArmMean ν 1))) := by sorry

end RobbinsSeqDesign.ForcedSampling
Source
Robbins, Some aspects of the sequential design of experiments, Bull. Amer. Math. Soc. 58 (1952), p. 532, Section 2, Eq. (15)
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