Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 4 — the unwidened region contains an MDP of diameter at most 1/ζ

Proved
NonstatRL.NoWidening.proposition4_diameter_le_inv_zeta

by mikedeng1 · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

confidence-regiondiametermdpnon-stationaryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider a nonstationary finite MDP with at least two states and a nonempty allowed action set at each state. Assume uniform one-step reachability: for every ordered pair of states (s,s′)(s,s')(s,s′), a fixed allowed action a(s,s′)a_{(s,s')}a(s,s′)​ moves from sss to s′s's′ with probability at least ζ>0\zeta>0ζ>0 at every time before the horizon. Let 0<δ<10<\delta<10<δ<1, and condition on the transition estimation event EpE_pEp​ at any time ttt in an episode with start τm≤t\tau_m\le tτm​≤t.

There exists a finite MDP MwM_wMw​ such that all its allowed transition rows lie in the unwidened confidence region Hp,t(0)H_{p,t}(0)Hp,t​(0) and

D(Mw)≤1ζ.D(M_w)\le\frac1\zeta.D(Mw​)≤ζ1​.

The proposition shows that, under Assumption 2, the algorithm's transition region already contains a model with a controlled diameter without confidence widening.

Formalization Note Paper time t∈[T]t\in[T]t∈[T] is Lean index t−1<Tt-1<Tt−1<T; the window is [τm-W,t) in zero-based indices. The event is the ℓ1\ell_1ℓ1​ estimation condition at this time. The diameter includes return times and minimizes over allowed deterministic stationary policies. The pins S>1S>1S>1 and 0<δ<10<\delta<10<δ<1 exclude a small-state radius failure; the constructed MDP must satisfy the region condition at every allowed pair. Disallowed rows and rewards are irrelevant.

Preamble
import Mathlib
import Definitions.Def_NonstatRL_PerStep_Window

open BanditAlgorithm
Formal statement
namespace NonstatRL.NoWidening

theorem proposition4_diameter_le_inv_zeta {S A : ℕ} (hS : 1 < S)
    (M : ℕ → FiniteMDP S A) (As : Fin S → Finset (Fin A))
    (hAs : ∀ s, (As s).Nonempty) (T : ℕ)
    (δ : ℝ) (hδ : 0 < δ ∧ δ < 1)
    (st : ℕ → Fin S) (ac : ℕ → Fin A) (W τm t : ℕ)
    (hτ : τm ≤ t) (ht : t < T)
    (ζ : ℝ) (hζ : 0 < ζ) (a₂ : Fin S → Fin S → Fin A)
    (ha₂ : ∀ s s', a₂ s s' ∈ As s)
    (hreach : ∀ q < T, ∀ s s', ζ ≤ ((M q).P s (a₂ s s') s' : ℝ))
    (hEp : NonstatRL.PerStep.EventP M As T δ st ac (τm - W) t) :
    ∃ Mw : FiniteMDP S A,
      (∀ s, ∀ a ∈ As s,
        (fun s' => (Mw.P s a s' : ℝ)) ∈ NonstatRL.PerStep.Hp As T δ st ac (τm - W) t 0 s a) ∧
      NonstatRL.Oracle.diameter Mw As ≤ ENNReal.ofReal (1 / ζ) := by sorry

end NonstatRL.NoWidening
Source
Cheung, Simchi-Levi & Zhu, Non-Stationary Reinforcement Learning: The Blessing of (More) Optimism, arXiv:1906.02922v4, p. 21, Proposition 4; proof pp. 49–50
Human review
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 16, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me