Trajectorial Dissipation of 8 -Entropies for Interacting Particle Systems

A classical approach for the analysis of the long-time behaviour of Markov processes is to consider suitable Lyapunov functionals like the variance or more generally (cid:2) -entropies. Via purely analytic arguments it can be shown that these functionals are indeed non-increasing in time under quite general assumptions on the process. We reﬁne these classical results via a more probabilistic approach and show that dissipation is already present on the level of individual trajectories for spatially extended systems of inﬁnitely many interacting particles with arbitrary underlying geometry and compact local spin spaces. This extends previous results from the setting of ﬁnite-state Markov chains or diffusions in R n to an inﬁnite-dimensional setting with weak assumptions on the dynamics.


Introduction
There are many different techniques to study the long-time behavior of Markov processes that excel in different situations.One very common and powerful technique is the use of Lyapunov functionals, i.e., functionals that are monotone in time.An example of such a functional is the variance where µ is an invariant measure for some Markov process with semigroup (P t ) t≥0 .If we now fix an observable f and consider the function then it is easy to see that this is non-increasing and under some further assumptions one can even show that it is strictly decreasing for all non-constant observables f .This whole viewpoint, however, is purely based on functional analytic arguments and one does not even need to speak about the underlying Markov process itself to carry out the corresponding calculations.From a probabilistic point of view, this is somewhat unsatisfactory and we therefore want to specify this coarse and non-probabilistic approach with a finer, more probabilistic technique that allows us to obtain trajectorial versions of these results.Here, by trajectorial we mean results on the level of single realizations of a stochastic process, as opposed to averaged quantities.Thereby our goal is to uncover more of the underlying probabilistic mechanisms behind the decay of variance, or more generally the decay of Φ-entropies.For this, we will first briefly recall the notion of Φ-entropies and then explain our main results and ideas with the help of the simple example of a continuous-time Markov chain on a finite state space.The rest of the article is then devoted to extending these ideas to the setting of spatially extended systems of infinitely many interacting particles as e.g.considered in [Lig05].
1.1.Φ-entropies and their decay under Markovian dynamics.Let Φ : I → R be a smooth and convex function defined on a not necessarily bounded interval I ⊂ R. Let (E, B(E)) be a Polish space equipped with its Borel σ-algebra and assume that µ is a probability measure on (E, B(E)).The Φentropy functional is then defined on the set of µ-integrable functions f : E → I by By Jensen's inequality one can immediately deduce that the Φ-entropy functional takes its values in R + ∪ {+∞}.Moreover, Ent Φ µ (f ) vanishes if its argument is constant and if Φ is strictly convex, then the converse is also true.For special choices of Φ one can recover the classical variance and relative entropy functionals since we have Now let (X(t)) t≥0 be a Markov process on our Polish space E with associated semigroup (P t ) t≥0 acting on C b (E; R), the space of continuous and bounded real-valued functions on E. Let us assume that there exists an invariant probability measure µ and denote by L the generator of the semigroup (P t ) t≥0 with domain dom(L ) ⊂ C b (E; R).
By invariance of µ and Jensen's inequality one can now deduce that for all f ∈ C b (E; R) . This tells us that the Φ-entropy is non-increasing as a function of t and can be used as a Lyapunov function.More precisely, with purely analytic arguments, one can even deduce the following general result about the decay of Φ-entropies.
Proposition 1.1 (DeBruijn like property for Markov semigroups, [Cha04]).Let (X(t)) t≥0 be a Markov process on a Polish space E equipped with its Borel σ-algebra B(E) and let (P t ) t≥0 be the associated Markov semigroup with generator L .Assume that µ is an invariant probability measure.Then, for any continuous and bounded function f : E → I and any t > 0, it holds that This result is classical, but we nevertheless recall its short analytic proof.We will later also provide a more probabilistic argument to obtain the same result in the context of interacting particle systems.
Proof.The chain rule and the definition of the generator L directly imply that To see that the left-hand side is actually non-positive, it suffices to observe that the convexity of Φ implies via Jensen's inequality for conditional expectations Φ(P t+s g) ≤ P t (Φ(P s g)) for any s, t ≥ 0 and hence for all f we have By integrating one obtains the following classical corollary, which links exponential decay of Φ-entropies and functional inequalities involving Φ-entropies.
Corollary 1.2.In the setting of Proposition 1.1, the following two statements are equivalent.
i.There exists a constant c > 0 such that for all f ∈ dom(L ) ii.There exists a constant c > 0 such that for all continuous and bounded f : Ent Φ µ (f ).Note that, in the special case Φ : u → u 2 , one recovers the Poincaré inequality which is well-known to be equivalent to exponential L 2 ergodicity, see e.g.[HS76].For a more detailed review of Φ-entropies and further results we refer the interested reader to [Cha04].
1.2.A finite state-space example for the trajectorial approach.As one can see, the results above can be obtained without even mentioning the underlying stochastic process and just dealing with the semigroup and its generator.We want to supplement this viewpoint with a more probabilistic approach that allows us to obtain a somewhat finer result on a trajectorial level, which also implies the classical results by taking expectations.
For simplicity, we will discuss the main ideas for the example of a continuous-time Markov chain on a finite state space.More precisely, let (X t ) t≥0 be a Markov chain on a finite set E with irreducible generator L and strictly positive invariant measure µ.Hence, the corresponding Markov semigroup is given by the matrix exponential (e tL ) t≥0 .Denote the underlying probability space by (Ω, A, P) and assume that X 0 ∼ µ under P.
It is easy to check that for all bounded f : [0, ∞)×E → R such that for all x ∈ E the partial derivatives ∂ t f (•, x) are continuous and bounded, the process defined by is a martingale w.r.t. the canonical filtration generated by (X t ) t≥0 , see e.g.[RW00, Lemma IV.4.20].
If we now fix a finite time horizon T > 0 and consider the time-reversal ( Xt ) 0≤t≤T of (X t ) t≥0 , where Xt = X T −t , then under P the time-reversed process is again a time-homogeneous Markov process with generator L , where L (x, y) = µ(y) µ(x) L (y, x).
A short calculation now shows that, for each bounded g : E → R and T > 0, the process (P T −s g( Xs )) 0≤s≤T is a (( Ft ) 0≤t≤T , P)-martingale, where Ft = σ(X T −s : 0 ≤ s ≤ t).Indeed, we can use the chain rule to calculate so the correction term in (1.1) vanishes.Note that it is crucial to use the time-reversed process here, since the correction term does not cancel out if one uses the forward process.By convexity this directly implies that the time-reversed trajectorial Φ-entropy, i.e., the process defined by is a submartingale.This stochastic monotonicity can be seen as a trajectorial version of the classical Φ-entropy decay and after taking expectations with respect to P, one obtains the classical results as in Proposition 1.1.Therefore, one can interpret these trajectorial results as the probabilistic version of the decay of Φ-entropies.
The main work is now to establish that a similar argument can also be used to treat infinite-dimensional systems like the interacting particle systems we consider.To our best knowledge, the first results of this kind, in the context of diffusions in R n , have been achieved in [FJ16].More recently, starting with [KST20], these results have been extended to more and more classes of Markov processes, including continuous time Markov chains on countable state spaces, see [KMS21].The works [KY22] and [TCY23] are also in a similar spirit.The setting will be made precise in Section 2, but roughly speaking, we consider continuous-time Markov jump processes on general configuration spaces Ω = Ω S 0 , where S is an arbitrary countable set and Ω 0 is a compact Polish space.We will refer to the elements of S as sites and call Ω 0 the local state-space.In most examples considered in the literature, S is the vertex set of some graph like the d-dimensional hypercubic lattice Z d , a tree or the Cayley graph of a group.This underlying spatial geometry dictates which particles can interact with each other and we are therefore not in the setting of mean-field systems but in an infinite-dimensional setting.This of course brings with it its own set of technical difficulties which need to be dealt with for making the time-reversal arguments work.
The main technical difficulties come from making sure that the time-reversal is again a well-defined interacting particle system and from obtaining a description of its generator.This is made possible by assuming some local regularity of the local conditional distributions of the time-stationary measure µ.Namely, by the assumption that µ is actually a Gibbs measure with respect to a quasilocal specification that additionaly satisfies a certain smoothness condition.This condition is e.g.satisfied if the specification is given in terms of a potential Φ = (Φ B ) B⋐S such that sup Note that this condition is for example satisfied for any translation-invariant finite-range potential, so our theory applies to a fairly large class of models.1.3.Organization of the manuscript.The rest of this article is organized as follows.We will first collect the necessary notation and formulate our main results in Section 2.Then, as a first step, we investigate the time-reversal of interacting particle systems in equilibrium in Section 3 with the main goal of obtaining an explicit representation of the (formal) generator of the time-reversed dynamics.In Section 4, we will then apply these results to establish pathwise properties of general Φ-entropy functionals and derive the classical DeBrujin-like decay property as a corollary.

Setting and main results
Let (Ω 0 , B 0 ) be a compact Polish space equipped with its Borel σ-algebra and λ 0 a probability measure on (Ω 0 , B 0 ), which will serve as our reference measure.We will consider Markovian dynamics on the configuration space Ω = Ω S 0 , where S is some countable set whose elements we will refer to as sites.In most applications this will be the set of vertices of some graph, e.g.Z d or a tree.We equip Ω with the product topology and corresponding Borel σ-algebra F .Note that F coincides with the product σ-algebra ⊗ x∈S B 0 .For ∆ ⊂ S we will also write Ω ∆ := Ω ∆ 0 for the set of partial configurations.We will also equip Ω ∆ with the product σ-algebra and the probability measure λ ∆ = ⊗ x∈∆ λ 0 .For Λ ⊂ S, let F Λ be the sub-σ-algebra of F that is generated by the projections ω → ω ∆ ∈ Ω ∆ for ∆ ⋐ Λ, where we write ⋐ to signify that a set is a finite subset of another set.For ∆ ⊂ S and (partial) configurations η ∆ c ∈ Ω ∆ c and ξ ∆ ∈ Ω ∆ , we will write ξ ∆ η ∆ c for the configuration that is defined on all of S and agrees with η ∆ c on ∆ c and with ξ ∆ on ∆.For a topological space E, we will denote its Borel σ-algebra by B(E) and the space of continuous real-valued functions on E by C(E).The space of non-negative measures on E, or more precisely on B(E), will be denoted by M(E) and is equipped with the topology of weak-convergence.The total variation distance on M(E) will be denoted by • TV .
2.1.1.Interacting particle systems.We will consider time-continuous Markovian dynamics on Ω, namely interacting particle systems characterized by time-homogeneous generators L with domain dom(L ) ⊂ C(Ω) and the associated Markovian semigroup (P t ) t≥0 on C(Ω).For interacting particle systems we adopt the notation and exposition of the standard reference [Lig05, Chapter I].
In our setting, the generator L is given by a collection of transition measures (c ∆ (•, dξ)) ∆⋐S in finite volumes ∆ ⋐ S, i.e., mappings These transition measures can be interpreted as the infinitesimal rates at which the particles inside ∆ switch from the configuration η ∆ to ξ ∆ , given that the rest of the system is currently in state η ∆ c .The full dynamics of the interacting particle system is then given as the superposition of these local dynamics, In [Lig05, Chapter I] it is shown that the following conditions are sufficient to guarantee well-definedness.
The total rate at which a single particle switches its state is uniformly bounded, i.e., sup (L3) The total influence of all other particles on the transition rates of a single particle is uniformly bounded, i.e., where Under these conditions, the core of the operator L is given by is the oscillation of a function f : Ω → R at the site x.In addition, one can show the following estimates for L and the action of the semigroup (P t ) t≥0 generated by L .We will need these later on.
Lemma 2.1.Assume that the generator L satisfies (L1) − (L3) and denote by (P t ) t≥0 the semigroup generated by L .i.For f ∈ D(Ω) we have P t f ∈ D(Ω) for all t ≥ 0 and ii.For all f ∈ D(Ω) it holds that The constants are explicitly given by Proof.Combine the results from Proposition 3.2(a) and Theorem 3.9.(d) in [Lig05, Chapter I].
For our purposes, the mere well-definedness of an interacting particle system is not sufficient and we need to assume some more regularity.All the additional assumptions we put will be used to make the generator of the time-reversal well-defined.
(R1) For each ∆ and η ∈ Ω the measure c ∆ (η, dξ ∆ ) is absolutely continuous w.r.t. the reference measure We will comment on where and why we need these assumptions and their connection to the classical conditions (L1) − (L3) at the end of Section 2.1.2,after we have stated our assumptions on the local conditional distribution of the time-stationary measure µ.
2.1.2.Gibbs measures and the DLR formalism.We will mainly be interested in the situation where the process generated by L admits a time-stationary measure µ with a well-behaved local representation, namely that µ is a Gibbs measure w.r.t. to a sufficiently nice specification γ.Let us therefore first recall the general definition of a specification.Definition 2.2.A specification γ = (γ Λ ) Λ⋐S is a family of probability kernels γ Λ from Ω Λ c to M 1 (Ω) that additionally satisfies the following properties.
i.Each γ Λ is proper, i.e., for all B ∈ F Λ c it holds that ii.The probability kernels are consistent in the sense that if where the concatenation of two probability kernels is defined as usual via For the existence and further properties of Gibbs measures with specification γ one needs to impose some conditions on the specification γ.One sufficient condition for the existence of a Gibbs measure for a specification γ is quasilocality, see e.g.[FV17] or [Geo11].For the following sections we will need to assume some more regularity for the specification γ.In particular, these assumptions will guarantee that γ is quasilocal.
(S3) The conditional densities on the single spin spaces are uniformly bounded away from zero and infinity, i.e., where Remark 2.3.Now that we have stated all of the conditions that we need, let us briefly comment on why and where we need them.i. Assumption (R3) clearly implies (L2) and together with (R4) ensures that the interacting particle system is well-defined.ii.Assumption (R1) and (S1) allow us to write down the local transition density of the time-reversal and (S3) makes sure that we are not performing a division by zero.iii.The further regularity assumptions (R3), (R5) (S3), (S4) and the continuity assumptions (R2) and (S2) make sure that the local transition densities of the time-reversal also give rise to a well-defined interacting particle system.iv.The quantity in (S4) is similar to the classical Dobrushin uniqueness condition, see [Geo11].However, we only need it to be finite and not strictly smaller than one.
Example 2.4.One particular class of models to which our theory can be applied to are spin systems for which the specification γ is defined via a potential Φ = (Φ B ) B⋐S that satisfies and where the rates are of the form Instead of these single-site updates one could also consider updates in larger regions with a bounded diameter.Then the rates satisfy (R1) − (R5) and the specification satisfies (S1) − (S4), as one can see by using similar arguments as in the proof of [FV17, Lemma 6.28].

2.2.
The time-reversal of an interacting particle system.In the notation of above, assume that µ ∈ G (γ) is Gibbs measure for a quasilocal specification γ, i.e., assume that µ satisfies the DLR equations for all Λ ⋐ S and bounded measurable functions f .Further assume that µ is time-stationary with respect to the Markovian dynamics with generator L .Denote the semigroup generated by L by (P t ) t≥0 and the corresponding process on Ω by (η(t)) t≥0 .As discussed in Section 1.2, for each fixed T > 0 the process (η(T − t)) 0≤t≤T is again a time-homogeneous Markov process and under some suitable assumptions its associated semigroup has a generator L .But what does this generator look like?For general Markov processes it is not possible to give a closed form expression, but in our case we can use the special structure of L as the superposition of local dynamics in finite volumes.In each of these finite volumes, it is clear how the time-reversal w.r.t.µ should look and we can hope that we can again write L as the superposition of finite volume processes.With this Ansatz, the probabilistic intuition dictates the educated guess for the transition densities appearing in the generator of the time-reversed interacting particle system.However, at this stage, it is not obvious that the generator of the time-reversed system is again of the form (2.1) and has precisely these rates.For Markov processes on finite state spaces this is an easy calculation but we have to put in some more work, which will be carried out in Section 3. The main result there is the following.Proposition 2.5 (Time-reversal generator).Let the rates of an interacting particle system with generator L satisfy (R1) − (R5) and assume that µ is a time-stationary measure for the corresponding Markov semigroup (P (t)) t≥0 on C(Ω) that is generated by L such that µ is a Gibbs measure w.r.t. a specification γ that satisfies (S1)− (S4).Then, the time-reversed process has a generator L whose transition densities (w.r.t. the reference measure λ 0 ) are given by The proof of this can be found at the end of Section 3.

2.3.
Trajectorial decay of Φ-entropies.With this auxiliary result at hand, we can then obtain the following result, which describes the dissipation of general Φ-entropies on a trajectorial level.Before we state the theorem, let us introduce some further notation to express the main equation in a cleaner way.The Bregman Φ-divergence associated with Φ : I → R is defined as div Φ (p|q) := Φ(p) − Φ(q) − (p − q)Φ ′ (q), p, q ∈ I.
This is precisely the difference between the value of Φ at the point p and the value of the first-order Taylor expansion of Φ around q, evaluated at p and is non-negative, since we assumed that Φ is convex.Bregman divergences are sometimes also referred to as Bregman distances, despite not being a metric since they are in general not symmetric and do not satisfy the triangle inequality.They are however still useful for applying techniques from optimization theory in more general contexts, e.g. in statistical learning theory [BMDG05].
Note that we now have to be careful with the probability space and filtration we are working with, since we are talking about results on a trajectorial level.
Theorem 2.6 (Trajectorial decay of Φ-entropies).Let (Ω, A, P) be a probability space on which the interacting particle system (η(s)) s≥0 is defined.Denote the generator of the interacting particle system by L and assume that its rates satisfy (R1) − (R5) and assume that under P we have η 0 ∼ µ, where µ is a time-stationary measure for the corresponding Markov semigroup (P t ) t≥0 on C(Ω) that is generated by L such that µ is a Gibbs measure w.r.t. a specification γ that satisfies (S1) − (S4).Then, for any f ∈ D(Ω) and T > 0, the process defined by is a (( Ĝt ) 0≤t≤T , P)-submartingale, where Ĝt = σ(η(T − s) : 0 ≤ s ≤ t).Its Doob-Meyer decomposition is given by The proof of this theorem can be found at the end of Section 4. As mentioned before, by taking expectations one recovers the classical DeBrujin-like decay of Φ-entropies as stated in Proposition 1.1.
For the sake of concreteness, let us write out the result explicitly for one of the simplest cases, namely the trajectorial decay of variance, corresponding to Φ : u → u 2 .Corollary 2.7 (Trajectorial decay of variance).In the setting of Theorem 2.6, we have that, for any f ∈ D(Ω) and T > 0, the process defined by (P T −s f (η T −s )) 2 , 0 ≤ s ≤ T , is a (( Ĝt ) 0≤t≤T , P)-submartingale, where Ĝt = σ(η(T − s) : 0 ≤ s ≤ t).Its Doob-Meyer decomposition is given by 2.4.Outlook.Even though we were able to show the trajectorial decay for the relative entropy under quite general assumptions on the dynamics, these results are not fully satisfactory in the context of statistical mechanics.The usually more interesting Lyapunov functional in this setting is the so-called relative entropy density, as e.g.considered in [FV17], which is not only defined for measures ν that are absolutely continuous w.r.t.µ.Therefore, it would be much more natural to work with this functional h(•|µ) : M inv 1 (Ω) → R instead and one can show that is also a Lyapunov function for interacting particle systems under quite general assumptions, see [JK22], but it is somewhat unclear how to even formulate conjectures about the trajectorial properties of this functional, since one cannot naively evaluate it pointwise.
As we already saw in the case of a continuous time Markov chain on a finite state space, the main ingredient for this type of result is to obtain an explicit description of the generator of the time-reversed process.Another class of processes that could be of interest and is not covered by our results are systems which evolve continuously on their single spin spaces, as opposed to our pure-jump processes.The first example that comes to mind are of course systems of (infinitely-many) interacting diffusions, e.g.indexed by Z d .We expect that, if a given system of interacting diffusions admits a Gibbs measure as an invariant probability measure, then a combination of the techniques in [KST20] and this article should yield analogous results -of course under some suitable regularity conditions on the coefficients.

The time-reversed interacting particle system and its generator
The main goal of this section is to prove Proposition 2.5, thereby establishing that the generator of the time-reversal is indeed given by L .For this we will need to establish some regularity properties for the transition densities as defined in (2.2).
3.1.Upper and lower bounds for the conditional densities.Since we will need to deal with quotients involving the conditional densities γ ∆ on arbitrary finite subsets ∆ ⋐ S, we will need to lift the upper and lower bounds from (S3) to this more general case.This is essentially the content of the following lemma.
Lemma 3.1.Let γ be a specification that satisfies (S1) and (S3).Then, there exists a constant C ∈ (0, ∞) such that for all ∆ ⋐ S we have the estimate This constant is precisely given by C = |log δ|.
Proof.For this, fix an enumeration i 1 , . . ., i k of the elements of ∆ and introduce the notation With this notation at hand, we can use the chain rule for conditional probability densities to write the site i j .But, using consistency of the specification γ, we have which is, by assumption, upper bounded by δ −1 and lower bounded by δ.In conjunction with the representation (3.1) this implies the desired upper and lower bound where the constant C is explicitly given by C = |log(δ)|.
As a corollary we now get the following estimate for the quotients that appear in the definition of transition density of the time-reversal (2.2).Lemma 3.2.Let ∆ ⋐ S and γ be a specification that satisfies (S1) and (S3).Then, for all ∆ ⋐ S, η ∈ Ω and ξ ∆ ∈ Ω ∆ , we have 3.2.The switching lemma.Now that we can be sure that the densities as in (2.2) are actually welldefined and we are not performing a division by zero, we can start showing that L is indeed the generator of the time-reversed process.The main technical tool will be the following lemma.
Lemma 3.3.Let the rates of a well-defined interacting particle system with generator L satisfy (R1) and assume that µ is a time-stationary measure for L and µ is a Gibbs measure w.r.t. a specification γ that satisfies (S1) and (S3).Then, we have for all bounded and measurable f, g : Ω → R and ∆ ⋐ S that To keep the notation for conditional expectations in the upcoming proof simple, we will denote integration with respect to µ by E Proof.As a first step, note that for fixed ∆ ⋐ S and ξ ∆ ∈ Ω ∆ the maps are F ∆ c -measurable.Therefore, we can use that γ is the local conditional distribution of µ and the definition of the rates ĉ to obtain the µ-almost-sure identity If we now integrate over ξ ∆ , exchange the order of integration (via Fubini) and apply the same arguments in reverse -with f taking the role of g and vice versa -we get By integrating both sides with respect to µ, exchanging the order of integration, and applying the law of total expectation we obtain as desired.
3.3.Regularity of the time-reversal rates.To make sure that L is actually the generator of a welldefined interacting particle system we now show that the collection of transition measures (ĉ ∆ (•, •)) ∆⋐S satisfies the three conditions (L1) − (L3).
Proof.Ad (L1): This follows from the continuity assumptions (R2) and (S2), together with assumption (S3) and Lemma 3.2.Ad (L2): Note that for fixed ∆ ⋐ S, ξ ∆ ∈ Ω ∆ and η ∈ Ω we have by Lemma 3.2 and assumption (R5) Therefore, assumption (R3) implies that (L2) is also satisfied.Ad (L3): Fix ∆ ⋐ S, y ∈ S and two configurations η 1 , η 2 that only disagree at y.Then, for any ξ ∆ ∈ Ω ∆ we have To estimate this further, we will have to make a case distinction over whether the site y is contained in ∆ or not.If y is contained in ∆, then we can naively use Lemma 3.2 and assumption (R5) to obtain the rough estimate In the case where y is not contained in ∆, we can (and have to) be a bit more precise.Via the elementary algebraic rule and Lemma 3.2 plus assumption (R5) one obtains . Now, by integrating this pointwise difference of the densities over ξ ∆ , we obtain via all of the other assumptions that sup But this is precisely (L3) and the proof is finished.
With these two intermediate results at hand, we can now show that L is indeed the generator of the time-reversal of (η t ) t≥0 (w.r.t. the time-stationary measure µ).
Proof of Proposition 2.5.It only remains to show that for all f, g ∈ D(Ω) we have since then the claimed time-reversal duality follows from Lemma A.4.
For this, we first note that it suffices to show that the duality relation for the generators holds for all local functions f, g : Ω → R. Indeed, if it holds for all pairs of local functions, we can then extend it to functions with bounded total oscillation by using the estimates from Lemma 2.1 and dominated convergence.Therefore, let f, g be two local functions and let Λ ⋐ S be sufficiently large such that both f and g only depend on coordinates in Λ.By first applying Lemma 3.3 and then using that µ is time-stationary with respect to the Markovian dynamics generated by L , we see that which finishes the proof.

Trajectorial decay of Φ-entropies
In this section we use the time-reversed process and a martingale argument to prove Theorem 2.6.4.1.The time-dependent martingale property.The main technical tool will be the following lemma which can be seen as an extension of [RW00, Lemma IV.20.12] to our setting.Lemma 4.1.Let L be the generator of an interacting particle system (η(s)) s≥0 such that its transition rates satisfy (L1)−(L3) and let µ be a time-stationary measure w.r.t.L .Then, for all the process defined by The proof of this lemma is not difficult but hard to find in the existing literature, we therefore give it in some detail.
Definition A.1.Let (X t ) t≥0 be a time-stationary stochastic process.We call a process The intuition behind this definition is that forward in time the process Y looks like the process X run backwards.For Markov processes this notion can be characterized in terms of the semigroups and generators as follows.
Proposition A.2. Let X = (X t ) t≥0 and Y = (Y t ) t≥0 be Markov processes on a compact topological space E with associated semigroups (T t ) t≥0 and (S t ) t≥0 .Assume that X has a time-stationary measure ν and for all f, g ∈ C(E) we have Then ν is also time-stationary for Y and Y is the time-reversal of X (w.r.t.ν).
Proof.By the duality relation (A.1), ν is also time-stationary for Y and we can extend it to a process (Y t ) −∞<t<∞ with Y 0 ∼ ν.To show that Y is the time-reversal of X (w.r.t.ν) it suffices to show that for arbitrary n ∈ N and times t We will do this as follows.First, we introduce the notation f 0 = f n+1 ≡ 1 and define functions g 0 , . . ., g n+1 and h 0 , . . ., h n+1 by g 0 = h n+1 ≡ 1, With this notation it suffices to show that the quantity α l := E g l (x)f l (x)h l (x)ν(dx), 0 ≤ l ≤ n + 1, does not depend on l.Indeed, by stationarity of X and Y , this will then imply that exactly as we wanted.In order to show that α l does not depend on l, we use the duality relation as follows.For 0 ≤ l ≤ n it holds that Therefore, α l does not depend on l and the claim follows.
The duality relation (A.1) for the semigroups can also be verified by checking a similiar property on the level of generators.The main technical tool for establishing this relation between the generator of a Markov process and its semigroup will unsurprisingly be the celebrated Hille-Yosida theorem which we recall here.

Theorem A.3 (Hille-Yosida).
There is a one-to-one correspondence between Markov generators on C(E) and Markov semigroups on C(E).This correspondence is explicitly given by i. ii.
Moreover, iii.if f ∈ dom(L ), then S t f ∈ dom(L ) for all t ≥ 0 and d dt S t f = L S t f = S t L f and iv. for g ∈ C(E) and λ ≥ 0, the solution to the resolvent equation f − λL f = g is given by f = ∞ 0 e −t S λt gdt.
With this at hand, we can now formulate the time-reversal duality for generators.To sum this up, in order to show that a stationary Markov process Y is the time-reversal of a stationary Markov process X, it suffices to check that their generators satisfy the duality relation (A.2).

Lemma A. 4 .
Let (T t ) t≥0 and (S t ) t≥0 be two Markov semigroups on C(E) where E is a compact topological space with time-stationary measure ν.Let (A , dom(A )) and (B, dom(B)) be their generators.If for all f ∈ dom(A ) and g ∈ dom(B) it holds thatE (A f ) g dν = E f (Bg) dν, (A.2) then (A.1) holds.It suffices if (A.2) holds for f, g in a core of the respective generators.Proof.The duality relation implies that for all f ∈ dom(A ), g ∈ dom(B) and λ ≥ 0 it holds thatE f (g − λL g) dν = E g(f − λ L f ) dν.Now we can replace f by (Id − λL ) −1 f and g by (Id − λ L ) −1 g to see that for all f, g ∈ C(Ω)E [(Id − λA ) −1 f ]g dν = E [(Id − λB) −1 g]f dν.By iteratively applying this equality we obtain that for all n ∈ N and λ ≥ 0 it holds thatE [(Id − λA ) −n f ]g dν = E [(Id − λB) −n g]f dν.For fixed t ≥ 0 we can replace λ by t/n and use Part ii. of Theorem A.3 to see that lim . the product topology.(R3) The total rate of transition for a single site is uniformly bounded from above sup