Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Corollary 11.8: under independent priors, GREEDY suffers Bayesian regret ≥T⋅α2(μ10−μ20)Pr⁡[μ2>1−α]\ge T \cdot \frac{\alpha}{2}(\mu^0_1 - \mu^0_2)\Pr[\mu_2 > 1 - \alpha]≥T⋅2α​(μ10​−μ20​)Pr[μ2​>1−α]

Proved
IntroBandits.greedy_linear_bayesian_regret

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

bayesian-greedybayesian-regretincentivized-exploration

Corollary 11.8. Consider independent priors such that Pr⁡[μ1=1]<(μ10−μ20)/2\Pr[\mu_1 = 1] < (\mu^0_1 - \mu^0_2)/2Pr[μ1​=1]<(μ10​−μ20​)/2. Pick any α>0\alpha > 0α>0 such that Pr⁡[μ1≥1−2α]≤(μ10−μ20)/2\Pr[\mu_1 \ge 1 - 2\alpha] \le (\mu^0_1 - \mu^0_2)/2Pr[μ1​≥1−2α]≤(μ10​−μ20​)/2. Then GREEDY suffers Bayesian regret

E[R(T)]≥T⋅(α2 (μ10−μ20) Pr⁡[μ2>1−α]).\mathbb{E}[R(T)] \ge T \cdot \Big(\frac{\alpha}{2}\,(\mu^0_1 - \mu^0_2)\,\Pr[\mu_2 > 1 - \alpha]\Big).E[R(T)]≥T⋅(2α​(μ10​−μ20​)Pr[μ2​>1−α]).

Formally: PPP a prior supported on the finite F⊆[0,1]2F \subseteq [0,1]^2F⊆[0,1]2 under which the coordinates μ1,μ2\mu_1, \mu_2μ1​,μ2​ are independent (iIndepFun), Pr⁡[μ1=1]<(μ10−μ20)/2\Pr[\mu_1 = 1] < (\mu^0_1 - \mu^0_2)/2Pr[μ1​=1]<(μ10​−μ20​)/2, α>0\alpha > 0α>0 with Pr⁡[μ1≥1−2α]≤(μ10−μ20)/2\Pr[\mu_1 \ge 1 - 2\alpha] \le (\mu^0_1 - \mu^0_2)/2Pr[μ1​≥1−2α]≤(μ10​−μ20​)/2, π\piπ any GREEDY policy and TTT any horizon; then T⋅α2(μ10−μ20)Pr⁡[μ2>1−α]≤BR(T)T \cdot \frac{\alpha}{2}(\mu^0_1 - \mu^0_2)\Pr[\mu_2 > 1 - \alpha] \le \mathrm{BR}(T)T⋅2α​(μ10​−μ20​)Pr[μ2​>1−α]≤BR(T), with BR(T)\mathrm{BR}(T)BR(T) the Bayesian regret (3.1) of Chapter 3 (the pseudo-regret Tmax⁡aμa−∑tμatT\max_a \mu_a - \sum_t \mu_{a_t}Tmaxa​μa​−∑t​μat​​ in expectation over the run and the prior). The first hypothesis only guarantees that such an α\alphaα exists; it is kept as printed.

Preamble
import Definitions.Def_IntroBandits_Agents

open MeasureTheory ProbabilityTheory BanditAlgorithm
Formal statement
namespace IntroBandits

theorem greedy_linear_bayesian_regret (P : Measure (Fin 2 → ℝ)) [IsProbabilityMeasure P]
    (F : Finset (Fin 2 → ℝ)) (hF : P (↑F)ᶜ = 0)
    (hunit : ∀ μ ∈ F, ∀ a, μ a ∈ Set.Icc (0 : ℝ) 1) (fam : RewardFamily)
    (hindep : iIndepFun (fun (a : Fin 2) (μ : Fin 2 → ℝ) ↦ μ a) P)
    (h1 : (P {μ | μ 0 = 1}).toReal < (priorMean P F 0 - priorMean P F 1) / 2)
    {α : ℝ} (hα : 0 < α)
    (hα2 : (P {μ | 1 - 2 * α ≤ μ 0}).toReal ≤ (priorMean P F 0 - priorMean P F 1) / 2)
    {π : BanditPolicy 2} (hπ : IsGreedy P F fam π) (T : ℕ) :
    T * (α / 2 * (priorMean P F 0 - priorMean P F 1) * (P {μ | 1 - α < μ 1}).toReal) ≤
      bayesianRegret P F fam π T := by sorry

end IntroBandits
Source
Slivkins, Introduction to Multi-Armed Bandits, arXiv:1904.07272 (FnT ML 12, 2019), §11.2 p. 148, Corollary 11.8 with its proof (also Exercise 11.1)
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me