Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Dominance from finite discounted charge certificates

Proved
BanditAlgorithm.le_of_discounted_permutation_approximations

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

banditsdiscounted-rewardinequalities

Let 0≤α≤10\leq\alpha\leq10≤α≤1 and let u,v∈Ru,v\in\mathbb Ru,v∈R. Suppose that, for every ε>0\varepsilon>0ε>0, there are finite charge lists xxx and yyy such that: xxx is a permutation of yyy; yyy is nonincreasing; the discounted value of xxx approximates uuu from below up to ε\varepsilonε; and the discounted value of yyy approximates vvv from above up to ε\varepsilonε. Then u≤vu\leq vu≤v.

This packages the limiting step that converts finite prevailing-charge interleavings into a comparison of infinite-horizon policy values.

Preamble
import Theorems.Thm_BanditAlgorithm_discounted_list_value_le_of_perm_pairwise
Formal statement
theorem BanditAlgorithm.le_of_discounted_permutation_approximations
    {α u v : ℝ} (hα0 : 0 ≤ α) (hα1 : α ≤ 1)
    (hcert : ∀ ε : ℝ, 0 < ε →
      ∃ xs ys : List ℝ,
        xs.Perm ys ∧ ys.Pairwise (· ≥ ·) ∧
        u ≤ xs.foldr (fun z acc ↦ z + α * acc) 0 + ε ∧
        ys.foldr (fun z acc ↦ z + α * acc) 0 ≤ v + ε) :
    u ≤ v := by
  sorry
Source
Lattimore and Szepesvári, Bandit Algorithms (CUP 2020), proof of Theorem 35.9, Part 2, printed pp.452--453, using Lemma 35.10 on printed p.451. This is the epsilon/finite-certificate limiting form of that interleaving step.

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