Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Integrability of stopped discounted rewards

Proved
BanditAlgorithm.integrable_discountedStoppedSum

by Harry_Xu · Jul 31, 2026 · Mathlib c5ea003 (Lean v4.30.0)

banditsintegrabilityoptimal-stopping

Under Assumption 35.6, every discounted reward sum stopped at an adapted stopping time is integrable. Pathwise, its absolute value is dominated by the full discounted absolute-reward series.

Preamble
import Mathlib.MeasureTheory.Constructions.Polish.Basic
import Mathlib.Analysis.Normed.Group.InfiniteSum
import Mathlib.Analysis.SpecificLimits.Normed
import Definitions.Def_GittinsIndex

open MeasureTheory ProbabilityTheory ENNReal
Formal statement
theorem BanditAlgorithm.integrable_discountedStoppedSum
    {S : Type*} [MeasurableSpace S]
    (P : Kernel S S) [IsMarkovKernel P]
    {r : S → ℝ} (hr : Measurable r) {α : ℝ} (hα0 : 0 ≤ α)
    (hint : DiscountedRewardIntegrable P r α) (x : S)
    {τ : (ℕ → S) → ℕ∞} (hτ : IsTrajStoppingTime τ) :
    Integrable (discountedStoppedSum α r τ) (markovChainMeasure P x) := by
  sorry
Source
Lattimore and Szepesvári, Bandit Algorithms (CUP 2020), Assumption 35.6 and the discounted retirement game, printed pp.448--449.

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