Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.1, p. 11 — if Qv ≤ v − f for a non-negative kernel Q, f ≥ 0 and finite v ≥ 0, then Σₙ Qⁿf ≤ v

Proved
LyapDiffMC.RandomHorizon.proposition_3_1

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

comparison-theoremlyapunov-functionmarkov-kernelp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1potential-kernel

Let Q=(Q(x,dy):x,y∈C)Q=(Q(x,dy):x,y\in C)Q=(Q(x,dy):x,y∈C) be a non-negative kernel on a measurable space CCC, and let f:C→[0,∞)f:C\to[0,\infty)f:C→[0,∞) be measurable. Suppose v:C→[0,∞)v:C\to[0,\infty)v:C→[0,∞) is a finite-valued measurable function with

Qv≤v−f,(3.15)Qv\le v-f,\tag{3.15}Qv≤v−f,(3.15)

that is, ∫v(y)Q(x,dy)≤v(x)−f(x)\int v(y)Q(x,dy)\le v(x)-f(x)∫v(y)Q(x,dy)≤v(x)−f(x) for every x∈Cx\in Cx∈C. Then

∑n=0∞Qnf≤v,(3.16)\sum_{n=0}^\infty Q^nf\le v,\tag{3.16}n=0∑∞​Qnf≤v,(3.16)

where Q0(x,dy)=δx(dy)Q^0(x,dy)=\delta_x(dy)Q0(x,dy)=δx​(dy) and Qn+1(x,A)=∫Qn(x,dy)Q(y,A)Q^{n+1}(x,A)=\int Q^n(x,dy)Q(y,A)Qn+1(x,A)=∫Qn(x,dy)Q(y,A).

This comparison bound drives the proof of Theorem 3.1. Applied to (3.11) it gives ∑nKn(θ)∣f~(θ)∣≤v0\sum_nK^n(\theta)|\tilde f(\theta)|\le v_0∑n​Kn(θ)∣f~​(θ)∣≤v0​. Applied to (3.12) it bounds the GGG-integrals that control the derivative.

Formalization Note The space CCC is an arbitrary measurable space SSS, and the kernel need not be finite. fff and vvv are [0,∞][0,\infty][0,∞]-valued with vvv finite everywhere, and (3.15) is written as Qv+f≤vQv+f\le vQv+f≤v.

Differences from the source:

  • encoding: Q = (Q(x, dy) : x, y ∈ C) a non-negative kernel, f : C → ℝ₊, v : C → ℝ₊ finite-valued → Q : Kernel S S on an arbitrary measurable space S (playing C), f v : S → ℝ≥0∞ measurable, v x ≠ ⊤; reason: C is itself a measurable space; (3.15) with v finite forces f ≤ v < ∞, so allowing f to take the value ∞ adds no instance; measurability is needed for Qv and Qⁿf to be defined
  • encoding: Qv ≤ v − f (3.15) → ∫ v dQ(x, ·) + f(x) ≤ v(x) for all x, in ℝ≥0∞; reason: equivalent because v is finite
  • encoding: Q⁰ = I, Qⁿ = QQⁿ⁻¹ → Qpow Q 0 = Kernel.id, Qpow Q (n+1) = Q ∘ₖ Qpow Q n; reason: the same kernel (composition is associative); Σₙ Qⁿf as a sum in ℝ≥0∞
Preamble
import Mathlib
import Definitions.Def_LyapDiffMC_RandomHorizon_Model

open MeasureTheory ProbabilityTheory
open scoped ENNReal
Formal statement
namespace LyapDiffMC.RandomHorizon

/-- Proposition 3.1 (p. 11). For a non-negative kernel `Q`, a non-negative `f` and a
finite-valued non-negative `v` with `Qv ≤ v - f` (3.15), `Σₙ Qⁿ f ≤ v` (3.16). The measurable
space `S` plays the role of the paper's `C`; (3.15) is written additively, `Qv + f ≤ v`, which is
equivalent because `v` is finite. -/
theorem proposition_3_1 {S : Type*} [MeasurableSpace S] (Q : Kernel S S)
    (f v : S → ℝ≥0∞) (hf : Measurable f) (hv : Measurable v) (hv_fin : ∀ x, v x ≠ ⊤)
    (h315 : ∀ x, ∫⁻ y, v y ∂(Q x) + f x ≤ v x) :
    ∀ x, ∑' n, ∫⁻ y, f y ∂(Qpow Q n x) ≤ v x := by sorry

end LyapDiffMC.RandomHorizon
Source
Rhee, Glynn, Lyapunov Conditions for Differentiability of Markov Chain Expectations, arXiv:1707.03870v1, p. 11, Proposition 3.1, (3.15)–(3.16)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

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