Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8, p. 19 — w.p. ≥ 1 − δ over ς ∼ Unif(0,ξ), {a : Q̂(s,a) > V̂(s) − ς} is unchanged for every Q within ξδ/(8|S||A|) of Q̂

Proved
BreakingSample.Conservative.lemma_8

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

conservative-planningp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1probabilitystability

Let S\mathcal SS, A\mathcal AA be finite with A\mathcal AA nonempty, let Q^:S×A→R\widehat Q : \mathcal S\times\mathcal A\to\mathbb RQ​:S×A→R be any Q-function and V^(s)=max⁡aQ^(s,a)\widehat V(s) = \max_a \widehat Q(s,a)V(s)=maxa​Q​(s,a) its associated value function, and let ξ>0\xi > 0ξ>0, δ>0\delta > 0δ>0. Draw ς∼Unif(0,ξ)\varsigma \sim \mathrm{Unif}(0,\xi)ς∼Unif(0,ξ). Then with probability at least 1−δ1-\delta1−δ the following holds simultaneously for all Q-functions QQQ (with associated value function V(s)=max⁡aQ(s,a)V(s) = \max_a Q(s,a)V(s)=maxa​Q(s,a)) obeying

max⁡s,a∣Q(s,a)−Q^(s,a)∣≤ξδ8∣S∣∣A∣:\max_{s,a} \big|Q(s,a) - \widehat Q(s,a)\big| \le \frac{\xi\delta}{8|\mathcal S||\mathcal A|}:s,amax​​Q(s,a)−Q​(s,a)​≤8∣S∣∣A∣ξδ​: ∀s∈S,{a∈A:Q^(s,a)>V^(s)−ς}={a∈A:Q(s,a)>V(s)−ς}.\forall s \in \mathcal S, \qquad \{a \in \mathcal A : \widehat Q(s,a) > \widehat V(s) - \varsigma\} = \{a\in\mathcal A : Q(s,a) > V(s) - \varsigma\}.∀s∈S,{a∈A:Q​(s,a)>V(s)−ς}={a∈A:Q(s,a)>V(s)−ς}.

Consequently the conservative policy computed from Q^\widehat QQ​ does not change under small perturbations of Q^\widehat QQ​, which is what allows it to be represented by policies independent of the samples of one pair (s,a)(s,a)(s,a).

Formalization Note The probability is the Unif(0,ξ)\mathrm{Unif}(0,\xi)Unif(0,ξ) measure (outer measure if not measurable) of the failure event, bounded by δ\deltaδ. The quantifier over QQQ is inside the event.

Preamble
import Mathlib
import Definitions.Def_BreakingSample_Perturbed_Sampling
import Definitions.Def_BreakingSample_Conservative_Rule
Formal statement
namespace BreakingSample.Conservative

theorem lemma_8 {S A : Type} [Fintype S] [Fintype A] [Nonempty A]
    (Qhat : S → A → ℝ) (ξ δ : ℝ) (hξ : 0 < ξ) (hδ : 0 < δ) :
    BreakingSample.Perturbed.unifInterval ξ {ς : ℝ | ¬ ∀ Q : S → A → ℝ,
        (∀ s a, |Q s a - Qhat s a| ≤ ξ * δ / (8 * (Fintype.card S : ℝ) * (Fintype.card A : ℝ))) →
        ∀ s, {a : A | maxQ Qhat s - ς < Qhat s a} = {a : A | maxQ Q s - ς < Q s a}}
      ≤ ENNReal.ofReal δ := by sorry

end BreakingSample.Conservative
Source
arXiv:2005.12900v8, Lemma 8, p. 19, (54)–(55); proof in App. B.7, pp. 33–34
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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