Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.8 — Kolmogorov's criterion: a stationary Markov process is reversible iff (1.22) holds

Proved
KellyReversibility.Reversibility.process_kolmogorov_criterion

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

markov-processp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-bookp2o-v1reversibilitystochastic-networks

Let X(t)X(t)X(t), t∈Rt\in\mathbb Rt∈R, be a stationary Markov process on a finite state space S\mathcal SS with transition rates q(j,k)≥0q(j,k)\ge 0q(j,k)≥0 (q(j,j)=0q(j,j)=0q(j,j)=0), irreducible, with equilibrium distribution π\piπ. The process is reversible if and only if its transition rates satisfy

q(j1,j2)q(j2,j3)⋯q(jn−1,jn)q(jn,j1)=q(j1,jn)q(jn,jn−1)⋯q(j3,j2)q(j2,j1)(1.22)q(j_1,j_2)q(j_2,j_3)\cdots q(j_{n-1},j_n)q(j_n,j_1)=q(j_1,j_n)q(j_n,j_{n-1})\cdots q(j_3,j_2)q(j_2,j_1) \tag{1.22}q(j1​,j2​)q(j2​,j3​)⋯q(jn−1​,jn​)q(jn​,j1​)=q(j1​,jn​)q(jn​,jn−1​)⋯q(j3​,j2​)q(j2​,j1​)(1.22)

for any finite sequence of states j1,j2,…,jn∈Sj_1,j_2,\dots,j_n\in\mathcal Sj1​,j2​,…,jn​∈S.

Reversibility, a property of the joint laws of the process at all finite sets of times, is thus decided by the rates alone: a reversible process shows no net circulation around any cycle of states.

Formalization Note Reversibility is the distributional definition of p. 5: the finite-dimensional distributions π(j1)∏re(tr+1−tr)Q(jr,jr+1)\pi(j_1)\prod_r e^{(t_{r+1}-t_r)Q}(j_r,j_{r+1})π(j1​)∏r​e(tr+1​−tr​)Q(jr​,jr+1​) are invariant under t↦τ−tt\mapsto\tau-tt↦τ−t. It is not defined as detailed balance, and two-way communication (q(j,k)>0  ⟺  q(k,j)>0q(j,k)>0\iff q(k,j)>0q(j,k)>0⟺q(k,j)>0) is not assumed. The sequences in (1.22) have arbitrary length and may repeat states. The state space is finite (Kelly allows a countable one).


Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Balance
import Definitions.Def_KellyReversibility_Reversibility_StationaryLaw
import Definitions.Def_KellyReversibility_Reversibility_MarkovProcess
Formal statement
namespace KellyReversibility.Reversibility

/-- Theorem 1.8 (Kelly, p. 23). -/
theorem process_kolmogorov_criterion {S : Type*} [Fintype S] [DecidableEq S]
    (q : S → S → ℝ) (hq : ∀ j k, j ≠ k → 0 ≤ q j k) (hq0 : ∀ j, q j j = 0)
    (hirr : RatesIrreducible q)
    (π₀ : S → ℝ) (hπ₀ : IsEquilibrium π₀ q) :
    ProcessReversible q π₀ ↔ KolmogorovCycle q := by sorry

end KellyReversibility.Reversibility
Source
Kelly, Reversibility and Stochastic Networks, Wiley 1979, p. 23, Theorem 1.8, Eq. (1.22)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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