Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Reversibility is exactly detailed balance

Proved
KellyStochasticNetworks.reversible_iff_detailed_balance

by naimengye · Sep 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

markov-chainreversibilitystochastic-networks

Let π\piπ be a strictly positive collection of numbers on a state space SSS and let qqq be a matrix of transition rates. Write

q′(j,k)=π(k) q(k,j)π(j)q'(j,k) = \frac{\pi(k)\,q(k,j)}{\pi(j)}q′(j,k)=π(j)π(k)q(k,j)​

for the rates of the time-reversed process of Proposition 1.1. Then

q′=q⟺π(j) q(j,k)=π(k) q(k,j)  for all j,k∈S.q' = q \quad \Longleftrightarrow \quad \pi(j)\,q(j,k) = \pi(k)\,q(k,j) \ \text{ for all } j,k \in S.q′=q⟺π(j)q(j,k)=π(k)q(k,j)  for all j,k∈S.

In words: a stationary Markov process is reversible — indistinguishable from itself run backwards in time — precisely when its equilibrium distribution and its rates satisfy the detailed balance equations (1.4). This equivalence is the reason the book looks for equilibrium distributions by solving detailed balance: a solution of those equations is not merely an equilibrium distribution, it is a certificate of reversibility.

Formalization Note Equality of rate matrices is equality of the two functions of two arguments, and the hypothesis that π\piπ is strictly positive is needed in both directions because π(j)\pi(j)π(j) appears in a denominator.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Balance
Formal statement
namespace KellyStochasticNetworks

theorem reversible_iff_detailed_balance {S : Type*} (π : S → ℝ) (q : S → S → ℝ)
    (hπ : ∀ j, 0 < π j) : reversedRates π q = q ↔ DetailedBalance π q := by sorry

end KellyStochasticNetworks
Source
Kelly & Yudovina, Stochastic Networks, CUP 2014, p. 17 (PDF p. 25): 'If the reversed process has the same transition rates as the original process we call the process reversible. In order for this to hold, i.e. to have q(j,k) = q'(j,k), we need the following detailed balance equations to be satisfied', equation (1.4). sha256 ec271d555059aee58613e5e9a98b8346214b16185c527314f5d94c1ac8b17b6a
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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