WorksMathematics
Ergodicity, memory loss, and directional stability on von Neumann algebras
Abstract
For a deterministic sequence of normal unital completely positive maps on a von Neumann algebra, convergence of normal states, loss of memory, and convergence of Cesàro averages are different properties. This paper separates these properties in the predual norm and identifies the precise role of composition order. Uniform loss of memory for right-appended products on the predual implies uniform convergence to a normal state without any compactness or trace assumption; the convergence rate is bounded by the image diameter. In contrast, on every infinite-dimensional -finite von Neumann algebra there are right-appended products with pointwise loss of memory but no convergent normal-state trajectory, even though all nontrivial state images equal a fixed compact line segment. Consequently, finite dimensionality is characterized by the universal implication from pointwise backward memory loss to mixing. An attained normal-functional minorization coefficient extends the common-lower-bound construction for matrix channels to arbitrary von Neumann algebras and yields quantitative contraction and unique normal entrance laws. Further results distinguish pointwise from uniform relaxation, Cesàro convergence from mixing, fixed-start from time-uniform contraction, and stationary from moving asymptotic states. As an application, inhomogeneous transfer states on spin chains, including matrix product states, are shown to have a unique thermodynamic limit, uniformly in the boundary condition, with an arbitrary von Neumann algebra as bond algebra; boundary dependence and correlations are controlled by the same product coefficients. All counterexamples are explicit and extend to algebras of types I, II, and III.
Introduction
The ergodic theory of quantum dynamics has developed along two largely separate lines. The first is operator algebraic. Here the dynamics is a normal positive map, an automorphism, or a semigroup on a von Neumann algebra, usually with a distinguished invariant normal state. Mean and individual ergodic theorems were obtained by Lance for automorphisms and convex sets [23], and by Yeadon for semifinite algebras in the noncommutative setting [37]. Junge and Xu later proved maximal ergodic inequalities in noncommutative -spaces [20]. The long-time behaviour of dynamical semigroups on -algebras was analysed by Frigerio and Verri [16]. Kümmerer’s theory of Markov dilations embeds completely positive dynamics with a faithful invariant state into reversible dynamics [21]. Fidaleo studied strong ergodic properties, including unique ergodicity and uniform convergence of Cesàro averages [15]. More recent work on the structure of ergodic dynamics includes the existence of ergodic states on type III factors, due to Marrakchi and Vaes [24], and a multiplicative ergodic theorem for cocycles with values in a finite von Neumann algebra, due to Bowen, Hayes and Lin [7]. In this tradition the dynamics is typically homogeneous, and convergence is studied in weak-star, strong, or noncommutative topologies relative to a fixed state.
The second line comes from quantum information theory. A quantum channel on a matrix algebra is ergodic or mixing according to spectral properties of its invariant states and its peripheral spectrum [9]. The peripheral structure, period, and cyclic decomposition of a channel were analysed by Carbone and Jenčová [10]. Albert related the asymptotic projection of a channel to its conserved quantities and to matrix product states [5]. Quantitative contraction is central in this line. Strict contractivity of noise channels limits fault-tolerant computation [34]. Quantum Doeblin coefficients give computable upper bounds on trace-distance contraction coefficients, with applications to time-varying channels [19, 18]. Within quantum probability, Accardi, Lu and Souissi proved a Markov–Dobrushin inequality for channels [3]. Souissi and Barhoumi showed that a positive Markov–Dobrushin constant implies exponential mixing, and applied this to matrix product states [35].
When the channel changes in time, the iterates of a single map are replaced by ordered products, and no invariant state need exist. In classical probability this situation is governed by Dobrushin’s ergodicity coefficient. Its extension to abstract state spaces and to von Neumann algebra preduals is due to Mukhamedov [27, 28]. Mukhamedov and Al-Rawashdeh treated weak and uniform ergodicity of nonhomogeneous chains relative to a projection [29]. Gaubert and Qu established the duality between contraction and oscillation for Markov operators on cones [17].
A second group of results concerns random products. Bruneau, Joye and Merkli studied random repeated interaction systems [8]. Movassagh and Schenker obtained an ergodic theorem for processes driven by an ergodic dynamical system, with exponential convergence to an ergodic sequence of states that does not depend on the initial state [25, 26]. Ekblad and Schenker developed a reducibility theory without the decoherence hypothesis of this framework [12]. Nelson and Roon extended the stationary random theory to finite von Neumann algebras, using a projective metric on the cone of positive elements [30]. Pathirana and Schenker studied continuous-time inhomogeneous Markovian dynamics in a stationary random environment [32]. Ergodic theorems for quantum trajectories form a related direction [22, 6, 11].
For deterministic inhomogeneous channels on matrix algebras, Souissi [36] separated the forward and backward composition orders. That paper showed that weak and strong mixing coincide for backward products, which are automatically nested, and derived convergence rates from common positive lower bounds of channel outputs. Pathirana [31] developed a product-level trace-Dobrushin theory for finite-dimensional channel products. In the deterministic case, decay of the product coefficient is equivalent to asymptotic replacement by a moving rank-one channel; for two-sided products, pullback forgetting gives a unique boundary state.
Quantum Markov chains originate in Accardi’s noncommutative Markov property [1]. Later constructions include entangled Markov chains [2] and a unifying framework for the existing definitions [4]. Finitely correlated states were introduced by Fannes, Nachtergaele and Werner [13], and their pure case was analysed in [14]. Matrix product states are their pure vector counterparts, and their representation theory was systematised in [33].
In all these constructions the state of a spin chain is produced by iterating a transfer map on an auxiliary, or bond, algebra. Consequently, the thermodynamic limit, boundary independence, and decay of correlations are statements about products of channels. For translation-invariant or ergodic chains this connection appears in [26, 35]. For non-translation-invariant chains, [36] expresses the infinite-volume state through a backward sequence of boundary states, and [31] obtains infinite-volume limits and correlation bounds from product coefficients. Each of these works assumes a finite-dimensional bond space.
The transfer construction itself does not require this. It defines states for an arbitrary auxiliary von Neumann algebra, for instance with infinite dimensional, or a factor. Finite dimensionality is what makes such a state “finitely” correlated in the sense of [13], but it is not needed for the construction. The theory developed below applies directly to this setting.
This paper asks which parts of the finite-dimensional, deterministic theory of [36] remain valid on an arbitrary von Neumann algebra , and which fail. Three features of the infinite-dimensional setting are decisive. The normal state space is in general not norm compact. There may be no trace, no density operators, and no normal pure states. Finally, in applications to spin chains, the bond algebra itself can be infinite dimensional.
The predual Dobrushin coefficient and its submultiplicativity are known [27, 28] and are not presented as new. The contribution of this paper is to determine exactly where directional stability holds for arbitrary deterministic sequences of normal channels. All composition directions refer to maps on states, not to maps on observables. Throughout, denotes the set of normal states of ; the subscript n stands for “normal” and is not an integer index (see § 2).
The first two main results describe this boundary.
Theorem 1.1 (Uniform backward stability). Let be a von Neumann algebra, let be the preduals of normal unital completely positive maps, and put . Then
if and only if there exists such that
In that case, for every ,
No norm compactness of the state space or of a channel image is required.
Theorem 1.2 (A finite-dimensionality characterization). For a nonzero -finite von Neumann algebra , the following are equivalent:
is finite dimensional.
For every sequence of normal unital completely positive maps, pointwise loss of memory of the backward state products implies mixing to a normal state.
The implication in (2) holds for every such sequence for which is norm relatively compact.
If is infinite dimensional, the counterexample can be chosen so that is the same compact line segment for every , while the process has pointwise loss of memory and is not even Cesàro ergodic.
Theorem 1.1 is a dimension-free positive result. Theorem 1.2 shows that uniformity cannot be replaced by pointwise convergence: the matrix theorem of [36] holds pointwise only because the state space of a matrix algebra is compact.
The third main result applies the backward theory to spin chains with an infinite-dimensional bond algebra. Let be a von Neumann algebra, let , and let
be normal unital completely positive maps. Put and . The maps define, for every normal boundary state at site , a finite-volume state on ; see § 11.
Theorem 1.3 (Inhomogeneous transfer states). Assume that as for every . Then there is a unique state on the quasi-local algebra such that, for all and all normal states of ,
Its local restrictions are expressed through the unique normal entrance law of the backward products. For local observables on and on ,
This theorem extends the boundary-state representation of [36] and the finite-dimensional replacement estimates of [31] to an arbitrary bond algebra. The estimate is uniform in the boundary state, and it cannot be obtained from pointwise memory loss (Remark 11.5).
Further results identify the precise role of each hypothesis. An attained normal minorization coefficient replaces the rank-one construction of [36] and controls in any von Neumann algebra (§ 5). Unique normal entrance laws and forward tracking estimates are proved in § 6 and § 7. Explicit counterexamples separate pointwise from uniform convergence, Cesàro convergence from mixing, convergence from a fixed starting time from uniformity over all starting times, and a single strict contraction of a prefix from recurrent contraction (§ 8 and § 9). A Hilbert-space criterion for processes that preserve a faithful normal state appears in § 10.
§ 2 fixes notation and composition orders, and § 3 states the hierarchy of convergence notions. § 4 and § 5 treat the contraction and minorization coefficients. Theorem 1.1 is proved in § 6, and quantitative estimates follow in § 7. Theorem 1.2 and the universal counterexamples are in § 8, with homogeneous comparisons in § 9. § 10 gives the Hilbert-space criterion, § 11 proves Theorem 1.3, and § 12 summarises the conclusions.
Preduals, channels, and composition order
Let be a nonzero von Neumann algebra, with unit , predual , self-adjoint part , and positive cone . The normal state space of is
that is, the set of states of that are normal (equivalently, -weakly continuous, or completely additive on orthogonal families of projections). The subscript n abbreviates “normal”. When , normal states are exactly the functionals with a density operator, so is the von Neumann algebra counterpart of the set of density operators. Also write
All norms on functionals are predual norms. In particular, for . When is -finite, a faithful normal state may be denoted by ; no trace is assumed. The general positive results below do not require -finiteness. That assumption is convenient for the universal counterexamples.
A channel on observables is a normal unital completely positive map . Its predual is defined by . It is a contraction and preserves . In a general von Neumann algebra the intrinsic normalization statement is
not preservation of an unspecified trace. Density operators and a trace become available only after an appropriate additional representation or semifinite hypothesis.
Fix a sequence and put . For define
Thus is the chronological state evolution, and is the reverse-ordered state product. The terms forward and backward will always mean these two state-space orders. Their observable duals are, respectively,
Here the superscript denotes the Banach adjoint, with .
The reversal is essential: . In particular, the observable product , which is chronological in the Heisenberg picture, has the backward state product as its predual. Formula (2) removes any ambiguity in the terms forward and backward. Neither product is an inverse dynamics, a Petz reversal, or a modular adjoint. Such notions would require additional data and are not used here.
The composition identities are
For backward products the state images satisfy
For forward products one instead has , which need not give nested images. This is an order-of-composition distinction; it occurs already for classical noncommuting stochastic matrices and is not exclusively quantum.
Convergence notions and the correct hierarchy
Fix and one of the families or , and write
The initial index will be suppressed when .
Definition 3.1. The family is mixing if there exists with for every . It is uniformly mixing if this convergence is uniform over , and exponentially mixing if, for constants and ,
It is mean ergodic to one state if for all normal states, and uniformly mean ergodic to one state if the convergence is uniform.
It has pointwise loss of memory if
and uniform loss of memory if . The exponential version is . Mean loss of memory and uniform mean loss of memory are defined by replacing by in these two conditions.
The phrases “mean ergodic” and “ergodic” below refer to convergence to a single state, not merely existence of an arbitrary mean-ergodic projection. The term “weak mixing” in [36] corresponds to the norm loss-of-memory property just defined. It does not mean convergence in a weak topology, and is not the usual ergodic-theoretic weak mixing defined by Cesàro decay of absolute correlations. Keeping these notions separate prevents an otherwise substantial terminological ambiguity.
Proposition 3.2 (Hierarchy). For either composition order,
and
The analogous implications hold for loss of memory. Each convergence-to-one-state property implies its corresponding loss-of-memory property. In finite dimension, pointwise and uniform versions coincide, both for products and for averages. In infinite dimension, mixing need not imply uniform mean ergodicity.
Proof. Convergence to a common state gives loss of memory by the triangle inequality. Cesàro summation preserves pointwise norm convergence, and also preserves convergence of the relevant suprema when these converge to zero. To prove the finite-dimensional assertion, use that all channels and their averages are contractions. If pointwise but not uniformly, choose violating uniform convergence and pass to a norm-convergent subsequence. Contractivity gives
a contradiction. Apply the same argument to pairs of states and to averages. The final assertion follows from Example 8.2.
Thus the correct infinite-dimensional diagram branches: mixing implies mean ergodicity, but there is no general arrow from mixing to uniform mean ergodicity. In finite dimension the appropriate chain is
The two remaining reverse arrows fail for inhomogeneous processes; explicit examples appear below. For a homogeneous process, uniform mixing always has an exponential rate; see Theorem 9.3.
The predual contraction coefficient
For a channel predual define
with if . This is the usual predual Dobrushin coefficient, as in [27, 28]. The following elementary facts are included to make all subsequent bounds self-contained.
Lemma 4.1. For channel preduals , ,
For put . Then
Proof. A self-adjoint normal functional has a normal Jordan decomposition with . If , then . For , therefore,
for some .
This gives . Conversely, . The coefficient is at most one by contractivity; submultiplicativity follows because .
For the last assertion, the real Banach dual of is , with quotient norm
Indeed the annihilator of is , and centering the spectrum gives the displayed equality. The adjoint of is the induced map of this quotient. Equality of the norms of an operator and its adjoint proves (6).
All operator norms in statements using are real operator norms. Uniform convergence over states is equivalent to operator norm convergence on to the rank-one map
In fact the operator norm of on this real space equals its supremum on states, by Jordan decomposition. On the complex predual these two norms are equivalent with a factor at most two, which is sufficient for convergence but should not be silently replaced by an exact identity.
An attained normal minorization coefficient
Definition 5.1. For a channel predual let
The order is the ordinary order of normal positive functionals. Thus means for all .
Theorem 5.2 (Normal common-lower-bound theorem). For every von Neumann algebra and every normal channel predual , the maximum defining is attained. Moreover,
A normal positive functional belongs to if and only if
When with , writing identifies with the maximal trace of a common positive lower bound of the outputs of all rank-one input states. Thus it recovers the variational common-lower-bound coefficient of [36], with .
Proof. The set contains zero. Fix and put . Regard the order interval as a subset of the full Banach dual . It is closed and contained in its closed unit ball, hence compact by Banach–Alaoglu. Every in this interval is normal: if in , then
For every normal state , the constraint is weak-star closed, since it is the intersection over of the scalar closed inequalities . Consequently is a compact subset of in this topology. Evaluation at is continuous and therefore has a maximum. Its value lies in .
For admissible , let . The map
is positive: for , normalize to a state when it is nonzero. For such , . A Jordan decomposition therefore gives on . On , , so . Take a maximizing .
The order condition is equivalent to for every normal state and every positive . Normal states determine the order in a von Neumann algebra: a nonzero negative spectral projection of a self-adjoint element supports a normal state detecting the negative part. This proves (8).
In finite dimension, normal states are convex combinations of rank-one states. A lower bound for all rank-one outputs is consequently a lower bound for all state outputs, and the converse is immediate. The density-functional correspondence preserves order and identifies with .
Remark 5.3. The compactness used in the proof is the weak-star compactness of an order interval inside , not norm compactness of . Domination by one fixed normal functional prevents a singular functional from appearing in that interval. The maximizing functional need not be unique, but its maximal mass is a scalar and is unambiguous. No lattice infimum in the noncommutative order is asserted.
Example 5.4 (Strict contraction without a common lower bound). On , take a classical channel with output laws
The smallest value of each output coordinate over the three inputs is zero, so . Pairwise distances are one, and convexity shows that the diameter of the output simplex is one. Lemma 4.1 gives . Thus is a sufficient contraction bound, not the optimal coefficient in general.
Example 5.5 (Positive subtraction is not CP subtraction). On , in the Schrödinger picture, let
Its Choi matrix is , where is the flip; also . Every state output dominates . Conversely, given a unit vector , choose a pure input with ; any common lower bound then satisfies . Hence the maximal lower bound is and . But
is not completely positive: its Choi matrix has a negative eigenvalue. Thus Theorem 5.2 only uses positivity of the residual. It must not be read as a CP-order Doeblin decomposition.
Directional convergence and normal entrance laws
Theorem 6.1 (Nested images with shrinking diameter). Let be channel preduals on a von Neumann algebra. Suppose that and . Then there exists a unique such that
The sets need not be closed. The state belongs to the norm closure of each set .
Proof. Choose and set . If , nesting puts in , so . Thus is norm Cauchy. The predual is complete, and its positive cone and normalization hyperplane are norm closed, hence its limit is a normal state. For any and , the two states lie in , so . Pass to the limit in . The bound proves both uniqueness and membership in each image closure.
Apply this theorem to (3), and use (5). It proves Theorem 1.1. In particular, for every fixed , uniform backward mixing is equivalent to , and exponential uniform backward memory loss implies exponential backward mixing with the same diameter bound. This dimension-free conclusion does not extend to pointwise memory loss, as § 8 will show.
Corollary 6.2 (Forward nesting). If for all and the forward process has uniform loss of memory, then it is uniformly mixing, with . In particular exponential uniform loss of memory and nesting give exponential mixing with the same rate, in either direction.
This is the infinite-dimensional form of the nesting principle of [36]. In finite dimension pointwise memory loss suffices there, by Proposition 3.2. In infinite dimension the hypothesis must be uniform: the backward products of Theorem 8.4 below are nested and lose memory pointwise, yet do not converge.
Theorem 6.3 (Entrance laws). Suppose that, for every fixed , as . Then there is a unique sequence of normal states satisfying
For this sequence,
More generally, the same estimate holds with an arbitrarily chosen boundary state at time in place of a fixed .
Proof. For each , Theorem 6.1 gives a limiting normal state and the bound. Since , norm continuity gives (9). If is another normal entrance law, iteration gives , hence . The uniform bound also proves the assertion about arbitrary boundary sequences.
A single fixed starting time does not suffice for uniqueness of a full entrance law. For example, and for give for all , but is an entrance law for every normal state .
Proposition 6.4 (Synchronization and convergence). Let have pointwise loss of memory. Then is mixing if and only if converges in predual norm for one normal state . If loss of memory is uniform and , then
The same statements hold for Cesàro averages. In particular, a common invariant normal state converts pointwise or uniform memory loss into the corresponding mixing property, in either direction; it also converts mean memory loss into mean ergodicity.
Proof. Use . The necessity is immediate. If every fixes , then every product and every average fixes it, so it is an admissible constant anchor.
Example 6.5 (Complete memory loss with a moving output). Choose distinct normal states and let , where for even and for odd . Since , one has
Both image diameters vanish after one step. The backward process is stationary after that step; the forward process does not converge. Its Cesàro averages converge uniformly to . This example works already on a two-state classical algebra. It separates synchronization from convergence, not finite from infinite dimension.
If the sequence instead alternates between and on blocks whose successive lengths dominate the sum of all previous lengths, its Cesàro means fail to converge. The forward process then has even exponential loss of memory, and uniform mean loss of memory, without mean ergodicity.
Nesting is sufficient for convergence under uniform memory loss; it is not necessary. For instance, take distinct states and . The forward replacement products converge uniformly to , but their singleton images are distinct and hence are not nested.
Quantitative contraction, windows, and tracking
Theorem 7.1 (Deterministic contraction estimates). For either order or ,
Consequently, implies uniform loss of memory in both orders from every fixed starting time. Backward normal entrance laws then exist uniquely and satisfy
If every fixes a common normal state , then
in both orders.
Proof. Apply Lemma 4.1 repeatedly and then Theorem 5.2. The estimate for gives ; a factor equal to zero only strengthens the bound. Lemma 4.1, Theorem 6.3, and Proposition 6.4 give the remaining assertions.
If on a set of indices and , the bound is
Positive lower density, namely with , gives an exponential rate in physical time. Merely having does not: that upper bound is true for every subset of indices. If , the guaranteed bound is polynomial. Furthermore, divergence of can hold when , so a positive accumulation point is not needed.
Contraction may also occur only in blocks. For a partition and either chosen direction, put . Whenever , composition yields
This condition is strictly more flexible than a one-step minorization condition. The order of each block must agree with the order of the process; a forward block estimate cannot simply be transferred to a backward block.
Proposition 7.2 (Uniformity over starting times). For either direction let
Then the following conditions are equivalent:
as .
There are and such that .
Under (2), ; if , the coefficient is zero for all .
Proof. The composition identities and submultiplicativity give . If , choose with . Conversely, write , , and use .
The statement “for each fixed , ” is weaker than uniformity over . For example, take except at , where on a nontrivial algebra. Every fixed tail contains infinitely many contraction steps, so it loses memory uniformly over states. There are nevertheless arbitrarily long intervals containing only identity maps, and for every finite .
Theorem 7.3 (Tracking an approximate forward trajectory). Suppose for , and put . For a sequence , set . Then
If for each fixed and , the left-hand side tends to zero uniformly over initial states at any fixed . The same conclusion holds when for some and .
Proof. A telescoping expansion gives
Every functional in parentheses belongs to . Apply the restriction norm bound and . In the summable case, split the sum into a finite initial part and a tail with small total mass. In the exponential case, first make the late errors small and use the geometric sum bound, then let the finitely many early contributions decay.
In particular, contraction gives a synchronized moving state, not necessarily a stationary limit. If , tracking yields mixing to ; if oscillates, there need not be any limiting state. This is the forward counterpart of the backward entrance-law statement.
Infinite-dimensional counterexamples and universality
The following retraction transfers classical counterexamples without imposing a trace or an algebra type.
Lemma 8.1 (A countable classical retract). Every infinite-dimensional -finite von Neumann algebra admits normal unital completely positive maps
where is a unital injective -homomorphism. Its predual is an isometry, , and both preduals preserve normal states. If are classical stochastic operators on , then
are normal quantum-channel preduals on . Every nonempty product of the lifted maps equals followed by the corresponding classical product followed by . In particular, output distances and suprema over states for nonempty products are exactly the classical ones.
Proof. We first show that contains an infinite family of pairwise orthogonal nonzero projections. Suppose not. Then every nonzero projection dominates a minimal projection of : otherwise one can choose a strictly decreasing sequence of nonzero projections, and the differences form an infinite orthogonal family. Let be a maximal orthogonal family of minimal projections; it is finite by assumption. If , it dominates a further minimal projection, contradicting maximality. Hence . For a minimal projection , the von Neumann algebra has no projections other than and , so the spectral theorem gives . Let with . Then and , so and with . Also for some . Therefore . Thus , and , a contradiction.
Let be such an infinite orthogonal family. Put and for , the sum being strongly convergent. These are nonzero pairwise orthogonal projections with .
Choose a faithful normal state and set
These maps are normal and unital. The map is a -homomorphism; is completely positive because each coordinate is a positive scalar functional. Since , .
For , in norm. The triangle inequality gives an upper bound , and testing on with and gives the reverse bound. Thus is isometric. The predual identity follows from . Every classical stochastic map has a normal unital positive, hence completely positive, adjoint on the commutative algebra. Therefore the adjoint of (14) is , a normal unital CP map. Cancellation of proves the product formula. Finally maps states onto all probability vectors, since , proving equality of suprema.
Example 8.2 (Pointwise mixing without uniformity). On , define the stochastic operator
where is the point mass at . Its adjoint on is the normal unital -homomorphism . For every probability vector ,
The convergence is not uniform: take to obtain distance two. In fact for all .
Let . Pointwise mixing gives . But for all states , , are supported outside zero, so . Thus the homogeneous process is mixing and mean ergodic, but is neither uniformly mixing nor uniformly mean ergodic. Lifting by Lemma 8.1 gives the same homogeneous counterexample on every infinite-dimensional -finite , in both directions.
This example simultaneously proves that pointwise mixing does not imply uniform mean ergodicity and that mean ergodicity does not imply its uniform version. A trace on the algebra does not by itself repair either implication: the lifted construction works on any factor, although the chosen channels need not preserve its trace.
Example 8.3 (A strict prefix bound does not accumulate). Fix , take , and for , with as above. These maps commute because . For , both ordered products are
Hence every initial state converges to , while
For the coefficient identity use the upper bound and the pair , whose outputs have distance . Thus even mixing together with does not imply uniform mixing. Hence a strict bound on the coefficient of the whole prefix cannot replace a recurrent block-contraction hypothesis. Again the example lifts to every infinite-dimensional -finite algebra.
Theorem 8.4 (Compact backward images without stability). Let be any sequence in . There are stochastic operators on such that, for ,
Consequently the backward products have pointwise loss of memory for every choice of , but they converge to one state if and only if converges. Their Cesàro averages converge to one state if and only if the scalar means converge. Uniform loss of memory always fails: .
Proof. For each define a deterministic function by
Let . Given , put , , and define
Since and , one has . Thus induction gives . Define . Each is stochastic, with normal unital -homomorphic adjoint . The backward product is therefore
Both parities occur among , so the image of all probability vectors is exactly the segment in (16). Its diameter is two, giving . All coordinates are sent to . Only the tail mass can differ from , and its contribution to an difference is at most twice that mass. This proves (17); the triangle inequality proves (18).
For each fixed , the right-hand side of (17) tends to zero. Taking gives exactly, proving the assertion about ordinary limits. For averages,
by Cesàro summation. The last vector average is , where . This proves the Cesàro assertion. Including an initial identity term or shifting the average by one term changes the average by at most and has no effect on the conclusions.
For , this gives pointwise backward memory loss and mean ergodicity to , but not mixing. Uniform mean ergodicity also fails: for , all , , equal , at distance one from the mean limit.
For a failure of mean ergodicity, let , for , and prescribe for . Then , and the means at times approach the alternating block values. Hence the scalar Cesàro means do not converge. Pointwise mean loss of memory still holds by (18) and Cesàro summation. This example therefore separates weak mean memory loss from mean ergodicity even for backward products.
Proof of Theorem 1.2. If is finite dimensional, its normal state space is norm compact. Proposition 3.2 upgrades pointwise backward memory loss to uniform memory loss, and Theorem 1.1 gives mixing. Hence (1) implies (2), which trivially implies (3).
If is infinite dimensional, lift the stochastic sequence in Theorem 8.4 using Lemma 8.1. With , every nonempty backward product has state image exactly , a norm-compact segment. Equations (17)–(18) and the isometry give pointwise loss of memory on all normal states of . Choose the non-Cesàro-convergent block sequence above. The state has output , so its trajectory and its Cesàro averages do not converge. Thus (3) fails. This proves (3) implies (1) and the additional assertion.
Remark 8.5 (What compactness does and does not repair). The reservoir example has finite-rank products, a collectively norm-compact set of all nontrivial state outputs, and nested images. None of these assumptions converts pointwise backward memory loss into uniform memory loss. The missing compactness is on the input-state space: optimizing input states may depend on and may put all their mass in an unexplored tail. In contrast, once the image diameters actually tend to zero, completeness alone proves Theorem 6.1.
Rates, periodicity, and homogeneous comparisons
Example 9.1 (Arbitrarily slow uniform mixing). On any nontrivial von Neumann algebra choose and a positive nonincreasing sequence , with . Define
The maps commute, and both ordered products satisfy
while
The coefficient equality follows from . The channel can therefore have any prescribed decreasing positive relaxation profile. Choosing proves that uniform mixing need not be exponential for inhomogeneous processes. Choosing , for which , gives a still slower example.
For and , the correct constant is , not two. Indeed, diagonalize and write ; convexity bounds by the pure-state value , and every pure state attains that value. In particular no state can be orthogonal to the full support of .
Example 9.2 (Uniform mean ergodicity without mixing). On the two-state algebra , let , . Its invariant state is and
For even the average is exactly ; for odd it differs by . Nevertheless alternates and does not converge, and for every . Thus uniform mean ergodicity, and even uniform mean loss of memory, do not imply mixing or pointwise memory loss.
On the channel
(with indices ) gives the same example after deleting off-diagonal entries at the first step. It is completely positive: use Kraus operators and . It has invariant density . A two-projection version of Lemma 8.1, with normal states satisfying , lifts the classical example to every von Neumann algebra with two nonzero orthogonal projections summing to one.
Theorem 9.3 (Homogeneous benchmark). Let be a single normal channel predual.
Uniform mixing of , uniform loss of memory, and the existence of with are equivalent. Whenever they hold there is a unique invariant normal state , and the convergence is exponential.
If an invariant normal state is given, pointwise loss of memory is equivalent to mixing to ; mean loss of memory is equivalent to mean ergodicity to .
Mean ergodicity to one normal state is equivalent to the conjunction
Proof. Uniform mixing implies uniform memory loss. If , some power has coefficient less than one. Conversely, if , then . The state images are nested, so Theorem 6.1 gives a normal state with
If , this is an exponential bound with rate and prefactor ; if , the products are rank one from time onward and an exponential estimate with any chosen rate follows after adjusting the finite prefactor. Passing to the limit in proves . Any invariant normal state must equal this limit. This proves (1). Part (2) is Proposition 6.4.
For (3), suppose on states and hence on the complex linear span of states, which is all of . Since , . If , then for every normal state, so .
Conversely, let and . Hahn–Banach annihilator duality gives
On , telescoping gives . Since , this extends to the closure. Decomposing gives .
The uniform/exponential part is a standard Dobrushin consequence, recorded here for comparison with [27, 28]. It cannot be claimed as a new homogeneous theorem. Its relevance is that an inhomogeneous prefix bound less than one has no corresponding submultiplicative-power mechanism, as Example 8.3 demonstrates.
Example 9.4 (Unique invariant normal state is not enough). On define and for . The only invariant probability vector is : invariance first forces the mass at coordinate one to be zero, and then recursively forces all positive coordinates to have zero mass. But
has no limit. Every coordinate tends to zero while its norm remains one. Thus uniqueness of a normal invariant state does not imply mean ergodicity in infinite dimension. Here consists of bounded functions constant on with an independent value at zero; it is two dimensional, in agreement with Theorem 9.3(3). This example also lifts to any infinite-dimensional -finite : every invariant state of the lifted predual lies in , where the assertion reduces to the classical one.
State-preserving Hilbert-space criteria
The counterexamples above do not claim that all distinctions persist under every additional state-preserving hypothesis. A useful positive criterion is available without a trace, and it illustrates what a common faithful normal state adds.
Proposition 10.1 (GNS contraction criterion). Suppose is a faithful normal state with for every . On the GNS Hilbert space , with cyclic vector , define
Then extends to a contraction, fixes , and preserves . If there are such that , then for either observable product , in either order,
If for every fixed , both corresponding state products are mixing in predual norm to . The conclusion need not be uniform over all normal initial states.
Proof. Kadison–Schwarz and invariance give
Also , so fixes and preserves its orthogonal complement. Iteration proves (19) for either order.
It remains to justify the predual conclusion, which is stronger than mere convergence of each fixed correlation. In this faithful normal GNS representation, is cyclic and separating for and cyclic for its commutant . The linear span of functionals
is norm dense in . Here is a direct verification. Vector functionals span a norm-dense subspace of the predual of a faithful normal representation. Approximate each pair of vectors by , , using cyclicity for . The corresponding coefficient is , with the inner product taken linear in the second variable. Approximation in vector norm implies approximation in functional norm, proving the density.
For , Cauchy–Schwarz and (19) give
Taking the supremum over proves predual convergence for these functionals. The channel preduals and are contractions, so norm density extends convergence to every normal functional, in particular every normal state.
This proposition requires a quantitative contraction of the GNS implementation on the centered space. Faithfulness or existence of a trace alone does not give such a contraction. No identification , no tracial cycling of factors, and no use of a density relative to has entered the proof. The estimate in (19) is an estimate on observables; its conversion to a predual estimate uses a dense class of functionals whose constants are not uniform over the whole state space.
Inhomogeneous transfer states over infinite bond algebras
This section proves Theorem 1.3. The physical algebra at each site is , and for . For , the algebra is identified with . The quasi-local algebra is the norm closure of . The bond algebra is an arbitrary von Neumann algebra. Since is finite dimensional, is a von Neumann algebra.
Transfer maps and finite-volume states
Fix normal unital completely positive maps , , and put
with . Each is a normal unital completely positive map on . For define recursively by and
extended by linearity. Thus , where is the normal -isomorphism that moves the factor to the left. The amplification of a normal unital completely positive map to is again normal, unital and completely positive. By induction, every has these three properties. In this recursion site is outermost, and the bond variable enters at site .
For write
A unital completely positive map is contractive and . Hence is a normal map with , and . If , then preserves adjoints.
Definition 11.1. For and , the finite-volume state with right boundary condition is
The functional is a state on , since is unital and positive. The left end of the chain is closed by the unit of , and the boundary state acts after the transfer map of site . This is the convention of [36], in which channels are trace preserving in the Schrödinger picture and therefore unital in the Heisenberg picture.
Lemma 11.2 (Block factorisation). For , , and ,
Consequently, for , and ,
If moreover with and , then for every ,
where denotes the unit of .
Proof. By linearity it suffices to take with and when . For , the first identity in (21) is (20). Assume it for . Then
and the right-hand side is by (20) applied on . The formula for follows by the same induction, since .
For (22), apply (21) with , , , and . This gives
The predual of is . The case gives . For (23), apply (21) first with , , and then with , . This gives
Applying and passing to preduals completes the proof.
Thermodynamic limit and decay of correlations
Proof of Theorem 1.3. By Theorem 6.3, applied to the sequence , there is a unique family of normal states of with , and
For define . This is consistent: if is regarded as , then by Lemma 11.2. Hence
Thus is a well-defined linear functional on . It is positive and unital on each , because is unital and positive. It therefore has norm one and extends uniquely to a state on .
This is the first estimate, since . Uniqueness follows because the right-hand side tends to zero for every fixed : a state with the same property has the same restriction to every , and these restrictions determine a state on .
For the clustering bound, let and put , a normal functional with . By definition of and (23),
where the second identity is (23) with , since and . Also . Hence
Suppose first that . Then is self-adjoint, , and . Therefore and
For general , write with self-adjoint and , and use linearity in . This gives the factor 4. Finally, .
Corollary 11.3 (Quantitative regimes). Under the notation of Theorem 1.3, put .
If , the hypothesis of Theorem 1.3 holds, with
If there are and with , then boundary dependence and correlations decay exponentially, uniformly in position:
Proof. Part (1) follows from Theorem 1.3 and (11), since and the product tends to zero for every fixed when . For part (2), apply Proposition 7.2 to the backward products of : the window coefficient satisfies , and both estimates of Theorem 1.3 are bounded by evaluated at the length of the relevant product.
Connection with matrix product states
Let and let satisfy the left-canonical condition . Define the isometry by , and set
Then is unital and completely positive, and is the Heisenberg dual of the trace-preserving channel . Iterating (20) gives, for ,
For a boundary density , therefore,
This is the finite-volume matrix product expression with right boundary . The limiting formula is the boundary-state representation of [36 Theorem 1.3], with the backward entrance law. In this finite-dimensional case, Theorem 5.2 reduces the minorization hypothesis to the Markov–Dobrushin condition of [36, 35], and the coefficients are the product trace-Dobrushin coefficients of [31].
Example 11.4 (An infinite bond algebra). Let be an infinite-dimensional separable Hilbert space and . Fix unitaries , a normal state of , states of , and numbers . Define
Each is normal, unital and completely positive. Moreover
so for every normal state , and . If , Corollary 11.3(1) applies. If for all , it gives exponential decay of boundary dependence and of correlations, with and . Here the bond algebra is a type I factor. More generally, replace by a normal -isomorphism . Such isomorphisms exist whenever is properly infinite, in particular for every type III factor, and when is the hyperfinite II factor, whose fundamental group is . The same conclusions hold verbatim.
Remark 11.5 (Uniformity is necessary). The estimate in Theorem 1.3 is uniform in the boundary state. The following example shows that pointwise mixing of the backward products does not suffice for boundary independence of the local states. Let , , and let , , be the maps of Theorem 8.4 with . Write for . Define
Every coordinate of is the normal product state . A unital positive map into a commutative von Neumann algebra whose coordinates are normal states is normal and completely positive. Thus is admissible, and so is each . Moreover for all .
For at site 1 and , Lemma 11.2 gives
because . Since and for , we get . With , for and for . Hence, for every fixed probability vector ,
The relevant backward products are mixing: by Theorem 8.4, and , because whenever , in particular for all . But for the boundary sequence one has for every , so the local state at site 1 depends on the boundary in the limit.
The same example lives on every infinite-dimensional -finite bond algebra. With as in Lemma 8.1, replace by . Since , the block maps become , and the finite-volume states become .
Consequences and limits of the extension
The preceding results give the following precise conclusions. First, uniform backward memory loss implies uniform convergence to a normal state on every von Neumann algebra, with no compactness hypothesis. Applying this from every starting time yields a unique normal entrance law and quantitative independence of terminal boundary conditions. This extends the backward contraction mechanism of the matrix setting at the uniform level.
Second, the corresponding pointwise assertion is universally valid exactly in finite dimension. In infinite dimension, nested, collectively compact state images and even finite-rank products do not suffice: the reservoir construction in Theorem 8.4 gives a counterexample on every infinite-dimensional -finite algebra. Thus the obstruction is not the distinction between types I, II, and III, nor merely the lack of compact output sets. It is the failure to control moving initial states when passing from pointwise to uniform convergence.
Third, the attained coefficient makes the common-lower-bound criterion meaningful in the absence of rank-one projections, traces, or normal pure states. It provides an upper bound on the optimal contraction coefficient , not an equality in general and not a CP-order decomposition. The construction avoids a nonexistent noncommutative lattice infimum and retains normality by domination.
Fourth, the backward theory applies directly to quantum spin chains. For transfer maps with values in an arbitrary von Neumann algebra, uniform backward memory loss gives a unique thermodynamic limit, uniformly in the boundary condition. The same product coefficients bound the decay of correlations, which recovers the finite-dimensional matrix product state picture of [36, 31] for an infinite-dimensional bond algebra. Remark 11.5 shows that this uniformity cannot be relaxed to pointwise mixing.
Finally, mixing, ergodicity, and memory loss address three separate questions: whether a trajectory converges, whether its time average converges, and whether initial preparations become indistinguishable. Composition order supplies a fourth distinction, and uniformity over starting times supplies a fifth. The homogeneous benchmark removes some of these distinctions through the power structure; time-dependent channels do not have that mechanism. The examples above identify exactly which additional assumptions are needed in the stated theorems, rather than attributing convergence to an algebra type or to unproved compactness intuitions.
References
- [1]L. Accardi, On the noncommutative Markov property, Functional Analysis and Its Applications 9 (1975), 1–8.
- [2]L. Accardi, F. Fidaleo, Entangled Markov chains, Annali di Matematica Pura ed Applicata 184 (2005), 327–346. https://doi.org/10.1007/s10231-004-0118-4.
- [3]L. Accardi, Y. G. Lu, A. Souissi, A Markov–Dobrushin inequality for quantum channels, Open Systems & Information Dynamics 28 (2021), 2150018. https://doi.org/10.1142/S1230161221500189.
- [4]L. Accardi, A. Souissi, E. G. Soueidy, Quantum Markov chains: a unification approach, Infinite Dimensional Analysis, Quantum Probability and Related Topics 23 (2020), 2050016. https://doi.org/10.1142/S0219025720500162.
- [5]V. V. Albert, Asymptotics of quantum channels: conserved quantities, an adiabatic limit, and matrix product states, Quantum 3 (2019), 151. https://doi.org/10.22331/q-2019-06-06-151.
- [6]T. Benoist, M. Fraas, Y. Pautrat, C. Pellegrini, Invariant measure for quantum trajectories, Probability Theory and Related Fields 174 (2019), 307–334. https://doi.org/10.1007/s00440-018-0862-9.
- [7]L. Bowen, B. Hayes, Y. F. Lin, A multiplicative ergodic theorem for von Neumann algebra valued cocycles, Communications in Mathematical Physics 384 (2021), 1291–1350. https://doi.org/10.1007/s00220-021-04043-9.
- [8]L. Bruneau, A. Joye, M. Merkli, Random repeated interaction quantum systems, Communications in Mathematical Physics 284 (2008), 553–581. https://doi.org/10.1007/s00220-008-0580-8.
- [9]D. Burgarth, G. Chiribella, V. Giovannetti, P. Perinotti, K. Yuasa, Ergodic and mixing quantum channels in finite dimensions, New Journal of Physics 15 (2013), 073045. https://doi.org/10.1088/1367-2630/15/7/073045.
- [10]R. Carbone, A. Jenčová, On period, cycles and fixed points of a quantum channel, Annales Henri Poincaré 21 (2020), 155–188. Preprint: https://arxiv.org/abs/1905.00857.
- [11]O. Ekblad, E. Moreno-Nadales, L. Pathirana, Ergodic theorems for quantum trajectories under disordered generalized measurements, arXiv:2501.18014 (2025). https://arxiv.org/abs/2501.18014.
- [12]O. Ekblad, J. Schenker, Reducibility theory and ergodic theorems for ergodic quantum processes, arXiv:2406.10982 (2024); first version entitled “Ergodic repeated interaction quantum systems: steady states and reducibility theory”. https://arxiv.org/abs/2406.10982.
- [13]M. Fannes, B. Nachtergaele, R. F. Werner, Finitely correlated states on quantum spin chains, Communications in Mathematical Physics 144 (1992), 443–490. https://doi.org/10.1007/BF02099178.
- [14]M. Fannes, B. Nachtergaele, R. F. Werner, Finitely correlated pure states, Journal of Functional Analysis 120 (1994), 511–534. https://doi.org/10.1006/jfan.1994.1041.
- [15]F. Fidaleo, On strong ergodic properties of quantum dynamical systems, Infinite Dimensional Analysis, Quantum Probability and Related Topics 12 (2009), 551–564. Preprint: https://arxiv.org/abs/0802.2076.
- [16]A. Frigerio, M. Verri, Long-time asymptotic properties of dynamical semigroups on W*-algebras, Mathematische Zeitschrift 180 (1982), 275–286. https://doi.org/10.1007/BF01318911.
- [17]S. Gaubert, Z. Qu, Dobrushin’s ergodicity coefficient for Markov operators on cones, Integral Equations and Operator Theory 81 (2015), 127–150. https://doi.org/10.1007/s00020-014-2193-2.
- [18]I. George, C. Hirche, T. Nuradha, M. M. Wilde, Quantum Doeblin coefficients: interpretations and applications, arXiv:2503.22823 (2025). https://arxiv.org/abs/2503.22823.
- [19]C. Hirche, Quantum Doeblin coefficients: a simple upper bound on contraction coefficients, in: Proceedings of the 2024 IEEE International Symposium on Information Theory (ISIT), 2024. Preprint: https://arxiv.org/abs/2405.00105.
- [20]M. Junge, Q. Xu, Noncommutative maximal ergodic theorems, Journal of the American Mathematical Society 20 (2007), 385–439. https://doi.org/10.1090/S0894-0347-06-00533-9.
- [21]B. Kümmerer, Markov dilations on W*-algebras, Journal of Functional Analysis 63 (1985), 139–177.DOI
- [22]B. Kümmerer, H. Maassen, A pathwise ergodic theorem for quantum trajectories, Journal of Physics A: Mathematical and General 37 (2004), 11889–11896. https://doi.org/10.1088/0305-4470/37/49/008.
- [23]E. C. Lance, Ergodic theorems for convex sets and operator algebras, Inventiones Mathematicae 37 (1976), 201–214. https://doi.org/10.1007/BF01390319.
- [24]A. Marrakchi, S. Vaes, Ergodic states on type III₁ factors and ergodic actions, Journal für die reine und angewandte Mathematik 809 (2024), 247–260. Preprint: https://arxiv.org/abs/2305.14217.
- [25]R. Movassagh, J. Schenker, Theory of ergodic quantum processes, Physical Review X 11 (2021), 041001. https://doi.org/10.1103/PhysRevX.11.041001.
- [26]R. Movassagh, J. Schenker, An ergodic theorem for quantum processes with applications to matrix product states, Communications in Mathematical Physics 395 (2022), 1175–1196. https://doi.org/10.1007/s00220-022-04448-0.
- [27]F. Mukhamedov, The Dobrushin ergodicity coefficient and the ergodicity of noncommutative Markov chains, Journal of Mathematical Analysis and Applications 408 (2013), 364–373. https://doi.org/10.1016/j.jmaa.2013.06.022.
- [28]F. Mukhamedov, Ergodic properties of nonhomogeneous Markov chains defined on ordered Banach spaces with a base, Acta Mathematica Hungarica 147 (2015), 294–323. Preprint: https://arxiv.org/abs/1311.0624.
- [29]F. Mukhamedov, A. Al-Rawashdeh, Generalized Dobrushin ergodicity coefficient and ergodicities of non-homogeneous Markov chains, Banach Journal of Mathematical Analysis 16 (2022), no. 1. Preprint: https://arxiv.org/abs/2001.07703.
- [30]B. Nelson, E. B. Roon, Ergodic quantum processes on finite von Neumann algebras, Journal of Functional Analysis 287 (2024), 110485. https://doi.org/10.1016/j.jfa.2024.110485.
- [31]L. Pathirana, Asymptotic replacement for quantum channel products with applications to inhomogeneous matrix product states, arXiv:2605.00157 (2026). https://arxiv.org/abs/2605.00157.
- [32]L. Pathirana, J. Schenker, Asymptotic behavior of random time-inhomogeneous Markovian quantum dynamics, arXiv:2509.08924 (2025). https://arxiv.org/abs/2509.08924.
- [33]D. Pérez-García, F. Verstraete, M. M. Wolf, J. I. Cirac, Matrix product state representations, Quantum Information and Computation 7 (2007), 401–430. Preprint: https://arxiv.org/abs/quant-ph/0608197.
- [34]M. Raginsky, Strictly contractive quantum channels and physically realizable quantum computers, Physical Review A 65 (2002), 032306. https://doi.org/10.1103/PhysRevA.65.032306.
- [35]A. Souissi, A. Barhoumi, An exponential mixing condition for quantum channels: application to matrix product states, Quantum Information Processing 24 (2025), 150. https://doi.org/10.1007/s11128-025-04762-1.
- [36]A. Souissi, Ergodic theory of inhomogeneous quantum processes, Quantum Information Processing 25 (2026), 220. https://doi.org/10.1007/s11128-026-05228-8.
- [37]F. J. Yeadon, Ergodic theorems for semifinite von Neumann algebras II, Mathematical Proceedings of the Cambridge Philosophical Society 88 (1980), 135–147.DOI