Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 (ACω), and the model E,π,w,Q of Finite reversible stochastic rate model. For any initial probability vector p0, let pt=p0Pt, where Pt=etQ is supplied by Nonexplosive finite continuous-time chain and reversible spectral gap, and define the dimensionless relative information D(pt∥π):=∑a∈Epa(t)log⁡pa(t)πa,0log⁡0:=0. For every t>0, pa(t)>0 for all states and ddtD(pt∥π)=−12∑a∈E∑b≠aπawab(rb(t)−ra(t))(log⁡rb(t)−log⁡ra(t))≤0,ra(t):=pa(t)πa. At a positive time the derivative vanishes exactly when pt=π, and D(pt∥π)→0 as t→∞.

For every bounded observable A:E→R and every initial law, the actual continuous-time average satisfies 1T∫0TA(Xs) ds⟶π(A)almost surely as T→∞. Under stationary preparation, with Ac=A−π(A) and spectral gap λ∗ from Nonexplosive finite continuous-time chain and reversible spectral gap, Var⁡π ⁣(1T∫0TA(Xs) ds)≤2∥Ac∥L2(π)2λ∗T.

Facts & Assumptions

Given: Choice, countable choice, the connected finite reversible rate model, and its stationary semigroup.

[A1]

The Axiom of Choice: every family of nonempty sets has a choice function.

[A2]

The Axiom of Countable Choice (ACω): every countable sequence of nonempty sets has a choice function.

[F1]

Finite reversible stochastic rate model: the finite rates obey πawab=πbwba, the positive-rate graph is connected, and Q is the row generator with off-diagonal entries wab.

[F2]

Nonexplosive finite continuous-time chain and reversible spectral gap: Pt=etQ, the only zero eigenfunctions of Q are constants, the nonzero eigenvalues are −λj with λj>0, and for initial law π there is a jointly measurable stationary process on R.

[F3]

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 2T tends to the integrated covariance.

Proof

Given: [A1]–[A2] and [F1]–[F3].

1.1A1F1F2algebra

Choose Λ>max⁡aqa and set K=I+Q/Λ. By [F1], K is stochastic with positive diagonal, and for any distinct a,b a positive-rate path of length k gives Kabk>0; for a=b take k=0. By [F2], Pt=etQ=e−Λt∑n≥0(Λt)nKn/n!. Every summand is nonnegative and the term for this k is strictly positive, so Pt(a,b)>0 for every t>0. Hence pt(b)=∑ap0(a)Pt(a,b)>0.

1.2A1A2F2F3algebra

The eigenbasis in [F2] gives, for centered Ac=∑j≥1ajϕj, CA(s):=Eπ[Ac(X0)Ac(Xs)]=⟨Ac,PsAc⟩π=∑j≥1aj2e−λjs for s≥0. Thus CA(s)≥0 and ∫0∞CA(s) ds=∑j≥1aj2/λj≤∥Ac∥L2(π)2/λ∗. The process Ac(Xs) 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 T2 and bounding T−s≤T proves the stated variance bound.

2.1F1step 1.1algebra

For t>0, differentiate the finite sum defining D; the mass derivative ∑apa′(t) is zero, so D′(t)=∑apa′(t)log⁡ra(t)=∑a∑b≠apa(t)wab(log⁡rb(t)−log⁡ra(t)). Use pa=πara and pair the directed (a,b) and (b,a) terms with the symmetric conductance πawab=πbwba. This gives the displayed negative half-sum. For positive x,y, (x−y)(log⁡x−log⁡y)≥0, with equality only at x=y, since log⁡x−log⁡y=∫yxdu/u. Connectedness forces all ra equal when the sum vanishes; normalization then gives ra=1 and pt=π.

2.2F2step 1.2algebra

Fix a reference time t∗>0 and put Tn=n2t∗. For every ε>0, the pointwise inequality 1{∣Y∣>ε}≤Y2/ε2 applied to Y=Tn−1∫0TnAc(Xs) ds, together with step 1.2, gives ∑n=1∞Pr⁡π(∣Y∣>ε)≤2∥Ac∥L2(π)2λ∗ε2t∗∑n=1∞n−2<∞. For each N, the probability that one of these events occurs for some n≥N is at most the corresponding tail sum, which tends to zero. Thus only finitely many occur almost surely. Applying this argument to ε=1/k for each positive integer k proves convergence to zero along Tn, almost surely.

3.1A1F1F2step 2.2algebra

Let M=max⁡a∈E∣Ac(a)∣. For Tn≤T≤Tn+1, ∣T−1∫0TAc(Xs)ds−Tn−1∫0TnAc(Xs)ds∣≤2M(Tn+1−Tn)/Tn→0. Hence the time averages converge to zero for stationary initial law. For any future-path event H and state a, let μa(H) be its probability under the common transition kernels started from a. Then Pr⁡p0(H)=∑ap0(a)μa(H)=Eπ[(p0(X0)/π(X0))1H], so the forward path law from p0 has density p0(X0)/π(X0) relative to the stationary path law. This density is bounded because E is finite and every πa>0. Every stationary null event, including failure of the almost-sure limit, is therefore null for every initial preparation. Adding π(A) proves the claimed limit.

4.1F2step 2.1∎

Exponential convergence in [F2] gives pt→π entrywise. The function x↦xlog⁡(x/πa) extends continuously to x=0 by value zero, so the finite sum D(pt∥π) tends to zero. Combined with step 2.1 this proves all the relative-information claims.

Depends on

Dependency tree · 2 levels

Sources