Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pathwise capped-reward identity for a Gittins policy

Proved
PandoraBO.Private20261023.gittins_pathwise_capped_reward_identity

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

optimal-searchpandoras-box

For every outcome, a finite positive-multiplier Gittins policy achieves the maximum of the rewards capped at their reservation indices plus the sum of the opened positive reward excesses. All tie choices allowed by the Gittins policy definition are included. The first opening is mandatory, and rewards may be negative.

Preamble
import Definitions.Def_PandoraBO_Model
open MeasureTheory PandoraBO
set_option autoImplicit false
attribute [local instance] Classical.propDecidable
Formal statement
theorem PandoraBO.Private20261023.gittins_pathwise_capped_reward_identity {n : ℕ} (M : Instance n) (multiplier : ℝ) (hpos : 0 < multiplier)
    (z : Box n → ℝ) (hz : reservationIndices M multiplier z) (π : Policy n)
    (hπ : isGittinsPolicy M multiplier π) (ω : Outcome n) :
    terminalReward π ω =
      fullInformationPayoff (fun i => min (ω.1 i) (z i)) +
        ∑ k : Fin (n + 1), if occupied (terminalHistory π ω) k then
          max (observedReward (terminalHistory π ω) k -
            z (observedBox (terminalHistory π ω) k)) 0 else 0  := by sorry
Source
Finite policy and capped-reward foundations supporting Xie et al., author revised manuscript reviewed 23 October 2026, Appendix B.5, capped-reward identity in equation (42).

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