Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§9, p. 25 — positive lower bound on the growth coefficient

Proved
TDApprox.Sampling.delta_lower_bound

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

counterexampleinequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1temporal-difference

Suppose 0<α<10<\alpha<10<α<1, p1,p2≥0p_1,p_2\ge0p1​,p2​≥0, p1+p2≤1p_1+p_2\le1p1​+p2​≤1, p2>5/(6α)p_2>5/(6\alpha)p2​>5/(6α), and 0≤q2≤q10\le q_2\le q_10≤q2​≤q1​ with q1>0q_1>0q1​>0. For the coefficient Δ\DeltaΔ in the specialized mean recurrence,

Δ≥(6αp2−5)q1>0.\Delta\ge(6\alpha p_2-5)q_1>0.Δ≥(6αp2​−5)q1​>0.

Thus the mean update has a strictly positive growth factor whenever the step size is positive. The result isolates the paper's numerical threshold 5/65/65/6.

Formalization Note The explicit value ε=6αp2−5\varepsilon=6\alpha p_2-5ε=6αp2​−5 witnesses the paper's assertion that some positive ε\varepsilonε exists.

Preamble
import Mathlib
import Definitions.Def_TDApprox_Sampling_Model
Formal statement
namespace TDApprox.Sampling

theorem delta_lower_bound
    (α p₁ p₂ q₁ q₂ : ℝ)
    (hα0 : 0 < α) (hα1 : α < 1)
    (hp₁ : 0 ≤ p₁) (hp₂ : 0 ≤ p₂) (hpsum : p₁ + p₂ ≤ 1)
    (hpbig : 5 / (6 * α) < p₂)
    (hq₂ : 0 ≤ q₂) (hqle : q₂ ≤ q₁) (hq₁ : 0 < q₁) :
    (6 * α * p₂ - 5) * q₁ ≤
        (α * p₁ + 2 * α * p₂ - 1) * q₁ +
          2 * (α * p₁ + 2 * α * p₂ - 2) * q₂ ∧
      0 < 6 * α * p₂ - 5 := by sorry

end TDApprox.Sampling
Source
Tsitsiklis & Van Roy, LIDS-P-2322 (1996), Theorem 3 proof, p. 25, Δ_t lower bound; https://dspace.mit.edu/entities/publication/ab395d25-a6d3-407a-9589-60eaac58fd05
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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