How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Markov relative entropy decay and almost-sure time averages
Statement
Assume the Axiom of Choice The Axiom of Choice, countable choice The Axiom of Countable Choice (), and the model of Finite reversible stochastic rate model. For any initial probability vector , let , where is supplied by Nonexplosive finite continuous-time chain and reversible spectral gap, and define the dimensionless relative information For every , for all states and At a positive time the derivative vanishes exactly when , and as .
For every bounded observable and every initial law, the actual continuous-time average satisfies Under stationary preparation, with and spectral gap from Nonexplosive finite continuous-time chain and reversible spectral gap,
Facts & Assumptions
Given: Choice, countable choice, the connected finite reversible rate model, and its stationary semigroup.
The Axiom of Choice: every family of nonempty sets has a choice function.
The Axiom of Countable Choice (): every countable sequence of nonempty sets has a choice function.
Finite reversible stochastic rate model: the finite rates obey , the positive-rate graph is connected, and is the row generator with off-diagonal entries .
Nonexplosive finite continuous-time chain and reversible spectral gap: , the only zero eigenfunctions of are constants, the nonzero eigenvalues are with , and for initial law there is a jointly measurable stationary process on .
Green–Kubo covariance limit under absolute integrability: for a jointly measurable, centered, second-order stationary process with absolutely integrable covariance, the variance of its time integral is the double-integral covariance formula and its covariance divided by tends to the integrated covariance.
Proof
Given: [A1]–[A2] and [F1]–[F3].
Choose and set . By [F1], is stochastic with positive diagonal, and for any distinct a positive-rate path of length gives ; for take . By [F2], . Every summand is nonnegative and the term for this is strictly positive, so for every . Hence .
The eigenbasis in [F2] gives, for centered , for . Thus and . The process is centered, jointly measurable and second-order stationary; the spectral sum makes its covariance absolutely integrable. By [F3] the variance of its time integral is the double-integral covariance formula. Dividing by and bounding proves the stated variance bound.
For , differentiate the finite sum defining ; the mass derivative is zero, so . Use and pair the directed and terms with the symmetric conductance . This gives the displayed negative half-sum. For positive , , with equality only at , since . Connectedness forces all equal when the sum vanishes; normalization then gives and .
Fix a reference time and put . For every , the pointwise inequality applied to , together with step 1.2, gives . For each , the probability that one of these events occurs for some is at most the corresponding tail sum, which tends to zero. Thus only finitely many occur almost surely. Applying this argument to for each positive integer proves convergence to zero along , almost surely.
Let . For , . Hence the time averages converge to zero for stationary initial law. For any future-path event and state , let be its probability under the common transition kernels started from . Then , so the forward path law from has density relative to the stationary path law. This density is bounded because is finite and every . Every stationary null event, including failure of the almost-sure limit, is therefore null for every initial preparation. Adding proves the claimed limit.
Exponential convergence in [F2] gives entrywise. The function extends continuously to by value zero, so the finite sum tends to zero. Combined with step 2.1 this proves all the relative-information claims.