Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 4.3, pp. 33–34 — exponentially weighted row sums of D = Σ Cⁿ are at most 1/(1 − c)

Proved
LocalPF.Block.lemma_4_3

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

decay-of-correlationsmatrix-seriesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let III be a finite set, mmm a pseudometric on III (real valued, m(i,i)=0m(i,i)=0m(i,i)=0, symmetric, satisfying the triangle inequality), and C=(Cij)i,j∈IC=(C_{ij})_{i,j\in I}C=(Cij​)i,j∈I​ a matrix with nonnegative entries such that

max⁡i∈I∑j∈Iem(i,j)Cij≤c<1.\max_{i\in I}\sum_{j\in I}e^{m(i,j)}C_{ij}\le c<1.i∈Imax​j∈I∑​em(i,j)Cij​≤c<1.

Then the series D=∑n≥0CnD=\sum_{n\ge0}C^nD=∑n≥0​Cn converges, and

max⁡i∈I∑j∈Iem(i,j)Dij≤11−c.\max_{i\in I}\sum_{j\in I}e^{m(i,j)}D_{ij}\le\frac1{1-c}.i∈Imax​j∈I∑​em(i,j)Dij​≤1−c1​.

In particular, for every nonempty J⊆IJ\subseteq IJ⊆I and every iii,

∑j∈JDij≤e−m(i,J)1−c,m(i,J)=min⁡j∈Jm(i,j).\sum_{j\in J}D_{ij}\le\frac{e^{-m(i,J)}}{1-c},\qquad m(i,J)=\min_{j\in J}m(i,j).j∈J∑​Dij​≤1−ce−m(i,J)​,m(i,J)=j∈Jmin​m(i,j).

The lemma turns exponential decay of Dobrushin's matrix CCC into exponential decay of DDD, which is how decay of correlations enters the comparison theorem.

Formalization Note Convergence of ∑nCn\sum_n C^n∑n​Cn is part of the conclusion (as the existence of DDD with HasSum). The case J=∅J=\varnothingJ=∅ of the last bound is trivial (0≤⋅0\le\cdot0≤⋅) and is omitted.

Preamble
import Mathlib
import Definitions.Def_LocalPF_Block_Setting

open MeasureTheory
open scoped ENNReal
Formal statement
namespace LocalPF.Block

/-- Lemma 4.3 (pp. 33–34). -/
theorem lemma_4_3 {I : Type*} [Fintype I] [DecidableEq I] (m : I → I → ℝ) (hm_self : ∀ i, m i i = 0)
    (hm_symm : ∀ i j, m i j = m j i) (hm_triangle : ∀ i j k, m i k ≤ m i j + m j k)
    (C : Matrix I I ℝ) (hC : ∀ i j, 0 ≤ C i j) (c : ℝ) (hc : c < 1)
    (hCc : ∀ i, ∑ j, Real.exp (m i j) * C i j ≤ c) :
    ∃ D : Matrix I I ℝ, HasSum (fun n : ℕ => C ^ n) D ∧
      (∀ i, ∑ j, Real.exp (m i j) * D i j ≤ 1 / (1 - c)) ∧
      ∀ (i : I) (J : Finset I) (hJ : J.Nonempty),
        ∑ j ∈ J, D i j ≤ Real.exp (-(J.inf' hJ (m i))) / (1 - c) := by sorry

end LocalPF.Block
Source
Rebeschini & van Handel, Can Local Particle Filters Beat the Curse of Dimensionality?, arXiv:1301.6585v2 (reprint of Ann. Appl. Probab. 25(5), 2015), pp. 33–34, Lemma 4.3
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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