Alphabeta Math
Pipeline-generated
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.

Path entropy production, fluctuation symmetry and work identities

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite-state continuous-time Markov jump processes with bounded rates

Definition

Fix a finite nonempty set of states E, equipped with the discrete sigma-algebra P(E) consisting of all subsets of E, and a finite time horizon T≥0. A finite-state continuous-time Markov jump process on [0,T] is a family of measurable maps Xt:(Ω,F)→(E,P(E)) on a probability space (Ω,F,P). Thus each Xt is a random element of this measurable state space. Its paths are constant between successive jump times and take the new state at a jump time (right-continuity); path events use the sigma-algebra generated by the coordinate maps Xt. The Markov property here means that, conditional on the history through time s, the law of the future path depends on that history only through (s,Xs). For each pair of distinct states x,y∈E, its transition rate κxy:[0,T]→[0,∞) is a bounded continuous function. Write

λx(t):=∑y∈E, y≠xκxy(t).

All time integrals without a displayed measure below are oriented Riemann integrals. When a continuous integrand is used as a Lebesgue density, its Lebesgue and Riemann integrals agree by the bounded Riemann-integral comparison theorem. The first-jump rate convention is the following. Conditional on the process history through time s and state Xs=x, the survival probability of no jump before time t, s≤t≤T, is

Hx(s,t):=exp⁡(−∫stλx(u) du).

For each y≠x, the conditional density that the next jump occurs at time t and goes to y is Hx(s,t)κxy(t) with respect to one-dimensional Lebesgue measure; the remaining probability Hx(s,T) is that no jump occurs by time T. These are normalized conditional probabilities: for s<T, by the chain rule and the first fundamental theorem of calculus, Hx(s,s)=1 and Hx′(s,t)=−λx(t)Hx(s,t); the density integrands are continuous, so the second fundamental theorem of calculus gives

Hx(s,T)+∑y≠x∫sTHx(s,t)κxy(t) dt=Hx(s,T)+∫sTλx(t)Hx(s,t) dt=1.

After each jump the same conditional rule restarts from the new state and jump time. For s=T, the next-jump law has unit mass on no further jump. The row generator is the matrix Q(t) with Qxy(t)=κxy(t) for x≠y and Qxx(t)=−λx(t). A time-homogeneous process is the special case in which every κxy(t) is constant. When rates carry physical time units, κxy has units of inverse time; this definition is mathematical and asserts no physical realization. The process is called nonexplosive on [0,T] when its path has finitely many jumps there almost surely.

Definition references

LemmaStatement: AI-adaptedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Path densities and finite jump counts for bounded finite-state rates

Statement

Let Xt be a finite-state continuous-time Markov jump process on [0,T] under the first-jump rate convention, with initial law ρ and bounded continuous rates κxy(t), where T≥0. Put M:=sup⁡x∈E, 0≤t≤Tλx(t)<∞. For n≥0, let x0,…,xn∈E with xj−1≠xj for 1≤j≤n, let 0<t1<⋯<tn<T, and set t0:=0, tn+1:=T. Relative to counting measure on state sequences and Lebesgue measure on the ordered time simplex, the probability density of exactly this state sequence and these jump times is

ρ(x0)(∏j=1nκxj−1xj(tj))exp⁡(−∑j=0n∫tjtj+1λxj(s) ds).

Here an empty product is 1 and for n=0 the formula is ρ(x0)exp⁡(−∫0Tλx0(s) ds); if T=0, this is the only path case. For any subinterval J=[s,t] of length δ with Mδ<1, let NJ count its jumps. Then for every integer n≥1,

P(NJ≥n)≤(Mδ)n,E[NJ]≤Mδ1−Mδ<∞.

If M=0 there are no jumps. If M>0, divide [0,T] into finitely many intervals with Mδ<1; the preceding bound then gives E[NT]<∞. Thus bounded finite-state rates imply nonexplosion on every finite horizon.

Facts & Assumptions

Given: A finite nonempty state set, a finite T>0, bounded continuous rates, an initial probability law, and the process rate convention in the Statement.

[F1]

Finite-state continuous-time Markov jump processes with bounded rates: E is finite, the rates κxy(t) are bounded and continuous, and conditional on state x at time s the next-jump survival is Hx(s,t)=exp⁡(−∫stλx(u) du) with next-jump density Hx(s,t)κxy(t) to state y≠x.

[A1]

The Axiom of Countable Choice (ACω): every countable family of nonempty sets has a choice function. This is the exact axiom used to treat the restricted Lebesgue outer measure as a complete measure on the finite-dimensional jump-time simplices.

[F3]

Every complete ordered field is Archimedean: for every real r there is a positive integer m>r.

[F4]

Expectation of a nonnegative or integrable random variable, Monotone convergence for the integral, and The Lebesgue integral is linear on L1(μ): expectation is integration with respect to the probability measure, increasing nonnegative measurable functions have integrals increasing to the integral of their pointwise limit, and the integral is linear on integrable functions.

Proof

Given: The process, rates, horizon, initial law, and Countable Choice as stated.

1.1F1constructalgebra

Conditional on state x0 at time 0, the first-jump convention in [F1] gives the survival factor Hx0(0,t1) and jump density Hx0(0,t1)κx0x1(t1). After this jump, the Markov rule restarts at x1. Multiplying the successive conditional survival and jump factors through state xn, and then the final no-jump survival on [tn,T], gives exactly the stated path density. If n=0, the same convention gives ρ(x0)Hx0(0,T), which is the stated boundary formula.

1.2A1F1F2F4algebra

Let J=[s,t] have length δ with Mδ<1. The density of the first n ordered jumps, with survival factors removed, is at most the product of the n rates. Summing these products over each successive state gives at most Mn. The ordered time simplex is contained in the cube Jn, whose Lebesgue volume is δn by [F2]. Hence P(NJ≥n)≤(Mδ)n. Pointwise NJ=∑n≥11{NJ≥n}; [F4] gives E[NJ]≤∑n≥1(Mδ)n=Mδ/(1−Mδ).

2.1F1F3F4step 1.1step 1.2algebra∎

If T=0 or M=0, there are no jumps. Otherwise choose a positive integer m>MT by [F3] and partition [0,T] into m intervals of length δ=T/m, so Mδ<1. Jump times have densities by step 1.1, hence no jump occurs at a fixed partition endpoint with positive probability. The total count is the sum of the interval counts almost surely; linearity of expectation [F4] and step 1.2 give E[NT]≤mMδ/(1−Mδ)<∞. If P(NT=∞)>0, then E[NT]≥nP(NT=∞) for every n, contradicting finiteness. Thus the process is nonexplosive and the countable path-density collection covers the path law.

TheoremStatement: AI-adaptedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Forward equation and stationary laws for finite-state rate processes

Statement

Let Xt be a finite-state continuous-time Markov jump process on [0,T] with finite state set E, bounded continuous rates κxy(t), and row generator Q(t) under the first-jump convention. Let px(t):=P(Xt=x) and regard p(t) as a row vector. If T>0, then p is continuously differentiable on (0,T) with the corresponding one-sided derivatives at the endpoints, and

py′(t)=∑x∈E, x≠ypx(t)κxy(t)−py(t)λy(t),p′(t)=p(t)Q(t).

If T=0, the differential assertion is vacuous and the only time marginal is p(0). In either case, if a probability row vector π satisfies πQ(t)=0 for every t∈[0,T] and p(0)=π, then p(t)=π for all t∈[0,T]. For constant rates this says that every generator-stationary probability vector is an invariant law of the process.

Facts & Assumptions

Given: A finite state set, bounded continuous rates, the rate-process convention, and an initial probability row vector.

[F1]

Finite-state continuous-time Markov jump processes with bounded rates: conditional on state x at time t, the no-jump survival over [t,t+h] is exp⁡(−∫tt+hλx(s) ds), and the density of a first jump to y≠x at time s is the survival to s times κxy(s).

[F2]

Path densities and finite jump counts for bounded finite-state rates: on a short interval, the probability of at least two jumps is O(h2), and each finite path has the stated jump-time density.

[F4]

The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a) evaluates the integral of an integrable derivative as the endpoint difference, including one-sided endpoint derivatives.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice, carried by the Lebesgue path-density argument in [F2].

Proof

Given: The data in the Statement.

1.1A1F1F2F3algebra

If T=0, the only time is t=0 and p(0) is its initial law. Suppose T>0. By the first-jump convention, the no-jump probability from x over [t,t+h] is Hx(t,t+h)=exp⁡(−∫tt+hλx(s) ds)=1−λx(t)h+o(h). For x≠y, the probability of exactly one jump x→y and no further jump is ∫tt+hHx(t,s)κxy(s)Hy(s,t+h) ds=κxy(t)h+o(h). Paths with at least two jumps contribute O(h2) by [F2]. Hence the conditional endpoint transition probabilities equal κxy(t)h+o(h) for y≠x, and 1−λx(t)h+o(h) for y=x. Averaging this expansion over the finite states gives ∣py(t+h)−py(t)∣=O(h); the same estimate from the left shows p is continuous. By the Markov property, for each y∈E, py(t+h)=py(t)(1−λy(t)h)+∑x≠ypx(t)κxy(t)h+o(h). There are finitely many states, so the remainder remains o(h) after summation. Dividing by h and taking h↓0 gives the stated forward equation; applying the same expansion at t−h gives the left derivative. Its right-hand side is continuous because the rate functions and each px are continuous, hence p is continuously differentiable on the interior, with the corresponding one-sided derivatives at the endpoints.

2.1F3F4step 1.1algebra

Suppose πQ(t)=0 and p(0)=π. The constant function p(t)=π satisfies the forward equation. If d(t) is the difference of any other solution and π, then d(0)=0 and d′=dQ. For t>0, each component of d is differentiable on [0,t], with one-sided endpoint derivatives, and its derivative is continuous, hence integrable. Applying the second fundamental theorem in [F4] componentwise gives d(t)=∫0td(s)Q(s) ds. For t=0 this identity holds by the zero-interval convention. Use the vector 1-norm ∥d∥1:=∑x∣dx∣ and let B:=sup⁡s∈[0,T]max⁡x∑y∣Qxy(s)∣<∞, the maximum absolute row sum. Let D:=sup⁡s∈[0,T]∥d(s)∥1<∞. Since d is a row vector, the triangle inequality gives ∥d(s)Q(s)∥1≤∑x∣dx(s)∣∑y∣Qxy(s)∣≤B∥d(s)∥1. Iterating the integral equation yields ∥d(t)∥1≤D(Bt)n/n! for every integer n≥1. This bound tends to zero as n→∞, so d(t)=0 for every t. Therefore p(t)=π.

3.1step 2.1algebra∎

In the constant-rate case, πQ=0 is exactly the coordinate condition ∑x≠yπxκxy=πyλy for each y, so step 2.1 proves invariance of the stated generator-stationary law.

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Stationary path entropy for a finite-state jump process

Definition

Let E be a finite nonempty state set, let qxy≥0 be finite time-homogeneous transition rates for distinct x,y∈E, and let Q be their row generator. Let π be a strictly positive probability row vector with πQ=0; the forward-equation theorem shows that this is a stationary law when used initially. Assume symmetric support: qxy>0 if and only if qyx>0. For a sample path on a finite interval [0,T] with successive jump states x0,x1,…,xn, define its stationary path entropy by

ST:=∑j=1nlog⁡(πxj−1qxj−1xjπxjqxjxj−1).

The bounded-rate path-density lemma shows that the process is nonexplosive on every finite horizon. It also gives zero density to every finite path sequence containing a transition x→y with qxy=0. Since there are countably many finite state sequences, the union of those path strata is null. Hence almost surely the path has finitely many jumps and every jump uses a positive-rate edge. Define ST by the displayed sum on this full-probability set, and set ST=0 on its null complement, including paths with infinitely many jumps. Every logarithm on the full-probability set is defined because πx>0 and symmetric support makes both rates in each jump ratio positive. Its Borel preimages are countable unions of measurable path strata indexed by jump number and finite state sequence, together with the null-complement convention, so ST is a real random variable. The empty sum for a path with no jumps is 0. The quantity ST is dimensionless and depends only on the ordered jump states, not on their times. Detailed balance with respect to π means πxqxy=πyqyx for every pair x≠y; under this condition each jump contribution is zero, but no detailed-balance condition is part of this definition.

Remarks

ST is a mathematical log-likelihood-ratio statistic for paths. It is not automatically the physical entropy change of a reservoir or system. A thermodynamic interpretation requires additional physical assumptions, such as a specified relation between each forward/reverse rate ratio and the corresponding reservoir entropy transfer; if a model identifies kBST with an entropy change, its units are J/K.

LemmaStatement: AI-adaptedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Expected directed jump counts for a finite-state rate process

Statement

Let Xt be a finite-state continuous-time Markov jump process with finite horizon [0,T], initial law ρ, and bounded continuous rates κxy(t). For distinct states x,y, let Nxy(T) be the number of jumps from x to y on [0,T], and let px(t):=P(Xt=x). Then

E[Nxy(T)]=∫0Tpx(t)κxy(t) dt.

The integral is finite; no stationarity assumption is required.

Facts & Assumptions

Given: A finite-state process with bounded continuous rates and initial law ρ.

[F1]

Finite-state continuous-time Markov jump processes with bounded rates: conditional on state x at time s, no-jump survival to t is Hx(s,t)=exp⁡(−∫stλx(u) du), with bounded total rate λx; the process is Markov.

[F2]

Path densities and finite jump counts for bounded finite-state rates: for each finite path, its density is the product of its initial mass, jump rates and holding-time survival factors; the total jump count is integrable.

[F3]

Monotone convergence for the integral: an increasing sequence of nonnegative measurable functions has integrals increasing to the integral of its pointwise limit.

[F4]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: a nonnegative measurable function on a sigma-finite product has equal product and iterated integrals, including when the value is infinite.

[F5]

A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral: a bounded continuous function on a nondegenerate compact interval is Lebesgue measurable and its Lebesgue integral equals its Riemann integral.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice, used through the Lebesgue path densities and increasing sums over the possible jump counts.

Proof

Given: The finite-state process and Countable Choice in the Statement.

1.1F2F3F4A1

On the canonical path space, write a path with n jumps as its state sequence and ordered jump times. Its jump count is Nxy(T)=∑j=1n1{xj−1=x, xj=y}. Using the nonnegative path densities [F2], the expectation is the sum over n≥1, state sequences, and ordered jump-time simplices of this count times the path density. The state-sequence sums are finite at each n, and their union over n is countable; the increasing partial sums and [F3] justify the countable sum. For each fixed n and jump index j, write the ordered-time simplex integral as an integral over [0,T]n with its simplex indicator. This is a nonnegative measurable function: the factors are continuous rates and survival functions, and the simplex is Borel. Lebesgue measure on the cube is finite and counting measure on the finite state sequences is finite, so [F4] permits integrating first in the selected jump time s=tj and then summing the other times. Summing over n and j is again an increasing nonnegative sum, so [A1] and [F3] justify its rearrangement.

2.1F1F2F4step 1.1algebra

For each selected jump at time s, the Markov property factors its path density into the prefix density through state x, the transition factor κxy(s) ds, and the suffix density starting in y. At fixed s, all finite prefixes ending in x partition {Xs=x} up to the null event of a jump at the fixed time s, so their densities sum to px(s). All finite suffix densities starting in y sum to 1 by the normalization and nonexplosion conclusion of [F2]. The nonnegative sum/integral interchange justified in step 1.1 therefore gives the Lebesgue integral ∫[0,T]px(s)κxy(s) dλ1(s).

3.1F1F5F6step 2.1algebra∎

Conditional on Xs=x, the probability of at least one jump by time t>s is 1−Hx(s,t)=1−e−u with u:=∫stλx(r) dr≥0. The inequality 1−e−u≤u and the rate bound give this probability at most M(t−s), uniformly in x. Hence ∣px(t)−px(s)∣≤P(Xt≠Xs)≤M∣t−s∣, so each px is continuous. The product px(t)κxy(t) is consequently continuous and bounded on [0,T], so its Lebesgue integral is finite. If T>0, [F5] identifies that integral with the Riemann integral in the Statement. If T=0, both the count and integral are zero by [F6]. This proves the identity for every T≥0.

LemmaStatement: AI-adaptedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite-state Feynman-Kac evolution for continuous jump rates

Statement

Let Xt be a finite-state continuous-time Markov jump process on [0,T] with initial law ρ and bounded continuous rates κxy(t). Let Vx:[0,T]→R be continuous for every state. For y∈E, define the weighted endpoint mass

Gy(t):=E[exp⁡(−∫0tVXs(s) ds)1{Xt=y}].

Then G(0)=ρ. If T>0, G is continuously differentiable on (0,T) with the corresponding one-sided derivatives at the endpoints, and it is the unique solution of

Gy′(t)=∑x≠yGx(t)κxy(t)−Gy(t)λy(t)−Vy(t)Gy(t).

If T=0, the unique function on the singleton time interval is G(0)=ρ, and no differential equation is asserted.

Facts & Assumptions

Given: A finite-state Markov jump process with bounded continuous rates, initial law ρ, and continuous functions Vx.

[F1]

Finite-state continuous-time Markov jump processes with bounded rates: conditional on state x at time t, no-jump survival over [t,t+h] is exp⁡(−∫tt+hλx(s) ds), and the first-jump density to state y is survival times κxy.

[F2]

Path densities and finite jump counts for bounded finite-state rates: on any interval of sufficiently small length, the probability of at least two jumps is bounded by a constant times the square of its length; the path has finitely many jumps almost surely.

[F3]

Expectation of a nonnegative or integrable random variable: expectation of a nonnegative or integrable random variable is its integral with respect to the probability law.

[F5]

The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a): a function differentiable on a nondegenerate closed interval, with one-sided endpoint derivatives and an integrable derivative, has integral of its derivative equal to its endpoint increment.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice, used through the Lebesgue path-density construction in [F2].

Proof

Given: The process, rates, initial law, and functions Vx from the Statement.

1.1A1F1F2F3F4algebra

If T=0, the single endpoint value is Gy(0)=ρy. Suppose T>0 and put K:=max⁡xsup⁡s∈[0,T]∣Vx(s)∣ and M:=max⁡xsup⁡s∈[0,T]λx(s). Write w(t):=exp⁡(−∫0tVXs(s) ds). Almost surely the path has finitely many jumps by [F2], so the integrand is piecewise continuous; its integral is the limit of coordinate-measurable Riemann sums. Thus the weights are measurable (assign any bounded value on the measurable exceptional null set) and satisfy 0<w(t)≤eKT. For 0≤u<v≤T and h:=v−u, ∣w(v)−w(u)∣≤eKT(eKh−1), while [F1] gives P(N(u,v]≥1)≤1−e−Mh≤Mh. Since an endpoint indicator can change only if a jump occurs, ∣Gy(v)−Gy(u)∣≤eKT(eKh−1+Mh). This bound tends to zero with h, uniformly in u,v, proving continuity on the entire closed interval.

2.1A1F1F2F3F4step 1.1algebra

For 0≤t≤T−h, condition on the history through t. Starting at y, the contribution of no jump to the additional weighted endpoint indicator is exp⁡(−∫tt+h(λy(s)+Vy(s)) ds)=1−(λy(t)+Vy(t))h+o(h). Starting at x≠y, exactly one jump to y contributes ∫tt+hHx(t,s)κxy(s)Hy(s,t+h)exp⁡(−∫tsVx(r) dr−∫st+hVy(r) dr) ds=κxy(t)h+o(h). The conditional bound from [F2], obtained by restarting the first-jump rule at t, bounds the probability of two or more jumps by (Mh)2 when Mh<1; their weighted contribution is at most eKh(Mh)2. The finitely many continuous rates and potentials have a common modulus of continuity ω(h)→0 on [0,T]. Hence the preceding remainders are O(hω(h)+h2) uniformly in the starting time and state. Multiply by w(t) and average, using the Markov property and the bound in step 1.1, to obtain Gy(t+h)=Gy(t)+hRy(t)+ry(t,h),Ry(t):=∑x≠yGx(t)κxy(t)−Gy(t)λy(t)−Vy(t)Gy(t), where sup⁡0≤t≤T−h, y∈E∣ry(t,h)∣/h→0.

3.1step 1.1step 2.1algebra

By step 1.1 and continuity of the rates and potentials, R is continuous. Step 2.1 gives the right derivative Gy′(t+)=Ry(t) for t<T. For t>0, apply its uniform expansion at t−h to get (Gy(t)−Gy(t−h))/h=Ry(t−h)+ry(t−h,h)/h→Ry(t). Thus the full derivative exists on (0,T), extends continuously as the stated one-sided derivatives at the endpoints, and satisfies the claimed equation. The defining expectation at zero gives Gy(0)=ρy.

4.1F5step 3.1algebra∎

If G and G~ are two solutions with the same initial vector, their difference D satisfies D(0)=0 and D(t)=∫0tA(s)D(s) ds by [F5], applied componentwise, where A(s)=Q(s)T−diag⁡(V(s)) in column convention. Its coefficients and D are continuous on [0,T]. Define ∥z∥∞:=max⁡y∣zy∣, B:=sup⁡smax⁡y∑x∣Ayx(s)∣<∞, and C:=sup⁡s∥D(s)∥∞<∞. Then ∥A(s)z∥∞≤B∥z∥∞. Starting from ∥D(t)∥∞≤C, induction in the integral equation gives ∥D(t)∥∞≤C(Bt)n/n! for every n≥1; the induction integrates sn, whose primitive is sn+1/(n+1), by [F5]. For each fixed t these bounds tend to zero, since successive terms have ratio Bt/(n+1), eventually at most 1/2. Hence D=0 and the solution is unique.

TheoremStatement: AI-adaptedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

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.

TheoremStatement: AI-adaptedProof: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Jarzynski identity for a finite-state driven rate process

Statement

Let E be a finite nonempty state set and T≥0. Fix β>0. If T>0, for each x∈E let Ex∈C1([0,T],R) be an energy function; if T=0, let each Ex(0) be finite. Let κxy:[0,T]→[0,∞) be bounded continuous transition rates for x≠y, and let Xt be the associated finite-state Markov jump process. Define

Zt:=∑x∈Ee−βEx(t),πt(x):=e−βEx(t)Zt.

Assume instantaneous detailed balance:

πt(x)κxy(t)=πt(y)κyx(t)(x≠y, 0≤t≤T),

and initial law P(X0=x)=π0(x). The path work and free-energy difference are

WT:={0,T=0,∫0TEXt′(t) dt,T>0,ΔF:=−β−1log⁡(ZT/Z0).

Then

E[e−βWT]=ZTZ0=e−βΔF.

If energy is measured in joules, then β has units J−1, WT and ΔF have units joules, and the exponent is dimensionless. Under a common C1 energy shift Ex(t)↦Ex(t)+a(t) for all x, both WT and ΔF change by a(T)−a(0), so the identity is unchanged.

Facts & Assumptions

Given: A finite nonempty state set, T≥0, finite energies at T=0 or C1 energies for T>0, bounded continuous rates, β>0, instantaneous detailed balance, and initial distribution π0.

[F1]

Finite-state continuous-time Markov jump processes with bounded rates: the process is Markov, has row generator Q(t) with off-diagonal entries κxy(t), and has finitely many jumps on the finite interval.

[F2]

Finite-state Feynman-Kac evolution for continuous jump rates: the weighted endpoint masses for potential Vx(t) solve the finite-dimensional ODE Gy′=∑x≠yGxκxy−Gyλy−VyGy, uniquely for their initial vector.

[F3]

The natural logarithm as the inverse of the exponential function: log⁡ is the inverse of the exponential on (0,∞).

[F4]

The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a): for T>0 and a∈C1([0,T],R), including one-sided endpoint derivatives, the continuous derivative is integrable and ∫0Ta′(t) dt=a(T)−a(0).

[F5]

The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y): exp⁡(u+v)=exp⁡(u)exp⁡(v) for all real u,v.

[F7]

Integrable functions on [a,b] form a set closed under sums and scalar multiples, and ∫ab(λf+μg)=λ∫abf+μ∫abg: the integral of a sum of Riemann-integrable functions is the sum of their integrals, including with oriented limits.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice, carried by the path-density construction used in [F2].

Proof

Given: The finite-state driven process and assumptions in the Statement.

1.1F3givenalgebra

If T=0, then WT=0 by definition and ZT/Z0=1, so E[e−βWT]=1=ZT/Z0; the definition of ΔF and the inverse relation [F3] give e−βΔF=ZT/Z0 as well. Now suppose T>0. For each t, πt is a strictly positive probability vector because E is finite and every exponential is positive. Instantaneous detailed balance gives, for each y, ∑x≠yπt(x)κxy(t)=πt(y)∑x≠yκyx(t)=πt(y)λy(t). Thus the column inflow from the distribution πt equals the generator outflow at y.

1.2F1F2A1

Apply [F2] with potential Vy(t)=βEy′(t) and initial law π0. The weighted endpoint masses Gy(t):=E[e−βWt1{Xt=y}] satisfy Gy′(t)=∑x≠yGx(t)κxy(t)−Gy(t)λy(t)−βEy′(t)Gy(t),Gy(0)=π0(y), where Wt:=∫0tEXs′(s) ds.

2.1F2F3F6step 1.1step 1.2algebra

Define Cy(t):=e−βEy(t)/Z0=(Zt/Z0)πt(y). Then Cy(0)=π0(y) and [F6] gives Cy′(t)=−βEy′(t)Cy(t). By step 1.1, the generator inflow and outflow terms evaluated at C(t) cancel, so C satisfies the same ODE and initial vector as G. Uniqueness in [F2] gives Gy(t)=Cy(t) for every y,t.

3.1F3step 2.1algebra

Summing step 2.1 over the finite state set at t=T yields E[e−βWT]=∑y∈EGy(T)=1Z0∑y∈Ee−βEy(T)=ZTZ0. By [F3] and the definition of ΔF, e−βΔF=ZT/Z0, proving the identity.

4.1F3F4F5F7givenstep 3.1algebra∎

For a common shift a(t), put δ:=a(T)−a(0). If T=0, then δ=0 and both WT and ZT/Z0 are unchanged, so the claimed invariance holds. Suppose T>0. Then ZT♯/Z0♯=e−βδ(ZT/Z0). Since ZT/Z0>0, [F3] and [F5] give exp⁡ ⁣(log⁡(ZT/Z0)−βδ)=e−βδ(ZT/Z0), so the inverse relation in [F3] implies ΔF♯=ΔF+δ. By [F7] the shifted path work is WT♯=WT+∫0Ta′(t) dt=WT+δ, with the last equality from [F4]. Therefore WT♯−ΔF♯=WT−ΔF.

Remarks

The theorem is a conditional mathematical identity under the stated finite-state rates and instantaneous detailed balance. It does not derive detailed balance or local detailed balance for an arbitrary nonequilibrium reservoir, and it does not establish that a physical apparatus realizes these rates. The exact exponential average can be dominated by rare paths, so the identity alone gives no low-variance or finite-sample guarantee.

5 · Examples, experiments and counterexamples

None yet.

Sources