The local stationary distribution is the marginal of the global one
ProvedMarkovEntanglement.local_stationary_eq_marginalStatement
Lemma. Let be a stationary distribution of the joint transition , and let be agent 's marginalised local transition. Then has stationary distribution
the marginal of the global occupancy measure onto agent 's coordinates.
Notes
A compatibility result that makes the occupancy-weighted norms meaningful. The global analysis weights states by ; the per-agent analysis weights them by . This lemma says the two agree — the local weighting is exactly the marginal of the global one, so no discrepancy is introduced when a global bound is projected onto one agent.
Without it, the per-agent bounds and the global bound would be measured against different reference distributions and could not be combined.
Search terms: marginal of stationary distribution, occupancy measure of a marginalised Markov chain, projected transition matrix, lumping of Markov chains.
import Mathlib import Definitions.Def_markov_entanglement_multi open scoped BigOperators open MarkovEntanglement
namespace MarkovEntanglement
theorem local_stationary_eq_marginal
{N : ℕ} {S : Fin N → Type*} [∀ i, Fintype (S i)] [∀ i, DecidableEq (S i)]
(P : Matrix (Joint S) (Joint S) ℝ) (hP : IsTransitionMatrix P)
(μ : Joint S → ℝ) (hμ : IsPositiveDist μ) (hstat : IsStationary P μ)
(i : Fin N) (Pi : Matrix (S i) (S i) ℝ)
(hPi : IsLocalTransitionN i P μ Pi) :
IsStationary Pi (marginalDist i μ) := by
sorry
end MarkovEntanglementRead-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back: local_stationary_eq_marginal
What the statement asserts. Fix a natural number and a family of types , each assumed finite and with decidable equality, and write
for the joint space (Joint S), a finite type with decidable equality. The statement quantifies over: a real matrix indexed by ; a real-valued function on ; an index ; and a real matrix indexed by ; subject to four hypotheses (all unfolded below). Its conclusion is a single equation scheme: the marginal of onto coordinate is a stationary distribution of , i.e.
where denotes the marginal defined below. Note that "is stationary" here is only this left-eigenvector equation with eigenvalue : it carries no nonnegativity claim, no claim that the entries sum to , and no uniqueness claim.
Every non-standard notion, unfolded.
- Marginal of the measure onto coordinate (
marginalDist): for ,
the sum of over all joint points whose -th coordinate is (the bracket is if the condition holds and otherwise).
- Marginal of the transition onto coordinate (
marginalN): for and ,
the probability mass that the row of at puts on the event "coordinate lands on ".
-
Hypothesis 1 — is a transition matrix (
IsTransitionMatrix): for all , and for every . (Row-stochastic only; no irreducibility, aperiodicity, or strict positivity.) -
Hypothesis 2 — is a strictly positive distribution (
IsPositiveDist): for every (strict, everywhere), and . -
Hypothesis 3 — is stationary for (
IsStationary): for every . -
Hypothesis 4 — is the local (marginalised) transition of agent induced by under (
IsLocalTransitionN), stated in the scaled, division-free form:
Both sides are multiplied through by the marginal weight, so no division occurs anywhere in the statement.
Constrained vs. free variables in the conclusion. Every variable occurring in the conclusion — , the family , the two typeclass instances, , , and — is bound by a binder of the theorem, and (and ) inside the stationarity equation are bound by its own universal quantifier; the conclusion contains no free variables. The joint matrix does not appear in the conclusion, but it is bound and it is what constrains through Hypothesis 4. Importantly, carries no hypothesis of its own beyond Hypothesis 4: it is never assumed to have nonnegative entries or rows summing to ; it is an arbitrary real matrix satisfying the displayed scaled identity. Because is strictly positive and (see below) each is nonempty, every marginal weight is strictly positive, so Hypothesis 4 in fact pins down uniquely as .
Joint satisfiability and degenerate cases. The hypotheses are jointly satisfiable, so the statement is not vacuous. A witness: any with all nonempty and finite, the uniform stochastic matrix on , the uniform distribution on (strictly positive, sums to , stationary for ), any index , and the uniform stochastic matrix on , which satisfies Hypothesis 4. More generally, given any and any strictly positive stationary , a matrix satisfying Hypothesis 4 always exists (by the division formula above, whose denominators are positive). Degenerate configurations that the quantifiers silently exclude or include:
- The hypothesis forces to be nonempty (an empty sum would be ), hence forces every to be nonempty.
- The binder can only be instantiated when ; for no such exists and the statement says nothing.
- Since every is nonempty, for each there is at least one with , so ; no marginal weight can vanish under these hypotheses.
Matrix inversion. No matrix inverse, no division, and no Ring.inverse occurs anywhere in this statement or in any of the definitions it unfolds to; the entire statement is built from finite sums, products of reals, and indicator functions. Consequently the question of what inversion returns on a non-invertible argument does not arise here, and no hypothesis is needed to rule it out. The only operations that could in principle produce junk values in Lean — division and subtraction on — are absent: Hypothesis 4 is deliberately written in multiplied-through form precisely so that no quotient by a possibly-zero marginal appears.
Confirmed by the mission captain (proposal self-audit).