Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 11.12: if the single-round BIC property holds when arm 2 is recommended, it holds when arm 1 is

Proved
IntroBandits.bic_arm_two_suffices

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

bayesian-incentive-compatibilityincentivized-exploration

Claim 11.12. Assume (11.5) holds for arm rec=2\mathrm{rec} = 2rec=2. Then it also holds for rec=1\mathrm{rec} = 1rec=1.

Formally, for any recommendation rule that depends on the signal only: Ω\OmegaΩ finite, QQQ a probability law of (μ,sig)(\mu, \mathrm{sig})(μ,sig) with μ\muμ-marginal supported on the finite FFF, μ10≥μ20\mu^0_1 \ge \mu^0_2μ10​≥μ20​, rule(S)\mathrm{rule}(S)rule(S) a distribution over the two arms for each SSS. If Pr⁡[rec=2]>0\Pr[\mathrm{rec} = 2] > 0Pr[rec=2]>0 implies E[(μ2−μ1)1{rec=2}]≥0\mathbb{E}[(\mu_2 - \mu_1)\mathbf 1\{\mathrm{rec} = 2\}] \ge 0E[(μ2​−μ1​)1{rec=2}]≥0, then the rule is single-round BIC: also Pr⁡[rec=1]>0\Pr[\mathrm{rec} = 1] > 0Pr[rec=1]>0 implies E[(μ1−μ2)1{rec=1}]≥0\mathbb{E}[(\mu_1 - \mu_2)\mathbf 1\{\mathrm{rec} = 1\}] \ge 0E[(μ1​−μ2​)1{rec=1}]≥0. The proof is the identity E[μ2−μ1]=∑aE[(μ2−μ1)1{rec=a}]\mathbb{E}[\mu_2 - \mu_1] = \sum_a \mathbb{E}[(\mu_2 - \mu_1)\mathbf 1\{\mathrm{rec} = a\}]E[μ2​−μ1​]=∑a​E[(μ2​−μ1​)1{rec=a}] and E[μ2−μ1]≤0\mathbb{E}[\mu_2 - \mu_1] \le 0E[μ2​−μ1​]≤0.

Preamble
import Definitions.Def_IntroBandits_Agents

open MeasureTheory ProbabilityTheory BanditAlgorithm
Formal statement
namespace IntroBandits

theorem bic_arm_two_suffices {Ω : Type} [Fintype Ω] [DecidableEq Ω] [MeasurableSpace Ω]
    [MeasurableSingletonClass Ω] (Q : Measure ((Fin 2 → ℝ) × Ω)) [IsProbabilityMeasure Q]
    (F : Finset (Fin 2 → ℝ)) (hF : Q ((↑F)ᶜ ×ˢ Set.univ) = 0)
    (hprior : priorMean Q.fst F 1 ≤ priorMean Q.fst F 0)
    (rule : Ω → Fin 2 → ℝ) (hrule : ∀ S, rule S ∈ stdSimplex ℝ (Fin 2))
    (h2 : 0 < ∑ S, (sigProb Q S).toReal * rule S 1 →
      0 ≤ ∑ μ ∈ F, ∑ S, (Q {(μ, S)}).toReal * (μ 1 - μ 0) * rule S 1) :
    IsSingleRoundBIC Q F rule := by sorry

end IntroBandits
Source
Slivkins, Introduction to Multi-Armed Bandits, arXiv:1904.07272 (FnT ML 12, 2019), §11.3 p. 149, Claim 11.12 with its proof
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