Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.2 — Continuous pricing lower bound

Proved
CalibeatBandit.Pricing.theorem_5_2

by jasonhartline · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmic-game-theorybandit-algorithms

There are absolute constants c>0c>0c>0 and T0T_0T0​ such that for every T≥T0T\ge T_0T≥T0​ there is a sparsity K>0K>0K>0 with the following property. For every measurable randomized bandit pricing policy, there are a deterministic oblivious sequence of nonincreasing demands and a deterministic recommendation sequence using at most KKK prices. On this instance both expected swap regret and expected recommendation reward loss are at least c(T3/4+K1/3T2/3)/(log⁡T)6c(T^{3/4}+K^{1/3}T^{2/3})/(\log T)^6c(T3/4+K1/3T2/3)/(logT)6. The pricing rule may depend on the complete fixed recommendation sequence. The proof chooses one possible recommendation price for each leaf of the hard instance, as in the manuscript.

Preamble
import Definitions.Def_CalibeatBandit_lower_bound_models

open CalibeatBandit.Pricing MeasureTheory Set
Formal statement
theorem CalibeatBandit.Pricing.theorem_5_2 :
    ∃ c : ℝ, 0 < c ∧ ∃ T₀ : ℕ, ∀ T : ℕ, T₀ ≤ T →
      ∃ K : ℕ, 0 < K ∧ ∀ {S : Type*} [MeasurableSpace S] (P : Measure S)
        [IsProbabilityMeasure P] (rule : (ℕ → Price) → S → PricingRule),
        (∀ a t, Measurable (fun p : S × (Fin t → Price × ℝ) => rule a p.1 t p.2)) →
        ∃ (d : ℕ → Demand) (recommendationPrice : Fin K → Price) (label : ℕ → Fin K),
          let recommendations := recommendationPrice ∘ label
          let posted (s : S) (t : ℕ) :=
            rule recommendations s t (pricingHistory (rule recommendations s) (fun i => revenue zeroPrice (d i)) t)
          let rate := c * ((T : ℝ) ^ (3 / 4 : ℝ) + (K : ℝ) ^ (1 / 3 : ℝ) * (T : ℝ) ^ (2 / 3 : ℝ)) /
            Real.log T ^ 6
          (rate ≤ ∫ s, benchmark T zeroPrice d (posted s) (posted s) ∂P) ∧
            (rate ≤ ∫ s, benchmark T zeroPrice d recommendations (posted s) ∂P) := by sorry
Source
Hartline, Wang, Wu, Calibeating Bandit Advice, STOC 2027 submission 1457, Theorem 5.2 — Continuous pricing lower bound

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