Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Boundary lemma — Gittins policies as the multiplier decreases to zero

Proved
PandoraBO.Private20261023.zero_multiplier_gittins_limit

by QianJaneXie · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

bayesian-optimizationexpected-budgetgittins-indexpandoras-box

For any positive nonincreasing sequence λk→0\lambda_k\to0λk​→0, there exist positive-multiplier Gittins policies πk\pi_kπk​ and a zero-multiplier Gittins policy π0\pi_0π0​, with indices gi(0)=ess sup⁡Fig_i(0)=\operatorname{ess\,sup}F_igi​(0)=esssupFi​ in the extended reals, such that

R(π0)=Rall,C(πk)→C(π0),R(πk)→R(π0).R(\pi_0)=R_{\mathrm{all}},\qquad C(\pi_k)\to C(\pi_0),\qquad R(\pi_k)\to R(\pi_0).R(π0​)=Rall​,C(πk​)→C(π0​),R(πk​)→R(π0​).

The same policy sequence satisfies both limits along the full natural-number sequence. The conclusion is existential and permits choosing ties; it does not say arbitrary zero-index tie rules have minimal cost, or satisfy any prescribed budget.

Preamble
import Definitions.Def_PandoraBO_Model

set_option autoImplicit false
Formal statement
namespace PandoraBO.Private20261023

theorem zero_multiplier_gittins_limit {n : ℕ} (M : Instance n)
    (multipliers : ℕ → ℝ) (hpos : ∀ k, 0 < multipliers k)
    (hmono : Antitone multipliers)
    (hlim : Filter.Tendsto multipliers Filter.atTop (nhds 0)) :
    ∃ policies : ℕ → Policy n, ∃ π : Policy n,
      (∀ k, isGittinsPolicy M (multipliers k) (policies k)) ∧
      isZeroGittinsPolicy M π ∧
      expectedReward M π = fullInformationReward M ∧
      Filter.Tendsto (fun k => expectedCost M (policies k))
        Filter.atTop (nhds (expectedCost M π)) ∧
      Filter.Tendsto (fun k => expectedReward M (policies k))
        Filter.atTop (nhds (expectedReward M π)) := by sorry

end PandoraBO.Private20261023
Source
Qian Xie, Raul Astudillo, Peter I. Frazier, Ziv Scully, and Alexander Terenin. [Cost-aware Bayesian Optimization via the Pandora's Box Gittins Index](https://arxiv.org/abs/2406.20062). NeurIPS 2024. Appendix B.5, Lemma 9 and its limiting-index argument. This supporting formalization lemma extends policy limits to essential-supremum indices at zero; it is not a verbatim numbered statement.
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by QianJaneXie · Oct 24, 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