Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 — Weitzman cost-per-sample optimality

Proved
PandoraBO.Private20261023.weitzman_optimality

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

bayesian-optimizationexpected-budgetgittins-indexpandoras-box

Consider finitely many mutually independent integrable real rewards with strictly positive deterministic opening costs. For every λ>0\lambda>0λ>0, a Gittins policy exists, and every such policy maximizes

R(π)−λC(π)R(\pi)-\lambda C(\pi)R(π)−λC(π)

over all measurable adaptive randomized policies. The first box must be opened. Afterward the rule selects an unopened maximal-index box and compares its index with the incumbent reward; it may randomize among tied boxes and between stopping and continuing at equality. This is the cost-per-sample result used as a prerequisite to the fixed expected-budget theorem.

Preamble
import Definitions.Def_PandoraBO_Model

set_option autoImplicit false
Formal statement
namespace PandoraBO.Private20261023

theorem weitzman_optimality {n : ℕ} (M : Instance n)
    (multiplier : ℝ) (hpos : 0 < multiplier) :
    (∃ π : Policy n, isGittinsPolicy M multiplier π) ∧
    ∀ π : Policy n, isGittinsPolicy M multiplier π → optimal M multiplier π := 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. Section 3.2, Theorem 1 (attributed to Weitzman), applied to the positive scaled costs λc.
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