Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

BanditAlgorithm.partial_monitoring_hard_game_lower_bound

Proved

by Shuze Chen · Jul 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

lower-boundsonline-learningpartial-monitoring

(Hard games, Theorem 37.12) If GGG is globally observable but not locally observable, then there exists a game-dependent constant cG>0c_G > 0cG​>0 such that for every horizon nnn,

Rn∗(G)≥cG n2/3.R_n^*(G) \ge c_G\, n^{2/3}.Rn∗​(G)≥cG​n2/3.
Preamble
import Definitions.Def_PartialMonitoringGame
import Mathlib.Analysis.SpecialFunctions.Pow.Real


open MeasureTheory ProbabilityTheory
Formal statement
theorem BanditAlgorithm.partial_monitoring_hard_game_lower_bound {k d : ℕ} {𝕊 : Type*}
    [Fintype 𝕊] [MeasurableSpace 𝕊] (G : PartialMonitoringGame k d 𝕊)
    (hglob : GloballyObservable G) (hloc : ¬ LocallyObservable G) :
    ∃ c : ℝ, 0 < c ∧
      ∀ n : ℕ, c * (n : ℝ) ^ ((2 : ℝ) / 3) ≤ pmMinimaxRegret G n := by
  sorry
Source
L&S Theorem 37.12, p.488

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