Detailed balance implies the equilibrium equations
ProvedKellyStochasticNetworks.detailedBalance_implies_fullBalanceLet be a state space, a matrix of transition rates and a collection of real numbers. If and satisfy the detailed balance equations
then satisfies the equilibrium equations
This is the observation, made on p. 17 of the book, that licenses the whole method of Chapters 1 to 3: detailed balance is a two-term relation that can be solved by inspection, full balance is not, and detailed balance is the stronger of the two. The converse fails — a Markov process may have an equilibrium distribution without being reversible.
Formalization Note No summability hypothesis is needed: the two families being summed agree term by term, so their unconditional sums agree whether or not either family is summable.
import Mathlib import Definitions.Def_KellyStochasticNetworks_Balance
namespace KellyStochasticNetworks
theorem detailedBalance_implies_fullBalance {S : Type*} (π : S → ℝ) (q : S → S → ℝ)
(h : DetailedBalance π q) : FullBalance π q := by sorry
end KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.