An algebraic construction of duality functions for the stochastic U_q(A_n^{(1)}) vertex model and its degenerations
Jeffrey Kuan

TL;DR
This paper constructs algebraic duality functions for the stochastic U_q(A_n^{(1)}) vertex model, demonstrating their applicability to various degenerations and related processes, and providing a new algebraic perspective on dualities in integrable stochastic systems.
Contribution
It introduces an algebraic construction of duality functions for the stochastic U_q(A_n^{(1)}) vertex model, connecting them to fusion processes and extending duality results to degenerations and multi-species models.
Findings
Duality functions D_{ta} are constructed algebraically for the stochastic vertex model.
Duality results extend to finite lattices and continuous-time degenerations.
The multi-species q-Hahn Boson process also exhibits duality with respect to D_0.
Abstract
A recent paper \cite{KMMO} introduced the stochastic U_q(A_n^{(1)}) vertex model. The stochastic S-matrix is related to the R-matrix of the quantum group U_q(A_n^{(1)}) by a gauge transformation. We will show that a certain function D^+_{\mu} intertwines with the transfer matrix and its space reversal. When interpreting the transfer matrix as the transition matrix of a discrete-time totally asymmetric particle system on the one-dimensional lattice Z, the function D^+_{\mu} becomes a Markov duality function D_{\mu} which only depends on q and the vertical spin parameters \mu_x. By considering degenerations in the spectral parameter, the duality results also hold on a finite lattice with closed boundary conditions, and for a continuous-time degeneration. This duality function had previously appeared in a multi-species ASEP(q,j) process. The proof here uses that the R-matrix intertwinesâŠ
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
An algebraic construction of duality functions for the stochastic vertex model and its degenerations
Jeffrey Kuan
Abstract
A recent paper [KMMO16] introduced the stochastic vertex model. The stochastic âmatrix is related to the âmatrix of the quantum group by a gauge transformation. We will show that a certain function intertwines with the transfer matrix and its space reversal. When interpreting the transfer matrix as the transition matrix of a discreteâtime totally asymmetric particle system on the oneâdimensional lattice , the function becomes a Markov duality function which only depends on and the vertical spin parameters . By considering degenerations in the spectral parameter, the duality results also hold on a finite lattice with closed boundary conditions, and for a continuousâtime degeneration. This duality function had previously appeared in a multiâspecies process [Kuan16]. The proof here uses that the âmatrix intertwines with the coâproduct, but does not explicitly use the YangâBaxter equation.
It will also be shown that the stochastic is a multiâspecies version of a stochastic vertex model studied in [BorPet16, CorPet16]. This will be done by generalizing the fusion process of [CorPet16] and showing that it matches the fusion of [KuReSk81] up to the gauge transformation.
We also show, by direct computation, that the multiâspecies âHahn Boson process (which arises at a special value of the spectral parameter) also satisfies duality with respect to , generalizing the singleâspecies result of [Cor15].
Contents
1 Introduction
Over the last 25 years, much work has been done investigating interacting particle systems with a property called stochastic duality (e.g. [BarCor16, BelSch15, BelSch15-2, BelSch16, BorCor13, BorCorSa14, CGRS15, CGRS16, Cor15, GKRV09, GRV10, Kuan15, Kuan16, Ohku16, Sch97, Sch16, SchSan94]). Duality has been shown to be useful for asymptotics [BorCorSa14], weak convergence [CST16], and shock dynamics [BelSch16]. The first use of duality in interacting particle systems actually goes back even farther, to 1970 [Spit70]. See also Chapter III of [Ligg] for an exposition and references.
A more recent direction of research has been to find dualities in multiâspecies versions of some of these systems. This was done in [BelSch15, BelSch15-2, BelSch16, Kuan15, Kuan16]. In these cases, the interacting particle system satisfied a Lie algebra symmetry, and the rank of the Lie algebra corresponded to the number of species of particles.
Duality has also been discovered in stochastic vertex models (see e.g. [BorCorGor16, BorPet16, CorPet16]). These vertex models enjoy the property of degenerating to a large class of other probabilistic models, including some of the ones above. However, the proofs of these dualities seem to be adâhoc, in the sense that they required knowing the duality function beforehand, and did not involve constructing the duality function using the algebraic symmetry of the model. Furthermore, there were no known examples of multiâspecies vertex models satisfying duality.
Thus, it is natural to look for a stochastic vertex model such that
(1) selfâduality holds with respect to a duality function which can be defined with the algebraic symmetry of the vertex model, and
(2) in certain degenerations of the vertex model, previous duality results can be recovered, and
(3) is a multiâspecies generalization of an existing singleâspecies model.
The purpose of this paper is to prove that the stochastic vertex model of [KMMO16] satisfies all three of these properties.
The stochastic vertex model is defined from a stochastic matrix depending on a spectral parameter ; see section 2.2 for definitions. The matrix is obtained from the (nonâstochastic) âmatrix of by a gauge transform. The action of on a certain representation then defines a local Markov operator. Here, is the horizontal spin parameter, is the vertical spin parameter, and the spectral parameters and satisfy . The corresponding transfer matrix then defines a Markov operator for an interacting particle system on a oneâdimensional lattice.
The original paper [KMMO16] specifically considers and finds a âspecies version of the âHahn Boson process introduced in [Pov13]. The âHahn Boson process has both a discreteâtime and a continuousâtime definition, with the continuousâtime process satisfying a Hecke algebra symmetry, as shown in [Take14]. When the vertical spin parameter converges to [math], this further degenerates to a single species âBoson process introduced by [SaWa98]. The paper here will consider general values of .
The main results will be summarized as follows.
(1) We will show that the stochastic vertex model (for generic values of ) satisfies selfâduality with respect to a certain explicit duality function . The function had previously appeared as the duality function of a multiâspecies , and is defined from the action of a certain element It only depends on the vertical spin parameters and not on the horizontal spin parameter. The proof uses that the âmatrix intertwines with the action of , but does not explicitly use the YangâBaxter equation. The proof also involves showing that the gauge is the same as the âground state transformationâ of [Kuan16] up to a diagonal change of basis.
(2) For a range of values of the spectral parameter , the matrix is stochastic (see Proposition 3.3). In section 3.1, some degenerations of will be considered. In particular, for degenerations of , the matrix becomes trivial (see Theorem 3.2). This actually allows for construction of the particle system in continuous time as well as on a finite lattice with closed boundary (see section 4.4). A noteworthy result is that the âspecies âBoson process introduced by [Take15] can be shown to satisfy selfâduality, which had previously been shown with different methods in [Kuan16]. Another interesting case is when , which shows that the âspecies discreteâtime âHahn Boson process is selfâdual with respect to . See Figures 1 and 2 for the degenerations discussed here.
It also turns out that the âspecies discreteâtime âHahn Boson process is also selfâdual with respect to , which was shown for in [Cor15]. However, it is not clear how to prove this algebraically. A direct proof will be given.
(3) It will be shown that the stochastic vertex model is a âspecies generalization of the models of [CorPet16, BorPet16]. This will be done by showing that the âstochastic fusionâ procedure of [CorPet16] can be generalized for multiple species (see Theorem 3.4). Additionally, the Markov projection to the first species is a vertex model (see Proposition 3.8). The latter property is typical for multiâspecies models (see e.g. [Kuan16]).
It is also worth explicitly mentioning the role of the boundary conditions in the duality results. The transfer matrix of the stochastic vertex model intertwines with its space reversal under a certain function which also acts on the auxiliary space. In order to reduce to a duality functional which does not act on the auxiliary space, a certain cancellation is needed (Lemma 4.2), but this reduction does not seem to hold for open or periodic boundary conditions.
The remainder of the paper is outlined as such: Section 2 states the necessary definitions, notations and results from previous papers. In section 3, further properties of will be proved, including ranges for which the matrix is stochastic (Proposition 3.6), degenerations (section 3.1), Markov projections (Theorem 3.8), and stochastic fusion (Theorem 3.4).
Section 4 defines the transfer matrix and proves duality results for the resulting particle systems. The main theorem is stated in Theorem 4.5, which shows that intertwines between the transfer matrix and its space reversal. This results in duality results for a discreteâtime particle system on the infinite line (Theorem 4.10), on a finite lattice with closed boundary conditions (Proposition 4.12), and for a continuousâtime degeneration (Proposition 4.14). Section 5 describes the processes that can be obtained from the various degenerations: subsection 5.1 considers the multiâspecies âHahn Boson process, and section 5.2 considers the case when . Section 6 shows, using direct computation, the selfâduality of multiâspecies âHahn Boson with respect to , as well as the Markov projection property.
Acknowledgments. The author would like to thank Alexei Borodin and Ivan Corwin for helpful conversations. Financial support was provided by the Minerva Foundation and NSF grant DMSâ1502665.
2 Preliminaries
This section will review results from previous papers and state necessary definitions.
2.1 Definitions
2.1.1 ânotation
For and , let the âPochhammer symbol be defined by
[TABLE]
Furthermore define
[TABLE]
Notice that
[TABLE]
so these can be viewed as âdeformations of the usual integers, factorials, and binomials. Another useful âdeformation is
[TABLE]
Note that , and similarly for the âfactorials and binomials.
There is a âanalog of the Binomial theorem, which states that if and are variables such that , then
[TABLE]
This can be stated equivalently as a sum over subsets. Any subset can be identified with a monomial in and by setting index the locations of the variable : for example, if , then the corresponding monomial is For any subset with elements, let
[TABLE]
Then
[TABLE]
For example, for and , then
[TABLE]
and
[TABLE]
Note that by the identity
[TABLE]
it is possible to extend these âdeformations to complex numbers. Define the âGamma function as
[TABLE]
for . When , converges to the usual Gamma function . This definition is related to via
[TABLE]
The rightâhandâside is wellâdefined even if , so the âfactorials and binomials are still wellâdefined.
2.1.2 Representation Theory
The DrinfeldâJimbo quantum affine algebra (without derivation) is generated by with the Weyl relations
[TABLE]
and the Serre relations (for )
[TABLE]
where the indices are taken cyclically (i.e. as elements of . The coâproduct is an algebra homomorphism defined by
[TABLE]
The formula for the coâproduct is actually not canonical. Another choice of coâproduct is
[TABLE]
which leads to essentially the same algebraic structure. The coâproduct satisfies the coâassociativity property, which says that as maps from to ,
[TABLE]
Because of co-associativity, higher powers of can be defined inductively and unambiguously as algebrahomomorphisms by
[TABLE]
We will also use Sweedlerâs notation:
[TABLE]
where each is some element of .
There is an involution of defined on generators by
[TABLE]
It is straightforward to check from the Weyl and Serre relations that is indeed an automorphism, and it is immediate from the definition that .
For , let be the vector space with basis indexed by the set
[TABLE]
The superscript will be dropped if it is clear from the context. For , define with the at the th position and the at the th position. For , define the representation of on by
[TABLE]
The parameter is called the spectral parameter of the representation. Let denote the vector space of the representation . The subalgebra generated by is denoted , and for this subalgebra the spectral parameter does not play a role. The vector space is the âth symmetric tensor representation, which will be used in section 2.5 below.
For any , let be the vacuum vector. In other words, is the basis vector indexed by . Analogously, let capital alpha denote the basis vector indexed by . In general, will be interpreted as a particle configuration with an number of th species particles for . The th species of particles will be considered holes. From the viewpoint of probability theory, it is somewhat unnatural to consider holes as being present in the state space. Because of this, it will also be useful to define and . Note that if , then equals . Thus, any expression depending on can be written as an expression depending on and . In particular, define the limit
[TABLE]
where does not depend on .
This definition can be extended to vector spaces and operators. For any , define to be the vector space indexed by the set
[TABLE]
If , then , and thus any map on can also be defined as a map on . Extend the map on to a map on by defining to be zero outside of . With these definitions, given any sequence of maps on , define the limit to be a map on , if the limit exists.
Given , also let . If , then set .
2.1.3 Duality
Recall the definition of stochastic duality:
Definition 2.1**.**
Two Markov processes (either discrete or continuous time) and on state spaces and are dual with respect to a function on if
[TABLE]
On the leftâhandâside, the process starts at , and on the rightâhandâside the process starts at .
An equivalent definition (for continuousâtime processes and discrete state spaces) is that if the generator111Note that in probabilistic literature, a stochastic matrix has rows which sum to , whereas in mathematical physics literature, the columns sum to 1. This paper uses the latter definition. If the former definition were used, then the definition of duality would be . of is viewed as a matrix, the generator of is viewed as a matrix, and is viewed as a matrix, then . For discreteâtime chains with transition matrices and also viewed as and matrices, an equivalent definition is
[TABLE]
If and are the same process, in the sense that and (for continuous time) or (for discreteâtime), then we say that is selfâdual with respect to the function .
Suppose that , where is an interval and is a countable set. If is an involution of such that for all , then induces an involution of by
[TABLE]
If and , then we say that satisfies spaceâreversed selfâduality with respect to .
Remark 2.2**.**
In the literature, some authors do not draw a distinction between selfâduality and spaceâreversed selfâduality. However, for the duality functions of interest here, a totally asymmetric process cannot satisfy selfâduality, but it does satisfy spaceâreversed selfâduality (see the remarks before Proposition 2.6 of [Kuan16]). The terminology here is chosen to emphasize this distinction.
Remark 2.3**.**
Note that if is a function on which is constant under the dynamics of and , then is also a duality function. This will be used to simplify the expression for . For this paper, will be a function which only depends on the number of particles of each species, which is a constant assuming particle number conservation. See [Ohku16] for an example of duality functions on a lattice with open boundary conditions, in which this type of simplification is not applicable.
2.1.4 Lumpability
Let be a matrix and let be a partition of , and a partition of . Recall the convention that a matrix is stochastic if the columns (rather than the rows) sum to . Say that is lumpable (with respect to and ) if for all
[TABLE]
whenever are in the same block . Define the matrix by setting to be the quantity above.
The composition of lumpable matrices is again lumpable. To see this, If is a matrix which is lumpable with respect to and , then for ,
[TABLE]
This does not depend on the choice of in , so is lumpable with .
This is a generalization of a lumped Markov process introduced in [KeSn76]. The condition that a Markov process is lumpable is simply the condition that a projection of a Markov process is still Markov. There are more general conditions of interest: for example, [PitRog81] gives an intertwining condition in which the projection is random. In particular, if is a stochastic matrix, and is a stochastic matrix, is a stochastic matrix, then define the matrix
[TABLE]
If is the identity matrix on , and satisfy the intertwining relation
[TABLE]
then maps the Markov chain defined by to a wellâdefined Markov chain defined by .
It is not hard to see that the PitmanâRogers relation is a generalization of lumpability. if is a partition of , pick an arbitrary element for each . Then define and by
[TABLE]
It is immediate that is the identity matrix on . If is lumpable with respect to , then
[TABLE]
does not depend on the choice of , and is the transition matrix of the lumped Markov chain. Furthermore, the lumpability implies that for ,
[TABLE]
Remark 2.4**.**
One example of a lumpable Markov process is âspecies ASEP. In this process, there are species of particles, and at most one particle may occupy a lattice site. One can think of each species as having a different mass. If a particle attempts to jump to a site occupied with a heavier particle, then the jump is blocked. If a particle attempts to jump to a site occupied with a lighter particle, then the two particles switch places. All left jumps occur with the same rate (independent of the species), and likewise all the right jumps occur with the same rate (independent of the species). It is not hard to see that the projection onto the first species results in âspecies ASEP, since each particle treats lighter particles the same as holes. This model was first introduced in [Ligg76].
A more general model would allow the jump rates to depend on the species of the particles. In this case, the projection onto the first species is no longer a âspecies ASEP. See [Ka99, Kuan15] for examples of multiâspecies ASEP which have jump rates depending on the species. With open boundary conditions, several models (see. e.g. [Can15, CFRV16, CGGW16, CoMaWi15, Man15, ManVie15, Uch08]) have jump rates at the boundaries which depend on the species, with jump rates in the bulk that are independent of the species. See also [CGW16, PEM09] for multiâspecies ASEP on a ring, with jump rates independent of the species.
2.1.5 Operator Notation
We introduce some notation for operators. Given two linear spaces and , a symbol of the form will denote an linear map with domain . In particular, let be the permutation operator defined by . Given an operator from to itself, let denote the reversed operator on :
[TABLE]
Given on , let be the map .
Suppose is a family of vector spaces and for each , is an operator on . By abuse of notation, the subscript in will often be dropped. Given , the tensor power will be denoted . For , let denote . Let denote the operator on . Given , let be the operator from to defined by
[TABLE]
and note that
[TABLE]
If is an operator on and is the reversal permutation , let
[TABLE]
If acts on for , then is the action on the component of the tensor product of for .
The âket means , and similarly for the braâ . The Greek letters and will denote multiple tensor products, e.g. .
As usual, denotes the transpose of .
2.2 Results from [KMMO16]
For this section, and , where .
For every and , there is an âmatrix
[TABLE]
where depends on the spectral parameters of . This âmatrix is characterized, up to a constant, by the intertwining property (see (4) of [KMMO16])
[TABLE]
viewed as maps . The constant is normalized by
[TABLE]
The âmatrix also satisfies the YangâBaxter equation.
It also satisfies ( see (12) of [KMMO16], which is a corollary of (2.4) and (2.24) of [KuOkSe15])
[TABLE]
where denotes the chargeâreversed array of , i.e. . We can write this as
[TABLE]
where is the diagonal change of basis matrix on
[TABLE]
and is the chargeâreversal matrix on ,
[TABLE]
Note that for ,
[TABLE]
Additionally, satisfies the particle conservation property, which is that
[TABLE]
The âmatrix is related to the by a gauge transform, with the explicit definition (see (15) of [KMMO16])
[TABLE]
Here, let be the gauge transform defined on by the diagonal matrix
[TABLE]
The operator intertwines between and via
[TABLE]
because the leftâhandâside switches the indices and , while the rightâhandâside switches the indices and . The original paper [KMMO16] only defined for , but it will be seen below that this is the natural extension to sites. The superscript will sometimes be included to emphasize the number of lattice sites.
Just like the âmatrix , the âmatrix satisfies the YangâBaxter equation.
Remark 2.5**.**
In a comment after Theorem 6 of [KMMO16], it is noted that the gauge transformation comes from the âorbit of the unit normalization condition (4). This is a similar idea to the âground state transformationâ of [Kuan16], using the framework of [CGRS15], in which the creation operators are applied to the ground state . Because of this similarity, one might expect a simple relationship between these two transformations. Indeed, this will be stated and shown explicitly in Proposition 4.1.
Remark 2.6**.**
Theorem 6 of [KMMO16] explicitly states that the sum of the output of is equal to , for any value of the spectral parameter . This result is proved again in [BoMa16], using a factorized expression for , and furthermore gives a range of values for which has nonânegative entries, and is therefore stochastic. Section 3.3 below will also give a range of values of for which is stochastic, using different methods.
The transfer matrices (with periodic boundary conditions) are defined as follows:
[TABLE]
where is viewed as an operator on , and the trace is taken over the auxiliary space . As stated in [KMMO16], the stochastic âmatrices satisfying the YangâBaxter equation implies that the transfer matrices form a commuting family, but this will not be needed here. Because the transfer matrices are operators on , they can be viewed as transition matrices for a particle system on the lattice .
So far, we have not used any explicit formulas for the stochastic matrix . In [KMMO16], there were explicit formulas for acting on when and . In this case, define
[TABLE]
where
[TABLE]
and the stochastic operator, written as , acts as
[TABLE]
Also note that taking the derivative in , one obtains (see (43) of [KMMO16])
[TABLE]
The functions and can be used to define a multiâspecies version of the âHahn Boson process of [Pov13] in discrete and continuousâtime (respectively), as described below in Section 2.3. Observe that only depends on through particle conservation, which will not be true of for generic values of . This means that parallel update will generally not be possible.
It is worth noting that several subsequent papers ([KuOk16, KuOk16-2]) prove results for the stochastic vertex model in the âHahn Boson degeneration. It is possible that those results hold for more general values of the spectral parameter, but this is not pursued here.
The appendix of [KMMO16] also includes explicit formulas for acting on in the cases that and . The vector space is spanned by the basis elements where has a at the th location and zeroes elsewhere. When
[TABLE]
When ,
[TABLE]
2.3 The âHahn Boson process
For , the function from the previous section was introduced by [Pov13] in the form , and was used to define the (singleâspecies) âHahn Boson process in discrete and continuous time.
The state space consists of particle configurations on a lattice. There is no restriction on , the number of particles at lattice site . The discreteâtime update can be described in the following way. Given a particle configuration with particles at lattice site , the probability measure after the (discreteâtime) update is described by
[TABLE]
The physical description is that with probability , particles leave lattice site and jump to lattice site . Simultaneously (i.e. in parallel), particles leave lattice site and jump to lattice site with probability . In this case, we will say that the process evolves with total asymmetry to the right. If the probability measure after the update is given by
[TABLE]
then we say that the process evolves with total asymmetry to the left.
The continuousâtime update can be described as follows. For evolution with total asymmetry to the left, the generator can be written as a sum of local generators , where the off-diagonal entries of are
[TABLE]
and the diagonal entries are given by the condition that . The first line indicates that only causes particles to jump from to , and the second line expresses particle conservation.
For evolution with total asymmetry to the right, the generator can be written as a sum of local generators , where the off-diagonal entries of are
[TABLE]
At , the singleâspecies continuousâtime âHahn Boson process can also be constructed through a deformation of an affine Hecke algebra [Take14]. Additionally, for general and , the process had been previously constructed in [Take15] using a higher rank affine Hecke algebra, and there it is called a multiâspecies âBoson process. The singleâspecies âBoson process goes back to [SaWa98].
See Figure 1 for a diagram showing the various processes.
Remark 2.7**.**
Even though the entries of acting on can be written in terms of the function , it is not technically accurate to describe the resulting particle system as the âHahn Boson process. This is because the state space of the âHahn Boson process does not place a constraint on the number of particles at each site, whereas the vector space only constrains for particles at a site. This distinction is important here because Proposition 6.5 is false if only finitely many particles are allowed at each site; see Remark 4.13 for an explanation. However, after analytic continuation in the variables , there is no longer such a particle constraint, and the statement is true.
2.4 Results from [Kuan16]
Let be the deformed exponential
[TABLE]
Note that as , becomes the usual exponential. Let be the element222Note that because is an infinite sum in the generators, it actually belongs to a completion of . of
[TABLE]
The deformed exponential satisfies a pseudoâfactorization property (see [CGRS15]), which implies
[TABLE]
This will result in a simpler expression for the duality function, as will be seen below.
Let be the ground state transformation, which is the diagonal matrix with entries
[TABLE]
where denotes the vacuum vector on sites. This transformation was previously used in [Kuan16], using the framework of [CGRS15]. By Proposition 4.2 of [Kuan16],
[TABLE]
where for and , set
[TABLE]
Here, and below, we say that a function is constant under particle conservation if it only depends on the values of and for . The notation will denote a constant under particle conservation. By Remark 2.3, if is a duality function then so is , as long as particle conservation is satisfied.
For , define the operator on :
[TABLE]
Note that the in this paper is denoted in [Kuan16]. Then by Proposition 5.1 of [Kuan16], the operator has an explicit formula, which is that is equal to
[TABLE]
It is not hard to see that an equivalent expression is
[TABLE]
To see this, note that the indicator term can be removed, because if its condition does not hold, then the âbinomial term is zero anyway. The other necessary identity is
[TABLE]
Note that the expression for is still wellâdefined even when . Letting , the operator will sometimes be denoted to emphasize the dependence on . Additionally (see the proof of Proposition 5.2(b) of [Kuan16]),
[TABLE]
so that if one takes all and assumes , then the limit is
[TABLE]
Since and does not involve , the operator does not involve the spectral parameter.
The paper [Kuan16] constructs a multiâspecies version of a process called . The singleâspecies case was introduced in [CGRS15], and is itself a generalization of the usual ASEP, in which up to particles can occupy a lattice site. In the homogeneous case when all , [Kuan16] shows that this multiâspecies has a duality property with respect to the function .
Furthermore, when , the multiâspecies converges to the multiâspecies âTAZRP of [Take15]. Taking , this shows that the multiâspecies âTAZRP satisfies the duality with respect to the duality function of (16). This was explicitly stated in Theorem 2.5(b) of [Kuan16], and will be proved again below as Corollary 5.3.
2.5 Fusion
The âmatrix acting on can also be defined through a process called fusion, developed in [KuReSk81]. See also the exposition in section 3.5 of [Resh10]333 Note that the notation here is different than in [Resh10], due to slightly different conventions in the definition of the quantized affine Lie algebras, which result in substitutions . Section A.1 will give examples demonstrating that this is the correct expression.. The representation is the th symmetric tensor representation, meaning that it is the symmetric projection of , the th tensor power of the canonical representation . There is an isomorphism (of representations) from to the image of the symmetric projection. This isomorphism is unique up to a constant, because it must map a lowest weight vector of to a lowest weight vector of . Let denote the isomorphism satisfying
[TABLE]
For generic values of , the image of the projection can be written using the expression for the ground state transformation from (12). This can be seen for the following reasons: The representation is the irreducible subârepresentation of generated by the vector . Therefore, the element is also in . Because has a weight space decomposition , the element decomposes as a sum over , with each term in the summand also in . Each of these terms can be computed from the ground state transformation, which is given by the coefficients of the action of on . More explicitly, given any ,
[TABLE]
There are two expressions for the fusion that will be used here. The âmatrix acting on can be written as an operator on . Then, the âmatrix can be determined from acting on by
[TABLE]
Note that the power of decreases by in both the horizontal and vertical directions. If the âmatrix acting on has already been defined, then acting on can be written as an operator on . In this case,
[TABLE]
The two above equations are meaningful because the fusion of âmatrices preserves the image of , in the sense that
[TABLE]
This is nonâtrivial, and uses the fact that satisfies the YangâBaxter equation. A stronger statement holds as well: if denotes the projection from onto the subârepresentation , then
[TABLE]
as operators from to . See equations (16)â(18) of [KuReSk81].
2.6 Relationship to previous results
2.6.1 The [CGRS15] framework
In [CGRS15], the authors lay out a framework for constructing interacting particle systems with duality functions from a quantum group and a central element . There is some overlap between the argument here: for example, the construction of the duality function is identical.
Despite these similarities, there are still two differences worth noting. In [CGRS15], the relevant information about the central element is that its coâproduct commutes with for any :
[TABLE]
By comparing with (3), one can think of as taking the role of . However, in (3), the maps permute the order of , which was not the case before in [CGRS15].
Another difference occurs through (5). In [CGRS15], it is assumed that is selfâadjoint. In [Kuan16], this assumption is weakened so that is selfâadjoint for some diagonal matrix . In the situation here, needs to be conjugated by a nonâdiagonal matrix, the charge reversal matrix, to obtain a selfâadjoint operator. Note that a formula similar to (5) appears as (34) in [PovPri06]. Indeed, (5) can be interpreted as chargeâtime symmetry, and is used as such in [BCPS15].
2.6.2 Singleâspecies stochastic vertex model from [BorPet16, CorPet16]
The stochastic matrices from [CorPet16] have the expression (after substituting with )
[TABLE]
Here, is the number of particles at a lattice site, with either [math] or particles entering in the auxiliary space. These are also the expressions from [BorPet16] with and . For , can be viewed as a stochastic operator from to itself. In general, it can be viewed as a stochastic operator from to itself.
The fusion procedure from [CorPet16] is written in the following way. Define the matrix , with rows indexed by and columns indexed by , which has entries
[TABLE]
It is immediate that is a stochastic matrix. Define the matrix , with rows indexed by and columns indexed by , which has entries444In [CorPet16], the auxiliary space is written on the right, in the sense that the operators act on instead of . Reversing the order of the tensor products results in in the definition of , instead of . It also results in the reversal of the operators in (24).
[TABLE]
The normalizing constant is chosen so that is stochastic. Now identify with (with products) by sending to and [math] to . Also identify with by sending to Since is a basis of and is a basis of , with these identifications is a stochastic operator from to and likewise is a stochastic operator from to .
When viewed as operators, the composition
[TABLE]
is a stochastic operator from to itself, and it was shown that it satisfies the PitmanâRogers intertwining condition [PitRog81] for a map of a Markov chain to be Markov. We we see below in Theorem 3.4 that this fusion process matches the one from section 2.5, up to the application of the gauge transformation. This will result in the statement that the stochastic vertex model is a multiâspecies generalization of this model; see Proposition 3.10.
Remark 2.8**.**
It is not immediately obvious that the case reduces to the stochastic vertex model of [BorPet16, CorPet16]. For example, it is remarked (see Remark 6.9 of [BorPet16-2]) that the transformation from the nonâstochastic matrix to the stochastic matrix uses the eigenfunctions of the transfer matrices, whereas the gauge/ground state transformation here does not require the definition of the transfer matrices.
3 Further results about
Before continuing on to the results concerning dualities and the transfer matrices, a few more results about will be collected in the section.
3.1 Additional Degenerations
3.1.1 At
When , the explicit expressions for are given in (9). After applying the gauge transformation, the resulting matrix is
[TABLE]
Notice that in order for parallel update to be possible, the output of cannot depend on the input. In other words, the expressions cannot depend on , and one can quickly see that this only happens at . This corresponds to the case considered in [KMMO16], when the expressions are given by .
Remark 3.1**.**
There are a few interesting degenerations to consider:
- âą
Taking the limit yields
[TABLE]
Observe that in the case when , the corresponding entry is [math]. Furthermore, none of the entries depend on the parameter . Note that the third line also describes the jump rates of the continuousâtime multiâspecies âBoson process introduced in [Take15].
- âą
Another point of interest is at , in which case
[TABLE]
Furthermore, assuming , then
[TABLE]
Theorem 3.2 will show that these two items are true for general values of .
- âą
Also, under the inversions and charge reversal,
[TABLE]
which are similar expressions to the entries of . See Theorem 3.7 for a precise statement which holds for general values of .
- âą
If the limit is taken first, then (assuming and is finite)
[TABLE]
If , then in the limit, the result is no longer stochastic.
3.1.2 At
Now fix and let . By (10) and the gauge transformation,
[TABLE]
In order for parallel update to be possible, these expressions cannot depend on , which only happens when This can be rewritten as
[TABLE]
As in the previous section, there are a few interesting degenerations. If , then in the limit , the resulting stochastic matrix has entries
[TABLE]
If is then taken to infinity, the limit is
[TABLE]
If , then
[TABLE]
which does not depend on . In the limit and assuming ,
[TABLE]
3.1.3 At
Here, we show that the examples in the previous two sections are true in general. Note that the theorem does not assume that is stochastic, but it does use that the columns sum to .
Theorem 3.2**.**
(a) When , the matrix acting on satisfies the property that can only be nonzero if for all . By particle conservation, an equivalent conclusion is .
When , the matrix acting on satisfies the property that can only be nonzero if for all . By particle conservation, an equivalent conclusion is .
(b) When , the matrix acting on does not depend on , in the following sense: If and satisfy , then
[TABLE]
Similarly, when , the matrix acting on does not depend on .
(c) If , then in the limit ,
[TABLE]
If , then in the limit ,
[TABLE]
These limits are taken in the sense described in Section 2.1.2.
Proof.
(a) By fusion (2.5), the âmatrix acting on can be written as a product of âmatrices acting on . From the explicit formula for the case (10), the relevant offâdiagonal entries become [math] when or . This implies (a).
(b) We prove the first statement, with the proof of the second statement being similar.
Let and satisfy , as in the statement of the theorem. By the explicit formula for the gauge transformation,
[TABLE]
Therefore it is equivalent to show that
[TABLE]
The proof of (26) will be a strong induction argument on . Define the total ordering by
[TABLE]
In the base case when and , the input must equal . By part (a), is only nonzero for . Since the columns of sum to one,
[TABLE]
This does not depend on .
For the inductive step, there are the two cases when and . Start with . First we show a preliminary identity: if denotes the âreducedâ , then
[TABLE]
The proof of this identity uses (3). By (2),
[TABLE]
This simplifies to
[TABLE]
which furthermore simplifies to
[TABLE]
Because by assumption, part (a) implies that can only be nonzero if . Therefore,
[TABLE]
But then by particle conservation, , implying that
[TABLE]
or equivalently,
[TABLE]
By repeatedly applying this last identity,
[TABLE]
But this also holds for and , and , so (27) holds.
Observe now that since we just showed that for nonzero entries, therefore the rightâhandâside of (27) only contains basis elements for which . By the strong induction hypothesis,
[TABLE]
Therefore
[TABLE]
This completes the inductive step when .
Now turn to the inductive step when . By (3) and (2),
[TABLE]
This simplifies to
[TABLE]
which furthermore simplifies to
[TABLE]
Therefore
[TABLE]
This can be rewritten as
[TABLE]
The on the rightâhandâside are wellâdefined because by assumption . By the strong induction hypothesis,
[TABLE]
At the same time, applying (28) to shows that
[TABLE]
Comparing the last two equalities shows
[TABLE]
which simplifies to
[TABLE]
This completes the inductive step and the proof of (b).
(c) Consider the case when and , since the other case is similar.
Use the expression (20) for fusion. At in (9), the largest asymptotic contribution occurs when , when the contribution is . This contribution will happen times, for a total of asymptotically. The gauge transform multiplies the âmatrix by
[TABLE]
which is asymptotically . This gives a total of , which is zero for any . Because the columns sum to , the entry must be for .
â
Remark 3.3**.**
If the limits are taken for , there is no guarantee that the result would be stochastic for every value of . In particular, the limit of the entries need not be bounded.
3.2 Stochastic fusion
In this section, we generalize the fusion procedure of [CorPet16] described in Section 2.6.2 to the multiâspecies case, and show that it matches the fusion of [KuReSk81] described in Section 2.5, after applying the gauge transformation.
Define an order on by . Given , let
[TABLE]
Note that is related to the ground state transformation by
[TABLE]
Define for any , the operator from to by
[TABLE]
Here, and is a normalization constant chosen so that is stochastic. Also define the operator from to by
[TABLE]
It is immediate that is stochastic. It is also straightforward that when , the definitions of and match that of 2.6.2.
Part (a) of the next theorem shows that the stochastic vertex model is a âspecies generalization of the stochastic vertex models of [BorPet16, CorPet16]. Part (b) generalizes Proposition 3.6 of [CorPet16], which showed that the fused matrix satisfies the RogersâPitman intertwining described in section 2.1.4.
Theorem 3.4**.**
(a) The matrix acting on can be written as
[TABLE]
(b) The composition is the identity on . As operators from to ,
[TABLE]
Proof.
(a) Begin by analyzing the rightâhandâside of (30). Given and in , set
[TABLE]
Further define by
[TABLE]
In words, this says that together have the same number of each species of particles as . Then by particle conservation,
[TABLE]
Now we show that
Lemma 3.5**.**
With the definitions above,
[TABLE]
where
[TABLE]
and
[TABLE]
Proof.
Using that
[TABLE]
it suffices to show that
[TABLE]
If is defined by , then
[TABLE]
By particle conservation, and the fact that for ,
[TABLE]
Substituting that for
[TABLE]
Therefore,
[TABLE]
as needed.
A similar argument holds for . Similarly, if is defined by then
[TABLE]
By particle conservation, and using that for , and for
[TABLE]
so that
[TABLE]
This finishes the proof of the lemma. â
Therefore, the lemma implies that
[TABLE]
At the same time, by the fusion described in Section 2.5,
[TABLE]
Since
[TABLE]
the theorem will now follow from two identities. The first is
[TABLE]
After proving this first identity, it will remain to prove the second identity
[TABLE]
where is the diagonal operator on with entries
[TABLE]
Recall that because of (2.5), it suffices to restrict the domain of to the image of .
To prove the first identity, note that
[TABLE]
where is the constant, only depending on (and not on ), defined by
[TABLE]
By (18) and (29), this shows that the first identity holds up to a constant that depends only on . Since both the leftâhandâside and rightâhandâside of (30) satisfy the property that every column sums to , this constant must be .
Now proceed to the second identity. It is immediate from the definitions that the identity holds on . To show the identity holds in general, it suffices to show
[TABLE]
since the is generated by the generators acting on . Since any exponents in other than will result in zero, it suffices to show
[TABLE]
Since is an intertwiner of representations, the rightâhandâside equals . By the definition of the representation (2), the rightâhandâside evaluates to
[TABLE]
where
[TABLE]
Now proceed to the leftâhandâside. Given , define for by
[TABLE]
For example, and . Then
[TABLE]
The sum over can be re-written as a sum over sequences of subsets , where each is the set
[TABLE]
This is advantageous because now defining
[TABLE]
leads to the two identities
[TABLE]
The first identity above uses the pseudoâfactorization property (11). These two identities together establish that
[TABLE]
Each is a set with elements, and the sum over subsets is a sum over subsets of elements. By the âBinomial theorem, stated as equation (1),
[TABLE]
which equals the rightâhandâside.
This completes the proof of (a).
(b) It follows immediately from the definitions that is the identity on .
By Lemma 3.5,
[TABLE]
and
[TABLE]
Because the weight spaces of are oneâdimensional, . Again using
[TABLE]
it suffices to show that
[TABLE]
But this follows from (22) and (32).
â
3.3 Stochasticity of
For certain explicit values of the spectral parameter , the âmatrix is stochastic.
Proposition 3.6**.**
The operator acting on is stochastic in the cases:
- âą
Both and hold.
- âą
Both and hold.
Proof.
We have already seen that the output of sums to . Since the entries of the gauge transformation are nonânegative (for ), it remains to show that the entries of are nonânegative.
By (9), the proposition holds for , when . By the fusion procedure (2.5), if in the first case (and in the second case), then is a product of matrices with nonânegative entries, so is itself a matrix with nonânegative entries.
The equation (20) can also be used to arrive at the same result. For and general values of , (9) shows that nonânegativity holds for in the first case (and in the second case). For general values of both and , the necessary inequality from (20) is or .
â
Note that this is not an exhaustive list of all values for which is stochastic, since is not included. Also note that the second case of Proposition 3.6 is similar to (3.9) of [BoMa16].
There is a certain symmetry in the two cases in Proposition 3.6, in that the second case can be derived from the first under simultaneous change of variables . Indeed, it turns out the two cases are related according to the choice of coâproduct and the charge reversal . Recall the alternative coâproduct defined in section 2.1.2, and that was uniquely defined by the intertwining property (3) and the unit normalization condition (4). Equation (4) is encapsulated in the sumâtoâone property of stochastic matrices, and (3) is described in the next proposition.
Proposition 3.7**.**
The âmatrix is preserved under simultaneous inversion of the spectral parameter , asymmetry parameter , and charge reversal, in the sense that for all , the equality
[TABLE]
holds as operators on .
Proof.
First show that as operators on for any ,
[TABLE]
This is actually straightforward from . For instance,
[TABLE]
and similarly for and .
And now as operators on ,
[TABLE]
where the third equality reflects the fact that the action of is preserved under , but the action of is inverted. Similar arguments hold for . Therefore, recalling the definition of the involution ,
[TABLE]
as needed. â
Note that the differing choice of coâproduct would also result in a different expression for the gauge transformation, since the latter comes from the âorbit of (4), and the action of is determined by the coâproduct.
3.4 Lumpability of
Recall the definition of lumpability in section 2.1.4. The next proposition says that projecting the model onto consecutive particles is the model.
Proposition 3.8**.**
Fix . The stochastic matrix on is lumpable with respect to the partition on defined by
[TABLE]
The lumped matrix is the matrix acting on
Furthermore, given any , is lumpable with respect to the partition
[TABLE]
The lumped matrix is the matrix acting on
Proof.
Since the projections can be composed, it suffices to prove the first statement.
By Theorem 3.4, is a composition of stochastic operators, so it suffices to show that each of those operators is lumpable with respect to the same partition. It is straightforward that and are lumpable. The matrix acting on is lumpable, which follows from the following calculations from (25):
For ,
[TABLE]
For ,
[TABLE]
For ,
[TABLE]
For ,
[TABLE]
â
3.5 Analytic Continutation
In the case when , the formula (25) allows for an analytic continuation in the variable . The expressions for the matrix entries can be re-written as
[TABLE]
This is a matrix acting on . Note that the third line does not occur in the case. However, this scenario actually significantly restricts the cases in which is stochastic.
Proposition 3.9**.**
Assume that all take real values. The matrix is stochastic if and only if one of the following cases holds:
- âą
**
- âą
* ** and either ** *
Proof.
If , then the second and fourth lines are equal to and all other lines are [math] (corresponding to the fourth item of Remark 3.1). In this case, is stochastic, so assume hereafter that .
First consider the case when . If is stochastic, then the fifth, third, and second lines respectively show that and all have the same sign. Since , then and have the same sign as well. But for sufficiently large values of , the expression will have a different sign from . This is a contradiction.
Consider the case when and . If is stochastic, then the third and fifth lines show that . If , then the fourth line shows that for all . But for sufficiently large values of , this implies that , which is also a contradiction.
Consider the case when and . If is stochastic, then the third and fifth lines show that . If , then the fourth line shows that for all . This is again a contradiction.
Now suppose . Then the third and fifth lines are always [math], and the second line is always . So it suffices to see that stochasticity holds if and only if
[TABLE]
This happens precisely in the two cases listed.
â
Note that while this proposition does not imply that analytic continuation in the parameter is fruitless, it does seem to imply that analytic continuation needs to be done in both and simultaneously, as was done in [KMMO16].
3.5.1 The singleâspecies case
Now consider when . In this case, the stochastic vertex model matches that of [BorPet16],[CorPet16], described in Section 2.6.2.
Proposition 3.10**.**
When , then
[TABLE]
Proof.
First consider the case when . In the expression for , substitute to get
[TABLE]
When , there are only two possible outputs given any input. Since the columns sum to , it suffices to check that the formulas match when . Setting , the expressions from the first and second lines are respectively
[TABLE]
This matches (23).
Now consider when . By Theorem 3.4 and the uniqueness of analytic continuation,
[TABLE]
This is exactly (24). â
4 Intertwining of transfer matrices
4.1 Equivalent expression for duality function
Let us relate the gauge in section 2.2 and the ground state transformation in section 2.4, which allows us to rewrite the duality function. Here, the duality function will also act on the auxiliary space . Given , define
[TABLE]
and set In other words, acts as
[TABLE]
on the representation
[TABLE]
The subscript and the superscript will be dropped if it is clear from the context, but the + will always be retained.
Proposition 4.1**.**
(a) The ground state transformation is related to the gauge transform by
[TABLE]
where is a constant under particle conservation.
(b) For any ,
[TABLE]
where is a constant under particle conservation.
Proof.
(a) In order see the relationship between and , use the identity
[TABLE]
Therefore, recalling (12),
[TABLE]
which implies that . Above, the second and third equalities use the respective identities
[TABLE]
(b) By part (a),
[TABLE]
â
The next lemma concerning the function will be beneficial: from a probabilistic standpoint, a proper duality function should not act on the auxiliary space, and in certain cases the function can be reduced to .
Lemma 4.2**.**
[TABLE]
Proof.
To see that , note that by the explicit expression for in (14), adding lattice sites to which contain no particles multiplies by , due to the term, with all others equal to .
To see that , examine the âfactorial terms from (13). When , so that and all other , then for . Thus the only change is from , where is multiplied by . â
4.2 The oneâsite case
Start with the case .
Theorem 4.3**.**
As maps from to , and for any ,
[TABLE]
Proof.
The statement is equivalent to
[TABLE]
and then to
[TABLE]
as maps from to .
We have that (abbreviating to and to )
[TABLE]
This implies that
[TABLE]
Meanwhile,
[TABLE]
Recalling that we have
[TABLE]
and
[TABLE]
Finally, recall that (by (6)) and that by (3)
[TABLE]
This finishes the proof. â
4.3 Extension to sites
This section will extend the results of the previous section to lattice sites.
The definition of the transfer matrix will be slightly modified in order to state the theorem. The transfer matrix (with open boundary conditions and left jumps) can be written as a map defined by
[TABLE]
where each is the map acting on the tensor powers:
[TABLE]
At the same time, the space reversed transfer matrix (with right jumps) can be written as a map defined by
[TABLE]
If the dependence of on the spectral and spin parameters needs to be emphasized, it will be written
[TABLE]
and similarly for . See Figure 3 for a pictorial understanding of the transfer matrix.
We need a few more multiâsite identities.
Lemma 4.4**.**
For any
[TABLE]
Furthermore, if satisfies particle conservation, i.e.
[TABLE]
then
[TABLE]
and
[TABLE]
Proof.
Equation (34) is true by coâassociativity: if
[TABLE]
then
[TABLE]
so Theorem 4.3 applies with at the lattice sites.
For the first identity in (35), note that
[TABLE]
Since does not act on the third tensor power and is diagonal, then . By particle conservation, if is nonzero, then for , . This shows the identity. A similar argument applies for the other identities.
â
Theorem 4.5**.**
As maps from to , and for any ,
[TABLE]
Proof.
Recall that the operator is defined by
[TABLE]
It suffices to show that , for that would imply that
[TABLE]
Expand the gauge as
[TABLE]
and note that in this expansion of , the first three terms commute with any operator acting on the lattice sites. This means that the desired equality is equivalent to the equality
[TABLE]
Since satisfies particle conservation (7), as does the permutation operator , by (35) and (36), it then suffices to show that
[TABLE]
But this is exactly (34).
â
Remark 4.6**.**
Note that despite the notational similarities between Theorem 4.5 and the definition of duality, it is not technically accurate to describe this as a duality result. This is because the maps send to , rather than mapping a single vector space to itself. The theorem could have been stated as a map from to itself using an equivalent form of (3)
[TABLE]
and without modifying the transfer matrix, but then the duality function would not be the same on both sides of the equation, as it is in the definition of stochastic duality.
4.4 Interpretation as a particle system satisfying duality
Define the operators and on by
[TABLE]
where and the notation is used.
Theorem 4.7**.**
(a) For any and any
[TABLE]
(b) For the summation taken over , and fixing ,
[TABLE]
(c) Suppose that z,m_{x},w_{x},{\color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@gray@stroke{0}\pgfsys@color@gray@fill{0}L} depend on a parameter such that for ,
[TABLE]
as . Then in the limit ,
[TABLE]
and is a stochastic operator if every is stochastic.
Proof.
(a) By Theorem 4.5, for any
[TABLE]
This can be written as
[TABLE]
which is equivalent to the needed statement.
(b) Take in part (a). Divide both sides by and apply Lemma 4.2 to get the result.
(c) From the explicit expression (14), the terms and are uniformly bounded in . Therefore, with the assumptions here, the summation in (b) converges to [math]. This implies that .
If every is stochastic, then the transfer matrix is stochastic. Therefore the entries of are nonânegative. The columns sum to
[TABLE]
which converges to . An identical argument holds for . â
Statement (c) can be interpreted as saying that if almost surely no particles exit the lattice, then and define Markov chains which satisfy spaceâreversed duality with respect to . This will hold when the lattice is the infinite line , or when the lattice is finite with closed boundary conditions. One can think of and as defining particle systems with evolution to the left and right, respectively. Furthermore, for certain parameters of the transfer matrix, the ââ particles entering the lattice from the auxiliary space will not affect the evolution of the system. The next sections will elaborate on this.
Remark 4.8**.**
It is natural to ask if these duality results hold for open or periodic boundary conditions. For open boundary conditions, the conditions of Theorem 4.7(c) do not hold and Lemma 4.2 does not apply. For periodic boundary conditions, the operators need to be redefined, but doing so results in Lemma 4.2 being inapplicable. There are duality results for open or periodic boundary conditions (see [Ohku16] and [Sch16]), but it is not clear if it is possible to obtain similar results from the framework here.
4.4.1 On the infinite line
To define the transition matrix for the particle system, we restrict the state space to states with finitely many particles, in the sense if is a particle configuration written as for , then the set
[TABLE]
is finite. Let denote this state space. The particles of the configurations are contained in a finite lattice, and if empty lattice sites are added on both sides of this finite lattice, and an auxiliary space is also added, then the transfer matrices and can act on and .
In other words, for , define (with particle jumps to the left) by
[TABLE]
where the superscript indicates that (the total number of lattice sites on which acts) depends on . Similarly, define the space reversed version by
[TABLE]
See Figure 4 for an example.
Here, a lemma of the stochastic matrices will be needed.
Lemma 4.9**.**
(a) Suppose is stochastic. Then there exists a fixed such that for all ,
[TABLE]
In words, this means that for an input in the auxiliary space, the probability of no particles settling in at the lattice site is at most .
(b) For any , the following formulas for and also hold:
[TABLE]
(c) For ,
[TABLE]
Proof.
(a) Suppose this were not true. Then there must be a such that
[TABLE]
However, by Theorem 3.4 and (25), this cannot hold.
(b) By part (a), at each lattice site there is a probability of at most that no particles will settle at that lattice site. So if particles enter at the right boundary, the probability that no particle interacts with is asymptotically . Therefore,
[TABLE]
which converges to [math]. The same argument applies for .
(c) By a similar argument as in (b), the probability that a particle in makes its way to the left boundary is asymptotically .
â
Note that if Lemma 4.9(a) were not true, then there would be a positive probability that particles could exit the lattice at infinity, which would violate particle conservation.
Theorem 4.10**.**
The process satisfies spaceâreversed selfâduality with respect to , given explicitly by (14):
[TABLE]
In other words,
[TABLE]
Proof.
By Theorem 4.9(c), the conditions of Theorem 4.7 hold. This immediately implies the result. â
Remark 4.11**.**
Notice the duality function does not depend on the horizontal spin parameter . This is a similar phenomenon to that of [CGRS15]. In that framework, if one takes a âth degree polynomial in the Casimir element, the resulting process can have up to particles jumping at a time. However, the duality function does not depend on the choice of the central element, and therefore does not depend on .
4.4.2 Closed boundary conditions
The transfer matrices can be used to define a particle system on a lattice with closed boundary conditions satisfying spaceâreversed duality with respect to .
Assume here that . Consider the limit of
[TABLE]
as
[TABLE]
where the limits in the spectral parameters are taken first. Then define
[TABLE]
where the limit as taken as in the one above. This results in and as operators on the space
[TABLE]
Proposition 4.12**.**
The operators and are stochastic and satisfy
[TABLE]
Proof.
By Theorem 3.2(c), the conditions of Theorem 4.7 hold. This implies the proposition. â
The stochastic operators and can be interpreted as the transition matrices of an interacting particle system with closed boundary conditions. To see this, notice by Theorem 3.2(c), with probability , the particles entering the lattice along the auxiliary space all settle in at the endpoints, and do not interact with the other particles. See Figure 5 for an example. Therefore, and can be viewed as stochastic operators on
[TABLE]
One way of thinking about this is that they only act on particle configurations on the lattice . Since particles do not exit this lattice, and can be seen as transition matrices of an interacting particle system on the lattice with closed boundary conditions.
By applying (15) to (14), the duality functional can be written as
[TABLE]
Note that because and are the particle configurations with no particles, the duality simplifies to
[TABLE]
Again, does not depend on the particle configurations at the lattice sites and , so can also be viewed as a duality functional on the particle configurations on the lattice .
Remark 4.13**.**
For a totally asymmetric process, it is necessary to take at the endpoints in order for this sort of duality to hold. To see this, suppose evolves to the left, with initial condition consisting of one particle at the lattice site . Suppose evolves to the right, with initial condition consisting of particles contained in . If evolves with fixed, then eventually has one particle at lattice site , so all particles in will be counted. If evolves with fixed, then in order for all particles to be counted, they must all occupy site . This is only possible if an arbitrary number of particles can occupy lattice site .
4.4.3 Continuousâtime zero range process
In the limit, the stochastic matrix can be used to define a continuousâtime zero range process, either on the infinite lattice or on a finite lattice with closed boundary conditions. This definition is different than the degeneration in the âHahn Boson process. In that case, it would not have been a priori obvious that after the degeneration, the offâdiagonal entries would be nonânegative. On the other hand, with the construction here, nonânegativity will always hold.
In the definition of , suppose that some is fixed and all other values are taken to infinity. Furthermore, take the limit of all . That is, define
[TABLE]
and set
[TABLE]
Similarly, define
[TABLE]
and set
[TABLE]
By Theorem 3.2(c), each and can be viewed as a local stochastic operator, in which only particles from lattice site can jump, and all other particles cannot jump.
The operators and are maps
[TABLE]
Then define
[TABLE]
Proposition 4.14**.**
The operators and are stochastic on and satisfy
[TABLE]
If denotes the identity matrix, then
[TABLE]
Proof.
This follows immediately from Proposition 4.12. â
Because and are stochastic, the operators and satisfy the property that the offâdiagonal entries are nonânegative and the columns sum to [math]. Therefore, they are generators for a continuousâtime process on particle configurations on the lattice . Because they can be written as a sum of local generators, the process is a zeroârange process. Theorem 3.2(b) establishes that if in the definition of , the process is nontrivial. Indeed, it will be seen below that for , the process is the multi-species âBoson process of [Take15].
Remark 4.15**.**
The use of subtracting the identity matrix to obtain a continuousâtime process with duality from a discreteâtime process with duality is not new: see e.g. section 5.2 of [Sch97].
Remark 4.16**.**
A continuousâtime zeroârange process must allow an arbitrary number of particles to occupy a lattice site. Indeed, the jump rates for a particle jump from lattice site to cannot depend on the occupancy at the site , which implies that there can not be a constraint on the number of particles allowed to occupy site .
5 Descriptions of processes
This section describes the processes that can be defined from the stochastic vertex model. See Figure 2.
5.1 At
At , the operator acting on is meromorphic in and . Then Theorem 4.10 can be viewed as an identity holding on {\color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@gray@stroke{0}\pgfsys@color@gray@fill{0}W}\subset\left(\mathbb{Z}_{\geq 0}^{n}\right)^{\otimes\infty} which depends on the parameters . In particular, both sides of the equation are also meromorphic functions in the complex variables . Since the equality holds for all , it holds on the set , which as [math] as a limit point. Therefore, the equality holds for all values of and .
Theorem 5.1**.**
The âspecies discreteâtime âHahn Boson process satisfies spaceâreversed selfâduality with respect to the function in (14), given explicitly by
[TABLE]
where is defined by . Here, evolves to the left and evolves to the right.
This theorem implies dualities for two degenerations:
Corollary 5.2**.**
The âspecies continuousâtime âHahn Boson process satisfies spaceâreversed selfâduality with respect to .
Proof.
Observe that the duality does not depend on and only on . Therefore if we take Theorem 5.1 and differentiate with respect to , then
[TABLE]
â
The next corollary was previously shown in Theorem 2.5(b) of [Kuan16].
Corollary 5.3**.**
The âspecies âTAZRP of [Take15] is dual to its spaceâreversed version with respect to the duality function defined by
[TABLE]
Here, the process evolves to the left and the process evolves to the right.
Proof.
One proof would involve taking , but this requires knowledge of the asymptotics of the âGamma function at . Instead, assume that and now suppose that all , which means that The asymptotic analysis was essentially already done in the proof of Proposition 5.2(b), with the only exception being
[TABLE]
reflecting that . This results in duality with respect to the function
[TABLE]
Since the process is translation invariant in the limit when all , this proves the corollary for . By analytic continuation, it also holds for .
â
5.2
Recall from section 3.1.1 that when ,
[TABLE]
This section will consider the various processes that can be defined from when .
5.2.1 Discreteâtime process with blocking
The stochastic operator from Section 4.4 defines a discreteâtime interacting particle system in which at most particles of different species can occupy a site. The update is defined sequentially, and at most one particle can jump from a site. To understand the dynamics, first consider the degenerate cases when or .
When , corresponding to , the limit is
[TABLE]
This is stochastic for . In this case, the ordering of the species of particles is more apparent, and there is a verbal description of the model, which is similar to the verbal description of the multiâspecies in [Kuan16]. Particles have a desire to jump in the direction of movement (left for and right for ). Particles with smaller indices are considered to have higher mass (or higher class, or higher priority) than particles with larger indices. The species particles are considered to be holes. For example, a particle configuration at a site indexed by has three particles of the heaviest mass and one hole. If a particle of species enters a lattice site, then no particle of species can exit, because those have smaller mass. However, the particles of species have higher mass, so their inclination to jump is higher than the species particle. The species particle asks each higher mass particle if it would like to jump, starting from species . Each particle says ânoâ with probability and says âyesâ with probability . If the particle says ânoâ then the species particle proceeds to ask the next particle. If the particle says âyesâ, then the particle blocks the jump of the species particle and jumps itself instead. If the species particle receives an answer of ânoâ from all particles of species , then it is finally allowed to jump. See Figure 6 for an example.
Notice that a species particle entering a lattice site also exits that lattice with probability one. If the lattice is infinite, then infinitely many of the lattice sites must satisfy , or else Lemma 4.9(a) will not hold, since there is a positive probability that a particle could jump forever in one direction.
Also notice that does not depend on , as shown in Theorem 3.2(b), so it is sensible to take the limit at every lattice site. The description of the dynamics is the same, but arbitrarily many particles may occupy each lattice site.
In the limit, then
[TABLE]
This is stochastic for , and is in fact the same dynamics as the situation, but with the ordering of the species reversed. The two cases and can be thought of as cases of strong blocking, due to lower mass particles being completely forbidden to jump, as shown in Theorem 3.2(a). The values of in are then an interpolation between the two extreme cases. The most âintermediateâ value in is at , when the jump rates out of the lattice site are independent of the input. This is the case in which parallel jumps are possible, so can be viewed as no blocking.
5.2.2 Continuousâtime zeroârange process
By the general framework in section 4.4.3, defines a continuousâtime zeroârange process. As explained in Remark 4.16, in order to define a continuousâtime zeroârange process, all values of need to be taken to infinity, and for and ,
[TABLE]
And for , the limit is no longer stochastic. The nontrivial case only occurs when before the limit , and in this case the jump rates are precisely the jump rates for the multiâspecies âBoson process of [Take15]; see the first item of Remark 3.1. Therefore, this provides another proof of Theorem 2.5(b) of [Kuan16], which was already given another proof in Corollary 5.3.
5.3
By section 3.1.2, the entries of when are
[TABLE]
Consider the same degenerations as in the case of the previous section. In the limit ,
[TABLE]
When , then
[TABLE]
5.4 Conjecture for general
For generic values of and , we know that a wellâdefined process exists in both discrete and continuousâtime, and that duality holds on both the infinite line and for closed boundary conditions. Each lattice site can hold up to particles, and up to particles may jump at a time. Furthermore, for and , the strong blocking phenomenon occurs again, due to Theorem 3.2(a). At , parallel updates occur, as shown in [KMMO16].
Due to the degeneration of multiâspecies to the multiâspecies âBoson shown in [Kuan16], it is not unreasonable to conjecture that a generalization must hold for all values of . Namely, for each , there should exist a central element of such that the framework of [CGRS15] produces a continuousâtime asymmetric exclusion process in which up to particles may occupy a site and up to particles may jump simultaneously. In the limit , the process should degenerate to the same totally asymmetric continuousâtime zero range process produced by Section 4.4.3. Duality results should hold for both the asymmetric exclusion process and the totally asymmetric zero range process.
6 âDirectâ results for multiâspecies âHahn Boson
Theorem 5.1 shows that the multiâspecies âHahn Boson process satisfies spaceâreversed selfâduality with respect to . Taking the limit degenerates the multiâspecies âHahn Boson process to the multiâspecies âBoson process, and shows that the latter process satisfies spaceâreversed selfâduality with respect to .
It turns out that the multiâspecies âHahn Boson process is also dual with respect to , even before taking the degenerations in the process. This statement will be proved in this section through direct means, as it is unclear how to prove it using algebraic machinery. First, start with some identities.
6.1 Identities
Given , recall the notation that , write to mean for , and that
[TABLE]
Lemma 6.1**.**
The following identities hold:
[TABLE]
Proof.
The first identity is not new (see e.g. 10.0.3 of [AnAsRo]), but can be easily seen to follow from
[TABLE]
The second identity follows by an induction argument on . By the induction hypothesis and the first identity,
[TABLE]
Replacing with in the first summation, the two sums combine into
[TABLE]
where the last equality used the first identity again.
For the third identity, proceed by induction on . The base case is the second identity. For general ,
[TABLE]
For each in the summand,
[TABLE]
Therefore, the summand becomes
[TABLE]
Evaluating the sum over yields
[TABLE]
Then setting and and , substitute the equalities
[TABLE]
to obtain
[TABLE]
The summation can be written as being over such that , showing that
[TABLE]
Since and , applying the induction hypothesis completes the proof.
â
This next identity was previously shown in [Cor15] and again in [Bar14], which pertains to the case of .
Lemma 6.2**.**
Fix and , . Then for all
[TABLE]
In particular, setting shows that
[TABLE]
As an immediate corollary,
Corollary 6.3**.**
Fix and . Then for all
[TABLE]
Setting shows that
[TABLE]
Here is a multiâspecies generalization:
Proposition 6.4**.**
(1) Fix and . Then
[TABLE]
(2) Fix and Then
[TABLE]
Proof.
(1) Plugging in the expression for , the necessary identity is
[TABLE]
Now split the sum into . The leftâhandâside is
[TABLE]
By the third identity in Lemma 6.1,
[TABLE]
Therefore, after applying an identical argument to the rightâhandâside, it remains to show
[TABLE]
This follows immediately from Proposition 6.2, finishing the proof.
(2) Because the term in parentheses is equal to zero when , the condition that can be removed. Now split the sum into . The leftâhandâside is
[TABLE]
By the third identity in Lemma 6.1,
[TABLE]
Therefore, after applying an identical argument to the rightâhandâside, it remains to show
[TABLE]
This follows immediately from Corollary 6.3, finishing the proof. â
6.2 The Duality Result
Proposition 6.5**.**
The âspecies âHahn Boson process (in both discrete and continuous time) satisfies spaceâreversed selfâduality with respect to the function
[TABLE]
where evolves with total asymmetry to the left and evolves with total asymmetry to the right.
Proof.
The duality function can be written equivalently as
[TABLE]
Write the duality function as
[TABLE]
Since the process is a zero range process, the generator of the continuousâtime dynamics with evolution to the left can be written as a sum of local generators:
[TABLE]
where is the contribution when particles jump out of lattice site . Similarly the generator of the dynamics with evolution to the right can be written as
[TABLE]
Since involves counting the number of particles in at sites to the left of (inclusive),
[TABLE]
Furthermore, if , then for some . Similarly, if , then . In these cases,
[TABLE]
These two statements imply the two equalities
[TABLE]
and
[TABLE]
Therefore, since , it suffices to show
[TABLE]
Since , the equality that needs to be shown is
[TABLE]
But this is just Proposition 6.4, finishing the proof.
Now turn to the discreteâtime âHahn Boson process. If the evolution is to the right, then the transition probabilities are
[TABLE]
where
[TABLE]
where by convention . (If then the boundary conditions are periodic instead of closed). If the evolution is to the left, then the transition probabilities are
[TABLE]
where
[TABLE]
and by convention .
Letting be the set of particle configurations at one lattice site and be the âfold Cartesian product, we have
[TABLE]
Now, for each ,
[TABLE]
so therefore
[TABLE]
Since , the product can be reâindexed to show that
[TABLE]
By similar reasoning, for the evolution to the right,
[TABLE]
Again, for each ,
[TABLE]
so therefore
[TABLE]
Since here , the product can be reâindexed to show that
[TABLE]
where the second equality follows from substituting and the identity
[TABLE]
Therefore, it suffices to show that
[TABLE]
But this is just Proposition 6.4. â
6.3 Lumpability
In [Kuan16], it is shown that the âspecies has the property that the projection onto the first species is again a âspecies process. Here we briefly show the same for the âspecies âHahn Boson process.
Given , define the projection for by
[TABLE]
Notice that
[TABLE]
Proposition 6.6**.**
For any and any ,
[TABLE]
In particular, the projection of the âspecies âHahn Boson process to the first âspecies is again a âspecies âHahn Boson process.
Proof.
Since , the proposition does not depend on the expression for , as long as it only depends on and . Therefore, it suffices to show that (setting )
[TABLE]
By (38), it suffices to consider . In this case,
[TABLE]
so that
[TABLE]
Therefore, it suffices to show
[TABLE]
which is true by Lemma 6.1. â
Appendix A Explicit examples
A.1 Fusion for
For and , the âmatrix is given by (10):
[TABLE]
with respect to the basis . From this,
[TABLE]
It is straightforward to check that , so is a projection. Other interesting cases are that is the usual permutation matrix, and for , is the identity matrix.
Take and in the expression (2.5) for fusion. The symmetric projection is where is the identity matrix and is the matrix from above. The other terms are
[TABLE]
and
[TABLE]
Multiplying the matrices yields
[TABLE]
Note that this is singular at but not at . One can check that
[TABLE]
as predicted by (22).
The above matrix is consistent with (9) at . For instance,
[TABLE]
Since
[TABLE]
then the matrix applied to equals
[TABLE]
Note that one can also check that
[TABLE]
has rank at , and that the resulting matrix satisfies
[TABLE]
A.2 for
For and the action of is given by (replacing )
[TABLE]
where with is denoted by . Now since
[TABLE]
then the action of is
[TABLE]
Up to , with , these are the same weights as in Appendix B.2 of [CorPet16].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[An As Ro] G. E. Andrews, R. Askey, and R. Roy, Special Functions , vol. 71, Cambridge University Press, 2001.
- 2[Bar 14] G. Barraquand, A short proof of a symmetry identity for the qâHahn distribution , Electron. Commun. Probab. 19 (2014), no. 50, 1â3. DOI:10.1214/ECP.v 19-3674 · doi â
- 3[Bar Cor 16] G. Barraquand, I. Corwin, The qâHahn asymmetric exclusion process , Ann. Appl. Probab, Vol. 26, No. 4 (2016), 2304â2356.
- 4[Bel Sch 15] V. Belitsky, G.M. SchĂŒtz, Self-Duality for the Two-Component Asymmetric Simple Exclusion Process , J. Math. Phys., 56, 083302 (2015), DOI: 10.1063/1.4929663 · doi â
- 5[Bel Sch 15-2] V. Belitsky, G.M. SchĂŒtz, Quantum algebra symmetry and reversible measures for the ASEP with second-class particles , J. Stat. Phys., November 2015, Volume 161, Issue 4, pp 821â842, DOI: 10.1007/s 10955-015-1363-1 · doi â
- 6[Bel Sch 16] V. Belitsky, G.M. SchĂŒtz, Self-duality and shock dynamics in the n đ n -component priority ASEP , ar Xiv:1606.04587 v 1
- 7[Bor Cor 13] A. Borodin, I. Corwin, Discrete time qâTASE Ps . Int. Math. Res. Not. (rnt 206), 05 2013. DOI:10.1093/imrn/rnt 206 · doi â
- 8[Bor Cor Gor 16] A. Borodin, I. Corwin, V. Gorin, Stochastic six-vertex model , Duke Math. J. 165, no. 3 (2016), 563â624. DOI:10.1215/00127094-3166843 · doi â
