Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Finite-time fluctuation identity for stationary path entropy

Statement

Let E be a finite nonempty state set and let qxy≥0 be finite time-homogeneous transition rates for x≠y. Put λx:=∑y≠xqxy. Assume the positive-rate graph is irreducible (every ordered pair of states is joined by a finite directed path of positive-rate edges), the rates have symmetric support qxy>0 if and only if qyx>0, and π is a strictly positive probability row vector satisfying πQ=0 for the row generator Q. The forward equation shows that π is a stationary law when used as the initial distribution. Start the process with law π, and define ST by the stationary path-entropy definition for any finite nonnegative horizon T.

For every Borel set B⊆R, the path law and its time reversal obey

P(ST∈B)=∫−Be−u μT(du),E[e−ST]=1,E[ST]≥0,

where μT(C):=P(ST∈C) and −B:={−s:s∈B}. Equivalently, as a measure identity, μT(ds)=esμT(−ds). The identity is exact at finite time and does not assume that μT has a density.

Facts & Assumptions

Given: A finite state set, finite rates, symmetric support, an irreducible positive-rate graph, a strictly positive stationary probability vector π, a finite horizon T≥0, and Countable Choice for the Lebesgue path-space densities.

[F1]

Finite-state continuous-time Markov jump processes with bounded rates: a time-homogeneous finite-state process has row generator Qxy=qxy for x≠y and Qxx=−λx.

[F2]

Path densities and finite jump counts for bounded finite-state rates: the density of a path with state sequence x0,…,xn and ordered jump times is its initial mass times the product of jump rates and holding-time survival factors; the jump count has finite expectation.

[F3]

Forward equation and stationary laws for finite-state rate processes: if πQ=0 and X0∼π, then Xt∼π throughout [0,T].

[F4]

Stationary path entropy for a finite-state jump process: ST is the sum over jumps of log⁡(πxj−1qxj−1xj/(πxjqxjxj−1)), with an empty sum equal to zero.

[F5]

The Axiom of Countable Choice (ACω): every countable family of nonempty sets has a choice function; this is used through the Lebesgue path-density prerequisite.

[F7]

Expectation of a nonnegative or integrable random variable, The Lebesgue integral is linear on L1(μ), and The nonnegative Lebesgue integral: expectation is integration, the integral is linear on integrable functions, and the integral of a nonnegative function is nonnegative.

[F8]

A continuous map has Borel preimages of Borel sets: a continuous real-valued map has Borel preimages of Borel sets; in particular, reflection sends Borel sets to Borel sets.

Proof

Given: The finite-state process, stationary initial law, symmetric support, and hypotheses in the Statement.

1.1F1F3givenalgebra

Since X0∼π and πQ=0, [F3] gives P(Xt=x)=πx for every x∈E and every t∈[0,T]. Thus the process is stationary on the whole interval under the stated initial law.

1.2givenF1F2F4algebra

Fix a path with n jumps, state sequence x0,…,xn and times 0<t1<⋯<tn<T. Its density is f(γ)=πx0(∏j=1nqxj−1xj)exp⁡(−∑j=0nλxj(tj+1−tj)), where t0=0 and tn+1=T, by [F2]. The reversed path has state sequence xn,…,x0 and jump times T−tn,…,T−t1, and its holding-time exponent is the same because it spends exactly the same duration in each state. If any forward jump rate in the sequence is zero, symmetric support makes the corresponding reversed rate zero too, so both path densities vanish and the sequence contributes nothing. On every sequence with positive density, symmetric support makes all reversed jump rates positive. The ratio of forward to reversed density is therefore f(γ)f(γ†)=πx0πxn∏j=1nqxj−1xjqxjxj−1=∏j=1nπxj−1qxj−1xjπxjqxjxj−1=eST(γ). The middle equality telescopes the factors πxj−1/πxj; for n=0 both densities are positive and their ratio is 1.

2.1F2F5F7F8F9step 1.2algebra

For n=0, reversal fixes the no-jump path. For n≥1, time reversal sends (t1,…,tn) to (T−tn,…,T−t1). This is an affine bijection of the ordered time simplex; its linear part is minus a coordinate-reversal permutation matrix, whose determinant has absolute value 1. Thus [F9] shows it preserves Lebesgue measure and transports each nonnegative density integral to the reversed-path integral. The map also reverses the finite state sequence and sends ST to −ST. Thus −B is Borel by [F8]. Integrating the density identity in step 1.2 over paths with ST∈B, and using the measure-preserving change of variables, gives μT(B)=∫{ST∈−B}e−ST dP=∫−Be−u μT(du). The countable union over n covers all paths by [F2]. Taking B=R gives E[e−ST]=1. The same identity is equivalent, by the change of variable u=−s, to μT(ds)=esμT(−ds) as an equality of measures.

3.1F2F4F6F7step 2.1algebra∎

There are finitely many directed edges, all nonzero forward and reverse rates are positive, and every πx>0. Thus the absolute value of each jump increment in [F4] is bounded by a finite constant C; if there are no edges, set C=0. Hence ∣ST∣≤CNT, and [F2] gives E∣ST∣<∞. For every z>0, the function g(z):=z−1−log⁡z has g(1)=0 and derivative g′(z)=1−1/z, negative on (0,1) and positive on (1,∞); the mean value theorem [F6] gives g(z)≥0. Apply this pointwise with z=e−ST. The function g(e−ST) is nonnegative and integrable because ST is integrable and E[e−ST]=1; its expectation is therefore nonnegative. By linearity [F7] and log⁡(e−ST)=−ST, 0≤E[g(e−ST)]=E[e−ST]−1+E[ST]=E[ST]. Therefore E[ST]≥0.

Depends on

Dependency tree · 2 levels

Sources