Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 11.19: absent Property (11.12), any BIC algorithm (ties to arm 1) never plays arm 2

Proved
IntroBandits.bic_never_explores_without_property

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

bayesian-incentive-compatibilityimpossibilityincentivized-exploration

Theorem 11.19. Suppose ties in Definition 11.4 are always resolved in favor of arm 1 (i.e., imply rect=1\mathrm{rec}_t = 1rect​=1). Absent (11.12), any BIC algorithm never plays arm 2.

Formally: PPP a prior supported on the finite F⊆[0,1]2F \subseteq [0,1]^2F⊆[0,1]2, any reward family; suppose Property (11.12) fails, i.e. for every nnn and every tuple sss of nnn samples of arm 1, E[(μ2−μ1)1{S1,n=s}]≤0\mathbb{E}[(\mu_2 - \mu_1)\mathbf 1\{S_{1,n} = s\}] \le 0E[(μ2​−μ1​)1{S1,n​=s}]≤0 (so Pr⁡[G1,n>0]=0\Pr[G_{1,n} > 0] = 0Pr[G1,n​>0]=0 for every nnn). Let π\piπ be a bandit policy over TTT rounds that is BIC with the tie convention: BIC, and whenever Pr⁡[rect=2]>0\Pr[\mathrm{rec}_t = 2] > 0Pr[rect​=2]>0, E[(μ2−μ1)1{rect=2}]>0\mathbb{E}[(\mu_2 - \mu_1)\mathbf 1\{\mathrm{rec}_t = 2\}] > 0E[(μ2​−μ1​)1{rect​=2}]>0 (arm 2 is recommended only when strictly better). Then for every round ttt, Pr⁡[rect=2]=0\Pr[\mathrm{rec}_t = 2] = 0Pr[rect​=2]=0 under the joint law of the compliant run. "Never plays" is "with probability zero", which is what the induction of the proof establishes.

Preamble
import Definitions.Def_IntroBandits_Agents

open MeasureTheory ProbabilityTheory BanditAlgorithm
Formal statement
namespace IntroBandits

theorem bic_never_explores_without_property (P : Measure (Fin 2 → ℝ)) [IsProbabilityMeasure P]
    (F : Finset (Fin 2 → ℝ)) (hF : P (↑F)ᶜ = 0)
    (hunit : ∀ μ ∈ F, ∀ a, μ a ∈ Set.Icc (0 : ℝ) 1) (fam : RewardFamily)
    (hno : ¬ PriorAllowsExploration P F fam) {T : ℕ} {π : BanditPolicy 2}
    (hπ : IsStrictlyBIC F (jointMeasure P F fam π T) (fun h t ↦ (h t).1)) :
    ∀ t : Fin T, jointMeasure P F fam π T (Set.univ ×ˢ {h | (h t).1 = 1}) = 0 := by sorry

end IntroBandits
Source
Slivkins, Introduction to Multi-Armed Bandits, arXiv:1904.07272 (FnT ML 12, 2019), §11.5 p. 153, Theorem 11.19 with its proof by induction
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me