Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Capped payoff integrability and expected opened-box excess

Proved
PandoraBO.Private20261023.policy_capped_integrability_and_excess

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

independenceintegrabilitypandoras-box

The maximum of capped box rewards and the total positive excess over reservation indices among opened boxes are integrable. Their expected total opened excess equals the multiplier times expected opening cost. The equality uses the independent reward laws, nonanticipative policies, distinct openings, and the reservation-root equations.

Preamble
import Definitions.Def_PandoraBO_Model
open MeasureTheory
set_option autoImplicit false
attribute [local instance] Classical.propDecidable
Formal statement
theorem PandoraBO.Private20261023.policy_capped_integrability_and_excess {n : ℕ} (M : PandoraBO.Instance n) (multiplier : ℝ)
    (z : PandoraBO.Box n → ℝ) (hz : PandoraBO.reservationIndices M multiplier z)
    (π : PandoraBO.Policy n) :
    Integrable (fun ω : PandoraBO.Outcome n =>
      PandoraBO.fullInformationPayoff (fun i => min (ω.1 i) (z i))) (PandoraBO.jointLaw M) ∧
    Integrable (fun ω : PandoraBO.Outcome n => ∑ k : Fin (n + 1),
      if PandoraBO.occupied (PandoraBO.terminalHistory π ω) k then
        max (PandoraBO.observedReward (PandoraBO.terminalHistory π ω) k -
          z (PandoraBO.observedBox (PandoraBO.terminalHistory π ω) k)) 0 else 0)
      (PandoraBO.jointLaw M) ∧
    (∫ ω : PandoraBO.Outcome n, ∑ k : Fin (n + 1),
      if PandoraBO.occupied (PandoraBO.terminalHistory π ω) k then
        max (PandoraBO.observedReward (PandoraBO.terminalHistory π ω) k -
          z (PandoraBO.observedBox (PandoraBO.terminalHistory π ω) k)) 0 else 0
      ∂PandoraBO.jointLaw M) = multiplier * PandoraBO.expectedCost M π := by sorry
Source
Auxiliary expectation identity in the capped-reward proof of Weitzman optimality for the finite independent Pandora model.

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