Introduction
Overview
The asymmetric simple exclusion process (ASEP) is a basic model of nonequilibrium transport, and at the same time one of the principal exactly solvable interacting particle systems. Particles attempt to exchange positions with neighboring holes at unequal rates in the two directions. The asymmetry creates a nonzero stationary current and, on large scales, connects exclusion dynamics to the theory of hyperbolic conservation laws and to the Kardar-Parisi-Zhang (KPZ) universality class. On the infinite integer line, the single-species ASEP has simple translation-invariant Bernoulli stationary measures; introducing an open boundary, however, leads to substantially richer stationary laws. In particular, exact phase diagrams, density profiles, and correlation functions of the open ASEP can be accessed by the matrix-product ansatz [74 ] and its subsequent refinements. We refer to [91 , 83 , 84 , 76 , 59 , 92 , 66 , 65 , 58 , 93 ] for a non-exhaustive list of key works on single-species ASEP stationary measures.
In a multispecies exclusion process, every site carries one of several particle colors or a hole, and neighboring colors exchange according to a fixed priority order. Merging the higher-priority colors produces an ordinary one-species ASEP, but the collection of these projections does not determine the correlations of the full colored stationary measure. Already with two species, the stationary distributions exhibit nontrivial clustering and microscopic shock structure [75 , 77 , 52 ] . On the infinite integer line, stationary measures for arbitrary numbers of species in the totally asymmetric case were constructed using multiline diagrams and queues [78 ] . The partially asymmetric case was treated using a matrix-product representation [88 ] and a queueing formulation [86 ] ; see also the semi-infinite single-species matrix-product approach in [89 ] .
On the integer line, queueing constructions are especially useful for explicit computations with stationary distributions. They have led, for instance, to beautiful formulas for the TASEP speed process and multispecies correlations [51 , 53 , 54 ] . Almost-sure existence of the full-line ASEP speed process was proved in [48 ] ; related half-line second-class particle asymptotics have been studied in [69 ] . More recently, such constructions were interpreted in the language of colored stochastic vertex models [50 ] , with the Yang-Baxter equation playing a central role. Relevant developments in stochastic higher-spin and colored vertex models include [70 , 61 , 63 , 60 , 68 ] .
A boundary changes the stationary measures of multispecies ASEP in an essential way. Nevertheless, the vertex-model connection suggests a possibility of a half-line vertex model construction: at an integrable boundary the Yang-Baxter equation is supplemented by the reflection equation [90 ] . Related half-space integrable models and half-line ASEP have been studied in [56 , 81 , 82 , 57 ] . Integrable boundary weights and half-space six-vertex constructions appear in [85 , 79 ] ; see also the recent half-space TASEP transition formulas [73 ] and work on stationary measures for six-vertex models on a strip [94 ] .
The present paper provides such a vertex construction. We study the positive half-line ASEP, with particles of the strongest color injected at an arbitrary rate at the left endpoint. Our first main result, Theorem 1.2 , is a vertex-model construction of stationary measures for the multispecies process. Our second main result, Theorem 1.4 , gives an explicit calculation of the joint occupation distribution at the first two sites of the half-line; obtaining this formula was our original motivation. As explained below, this distribution is also related to the joint distribution of speeds in the half-space ASEP speed process, conditional on plausible conjectures that we do not prove here.
It should be noted that we study only a special case of multispecies ASEP on the half-line. Our boundary update is totally asymmetric, and only first-class particles can be injected. There are two reasons for the restriction. First, it is this version of ASEP, with the injection of first-class particles only, that appears in the description of speeds in the half-space ASEP speed process. This makes this part of the restriction more natural. Second, while it is plausible that the general strategy for constructing stationary measures works for a wider class of boundary interactions, the technical details become more complicated, and we prefer to avoid them.
During our work on this project, we learned of independent related work in progress [49 ] .
Let us present the results in more detail.
The stationary measure construction
First, let us define in more detail the version of the multispecies ASEP studied in this paper. Fix the number of species r ∈ Z ≥ 1 r\in\mathbb Z_{\ge1} r ∈ Z ≥ 1 . The state space is { 0 , 1 , … , r } Z ≥ 1 \{0,1,\ldots,r\}^{\mathbb Z_{\ge 1}} { 0 , 1 , … , r } Z ≥ 1 , and the priority order is 1 ≻ 2 ≻ ⋯ ≻ r ≻ 0 1\succ2\succ\cdots\succ r\succ0 1 ≻ 2 ≻ ⋯ ≻ r ≻ 0 ; color 0 0 0 is a hole. A stronger color (we use the words species, color, type and class interchangeably) exchanges with a weaker color to its right at rate 1 1 1 and to its left at rate q ∈ [ 0 , 1 ) q\in[0,1) q ∈ [ 0 , 1 ) . At site 1 1 1 , every color other than 1 1 1 is replaced by 1 1 1 at rate ( 1 − q ) α (1-q)\alpha ( 1 − q ) α , where α > 0 \alpha>0 α > 0 .
Fix density parameters ρ 1 , … , ρ r \rho_1,\ldots,\rho_r ρ 1 , … , ρ r such that
0 < ρ 1 < ⋯ < ρ r < 1 , ρ 1 > max ( 1 / 2 , 1 − α ) . \begin{equation}
0<\rho_1<\cdots<\rho_r<1,\qquad \rho_1>\max(1/2,1-\alpha). \tag*{(1.1)}
\end{equation} 0 < ρ 1 < ⋯ < ρ r < 1 , ρ 1 > max ( 1/2 , 1 − α ) . (1.1)
Our goal is to construct a stationary measure μ α , ρ 1 , … , ρ r \mu^{\alpha,\rho_1,\ldots,\rho_r} μ α , ρ 1 , … , ρ r of ASEP, which has asymptotic density ρ 1 \rho_1 ρ 1 of first-class (or color 1) particles, asymptotic density ρ 2 \rho_2 ρ 2 of color 1 and color 2 particles, ..., asymptotic density ρ r \rho_r ρ r of colors from 1 1 1 to r r r particles. Consequently, the density of holes (color 0) is 1 − ρ r 1-\rho_r 1 − ρ r .
In short, this stationary measure can be read off from the right-hand side of Figure 4 below, in which we apply to trivial input from the left and from below a collection of stochastic vertices (also, the limit ”height to infinity” of this picture has to be taken in order to get half-space), which produces a probability measure on the right. Let us define all necessary ingredients.
We construct a stationary measure from three types of stochastic vertices. To distinguish various components of these vertices more easily, we introduce the following terminology. A physical edge carries a single color (it corresponds eventually to the space of ASEP). A carrier edge contains infinitely many colors and records the numbers of arrows of the relevant colors. It corresponds to queues. Write C m = { 0 , 1 , … , m } \mathcal C_m=\{0,1,\ldots,m\} C m = { 0 , 1 , … , m } for 0 ≤ m ≤ r 0\le m\le r 0 ≤ m ≤ r , and set x = max { 0 , 1 − α − 1 } x=\max\{0,1-\alpha^{-1}\} x = max { 0 , 1 − α − 1 } .
Usual vertices.
Fix 1 ≤ m ≤ r 1\le m\le r 1 ≤ m ≤ r . The usual vertex W ( m ) ( G , i ; G ′ , j ) \mathbb W^{(m)}(G,i;G',j) W ( m ) ( G , i ; G ′ , j ) has incoming carrier G G G and physical color i ∈ C m − 1 i\in\mathcal C_{m-1} i ∈ C m − 1 , and outgoing carrier G ′ G' G ′ and color j ∈ C m j\in\mathcal C_m j ∈ C m . Its carrier states have the form
G = ( G 1 , … , G m − 1 , ∞ ) , G 1 , … , G m − 1 ∈ Z ≥ 0 . G=(G_1,\ldots,G_{m-1},\infty),\qquad
G_1,\ldots,G_{m-1}\in\mathbb Z_{\ge0}. G = ( G 1 , … , G m − 1 , ∞ ) , G 1 , … , G m − 1 ∈ Z ≥ 0 .
The last coordinate represents an unlimited amount of color m m m . Adding or subtracting E m E_m E m does not change this coordinate. Here E k E_k E k is the standard basis vector in coordinate k k k , and G [ 1 , k − 1 ] = ∑ a = 1 k − 1 G a G_{[1,k-1]}=\sum_{a=1}^{k-1}G_a G [ 1 , k − 1 ] = ∑ a = 1 k − 1 G a . The nonzero weights are displayed in Figure 1 . The carrier is read from bottom to top and the physical color from left to right.
Figure 1. The usual vertex W ( m ) \mathbb W^{(m)} W ( m ) . The carrier edge is read from bottom to top and the physical edge from left to right. Thick gray edges carry carrier states and thin gray edges carry physical colors. We have 1 ≤ k < ℓ ≤ m 1\le k<\ell\le m 1 ≤ k < ℓ ≤ m .
Return vertices.
The return vertex L ^ v e r ( i , H ; j , H ′ ) \widehat L^{\mathrm{ver}}(i,H;j,H') L ver ( i , H ; j , H ′ ) has incoming physical color i i i and carrier H H H , and outgoing color j j j and carrier H ′ H' H ′ , with i , j ∈ C m i,j\in\mathcal C_m i , j ∈ C m . The carrier edge should be viewed as almost entirely filled with color 1 1 1 , with finitely many ”defects” of colors 0 , 2 , … , m 0,2,\ldots,m 0 , 2 , … , m . It is indexed via
C ^ m = C m ∖ { 1 } , H = ( H 0 , H 2 , … , H m ) ∈ Z ≥ 0 C ^ m . \widehat{\mathcal C}_m=\mathcal C_m\setminus\{1\},\qquad
H=(H_0,H_2,\ldots,H_m)
\in\mathbb Z_{\ge0}^{\widehat{\mathcal C}_m}. C m = C m ∖ { 1 } , H = ( H 0 , H 2 , … , H m ) ∈ Z ≥ 0 C m .
Color 1 1 1 is the implicit background and is not recorded in H H H ; a physical input 1 1 1 therefore adds no carrier occupation. Write ∣ H ∣ = H 0 + ∑ a = 2 m H a |H|=H_0+\sum_{a=2}^m H_a ∣ H ∣ = H 0 + ∑ a = 2 m H a , and let E ^ k \widehat E_k E k denote the standard basis vector in coordinate k ∈ C ^ m k\in\widehat{\mathcal C}_m k ∈ C m . Figure 2 gives all nonzero weights. The vertex weights satisfy H ′ = H + E ^ i − E ^ j H'=H+\widehat E_i-\widehat E_j H ′ = H + E i − E j , where E ^ 1 = 0 \widehat E_1=0 E 1 = 0 . The physical color is read from left to right, as before, but the return carrier is read from top to bottom. For example, in the bottom-right configuration, the carrier coming from the top receives color ℓ \ell ℓ from the left and releases color k k k to the right.
Both usual and return vertices have a useful queue-type description, see Proposition 4.11 below.
Figure 2. The return vertex L ^ v e r \widehat L^{\mathrm{ver}} L ver . The carrier edge is read from top to bottom and the physical edge from left to right. Thick salmon edges carry carrier states and thin gray edges carry physical colors. Here k , ℓ ∈ { 0 , 2 , … , m } k,\ell\in\{0,2,\ldots,m\} k , ℓ ∈ { 0 , 2 , … , m } and k ≺ ℓ k \prec \ell k ≺ ℓ .
Boundary vertices.
The boundary vertex K ( m ) ( G ; H ) \mathbb K^{(m)}(G;H) K ( m ) ( G ; H ) joins the carrier of a usual vertex to the carrier of a return vertex. It discards G G G and samples H H H independently of the incoming state. For 0 < α ≤ 1 0<\alpha\le1 0 < α ≤ 1 , put
b α , ρ m = ( 1 − α ) ( 1 − ρ m ) α ρ m . b_{\alpha,\rho_m}
=\frac{(1-\alpha)(1-\rho_m)}{\alpha\rho_m}. b α , ρ m = α ρ m ( 1 − α ) ( 1 − ρ m ) .
Condition (1.1) ensures 0 ≤ b α , ρ m < 1 0\le b_{\alpha,\rho_m}<1 0 ≤ b α , ρ m < 1 . The output is
H = ( H 0 , 0 , … , 0 ) , P ( H 0 = h ) = p b α , ρ m ( q ) ( h ) = ( b α , ρ m ; q ) ∞ b α , ρ m h ( q ; q ) h , h ∈ Z ≥ 0 , \begin{equation}
H=(H_0,0,\ldots,0),\qquad
\mathbb P(H_0=h)=p_{b_{\alpha,\rho_m}}^{(q)}(h)
=(b_{\alpha,\rho_m};q)_\infty
\frac{b_{\alpha,\rho_m}^{\,h}}{(q;q)_h},
\quad h\in\mathbb Z_{\ge0}, \tag*{(1.2)}
\end{equation} H = ( H 0 , 0 , … , 0 ) , P ( H 0 = h ) = p b α , ρ m ( q ) ( h ) = ( b α , ρ m ; q ) ∞ ( q ; q ) h b α , ρ m h , h ∈ Z ≥ 0 , (1.2)
where we use standard q-Pochhammer notation:
( u ; q ) h = ∏ j = 0 h − 1 ( 1 − u q j ) , ( u ; q ) ∞ = ∏ j = 0 ∞ ( 1 − u q j ) . (u;q)_h=\prod_{j=0}^{h-1}(1-uq^j),\qquad
(u;q)_\infty=\prod_{j=0}^\infty(1-uq^j). ( u ; q ) h = j = 0 ∏ h − 1 ( 1 − u q j ) , ( u ; q ) ∞ = j = 0 ∏ ∞ ( 1 − u q j ) .
For α ≥ 1 \alpha \ge 1 α ≥ 1 , the output is deterministically the zero state. The two cases are summarized in Figure 3 .
\begin{equation}
\vcenter{\hbox{%
\begin{tikzpicture}[x=.8cm,y=.8cm,
every node/.style={font=\small,inner sep=1pt}]
\draw[paper normal,line width=2.4pt]
(-.8,0)--(-.8,.55)--(0,1.15);
\draw[paper hole,line width=2.4pt]
(0,1.15)--(.8,.55)--(.8,0);
\node[paper boundary] at (0,1.15) {};
\node[above=4pt] at (0,1.15) {$\mathbb K^{(m)}$};
\node[below=3pt] at (-.8,0) {$G$};
\node[below=3pt,text=holecolor] at (.8,0) {$H$};
\end{tikzpicture}}}
\qquad
\mathbb K^{(m)}(G;H)
=\mathbf1_{\{H_2=\cdots=H_m=0\}}
\begin{cases}
p_{b_{\alpha,\rho_m}}^{(q)}(H_0),&0<\alpha\le1,\\[1mm]
\mathbf1_{\{H_0=0\}},&\alpha>1.
\end{cases} \tag*{(1.3)}
\end{equation}
Figure 3. The boundary vertex K ( m ) \mathbb K^{(m)} K ( m ) . The carrier G G G enters along the gray edge and the return carrier H H H leaves along the salmon edge. The output law does not depend on G G G ; for α ≥ 1 \alpha\ge1 α ≥ 1 it is concentrated on the zero state.
Engines.
An engine combines the three types of vertices into a reflected double row (this type of objects was used previously in [90 ] and, especially, [79 ] , [73 ] ): a passage through usual vertices towards the boundary, one boundary vertex, and a passage through return vertices away from the boundary. We first define this construction on finitely many sites.
Definition 1.1. Fix N ≥ 1 N\ge1 N ≥ 1 and assume (1.1) . For 1 ≤ m ≤ r 1\le m\le r 1 ≤ m ≤ r , set G m = Z ≥ 0 m − 1 × { ∞ } , H m = Z ≥ 0 C ^ m , 0 ( m ) = ( 0 , … , 0 , ∞ ) . \mathcal G_m=\mathbb Z_{\ge0}^{m-1}\times\{\infty\},\qquad
\mathcal H_m=\mathbb Z_{\ge0}^{\widehat{\mathcal C}_m},\qquad
\mathbf0^{(m)}=(0,\ldots,0,\infty). G m = Z ≥ 0 m − 1 × { ∞ } , H m = Z ≥ 0 C m , 0 ( m ) = ( 0 , … , 0 , ∞ ) . In the following sum, v ∈ C m N \boldsymbol v\in\mathcal C_m^N v ∈ C m N , G = ( G ( 0 ) , … , G ( N − 1 ) ) ∈ G m N \boldsymbol G=(G^{(0)},\ldots,G^{(N-1)})\in\mathcal G_m^N G = ( G ( 0 ) , … , G ( N − 1 ) ) ∈ G m N , H = ( H ( 0 ) , … , H ( N ) ) ∈ H m N + 1 \boldsymbol H=(H^{(0)},\ldots,H^{(N)})\in\mathcal H_m^{N+1} H = ( H ( 0 ) , … , H ( N ) ) ∈ H m N + 1 , and G ( N ) = 0 ( m ) G^{(N)}=\mathbf0^{(m)} G ( N ) = 0 ( m ) . The m m m -th engine is the Markov kernel E N , m : C m − 1 N × C m N → [ 0 , 1 ] \mathfrak E^{N,m}:\mathcal C_{m-1}^N\times\mathcal C_m^N\to[0,1] E N , m : C m − 1 N × C m N → [ 0 , 1 ] defined by E N , m ( η , ξ ) = ∑ v , G , H K ( m ) ( G ( 0 ) ; H ( 0 ) ) ∏ i = 1 N W ( m ) ( G ( i ) , η i ; G ( i − 1 ) , v i ) L ^ v e r ( v i , H ( i − 1 ) ; ξ i , H ( i ) ) . \mathfrak E^{N,m}(\boldsymbol\eta,\boldsymbol\xi)=\sum_{\boldsymbol v,\boldsymbol G,\boldsymbol H}
\mathbb K^{(m)}(G^{(0)};H^{(0)})\notag\prod_{i=1}^N
\mathbb W^{(m)}(G^{(i)},\eta_i;G^{(i-1)},v_i)
\widehat L^{\mathrm{ver}}(v_i,H^{(i-1)};\xi_i,H^{(i)}). E N , m ( η , ξ ) = ∑ v , G , H K ( m ) ( G ( 0 ) ; H ( 0 ) ) ∏ i = 1 N W ( m ) ( G ( i ) , η i ; G ( i − 1 ) , v i ) L ver ( v i , H ( i − 1 ) ; ξ i , H ( i ) ) . Thus the usual carrier runs through sites N , … , 1 N,\ldots,1 N , … , 1 , and the return carrier through sites 1 , … , N 1,\ldots,N 1 , … , N . The kernel acts on measures by ( ν E N , m ) ( ξ ) = ∑ η ν ( η ) E N , m ( η , ξ ) (\nu\mathfrak E^{N,m})(\boldsymbol\xi)
=\sum_{\boldsymbol\eta}\nu(\boldsymbol\eta)
\mathfrak E^{N,m}(\boldsymbol\eta,\boldsymbol\xi) ( ν E N , m ) ( ξ ) = ∑ η ν ( η ) E N , m ( η , ξ ) . The engine output law is μ e n g N = δ 0 N E N , 1 E N , 2 ⋯ E N , r , 0 N = ( 0 , … , 0 ) .
\mu^N_{\mathrm{eng}}
=\delta_{\boldsymbol0_N}
\mathfrak E^{N,1}\mathfrak E^{N,2}\cdots\mathfrak E^{N,r},
\qquad \boldsymbol0_N=(0,\ldots,0).
μ eng N = δ 0 N E N , 1 E N , 2 ⋯ E N , r , 0 N = ( 0 , … , 0 ) . A graphical illustration of this procedure is shown in Figure 4 .
Figure 4. Engine construction of the stationary measure for the multi-species half-line ASEP. Engines 1 , … , r 1,\ldots,r 1 , … , r act successively from left to right, starting from empty input at the left boundary. For the middle engine m m m , η i \eta_i η i , v i v_i v i , and ξ i \xi_i ξ i denote the local input, intermediate color, and local output. The gray carrier reads sites N , … , 1 N,\ldots,1 N , … , 1 , evolving from G ( N ) G^{(N)} G ( N ) to G ( 0 ) G^{(0)} G ( 0 ) . The boundary vertex K ( m ) \mathbb K^{(m)} K ( m ) samples H ( 0 ) H^{(0)} H ( 0 ) , and the salmon return carrier reads sites 1 , … , N 1,\ldots,N 1 , … , N . The stationary law is obtained by taking the local limit of μ e n g \mu_{\mathrm{eng}} μ eng as N → ∞ N\to\infty N → ∞ .
The laws in Definition def:intro-vertex-array depend on N N N . Their convergence in the next theorem is local: the restriction to each fixed finite set of sites converges in distribution.
Theorem 1.2. Suppose that 0 ≤ q < 1 , 0 < α < ∞ , max ( 1 / 2 , 1 − α ) < ρ 1 < ⋯ < ρ r < 1.
0\le q<1,\qquad 0<\alpha<\infty,\qquad
\max(1/2,1-\alpha) < \rho_1<\cdots<\rho_r<1.
0 ≤ q < 1 , 0 < α < ∞ , max ( 1/2 , 1 − α ) < ρ 1 < ⋯ < ρ r < 1. The laws μ e n g N \mu^N_{\mathrm{eng}} μ eng N of Definition def:intro-vertex-array converge locally, as N → ∞ N\to\infty N → ∞ , to a probability measure μ α , ρ 1 , … , ρ r \mu^{\alpha,\rho_1,\ldots,\rho_r} μ α , ρ 1 , … , ρ r on C r Z > 0 \mathcal C_r^{\mathbb Z_{>0}} C r Z > 0 . This measure is stationary for the multispecies half-line ASEP defined above.
The theorem also admits the following limit, which gives an additional low-density family.
The first two sites of the two-species stationary measure
We now specialize to two particle species, with priority order 1 ≻ 2 ≻ 0 1\succ2\succ0 1 ≻ 2 ≻ 0 , and compute the joint distribution of the colors at sites 1 1 1 and 2 2 2 . The vertex construction of the previous subsection allows (after considerable additional work) to obtain the following result, which is the second main theorem of the present paper.
Theorem 1.4. Fix 0 ≤ q < 1 0\le q<1 0 ≤ q < 1 and suppose that one of the two regimes holds: ( H ) 0 < α < ∞ , max { 1 / 2 , 1 − α } < ρ 1 < ρ 2 < 1 , ( L ) 0 < α ≤ 1 2 , ρ 1 = α , 1 − α < ρ 2 < 1.
\begin{aligned}
\mathrm{(H)}\quad&0<\alpha<\infty,\qquad
\max\{1/2,1-\alpha\}<\rho_1<\rho_2<1,\\
\mathrm{(L)}\quad&0<\alpha\le\tfrac12,\qquad
\rho_1=\alpha,\qquad1-\alpha<\rho_2<1.
\end{aligned}
( H ) ( L ) 0 < α < ∞ , max { 1/2 , 1 − α } < ρ 1 < ρ 2 < 1 , 0 < α ≤ 2 1 , ρ 1 = α , 1 − α < ρ 2 < 1. Let η ∼ μ α , ρ 1 , ρ 2 \eta\sim\mu^{\alpha,\rho_1,\rho_2} η ∼ μ α , ρ 1 , ρ 2 be the stationary law from Theorem 1.2 in regime ( H ) \mathrm{(H)} ( H ) , or from Remark 1.3 in regime ( L ) \mathrm{(L)} ( L ) . Set J i : = J ( ρ i ) = ρ i ( 1 − ρ i ) , j i : = J i α , i = 1 , 2 , θ : = q + ( 1 − q ) ρ 2 .
J_i:=J(\rho_i)=\rho_i(1-\rho_i),\qquad
j_i:=\frac{J_i}{\alpha},\qquad i=1,2,
\qquad \theta:=q+(1-q)\rho_2.
J i := J ( ρ i ) = ρ i ( 1 − ρ i ) , j i := α J i , i = 1 , 2 , θ := q + ( 1 − q ) ρ 2 . Write p i j = P ( η 1 = i , η 2 = j ) p_{ij}=\mathbb P(\eta_1=i,\eta_2=j) p ij = P ( η 1 = i , η 2 = j ) ; rows and columns in the following table are indexed in the order 0 , 2 , 1 0,2,1 0 , 2 , 1 .
We have
( p i j ) = ( j 2 2 ( j 1 − j 2 ) ( j 2 + j 1 ( 1 − θ ) ) j 1 ( 1 − j 1 ) − ( j 1 − j 2 ) ( 1 − j 1 θ ) ( j 1 − j 2 ) ( j 1 θ ( 1 − θ ) + q j 2 ) ( j 1 − j 2 ) ( j 1 θ 2 − q j 2 ) ( j 1 − j 2 ) ( 1 − j 1 θ ) j 2 ( ( 1 − q ) α + q ( 1 − j 1 ) ) − ( j 1 − j 2 ) j 1 θ ( 1 − θ ) ( j 1 − j 2 ) ( ( 1 − q ) α + q ( 1 − j 1 ) + j 1 θ ( 1 − θ ) ) 1 − j 1 − ( 1 − q ) α j 1 − q j 1 ( 1 − j 1 ) ) .
(p_{ij})=
\begin{pmatrix}
j_2^2
& (j_1-j_2)\bigl(j_2+j_1(1-\theta)\bigr)
& \begin{gathered}
j_1(1-j_1)\\[-2pt]
{}-(j_1-j_2)(1-j_1\theta)
\end{gathered}
\\[3mm]
(j_1-j_2)\bigl(j_1\theta(1-\theta)+qj_2\bigr)
& (j_1-j_2)\bigl(j_1\theta^2-qj_2\bigr)
& (j_1-j_2)(1-j_1\theta)
\\[3mm]
\begin{gathered}
j_2\bigl((1-q)\alpha+q(1-j_1)\bigr)\\[-2pt]
{}-(j_1-j_2) j_1\theta(1-\theta)
\end{gathered}
& \begin{gathered}
(j_1-j_2)\bigl((1-q)\alpha+q(1-j_1)\\[-2pt]
{}+j_1\theta(1-\theta)\bigr)
\end{gathered}
& \begin{gathered}
1-j_1-(1-q)\alpha j_1\\[-2pt]
{}-qj_1(1-j_1)
\end{gathered}
\end{pmatrix}.
( p ij ) = j 2 2 ( j 1 − j 2 ) ( j 1 θ ( 1 − θ ) + q j 2 ) j 2 ( ( 1 − q ) α + q ( 1 − j 1 ) ) − ( j 1 − j 2 ) j 1 θ ( 1 − θ ) ( j 1 − j 2 ) ( j 2 + j 1 ( 1 − θ ) ) ( j 1 − j 2 ) ( j 1 θ 2 − q j 2 ) ( j 1 − j 2 ) ( ( 1 − q ) α + q ( 1 − j 1 ) + j 1 θ ( 1 − θ ) ) j 1 ( 1 − j 1 ) − ( j 1 − j 2 ) ( 1 − j 1 θ ) ( j 1 − j 2 ) ( 1 − j 1 θ ) 1 − j 1 − ( 1 − q ) α j 1 − q j 1 ( 1 − j 1 ) .
We believe that explicit computations of correlations are the most interesting part of the story behind stationary measures of (multi-species) ASEP, see [86 Theorem 1.5(b)] , [51 Theorem 1.7] , [54 Theorem 5.1] , and [87 Theorems 1.1–1.2] . The main motivation of our work was to extend this list of results with a half-space example.
For q = 0 q=0 q = 0 , it seems plausible that our low-high-density (case (L) above) correlation formulas could also be obtained from the matrix-product solution for the finite open two-species TASEP in [71 ] .
The half-space speed process
A stationary measure of multi-species ASEP is interesting in its own right. However, it also has a quite different and very appealing characterization in terms of the speed process. To prove this connection precisely requires several results of a different nature than those used to study the stationary measure. We only partially address the required types of statements in Section 6 and formulate stronger results in the form of conjectures.
To avoid additional nuances, we set q = 0 q=0 q = 0 and fix 0 < α ≤ 1 0<\alpha\le1 0 < α ≤ 1 . Consider the half-space TASEP with infinitely many colors on Z ∗ = Z ∖ { 0 } \mathbb Z^\ast=\mathbb Z\setminus\{0\} Z ∗ = Z ∖ { 0 } . Its configuration η t \eta_t η t is a signed permutation: η t ( x ) \eta_t(x) η t ( x ) is the color at site x x x , η t ( − x ) = − η t ( x ) \eta_t(-x)=-\eta_t(x) η t ( − x ) = − η t ( x ) , and initially η 0 ( i ) = i \eta_0(i)=i η 0 ( i ) = i . For each x ≥ 1 x\ge1 x ≥ 1 , a rate-one clock exchanges the colors at x , x + 1 x,x+1 x , x + 1 and simultaneously at − x , − x − 1 -x,-x-1 − x , − x − 1 whenever η t ( x ) < η t ( x + 1 ) \eta_t(x)<\eta_t(x+1) η t ( x ) < η t ( x + 1 ) . At the boundary, a rate-α \alpha α clock exchanges the colors at − 1 , 1 -1,1 − 1 , 1 whenever η t ( − 1 ) < η t ( 1 ) \eta_t(-1)<\eta_t(1) η t ( − 1 ) < η t ( 1 ) . All these clocks are independent. Thus the negative half-line contains the same configuration with a different sign. Write X i ( t ) = η t − 1 ( i ) X_i(t)=\eta_t^{-1}(i) X i ( t ) = η t − 1 ( i ) for the position of color i i i .
Conjecture 1.5. For any i ∈ Z ∗ i\in\mathbb Z^\ast i ∈ Z ∗ , the almost sure limit U i : = lim t → ∞ X i ( t ) t , U_i:=\lim_{t\to\infty}\frac{X_i(t)}{t}, U i := lim t → ∞ t X i ( t ) , exists.
Assuming this conjecture, we call the random sequence ( U i ) i ∈ Z ∗ (U_i)_{i\in\mathbb Z^\ast} ( U i ) i ∈ Z ∗ the TASEP half-space speed process. Although almost-sure convergence remains conjectural, the distributional limit for the first particle can be proved, including its negative part.
Theorem 1.6. Set α ^ = max { 0 , 1 − 2 α } \hat\alpha=\max\{0,1-2\alpha\} α ^ = max { 0 , 1 − 2 α } . As t → ∞ t\to\infty t → ∞ , X 1 ( t ) t ⟹ V α , \frac{X_1(t)}t\Longrightarrow V_\alpha, t X 1 ( t ) ⟹ V α , where the absolutely continuous part of V α V_\alpha V α has density f α ( v ) = 1 2 1 ( − 1 , − α ^ ) ( v ) + v 2 α 1 ( α ^ , 1 ) ( v ) . f_\alpha(v)=\frac12\mathbf1_{(-1,-\hat\alpha)}(v)
+\frac{v}{2\alpha}\mathbf1_{(\hat\alpha,1)}(v). f α ( v ) = 2 1 1 ( − 1 , − α ^ ) ( v ) + 2 α v 1 ( α ^ , 1 ) ( v ) . For α > 1 / 2 \alpha>1/2 α > 1/2 , the limiting law also has an atom at zero of mass ( 2 α − 1 ) / ( 4 α ) (2\alpha-1)/(4\alpha) ( 2 α − 1 ) / ( 4 α ) ; for 0 < α ≤ 1 / 2 0<\alpha\le1/2 0 < α ≤ 1/2 there are no atoms.
This is Theorem 6.9 below.
The main result of § 6 is the following joint distribution of speeds of first two particles, conditioned on the event that they stayed on the positive half-space. It is conditional on the existence of certain local equilibrium limit.
Theorem 1.7. Assume Conjecture 6.10 and set S t = { X 1 ( t ) > 0 , X 2 ( t ) > 0 } \mathcal S_t=\{X_1(t)>0,\ X_2(t)>0\} S t = { X 1 ( t ) > 0 , X 2 ( t ) > 0 } . Conditional on S t \mathcal S_t S t , the pair ( X 1 ( t ) / t , X 2 ( t ) / t ) \bigl(X_1(t)/t,X_2(t)/t\bigr) ( X 1 ( t ) / t , X 2 ( t ) / t ) converges weakly to a probability measure on [ α ^ , 1 ] 2 [\hat\alpha,1]^2 [ α ^ , 1 ] 2 with off-diagonal density 1 ( 1 − α ^ 2 ) 2 { 2 u v ( v 2 − u 2 ) , α ^ < u < v < 1 , v ( 1 + 2 u + 3 u 2 − 2 v 2 ) , α ^ < v < u < 1 , \frac{1}{(1-\hat\alpha^2)^2}
\begin{cases}
2uv(v^2-u^2),&\hat\alpha<u<v<1,\\[1mm]
v(1+2u+3u^2-2v^2),&\hat\alpha<v<u<1,
\end{cases} ( 1 − α ^ 2 ) 2 1 { 2 uv ( v 2 − u 2 ) , v ( 1 + 2 u + 3 u 2 − 2 v 2 ) , α ^ < u < v < 1 , α ^ < v < u < 1 , and diagonal line density at ( u , u ) (u,u) ( u , u ) , with respect to d u du d u , given by u ( 1 + u ) 2 ( 1 − u 2 ) 2 ( 1 − α ^ 2 ) 2 , α ^ < u < 1. \frac{u(1+u)^2(1-u^2)}{2(1-\hat\alpha^2)^2},
\qquad \hat\alpha<u<1. 2 ( 1 − α ^ 2 ) 2 u ( 1 + u ) 2 ( 1 − u 2 ) , α ^ < u < 1. This is Theorem 6.11 below.
One peculiar detail of this distribution is that it does not depend on α \alpha α as long as α ∈ [ 1 / 2 , 1 ] \alpha \in [1/2,1] α ∈ [ 1/2 , 1 ] (so that α ^ = 0 \hat \alpha =0 α ^ = 0 ). For example, (modulo Conjectures 1.5 and 6.10 ), one has P ( U 1 = U 2 ∣ U 1 > 0 , U 2 > 0 ) = 3 / 10 P(U_1=U_2 | U_1>0, U_2>0) = 3/10 P ( U 1 = U 2 ∣ U 1 > 0 , U 2 > 0 ) = 3/10 for α ∈ [ 1 / 2 ; 1 ] \alpha \in [1/2;1] α ∈ [ 1/2 ; 1 ] .
A conjectural formula for the full joint law (without conditioning on S t \mathcal S_t S t ) is recorded in Appendix § 7 .
Organization of the paper.
§ 2 recalls known preliminaries about the model. In § 3 we address the analytic continuation of vertex weights that we use in our construction. The material is close to previous works, but we have not found it in exactly this form. In particular, a hole-indexed analytic continuation of vertex weights might be slightly new. In § 4 we prove our first main result, Theorem 1.2 . The key to the proof, as in Aggarwal-Nicoletti-Petrov [50 ] , is a commutation relation provided by the Yang-Baxter equation and the reflection equation. Nevertheless, it requires significant effort to properly apply this idea to our case. An important role is played by a correct choice of queue specialization. In Section 5 we use this vertex construction for explicit calculations, proving Theorem 1.4 above. Finally, we study distributions of speeds of particles in § 6 , in order to emphasize the significance of the joint distribution from Theorem 1.4 . Appendix § 7 contains the conjectural full two-speed law and a simulation result.
AI use.
Main results and ideas of the paper were developed by the authors. In particular, both main theorems above were fully obtained without the use of AI. The content of Section 6 is based on the interaction with ChatGPT; also, the writing of the paper was done with the use of ChatGPT.
Acknowledgements.
We are grateful to P.L. Ferrari for discussions related to material of § 6 . A. Bufetov was partially supported by the European Research Council (ERC), Grant Agreement No. 101041499.
Preliminaries
This section introduces notation and recalls several known results that will be used in the paper.
Matrix product ansatz for the half-space ASEP
For α , ρ ∈ ( 0 , 1 ) \alpha, \rho\in(0,1) α , ρ ∈ ( 0 , 1 ) , write
ρ ˉ : = 1 − ρ , J ( ρ ) : = ρ ρ ˉ , j ( ρ ) : = J ( ρ ) α . \bar\rho:=1-\rho,
\qquad
J(\rho):=\rho\bar\rho,
\qquad
j(\rho):=\frac{J(\rho)}{\alpha}. ρ ˉ := 1 − ρ , J ( ρ ) := ρ ρ ˉ , j ( ρ ) := α J ( ρ ) .
For u , v ∈ ( 0 , 1 ] u,v\in(0,1] u , v ∈ ( 0 , 1 ] , set
b u , v : = ( 1 − u ) ( 1 − v ) u v . \begin{equation}
b_{u,v}:=\frac{(1-u)(1-v)}{uv}. \tag*{(2.1)}
\end{equation} b u , v := uv ( 1 − u ) ( 1 − v ) . (2.1)
Consider the half-space ASEP with right and left jump rates 1 1 1 and q ∈ [ 0 , 1 ) q\in[0,1) q ∈ [ 0 , 1 ) , respectively, and injection rate ( 1 − q ) α (1-q)\alpha ( 1 − q ) α at site 1 1 1 . Sasamoto and Williams [89 Theorems 4.1 and 5.1] extended Grosskinsky’s half-space matrix-product ansatz [80 Theorem 3.2] to this setting.
Proposition 2.1. Let 0 ≤ q < 1 0\leq q<1 0 ≤ q < 1 , 0 < α < 1 0<\alpha<1 0 < α < 1 , and 0 < ρ < 1 0<\rho<1 0 < ρ < 1 . Consider matrices D , E D,E D , E and vectors ⟨ W ∣ , ∣ V ⟩ \langle W|,|V\rangle ⟨ W ∣ , ∣ V ⟩ satisfying D E − q E D = ( 1 − q ) J ( ρ ) ( D + E ) , α ⟨ W ∣ E = J ( ρ ) ⟨ W ∣ , ( D + E ) ∣ V ⟩ = ∣ V ⟩ .
DE-qED=(1-q)J(\rho)(D+E),
\qquad
\alpha\langle W|E=J(\rho)\langle W|,
\qquad
(D+E)|V\rangle=|V\rangle.
D E − q E D = ( 1 − q ) J ( ρ ) ( D + E ) , α ⟨ W ∣ E = J ( ρ ) ⟨ W ∣ , ( D + E ) ∣ V ⟩ = ∣ V ⟩ . These relations define a stationary probability law μ α , ρ \mu^{\alpha,\rho} μ α , ρ of the half-space ASEP through its cylinder probabilities. More precisely, for α > min ρ , 1 − ρ \alpha>\min{\rho, 1-\rho} α > min ρ , 1 − ρ if η ∼ μ α , ρ \eta\sim\mu^{\alpha,\rho} η ∼ μ α , ρ , then for every n ≥ 1 n\geq1 n ≥ 1 and ε 1 , … , ε n ∈ { 0 , 1 } \varepsilon_1,\ldots,\varepsilon_n\in\{0,1\} ε 1 , … , ε n ∈ { 0 , 1 } , P ( η ( 1 ) = ε 1 , … , η ( n ) = ε n ) = ⟨ W ∣ ∏ i = 1 n ( ε i D + ( 1 − ε i ) E ) ∣ V ⟩
\mathbb P(\eta(1)=\varepsilon_1,\ldots,\eta(n)=\varepsilon_n)
=\left\langle W\left|\prod_{i=1}^n
\bigl(\varepsilon_iD+(1-\varepsilon_i)E\bigr)\right|V\right\rangle
P ( η ( 1 ) = ε 1 , … , η ( n ) = ε n ) = ⟨ W ∏ i = 1 n ( ε i D + ( 1 − ε i ) E ) V ⟩ Its stationary current is P ( η ( i ) = 1 , η ( i + 1 ) = 0 ) − q P ( η ( i ) = 0 , η ( i + 1 ) = 1 ) = ( 1 − q ) J ( ρ ) , i ≥ 1.
\mathbb P(\eta(i)=1,\eta(i+1)=0)
-q\mathbb P(\eta(i)=0,\eta(i+1)=1)
=(1-q)J(\rho),\qquad i\geq1.
P ( η ( i ) = 1 , η ( i + 1 ) = 0 ) − q P ( η ( i ) = 0 , η ( i + 1 ) = 1 ) = ( 1 − q ) J ( ρ ) , i ≥ 1.
The algebraic relation determines the distribution at the first two sites even without using an explicit solution.
Proposition 2.2. Under the assumptions of Proposition 2.1 , let η ∼ μ α , ρ \eta\sim\mu^{\alpha,\rho} η ∼ μ α , ρ and set j : = j ( ρ ) j:=j(\rho) j := j ( ρ ) . We have ( P ( η ( 1 ) = a , η ( 2 ) = b ) ) a , b ∈ { 0 , 1 } = ( j 2 j ( 1 − j ) j ( ( 1 − q ) α + q ( 1 − j ) ) ( 1 − j ) ( 1 − q j ) − ( 1 − q ) α j ) .
\left(
\mathbb P(\eta(1)=a,\eta(2)=b)
\right)_{a,b\in\{0,1\}}
=
\begin{pmatrix}
j^2 & j(1-j)\\[1mm]
j\bigl((1-q)\alpha+q(1-j)\bigr)
& (1-j)(1-qj)-(1-q)\alpha j
\end{pmatrix}.
( P ( η ( 1 ) = a , η ( 2 ) = b ) ) a , b ∈ { 0 , 1 } = ( j 2 j ( ( 1 − q ) α + q ( 1 − j ) ) j ( 1 − j ) ( 1 − j ) ( 1 − q j ) − ( 1 − q ) α j ) .
Proof. The boundary relation and ( D + E ) ∣ V ⟩ = ∣ V ⟩ (D+E)|V\rangle=|V\rangle ( D + E ) ∣ V ⟩ = ∣ V ⟩ give
P ( η ( 1 ) = 0 , η ( 2 ) = 0 ) = ⟨ W ∣ E 2 ∣ V ⟩ = j 2 , P ( η ( 1 ) = 0 ) = ⟨ W ∣ E ( D + E ) ∣ V ⟩ = j . \mathbb P(\eta(1)=0,\eta(2)=0) =\langle W|E^2|V\rangle=j^2,
\mathbb P(\eta(1)=0)=\langle W|E(D+E)|V\rangle=j. P ( η ( 1 ) = 0 , η ( 2 ) = 0 ) = ⟨ W ∣ E 2 ∣ V ⟩ = j 2 , P ( η ( 1 ) = 0 ) = ⟨ W ∣ E ( D + E ) ∣ V ⟩ = j . Moreover, the bulk relation gives
P ( η ( 1 ) = 1 , η ( 2 ) = 0 ) − q P ( η ( 1 ) = 0 , η ( 2 ) = 1 ) = ( 1 − q ) J ( ρ ) . \mathbb P(\eta(1)=1,\eta(2)=0)
-q\mathbb P(\eta(1)=0,\eta(2)=1)
=(1-q)J(\rho). P ( η ( 1 ) = 1 , η ( 2 ) = 0 ) − q P ( η ( 1 ) = 0 , η ( 2 ) = 1 ) = ( 1 − q ) J ( ρ ) . The four probabilities now follow by subtraction. ◻
The Ferrari–Martin construction
Ferrari and Martin [78 ] constructed the stationary measures of the full-space multispecies TASEP using multi-line queues. Martin [86 ] extended this construction to the multispecies ASEP. In this section, we collect their results in our notation. Throughout this subsection, q ∈ [ 0 , 1 ) q\in[0,1) q ∈ [ 0 , 1 ) and the priority order is 1 ≻ 2 ≻ 0 1\succ2\succ0 1 ≻ 2 ≻ 0 .
We begin with the two-species case. Fix
0 < ρ 1 < ρ 2 < 1 , 0<\rho_1<\rho_2<1, 0 < ρ 1 < ρ 2 < 1 ,
where ρ 1 \rho_1 ρ 1 is the density of first-class particles and ρ 2 \rho_2 ρ 2 is the combined density of first- and second-class particles. Let A = ( A ( i ) ) i ∈ Z A=(A(i))_{i\in\mathbb Z} A = ( A ( i ) ) i ∈ Z and S = ( S ( i ) ) i ∈ Z S=(S(i))_{i\in\mathbb Z} S = ( S ( i ) ) i ∈ Z be independent Bernoulli processes of parameters ρ 1 \rho_1 ρ 1 and ρ 2 \rho_2 ρ 2 , respectively. We interpret A ( i ) = 1 A(i)=1 A ( i ) = 1 as an arrival and S ( i ) = 1 S(i)=1 S ( i ) = 1 as an available service.
Let Q i + 1 Q_{i+1} Q i + 1 be the queue length entering site i i i , and let Q i Q_i Q i be the queue length after that site has been processed. Suppose that Q i + 1 = k Q_{i+1}=k Q i + 1 = k . Denoting the output by d ( i ) ∈ { 0 , 1 , 2 } d(i)\in\{0,1,2\} d ( i ) ∈ { 0 , 1 , 2 } , the Martin’s multi-line algorithm is defined as follows:
If A ( i ) = S ( i ) = 0 A\left(i\right) = S\left(i\right) = 0 A ( i ) = S ( i ) = 0 , then d ( i ) = 0 d\left(i\right) = 0 d ( i ) = 0 and Q i = k Q_i = k Q i = k ,
if A ( i ) = S ( i ) = 1 A\left(i\right) = S\left(i\right) = 1 A ( i ) = S ( i ) = 1 , then the arrival immediately takes the service, so d ( i ) = 1 d\left(i\right) = 1 d ( i ) = 1 and Q i = k Q_i = k Q i = k ,
if A ( i ) = 1 , S ( i ) = 0 A\left(i\right) = 1, S\left(i\right) = 0 A ( i ) = 1 , S ( i ) = 0 , then d ( i ) = 0 d\left(i\right) = 0 d ( i ) = 0 , Q i = k + 1 Q_i = k+1 Q i = k + 1 , and the arrival service is added to the waiting queue,
if A ( i ) = 0 , S ( i ) = 1 A\left(i\right) = 0, S\left(i\right) = 1 A ( i ) = 0 , S ( i ) = 1 , then each particle in the queue independently rejects the service with probability q q q . Hence, with probability q k q^k q k , the service is rejected by all particles, producing a second-class particle at site i i i , so d ( i ) = 2 d\left(i\right) = 2 d ( i ) = 2 , Q i = k Q_i = k Q i = k . With probability 1 − q k 1 - q^k 1 − q k , the service is accepted by some particle in the queue, giving Q i = k − 1 Q_i = k -1 Q i = k − 1 and d ( i ) = 1 d\left(i\right) = 1 d ( i ) = 1 .
We therefore have
Q i = Q i + 1 + A ( i ) − 1 { d ( i ) = 1 } . \begin{equation}
Q_i=Q_{i+1}+A(i)-\mathbf1_{\{d(i)=1\}}. \tag*{(2.6)}
\end{equation} Q i = Q i + 1 + A ( i ) − 1 { d ( i ) = 1 } . (2.6)
The construction extends recursively to any number of species. Given 0 < ρ 1 < ⋯ < ρ n < 1 0<\rho_1<\cdots<\rho_n<1 0 < ρ 1 < ⋯ < ρ n < 1 , take independent Bernoulli service processes of densities ρ 1 , … , ρ n \rho_1,\ldots,\rho_n ρ 1 , … , ρ n . The first line has a class-1 1 1 particle at each service and a hole elsewhere. At level k ≥ 2 k\geq2 k ≥ 2 , use the output of level k − 1 k-1 k − 1 as the arrival process and the k k k th Bernoulli line as its service process. The algorithm at each level is analogous to the two-color case, with service now offered in class-priority order. At level k k k , if a class-b b b customer arrives, where 1 ≤ b ≤ k − 1 1\leq b\leq k-1 1 ≤ b ≤ k − 1 , waiting customers of classes 1 , … , b − 1 1,\ldots,b-1 1 , … , b − 1 are offered any available service first. If one accepts, it departs and the arriving customer joins the queue. If they all reject, a class-b b b departure always occurs. Thus, a class-k k k departure is only created when no arrival but a service rejected by all the waiting particles. We denote this law by π ρ 1 , ρ 2 , … ρ n \pi^{\rho_1,\rho_2, \dots \rho_n} π ρ 1 , ρ 2 , … ρ n .
To state the queue-length distribution, introduce the q q q -Pochhammer symbols. For a complex parameter u u u and m ∈ Z ≥ 0 m\in\mathbb Z_{\geq0} m ∈ Z ≥ 0 , set
( u ; q ) m : = ∏ j = 0 m − 1 ( 1 − u q j ) , ( u ; q ) ∞ : = ∏ j = 0 ∞ ( 1 − u q j ) . (u;q)_m:=\prod_{j=0}^{m-1}(1-uq^j),
\qquad
(u;q)_\infty:=\prod_{j=0}^{\infty}(1-uq^j). ( u ; q ) m := j = 0 ∏ m − 1 ( 1 − u q j ) , ( u ; q ) ∞ := j = 0 ∏ ∞ ( 1 − u q j ) .
We also write
[ m r ] q : = ( q ; q ) m ( q ; q ) r ( q ; q ) m − r . \begin{bmatrix}m\\r\end{bmatrix}_{\!q}
:=\frac{(q;q)_m}{(q;q)_r(q;q)_{m-r}}. [ m r ] q := ( q ; q ) r ( q ; q ) m − r ( q ; q ) m .
For real u < 1 u<1 u < 1 and 0 ≤ v < 1 0\leq v<1 0 ≤ v < 1 , define
p u , v ( q ) ( k ) : = ( v ; q ) ∞ ( u v ; q ) ∞ ( u ; q ) k ( q ; q ) k v k , k ∈ Z ≥ 0 . \begin{equation}
p_{u,v}^{(q)}(k)
:=\frac{(v;q)_\infty}{(uv;q)_\infty}
\frac{(u;q)_k}{(q;q)_k}v^k,
\qquad k\in\mathbb Z_{\geq0}. \tag*{(2.7)}
\end{equation} p u , v ( q ) ( k ) := ( uv ; q ) ∞ ( v ; q ) ∞ ( q ; q ) k ( u ; q ) k v k , k ∈ Z ≥ 0 . (2.7)
By the q q q -binomial theorem, (2.7) is a probability distribution. We call it the q q q -negative binomial distribution and write X ∼ q - N B ( u , v ) X\sim q\text{-}\mathrm{NB}(u,v) X ∼ q - NB ( u , v ) if P ( X = k ) = p u , v ( q ) ( k ) \mathbb P(X=k)=p_{u,v}^{(q)}(k) P ( X = k ) = p u , v ( q ) ( k ) . When u = 0 u=0 u = 0 , we abbreviate
p v ( q ) ( k ) : = p 0 , v ( q ) ( k ) = ( v ; q ) ∞ v k ( q ; q ) k , k ∈ Z ≥ 0 , \begin{equation}
p_v^{(q)}(k):=p_{0,v}^{(q)}(k)
=(v;q)_\infty\frac{v^k}{(q;q)_k},
\qquad k\in\mathbb Z_{\geq0}, \tag*{(2.8)}
\end{equation} p v ( q ) ( k ) := p 0 , v ( q ) ( k ) = ( v ; q ) ∞ ( q ; q ) k v k , k ∈ Z ≥ 0 , (2.8)
and call the corresponding law the q q q -Poisson distribution, denoted by q - P o i ( v ) q\text{-}\mathrm{Poi}(v) q - Poi ( v ) . At q = 0 q=0 q = 0 , this is the geometric distribution with parameter v v v .
Theorem 2.3 ([86 ] , formula (6.5)). In the two-color setting, set r 12 : = ρ 1 ( 1 − ρ 2 ) ( 1 − ρ 1 ) ρ 2 .
r_{12}:=\frac{\rho_1(1-\rho_2)}{(1-\rho_1)\rho_2}.
r 12 := ( 1 − ρ 1 ) ρ 2 ρ 1 ( 1 − ρ 2 ) . The stationary distribution of the queue length process is Q i ∼ q - P o i ( r 12 ) , i ∈ Z . Q_i\sim q\text{-}\mathrm{Poi}(r_{12}),
\qquad i\in\mathbb Z. Q i ∼ q - Poi ( r 12 ) , i ∈ Z .
Set
θ : = q + ( 1 − q ) ρ 2 , ϕ : = 1 − ( 1 − q ) ρ 1 . \begin{equation}
\theta:=q+(1-q)\rho_2,
\qquad
\phi:=1-(1-q)\rho_1. \tag*{(2.10)}
\end{equation} θ := q + ( 1 − q ) ρ 2 , ϕ := 1 − ( 1 − q ) ρ 1 . (2.10)
We also need the two neighboring sites joint distribution given in the following table.
Theorem 2.4 ([86 ] , Lemma 6.3(i)–(iii)). In the two-color setting, let d ∼ π ρ 1 , ρ 2 d\sim\pi^{\rho_1,\rho_2} d ∼ π ρ 1 , ρ 2 . Then P ( d ( 1 ) = i , d ( 2 ) = j ) j = 0 j = 2 j = 1 i = 0 ( 1 − ρ 2 ) 2 ( ρ 2 − ρ 1 ) ( 1 − ρ 2 ) ρ 1 ( 1 − ρ 2 ) i = 2 ( ρ 2 − ρ 1 ) ( 1 − ρ 2 ) ϕ ( ρ 2 − ρ 1 ) ( ρ 2 − ρ 1 θ ) ρ 1 ( ρ 2 − ρ 1 ) i = 1 ρ 1 ( 1 − ρ 2 ) ( θ + ϕ − q ) ρ 1 ( ρ 2 − ρ 1 ) θ ρ 1 2 .
\begin{array}{c|ccc}
\mathbb P(d(1)=i,d(2)=j)
&j=0&j=2&j=1\\
\hline
i=0
&(1-\rho_2)^2
&(\rho_2-\rho_1)(1-\rho_2)
&\rho_1(1-\rho_2)
\\
i=2
&(\rho_2-\rho_1)(1-\rho_2)\phi
&(\rho_2-\rho_1)(\rho_2-\rho_1\theta)
&\rho_1(\rho_2-\rho_1)
\\
i=1
&\rho_1(1-\rho_2)(\theta+\phi-q)
&\rho_1(\rho_2-\rho_1)\theta
&\rho_1^2.
\end{array}
P ( d ( 1 ) = i , d ( 2 ) = j ) i = 0 i = 2 i = 1 j = 0 ( 1 − ρ 2 ) 2 ( ρ 2 − ρ 1 ) ( 1 − ρ 2 ) ϕ ρ 1 ( 1 − ρ 2 ) ( θ + ϕ − q ) j = 2 ( ρ 2 − ρ 1 ) ( 1 − ρ 2 ) ( ρ 2 − ρ 1 ) ( ρ 2 − ρ 1 θ ) ρ 1 ( ρ 2 − ρ 1 ) θ j = 1 ρ 1 ( 1 − ρ 2 ) ρ 1 ( ρ 2 − ρ 1 ) ρ 1 2 .
The queue length is generally dependent on the output process. The half-space calculations require its conditional law given the colors at two neighboring sites.
Proposition 2.5. Consider the stationary queue coupling of Sub§ 2.2 , with r 12 r_{12} r 12 as in (2.9) . Start with Q 3 ∼ q - P o i ( r 12 ) Q_3\sim q\text{-}\mathrm{Poi}(r_{12}) Q 3 ∼ q - Poi ( r 12 ) , independently of the arrivals, services, and rejection variables at sites 2 2 2 and 1 1 1 . Process site 2 2 2 and then site 1 1 1 , and let Q 1 Q_1 Q 1 be the resulting queue length. For i , j ∈ { 0 , 1 , 2 } i,j\in\{0,1,2\} i , j ∈ { 0 , 1 , 2 } , define Q i j Q^{ij} Q ij by the conditional law Q i j = d ( Q 1 ∣ ( d ( 1 ) , d ( 2 ) ) = ( i , j ) ) . Q^{ij}\overset d=\bigl(Q_1\mid(d(1),d(2))=(i,j)\bigr). Q ij = d ( Q 1 ∣ ( d ( 1 ) , d ( 2 )) = ( i , j ) ) . Then Q 11 ∼ q - P o i ( r 12 ) , Q 12 , Q 21 ∼ q - P o i ( q r 12 ) .
Q^{11}\sim q\text{-}\mathrm{Poi}(r_{12}),\qquad
Q^{12},Q^{21}\sim q\text{-}\mathrm{Poi}(qr_{12}).
Q 11 ∼ q - Poi ( r 12 ) , Q 12 , Q 21 ∼ q - Poi ( q r 12 ) . Moreover, set β 10 : = ρ 1 θ θ + ϕ − q .
\beta_{10}:=\frac{\rho_1\theta}{\theta+\phi-q}.
β 10 := θ + ϕ − q ρ 1 θ . Then Q 10 = d Q + ξ 10 , Q ∼ q - P o i ( r 12 ) , ξ 10 ∼ Ber ( β 10 ) ,
Q^{10}\overset{d}{=}Q+\xi^{10},
\qquad Q\sim q\text{-}\mathrm{Poi}(r_{12}),
\qquad \xi^{10}\sim\operatorname{Ber}(\beta_{10}),
Q 10 = d Q + ξ 10 , Q ∼ q - Poi ( r 12 ) , ξ 10 ∼ Ber ( β 10 ) , where the two random variables on the right-hand side are independent.
Proof. By Theorem 2.4 , the probabilities of the conditioning events are known. It therefore suffices to compute the joint probabilities
P ( Q 1 = m , d ( 1 ) = i , d ( 2 ) = j ) , ( i , j ) ∈ { ( 1 , 1 ) , ( 1 , 2 ) , ( 2 , 1 ) , ( 1 , 0 ) } . \mathbb P(Q_1=m,d(1)=i,d(2)=j),
\qquad (i,j)\in\{(1,1),(1,2),(2,1),(1,0)\}. P ( Q 1 = m , d ( 1 ) = i , d ( 2 ) = j ) , ( i , j ) ∈ {( 1 , 1 ) , ( 1 , 2 ) , ( 2 , 1 ) , ( 1 , 0 )} . Write p m = p r 12 ( q ) ( m ) p_m=p_{r_{12}}^{(q)}(m) p m = p r 12 ( q ) ( m ) , with p − 1 = 0 p_{-1}=0 p − 1 = 0 .
We first process site 2 2 2 . An output of color 1 1 1 arises either when an arrival uses the service immediately or when there is no arrival and a waiting customer accepts the service. Color 2 2 2 corresponds to an unused service, while color 0 0 0 means that no service is available. Hence
P ( Q 2 = m , d ( 2 ) = 1 ) = ρ 1 ρ 2 p m + ( 1 − ρ 1 ) ρ 2 ( 1 − q m + 1 ) p m + 1 , P ( Q 2 = m , d ( 2 ) = 2 ) = ( 1 − ρ 1 ) ρ 2 q m p m , P ( Q 2 = m , d ( 2 ) = 0 ) = ( 1 − ρ 2 ) [ ( 1 − ρ 1 ) p m + ρ 1 p m − 1 ] . \begin{align*}
\mathbb P(Q_2=m,d(2)=1)
&=\rho_1\rho_2p_m+(1-\rho_1)\rho_2(1-q^{m+1})p_{m+1},\\
\mathbb P(Q_2=m,d(2)=2)
&=(1-\rho_1)\rho_2q^mp_m,\\
\mathbb P(Q_2=m,d(2)=0)
&=(1-\rho_2)\bigl[(1-\rho_1)p_m+\rho_1p_{m-1}\bigr].
\end{align*} P ( Q 2 = m , d ( 2 ) = 1 ) P ( Q 2 = m , d ( 2 ) = 2 ) P ( Q 2 = m , d ( 2 ) = 0 ) = ρ 1 ρ 2 p m + ( 1 − ρ 1 ) ρ 2 ( 1 − q m + 1 ) p m + 1 , = ( 1 − ρ 1 ) ρ 2 q m p m , = ( 1 − ρ 2 ) [ ( 1 − ρ 1 ) p m + ρ 1 p m − 1 ] . We then apply the same queueing rule at site 1 1 1 . In particular, for the pair ( 1 , 0 ) (1,0) ( 1 , 0 ) , distinguishing whether an arrival occurs at site 1 1 1 gives the following expression for P ( Q 1 = m , d ( 1 ) = 1 , d ( 2 ) = 0 ) \mathbb P(Q_1=m,d(1)=1,d(2)=0) P ( Q 1 = m , d ( 1 ) = 1 , d ( 2 ) = 0 ) :
( 1 − ρ 2 ) ρ 2 { ρ 1 [ ( 1 − ρ 1 ) p m + ρ 1 p m − 1 ] + ( 1 − ρ 1 ) ( 1 − q m + 1 ) [ ( 1 − ρ 1 ) p m + 1 + ρ 1 p m ] } . (1-\rho_2)\rho_2\Bigl\{\rho_1[(1-\rho_1)p_m+\rho_1p_{m-1}]
+(1-\rho_1)(1-q^{m+1})[(1-\rho_1)p_{m+1}+\rho_1p_m]\Bigr\}. ( 1 − ρ 2 ) ρ 2 { ρ 1 [( 1 − ρ 1 ) p m + ρ 1 p m − 1 ] + ( 1 − ρ 1 ) ( 1 − q m + 1 ) [( 1 − ρ 1 ) p m + 1 + ρ 1 p m ] } . To simplify these probabilities, we use
( 1 − q m + 1 ) p v ( q ) ( m + 1 ) = v p v ( q ) ( m ) , q m p v ( q ) ( m ) = ( 1 − v ) p q v ( q ) ( m ) . (1-q^{m+1})p_v^{(q)}(m+1)=vp_v^{(q)}(m),
\qquad
q^mp_v^{(q)}(m)=(1-v)p_{qv}^{(q)}(m). ( 1 − q m + 1 ) p v ( q ) ( m + 1 ) = v p v ( q ) ( m ) , q m p v ( q ) ( m ) = ( 1 − v ) p q v ( q ) ( m ) . Together with the definition of r 12 r_{12} r 12 , these identities reduce the probabilities of { Q 2 = m , d ( 2 ) = 1 } \{Q_2=m,d(2)=1\} { Q 2 = m , d ( 2 ) = 1 } and { Q 2 = m , d ( 2 ) = 2 } \{Q_2=m,d(2)=2\} { Q 2 = m , d ( 2 ) = 2 } to ρ 1 p m \rho_1p_m ρ 1 p m and ( ρ 2 − ρ 1 ) p q r 12 ( q ) ( m ) (\rho_2-\rho_1)p_{qr_{12}}^{(q)}(m) ( ρ 2 − ρ 1 ) p q r 12 ( q ) ( m ) , respectively. Applying the same identities at site 1 1 1 , and using
( 1 − q m + 1 ) p m = ( 1 − q ) p m + q r 12 p m − 1 (1-q^{m+1})p_m=(1-q)p_m+qr_{12}p_{m-1} ( 1 − q m + 1 ) p m = ( 1 − q ) p m + q r 12 p m − 1 for the pair ( 1 , 0 ) (1,0) ( 1 , 0 ) , we obtain
P ( Q 1 = m , d ( 1 ) = 1 , d ( 2 ) = 1 ) = ρ 1 2 p m , P ( Q 1 = m , d ( 1 ) = 1 , d ( 2 ) = 2 ) = ρ 1 ( ρ 2 − ρ 1 ) θ p q r 12 ( q ) ( m ) , P ( Q 1 = m , d ( 1 ) = 2 , d ( 2 ) = 1 ) = ρ 1 ( ρ 2 − ρ 1 ) p q r 12 ( q ) ( m ) , P ( Q 1 = m , d ( 1 ) = 1 , d ( 2 ) = 0 ) = ρ 1 ( 1 − ρ 2 ) { [ ( 1 − ρ 1 ) θ + ϕ − q ] p m + ρ 1 θ p m − 1 } . \begin{align*}
\mathbb P(Q_1=m,d(1)=1,d(2)=1)
&=\rho_1^2p_m,\\
\mathbb P(Q_1=m,d(1)=1,d(2)=2)
&=\rho_1(\rho_2-\rho_1)\theta\,p_{qr_{12}}^{(q)}(m),\\
\mathbb P(Q_1=m,d(1)=2,d(2)=1)
&=\rho_1(\rho_2-\rho_1)p_{qr_{12}}^{(q)}(m),\\
\mathbb P(Q_1=m,d(1)=1,d(2)=0)
&=\rho_1(1-\rho_2)\Bigl\{[(1-\rho_1)\theta+\phi-q]p_m+\rho_1\theta p_{m-1}\Bigr\}.
\end{align*} P ( Q 1 = m , d ( 1 ) = 1 , d ( 2 ) = 1 ) P ( Q 1 = m , d ( 1 ) = 1 , d ( 2 ) = 2 ) P ( Q 1 = m , d ( 1 ) = 2 , d ( 2 ) = 1 ) P ( Q 1 = m , d ( 1 ) = 1 , d ( 2 ) = 0 ) = ρ 1 2 p m , = ρ 1 ( ρ 2 − ρ 1 ) θ p q r 12 ( q ) ( m ) , = ρ 1 ( ρ 2 − ρ 1 ) p q r 12 ( q ) ( m ) , = ρ 1 ( 1 − ρ 2 ) { [( 1 − ρ 1 ) θ + ϕ − q ] p m + ρ 1 θ p m − 1 } . Dividing by the corresponding probabilities in Theorem 2.4 proves the three q q q -Poisson laws and gives
P ( Q 10 = m ) = ( 1 − β 10 ) p m + β 10 p m − 1 . \mathbb P(Q^{10}=m)=(1-\beta_{10})p_m+\beta_{10}p_{m-1}. P ( Q 10 = m ) = ( 1 − β 10 ) p m + β 10 p m − 1 . This is the exactly the distribution of the sum of independent q - P o i ( r 12 ) q\text{-}\mathrm{Poi}(r_{12}) q - Poi ( r 12 ) and Ber ( β 10 ) \operatorname{Ber}(\beta_{10}) Ber ( β 10 ) random variables. ◻
Colored bulk vertex weights
We begin with the colored six-vertex model. We use the same priority order as for the particle system:
1 ≻ 2 ≻ ⋯ ≻ n ≻ 0. 1\succ2\succ\cdots\succ n\succ0. 1 ≻ 2 ≻ ⋯ ≻ n ≻ 0.
The parameter q q q is the same asymmetry parameter as in ASEP and is shared by all vertices. Each row and each column carries a nonzero complex parameter, called its rapidity. At a crossing with column rapidity x x x and row rapidity y y y , the spectral parameter z z z is determined by its row and column rapidity z = x y z=\frac{x}{y} z = y x
Definition 2.6. Let C n : = { 0 , 1 , … , n } \mathcal C_n:=\{0,1,\ldots,n\} C n := { 0 , 1 , … , n } . For i , j , k , ℓ ∈ C n i,j,k,\ell\in\mathcal C_n i , j , k , ℓ ∈ C n , let R z ( i , j ; k , ℓ ) R_z(i,j;k,\ell) R z ( i , j ; k , ℓ ) be the weight of a vertex whose incoming colors from below and from the left are i , j i,j i , j , and whose outgoing colors above and to the right are k , ℓ k,\ell k , ℓ . If i = j i=j i = j , then R z ( i , i ; i , i ) = 1. R_z(i,i;i,i)=1. R z ( i , i ; i , i ) = 1. For i ≻ j i\succ j i ≻ j , the remaining nonzero weights are R z ( i , j ; i , j ) = q ( 1 − z ) 1 − q z , R z ( i , j ; j , i ) = 1 − q 1 − q z , R z ( j , i ; j , i ) = 1 − z 1 − q z , R z ( j , i ; i , j ) = z ( 1 − q ) 1 − q z .
\begin{aligned}
R_z(i,j;i,j)&=\frac{q(1-z)}{1-qz},
&
R_z(i,j;j,i)&=\frac{1-q}{1-qz},
\\
R_z(j,i;j,i)&=\frac{1-z}{1-qz},
&
R_z(j,i;i,j)&=\frac{z(1-q)}{1-qz}.
\end{aligned}
R z ( i , j ; i , j ) R z ( j , i ; j , i ) = 1 − q z q ( 1 − z ) , = 1 − q z 1 − z , R z ( i , j ; j , i ) R z ( j , i ; i , j ) = 1 − q z 1 − q , = 1 − q z z ( 1 − q ) . All other weights vanish.
For every pair of incoming colors, these weights satisfy the sum-to-one property:
∑ k , ℓ ∈ C n R z ( i , j ; k , ℓ ) = 1. \sum_{k,\ell\in\mathcal C_n}R_z(i,j;k,\ell)=1. k , ℓ ∈ C n ∑ R z ( i , j ; k , ℓ ) = 1.
The integrability of the six-vertex model is expressed through the following Yang–Baxter equation.
Proposition 2.7. For any i 1 , i 2 , i 3 , k 1 , k 2 , k 3 ∈ C n i_1,i_2,i_3,k_1,k_2,k_3\in\mathcal C_n i 1 , i 2 , i 3 , k 1 , k 2 , k 3 ∈ C n , ∑ γ 1 , γ 2 , γ 3 ∈ C n R u / v ( i 2 , i 1 ; γ 2 , γ 1 ) R u w ( i 3 , γ 1 ; γ 3 , k 1 ) R v w ( γ 3 , γ 2 ; k 3 , k 2 ) = ∑ γ 1 , γ 2 , γ 3 ∈ C n R v w ( i 3 , i 2 ; γ 3 , γ 2 ) R u w ( γ 3 , i 1 ; k 3 , γ 1 ) R u / v ( γ 2 , γ 1 ; k 2 , k 1 ) . \begin{aligned}
&\sum_{\gamma_1,\gamma_2,\gamma_3\in\mathcal C_n}
R_{u/v}(i_2,i_1;\gamma_2,\gamma_1)
R_{uw}(i_3,\gamma_1;\gamma_3,k_1)
R_{vw}(\gamma_3,\gamma_2;k_3,k_2)
\notag\\
&\qquad=\sum_{\gamma_1,\gamma_2,\gamma_3\in\mathcal C_n}
R_{vw}(i_3,i_2;\gamma_3,\gamma_2)
R_{uw}(\gamma_3,i_1;k_3,\gamma_1)
R_{u/v}(\gamma_2,\gamma_1;k_2,k_1).
\end{aligned} γ 1 , γ 2 , γ 3 ∈ C n ∑ R u / v ( i 2 , i 1 ; γ 2 , γ 1 ) R u w ( i 3 , γ 1 ; γ 3 , k 1 ) R v w ( γ 3 , γ 2 ; k 3 , k 2 ) = γ 1 , γ 2 , γ 3 ∈ C n ∑ R v w ( i 3 , i 2 ; γ 3 , γ 2 ) R u w ( γ 3 , i 1 ; k 3 , γ 1 ) R u / v ( γ 2 , γ 1 ; k 2 , k 1 ) .
Before giving its graphical representation, we introduce the conventions used throughout the paper.
Graphical conventions.
Thin gray lines represent edges carrying a single color. Thick gray lines represent fused edges, which may carry several arrows.
The thick salmon lines carry a hole-indexed fused arrow introduced in § 3 .
Black dots are boundary vertices.
Rapidities and spin parameters are indicated next to the incoming edges. At a boundary vertex, an incoming rapidity x x x becomes x − 1 x^{-1} x − 1 on the reflected edge. We omit rapidity and spin labels when their values are 1 1 1 .
[
scale=.75,
baseline={([yshift=-.5ex]current bounding box.center)}
]
\draw[paper wire,->]
(0,2)--(1,1.1)--(2,.2)--(4.35,.2);
\draw[paper wire,->]
(0,.2)--(1,1.1)--(2,2)--(4.35,2);
\draw[paper wire,->]
(3.4,-.3)--(3.4,2.5);
\node[left=2pt] at (0,2) {\scriptsize $i_1$};
\node[left=18pt] at (0,2) {\scriptsize $u^{-1}$};
\node[left=2pt] at (0,.2) {\scriptsize $i_2$};
\node[left=18pt] at (0,.2) {\scriptsize $v^{-1}$};
\node[below=2pt] at (3.4,-.3) {\scriptsize $i_3$};
\node[below=16pt] at (3.4,-.3) {\scriptsize $w$};
\node[right] at (4.35,.2) {\scriptsize $k_1$};
\node[right] at (4.35,2) {\scriptsize $k_2$};
\node[above] at (3.4,2.5) {\scriptsize $k_3$};= = =
[
scale=.75,
baseline={([yshift=-.5ex]current bounding box.center)}
]
\draw[paper wire,->]
(0,2)--(2.4,2)--(3.3,1.1)--(4.35,.2);
\draw[paper wire,->]
(0,.2)--(2.4,.2)--(3.3,1.1)--(4.35,2);
\draw[paper wire,->]
(1,-.3)--(1,2.5);
\node[left=2pt] at (0,2) {\scriptsize $i_1$};
\node[left=18pt] at (0,2) {\scriptsize $u^{-1}$};
\node[left=2pt] at (0,.2) {\scriptsize $i_2$};
\node[left=18pt] at (0,.2) {\scriptsize $v^{-1}$};
\node[below=2pt] at (1,-.3) {\scriptsize $i_3$};
\node[below=16pt] at (1,-.3) {\scriptsize $w$};
\node[right] at (4.35,.2) {\scriptsize $k_1$};
\node[right] at (4.35,2) {\scriptsize $k_2$};
\node[above] at (1,2.5) {\scriptsize $k_3$};Figure 5. The Yang–Baxter equation.
The standard fusion procedure extends the colored six-vertex model by allowing multiple arrows on each edge; see, for example, [70 , 61 , 85 , 63 , 82 ] . An edge obtained by fusing N N N lines carries an arrow configuration A = ( A 1 , … , A n ) ∈ Z ≥ 0 n A=(A_1,\ldots,A_n)\in\mathbb Z_{\ge0}^n A = ( A 1 , … , A n ) ∈ Z ≥ 0 n , where A i A_i A i is the number of arrows of color i i i . We write ∣ A ∣ : = A 1 + ⋯ + A n ≤ N |A|:=A_1+\cdots+A_n\le N ∣ A ∣ := A 1 + ⋯ + A n ≤ N and set A 0 : = N − ∣ A ∣ A_0:=N-|A| A 0 := N − ∣ A ∣ , the number of holes. The configuration consisting of a single arrow of color i i i is denoted by E i E_i E i , while E 0 E_0 E 0 denotes the empty configuration:
E 0 : = 0 , ( E i ) j : = 1 { i = j } , 1 ≤ i , j ≤ n . E_0:=0,\qquad (E_i)_j:=\mathbf1_{\{i=j\}},\qquad 1\le i,j\le n. E 0 := 0 , ( E i ) j := 1 { i = j } , 1 ≤ i , j ≤ n .
Before fusion, the colors on the N N N individual lines form a word c = ( c 1 , … , c N ) ∈ C n N \boldsymbol c=(c_1,\ldots,c_N)\in\mathcal C_n^N c = ( c 1 , … , c N ) ∈ C n N . Its corresponding arrow configuration is
∣ c ∣ : = ( ∣ c ∣ 1 , … , ∣ c ∣ n ) , ∣ c ∣ i : = # { r : c r = i } , 1 ≤ i ≤ n . |\boldsymbol c|:=(|\boldsymbol c|_1,\ldots,|\boldsymbol c|_n),\qquad
|\boldsymbol c|_i:=\#\{r:c_r=i\},\qquad 1\le i\le n. ∣ c ∣ := ( ∣ c ∣ 1 , … , ∣ c ∣ n ) , ∣ c ∣ i := # { r : c r = i } , 1 ≤ i ≤ n .
Thus we use bold lowercase letters for words and uppercase letters for arrow configurations.
To construct the fused weights, we average over incoming words with a fixed arrow configuration according to a q q q -exchangeable law. This law assigns each word a weight determined by its number of inversions with respect to the priority order:
inv ≻ ( c ) : = # { ( r , s ) : 1 ≤ r < s ≤ N , c r ≻ c s } . \operatorname{inv}_{\succ}(\boldsymbol c)
:=\#\{(r,s):1\le r<s\le N,\ c_r\succ c_s\}. inv ≻ ( c ) := # {( r , s ) : 1 ≤ r < s ≤ N , c r ≻ c s } .
For a fixed arrow configuration A A A , the normalizing constant is the q q q -multinomial coefficient
[ N A 0 , A 1 , … , A n ] q : = ( q ; q ) N ∏ i = 0 n ( q ; q ) A i . \begin{bmatrix}N\\A_0,A_1,\ldots,A_n\end{bmatrix}_{\!q}
:=\frac{(q;q)_N}{\prod_{i=0}^n(q;q)_{A_i}}. [ N A 0 , A 1 , … , A n ] q := ∏ i = 0 n ( q ; q ) A i ( q ; q ) N .
The q q q -exchangeable law on words with arrow configuration A A A is therefore
π N , A ( c ) : = q inv ≻ ( c ) [ N A 0 , A 1 , … , A n ] q 1 { ∣ c ∣ = A } . \begin{equation}
\pi_{N,A}(\boldsymbol c)
:=\frac{q^{\operatorname{inv}_{\succ}(\boldsymbol c)}}
{\begin{bmatrix}N\\A_0,A_1,\ldots,A_n\end{bmatrix}_{\!q}}
\mathbf1_{\{|\boldsymbol c|=A\}}. \tag*{(2.17)}
\end{equation} π N , A ( c ) := [ N A 0 , A 1 , … , A n ] q q inv ≻ ( c ) 1 { ∣ c ∣ = A } . (2.17)
Fix L , M ≥ 1 L,M\ge1 L , M ≥ 1 . Place L L L vertical lines and M M M horizontal lines in a rectangle (see Figure 6a ). Let x x x be the rapidity of the rightmost column and y y y that of the top row, and set z = x / y z=x/y z = x / y as above. The vertical rapidities, from left to right, are q L − 1 x , q L − 2 x , … , x , q^{L-1}x,q^{L-2}x,\ldots,x, q L − 1 x , q L − 2 x , … , x , and the horizontal rapidities, from top to bottom, are y , q − 1 y , … , q 1 − M y . y,q^{-1}y,\ldots,q^{1-M}y. y , q − 1 y , … , q 1 − M y . Thus the vertex in row r r r , counted from the top, and column c c c , counted from the left, has spectral parameter q L + r − c − 1 z . q^{L+r-c-1}z. q L + r − c − 1 z .
[
x=.72cm,y=.72cm,
every node/.style={font=\scriptsize}
]
\foreach \x in {1,2,3,4,5}
{\draw[paper wire,->] (\x,0)--(\x,5.7);}
\foreach \y in {1,2,3,4,5}
{\draw[paper wire,->] (0,\y)--(5.7,\y);}
\node[below] at (1,0) {$a_1$};
\node[below] at (2,0) {$a_2$};
\node at (3,-.2) {$\cdots$};
\node at (4,-.2) {$\cdots$};
\node[below] at (5,0) {$a_L$};
\node[below=6mm,xshift=-2mm] at (1,0) {$q^{L-1}x$};
\node[below=6mm,xshift=2mm] at (2,0) {$q^{L-2}x$};
\node[below=6mm,xshift=5mm] at (3.2,0) {$\cdots$};
\node[below=6mm] at (5,0) {$x$};
\node[left] at (0,5) {$b_1$};
\node[left] at (0,4) {$b_2$};
\node at (-.25,3) {$\vdots$};
\node at (-.25,2) {$\vdots$};
\node[left] at (0,1) {$b_M$};
\node[left=6mm] at (0,5) {$y$};
\node[left=6mm] at (0,4) {$q^{-1}y$};
\node[left=6mm] at (0,2.5) {$\vdots$};
\node[left=6mm] at (0,1) {$q^{1-M}y$};
\node[above] at (1,5.7) {$c_1$};
\node[above] at (2,5.7) {$c_2$};
\node at (3,5.9) {$\cdots$};
\node at (4,5.9) {$\cdots$};
\node[above] at (5,5.7) {$c_L$};
\node[right] at (5.7,5) {$d_1$};
\node[right] at (5.7,4) {$d_2$};
\node at (5.95,3) {$\vdots$};
\node at (5.95,2) {$\vdots$};
\node[right] at (5.7,1) {$d_M$};(a) The vertex model for the bulk fusion.
[
x=.72cm,y=.72cm,
every node/.style={font=\scriptsize}
]
\foreach \r in {1,...,5}{
\draw[paper wire,->]
(\r,0)--(\r,\r)
node[paper boundary] {}
--(5.7,\r);
}
\node[below] at (1,0) {$a_1$};
\node[below] at (2,0) {$a_2$};
\node at (3,-.2) {$\cdots$};
\node at (4,-.2) {$\cdots$};
\node[below] at (5,0) {$a_L$};
\node[below=6mm,xshift=-2mm] at (1,0) {$q^{L-1}x$};
\node[below=6mm,xshift=2mm] at (2,0) {$q^{L-2}x$};
\node[below=6mm,xshift=5mm] at (3,0) {$\cdots$};
\node[below=6mm] at (5,0) {$x$};
\node[right] at (5.7,1) {$b_L$};
\node[right] at (5.7,2) {$b_{L-1}$};
\node[right] at (5.7,3) {$\vdots$};
\node[right] at (5.7,4) {$\vdots$};
\node[right] at (5.7,5) {$b_1$};(b) The vertex model for the boundary fusion.
Figure 6. The vertex model used in finite bulk and boundary fusion with explicit rapidities.
For boundary words a , c ∈ C n L \boldsymbol a,\boldsymbol c\in\mathcal C_n^L a , c ∈ C n L and b , d ∈ C n M \boldsymbol b,\boldsymbol d\in\mathcal C_n^M b , d ∈ C n M , read in the orders shown in Figure 6a , let
Z z L , M ( a , b ; c , d ) \mathcal Z_z^{L,M}
(\boldsymbol a,\boldsymbol b;\boldsymbol c,\boldsymbol d) Z z L , M ( a , b ; c , d )
denote the partition function of the rectangle.
Definition 2.8. Let A , C ∈ Z ≥ 0 n A,C\in\mathbb Z_{\ge0}^n A , C ∈ Z ≥ 0 n satisfy ∣ A ∣ , ∣ C ∣ ≤ L |A|,|C|\le L ∣ A ∣ , ∣ C ∣ ≤ L , and let B , D ∈ Z ≥ 0 n B,D\in\mathbb Z_{\ge0}^n B , D ∈ Z ≥ 0 n satisfy ∣ B ∣ , ∣ D ∣ ≤ M |B|,|D|\le M ∣ B ∣ , ∣ D ∣ ≤ M . Assume that A + B = C + D . A+B=C+D. A + B = C + D . Define W z L , M ( A , B ; C , D ) : = ∑ ∣ a ∣ = A , ∣ b ∣ = B ∣ c ∣ = C , ∣ d ∣ = D π L , A ( a ) π M , B ( b ) Z z L , M ( a , b ; c , d ) .
W_z^{L,M}(A,B;C,D)
:=
\sum_{\substack{
|\boldsymbol a|=A,\ |\boldsymbol b|=B\\
|\boldsymbol c|=C,\ |\boldsymbol d|=D}}
\pi_{L,A}(\boldsymbol a)\pi_{M,B}(\boldsymbol b)
\mathcal Z_z^{L,M}
(\boldsymbol a,\boldsymbol b;\boldsymbol c,\boldsymbol d).
W z L , M ( A , B ; C , D ) := ∑ ∣ a ∣ = A , ∣ b ∣ = B ∣ c ∣ = C , ∣ d ∣ = D π L , A ( a ) π M , B ( b ) Z z L , M ( a , b ; c , d ) . When A + B ≠ C + D A+B\ne C+D A + B = C + D , set W z L , M ( A , B ; C , D ) = 0 W_z^{L,M}(A,B;C,D)=0 W z L , M ( A , B ; C , D ) = 0 .
The following identity shows that q q q -exchangeability is preserved under fusion.
Proposition 2.9. Let A , C ∈ Z ≥ 0 n A,C\in\mathbb Z_{\ge0}^n A , C ∈ Z ≥ 0 n satisfy ∣ A ∣ , ∣ C ∣ ≤ L |A|,|C|\le L ∣ A ∣ , ∣ C ∣ ≤ L , and let B , D ∈ Z ≥ 0 n B,D\in\mathbb Z_{\ge0}^n B , D ∈ Z ≥ 0 n satisfy ∣ B ∣ , ∣ D ∣ ≤ M |B|,|D|\le M ∣ B ∣ , ∣ D ∣ ≤ M . For c ∈ C n L \boldsymbol c\in\mathcal C_n^L c ∈ C n L and d ∈ C n M \boldsymbol d\in\mathcal C_n^M d ∈ C n M with ∣ c ∣ = C |\boldsymbol c|=C ∣ c ∣ = C and ∣ d ∣ = D |\boldsymbol d|=D ∣ d ∣ = D , we have ∑ ∣ a ∣ = A ∣ b ∣ = B π L , A ( a ) π M , B ( b ) Z z L , M ( a , b ; c , d ) = W z L , M ( A , B ; C , D ) π L , C ( c ) π M , D ( d ) .
\sum_{\substack{|\boldsymbol a|=A\\|\boldsymbol b|=B}}
\pi_{L,A}(\boldsymbol a)\pi_{M,B}(\boldsymbol b)
\mathcal Z_z^{L,M}
(\boldsymbol a,\boldsymbol b;\boldsymbol c,\boldsymbol d)
=
W_z^{L,M}(A,B;C,D)
\pi_{L,C}(\boldsymbol c)\pi_{M,D}(\boldsymbol d).
∑ ∣ a ∣ = A ∣ b ∣ = B π L , A ( a ) π M , B ( b ) Z z L , M ( a , b ; c , d ) = W z L , M ( A , B ; C , D ) π L , C ( c ) π M , D ( d ) .
The fused weight has an explicit expression in terms of q q q -Hahn weights. For U , V ∈ Z ≥ 0 n U,V\in\mathbb Z_{\ge0}^n U , V ∈ Z ≥ 0 n , write U ≤ V U\leq V U ≤ V for coordinatewise inequality. When U ≤ V U\leq V U ≤ V , set
Φ q ( U , V ; x , y ) : = ( y x ) ∣ U ∣ ( x ; q ) ∣ U ∣ ( y / x ; q ) ∣ V ∣ − ∣ U ∣ ( y ; q ) ∣ V ∣ q ∑ 1 ≤ i < j ≤ n U i ( V j − U j ) ∏ i = 1 n [ V i U i ] q . \begin{equation}
\Phi_q(U,V;x,y):=
\left(\frac yx\right)^{|U|}
\frac{(x;q)_{|U|}(y/x;q)_{|V|-|U|}}{(y;q)_{|V|}}
q^{\sum_{1\le i<j\le n}U_i(V_j-U_j)}
\prod_{i=1}^n
\begin{bmatrix}V_i\\U_i\end{bmatrix}_{\!q}. \tag*{(2.20)}
\end{equation} Φ q ( U , V ; x , y ) := ( x y ) ∣ U ∣ ( y ; q ) ∣ V ∣ ( x ; q ) ∣ U ∣ ( y / x ; q ) ∣ V ∣ − ∣ U ∣ q ∑ 1 ≤ i < j ≤ n U i ( V j − U j ) i = 1 ∏ n [ V i U i ] q . (2.20)
Set Φ q ( U , V ; x , y ) = 0 \Phi_q(U,V;x,y)=0 Φ q ( U , V ; x , y ) = 0 otherwise.
Proposition 2.10. W z L , M ( A , B ; C , D ) = 1 { A + B = C + D } ( q 1 − M z ) ∣ D ∣ − ∣ B ∣ q M ∣ A ∣ − L ∣ D ∣ ∑ 0 ≤ P ≤ B ∧ C Φ q ( C − P , C + D − P ; q 1 − L z , q 1 − L − M z ) Φ q ( P , B ; z q , q − M ) . \begin{aligned}
W_z^{L,M}(A,B;C,D)
&=\mathbf1_{\{A+B=C+D\}}
\left(\frac{q^{1-M}}z\right)^{|D|-|B|}
q^{M|A|-L|D|}
\sum_{0\le P\le B\wedge C}
\notag\\
&\quad
\Phi_q\left(
C-P,C+D-P;
\frac{q^{1-L}}z,\frac{q^{1-L-M}}z
\right)
\Phi_q\left(P,B;\frac zq,q^{-M}\right).
\end{aligned} W z L , M ( A , B ; C , D ) = 1 { A + B = C + D } ( z q 1 − M ) ∣ D ∣ − ∣ B ∣ q M ∣ A ∣ − L ∣ D ∣ 0 ≤ P ≤ B ∧ C ∑ Φ q ( C − P , C + D − P ; z q 1 − L , z q 1 − L − M ) Φ q ( P , B ; q z , q − M ) . Here 0 ≤ P ≤ B ∧ C 0\le P\le B\wedge C 0 ≤ P ≤ B ∧ C means 0 ≤ P i ≤ min ( B i , C i ) 0\le P_i\le\min(B_i,C_i) 0 ≤ P i ≤ min ( B i , C i ) for every i i i . Moreover, ∑ C , D W z L , M ( A , B ; C , D ) = 1. \sum_{C,D}W_z^{L,M}(A,B;C,D)=1. ∑ C , D W z L , M ( A , B ; C , D ) = 1.
Fix 0 < q < 1 0<q<1 0 < q < 1 . For fixed arrow configurations A , B , C , D A,B,C,D A , B , C , D , the explicit formula (2.21) depends rationally on q L q^L q L and q M q^M q M . We may therefore regard s 1 = q L , s 2 = q M s_1=q^L,s_2=q^M s 1 = q L , s 2 = q M as independent complex parameters associated with the vertical and horizontal edges, respectively. This leads to the following definition.
Definition 2.11. For A , B , C , D ∈ Z ≥ 0 n A,B,C,D\in\mathbb Z_{\ge0}^n A , B , C , D ∈ Z ≥ 0 n , define W z , s 1 , s 2 ( A , B ; C , D ) : = 1 { A + B = C + D } ( q s 2 z ) ∣ D ∣ − ∣ B ∣ s 2 ∣ A ∣ s 1 − ∣ D ∣ ∑ 0 ≤ P ≤ B ∧ C Φ q ( C − P , C + D − P ; q s 1 z , q s 1 s 2 z ) Φ q ( P , B ; z q , s 2 − 1 ) . \begin{aligned}
W_{z,s_1,s_2}(A,B;C,D)
&:=\mathbf1_{\{A+B=C+D\}}
\left(\frac q{s_2z}\right)^{|D|-|B|}
s_2^{|A|}s_1^{-|D|}
\sum_{0\le P\le B\wedge C}
\notag\\
&\quad
\Phi_q\left(C-P,C+D-P;
\frac q{s_1z},\frac q{s_1s_2z}\right)
\Phi_q\left(P,B;\frac zq,s_2^{-1}\right).
\end{aligned} W z , s 1 , s 2 ( A , B ; C , D ) := 1 { A + B = C + D } ( s 2 z q ) ∣ D ∣ − ∣ B ∣ s 2 ∣ A ∣ s 1 − ∣ D ∣ 0 ≤ P ≤ B ∧ C ∑ Φ q ( C − P , C + D − P ; s 1 z q , s 1 s 2 z q ) Φ q ( P , B ; q z , s 2 − 1 ) .
Rational identities satisfied by the finite-spin weights extend to these general parameters as well. Indeed, after clearing denominators, such an identity becomes a polynomial identity in s 1 , s 2 s_1,s_2 s 1 , s 2 , valid at ( s 1 , s 2 ) = ( q L , q M ) (s_1,s_2)=(q^L,q^M) ( s 1 , s 2 ) = ( q L , q M ) for any L , M L,M L , M . Since each variable independently takes infinitely many distinct values, the identity holds identically. Throughout this article, we refer to this argument as the standard analytic continuation procedure and use it without repeating the justification.
As a special case of the previous definition, when the horizontal edge carries a single color and the vertical edge carries a normally indexed fused state, we write
L z , s h o r : = W z , s , q . \begin{equation}
L^{\mathrm{hor}}_{z,s}:=W_{z,s,q}. \tag*{(2.23)}
\end{equation} L z , s hor := W z , s , q . (2.23)
For A = ( A 1 , … , A n ) A=(A_1,\ldots,A_n) A = ( A 1 , … , A n ) , write
∣ A ∣ : = ∑ r = 1 n A r , A [ k , ℓ ] : = ∑ r = k ℓ A r , A [ k , ℓ ] : = 0 if k > ℓ . |A|:=\sum_{r=1}^n A_r,
\qquad
A_{[k,\ell]}:=\sum_{r=k}^{\ell}A_r,
\qquad
A_{[k,\ell]}:=0\quad\text{if }k>\ell. ∣ A ∣ := r = 1 ∑ n A r , A [ k , ℓ ] := r = k ∑ ℓ A r , A [ k , ℓ ] := 0 if k > ℓ .
Figure 7 lists all six nonzero transition families and their weights.
Figure 7. The six nonzero transition families of L z , s h o r L^{\mathrm{hor}}_{z,s} L z , s hor . Here 1 ≤ k < ℓ ≤ n 1\le k<\ell\le n 1 ≤ k < ℓ ≤ n . A k ± : = A ± E k , A k ℓ + − : = A + E k − E ℓ . A_k^\pm:=A\pm E_k, A_{k\ell}^{+-}:=A+E_k-E_\ell. A k ± := A ± E k , A k ℓ +− := A + E k − E ℓ .
The fully fused colored stochastic weights used here originate from the stochastic R R R -matrix of Bosnjak-Mangazeev [64 ] ; see Borodin-Wheeler [63 Section 2 and Appendix C] for their vertex-model formulation.
Colored boundary weights and finite fusion
We begin with the unfused uncolored boundary weights of Garbali, de Gier, Mead, and Wheeler.
Definition 2.12 ([79 ] ). For i , j ∈ { 0 , 1 } i,j\in\{0,1\} i , j ∈ { 0 , 1 } , let K x a , c ( i ; j ) K_x^{a,c}(i;j) K x a , c ( i ; j ) denote the boundary weight with incoming state i i i and outgoing reflected state j j j , where a , c a,c a , c are boundary parameters. Set h a , c ( x ) : = a c ( 1 − x 2 ) ( a − x ) ( c − x ) .
h_{a,c}(x):=\frac{ac(1-x^2)}{(a-x)(c-x)}.
h a , c ( x ) := ( a − x ) ( c − x ) a c ( 1 − x 2 ) . The four boundary weights are K x a , c ( 0 ; 0 ) = 1 − h a , c ( x ) , K x a , c ( 0 ; 1 ) = h a , c ( x ) , K x a , c ( 1 ; 0 ) = − h a , c ( x ) a c , K x a , c ( 1 ; 1 ) = 1 + h a , c ( x ) a c . K_x^{a,c}(0;0)=1-h_{a,c}(x),
K_x^{a,c}(0;1)=h_{a,c}(x),
K_x^{a,c}(1;0)=-\frac{h_{a,c}(x)}{ac},
K_x^{a,c}(1;1)=1+\frac{h_{a,c}(x)}{ac}. K x a , c ( 0 ; 0 ) = 1 − h a , c ( x ) , K x a , c ( 0 ; 1 ) = h a , c ( x ) , K x a , c ( 1 ; 0 ) = − a c h a , c ( x ) , K x a , c ( 1 ; 1 ) = 1 + a c h a , c ( x ) .
Throughout this paper, we use the creation-only specialization c → ∞ c\to\infty c → ∞ . Write
K x ( i ; j ) : = lim c → ∞ K x a , c ( i ; j ) . K_x(i;j):=\lim_{c\to\infty}K_x^{a,c}(i;j). K x ( i ; j ) := c → ∞ lim K x a , c ( i ; j ) .
Taking this limit gives
K x ( 0 ; 0 ) = κ 0 ( x ) , K x ( 0 ; 1 ) = κ 1 ( x ) , K x ( 1 ; 0 ) = 0 , K x ( 1 ; 1 ) = 1 , K_x(0;0)=\kappa_0(x),\qquad
K_x(0;1)=\kappa_1(x),\qquad
K_x(1;0)=0,\qquad
K_x(1;1)=1, K x ( 0 ; 0 ) = κ 0 ( x ) , K x ( 0 ; 1 ) = κ 1 ( x ) , K x ( 1 ; 0 ) = 0 , K x ( 1 ; 1 ) = 1 ,
where
κ 0 ( x ) : = x ( a x − 1 ) a − x , κ 1 ( x ) : = a ( 1 − x 2 ) a − x . \begin{equation}
\kappa_0(x):=\frac{x(ax-1)}{a-x},
\qquad
\kappa_1(x):=\frac{a(1-x^2)}{a-x}. \tag*{(2.25)}
\end{equation} κ 0 ( x ) := a − x x ( a x − 1 ) , κ 1 ( x ) := a − x a ( 1 − x 2 ) . (2.25)
For the colored model, we allow every color other than 1 1 1 to be replaced by color 1 1 1 .
Definition 2.13. For i , j ∈ C n i,j\in\mathcal C_n i , j ∈ C n , define K x ( i ; j ) = { 1 , i = j = 1 , κ 0 ( x ) , i = j ≠ 1 , κ 1 ( x ) , i ≠ 1 , j = 1 , 0 , otherwise .
K_x(i;j)=
\begin{cases}
1, & i=j=1,\\[2pt]
\kappa_0(x), & i=j\ne1,\\[2pt]
\kappa_1(x), & i\ne1,\ j=1,\\[2pt]
0, & \text{otherwise}.
\end{cases}
K x ( i ; j ) = ⎩ ⎨ ⎧ 1 , κ 0 ( x ) , κ 1 ( x ) , 0 , i = j = 1 , i = j = 1 , i = 1 , j = 1 , otherwise . The boundary weights satisfy ∑ j ∈ C n K x ( i ; j ) = 1. \sum_{j\in\mathcal C_n}K_x(i;j)=1. ∑ j ∈ C n K x ( i ; j ) = 1.
A half space analog of the Yang-Baxter equation is the follwoing reflection equation:
Proposition 2.14 (Colored reflection equation). For any i , j , k , ℓ ∈ C n i,j,k,\ell\in\mathcal C_n i , j , k , ℓ ∈ C n , ∑ γ 1 , γ 2 , γ 3 , γ 4 ∈ C n R x / y ( i , j ; γ 1 , γ 2 ) K x ( γ 1 ; γ 3 ) R x y ( γ 2 , γ 3 ; γ 4 , k ) K y ( γ 4 ; ℓ ) = ∑ γ 1 , γ 2 , γ 3 , γ 4 ∈ C n K y ( j ; γ 1 ) R x y ( i , γ 1 ; γ 2 , γ 3 ) K x ( γ 2 ; γ 4 ) R x / y ( γ 3 , γ 4 ; ℓ , k ) . \begin{aligned}
&\sum_{\gamma_1,\gamma_2,\gamma_3,\gamma_4\in\mathcal C_n}
R_{x/y}(i,j;\gamma_1,\gamma_2)K_x(\gamma_1;\gamma_3)
R_{xy}(\gamma_2,\gamma_3;\gamma_4,k)K_y(\gamma_4;\ell)
\notag\\
&\qquad=
\sum_{\gamma_1,\gamma_2,\gamma_3,\gamma_4\in\mathcal C_n}
K_y(j;\gamma_1)R_{xy}(i,\gamma_1;\gamma_2,\gamma_3)
K_x(\gamma_2;\gamma_4)R_{x/y}(\gamma_3,\gamma_4;\ell,k).
\end{aligned} γ 1 , γ 2 , γ 3 , γ 4 ∈ C n ∑ R x / y ( i , j ; γ 1 , γ 2 ) K x ( γ 1 ; γ 3 ) R x y ( γ 2 , γ 3 ; γ 4 , k ) K y ( γ 4 ; ℓ ) = γ 1 , γ 2 , γ 3 , γ 4 ∈ C n ∑ K y ( j ; γ 1 ) R x y ( i , γ 1 ; γ 2 , γ 3 ) K x ( γ 2 ; γ 4 ) R x / y ( γ 3 , γ 4 ; ℓ , k ) .
[
scale=.75,
baseline={([yshift=-.5ex]current bounding box.center)}
]
\draw[paper wire]
(4,1)--(3,1)--(1,0)--(0,.5);
\draw[paper wire,->]
(0,.5)--(3,2)--(4,2);
\draw[paper wire]
(4,0)--(3,0)--(0,2.5);
\draw[paper wire,->]
(0,2.5)--(1,3)--(4,3);
\node[paper boundary] at (0,.5) {};
\node[paper boundary] at (0,2.5) {};
\node[right=2pt] at (4,1) {$i$};
\node[right=17pt] at (4,1) {$x$};
\node[right=2pt] at (4,0) {$j$};
\node[right=17pt] at (4,0) {$y$};
\node[right] at (4,2) {$k$};
\node[right] at (4,3) {$\ell$};= = =
[
scale=.75,
baseline={([yshift=-.5ex]current bounding box.center)}
]
\draw[paper wire]
(4,1)--(3,1)--(0,2.5);
\draw[paper wire,->]
(0,2.5)--(1,3)--(3,2)--(4,2);
\draw[paper wire]
(4,0)--(1,0)--(0,.5);
\draw[paper wire,->]
(0,.5)--(3,3)--(4,3);
\node[paper boundary] at (0,.5) {};
\node[paper boundary] at (0,2.5) {};
\node[right=2pt] at (4,1) {$i$};
\node[right=17pt] at (4,1) {$x$};
\node[right=2pt] at (4,0) {$j$};
\node[right=17pt] at (4,0) {$y$};
\node[right] at (4,2) {$k$};
\node[right] at (4,3) {$\ell$};Figure 8. The reflection equation.
Fix L ≥ 1 L\ge1 L ≥ 1 . Place L L L vertical lines with rapidities q L − 1 x , q L − 2 x , … , x q^{L-1}x,q^{L-2}x,\ldots,x q L − 1 x , q L − 2 x , … , x , from left to right. Each line is reflected to the right at the diagonal boundary, where its rapidity is inverted. The r r r th line carries boundary weight K q L − r x K_{q^{L-r}x} K q L − r x , and its crossing with a reflected line s < r s<r s < r carries bulk weight R q 2 L − r − s x 2 R_{q^{2L-r-s}x^2} R q 2 L − r − s x 2 , following our column-to-row rapidity convention.
Let K x L ( a ; b ) \mathcal K_x^L(\boldsymbol a;\boldsymbol b) K x L ( a ; b ) denote the partition function of Figure 6b , where a = ( a 1 , … , a L ) \boldsymbol a=(a_1,\ldots,a_L) a = ( a 1 , … , a L ) is read from left to right along the bottom and b = ( b 1 , … , b L ) \boldsymbol b=(b_1,\ldots,b_L) b = ( b 1 , … , b L ) is read from top to bottom on the right.
Definition 2.15. For A , B ∈ Z ≥ 0 n A,B\in\mathbb Z_{\ge0}^n A , B ∈ Z ≥ 0 n , with ∣ A ∣ , ∣ B ∣ ≤ L |A|,|B|\le L ∣ A ∣ , ∣ B ∣ ≤ L , define K x L ( A ; B ) : = ∑ ( ∣ a ∣ , ∣ b ∣ ) = ( A , B ) π L , A ( a ) K x L ( a ; b ) .
K_x^L(A;B):=
\sum_{(|\boldsymbol a|,|\boldsymbol b|)=(A,B)}
\pi_{L,A}(\boldsymbol a)
\mathcal K_x^L(\boldsymbol a;\boldsymbol b).
K x L ( A ; B ) := ∑ ( ∣ a ∣ , ∣ b ∣ ) = ( A , B ) π L , A ( a ) K x L ( a ; b ) .
As in bulk fusion, conditioning on the outgoing arrow configuration B B B leaves a q q q -exchangeable word.
Proposition 2.16. For arrow configurations A , B A,B A , B with ∣ A ∣ , ∣ B ∣ ≤ L |A|,|B|\leq L ∣ A ∣ , ∣ B ∣ ≤ L and every outgoing word b \boldsymbol b b with ∣ b ∣ = B |\boldsymbol b|=B ∣ b ∣ = B , we have ∑ ∣ a ∣ = A π L , A ( a ) K x L ( a ; b ) = K x L ( A ; B ) π L , B ( b ) .
\sum_{|\boldsymbol a|=A}
\pi_{L,A}(\boldsymbol a)
\mathcal K_x^L(\boldsymbol a;\boldsymbol b)
=
K_x^L(A;B)\pi_{L,B}(\boldsymbol b).
∑ ∣ a ∣ = A π L , A ( a ) K x L ( a ; b ) = K x L ( A ; B ) π L , B ( b ) . The same q q q -exchangeability property allows us to fuse the L L L incoming lines and their reflected lines. The resulting boundary vertex is described by the numbers of incoming and outgoing arrows of each color. Its weight is K x L ( A ; B ) K_x^L(A;B) K x L ( A ; B ) , where A A A and B B B are the incoming and outgoing arrow configurations, respectively.
To state the explicit weight, put
A 0 : = L − ∣ A ∣ , B 0 : = L − ∣ B ∣ , T : = L − B 1 = B 0 + ∑ i = 2 n B i , A_0:=L-|A|,
\qquad
B_0:=L-|B|,
\qquad
T:=L-B_1=B_0+\sum_{i=2}^nB_i, A 0 := L − ∣ A ∣ , B 0 := L − ∣ B ∣ , T := L − B 1 = B 0 + i = 2 ∑ n B i ,
and
Ξ ( A , B ) : = ∑ 2 ≤ i < j ≤ n ( A i − B i ) B j + ∑ i = 2 n ( A i − B i ) B 0 . \begin{equation}
\Xi(A,B)
:=\sum_{2\le i<j\le n}(A_i-B_i)B_j
+\sum_{i=2}^n(A_i-B_i)B_0. \tag*{(2.30)}
\end{equation} Ξ ( A , B ) := 2 ≤ i < j ≤ n ∑ ( A i − B i ) B j + i = 2 ∑ n ( A i − B i ) B 0 . (2.30)
Proposition 2.17. The weight vanishes unless B r ≤ A r B_r\le A_r B r ≤ A r for every r ∈ { 0 , 2 , … , n } r\in\{0,2,\ldots,n\} r ∈ { 0 , 2 , … , n } . On this support, K x L ( A ; B ) = q A 1 T + ( T 2 ) + Ξ ( A , B ) ( − x a ) T ( a x ; q ) T ( q A 1 + T x 2 ; q ) L − A 1 − T ( q A 1 x / a ; q ) L − A 1 ∏ r ∈ { 0 , 2 , … , n } [ A r B r ] q .
K_x^L(A;B)=
q^{A_1T+\binom T2+\Xi(A,B)}
\left(-\frac xa\right)^T
\frac{(ax;q)_T(q^{A_1+T}x^2;q)_{L-A_1-T}}
{(q^{A_1}x/a;q)_{L-A_1}}
\prod_{r\in\{0,2,\ldots,n\}}
\begin{bmatrix}A_r\\B_r\end{bmatrix}_{\!q}.
K x L ( A ; B ) = q A 1 T + ( 2 T ) + Ξ ( A , B ) ( − a x ) T ( q A 1 x / a ; q ) L − A 1 ( a x ; q ) T ( q A 1 + T x 2 ; q ) L − A 1 − T ∏ r ∈ { 0 , 2 , … , n } [ A r B r ] q . Moreover, the sum to one property is satisfied ∑ B K x L ( A ; B ) = 1. \sum_BK_x^L(A;B)=1. ∑ B K x L ( A ; B ) = 1.
Vertex model realization of Martin’s construction
Aggarwal, Nicoletti, and Petrov obtained Martin’s construction from the colored fused vertex model; see [50 Sections 2.4 and 7.1] . An important notion in their work is the following queue specialization.
Lemma 2.19. Assume A r = A r ′ = 0 A_r=A'_r=0 A r = A r ′ = 0 for r > m r>m r > m . Fix the coordinates of A , A ′ A,A' A , A ′ away from m m m , and let their m m m th coordinates be finite during the limiting procedure. For i , j ∈ { 0 , … , m } i,j\in\{0,\ldots,m\} i , j ∈ { 0 , … , m } , impose color conservation in the form A m ′ = A m + 1 { i = m } − 1 { j = m } A'_m=A_m+\mathbf1_{\{i=m\}}-\mathbf1_{\{j=m\}} A m ′ = A m + 1 { i = m } − 1 { j = m } . Then, as A m → ∞ A_m\to\infty A m → ∞ , both vertical states contain infinitely many arrows of color m m m , and the limit W z , s ( m ) ( A , i ; A ′ , j ) : = lim A m → ∞ L z , s h o r ( A , i ; A ′ , j )
\mathbb W^{(m)}_{z,s}(A,i;A',j)
:=\lim_{A_m\to\infty}
L^{\mathrm{hor}}_{z,s}(A,i;A',j)
W z , s ( m ) ( A , i ; A ′ , j ) := lim A m → ∞ L z , s hor ( A , i ; A ′ , j ) exists. All nonzero values belong to the following six families: W z , s ( m ) ( A , 0 ; A , 0 ) = − s z 1 − s z , W z , s ( m ) ( A , k ; A + E k , 0 ) = − s z 1 − s z , W z , s ( m ) ( A , k ; A , k ) = q A [ 1 , k − 1 ] ( 1 − z q A k ) 1 − s z , W z , s ( m ) ( A , 0 ; A − E k , k ) = q A [ 1 , k − 1 ] ( 1 − q A k ) 1 − s z , W z , s ( m ) ( A , k ; A + E k − E ℓ , ℓ ) = z q A [ 1 , ℓ − 1 ] ( 1 − q A ℓ ) 1 − s z , W z , s ( m ) ( A , ℓ ; A + E ℓ − E k , k ) = q A [ 1 , k − 1 ] ( 1 − q A k ) 1 − s z .
\begin{alignedat}{2}
\mathbb W^{(m)}_{z,s}(A,0;A,0)
&=\frac{-sz}{1-sz},
&\qquad
\mathbb W^{(m)}_{z,s}(A,k;A+E_k,0)
&=\frac{-sz}{1-sz},
\\[2mm]
\mathbb W^{(m)}_{z,s}(A,k;A,k)
&=\frac{q^{A_{[1,k-1]}}(1-zq^{A_k})}{1-sz},
&
\mathbb W^{(m)}_{z,s}(A,0;A-E_k,k)
&=\frac{q^{A_{[1,k-1]}}(1-q^{A_k})}{1-sz},
\\[2mm]
\mathbb W^{(m)}_{z,s}
(A,k;A+E_k-E_\ell,\ell)
&=\frac{zq^{A_{[1,\ell-1]}}(1-q^{A_\ell})}{1-sz},
&
\mathbb W^{(m)}_{z,s}
(A,\ell;A+E_\ell-E_k,k)
&=\frac{q^{A_{[1,k-1]}}(1-q^{A_k})}{1-sz}.
\end{alignedat}
W z , s ( m ) ( A , 0 ; A , 0 ) W z , s ( m ) ( A , k ; A , k ) W z , s ( m ) ( A , k ; A + E k − E ℓ , ℓ ) = 1 − sz − sz , = 1 − sz q A [ 1 , k − 1 ] ( 1 − z q A k ) , = 1 − sz z q A [ 1 , ℓ − 1 ] ( 1 − q A ℓ ) , W z , s ( m ) ( A , k ; A + E k , 0 ) W z , s ( m ) ( A , 0 ; A − E k , k ) W z , s ( m ) ( A , ℓ ; A + E ℓ − E k , k ) = 1 − sz − sz , = 1 − sz q A [ 1 , k − 1 ] ( 1 − q A k ) , = 1 − sz q A [ 1 , k − 1 ] ( 1 − q A k ) . Here 1 ≤ k < ℓ ≤ m 1\leq k<\ell\leq m 1 ≤ k < ℓ ≤ m . For each incoming state the weights sum to one.
Proof. Take A m → ∞ A_m\to\infty A m → ∞ in the six weights of Figure 7 . For 0 < q < 1 0<q<1 0 < q < 1 , one has q A m → 0 q^{A_m}\to0 q A m → 0 , so this gives (2.33) . ◻
Definition 2.20. Fix N ≥ 1 N\geq1 N ≥ 1 and parameters s m < 0 s_m<0 s m < 0 , 0 < z m ≤ 1 0<z_m\leq1 0 < z m ≤ 1 , 1 ≤ m ≤ n 1\leq m\leq n 1 ≤ m ≤ n . The queue transfer matrix Q z , s N \mathfrak Q^N_{\mathbf z,\mathbf s} Q z , s N is the transfer operator of the vertex model with N N N rows and n n n columns in Figure 9 : every vertex in column m m m has weight W z m , s m ( m ) \mathbb W^{(m)}_{z_m,s_m} W z m , s m ( m ) , and each matrix element maps a bottom-and-left boundary configuration to a top-and-right boundary configuration and is obtained by summing the products of local weights over all internal edges. We write simply Q N \mathfrak Q^N Q N when the parameters are understood.
For the queue construction, put color 0 0 0 on every left boundary edge and the infinitely many arrows of color m E m ∞ E_m^\infty E m ∞ at the bottom of column m m m . Let Q m N Q_m^N Q m N be the state at the top of column m m m , and let d N ( i ) d^N(i) d N ( i ) be the color on the right boundary in row i i i , counted from the top. The operator together with these boundary data induces measure on the top and right boundary variables.
[
x=.82cm,
y=.74cm,
baseline={([yshift=-.5ex]current bounding box.center)},
every node/.style={font=\scriptsize}
]
\foreach \x in {1.35,2.90,4.45,7.60}
\draw[paper wire,->] (\x,-.45)--(\x,5.65);
\foreach \y in {.75,2.75,4.75}
\draw[paper normal,->] (8.45,\y)--(0,\y);
\node[paper label,anchor=south west] at (1.52,.87)
{$\mathbb W^{(1)}_{z_1,s_1}$};
\node[paper label,anchor=south west] at (3.07,2.87)
{$\mathbb W^{(2)}_{z_2,s_2}$};
\node[paper label,anchor=south east] at (7.43,4.87)
{$\mathbb W^{(n)}_{z_n,s_n}$};
\node[below=2pt] at (1.35,-.45) {$0$};
\node[below=2pt] at (2.90,-.45) {$0$};
\node[below=2pt] at (4.45,-.45) {$0$};
\node[below=2pt] at (6.03,-.45) {$\cdots$};
\node[below=2pt] at (7.60,-.45) {$0$};
\node[above=2pt] at (1.35,5.65) {$d^N(1)$};
\node[above=2pt] at (2.90,5.65) {$d^N(2)$};
\node[above=2pt] at (4.45,5.65) {$d^N(3)$};
\node[above=2pt] at (6.03,5.65) {$\cdots$};
\node[above=2pt] at (7.60,5.65) {$d^N(N)$};
\node[left=2pt] at (0,.75) {$Q_1^N$};
\node[left=2pt] at (0,2.75) {$Q_2^N$};
\node[left=2pt] at (0,3.75) {$\vdots$};
\node[left=2pt] at (0,4.75) {$Q_n^N$};
\node[right=2pt] at (8.45,.75)
{$E_1^\infty\;(z_1,s_1)$};
\node[right=2pt] at (8.45,2.75)
{$E_2^\infty\;(z_2,s_2)$};
\node[right=2pt] at (8.45,3.75)
{$\vdots$};
\node[right=2pt] at (8.45,4.75)
{$E_n^\infty\;(z_n,s_n)$};Figure 9. The vertex model Q N \mathfrak Q^N Q N . With the displayed empty bottom data and right-boundary E m ∞ E_m^\infty E m ∞ data, the model induces a probability measure on the top and left boundary once the stochastic condition is satisfied.
Proposition 2.21 ([50 ] , Proposition 7.4). Fix 0 < ρ 1 < ⋯ < ρ n < 1 0<\rho_1<\cdots<\rho_n<1 0 < ρ 1 < ⋯ < ρ n < 1 . For each finite N N N , specialize the vertex weights in Figure 9 by taking z m ↓ 0 , s m z m = − 1 − ρ m ρ m , 1 ≤ m ≤ n .
z_m\downarrow0,
\qquad
s_mz_m=-\frac{1-\rho_m}{\rho_m},
\qquad 1\leq m\leq n.
z m ↓ 0 , s m z m = − ρ m 1 − ρ m , 1 ≤ m ≤ n . The resulting vertex model realizes Martin’s construction with service densities ρ 1 , … , ρ n \rho_1,\ldots,\rho_n ρ 1 , … , ρ n .
More precisely, for every fixed ℓ ≥ 1 \ell\geq1 ℓ ≥ 1 , ( Q 1 N , … , Q n N , d N ( 1 ) , … , d N ( ℓ ) ) → N → ∞ d ( Q 1 , … , Q n , d ( 1 ) , … , d ( ℓ ) ) ,
\bigl(Q_1^N,\ldots,Q_n^N,d^N(1),\ldots,d^N(\ell)\bigr)
\xrightarrow[N\to\infty]{\mathrm d}
\bigl(Q_1,\ldots,Q_n,d(1),\ldots,d(\ell)\bigr),
( Q 1 N , … , Q n N , d N ( 1 ) , … , d N ( ℓ ) ) d N → ∞ ( Q 1 , … , Q n , d ( 1 ) , … , d ( ℓ ) ) , where the limit consists of the stationary queue states and their departure process in Martin’s construction. The limiting departure process has the stationary full-space n n n -species ASEP law.
For n = 2 n=2 n = 2 , the limiting first-class queue length in the second column satisfies Q 2 ( 1 ) ∼ q - P o i ( r 12 ) .
Q_2(1)\sim q\text{-}\mathrm{Poi}(r_{12}).
Q 2 ( 1 ) ∼ q - Poi ( r 12 ) .
Hole-indexed continuation of boundary and bulk weights
To construct stationary measures for the multispecies ASEP on the half-line, we use a hole-indexed analytic continuation of the finite fused bulk and boundary weights. On the reflected lines, this continuation keeps the occupations of colors 0 , 2 , … , n 0,2,\ldots,n 0 , 2 , … , n fixed, with color 1 1 1 treated as the implicit background. Related constructions involving dual vertex weights, fusion, and analytic continuation appear, e.g., in Borodin-Wheeler [62 ] and Bufetov-Mucciconi-Petrov [68 ] . In this section, we derive explicit formulas for the continued weights, establish nonnegativity and the sum-to-one property for the boundary and spin-one bulk weights, and show that the continued weights satisfy the Yang-Baxter and reflection equations. These weights and identities will be used in § 4 to obtain the queue specialization and construct the stationary measures.
Set
C ^ n : = C n ∖ { 1 } . \widehat{\mathcal C}_n:=\mathcal C_n\setminus\{1\}. C n := C n ∖ { 1 } .
A hole-indexed state is a vector H = ( H 0 , H 2 , … , H n ) ∈ Z ≥ 0 C ^ n H=(H_0,H_2,\ldots,H_n)
\in\mathbb Z_{\geq0}^{\widehat{\mathcal C}_n} H = ( H 0 , H 2 , … , H n ) ∈ Z ≥ 0 C n ; we define ∣ H ∣ : = H 0 + ∑ i = 2 n H i |H|:=H_0+\sum_{i=2}^n H_i ∣ H ∣ := H 0 + ∑ i = 2 n H i . For r ∈ C ^ n r\in\widehat{\mathcal C}_n r ∈ C n , let E ^ r \widehat E_r E r be the corresponding standard basis vector and set E ^ 1 : = 0 \widehat E_1:=0 E 1 := 0 . At finite capacity M M M , the state H H H represents the ordinary particle vector
( M − ∣ H ∣ , H 2 , … , H n ) . \begin{equation}
(M-|H|,H_2,\ldots,H_n). \tag*{(3.1)}
\end{equation} ( M − ∣ H ∣ , H 2 , … , H n ) . (3.1)
Thus the unrecorded coordinate is the number of color-1 1 1 arrows. When holes are listed separately, we refer to colors 2 , … , n 2,\ldots,n 2 , … , n as the weak colors.
Stochastic convention.
We take 0 < q < 1 0<q<1 0 < q < 1 , unless stated otherwise. For stochasticity statements in this and subsequent sections, we use the boundary parameter range
0 < x < 1 , a < 0 , s < 0 , 0 < s x a < 1 , \begin{equation}
0<x<1,\qquad a<0,\qquad s<0,\qquad 0<\frac{sx}{a}<1, \tag*{(3.2)}
\end{equation} 0 < x < 1 , a < 0 , s < 0 , 0 < a s x < 1 , (3.2)
and the spin-one bulk parameter range
s < 0 , 0 < z ≤ 1. \begin{equation}
s<0,\qquad 0<z\leq1. \tag*{(3.3)}
\end{equation} s < 0 , 0 < z ≤ 1. (3.3)
Continuation of the fused boundary weight
We continue the finite boundary weights recalled in Sub§ 2.4 , using the hole coordinates defined above.
The boundary maps a normally indexed state to a hole-indexed state. Write G = ( G 1 , … , G n ) G=(G_1,\ldots,G_n) G = ( G 1 , … , G n ) and H = ( H 0 , H 2 , … , H n ) H=(H_0,H_2,\ldots,H_n) H = ( H 0 , H 2 , … , H n ) . Define
N x , s K : = ( x 2 ; q ) ∞ ( s x / a ; q ) ∞ ( x / a ; q ) ∞ ( s x 2 ; q ) ∞ . \begin{equation}
\mathcal N^K_{x,s}
:=\frac{(x^2;q)_\infty(sx/a;q)_\infty}
{(x/a;q)_\infty(sx^2;q)_\infty}. \tag*{(3.4)}
\end{equation} N x , s K := ( x / a ; q ) ∞ ( s x 2 ; q ) ∞ ( x 2 ; q ) ∞ ( s x / a ; q ) ∞ . (3.4)
Proposition 3.1. For fixed G = ( G 1 , … , G n ) G=(G_1,\ldots,G_n) G = ( G 1 , … , G n ) and H = ( H 0 , H 2 , … , H n ) H=(H_0,H_2,\ldots,H_n) H = ( H 0 , H 2 , … , H n ) , consider, for L ≥ ∣ G ∣ + ∣ H ∣ L\geq |G|+|H| L ≥ ∣ G ∣ + ∣ H ∣ , the finite-spin boundary weights K x L ( G ; ( L − ∣ H ∣ , H 2 , … , H n ) ) . K_x^L\bigl(G;(L-|H|,H_2,\ldots,H_n)\bigr). K x L ( G ; ( L − ∣ H ∣ , H 2 , … , H n ) ) . Regarded as values at s = q L s=q^L s = q L , they admit an analytic continuation in s s s wherever the expression below is defined. The continued weight vanishes unless H i ≤ G i H_i\le G_i H i ≤ G i for 2 ≤ i ≤ n 2\le i\le n 2 ≤ i ≤ n ; on this support, it is given by K x , s ( G ; H ) = N x , s K ( x / a ; q ) G 1 ( a x ; q ) ∣ H ∣ ( q ∣ G ∣ / s ; q ) H 0 ( x 2 ; q ) G 1 + ∣ H ∣ ( q ; q ) H 0 ( s x a ) H 0 ( − x a ) H [ 2 , n ] × q ∑ j = 2 n ( G [ 1 , j − 1 ] H j + ( H j 2 ) ) ∏ i = 2 n [ G i H i ] q . \begin{aligned}
K_{x,s}(G;H)
&=\mathcal N^K_{x,s}
\frac{(x/a;q)_{G_1}(ax;q)_{|H|}(q^{|G|}/s;q)_{H_0}}
{(x^2;q)_{G_1+|H|}(q;q)_{H_0}}
\left(\frac{sx}{a}\right)^{H_0}
\left(-\frac xa\right)^{H_{[2,n]}}
\notag\\
&\quad\times q^{\sum_{j=2}^n\left(G_{[1,j-1]}H_j+\binom{H_j}{2}\right)}
\prod_{i=2}^n\begin{bmatrix}G_i\\H_i\end{bmatrix}_{\!q}.
\end{aligned} K x , s ( G ; H ) = N x , s K ( x 2 ; q ) G 1 + ∣ H ∣ ( q ; q ) H 0 ( x / a ; q ) G 1 ( a x ; q ) ∣ H ∣ ( q ∣ G ∣ / s ; q ) H 0 ( a s x ) H 0 ( − a x ) H [ 2 , n ] × q ∑ j = 2 n ( G [ 1 , j − 1 ] H j + ( 2 H j ) ) i = 2 ∏ n [ G i H i ] q . At s = q L s=q^L s = q L , with L ≥ ∣ G ∣ L\geq |G| L ≥ ∣ G ∣ , the weight vanishes if H 0 > L − ∣ G ∣ H_0>L-|G| H 0 > L − ∣ G ∣ .
Proof. Fix L ≥ ∣ G ∣ L\ge |G| L ≥ ∣ G ∣ and set B = ( L − ∣ H ∣ , H 2 , … , H n ) B=(L-|H|,H_2,\ldots,H_n) B = ( L − ∣ H ∣ , H 2 , … , H n ) , so that B 0 = H 0 B_0=H_0 B 0 = H 0 . On the support H 0 ≤ L − ∣ G ∣ H_0\le L-|G| H 0 ≤ L − ∣ G ∣ and H i ≤ G i H_i\le G_i H i ≤ G i for i ≥ 2 i\ge2 i ≥ 2 , we have G 1 + ∣ H ∣ ≤ L G_1+|H|\le L G 1 + ∣ H ∣ ≤ L . Substituting A = G A=G A = G and this B B B into Proposition 2.17 gives
K x L ( G ; B ) = q G 1 ∣ H ∣ + ( ∣ H ∣ 2 ) + Ξ ( G , B ) ( − x a ) ∣ H ∣ ( a x ; q ) ∣ H ∣ ( q G 1 + ∣ H ∣ x 2 ; q ) L − G 1 − ∣ H ∣ ( q G 1 x / a ; q ) L − G 1 [ L − ∣ G ∣ H 0 ] q ∏ i = 2 n [ G i H i ] q . \begin{equation}
K_x^L(G;B)=
q^{G_1|H|+\binom{|H|}{2}+\Xi(G,B)}
\left(-\frac xa\right)^{|H|}
\frac{(ax;q)_{|H|}(q^{G_1+|H|}x^2;q)_{L-G_1-|H|}}
{(q^{G_1}x/a;q)_{L-G_1}}
\begin{bmatrix}L-|G|\\H_0\end{bmatrix}_{\!q}
\prod_{i=2}^n
\begin{bmatrix}G_i\\H_i\end{bmatrix}_{\!q}. \tag*{(3.6)}
\end{equation} K x L ( G ; B ) = q G 1 ∣ H ∣ + ( 2 ∣ H ∣ ) + Ξ ( G , B ) ( − a x ) ∣ H ∣ ( q G 1 x / a ; q ) L − G 1 ( a x ; q ) ∣ H ∣ ( q G 1 + ∣ H ∣ x 2 ; q ) L − G 1 − ∣ H ∣ [ L − ∣ G ∣ H 0 ] q i = 2 ∏ n [ G i H i ] q . (3.6) First, the definition of Ξ \Xi Ξ and the identity B 0 = H 0 B_0=H_0 B 0 = H 0 imply
Ξ ( G , B ) = ∑ 2 ≤ i < j ≤ n ( G i − H i ) H j + H 0 ∑ i = 2 n ( G i − H i ) . \Xi(G,B)
=
\sum_{2\le i<j\le n}(G_i-H_i)H_j
+H_0\sum_{i=2}^n(G_i-H_i). Ξ ( G , B ) = 2 ≤ i < j ≤ n ∑ ( G i − H i ) H j + H 0 i = 2 ∑ n ( G i − H i ) . Consequently,
G 1 ∣ H ∣ + ( ∣ H ∣ 2 ) + Ξ ( G , B ) = ∣ G ∣ H 0 + ( H 0 2 ) + ∑ j = 2 n ( G [ 1 , j − 1 ] H j + ( H j 2 ) ) . \begin{equation}
G_1|H|+\binom{|H|}{2}+\Xi(G,B)
=|G|H_0+\binom{H_0}{2}
+\sum_{j=2}^n\left(G_{[1,j-1]}H_j+\binom{H_j}{2}\right). \tag*{(3.7)}
\end{equation} G 1 ∣ H ∣ + ( 2 ∣ H ∣ ) + Ξ ( G , B ) = ∣ G ∣ H 0 + ( 2 H 0 ) + j = 2 ∑ n ( G [ 1 , j − 1 ] H j + ( 2 H j ) ) . (3.7) Second,
[ L − ∣ G ∣ H 0 ] q q ∣ G ∣ H 0 + ( H 0 2 ) ( − x a ) H 0 = ( q ∣ G ∣ − L ; q ) H 0 ( q ; q ) H 0 ( q L x a ) H 0 . \begin{equation}
\begin{bmatrix}L-|G|\\H_0\end{bmatrix}_{\!q}
q^{|G|H_0+\binom{H_0}{2}}
\left(-\frac xa\right)^{H_0}
=
\frac{(q^{|G|-L};q)_{H_0}}{(q;q)_{H_0}}
\left(\frac{q^Lx}{a}\right)^{H_0}. \tag*{(3.8)}
\end{equation} [ L − ∣ G ∣ H 0 ] q q ∣ G ∣ H 0 + ( 2 H 0 ) ( − a x ) H 0 = ( q ; q ) H 0 ( q ∣ G ∣ − L ; q ) H 0 ( a q L x ) H 0 . (3.8) Finally,
N x , q L K = ( x 2 ; q ) L ( x / a ; q ) L , \mathcal N^K_{x,q^L}
=\frac{(x^2;q)_L}{(x/a;q)_L}, N x , q L K = ( x / a ; q ) L ( x 2 ; q ) L , and hence
( q G 1 + ∣ H ∣ x 2 ; q ) L − G 1 − ∣ H ∣ ( q G 1 x / a ; q ) L − G 1 = N x , q L K ( x / a ; q ) G 1 ( x 2 ; q ) G 1 + ∣ H ∣ . \begin{equation}
\frac{(q^{G_1+|H|}x^2;q)_{L-G_1-|H|}}
{(q^{G_1}x/a;q)_{L-G_1}}
=
\mathcal N^K_{x,q^L}
\frac{(x/a;q)_{G_1}}{(x^2;q)_{G_1+|H|}}. \tag*{(3.9)}
\end{equation} ( q G 1 x / a ; q ) L − G 1 ( q G 1 + ∣ H ∣ x 2 ; q ) L − G 1 − ∣ H ∣ = N x , q L K ( x 2 ; q ) G 1 + ∣ H ∣ ( x / a ; q ) G 1 . (3.9) Combining (3.6) – (3.9) gives (3.5) at s = q L s=q^L s = q L . The support and specialization claims follow immediately from (3.5) .
The apparent singularity at s = 0 s=0 s = 0 is removable, since
( q ∣ G ∣ / s ; q ) H 0 ( s x a ) H 0 = ( x a ) H 0 ∏ r = 0 H 0 − 1 ( s − q ∣ G ∣ + r ) . \begin{equation}
(q^{|G|}/s;q)_{H_0}
\left(\frac{sx}{a}\right)^{H_0}
=
\left(\frac xa\right)^{H_0}
\prod_{r=0}^{H_0-1}(s-q^{|G|+r}). \tag*{(3.10)}
\end{equation} ( q ∣ G ∣ / s ; q ) H 0 ( a s x ) H 0 = ( a x ) H 0 r = 0 ∏ H 0 − 1 ( s − q ∣ G ∣ + r ) . (3.10) The right-hand side of (3.5) is therefore analytic at the neighborhood of s = 0 s=0 s = 0 , and the standard analytic continuation procedure completes the proof. ◻
The following proposition establishes stochasticity of the continued boundary weights.
Proposition 3.2. Assume the boundary stochastic range (3.2) . Then, for every normally indexed state G G G , K x , s ( G ; H ) ≥ 0 , ∑ H K x , s ( G ; H ) = 1.
K_{x,s}(G;H)\geq0,
\qquad
\sum_{H}K_{x,s}(G;H)=1.
K x , s ( G ; H ) ≥ 0 , ∑ H K x , s ( G ; H ) = 1. The sum is absolutely convergent and locally uniformly convergent when s s s ranges over compact subsets of the pole-free domain ∣ s x / a ∣ < 1 |sx/a|<1 ∣ s x / a ∣ < 1 .
Proof. Nonnegativity follows directly from the signs of the factors in (3.5) . For fixed G G G , the weak output coordinates range over a finite set, while the weights decay geometrically in H 0 H_0 H 0 , locally uniformly on pole-free compact subsets of ∣ s x / a ∣ < 1 |sx/a|<1 ∣ s x / a ∣ < 1 . Together with the removable singularity at s = 0 s=0 s = 0 established above, this shows that the row sum is holomorphic. At s = q L s=q^L s = q L , for all sufficiently large L L L , it reduces to the finite-spin boundary sum, which equals one. The identity theorem therefore gives the sum-to-one property on the pole-free component containing zero, which contains the stated stochastic range. ◻
For the use in the boundary specializations below, we record the one- and two-color forms explicitly.
Example 3.3. For n = 1 n=1 n = 1 , write g : = G 1 g:=G_1 g := G 1 and h : = H 0 h:=H_0 h := H 0 . Then Proposition 3.1 gives K x , s ( g ; h ) = N x , s K ( x / a ; q ) g ( a x ; q ) h ( x 2 ; q ) g + h ( s x a ) h ( q g / s ; q ) h ( q ; q ) h , g , h ∈ Z ≥ 0 .
K_{x,s}(g;h)
=
\mathcal N^K_{x,s}
\frac{(x/a;q)_g(ax;q)_h}{(x^2;q)_{g+h}}
\left(\frac{sx}{a}\right)^h
\frac{(q^g/s;q)_h}{(q;q)_h},
\qquad g,h\in\mathbb Z_{\geq0}.
K x , s ( g ; h ) = N x , s K ( x 2 ; q ) g + h ( x / a ; q ) g ( a x ; q ) h ( a s x ) h ( q ; q ) h ( q g / s ; q ) h , g , h ∈ Z ≥ 0 .
Example 3.4. For n = 2 n=2 n = 2 , Proposition 3.1 reads K x , s ( ( G 1 , G 2 ) ; ( H 0 , H 2 ) ) = N x , s K ( x / a ; q ) G 1 ( a x ; q ) H 0 + H 2 ( x 2 ; q ) G 1 + H 0 + H 2 ( s x a ) H 0 ( − x a ) H 2 × q G 1 H 2 + ( H 2 2 ) [ G 2 H 2 ] q ( q G 1 + G 2 / s ; q ) H 0 ( q ; q ) H 0 . \begin{aligned}
K_{x,s}\bigl((G_1,G_2);(H_0,H_2)\bigr)
&=\mathcal N^K_{x,s}
\frac{(x/a;q)_{G_1}(ax;q)_{H_0+H_2}}
{(x^2;q)_{G_1+H_0+H_2}}
\left(\frac{sx}{a}\right)^{H_0}
\left(-\frac xa\right)^{H_2}
\notag\\
&\quad\times
q^{G_1H_2+\binom{H_2}{2}}
\begin{bmatrix}G_2\\H_2\end{bmatrix}_{\!q}
\frac{(q^{G_1+G_2}/s;q)_{H_0}}{(q;q)_{H_0}}.
\end{aligned} K x , s ( ( G 1 , G 2 ) ; ( H 0 , H 2 ) ) = N x , s K ( x 2 ; q ) G 1 + H 0 + H 2 ( x / a ; q ) G 1 ( a x ; q ) H 0 + H 2 ( a s x ) H 0 ( − a x ) H 2 × q G 1 H 2 + ( 2 H 2 ) [ G 2 H 2 ] q ( q ; q ) H 0 ( q G 1 + G 2 / s ; q ) H 0 .
The horizontal hole-index continuation
We next apply the hole-indexed continuation to the fused bulk weights.
Let
G = ( G 1 , … , G n ) , G ′ = ( G 1 ′ , … , G n ′ ) , H = ( H 0 , H 2 , … , H n ) , H ′ = ( H 0 ′ , H 2 ′ , … , H n ′ ) . G=(G_1,\ldots,G_n),
\quad
G'=(G'_1,\ldots,G'_n),
\quad
H=(H_0,H_2,\ldots,H_n),
\quad
H'=(H'_0,H'_2,\ldots,H'_n). G = ( G 1 , … , G n ) , G ′ = ( G 1 ′ , … , G n ′ ) , H = ( H 0 , H 2 , … , H n ) , H ′ = ( H 0 ′ , H 2 ′ , … , H n ′ ) .
Given P = ( P 1 , … , P n ) P=(P_1,\ldots,P_n) P = ( P 1 , … , P n ) , write p : = ∣ P ∣ p:=|P| p := ∣ P ∣ . Define
N z , s 1 , s 2 : = ( z ; q ) ∞ ( s 1 s 2 z ; q ) ∞ ( s 1 z ; q ) ∞ ( s 2 z ; q ) ∞ . \begin{equation}
\mathcal N_{z,s_1,s_2}
:=\frac{(z;q)_\infty(s_1s_2z;q)_\infty}
{(s_1z;q)_\infty(s_2z;q)_\infty}. \tag*{(3.14)}
\end{equation} N z , s 1 , s 2 := ( s 1 z ; q ) ∞ ( s 2 z ; q ) ∞ ( z ; q ) ∞ ( s 1 s 2 z ; q ) ∞ . (3.14)
Proposition 3.6. For fixed exterior states, the finite fused weights obtained from the finite-capacity representation (3.1) admit an analytic continuation in the spin variables, with s 1 = q L s_1=q^L s 1 = q L and s 2 = q M s_2=q^M s 2 = q M at finite spin. Denote this weight by W ^ z , s 1 , s 2 ( G , H ; G ′ , H ′ ) \widehat W_{z,s_1,s_2}
(G,H;G',H') W z , s 1 , s 2 ( G , H ; G ′ , H ′ ) . It vanishes unless G 1 + ∣ H ′ ∣ = G 1 ′ + ∣ H ∣ , G i + H i = G i ′ + H i ′ , 2 ≤ i ≤ n .
G_1+|H'|=G'_1+|H|,
\qquad
G_i+H_i=G'_i+H'_i,
\quad 2\le i\le n.
G 1 + ∣ H ′ ∣ = G 1 ′ + ∣ H ∣ , G i + H i = G i ′ + H i ′ , 2 ≤ i ≤ n . When (3.15) holds, it is given by W ^ z , s 1 , s 2 ( G , H ; G ′ , H ′ ) = N z , s 1 , s 2 ( s 1 z ) H 0 ′ ( q ; q ) H 0 ( q ; q ) H 0 ′ × ∑ P ( − 1 ) p + H 0 ′ q H 0 p + ( H 0 ′ 2 ) + ( p + 1 2 ) ( z / q ; q ) p ( z ; q ) H 0 + p × ( q 1 + ∣ G ∣ − H 0 − p s 1 z ; q ) H 0 ′ q ∑ 1 ≤ i < j ≤ n [ ( G i ′ − P i ) H j ′ + P i ( H j − P j ) ] × ( s 2 q 1 − ∣ H ′ ∣ ; q ) G 1 ′ − P 1 ( s 2 q 1 − ∣ H ∣ − P 1 ; q ) P 1 ( q ; q ) G 1 ′ − P 1 ( q ; q ) P 1 ∏ i = 2 n [ G i ′ + H i ′ − P i G i ′ − P i ] q [ H i P i ] q . \begin{aligned}
&\widehat W_{z,s_1,s_2}(G,H;G',H')
\notag\\
&\quad=\mathcal N_{z,s_1,s_2}
\left(s_1z\right)^{H'_0}
\frac{(q;q)_{H_0}}{(q;q)_{H'_0}}
\times\sum_{P}(-1)^{p+H'_0}
q^{H_0p+\binom{H'_0}{2}+\binom{p+1}{2}}
\frac{(z/q;q)_p}{(z;q)_{H_0+p}}
\notag\\
&\qquad\times
\left(\frac{q^{1+|G|-H_0-p}}{s_1z};q\right)_{H'_0}
q^{\sum_{1\le i<j\le n}\left[(G'_i-P_i)H'_j+P_i(H_j-P_j)\right]}
\notag\\
&\qquad\times
\frac{(s_2q^{1-|H'|};q)_{G'_1-P_1}
(s_2q^{1-|H|-P_1};q)_{P_1}}
{(q;q)_{G'_1-P_1}(q;q)_{P_1}}
\prod_{i=2}^n
\begin{bmatrix}G'_i+H'_i-P_i\\G'_i-P_i\end{bmatrix}_{\!q}
\begin{bmatrix}H_i\\P_i\end{bmatrix}_{\!q}.
\end{aligned} W z , s 1 , s 2 ( G , H ; G ′ , H ′ ) = N z , s 1 , s 2 ( s 1 z ) H 0 ′ ( q ; q ) H 0 ′ ( q ; q ) H 0 × P ∑ ( − 1 ) p + H 0 ′ q H 0 p + ( 2 H 0 ′ ) + ( 2 p + 1 ) ( z ; q ) H 0 + p ( z / q ; q ) p × ( s 1 z q 1 + ∣ G ∣ − H 0 − p ; q ) H 0 ′ q ∑ 1 ≤ i < j ≤ n [ ( G i ′ − P i ) H j ′ + P i ( H j − P j ) ] × ( q ; q ) G 1 ′ − P 1 ( q ; q ) P 1 ( s 2 q 1 − ∣ H ′ ∣ ; q ) G 1 ′ − P 1 ( s 2 q 1 − ∣ H ∣ − P 1 ; q ) P 1 i = 2 ∏ n [ G i ′ + H i ′ − P i G i ′ − P i ] q [ H i P i ] q . Here the finite sum is over 0 ≤ P 1 ≤ G 1 ′ , 0 ≤ P i ≤ min ( H i , G i ′ ) , 2 ≤ i ≤ n .
0\le P_1\le G'_1,
\qquad
0\le P_i\le\min(H_i,G'_i),
\quad 2\le i\le n.
0 ≤ P 1 ≤ G 1 ′ , 0 ≤ P i ≤ min ( H i , G i ′ ) , 2 ≤ i ≤ n .
Proof. Substitute
B = ( M − ∣ H ∣ , H 2 , … , H n ) , D = ( M − ∣ H ′ ∣ , H 2 ′ , … , H n ′ ) B=(M-|H|,H_2,\ldots,H_n),
\qquad
D=(M-|H'|,H'_2,\ldots,H'_n) B = ( M − ∣ H ∣ , H 2 , … , H n ) , D = ( M − ∣ H ′ ∣ , H 2 ′ , … , H n ′ ) into (2.21) . Its summation vector remains finite. The original first-coordinate bound is
P 1 ≤ min ( M − ∣ H ∣ , G 1 ′ ) . P_1\le\min(M-|H|,G'_1). P 1 ≤ min ( M − ∣ H ∣ , G 1 ′ ) . After the scalar factors have been rearranged, this range may be extended to P 1 ≤ G 1 ′ P_1\le G'_1 P 1 ≤ G 1 ′ : at s 2 = q M s_2=q^M s 2 = q M , every added term has
( s 2 q 1 − ∣ H ∣ − P 1 ; q ) P 1 = ( q M + 1 − ∣ H ∣ − P 1 ; q ) P 1 = 0. (s_2q^{1-|H|-P_1};q)_{P_1}
=(q^{M+1-|H|-P_1};q)_{P_1}=0. ( s 2 q 1 − ∣ H ∣ − P 1 ; q ) P 1 = ( q M + 1 − ∣ H ∣ − P 1 ; q ) P 1 = 0. For i ≥ 2 i\ge2 i ≥ 2 , the bound is P i ≤ min ( H i , G i ′ ) P_i\le\min(H_i,G'_i) P i ≤ min ( H i , G i ′ ) . The two color-order exponents and the associated Gaussian binomial coefficients give
q ∑ 1 ≤ i < j ≤ n [ ( G i ′ − P i ) H j ′ + P i ( H j − P j ) ] × ( q M + 1 − ∣ H ′ ∣ ; q ) G 1 ′ − P 1 ( q M + 1 − ∣ H ∣ − P 1 ; q ) P 1 ( q ; q ) G 1 ′ − P 1 ( q ; q ) P 1 ∏ i = 2 n [ G i ′ + H i ′ − P i G i ′ − P i ] q [ H i P i ] q . \begin{aligned}
&q^{\sum_{1\le i<j\le n}\left[(G'_i-P_i)H'_j+P_i(H_j-P_j)\right]}
\\
&\quad\times
\frac{(q^{M+1-|H'|};q)_{G'_1-P_1}
(q^{M+1-|H|-P_1};q)_{P_1}}
{(q;q)_{G'_1-P_1}(q;q)_{P_1}}
\prod_{i=2}^n
\begin{bmatrix}G'_i+H'_i-P_i\\G'_i-P_i\end{bmatrix}_{\!q}
\begin{bmatrix}H_i\\P_i\end{bmatrix}_{\!q}.
\end{aligned} q ∑ 1 ≤ i < j ≤ n [ ( G i ′ − P i ) H j ′ + P i ( H j − P j ) ] × ( q ; q ) G 1 ′ − P 1 ( q ; q ) P 1 ( q M + 1 − ∣ H ′ ∣ ; q ) G 1 ′ − P 1 ( q M + 1 − ∣ H ∣ − P 1 ; q ) P 1 i = 2 ∏ n [ G i ′ + H i ′ − P i G i ′ − P i ] q [ H i P i ] q . Using the identities
( q − N ; q ) r = ( − 1 ) r q − N r + ( r 2 ) ( q ; q ) N ( q ; q ) N − r , ( u ; q ) r + t = ( u ; q ) r ( u q r ; q ) t , ( u ; q ) ∞ ( u q r ; q ) ∞ = ( u ; q ) r , \begin{equation}
(q^{-N};q)_r
=(-1)^rq^{-Nr+\binom r2}
\frac{(q;q)_N}{(q;q)_{N-r}},
\quad
(u;q)_{r+t}=(u;q)_r(uq^r;q)_t,
\quad
\frac{(u;q)_\infty}{(uq^r;q)_\infty}=(u;q)_r, \tag*{(3.18)}
\end{equation} ( q − N ; q ) r = ( − 1 ) r q − N r + ( 2 r ) ( q ; q ) N − r ( q ; q ) N , ( u ; q ) r + t = ( u ; q ) r ( u q r ; q ) t , ( u q r ; q ) ∞ ( u ; q ) ∞ = ( u ; q ) r , (3.18) we obtain (3.16) at finite spins. The apparent s 1 = 0 s_1=0 s 1 = 0 singularity is removable term by term, because
( s 1 z ) H 0 ′ ( q 1 + ∣ G ∣ − H 0 − p s 1 z ; q ) H 0 ′ = ∏ r = 0 H 0 ′ − 1 ( s 1 z − q 1 + ∣ G ∣ − H 0 − p + r ) . (s_1z)^{H'_0}
\left(\frac{q^{1+|G|-H_0-p}}{s_1z};q\right)_{H'_0}
=\prod_{r=0}^{H'_0-1}
\left(s_1z-q^{1+|G|-H_0-p+r}\right). ( s 1 z ) H 0 ′ ( s 1 z q 1 + ∣ G ∣ − H 0 − p ; q ) H 0 ′ = r = 0 ∏ H 0 ′ − 1 ( s 1 z − q 1 + ∣ G ∣ − H 0 − p + r ) . Since the sum in (3.16) is finite, the standard analytic continuation procedure proves the claim. ◻
The following specializations are used later in the one-sided and mixed-crossing computations.
Example 3.7. We first specialize the bottom–top edge to spin one while retaining a hole-indexed fused left–right edge: L ^ z , s v e r : = W ^ z , q , s .
\widehat L^{\mathrm{ver}}_{z,s}:=\widehat W_{z,q,s}.
L z , s ver := W z , q , s . For a hole-indexed state H = ( H 0 , H 2 , … , H n ) H=(H_0,H_2,\ldots,H_n) H = ( H 0 , H 2 , … , H n ) , write H k ± : = H ± E ^ k , H k ℓ + − : = H + E ^ k − E ^ ℓ . H_k^\pm:=H\pm\widehat E_k,
\qquad
H_{k\ell}^{+-}:=H+\widehat E_k-\widehat E_\ell. H k ± := H ± E k , H k ℓ +− := H + E k − E ℓ . Figure 10 lists all six nonzero transition families and their weights.
Figure 10. The six nonzero transition families of L ^ z , s v e r \widehat L^{\mathrm{ver}}_{z,s} L z , s ver . Here k , ℓ ∈ C ^ n k,\ell\in\widehat{\mathcal C}_n k , ℓ ∈ C n and k ≺ ℓ k\prec\ell k ≺ ℓ .
The following proposition establishes stochasticity of the spin-one weights displayed above.
Proposition 3.8. Assume the spin-one bulk stochastic range (3.3) . Then the weights in Figure 10 are nonnegative and, for every input color i i i and hole-indexed state H H H , ∑ j , H ′ L ^ z , s v e r ( i , H ; j , H ′ ) = 1.
\sum_{j,H'}
\widehat L^{\mathrm{ver}}_{z,s}
(i,H;j,H')=1.
∑ j , H ′ L z , s ver ( i , H ; j , H ′ ) = 1. The sum is finite. The same statement holds at q = 0 q=0 q = 0 by continuity.
Proof. All six families are nonnegative in the stated range. Conservation determines H ′ H' H ′ from the output color j j j , so the row sum contains at most n + 1 n+1 n + 1 terms and is rational in s s s . The sum-to-one property follows from that of the finite bulk weights in Proposition 2.10 and the standard analytic continuation procedure. The statement at q = 0 q=0 q = 0 follows by continuity. ◻
Example 3.9. Let 1 ≻ 2 ≻ 0 1\succ2\succ0 1 ≻ 2 ≻ 0 , and write H = ( H 0 , H 2 ) H=(H_0,H_2) H = ( H 0 , H 2 ) . With the input and output colors ordered as 0 , 2 , 1 0,2,1 0 , 2 , 1 , the weights L ^ z , s v e r \widehat L^{\mathrm{ver}}_{z,s} L z , s ver are i \ j 0 2 1 0 1 − q H 0 z 1 − s z q H 0 z ( 1 − q H 2 ) 1 − s z z ( q ∣ H ∣ − s ) 1 − s z 2 1 − q H 0 1 − s z q H 0 ( 1 − q H 2 z ) 1 − s z z ( q ∣ H ∣ − s ) 1 − s z 1 1 − q H 0 1 − s z q H 0 ( 1 − q H 2 ) 1 − s z q ∣ H ∣ − s z 1 − s z .
\begin{array}{c|ccc}
i\backslash j&0&2&1\\ \hline
0&\dfrac{1-q^{H_0}z}{1-sz}
&\dfrac{q^{H_0}z(1-q^{H_2})}{1-sz}
&\dfrac{z(q^{|H|}-s)}{1-sz}\\[7pt]
2&\dfrac{1-q^{H_0}}{1-sz}
&\dfrac{q^{H_0}(1-q^{H_2}z)}{1-sz}
&\dfrac{z(q^{|H|}-s)}{1-sz}\\[7pt]
1&\dfrac{1-q^{H_0}}{1-sz}
&\dfrac{q^{H_0}(1-q^{H_2})}{1-sz}
&\dfrac{q^{|H|}-sz}{1-sz}.
\end{array}
i \ j 0 2 1 0 1 − sz 1 − q H 0 z 1 − sz 1 − q H 0 1 − sz 1 − q H 0 2 1 − sz q H 0 z ( 1 − q H 2 ) 1 − sz q H 0 ( 1 − q H 2 z ) 1 − sz q H 0 ( 1 − q H 2 ) 1 1 − sz z ( q ∣ H ∣ − s ) 1 − sz z ( q ∣ H ∣ − s ) 1 − sz q ∣ H ∣ − sz . Here H ′ = H i j + − H'=H_{ij}^{+-} H ′ = H ij +− , where E ^ 0 = ( 1 , 0 ) \widehat E_0=(1,0) E 0 = ( 1 , 0 ) , E ^ 2 = ( 0 , 1 ) \widehat E_2=(0,1) E 2 = ( 0 , 1 ) , and E ^ 1 = ( 0 , 0 ) \widehat E_1=(0,0) E 1 = ( 0 , 0 ) .
Example 3.10. For n = 2 n=2 n = 2 , write G = ( G 1 , G 2 ) , H = ( H 0 , H 2 ) , G ′ = ( G 1 ′ , G 2 ′ ) , H ′ = ( H 0 ′ , H 2 ′ ) . G=(G_1,G_2),\qquad
H=(H_0,H_2),\qquad
G'=(G'_1,G'_2),\qquad
H'=(H'_0,H'_2). G = ( G 1 , G 2 ) , H = ( H 0 , H 2 ) , G ′ = ( G 1 ′ , G 2 ′ ) , H ′ = ( H 0 ′ , H 2 ′ ) . The weight vanishes unless G 1 + ∣ H ′ ∣ = G 1 ′ + ∣ H ∣ , G 2 + H 2 = G 2 ′ + H 2 ′ .
G_1+|H'|=G'_1+|H|,
\qquad
G_2+H_2=G'_2+H'_2.
G 1 + ∣ H ′ ∣ = G 1 ′ + ∣ H ∣ , G 2 + H 2 = G 2 ′ + H 2 ′ . On this support, W ^ z , s 1 , s 2 ( G , H ; G ′ , H ′ ) = N z , s 1 , s 2 ( s 1 z ) H 0 ′ ( q ; q ) H 0 ( q ; q ) H 0 ′ ∑ P 1 = 0 G 1 ′ ∑ P 2 = 0 min ( H 2 , G 2 ′ ) ( − 1 ) p + H 0 ′ q H 0 p + ( H 0 ′ 2 ) + ( p + 1 2 ) ( z / q ; q ) p ( z ; q ) H 0 + p × ( q 1 + ∣ G ∣ − H 0 − p s 1 z ; q ) H 0 ′ q ( G 1 ′ − P 1 ) H 2 ′ + P 1 ( H 2 − P 2 ) × [ G 2 ′ + H 2 ′ − P 2 G 2 ′ − P 2 ] q [ H 2 P 2 ] q × ( s 2 q 1 − ∣ H ′ ∣ ; q ) G 1 ′ − P 1 ( q ; q ) G 1 ′ − P 1 ( s 2 q 1 − ∣ H ∣ − P 1 ; q ) P 1 ( q ; q ) P 1 . \begin{aligned}
&\widehat W_{z,s_1,s_2}
\bigl(G,H;G',H'\bigr)
\notag\\
&\quad =
\mathcal N_{z,s_1,s_2}(s_1z)^{H'_0}
\frac{(q;q)_{H_0}}{(q;q)_{H'_0}}
\sum_{P_1=0}^{G'_1}
\sum_{P_2=0}^{\min(H_2,G'_2)}
(-1)^{p+H'_0}
q^{H_0p+\binom{H'_0}{2}+\binom{p+1}{2}}
\frac{(z/q;q)_p}{(z;q)_{H_0+p}}
\notag\\
&\quad\times
\left(\frac{q^{1+|G|-H_0-p}}{s_1z};q\right)_{H'_0}
q^{(G'_1-P_1)H'_2+P_1(H_2-P_2)}
\notag\\
&\quad\times
\begin{bmatrix}G'_2+H'_2-P_2\\G'_2-P_2\end{bmatrix}_{\!q}
\begin{bmatrix}H_2\\P_2\end{bmatrix}_{\!q}
\times
\frac{(s_2q^{1-|H'|};q)_{G'_1-P_1}}
{(q;q)_{G'_1-P_1}}
\frac{(s_2q^{1-|H|-P_1};q)_{P_1}}
{(q;q)_{P_1}}.
\end{aligned} W z , s 1 , s 2 ( G , H ; G ′ , H ′ ) = N z , s 1 , s 2 ( s 1 z ) H 0 ′ ( q ; q ) H 0 ′ ( q ; q ) H 0 P 1 = 0 ∑ G 1 ′ P 2 = 0 ∑ m i n ( H 2 , G 2 ′ ) ( − 1 ) p + H 0 ′ q H 0 p + ( 2 H 0 ′ ) + ( 2 p + 1 ) ( z ; q ) H 0 + p ( z / q ; q ) p × ( s 1 z q 1 + ∣ G ∣ − H 0 − p ; q ) H 0 ′ q ( G 1 ′ − P 1 ) H 2 ′ + P 1 ( H 2 − P 2 ) × [ G 2 ′ + H 2 ′ − P 2 G 2 ′ − P 2 ] q [ H 2 P 2 ] q × ( q ; q ) G 1 ′ − P 1 ( s 2 q 1 − ∣ H ′ ∣ ; q ) G 1 ′ − P 1 ( q ; q ) P 1 ( s 2 q 1 − ∣ H ∣ − P 1 ; q ) P 1 .
Continued Yang-Baxter and reflection equations
Recall that, in the normalization of Figure 6a , the local parameter in row r r r and column c c c is q L + r − c − 1 z q^{L+r-c-1}z q L + r − c − 1 z . Consequently, the three pairwise spectral parameters in the fully fused Yang–Baxter equation below are q y / ( s 2 x ) qy/(s_2x) q y / ( s 2 x ) , q y / s 2 qy/s_2 q y / s 2 , and q x / s 1 qx/s_1 q x / s 1 .
Proposition 3.11. First, let A , B , I 1 , I 2 , C 1 , C 2 ∈ Z ≥ 0 n A,B,I_1,I_2,C_1,C_2\in\mathbb Z_{\ge0}^n A , B , I 1 , I 2 , C 1 , C 2 ∈ Z ≥ 0 n be normally indexed states. Then ∑ X , X 1 , X 2 W q y / ( s 2 x ) , s 1 , s 2 ( I 1 , I 2 ; X 1 , X 2 ) W q y / s 2 , s 3 , s 2 ( A , X 2 ; X , C 2 ) W q x / s 1 , s 3 , s 1 ( X , X 1 ; B , C 1 ) = ∑ X , X 1 , X 2 W q x / s 1 , s 3 , s 1 ( A , I 1 ; X , X 1 ) W q y / s 2 , s 3 , s 2 ( X , I 2 ; B , X 2 ) W q y / ( s 2 x ) , s 1 , s 2 ( X 1 , X 2 ; C 1 , C 2 ) . \begin{aligned}
&\sum_{X,X_1,X_2}
W_{qy/(s_2x),s_1,s_2}(I_1,I_2;X_1,X_2)
W_{qy/s_2,s_3,s_2}(A,X_2;X,C_2)
W_{qx/s_1,s_3,s_1}(X,X_1;B,C_1)
\notag\\
&\qquad=
\sum_{X,X_1,X_2}
W_{qx/s_1,s_3,s_1}(A,I_1;X,X_1)
W_{qy/s_2,s_3,s_2}(X,I_2;B,X_2)
W_{qy/(s_2x),s_1,s_2}(X_1,X_2;C_1,C_2).
\end{aligned} X , X 1 , X 2 ∑ W q y / ( s 2 x ) , s 1 , s 2 ( I 1 , I 2 ; X 1 , X 2 ) W q y / s 2 , s 3 , s 2 ( A , X 2 ; X , C 2 ) W q x / s 1 , s 3 , s 1 ( X , X 1 ; B , C 1 ) = X , X 1 , X 2 ∑ W q x / s 1 , s 3 , s 1 ( A , I 1 ; X , X 1 ) W q y / s 2 , s 3 , s 2 ( X , I 2 ; B , X 2 ) W q y / ( s 2 x ) , s 1 , s 2 ( X 1 , X 2 ; C 1 , C 2 ) . Here X , X 1 , X 2 ∈ Z ≥ 0 n X,X_1,X_2\in\mathbb Z_{\ge0}^n X , X 1 , X 2 ∈ Z ≥ 0 n .
Second, let A , B , I 1 , C 1 A,B,I_1,C_1 A , B , I 1 , C 1 be normally indexed states and let I 2 , C 2 I_2,C_2 I 2 , C 2 be hole-indexed states. Then ∑ X , X 1 , X 2 W ^ q y / ( s 2 x ) , s 1 , s 2 ( I 1 , I 2 ; X 1 , X 2 ) W ^ q y / s 2 , s 3 , s 2 ( A , X 2 ; X , C 2 ) W q x / s 1 , s 3 , s 1 ( X , X 1 ; B , C 1 ) = ∑ X , X 1 , X 2 W q x / s 1 , s 3 , s 1 ( A , I 1 ; X , X 1 ) W ^ q y / s 2 , s 3 , s 2 ( X , I 2 ; B , X 2 ) W ^ q y / ( s 2 x ) , s 1 , s 2 ( X 1 , X 2 ; C 1 , C 2 ) . \begin{aligned}
&\sum_{X,X_1,X_2}
\widehat W_{qy/(s_2x),s_1,s_2}(I_1,I_2;X_1,X_2)
\widehat W_{qy/s_2,s_3,s_2}(A,X_2;X,C_2)
W_{qx/s_1,s_3,s_1}(X,X_1;B,C_1)
\notag\\
&\qquad=
\sum_{X,X_1,X_2}
W_{qx/s_1,s_3,s_1}(A,I_1;X,X_1)
\widehat W_{qy/s_2,s_3,s_2}(X,I_2;B,X_2)
\widehat W_{qy/(s_2x),s_1,s_2}(X_1,X_2;C_1,C_2).
\end{aligned} X , X 1 , X 2 ∑ W q y / ( s 2 x ) , s 1 , s 2 ( I 1 , I 2 ; X 1 , X 2 ) W q y / s 2 , s 3 , s 2 ( A , X 2 ; X , C 2 ) W q x / s 1 , s 3 , s 1 ( X , X 1 ; B , C 1 ) = X , X 1 , X 2 ∑ W q x / s 1 , s 3 , s 1 ( A , I 1 ; X , X 1 ) W q y / s 2 , s 3 , s 2 ( X , I 2 ; B , X 2 ) W q y / ( s 2 x ) , s 1 , s 2 ( X 1 , X 2 ; C 1 , C 2 ) . In the second identity, X , X 1 X,X_1 X , X 1 are normally indexed and X 2 X_2 X 2 is hole-indexed. All sums are finite by the conservation laws.
[
x=.74cm,y=.74cm,
baseline={([yshift=-.5ex]current bounding box.center)},
identity state/.style={font=\scriptsize,inner sep=.7pt}
]
% Left-hand side.
\begin{scope}
\draw[paper normal,->]
(0,.2)--(1,1.1)--(2,2)--(4.4,2);
\draw[paper hole,->]
(0,2)--(1,1.1)--(2,.2)--(4.4,.2);
\draw[paper normal,->]
(3.4,-.3)--(3.4,2.5);
\node[identity state,left=2pt] at (0,.2) {$I_1$};
\node[identity state,left=22pt] at (0,.2) {$(x,s_1)$};
\node[identity state,left=2pt] at (0,2) {$I_2$};
\node[identity state,left=22pt] at (0,2) {$(y,s_2)$};
\node[identity state,below=2pt] at (3.4,-.3) {$A$};
\node[identity state,below=16pt] at (3.4,-.3) {$(1,s_3)$};
\node[identity state,right=2pt] at (4.4,2) {$C_1$};
\node[identity state,right=2pt] at (4.4,.2) {$C_2$};
\node[identity state,above=2pt] at (3.4,2.5) {$B$};
\end{scope}
\node[font=\normalsize] at (6.35,1.1) {$=$};
\begin{scope}[shift={(9.0,0)}]
\draw[paper normal,->]
(1,-.3)--(1,2.5);
\draw[paper normal,->]
(0,.2)--(2.4,.2)--(3.3,1.1)--(4.4,2);
\draw[paper hole,->]
(0,2)--(2.4,2)--(3.3,1.1)--(4.4,.2);
\node[identity state,left=2pt] at (0,.2) {$I_1$};
\node[identity state,left=22pt] at (0,.2) {$(x,s_1)$};
\node[identity state,left=2pt] at (0,2) {$I_2$};
\node[identity state,left=22pt] at (0,2) {$(y,s_2)$};
\node[identity state,below=2pt] at (1,-.3) {$A$};
\node[identity state,below=16pt] at (1,-.3) {$(1,s_3)$};
\node[identity state,right=2pt] at (4.4,2) {$C_1$};
\node[identity state,right=2pt] at (4.4,.2) {$C_2$};
\node[identity state,above=2pt] at (1,2.5) {$B$};
\end{scope}Figure 11. The Yang-Baxter equation for continued vertices (3.25) .
The continued bulk and boundary weights also satisfy the following reflection equation.
Proposition 3.12. Let G G G be an incoming normally indexed state, i i i an incoming color, H H H an outgoing hole-indexed state, and j j j an outgoing color. Then ∑ γ 1 , γ 2 , G ( 1 ) , H ( 1 ) L x / y , s h o r ( G , i ; G ( 1 ) , γ 1 ) K x , s ( G ( 1 ) ; H ( 1 ) ) L ^ x y , s v e r ( γ 1 , H ( 1 ) ; γ 2 , H ) K y ( γ 2 ; j ) = ∑ γ 1 , γ 2 , G ( 1 ) , H ( 1 ) K y ( i ; γ 1 ) L x y , s h o r ( G , γ 1 ; G ( 1 ) , γ 2 ) K x , s ( G ( 1 ) ; H ( 1 ) ) L ^ x / y , s v e r ( γ 2 , H ( 1 ) ; j , H ) . \begin{aligned}
&\sum_{\gamma_1,\gamma_2,G^{(1)},H^{(1)}}
L^{\mathrm{hor}}_{x/y,s}(G,i;G^{(1)},\gamma_1)\,
K_{x,s}(G^{(1)};H^{(1)})\,
\widehat L^{\mathrm{ver}}_{xy,s}
(\gamma_1,H^{(1)};\gamma_2,H)\,
K_y(\gamma_2;j)
\notag\\
&\qquad=
\sum_{\gamma_1,\gamma_2,G^{(1)},H^{(1)}}
K_y(i;\gamma_1)\,
L^{\mathrm{hor}}_{xy,s}(G,\gamma_1;G^{(1)},\gamma_2)\,
K_{x,s}(G^{(1)};H^{(1)})\,
\widehat L^{\mathrm{ver}}_{x/y,s}
(\gamma_2,H^{(1)};j,H).
\end{aligned} γ 1 , γ 2 , G ( 1 ) , H ( 1 ) ∑ L x / y , s hor ( G , i ; G ( 1 ) , γ 1 ) K x , s ( G ( 1 ) ; H ( 1 ) ) L x y , s ver ( γ 1 , H ( 1 ) ; γ 2 , H ) K y ( γ 2 ; j ) = γ 1 , γ 2 , G ( 1 ) , H ( 1 ) ∑ K y ( i ; γ 1 ) L x y , s hor ( G , γ 1 ; G ( 1 ) , γ 2 ) K x , s ( G ( 1 ) ; H ( 1 ) ) L x / y , s ver ( γ 2 , H ( 1 ) ; j , H ) . The sums are finite by conservation.
Proof of Propositions 3.11 and 3.12 . The identities follow from the elementary Yang–Baxter and reflection equations, the q q q -exchangeability statements in Propositions 2.9 and 2.16 , and the standard analytic continuation procedure. ◻
[scale=.94,baseline={([yshift=-.5ex]current bounding box.center)}]
\draw[paper normal]
(4,1)--(3,1)--(1,0)--(0,.5);
\draw[paper hole,->]
(0,.5)--(3,2)--(4,2);
\draw[paper wire,->]
(4,0)--(3,0)--(0,2.5)--(1,3)--(4,3);
\node[paper boundary] at (0,.5) {};
\node[paper boundary] at (0,2.5) {};
\node[right=2pt] at (4,0) {\scriptsize \(i\)};
\node[right=18pt] at (4,0) {\scriptsize \(y\)};
\node[right=2pt] at (4,1) {\scriptsize \(G\)};
\node[right=24pt] at (4,1) {\scriptsize \((x,s)\)};
\node[right=2pt] at (4,2) {\scriptsize \(H\)};
\node[right=2pt] at (4,3) {\scriptsize \(j\)};= = =
[scale=.94,baseline={([yshift=-.5ex]current bounding box.center)}]
\draw[paper normal]
(4,1)--(3,1)--(0,2.5);
\draw[paper hole,->]
(0,2.5)--(1,3)--(3,2)--(4,2);
\draw[paper wire,->]
(4,0)--(1,0)--(0,.5)--(3,3)--(4,3);
\node[paper boundary] at (0,.5) {};
\node[paper boundary] at (0,2.5) {};
\node[right=2pt] at (4,0) {\scriptsize \(i\)};
\node[right=18pt] at (4,0) {\scriptsize \(y\)};
\node[right=2pt] at (4,1) {\scriptsize \(G\)};
\node[right=24pt] at (4,1) {\scriptsize \((x,s)\)};
\node[right=2pt] at (4,2) {\scriptsize \(H\)};
\node[right=2pt] at (4,3) {\scriptsize \(j\)};Figure 12. The reflection equation for continued vertices (3.26) .
Queue specialization and stationarity
In this section we prove Theorem 1.2 . The general idea behind the proof is essentially the same as in [50 ] ; it is short and follows a well-known pattern. Namely, the Yang-Baxter equation provides an ”engine” — a vertex model of a particular form — that commutes with the ASEP generator. Constructing the engine in a right way, we can force it to produce a nontrivial output from the trivial stationary measure of ASEP (such as the completely filled line by first-class particles). Due to commutation, this ensures that the nontrivial output is also a stationary measure of ASEP. Thus, the engine provides non-trivial stationary measures from trivial ones.
While our proof fully follows this idea, we were not able to find its elegant and short form. The main technical difficulty is that the commutation relations seem to work better for finite volumes, while we are constructing a genuinely infinite object. This explains why Theorem thm:intro-vertex-form has an asymptotic form, and a significant effort has to be devoted to prove the stabilization of the limiting procedure. It would be interesting to realize an idea above in a more transparent and shorter way.
The proof in this section has the following structure. In Sub§ 4.1 we recall the vertex model (fundamental double row), which has an ASEP limit. In Sub§ 4.2 we introduce a queue specialization of vertices from § 3 , recovering weights from Figure 1 , Figure 2 , and Figure 3 . The next Subsections record their properties, which survive the queue specialization. The key Sub§ 4.5 establishes the stabilization of our vertex model / queue construction, as the size of the model goes to infinity. Finally, in the last subsection we prove stationarity, following the general idea above.
The fundamental double row and the half-space ASEP limit
Set Ω n = C n N \Omega_n=\mathcal C_n^{\mathbb N} Ω n = C n N . For η ∈ Ω n \eta\in\Omega_n η ∈ Ω n , let η j , j + 1 \eta^{j,j+1} η j , j + 1 exchange sites j , j + 1 j,j+1 j , j + 1 , and let η 1 → 1 \eta^{1\to1} η 1 → 1 replace the first color by 1 1 1 . Write
c q ( i , j ) = 1 { i ≻ j } + q 1 { j ≻ i } . \begin{equation}
\mathfrak c_q(i,j)=\mathbf1_{\{i\succ j\}}+
q\mathbf1_{\{j\succ i\}}. \tag*{(4.1)}
\end{equation} c q ( i , j ) = 1 { i ≻ j } + q 1 { j ≻ i } . (4.1)
The process defined in Sub§ 1.2 has the following generator on cylinder functions:
( L α f ) ( η ) = ∑ j ≥ 1 c q ( η j , η j + 1 ) ( f ( η j , j + 1 ) − f ( η ) ) + ( 1 − q ) α 1 { η 1 ≠ 1 } ( f ( η 1 → 1 ) − f ( η ) ) . \begin{equation}
(\mathcal L_\alpha f)(\eta)
=\sum_{j\geq1}\mathfrak c_q(\eta_j,\eta_{j+1})
\bigl(f(\eta^{j,j+1})-f(\eta)\bigr)
+(1-q)\alpha\mathbf1_{\{\eta_1\ne1\}}
\bigl(f(\eta^{1\to1})-f(\eta)\bigr). \tag*{(4.2)}
\end{equation} ( L α f ) ( η ) = j ≥ 1 ∑ c q ( η j , η j + 1 ) ( f ( η j , j + 1 ) − f ( η ) ) + ( 1 − q ) α 1 { η 1 = 1 } ( f ( η 1 → 1 ) − f ( η ) ) . (4.2)
Its Harris construction defines a Feller semigroup
( P t f ) ( η ) = E η [ f ( η ( t ) ) ] . \begin{equation}
(\mathfrak P_t f)(\eta)=\mathbb E_\eta[f(\eta(t))]. \tag*{(4.3)}
\end{equation} ( P t f ) ( η ) = E η [ f ( η ( t ))] . (4.3)
Probability laws act on the right: ( μ P t ) ( f ) = μ ( P t f ) (\mu\mathfrak P_t)(f)=\mu(\mathfrak P_t f) ( μ P t ) ( f ) = μ ( P t f ) .
For α > 0 \alpha>0 α > 0 , α ≠ 1 \alpha\ne1 α = 1 , set
a = α α − 1 . \begin{equation}
a=\frac{\alpha}{\alpha-1}. \tag*{(4.4)}
\end{equation} a = α − 1 α . (4.4)
Thus a < 0 a<0 a < 0 for α < 1 \alpha<1 α < 1 and a > 1 a>1 a > 1 for α > 1 \alpha>1 α > 1 . Writing the elementary boundary weights in terms of α \alpha α gives
Let us define a double row operator, see Figure 13 for a graphical representation. The incoming lower auxiliary color is set to be a N = c a_N=c a N = c , and its outgoing upper color is b N = d b_N=d b N = d . In column j j j , the lower and upper parameters are, respectively,
u / y j , u y j . \begin{equation}
u/y_j,\qquad uy_j. \tag*{(4.6)}
\end{equation} u / y j , u y j . (4.6)
Definition 4.1. For words η , ξ ∈ C n N \boldsymbol\eta,\boldsymbol\xi\in\mathcal C_n^N η , ξ ∈ C n N , define T u ; y N ; o p e n ( c , η ; d , ξ ) = ∑ v , a 0 , … , a N − 1 b 0 , … , b N − 1 K u ( a 0 ; b 0 ) ∏ j = 1 N R u / y j ( a j , η j ; a j − 1 , v j ) R u y j ( v j , b j − 1 ; ξ j , b j ) .
\mathfrak T^{N;\mathrm{open}}_{u;\mathbf y}(c,\boldsymbol\eta;d,\boldsymbol\xi)
=\sum_{\substack{\boldsymbol v,a_0,\ldots,a_{N-1}\\b_0,\ldots,b_{N-1}}}
K_u(a_0;b_0)
\prod_{j=1}^N
R_{u/y_j}(a_j,\eta_j;a_{j-1},v_j)
R_{uy_j}(v_j,b_{j-1};\xi_j,b_j).
T u ; y N ; open ( c , η ; d , ξ ) = ∑ v , a 0 , … , a N − 1 b 0 , … , b N − 1 K u ( a 0 ; b 0 ) ∏ j = 1 N R u / y j ( a j , η j ; a j − 1 , v j ) R u y j ( v j , b j − 1 ; ξ j , b j ) . Set T u ; y N , c ( η , ξ ) = ∑ d ∈ C n T u ; y N ; o p e n ( c , η ; d , ξ ) , T u ; y N = T u ; y N , 0 . \mathfrak T^{N,c}_{u;\mathbf y}(\boldsymbol\eta,\boldsymbol\xi)
=\sum_{d\in\mathcal C_n}\mathfrak T^{N;\mathrm{open}}_{u;\mathbf y}
(c,\boldsymbol\eta;d,\boldsymbol\xi),
\qquad \mathfrak T^N_{u;\mathbf y}=\mathfrak T^{N,0}_{u;\mathbf y}. T u ; y N , c ( η , ξ ) = ∑ d ∈ C n T u ; y N ; open ( c , η ; d , ξ ) , T u ; y N = T u ; y N , 0 .
The lower row is sampled from right to left, then the boundary vertex is sampled, and finally the upper row is sampled from left to right. The procedure is stochastic. In the sequel, we use the homogeneous parameters
y 1 = ⋯ = y N = 1 , \begin{equation}
y_1=\cdots=y_N=1, \tag*{(4.8)}
\end{equation} y 1 = ⋯ = y N = 1 , (4.8)
and suppress y \mathbf y y in notation. Note that we sum over the output d d d , cf. [79 Definition 3.2 and Section 6] .
[
baseline={([yshift=-.5ex]current bounding box.center)},
scale=.85
]
\foreach \xx/\bottomstate/\topstate in {
2/{\eta_1}/{\xi_1},
3/{\eta_2}/{\xi_2},
4/{\eta_3}/{\xi_3},
7/{\eta_N}/{\xi_N}}
{
\draw[paper wire,->] (\xx,-.75)--(\xx,1.75);
\node[below,inner sep=1pt] at (\xx,-.75)
{$\scriptstyle\bottomstate$};
\node[above,inner sep=1pt] at (\xx,1.75)
{$\scriptstyle\topstate$};
}
\node at (5.35,-.75) {$\cdots$};
\node at (5.35,1.75) {$\cdots$};
\draw[paper normal]
(8,0)--(1,0)--(0,.5);
\draw[paper normal,->]
(0,.5)--(1,1)--(8,1);
\node[paper boundary] at (0,.5) {};
\node[paper label,left=3pt] at (0,.5)
{$\scriptstyle K_u$};
\node[right=3pt,inner sep=1pt] at (8,0)
{$\scriptstyle c$};
\node[right=18pt,inner sep=1pt] at (8,0)
{$\scriptstyle u$};
\node[right=3pt,inner sep=1pt] at (8,1)
{$\scriptstyle d \ \ \ u^{-1}$};Figure 13. The finite fundamental double row T u ; 1 N , c \mathfrak T^{N,c}_{u;\mathbf 1} T u ; 1 N , c .
For a finite word write η N → c \boldsymbol\eta^{N\to c} η N → c for the replacement of its rightmost color by c c c . Let the finite space ASEP generator L α , N i n t \mathcal L^{\rm int}_{\alpha,N} L α , N int consist of the bonds 1 , … , N − 1 1,\ldots,N-1 1 , … , N − 1 and the left boundary term of (4.2) , and set
L α , N o u t f ( η ) = L α , N i n t f ( η ) + 1 { η N ≠ 0 } ( f ( η N → 0 ) − f ( η ) ) . \begin{equation}
\mathcal L^{\rm out}_{\alpha,N}f(\boldsymbol\eta)
=\mathcal L^{\rm int}_{\alpha,N}f(\boldsymbol\eta)
+\mathbf1_{\{\eta_N\ne0\}}
\bigl(f(\boldsymbol\eta^{N\to0})-f(\boldsymbol\eta)\bigr). \tag*{(4.9)}
\end{equation} L α , N out f ( η ) = L α , N int f ( η ) + 1 { η N = 0 } ( f ( η N → 0 ) − f ( η ) ) . (4.9)
Proposition 4.2. Set u ε = 1 − ( 1 − q ) ε .
u_\varepsilon=1-(1-q)\varepsilon.
u ε = 1 − ( 1 − q ) ε . On the finite state space of pairs ( c , η ) (c,\boldsymbol\eta) ( c , η ) , T u ε N ; o p e n = I d + 2 ε G N + O N ( ε 2 ) \mathfrak T^{N;\mathrm{open}}_{u_\varepsilon}=\mathrm{Id}+2\varepsilon\mathcal G_N+
O_N(\varepsilon^2) T u ε N ; open = Id + 2 ε G N + O N ( ε 2 ) , where G N F ( c , η ) = L α , N i n t F ( c , ⋅ ) ( η ) + c q ( η N , c ) ( F ( η N , η N → c ) − F ( c , η ) ) .
\mathcal G_N F(c,\boldsymbol\eta)
=\mathcal L^{\rm int}_{\alpha,N}F(c,\cdot)(\boldsymbol\eta)
+\mathfrak c_q(\eta_N,c)
\bigl(F(\eta_N,\boldsymbol\eta^{N\to c})-F(c,\boldsymbol\eta)\bigr).
G N F ( c , η ) = L α , N int F ( c , ⋅ ) ( η ) + c q ( η N , c ) ( F ( η N , η N → c ) − F ( c , η ) ) . Consequently, T u ε N , 0 = I d + 2 ε L α , N o u t + O N ( ε 2 ) .
\mathfrak T^{N,0}_{u_\varepsilon}
=\mathrm{Id}+2\varepsilon\mathcal L^{\rm out}_{\alpha,N}
+O_N(\varepsilon^2).
T u ε N , 0 = Id + 2 ε L α , N out + O N ( ε 2 ) . The remainders are in the sup-norm operator norm at each fixed N N N .
Proof. At u = 1 u=1 u = 1 , R 1 R_1 R 1 swaps its two inputs and K 1 K_1 K 1 is the identity. In (4.7) , the lower and upper passes therefore undo each other, including the auxiliary color. A first-order transition contains exactly one exception to this deterministic pattern. We have
1 − u ε 1 − q u ε = ε + O ( ε 2 ) , q ( 1 − u ε ) 1 − q u ε = q ε + O ( ε 2 ) , \frac{1-u_\varepsilon}{1-qu_\varepsilon}
=\varepsilon+O(\varepsilon^2),\qquad
\frac{q(1-u_\varepsilon)}{1-qu_\varepsilon}
=q\varepsilon+O(\varepsilon^2), 1 − q u ε 1 − u ε = ε + O ( ε 2 ) , 1 − q u ε q ( 1 − u ε ) = q ε + O ( ε 2 ) , and κ 1 ( u ε ) = 2 ( 1 − q ) α ε + O ( ε 2 ) \kappa_1(u_\varepsilon)=2(1-q)\alpha\varepsilon+O(\varepsilon^2) κ 1 ( u ε ) = 2 ( 1 − q ) α ε + O ( ε 2 ) by (4.5) . A bulk bond is visited in both passes, giving the coefficient 2 2 2 . At the right endpoint an exception in either pass exchanges η N \eta_N η N and c c c , with coefficient c q ( η N , c ) \mathfrak c_q(\eta_N,c) c q ( η N , c ) ; this gives (4.11) . For c = 0 c=0 c = 0 the exchange is the exit term in (4.9) . This is the colored, endpoint-retaining form of the expansion in [79 Lemma 6.2] . ◻
At fixed N N N , we have
lim M → ∞ ( T 1 − ( 1 − q ) t / ( 2 M ) N , 0 ) M = exp ( t L α , N o u t ) . \begin{equation}
\lim_{M\to\infty}
\left(\mathfrak T^{N,0}_{1-(1-q)t/(2M)}\right)^M
=\exp\bigl(t\mathcal L^{\mathrm{out}}_{\alpha,N}\bigr). \tag*{(4.13)}
\end{equation} M → ∞ lim ( T 1 − ( 1 − q ) t / ( 2 M ) N , 0 ) M = exp ( t L α , N out ) . (4.13)
For a bounded cylinder f f f supported on [ 1 , k ] [1,k] [ 1 , k ] , let f N f_N f N be its restriction to N N N sites. Coupling the finite and half-line processes with the same Harris clocks yields
lim N → ∞ lim M → ∞ ∥ ( T 1 − ( 1 − q ) t / ( 2 M ) N , 0 ) M f N − P t f ∥ ∞ = 0. \begin{equation}
\lim_{N\to\infty}\lim_{M\to\infty}
\left\|\left(\mathfrak T^{N,0}_{1-(1-q)t/(2M)}\right)^M f_N
-\mathfrak P_t f\right\|_\infty=0. \tag*{(4.14)}
\end{equation} N → ∞ lim M → ∞ lim ( T 1 − ( 1 − q ) t / ( 2 M ) N , 0 ) M f N − P t f ∞ = 0. (4.14)
Queue boundary specialization
There are two boundary regimes. For 0 < α < 1 0<\alpha<1 0 < α < 1 , we first take the queue limit (infinitely many arrows of one color) and then specialize the density parameters. For α > 1 \alpha>1 α > 1 , the boundary kernel instead becomes deterministic at x = a − 1 x=a^{-1} x = a − 1 , where a a a is given by (4.4) . We treat the deterministic case first.
Deterministic boundary.
The deterministic parameter range is
0 < x < 1 , a = x − 1 > 1 , s < 0. \begin{equation}
0<x<1,\qquad a=x^{-1}>1,\qquad s<0. \tag*{(4.15)}
\end{equation} 0 < x < 1 , a = x − 1 > 1 , s < 0. (4.15)
At this specialization, the boundary output is independent of the incoming normal state.
Lemma 4.3. Under (4.15) , for every usually indexed state G G G and hole-indexed state H H H , K x , s ( G ; H ) = 1 { H = 0 } .
K_{x,s}(G;H)=\mathbf1_{\{H=0\}}.
K x , s ( G ; H ) = 1 { H = 0 } . The same formula holds after making any one usually indexed coordinate infinite. The local identities of Propositions 3.11 and 3.12 are valid at this specialization whenever their other weights are regular.
Proof. Consider (3.5) . If ∣ H ∣ > 0 |H|>0 ∣ H ∣ > 0 , the factor ( a x ; q ) ∣ H ∣ = ( 1 ; q ) ∣ H ∣ (ax;q)_{|H|}=(1;q)_{|H|} ( a x ; q ) ∣ H ∣ = ( 1 ; q ) ∣ H ∣ vanishes. If H = 0 H=0 H = 0 , the normalization (3.4) and the ratio ( x / a ; q ) G 1 / ( x 2 ; q ) G 1 (x/a;q)_{G_1}/(x^2;q)_{G_1} ( x / a ; q ) G 1 / ( x 2 ; q ) G 1 both equal one. Since this formula does not depend on the incoming multiplicities, it also holds in the queue limit. ◻
Stochastic boundary.
We now work in the stochastic parameter range (3.2) . The queue specialization sends the number of normally indexed arrows of color m m m to infinity, while the hole-indexed boundary output H H H remains finite. We use the laws p u , v ( q ) p_{u,v}^{(q)} p u , v ( q ) , q - N B ( u , v ) q\text{-}\mathrm{NB}(u,v) q - NB ( u , v ) , p v ( q ) p_v^{(q)} p v ( q ) , and q - P o i ( v ) q\text{-}\mathrm{Poi}(v) q - Poi ( v ) of (2.7) –(2.8) .
Lemma 4.4. Assume (3.2) . Let A = ( A 1 , … , A m − 1 , ∞ , A m + 1 , … , A n ) A=(A_1,\ldots,A_{m-1},\infty,A_{m+1},\ldots,A_n) A = ( A 1 , … , A m − 1 , ∞ , A m + 1 , … , A n ) be a state with infinitely many arrows of color m m m . The limit K x , s ( m ) ( A ; H ) : = lim M → ∞ K x , s ( ( A 1 , … , A m − 1 , M , A m + 1 , … , A n ) ; H )
\mathbb K^{(m)}_{x,s}(A;H)
:=\lim_{M\to\infty}
K_{x,s}\bigl(
(A_1,\ldots,A_{m-1},M,A_{m+1},\ldots,A_n);H\bigr)
K x , s ( m ) ( A ; H ) := lim M → ∞ K x , s ( ( A 1 , … , A m − 1 , M , A m + 1 , … , A n ) ; H ) exists for every fixed hole-indexed output H H H . For m = 1 m=1 m = 1 , all weak-color outputs vanish, and K x , s ( 1 ) ( A ; H ) = 1 { H 2 = ⋯ = H n = 0 } p a x , s x / a ( q ) ( H 0 ) .
\mathbb K^{(1)}_{x,s}(A;H)
=\mathbf1_{\{H_2=\cdots=H_n=0\}}
p_{ax,sx/a}^{(q)}(H_0).
K x , s ( 1 ) ( A ; H ) = 1 { H 2 = ⋯ = H n = 0 } p a x , s x / a ( q ) ( H 0 ) . For m ≥ 2 m\geq2 m ≥ 2 , the output is supported on 0 ≤ H i ≤ A i ( 2 ≤ i < m ) , H i = 0 ( i > m ) ,
0\leq H_i\leq A_i\quad(2\leq i<m),
\qquad H_i=0\quad(i>m),
0 ≤ H i ≤ A i ( 2 ≤ i < m ) , H i = 0 ( i > m ) , with H 0 , H m ≥ 0 H_0,H_m\geq0 H 0 , H m ≥ 0 unrestricted. Thus only the m m m th weak-color multiplicity can be arbitrarily large. Write T : = H [ 2 , m ] T:=H_{[2,m]} T := H [ 2 , m ] ; on this support, K x , s ( m ) ( A ; H ) = N x , s K ( x / a ; q ) A 1 ( a x ; q ) H 0 + T ( s x / a ) H 0 ( x 2 ; q ) A 1 + H 0 + T ( q ; q ) H 0 ( q ; q ) H m ( − x a ) T × q A 1 T + ( T 2 ) + ∑ 2 ≤ i < j ≤ m ( A i − H i ) H j ∏ i = 2 m − 1 [ A i H i ] q .
\begin{aligned}
\mathbb K^{(m)}_{x,s}(A;H)
&=\mathcal N^K_{x,s}
\frac{(x/a;q)_{A_1}(ax;q)_{H_0+T}(sx/a)^{H_0}}
{(x^2;q)_{A_1+H_0+T}(q;q)_{H_0}(q;q)_{H_m}}
\left(-\frac xa\right)^T\\
&\quad\times
q^{A_1T+\binom T2+
\sum_{2\leq i<j\leq m}(A_i-H_i)H_j}
\prod_{i=2}^{m-1}\begin{bmatrix}A_i\\H_i\end{bmatrix}_{\!q}.
\end{aligned}
K x , s ( m ) ( A ; H ) = N x , s K ( x 2 ; q ) A 1 + H 0 + T ( q ; q ) H 0 ( q ; q ) H m ( x / a ; q ) A 1 ( a x ; q ) H 0 + T ( s x / a ) H 0 ( − a x ) T × q A 1 T + ( 2 T ) + ∑ 2 ≤ i < j ≤ m ( A i − H i ) H j i = 2 ∏ m − 1 [ A i H i ] q . The weights are nonnegative and ∑ H K x , s ( m ) ( A ; H ) = 1.
\sum_{H}\mathbb K^{(m)}_{x,s}(A;H)=1.
∑ H K x , s ( m ) ( A ; H ) = 1.
Proof. Suppose first that m ≥ 2 m\geq2 m ≥ 2 . In (3.5) , put
G = ( A 1 , … , A m − 1 , M , A m + 1 , … , A n ) . G=(A_1,\ldots,A_{m-1},M,A_{m+1},\ldots,A_n). G = ( A 1 , … , A m − 1 , M , A m + 1 , … , A n ) . For fixed H H H ,
( q M + ∑ a ≠ m A a / s ; q ) H 0 ⟶ 1 , [ M H m ] q ⟶ 1 ( q ; q ) H m . (q^{M+\sum_{a\ne m}A_a}/s;q)_{H_0}\longrightarrow1,
\qquad
\begin{bmatrix}M\\H_m\end{bmatrix}_{\!q}
\longrightarrow\frac1{(q;q)_{H_m}}. ( q M + ∑ a = m A a / s ; q ) H 0 ⟶ 1 , [ M H m ] q ⟶ ( q ; q ) H m 1 . If some H j > 0 H_j>0 H j > 0 with j > m j>m j > m , the exponent contains a factor q M H j q^{MH_j} q M H j , so the limit is zero. Collecting the remaining powers gives (4.20) . For m = 1 m=1 m = 1 , every term with H [ 2 , n ] > 0 H_{[2,n]}>0 H [ 2 , n ] > 0 contains a vanishing power of q M q^M q M . The remaining factors reduce to (4.18) . This is a q q q -negative binomial law, whose sum-to-one property follows from the q q q -binomial theorem. ◻
We next send x x x to zero while keeping s x / a sx/a s x / a fixed. The resulting boundary law has no weak-color output: only the hole count H 0 H_0 H 0 remains random.
Corollary 4.5. Let 0 < α < 1 0<\alpha<1 0 < α < 1 , 0 < ρ < 1 0<\rho<1 0 < ρ < 1 , and α + ρ > 1 \alpha+\rho>1 α + ρ > 1 , and set a = α α − 1 , s x = − 1 − ρ ρ x , β : = s x x a = ( 1 − α ) ( 1 − ρ ) α ρ ∈ ( 0 , 1 ) .
a=\frac{\alpha}{\alpha-1},
\qquad
s_x=-\frac{1-\rho}{\rho x},
\qquad
\beta:=\frac{s_xx}{a}
=\frac{(1-\alpha)(1-\rho)}{\alpha\rho}\in(0,1).
a = α − 1 α , s x = − ρ x 1 − ρ , β := a s x x = α ρ ( 1 − α ) ( 1 − ρ ) ∈ ( 0 , 1 ) . The condition α + ρ > 1 \alpha+\rho>1 α + ρ > 1 is equivalent to β < 1 \beta<1 β < 1 . For the queue specialization in any color m m m and every fixed finite choice of the remaining coordinates of A A A , K x , s x ( m ) ( A ; H ) → x ↓ 0 1 { H 2 = ⋯ = H n = 0 } p β ( q ) ( H 0 ) .
\mathbb K^{(m)}_{x,s_x}(A;H)
\xrightarrow[x\downarrow0]{}
\mathbf1_{\{H_2=\cdots=H_n=0\}}p_\beta^{(q)}(H_0).
K x , s x ( m ) ( A ; H ) x ↓ 0 1 { H 2 = ⋯ = H n = 0 } p β ( q ) ( H 0 ) .
Proof. For fixed incoming and outgoing states, substitute (4.22) in (4.18) or (4.20) . For m ≥ 2 m\geq2 m ≥ 2 , any nonzero term with H [ 2 , n ] > 0 H_{[2,n]}>0 H [ 2 , n ] > 0 has H [ 2 , m ] > 0 H_{[2,m]}>0 H [ 2 , m ] > 0 , and the factor ( − x / a ) H [ 2 , m ] (-x/a)^{H_{[2,m]}} ( − x / a ) H [ 2 , m ] forces it to zero; for m = 1 m=1 m = 1 , such terms already vanish. When H [ 2 , n ] = 0 H_{[2,n]}=0 H [ 2 , n ] = 0 , the finite Pochhammer factors tend to one, and
N x , s x K = ( x 2 ; q ) ∞ ( β ; q ) ∞ ( x / a ; q ) ∞ ( β a x ; q ) ∞ ⟶ ( β ; q ) ∞ . \mathcal N^K_{x,s_x}
=\frac{(x^2;q)_\infty(\beta;q)_\infty}
{(x/a;q)_\infty(\beta ax;q)_\infty}
\longrightarrow(\beta;q)_\infty. N x , s x K = ( x / a ; q ) ∞ ( β a x ; q ) ∞ ( x 2 ; q ) ∞ ( β ; q ) ∞ ⟶ ( β ; q ) ∞ . This proves the claim. ◻
Local Yang–Baxter and reflection identities.
The finite-color identities from § 3 , continued in Sub§ 3.3 , also survive the queue limit. At fixed exterior states, each component identity involves only finitely many internal configurations; thus passing to an infinite color multiplicity can be done directly. This establishes the following proposition.
Proposition 4.6. Assume either (3.2) or (4.15) ; in the latter case put K x , s ( m ) ( A ; H ) = 1 { H = 0 } \mathbb K^{(m)}_{x,s}(A;H)=\mathbf1_{\{H=0\}} K x , s ( m ) ( A ; H ) = 1 { H = 0 } . The normally indexed Yang–Baxter equation of Proposition 3.11 , with one fused line and two fundamental lines, remains valid after the color-m m m queue limit: its fused vertices become W ( m ) \mathbb W^{(m)} W ( m ) . The corresponding mixed Yang-Baxter equation on the reflected segment uses a hole-indexed fused line with vertices L ^ v e r \widehat L^{\rm ver} L ver .
The queue reflection equation is as follows. Let A A A have infinitely many normally indexed arrows of color m m m , let H H H be an exterior hole-indexed state, and take i , j ∈ C n i,j\in\mathcal C_n i , j ∈ C n . Then ∑ γ 1 , γ 2 , A ( 1 ) , H ( 1 ) W x / y , s ( m ) ( A , i ; A ( 1 ) , γ 1 ) K x , s ( m ) ( A ( 1 ) ; H ( 1 ) ) L ^ x y , s v e r ( γ 1 , H ( 1 ) ; γ 2 , H ) K y ( γ 2 ; j ) = ∑ γ 1 , γ 2 , A ( 1 ) , H ( 1 ) K y ( i ; γ 1 ) W x y , s ( m ) ( A , γ 1 ; A ( 1 ) , γ 2 ) K x , s ( m ) ( A ( 1 ) ; H ( 1 ) ) L ^ x / y , s v e r ( γ 2 , H ( 1 ) ; j , H ) . \begin{aligned}
&\sum_{\gamma_1,\gamma_2,A^{(1)},H^{(1)}}
\mathbb W^{(m)}_{x/y,s}(A,i;A^{(1)},\gamma_1)
\mathbb K^{(m)}_{x,s}(A^{(1)};H^{(1)})
\widehat L^{\mathrm{ver}}_{xy,s}
(\gamma_1,H^{(1)};\gamma_2,H)K_y(\gamma_2;j)
\notag\\
&\qquad=
\sum_{\gamma_1,\gamma_2,A^{(1)},H^{(1)}}
K_y(i;\gamma_1)
\mathbb W^{(m)}_{xy,s}(A,\gamma_1;A^{(1)},\gamma_2)
\mathbb K^{(m)}_{x,s}(A^{(1)};H^{(1)})
\widehat L^{\mathrm{ver}}_{x/y,s}
(\gamma_2,H^{(1)};j,H).
\end{aligned} γ 1 , γ 2 , A ( 1 ) , H ( 1 ) ∑ W x / y , s ( m ) ( A , i ; A ( 1 ) , γ 1 ) K x , s ( m ) ( A ( 1 ) ; H ( 1 ) ) L x y , s ver ( γ 1 , H ( 1 ) ; γ 2 , H ) K y ( γ 2 ; j ) = γ 1 , γ 2 , A ( 1 ) , H ( 1 ) ∑ K y ( i ; γ 1 ) W x y , s ( m ) ( A , γ 1 ; A ( 1 ) , γ 2 ) K x , s ( m ) ( A ( 1 ) ; H ( 1 ) ) L x / y , s ver ( γ 2 , H ( 1 ) ; j , H ) . In both sums, A ( 1 ) A^{(1)} A ( 1 ) and H ( 1 ) H^{(1)} H ( 1 ) are internal normally and hole-indexed states, respectively, and γ 1 , γ 2 \gamma_1,\gamma_2 γ 1 , γ 2 are internal colors.
Combination of engines
We use the conventions of Sub§ 1.2 , padding carrier states with zeros to n = r n=r n = r colors. Write C m = { 0 , … , m } \mathcal C_m=\{0,\ldots,m\} C m = { 0 , … , m } and let 0 ( m ) \mathbf0^{(m)} 0 ( m ) be the state with infinitely many arrows of color m m m and no others. To formulate the commutation identities, we extend the m m m th engine to physical inputs in C m N \mathcal C_m^N C m N , rather than just C m − 1 N \mathcal C_{m-1}^N C m − 1 N .
Definition 4.7. Assume either (3.2) or (4.15) . Let G G G be a normally indexed state with G m = ∞ G_m=\infty G m = ∞ and G k = 0 G_k=0 G k = 0 for k > m k>m k > m , let H H H be a hole-indexed state with H k = 0 H_k=0 H k = 0 for k > m k>m k > m , and take η , ξ ∈ C m N \boldsymbol\eta,\boldsymbol\xi\in\mathcal C_m^N η , ξ ∈ C m N . Define the open engine by E x , s N , m ; o p e n ( G , η ; H , ξ ) ∗ = ∑ v , A ( 0 ) , … , A ( N − 1 ) ∗ H ( 0 ) , … , H ( N − 1 ) K x , s ( m ) ( A ( 0 ) ; H ( 0 ) ) ∏ j = 1 N W x , s ( m ) ( A ( j ) , η j ; A ( j − 1 ) , v j ) L ^ x , s v e r ( v j , H ( j − 1 ) ; ξ j , H ( j ) ) , \begin{aligned}
&\mathfrak E^{N,m;\mathrm{open}}_{x,s}(G,\boldsymbol\eta;
H,\boldsymbol\xi)\notag\\*
&\quad=\sum_{\substack{\boldsymbol v,A^{(0)},\ldots,A^{(N-1)}\\*
H^{(0)},\ldots,H^{(N-1)}}}
\mathbb K^{(m)}_{x,s}(A^{(0)};H^{(0)})
\prod_{j=1}^N
\mathbb W^{(m)}_{x,s}(A^{(j)},\eta_j;A^{(j-1)},v_j)
\widehat L^{\rm ver}_{x,s}(v_j,H^{(j-1)};\xi_j,H^{(j)}),
\end{aligned} ∗ E x , s N , m ; open ( G , η ; H , ξ ) = v , A ( 0 ) , … , A ( N − 1 ) ∗ H ( 0 ) , … , H ( N − 1 ) ∑ K x , s ( m ) ( A ( 0 ) ; H ( 0 ) ) j = 1 ∏ N W x , s ( m ) ( A ( j ) , η j ; A ( j − 1 ) , v j ) L x , s ver ( v j , H ( j − 1 ) ; ξ j , H ( j ) ) , where A ( N ) = G A^{(N)}=G A ( N ) = G and H ( N ) = H H^{(N)}=H H ( N ) = H . The normal carrier runs from site N N N to site 1 1 1 , and the return carrier runs from 1 1 1 to N N N . Summing over the return-carrier endpoint gives the closed kernels E x , s N , m ; G ( η , ξ ) = ∑ H E x , s N , m ; o p e n ( G , η ; H , ξ ) , E x , s N , m = E x , s N , m ; 0 ( m ) . \mathfrak E^{N,m;G}_{x,s}(\boldsymbol\eta,\boldsymbol\xi)
=\sum_H\mathfrak E^{N,m;\mathrm{open}}_{x,s}
(G,\boldsymbol\eta;H,\boldsymbol\xi),
\qquad
\mathfrak E^{N,m}_{x,s}
=\mathfrak E^{N,m;\mathbf0^{(m)}}_{x,s}. E x , s N , m ; G ( η , ξ ) = ∑ H E x , s N , m ; open ( G , η ; H , ξ ) , E x , s N , m = E x , s N , m ; 0 ( m ) . The open endpoints will be needed for the construction in Sub§ 4.4 ; the corresponding vertex model is depicted in Figure 14 .
[
baseline={([yshift=-.5ex]current bounding box.center)},
x=.74cm,y=.74cm,
engstate/.style={font=\scriptsize,inner sep=.8pt}
]
\foreach \yy/\outstate/\rap in {
.9/{\xi_N}/{y_N},
2.2/{\cdots}/{\cdots},
3.5/{\xi_2}/{y_2},
4.8/{\xi_1}/{y_1}}
{
\draw[paper wire,->] (.35,\yy)--(12.15,\yy);
\node[engstate,left=2pt] at (.35,\yy) {$0$};
\node[engstate,left=15pt] at (.35,\yy) {$\rap$};
\node[engstate,right=2pt] at (12.15,\yy) {$\outstate$};
}
\draw[paper normal] (.85,.10)--(.85,5.15)--(1.65,5.80);
\draw[paper hole,->] (1.65,5.80)--(2.45,5.15)--(2.45,.10);
\node[paper boundary] at (1.65,5.80) {};
\node[engstate,below left=2pt] at (.85,.10) {$\mathbf0^{(1)}$};
\node[engstate,below left=2pt,text=holecolor] at (2.45,.10)
{$\sum H^{(1)}$};
\node[engstate,below left=15pt] at (.85,.10) {$(x_1,s_1)$};
\node[engstate,above=3pt] at (1.65,5.80) {$\mathbb K^{(1)}$};
\draw[paper normal] (3.95,.10)--(3.95,5.15)--(4.75,5.80);
\draw[paper hole,->] (4.75,5.80)--(5.55,5.15)--(5.55,.10);
\node[paper boundary] at (4.75,5.80) {};
\node[engstate,below right=2pt] at (3.95,.10) {$\mathbf0^{(2)}$};
\node[engstate,below right=2pt,text=holecolor] at (5.55,.10)
{$\sum H^{(2)}$};
\node[engstate,below right=15pt] at (3.95,.10) {$(x_2,s_2)$};
\node[engstate,above=3pt] at (4.75,5.80) {$\mathbb K^{(2)}$};
\draw[paper normal] (9.05,.10)--(9.05,5.15)--(9.85,5.80);
\draw[paper hole,->] (9.85,5.80)--(10.65,5.15)--(10.65,.10);
\node[paper boundary] at (9.85,5.80) {};
\node[engstate,below left=2pt] at (9.05,.10) {$\mathbf0^{(r)}$};
\node[engstate,below right=2pt,text=holecolor] at (10.65,.10)
{$\sum H^{(r)}$};
\node[engstate,below=15pt] at (9.85,.10)
{$(x_r,s_r)$};
\node[engstate,above=3pt] at (9.85,5.80) {$\mathbb K^{(r)}$};
\node[engstate] at (7.20,2.85) {$\cdots$};Figure 14. The combination of engines (4.28) , after a clockwise rotation. The engines of colors 3 , … , r − 1 3,\ldots,r-1 3 , … , r − 1 are omitted between the second and last engines.
For 0 < α < 1 0<\alpha<1 0 < α < 1 , we use the density limit
x m ↓ 0 , s m = − ρ ˉ m ρ m x m , a = α α − 1 . \begin{equation}
x_m\downarrow0,\qquad s_m=-\frac{\bar\rho_m}{\rho_m x_m},\qquad
a=\frac{\alpha}{\alpha-1}. \tag*{(4.26)}
\end{equation} x m ↓ 0 , s m = − ρ m x m ρ ˉ m , a = α − 1 α . (4.26)
For α > 1 \alpha>1 α > 1 , use instead the exact specialization
a = α α − 1 , x m = a − 1 = 1 − α − 1 , s m = − 1 − ρ m ρ m x m . \begin{equation}
a=\frac{\alpha}{\alpha-1},\qquad
x_m=a^{-1}=1-\alpha^{-1},\qquad
s_m=-\frac{1-\rho_m}{\rho_m x_m}. \tag*{(4.27)}
\end{equation} a = α − 1 α , x m = a − 1 = 1 − α − 1 , s m = − ρ m x m 1 − ρ m . (4.27)
We also use the density-specialized vertices W ρ m ( m ) \mathbb W^{(m)}_{\rho_m} W ρ m ( m ) , K α , ρ m ( m ) \mathbb K^{(m)}_{\alpha,\rho_m} K α , ρ m ( m ) , and L ^ ρ m v e r \widehat L^{\mathrm{ver}}_{\rho_m} L ρ m ver of Sub§ 1.2 , and denote the corresponding closed engines by E N , m \mathfrak E^{N,m} E N , m . Their combination produces
μ e n g N = δ 0 N E N , 1 ⋯ E N , r . \begin{equation}
\mu^N_{\mathrm{eng}}
=\delta_{\boldsymbol0_N}\mathfrak E^{N,1}\cdots\mathfrak E^{N,r}. \tag*{(4.28)}
\end{equation} μ eng N = δ 0 N E N , 1 ⋯ E N , r . (4.28)
At α = 1 \alpha=1 α = 1 the two regimes have the common limit x = 0 x=0 x = 0 with a zero boundary state. For both regimes, set
β m : = ( 1 − α ) + ( 1 − ρ m ) α ρ m . \begin{equation}
\beta_m:=\frac{(1-\alpha)_+(1-\rho_m)}{\alpha\rho_m}. \tag*{(4.29)}
\end{equation} β m := α ρ m ( 1 − α ) + ( 1 − ρ m ) . (4.29)
The boundary hole count has law q - P o i ( β m ) q\text{-}\mathrm{Poi}(\beta_m) q - Poi ( β m ) , with β m = 0 \beta_m=0 β m = 0 (hence a deterministic zero boundary) when α ≥ 1 \alpha\ge1 α ≥ 1 .
Proposition 4.8. For every fixed size and permitted incoming state, (4.26) converges under the queue specialization in total variation to the vertex model of Definition 1.1 for 0 < α < 1 0<\alpha<1 0 < α < 1 . For α > 1 \alpha>1 α > 1 , (4.27) gives those queues exactly. The boundary output is independent of the incoming normally indexed state, and the resulting density kernels are continuous in total variation at α = 1 \alpha=1 α = 1 and q = 0 q=0 q = 0 .
Proof. The usual row weights of Sub§ 1.2 match (2.33) and Figure 10 , with ρ = ( 1 − s x ) − 1 \rho=(1-sx)^{-1} ρ = ( 1 − s x ) − 1 . The boundary specializations are Corollary 4.5 and Lemma 4.3 . ◻
Lemma 4.9. For every normally indexed state A A A in the color-m m m queue limit, W z , s ( m ) ( A , 0 ; A ′ , j ) = W z , s ( m ) ( A , m ; A ′ , j ) .
\mathbb W^{(m)}_{z,s}(A,0;A',j)
=\mathbb W^{(m)}_{z,s}(A,m;A',j).
W z , s ( m ) ( A , 0 ; A ′ , j ) = W z , s ( m ) ( A , m ; A ′ , j ) . Consequently, the first engine sends any word in { 0 , 1 } N \{0,1\}^N { 0 , 1 } N to the same output law as the vacuum. Both assertions hold also after density specialization.
Proof. This is immediate from (2.33) : weights distinguishing inputs 0 0 0 and m m m contain the vanishing factor q A m q^{A_m} q A m . ◻
Finite commutation relation
We have already established that the queue vertices satisfy the Yang-Baxter and reflection equations. Repeating the argument of [79 Propositions 3.7 and 3.9] with the use of queue vertices, we arrive to the following proposition. See Figure 15 -Figure 17 for a graphical form of the proof.
Proposition 4.10. Assume either (3.2) or (4.15) , and let x < u < 1 x<u<1 x < u < 1 . For arrow configurations G , H G,H G , H , i , j ∈ C m i,j\in\mathcal C_m i , j ∈ C m , and η , ξ ∈ C m N \boldsymbol\eta,\boldsymbol\xi\in\mathcal C_m^N η , ξ ∈ C m N , one has ∑ G ( 1 ) , H ( 1 ) , γ 1 , γ 2 , ν W x / u , s ( m ) ( G , i ; G ( 1 ) , γ 1 ) E x , s N , m ; o p e n ( G ( 1 ) , η ; H ( 1 ) , ν ) ∗ × L ^ x u , s v e r ( γ 1 , H ( 1 ) ; γ 2 , H ) T u N ; o p e n ( γ 2 , ν ; j , ξ ) ∗ = ∑ G ( 1 ) , H ( 1 ) , γ 1 , γ 2 , ν T u N ; o p e n ( i , η ; γ 1 , ν ) W x u , s ( m ) ( G , γ 1 ; G ( 1 ) , γ 2 ) ∗ × E x , s N , m ; o p e n ( G ( 1 ) , ν ; H ( 1 ) , ξ ) L ^ x / u , s v e r ( γ 2 , H ( 1 ) ; j , H ) . \begin{aligned}
&\sum_{G^{(1)},H^{(1)},\gamma_1,\gamma_2,\boldsymbol\nu}
\mathbb W^{(m)}_{x/u,s}(G,i;G^{(1)},\gamma_1)
\mathfrak E^{N,m;\mathrm{open}}_{x,s}(G^{(1)},\boldsymbol\eta;
H^{(1)},\boldsymbol\nu)\notag\\*
&\hspace{15mm}\times
\widehat L^{\rm ver}_{xu,s}(\gamma_1,H^{(1)};\gamma_2,H)
\mathfrak T^{N;\mathrm{open}}_u(\gamma_2,\boldsymbol\nu;j,\boldsymbol\xi)
\notag\\*
&=\sum_{G^{(1)},H^{(1)},\gamma_1,\gamma_2,\boldsymbol\nu}
\mathfrak T^{N;\mathrm{open}}_u(i,\boldsymbol\eta;\gamma_1,\boldsymbol\nu)
\mathbb W^{(m)}_{xu,s}(G,\gamma_1;G^{(1)},\gamma_2)\notag\\*
&\hspace{15mm}\times
\mathfrak E^{N,m;\mathrm{open}}_{x,s}(G^{(1)},\boldsymbol\nu;
H^{(1)},\boldsymbol\xi)
\widehat L^{\rm ver}_{x/u,s}(\gamma_2,H^{(1)};j,H).
\end{aligned} ∗ ∗ ∗ G ( 1 ) , H ( 1 ) , γ 1 , γ 2 , ν ∑ W x / u , s ( m ) ( G , i ; G ( 1 ) , γ 1 ) E x , s N , m ; open ( G ( 1 ) , η ; H ( 1 ) , ν ) × L xu , s ver ( γ 1 , H ( 1 ) ; γ 2 , H ) T u N ; open ( γ 2 , ν ; j , ξ ) = G ( 1 ) , H ( 1 ) , γ 1 , γ 2 , ν ∑ T u N ; open ( i , η ; γ 1 , ν ) W xu , s ( m ) ( G , γ 1 ; G ( 1 ) , γ 2 ) × E x , s N , m ; open ( G ( 1 ) , ν ; H ( 1 ) , ξ ) L x / u , s ver ( γ 2 , H ( 1 ) ; j , H ) .
[
x=.70cm,y=.63cm,
train state/.style={font=\scriptsize,inner sep=.6pt}
]
\foreach \xx in {1.70,2.70,3.70,4.70}{
\draw[paper wire,->] (\xx,-.45)--(\xx,3.45);
}
\node[train state,above=1pt] at (1.70,3.45) {$\xi_1$};
\node[train state,above=1pt] at (2.70,3.45) {$\xi_2$};
\node[train state,above=1pt] at (3.70,3.45) {$\cdots$};
\node[train state,above=1pt] at (4.70,3.45) {$\xi_N$};
\node[train state,below=1pt] at (1.70,-.45) {$\eta_1$};
\node[train state,below=1pt] at (2.70,-.45) {$\eta_2$};
\node[train state,below=1pt] at (3.70,-.45) {$\cdots$};
\node[train state,below=1pt] at (4.70,-.45) {$\eta_N$};
\draw[paper normal]
(7.2,1)--(6.55,1)--(5.55,0)--(.50,0)--(0,.50);
\draw[paper hole,->]
(0,.50)--(.50,1)--(4.95,1)--(5.95,2)--(7.2,2);
\node[paper boundary] at (0,.50) {};
\draw[paper wire,->]
(7.2,0)--(6.55,0)--(4.95,2)--(.50,2)--(0,2.50)--(.50,3)--(7.2,3);
\node[paper boundary] at (0,2.50) {};
\node[train state,anchor=west] at (7.24,0) {$0\,;\,u$};
\node[train state,anchor=west] at (7.24,1) {$\mathbf0^{(m)}\,;\,(x,s)$};
\node[train state,anchor=west,text=holecolor] at (7.24,2)
{$\sum H'$};
\node[train state,anchor=west] at (7.24,3)
{$\sum c'$};Figure 15. Initial diagram for the commutation identity, with crossings of parameters x / u x/u x / u and x u xu xu . The auxiliary inputs are 0 0 0 and 0 ( m ) \mathbf0^{(m)} 0 ( m ) , the exterior outputs are summed.
[
x=.52cm,y=.57cm,
train state/.style={font=\tiny,inner sep=.6pt}
]
\begin{scope}
\foreach \xx in {1.70,2.70,3.70,4.70}{
\draw[paper wire,->] (\xx,-.45)--(\xx,3.45);
}
\node[train state,above=1pt] at (1.70,3.45) {$\xi_1$};
\node[train state,above=1pt] at (2.70,3.45) {$\xi_2$};
\node[train state,above=1pt] at (3.70,3.45) {$\cdots$};
\node[train state,above=1pt] at (4.70,3.45) {$\xi_N$};
\node[train state,below=1pt] at (1.70,-.45) {$\eta_1$};
\node[train state,below=1pt] at (2.70,-.45) {$\eta_2$};
\node[train state,below=1pt] at (3.70,-.45) {$\cdots$};
\node[train state,below=1pt] at (4.70,-.45) {$\eta_N$};
\draw[paper normal]
(7.2,1)--(1.40,1)--(-.20,0)--(-1.00,.50);
\draw[paper hole,->]
(-1.00,.50)--(-.20,1)--(1.40,2)--(7.2,2);
\draw[paper wire,->]
(7.2,0)--(1.40,0)--(-1.00,2.50)
--(-.20,3)--(7.2,3);
\node[paper boundary] at (-1.00,.50) {};
\node[paper boundary] at (-1.00,2.50) {};
\node[train state,anchor=west] at (7.24,0) {$0\,;\,u$};
\node[train state,anchor=west] at (7.24,1) {$\mathbf0^{(m)}\,;\,(x,s)$};
\node[train state,anchor=west,text=holecolor] at (7.24,2)
{$\sum H'$};
\node[train state,anchor=west] at (7.24,3)
{$\sum c'$};
\end{scope}
\begin{scope}[shift={(13.5,0)}]
\foreach \xx in {1.70,2.70,3.70,4.70}{
\draw[paper wire,->] (\xx,-.45)--(\xx,3.45);
}
\node[train state,above=1pt] at (1.70,3.45) {$\xi_1$};
\node[train state,above=1pt] at (2.70,3.45) {$\xi_2$};
\node[train state,above=1pt] at (3.70,3.45) {$\cdots$};
\node[train state,above=1pt] at (4.70,3.45) {$\xi_N$};
\node[train state,below=1pt] at (1.70,-.45) {$\eta_1$};
\node[train state,below=1pt] at (2.70,-.45) {$\eta_2$};
\node[train state,below=1pt] at (3.70,-.45) {$\cdots$};
\node[train state,below=1pt] at (4.70,-.45) {$\eta_N$};
\draw[paper normal]
(7.2,1)--(1.40,1)--(-.20,2)--(-1.00,2.50);
\draw[paper hole,->]
(-1.00,2.50)--(-.20,3)--(1.40,2)--(7.2,2);
\draw[paper wire,->]
(7.2,0)--(-.20,0)--(-1.00,.50)--(1.40,3)--(7.2,3);
\node[paper boundary] at (-1.00,.50) {};
\node[paper boundary] at (-1.00,2.50) {};
\node[train state,anchor=west] at (7.24,0) {$0\,;\,u$};
\node[train state,anchor=west] at (7.24,1) {$\mathbf0^{(m)}\,;\,(x,s)$};
\node[train state,anchor=west,text=holecolor] at (7.24,2)
{$\sum H'$};
\node[train state,anchor=west] at (7.24,3)
{$\sum c'$};
\end{scope}Figure 16. Yang-Baxter moves through columns N , N − 1 , … , 1 N,N-1,\ldots,1 N , N − 1 , … , 1 bring the crossings to the boundary (left), followed by the reflection equation (right).
[
x=.52cm,y=.57cm,
train state/.style={font=\tiny,inner sep=.6pt}
]
\begin{scope}
\foreach \xx in {1.70,2.70,3.70,4.70}{
\draw[paper wire,->] (\xx,-.45)--(\xx,3.45);
}
\node[train state,above=1pt] at (1.70,3.45) {$\xi_1$};
\node[train state,above=1pt] at (2.70,3.45) {$\xi_2$};
\node[train state,above=1pt] at (3.70,3.45) {$\cdots$};
\node[train state,above=1pt] at (4.70,3.45) {$\xi_N$};
\node[train state,below=1pt] at (1.70,-.45) {$\eta_1$};
\node[train state,below=1pt] at (2.70,-.45) {$\eta_2$};
\node[train state,below=1pt] at (3.70,-.45) {$\cdots$};
\node[train state,below=1pt] at (4.70,-.45) {$\eta_N$};
\draw[paper wire,->]
(7.2,0)--(.50,0)--(0,.50)--(.50,1)--(5.15,1)--(7.2,3);
\node[paper boundary] at (0,.50) {};
\draw[paper normal]
(7.2,1)--(6.55,1)--(5.55,2)--(.50,2)--(0,2.50);
\draw[paper hole,->] (0,2.50)--(.50,3)--(6.2,3)--(7.2,2);
\node[paper boundary] at (0,2.50) {};
\node[train state,anchor=west] at (7.24,0) {$0\,;\,u$};
\node[train state,anchor=west] at (7.24,1) {$\mathbf0^{(m)}\,;\,(x,s)$};
\node[train state,anchor=west,text=holecolor] at (7.24,2)
{$\sum H'$};
\node[train state,anchor=west] at (7.24,3)
{$\sum c'$};
\end{scope}
\begin{scope}[shift={(13.5,0)}]
\foreach \xx in {1.70,2.70,3.70,4.70}{
\draw[paper wire,->] (\xx,-.45)--(\xx,3.45);
}
\node[train state,above=1pt] at (1.70,3.45) {$\xi_1$};
\node[train state,above=1pt] at (2.70,3.45) {$\xi_2$};
\node[train state,above=1pt] at (3.70,3.45) {$\cdots$};
\node[train state,above=1pt] at (4.70,3.45) {$\xi_N$};
\node[train state,below=1pt] at (1.70,-.45) {$\eta_1$};
\node[train state,below=1pt] at (2.70,-.45) {$\eta_2$};
\node[train state,below=1pt] at (3.70,-.45) {$\cdots$};
\node[train state,below=1pt] at (4.70,-.45) {$\eta_N$};
\draw[paper wire,->]
(7.2,0)--(.50,0)--(0,.50)--(.50,1)--(5.15,1)--(6.15,2)--(7.2,2);
\node[paper boundary] at (0,.50) {};
\draw[paper normal]
(7.2,1)--(6.55,1)--(5.55,2)--(.50,2)--(0,2.50);
\draw[paper hole,->] (0,2.50)--(.50,3)--(7.2,3);
\node[paper boundary] at (0,2.50) {};
\node[train state,anchor=west] at (7.24,0) {$0\,;\,u$};
\node[train state,anchor=west] at (7.24,1)
{$\mathbf0^{(m)}\,;\,(x,s)$};
\node[train state,anchor=west] at (7.24,2)
{$\sum\gamma$};
\node[train state,above=2pt] at (4.95,2) {$\mathbf d$};
\node[train state,fill=white,below=2pt] at (5.84,1.42) {$xu$};
\node[train state,anchor=west,text=holecolor] at (7.24,3)
{$\sum H^N$};
\end{scope}Figure 17. Yang-Baxter moves through columns 1 , 2 , … , N 1,2,\ldots,N 1 , 2 , … , N (left), followed by summing the two outgoing states of the hole-indexed vertex (right). The normally indexed vertex of parameter x u xu xu remains, and its output d \mathbf d d enters the engine.
Infinite engine: stabilization
In the double row operator, the usual row is read from right to left and the return row from left to right. To construct an infinite engine, we must show that changing the usual carrier sufficiently far to the right does not change the colors in a fixed window on the left. We do this by sampling different carrier states with the same random choices at every vertex.
Proposition 4.11. Recall x = ( 1 − α − 1 ) + x=(1-\alpha^{-1})_+ x = ( 1 − α − 1 ) + . Independently at each vertex, define random variables S ∼ Ber ( ρ m ) , F ∼ Ber ( x ) , P ( R = j ) = ( 1 − q ) q j − 1 , j ≥ 1. S\sim\operatorname{Ber}(\rho_m),\qquad
F\sim\operatorname{Ber}(x),\qquad
\mathbb P(R=j)=(1-q)q^{j-1},\quad j\ge1. S ∼ Ber ( ρ m ) , F ∼ Ber ( x ) , P ( R = j ) = ( 1 − q ) q j − 1 , j ≥ 1. Then the following rules produce precisely the weights in Figure 1 and Figure 2 .
Usual vertex. For m ≥ 2 m\ge2 m ≥ 2 , list the arrows of the incoming carrier G G G in the order 1 , … , 1 ⏟ G 1 , 2 , … , 2 ⏟ G 2 , … , m − 1 , … , m − 1 ⏟ G m − 1 , m , m , … . \underbrace{1,\ldots,1}_{G_1},\
\underbrace{2,\ldots,2}_{G_2},\ \ldots,\
\underbrace{m-1,\ldots,m-1}_{G_{m-1}},\
m,m,\ldots . G 1 1 , … , 1 , G 2 2 , … , 2 , … , G m − 1 m − 1 , … , m − 1 , m , m , … . Let c R c_R c R denote the color of the arrow in position R R R . Given the incoming physical color i i i , choose the outgoing physical color j j j as follows:
If S = 0 S=0 S = 0 , set j = 0 j=0 j = 0 .
If S = 1 S=1 S = 1 and i i i is not a recorded carrier color (in particular, if i = 0 i=0 i = 0 ), set j = c R j=c_R j = c R .
If S = 1 S=1 S = 1 and i = k ∈ { 1 , … , m − 1 } i=k\in\{1,\ldots,m-1\} i = k ∈ { 1 , … , m − 1 } , set b = G 1 + ⋯ + G k − 1 b=G_1+\cdots+G_{k-1} b = G 1 + ⋯ + G k − 1 . Set j = c R j=c_R j = c R when R ≤ b R\le b R ≤ b . When R > b R>b R > b , set j = k j=k j = k if F = 0 F=0 F = 0 , and j = c R j=c_R j = c R if F = 1 F=1 F = 1 .
The remaining colors determine the outgoing carrier G ′ G' G ′ .
Return vertex. We use exactly the same procedure, but list the incoming carrier H H H in the different order: 0 , … , 0 ⏟ H 0 , m , … , m ⏟ H m , m − 1 , … , m − 1 ⏟ H m − 1 , … , 2 , … , 2 ⏟ H 2 , 1 , 1 , … . \underbrace{0,\ldots,0}_{H_0},\
\underbrace{m,\ldots,m}_{H_m},\
\underbrace{m-1,\ldots,m-1}_{H_{m-1}},\ \ldots,\
\underbrace{2,\ldots,2}_{H_2},\
1,1,\ldots . H 0 0 , … , 0 , H m m , … , m , H m − 1 m − 1 , … , m − 1 , … , H 2 2 , … , 2 , 1 , 1 , … . Let c R c_R c R be again the color in position R R R in such an ordered list. Given the incoming physical color i i i , the outgoing physical color j j j is determined via:
If S = 0 S=0 S = 0 , set j = 1 j=1 j = 1 .
If S = 1 S=1 S = 1 and i = 1 i=1 i = 1 , set j = c R j=c_R j = c R .
If S = 1 S=1 S = 1 and i = k i=k i = k is recorded (k = 0 k=0 k = 0 or 2 ≤ k ≤ m 2\le k\le m 2 ≤ k ≤ m ), let b = ∑ a ≺ k H a b=\sum_{a\prec k}H_a b = ∑ a ≺ k H a , the number of recorded carrier arrows preceding color k k k in the displayed order. Set j = c R j=c_R j = c R when R ≤ b R\le b R ≤ b . When R > b R>b R > b , set j = k j=k j = k if F = 0 F=0 F = 0 , and j = c R j=c_R j = c R if F = 1 F=1 F = 1 .
For either row, the number of recorded carrier arrows is the sum of its finite color multiplicities; the infinitely repeated color is excluded. Our goal is to show that the engine converges, in the sense of local convergence, as N → ∞ N\to\infty N → ∞ , and the limit is independent from the input at the bottom. The next key technical lemma shows that sufficiently distant vertices erase dependence on this input.
Lemma 4.12. Let A i ∈ { 0 , 1 } } A_i \in \{0,1 \}\} A i ∈ { 0 , 1 }} be the indicator of the event that the physical input at site i i i is a non-zero color, and let h h h be the number non-zero arrows entering a vertex. The number of arrows leaving it is Φ i ( h , A i ) = h + A i − S i ( 1 { R i ≤ h } + A i ( 1 − F i ) 1 { R i > h } ) .
\Phi_i(h,A_i)=h+A_i-S_i\bigl(\mathbf1_{\{R_i\le h\}}
+A_i(1-F_i)\mathbf1_{\{R_i>h\}}\bigr).
Φ i ( h , A i ) = h + A i − S i ( 1 { R i ≤ h } + A i ( 1 − F i ) 1 { R i > h } ) . For fixed randomness at each vertex, Φ i \Phi_i Φ i is nondecreasing in h h h .
Suppose that ( A i ) (A_i) ( A i ) is stationary ergodic with mean λ < ρ m \lambda<\rho_m λ < ρ m . For N > d N>d N > d , let C N ( N ) = 0 C_N^{(N)}=0 C N ( N ) = 0 and C i − 1 ( N ) = Φ i ( C i ( N ) , A i ) C_{i-1}^{(N)}=\Phi_i(C_i^{(N)},A_i) C i − 1 ( N ) = Φ i ( C i ( N ) , A i ) for i = N , … , 1 i=N,\ldots,1 i = N , … , 1 . Then, at every fixed cut d d d , C d ( N ) ↑ C d < ∞ almost surely . C_d^{(N)}\uparrow C_d<\infty\quad\text{almost surely}. C d ( N ) ↑ C d < ∞ almost surely . The process ( C d ) (C_d) ( C d ) is stationary and ergodic, with P ( C d = 0 ) > 0 \mathbb P(C_d=0)>0 P ( C d = 0 ) > 0 . For every integer b ≥ 1 b\ge1 b ≥ 1 , almost surely there are arbitrarily large cuts d d d and a finite block immediately to their left such that the carrier is empty at d d d and the block empties any carrier entering with at most b b b recorded arrows, regardless of their colors.
Proof. Equation (4.32) follows from arrow conservation and Proposition 4.11 . When S i = 1 S_i=1 S i = 1 , its two maps are h ↦ h − 1 { R i ≤ h } h\mapsto h-\mathbf1_{\{R_i\le h\}} h ↦ h − 1 { R i ≤ h } for A i = 0 A_i=0 A i = 0 and h ↦ h + F i 1 { R i > h } h\mapsto h+F_i\mathbf1_{\{R_i>h\}} h ↦ h + F i 1 { R i > h } for A i = 1 A_i=1 A i = 1 . These formulas imply monotonicity. Increasing N N N replaces a zero carrier at the old endpoint by a nonnegative one; hence C d ( N ) C_d^{(N)} C d ( N ) increases in N N N .
Choose B ≥ 1 B\ge1 B ≥ 1 so large that p : = ρ m ( 1 − q B ) > λ p:=\rho_m(1-q^B)>\lambda p := ρ m ( 1 − q B ) > λ , and set T i = S i 1 { R i ≤ B } T_i=S_i\mathbf1_{\{R_i\le B\}} T i = S i 1 { R i ≤ B } . At a vertex with at least B B B recorded arrows, T i = 1 T_i=1 T i = 1 forces one to be emitted. If there are fewer than B B B , the outgoing carrier contains at most B B B arrows. Thus
Φ i ( h , A i ) ≤ max { B , h + A i − T i } , C d ( N ) ≤ B + max d ≤ j ≤ N ∑ i = d + 1 j ( A i − T i ) . \Phi_i(h,A_i)\le\max\{B,h+A_i-T_i\},\qquad
C_d^{(N)}\le B+\max_{d\le j\le N}\sum_{i=d+1}^j(A_i-T_i). Φ i ( h , A i ) ≤ max { B , h + A i − T i } , C d ( N ) ≤ B + d ≤ j ≤ N max i = d + 1 ∑ j ( A i − T i ) . The T i T_i T i are i.i.d. Bernoulli(p p p ), independent of ( A i ) (A_i) ( A i ) . By the ergodic theorem, the sums on the right have negative linear drift λ − p < 0 \lambda-p<0 λ − p < 0 , and their supremum is finite almost surely. This proves C d < ∞ C_d<\infty C d < ∞ . On a two-sided extension, ( C d ) (C_d) ( C d ) is a shift-invariant function of the stationary ergodic inputs and independent vertex randomness, hence is itself stationary and ergodic.
We claim that P ( C d = 0 ) > 0 \mathbb P(C_d=0)>0 P ( C d = 0 ) > 0 . Otherwise let h ≥ 1 h\ge1 h ≥ 1 be the smallest value with P ( C d = h ) > 0 \mathbb P(C_d=h)>0 P ( C d = h ) > 0 . Since λ < 1 \lambda<1 λ < 1 , almost every input has infinitely many sites with A i = 0 A_i=0 A i = 0 to the left of d d d . For some L L L , therefore, the event that C d = h C_d=h C d = h and at least one of A d − L + 1 , … , A d A_{d-L+1},\ldots,A_d A d − L + 1 , … , A d vanishes has positive probability. On these L L L vertices impose S i = 1 S_i=1 S i = 1 , F i = 0 F_i=0 F i = 0 , R i = 1 R_i=1 R i = 1 . These choices have positive probability independently of C d C_d C d and the physical inputs. By (4.32) , they leave the carrier size unchanged when A i = 1 A_i=1 A i = 1 and reduce it by one, if positive, when A i = 0 A_i=0 A i = 0 . Hence C d − L < h C_{d-L}<h C d − L < h with positive probability, contrary to the minimality of h h h .
Finally, fix b b b . On the event C d = 0 C_d=0 C d = 0 , there are almost surely infinitely many A i = 0 A_i=0 A i = 0 to the left. We may therefore choose a deterministic L L L such that the event
C d = 0 , ∑ i = d − L + 1 d ( 1 − A i ) ≥ b , S i = 1 , F i = 0 , R i = 1 ( d − L + 1 ≤ i ≤ d ) \begin{equation}
C_d=0,\qquad \sum_{i=d-L+1}^d(1-A_i)\ge b,
\qquad S_i=1,\ F_i=0,\ R_i=1\quad(d-L+1\le i\le d) \tag*{(4.33)}
\end{equation} C d = 0 , i = d − L + 1 ∑ d ( 1 − A i ) ≥ b , S i = 1 , F i = 0 , R i = 1 ( d − L + 1 ≤ i ≤ d ) (4.33) has positive probability. Indeed, the prescribed vertex choices are independent of C d C_d C d and of the physical inputs on this block. By ergodicity, such blocks occur arbitrarily far to the right. Each vertex with A i = 0 A_i=0 A i = 0 removes one recorded arrow, if present, while the other vertices leave the population unchanged; thus the block empties every entrance with at most b b b recorded arrows. ◻
The lemma also holds when the input indicators agree, outside an almost surely finite prefix, with a stationary ergodic sequence of mean less than ρ m \rho_m ρ m . Indeed, far enough to the right the scalar constructions coincide. For a fixed window and a bound b b b on the right-entrance population, take an erasing block (4.33) to the right of that window and of the exceptional prefix. At its right end, every zero-entrance truncation has an empty carrier. The colored carriers and outputs therefore agree to its left, uniformly over all choices of the b b b incoming arrows.
Proposition 4.13. Combination of engines (4.28) , sampled with common vertex randomness with all possible inputs from the bottom, are eventually identical on every fixed output window, almost surely, as N → ∞ N \to \infty N → ∞ .
Proof. First observe that the occupation indicators in the output of engine m m m depend only on its own random choices, not on its physical input. Indeed, the usual row emits a hole exactly when S i m , − = 0 S_i^{m,-}=0 S i m , − = 0 , and holes precede all other recorded colors in the return carrier. Writing H i H_i H i for the number of holes after its i i i th return vertex, we obtain the one-color rule
H i = Φ i m , + ( H i − 1 , 1 − S i m , − ) , 1 { ξ i = 0 } = H i − 1 + 1 − S i m , − − H i . \begin{equation}
H_i=\Phi_i^{m,+}(H_{i-1},1-S_i^{m,-}),\qquad
\mathbf1_{\{\xi_i=0\}}=H_{i-1}+1-S_i^{m,-}-H_i. \tag*{(4.34)}
\end{equation} H i = Φ i m , + ( H i − 1 , 1 − S i m , − ) , 1 { ξ i = 0 } = H i − 1 + 1 − S i m , − − H i . (4.34) Here the physical hole inputs 1 − S i m , − 1-S_i^{m,-} 1 − S i m , − are i.i.d. Bernoulli(1 − ρ m 1-\rho_m 1 − ρ m ) and are independent of the return-vertex choices and the almost surely finite boundary carrier H 0 H_0 H 0 .
For this one-color return row the scalar update is a birth–death chain. Its probabilities of gaining and losing a hole from state h h h are, respectively,
( 1 − ρ m ) ( 1 − ρ m + ρ m x q h ) , ρ m 2 ( 1 − q h ) . (1-\rho_m)(1-\rho_m+\rho_m xq^h),\qquad
\rho_m^2(1-q^h). ( 1 − ρ m ) ( 1 − ρ m + ρ m x q h ) , ρ m 2 ( 1 − q h ) . Since ρ m > 1 / 2 \rho_m>1/2 ρ m > 1/2 , the ratio of these probabilities tends to ( ( 1 − ρ m ) / ρ m ) 2 < 1 ((1-\rho_m)/\rho_m)^2<1 (( 1 − ρ m ) / ρ m ) 2 < 1 . The chain is positive recurrent and has an invariant distribution with a finite mean. Start a second copy in that distribution, using the same physical inputs and vertex choices. The larger of the two initial carrier populations dominates both copies and hits zero almost surely; from then on they coincide. The stationary copy has a stationary ergodic output occupation sequence. By arrow conservation and equality of the mean incoming and outgoing hole counts in stationarity, its mean occupation is ρ m \rho_m ρ m . Thus the actual occupation output agrees outside a finite random prefix with a stationary ergodic binary sequence of mean ρ m \rho_m ρ m .
Engine 1 1 1 is insensitive to its input by Lemma 4.9 . For m ≥ 2 m\ge2 m ≥ 2 , the recorded-input indicators of engine m m m are precisely the occupation indicators of engine m − 1 m-1 m − 1 . They are fixed across truncations by the input-independent recursion (4.34) , and have a stationary ergodic tail of mean ρ m − 1 < ρ m \rho_{m-1}<\rho_m ρ m − 1 < ρ m , independent of the new engine’s vertex choices. Lemma 4.12 and the erasing-block coupling above therefore construct the infinite usual row and give exact local agreement of its truncations; the return row is then read from left to right using the common boundary sample and vertex choices. Induction over the finitely many engines proves the asserted local limit. ◻
Stationarity
In this section we prove the first main result of the paper, Theorem thm:intro-vertex-form .
In the next lemma, we prove an analog of a stabilization result from the previous section for a fundamental double row, which will become an ASEP generator in the limit.
Lemma 4.14. For x = ( 1 − α − 1 ) + < u < 1 x=(1-\alpha^{-1})_+<u<1 x = ( 1 − α − 1 ) + < u < 1 set d ( u ) = ( 1 − u ) / ( 1 − q u ) < 1 d(u)=(1-u)/(1-qu)<1 d ( u ) = ( 1 − u ) / ( 1 − q u ) < 1 . The finite kernels T u N , c \mathfrak T_u^{N,c} T u N , c converge, independently of the incoming auxiliary color c c c , to a Markov kernel T u \mathfrak T_u T u on Ω n \Omega_n Ω n . For f f f supported on [ 1 , k ] [1,k] [ 1 , k ] and N > k N>k N > k , sup η , c ∣ T u N , c f ( η ∣ [ 1 , N ] ) − T u f ( η ) ∣ ≤ 2 ∥ f ∥ ∞ d ( u ) N − k .
\sup_{\eta,c}\left|
\mathfrak T_u^{N,c}f(\eta|_{[1,N]})-\mathfrak T_uf(\eta)
\right|\le 2\|f\|_\infty d(u)^{N-k}.
sup η , c T u N , c f ( η ∣ [ 1 , N ] ) − T u f ( η ) ≤ 2∥ f ∥ ∞ d ( u ) N − k . Moreover, δ 1 T u = δ 1 .
\delta_{\boldsymbol1}\mathfrak T_u=\delta_{\boldsymbol1}.
δ 1 T u = δ 1 .
Proof. At each fundamental vertex, the incoming colors can be exchanged with probability at least 1 − d ( u ) = u ( 1 − q ) / ( 1 − q u ) 1-d(u)=u(1-q)/(1-qu) 1 − d ( u ) = u ( 1 − q ) / ( 1 − q u ) . Sample an independent event of that probability on which the exchange is performed for all inputs. In the lower right-to-left pass, such an exchange at site j j j makes the auxiliary color continuing to the left independent of its distant right entrance. Two coupled truncations therefore agree on [ 1 , k ] [1,k] [ 1 , k ] unless every lower vertex at sites k + 1 , … , N k+1,\ldots,N k + 1 , … , N fails this event; the probability of failure is d ( u ) N − k d(u)^{N-k} d ( u ) N − k . This proves the bound and the existence of the limit. ◻
Proposition 4.15. Fix x < u < 1 x<u<1 x < u < 1 . Suppose ν T u = ν \nu\mathfrak T_u=\nu ν T u = ν and, for m ≥ 2 m\ge2 m ≥ 2 , the occupation indicators under ν \nu ν agree outside an almost surely finite prefix with a stationary ergodic binary sequence of mean λ < ρ m \lambda<\rho_m λ < ρ m , independently of the m m m th engine’s vertex choices. Then ( ν E m ) T u = ν E m .
(\nu\mathfrak E_m)\mathfrak T_u=\nu\mathfrak E_m.
( ν E m ) T u = ν E m . For m = 1 m=1 m = 1 the same holds for any invariant input law on C 1 N \mathcal C_1^{\mathbb N} C 1 N .
Proof. Apply the identity (4.31) with empty usual carrier and incoming fundamental color 0 0 0 , sum over the outgoing auxiliary states, and make the density specialization of Proposition 4.8 . The left-hand side consists of an engine followed by a fundamental double row with possibly random auxiliary entrance; the second consists of the fundamental double row with entrance 0 0 0 , followed by an engine with at most one additional recorded arrow in its right-entrance carrier. The final return crossing disappears on summing by stochasticity.
By (4.35) , the first side converges to ( ν E m ) T u (\nu\mathfrak E_m)\mathfrak T_u ( ν E m ) T u , regardless of the random auxiliary entrance. For the second, couple the finite fundamental output ζ N \zeta^N ζ N with the infinite output ζ = T u η \zeta=\mathfrak T_u\eta ζ = T u η , where η ∼ ν \eta\sim\nu η ∼ ν . For fixed L L L ,
P ( ζ N ∣ [ 1 , N − L ] ≠ ζ ∣ [ 1 , N − L ] ) ≤ d ( u ) L . \mathbb P\bigl(\zeta^N|_{[1,N-L]}\ne
\zeta|_{[1,N-L]}\bigr)\le d(u)^L. P ( ζ N ∣ [ 1 , N − L ] = ζ ∣ [ 1 , N − L ] ) ≤ d ( u ) L . On the agreement event, the last L L L sites introduce at most L + 1 L+1 L + 1 recorded carrier arrows. To their left the physical inputs agree. As ζ ∼ ν \zeta\sim\nu ζ ∼ ν and the next engine uses independent vertex choices, the erasing-block coupling following Lemma 4.12 removes every such bounded entrance before any fixed output window, uniformly in its colors. The limits of the two sides therefore differ, on a cylinder function f f f , by at most 2 ∥ f ∥ ∞ d ( u ) L 2\|f\|_\infty d(u)^L 2∥ f ∥ ∞ d ( u ) L . Letting L → ∞ L\to\infty L → ∞ proves the assertion. ◻
Proof of Theorem 1.2 . Let ν 0 = δ 1 \nu_0=\delta_{\boldsymbol1} ν 0 = δ 1 and ν m = ν m − 1 E m \nu_m=\nu_{m-1}\mathfrak E_m ν m = ν m − 1 E m . The local construction above identifies ν r = μ e n g \nu_r=\mu_{\mathrm{eng}} ν r = μ eng with the limit of the output of the combination of engines, as N → ∞ N \to \infty N → ∞ . The occupation indicators under ν m \nu_m ν m agree outside a finite prefix with a stationary ergodic binary sequence of mean ρ m \rho_m ρ m . Since ν 0 T u = ν 0 \nu_0\mathfrak T_u=\nu_0 ν 0 T u = ν 0 by (4.36) , the preceding proposition, applied successively with ρ m − 1 < ρ m \rho_{m-1}<\rho_m ρ m − 1 < ρ m , gives
μ e n g T u = μ e n g , x < u < 1. \begin{equation}
\mu_{\mathrm{eng}}\mathfrak T_u=\mu_{\mathrm{eng}},\qquad x<u<1. \tag*{(4.38)}
\end{equation} μ eng T u = μ eng , x < u < 1. (4.38) For a cylinder function f f f supported on [ 1 , k ] [1,k] [ 1 , k ] , take u ε = 1 − ( 1 − q ) ε u_\varepsilon=1-(1-q)\varepsilon u ε = 1 − ( 1 − q ) ε . Since d ( u ε ) = ε / ( 1 + q ε ) d(u_\varepsilon)=\varepsilon/(1+q\varepsilon) d ( u ε ) = ε / ( 1 + q ε ) , (4.35) allows us to truncate at k + 2 k+2 k + 2 , with error O f ( ε 2 ) O_f(\varepsilon^2) O f ( ε 2 ) . By Proposition 4.2 ,
T u ε f = T u ε k + 2 , 0 f + O f ( ε 2 ) = f + 2 ε L α f + O f ( ε 2 ) . \mathfrak T_{u_\varepsilon}f
=\mathfrak T_{u_\varepsilon}^{k+2,0}f+O_f(\varepsilon^2)
=f+2\varepsilon\mathcal L_\alpha f+O_f(\varepsilon^2). T u ε f = T u ε k + 2 , 0 f + O f ( ε 2 ) = f + 2 ε L α f + O f ( ε 2 ) . The finite right-end term does not act on f f f . Using (4.38) , dividing by 2 ε 2\varepsilon 2 ε , and sending ε ↓ 0 \varepsilon\downarrow0 ε ↓ 0 gives μ e n g ( L α f ) = 0 \mu_{\mathrm{eng}}(\mathcal L_\alpha f)=0 μ eng ( L α f ) = 0 , which is the desired stationarity. ◻
Boundary correlations
This section proves Theorem 1.4 by computing the joint color distribution at the first two sites of the stationary two-species ASEP on the half-line, using the engine construction of § 4 . Sub§ 5.1 collects the local transition probabilities and moment identities needed for these computations. Sub§ 5.2 treats the low–high density regime. For the high–high regime, Sub§ 5.3 introduces the mixed-crossing representation and determines the crossing’s output distribution; Sub§ 5.4 then uses these results to compute the two-site probabilities. Finally, Sub§ 5.5 treats α ≥ 1 \alpha\geq1 α ≥ 1 using the exact specialization constructed in § 4 .
In each case, color projection reduces the computation of the full two-site marginal to two probabilities. We give this common reduction here and use it throughout the section.
Reduction to two probabilities.
We use the notation ρ ˉ \bar\rho ρ ˉ , J ( ρ ) J(\rho) J ( ρ ) , and b u , v b_{u,v} b u , v from Sub§ 2.1 . The color projections merging { 1 , 2 } \{1,2\} { 1 , 2 } and { 0 , 2 } \{0,2\} { 0 , 2 } have stationary laws μ α , ρ 2 \mu^{\alpha,\rho_2} μ α , ρ 2 and μ α , ρ 1 \mu^{\alpha,\rho_1} μ α , ρ 1 , respectively, whose two-site marginals are given by Proposition 2.2 . After normalization, the nine probabilities p i j p_{ij} p ij have eight degrees of freedom, and the two projections give six independent constraints. For convenience, we compute p 22 p_{22} p 22 and p 20 p_{20} p 20 ; all other entries then follow from the two projected marginals. It therefore suffices to establish
p 22 = J 1 − J 2 α 2 ( J 1 θ 2 − q J 2 ) , p 20 = J 1 − J 2 α 2 ( J 1 θ ( 1 − θ ) + q J 2 ) . \begin{equation}
p_{22}=\frac{J_1-J_2}{\alpha^2}
\bigl(J_1\theta^2-qJ_2\bigr),
\qquad
p_{20}=\frac{J_1-J_2}{\alpha^2}
\bigl(J_1\theta(1-\theta)+qJ_2\bigr). \tag*{(5.1)}
\end{equation} p 22 = α 2 J 1 − J 2 ( J 1 θ 2 − q J 2 ) , p 20 = α 2 J 1 − J 2 ( J 1 θ ( 1 − θ ) + q J 2 ) . (5.1)
ASEP specializations of the boundary and row vertex weights
We collect the identities for the laws defined in (2.7) and (2.8) that will be used repeatedly below.
Lemma 5.1. Let 0 ≤ q < 1 0\leq q<1 0 ≤ q < 1 , s < 1 s<1 s < 1 , 0 ≤ b < 1 0\leq b<1 0 ≤ b < 1 , and υ ∼ q - N B ( s , b ) \upsilon\sim q\text{-}\mathrm{NB}(s,b) υ ∼ q - NB ( s , b ) . For ∣ b z ∣ < 1 |bz|<1 ∣ b z ∣ < 1 , E [ z υ ] = ( b ; q ) ∞ ( s b z ; q ) ∞ ( s b ; q ) ∞ ( b z ; q ) ∞ .
\mathbb E[z^\upsilon]
=\frac{(b;q)_\infty(sbz;q)_\infty}
{(sb;q)_\infty(bz;q)_\infty}.
E [ z υ ] = ( s b ; q ) ∞ ( b z ; q ) ∞ ( b ; q ) ∞ ( s b z ; q ) ∞ . Consequently, for m ∈ Z ≥ 0 m\in\mathbb Z_{\geq0} m ∈ Z ≥ 0 , E [ q m υ ] = ( b ; q ) m ( s b ; q ) m .
\mathbb E[q^{m\upsilon}]
=\frac{(b;q)_m}{(sb;q)_m}.
E [ q m υ ] = ( s b ; q ) m ( b ; q ) m . More generally, for ℓ ∈ Z ≥ 1 \ell\in\mathbb Z_{\geq1} ℓ ∈ Z ≥ 1 , E [ 1 { υ ≥ ℓ } ∏ r = 0 ℓ − 1 ( 1 − q υ − r ) ] = b ℓ ( s ; q ) ℓ ( s b ; q ) ℓ .
\mathbb E\!\left[
\mathbf 1_{\{\upsilon\geq\ell\}}
\prod_{r=0}^{\ell-1}(1-q^{\upsilon-r})
\right]
=\frac{b^\ell(s;q)_\ell}{(sb;q)_\ell}.
E [ 1 { υ ≥ ℓ } ∏ r = 0 ℓ − 1 ( 1 − q υ − r ) ] = ( s b ; q ) ℓ b ℓ ( s ; q ) ℓ .
In particular, if υ ∼ q - P o i ( b ) \upsilon\sim q\text{-}\mathrm{Poi}(b) υ ∼ q - Poi ( b ) , then E [ q m υ ] = ( b ; q ) m , E [ 1 − q υ ] = b , E [ q υ ( 1 − q υ ) ] = q b ( 1 − b ) , E [ 1 { υ ≥ 2 } ( 1 − q υ ) ( 1 − q υ − 1 ) ] = b 2 .
\begin{gathered}
\mathbb E[q^{m\upsilon}]=(b;q)_m,
\qquad
\mathbb E[1-q^\upsilon]=b,\\
\mathbb E[q^\upsilon(1-q^\upsilon)]=qb(1-b),
\qquad
\mathbb E\!\left[
\mathbf 1_{\{\upsilon\geq2\}}(1-q^\upsilon)(1-q^{\upsilon-1})
\right]=b^2.
\end{gathered}
E [ q m υ ] = ( b ; q ) m , E [ 1 − q υ ] = b , E [ q υ ( 1 − q υ )] = q b ( 1 − b ) , E [ 1 { υ ≥ 2 } ( 1 − q υ ) ( 1 − q υ − 1 ) ] = b 2 .
Proof. Equation (5.2) is the q q q -binomial theorem. Setting z = q m z=q^m z = q m proves (5.3) . Multiplying p s , b ( q ) ( k ) p_{s,b}^{(q)}(k) p s , b ( q ) ( k ) by 1 { k ≥ ℓ } ∏ r = 0 ℓ − 1 ( 1 − q k − r ) \mathbf 1_{\{k\geq\ell\}}
\prod_{r=0}^{\ell-1}(1-q^{k-r}) 1 { k ≥ ℓ } ∏ r = 0 ℓ − 1 ( 1 − q k − r ) , shifting k k k by ℓ \ell ℓ , and applying the same theorem proves (5.4) . The final identities are the specialization s = 0 s=0 s = 0 . ◻
We use the boundary kernels K α , ρ ( m ) \mathbb K^{(m)}_{\alpha,\rho} K α , ρ ( m ) obtained by the ASEP density specialization (4.26) . The following statement records their output laws for m = 1 , 2 m=1,2 m = 1 , 2 .
Lemma 5.2. Let 0 < α , ρ < 1 0<\alpha,\rho<1 0 < α , ρ < 1 with α + ρ > 1 \alpha+\rho>1 α + ρ > 1 . Under the ASEP density specialization, the boundary output H = ( h 0 , h 2 ) H=(h_0,h_2) H = ( h 0 , h 2 ) satisfies h 0 ∼ q - P o i ( b α , ρ ) , h 2 = 0 almost surely , h_0\sim q\text{-}\mathrm{Poi}(b_{\alpha,\rho}),
\qquad h_2=0\quad\text{almost surely}, h 0 ∼ q - Poi ( b α , ρ ) , h 2 = 0 almost surely , for input ( ∞ , 0 ) (\infty,0) ( ∞ , 0 ) when m = 1 m=1 m = 1 , and for input ( g , ∞ ) (g,\infty) ( g , ∞ ) when m = 2 m=2 m = 2 , for every g ∈ Z ≥ 0 g\in\mathbb Z_{\geq0} g ∈ Z ≥ 0 . In the latter case, the output law does not depend on g g g ; consequently, for a random input g g g , the boundary output is independent of g g g .
Proof. This follows from Corollary 4.5 with n = 2 n=2 n = 2 and m = 1 , 2 m=1,2 m = 1 , 2 , respectively. ◻
In both density regimes, the reflected row uses the kernel L ^ ρ v e r \widehat L^{\mathrm{ver}}_\rho L ρ ver from § 4 . Its two-color transition probabilities are as follows.
Lemma 5.3. Fix 0 ≤ q < 1 0\leq q<1 0 ≤ q < 1 and ρ ∈ ( 0 , 1 ) \rho\in(0,1) ρ ∈ ( 0 , 1 ) . Given i ∈ C 2 i\in\mathcal C_2 i ∈ C 2 and a horizontal queue state ( h 0 , h 2 ) ∈ Z ≥ 0 2 (h_0,h_2)\in\mathbb Z_{\geq0}^2 ( h 0 , h 2 ) ∈ Z ≥ 0 2 , let p q , ρ ( i , j ∣ h 0 , h 2 ) \mathsf p_{q,\rho}(i,j\mid h_0,h_2) p q , ρ ( i , j ∣ h 0 , h 2 ) be the probability of output color j ∈ C 2 j\in\mathcal C_2 j ∈ C 2 . Rows and columns in the following table are displayed in the order 0 , 2 , 1 0,2,1 0 , 2 , 1 :
\begingroup
\renewcommand{\arraystretch}{1.55}
\begin{array}{c|ccc}
\mathsf p_{q,\rho}(i,j\mid h_0,h_2)
&j=0&j=2&j=1\\
\hline
i=0
&\rho
&0
&\bar\rho
\\
i=2
&\rho(1-q^{h_0})
&\rho q^{h_0}
&\bar\rho
\\
i=1
&\rho(1-q^{h_0})
&\rho q^{h_0}(1-q^{h_2})
&\bar\rho+\rho q^{h_0+h_2}
\end{array}
\endgroup
With the hole-state vectors E ^ i \widehat E_i E i from Example 3.9 , the arrow configuration is updated deterministically according to ( h 0 ′ , h 2 ′ ) = ( h 0 , h 2 ) + E ^ i − E ^ j . (h_0',h_2')=(h_0,h_2)+\widehat E_i-\widehat E_j. ( h 0 ′ , h 2 ′ ) = ( h 0 , h 2 ) + E i − E j .
Two-species low–high-density stationary measure
Throughout this subsection we assume regime (L) of Theorem 1.4 ; in particular,
ρ 1 = α , 0 < α ≤ 1 2 , 1 − α < ρ 2 < 1. \rho_1=\alpha,\qquad 0<\alpha\leq\frac12,\qquad 1-\alpha<\rho_2<1. ρ 1 = α , 0 < α ≤ 2 1 , 1 − α < ρ 2 < 1.
We use the construction in Figure 18 , in which the engine for color 2 2 2 receives a Bernoulli input of density α \alpha α . The following lemma obtains this representation from the two-engine construction by taking the first engine to its critical density.
Lemma 5.4. For 1 − α < ρ < ρ 2 1-\alpha<\rho<\rho_2 1 − α < ρ < ρ 2 , let μ N , ρ \mu_{N,\rho} μ N , ρ be the output law of the finite zero-input array with N N N sites and engine densities ( ρ , ρ 2 ) (\rho,\rho_2) ( ρ , ρ 2 ) . For each fixed N N N , the output law of the first engine converges to Ber ( α ) ⊗ N \operatorname{Ber}(\alpha)^{\otimes N} Ber ( α ) ⊗ N as ρ ↓ 1 − α \rho\downarrow1-\alpha ρ ↓ 1 − α . Moreover, the two iterated limits lim ρ ↓ 1 − α lim N → ∞ μ N , ρ = lim N → ∞ lim ρ ↓ 1 − α μ N , ρ = μ α , α , ρ 2 \lim_{\rho\downarrow1-\alpha}\lim_{N\to\infty}\mu_{N,\rho}
=\lim_{N\to\infty}\lim_{\rho\downarrow1-\alpha}\mu_{N,\rho}
=\mu^{\alpha,\alpha,\rho_2} lim ρ ↓ 1 − α lim N → ∞ μ N , ρ = lim N → ∞ lim ρ ↓ 1 − α μ N , ρ = μ α , α , ρ 2 exist and agree locally. Their common limit is stationary for the two-species half-space ASEP and is given by the single-engine construction in Figure 18 , with input law π α \pi^\alpha π α independent of the randomness of the remaining engine.
[
baseline={([yshift=-.5ex]current bounding box.center)},
scale=.85
]
\foreach \x/\instate/\midstate/\outstate in {
2/{\eta_1}/{\pi_1}/{\mu_1},
3/{\eta_2}/{\pi_2}/{\mu_2},
4/{\eta_3}/{\pi_3}/{\mu_3},
5/{\cdots}/{\cdots}/{\cdots},
6/{\cdots}/{\cdots}/{\cdots},
7/{\cdots}/{\cdots}/{\cdots}}
{
\draw[paper wire,->] (\x,-.75)--(\x,1.75);
\node[below] at (\x,-.75) {$\instate$};
\node[anchor=east,xshift=-2pt,inner sep=0pt]
at (\x,.5) {$\midstate$};
\node[above] at (\x,1.75) {$\outstate$};
}
\draw[paper normal] (8,0) -- (1,0) -- (0,.5);
\draw[paper hole,->] (0,.5) -- (1,1) -- (8,1);
\node[paper boundary] at (0,.5) {};
\node[right=3pt] at (8,0) {$(0,\infty)$};
\node[right=36pt] at (8,0) {$\scriptstyle\rho_2$};
\node[right=3pt,text=holecolor] at (8,1) {$\sum H$};Figure 18. The limiting construction in Lemma 5.4 . The first engine is replaced by the Bernoulli input η ∼ π α \eta\sim\pi^\alpha η ∼ π α , and the remaining engine has density ρ 2 \rho_2 ρ 2 .
Proof. The first engine starts its reflected row with
h 0 ∼ q - P o i ( b α , ρ ) . h_0\sim q\text{-}\mathrm{Poi}(b_{\alpha,\rho}). h 0 ∼ q - Poi ( b α , ρ ) . As ρ ↓ 1 − α \rho\downarrow1-\alpha ρ ↓ 1 − α , we have b α , ρ ↑ 1 b_{\alpha,\rho}\uparrow1 b α , ρ ↑ 1 , so h 0 h_0 h 0 tends to infinity in probability. At fixed N N N , the hole count can decrease by at most N N N , and hence tends to infinity throughout the reflected row. In the one-color restriction of (5.6) , the probability of output color 1 1 1 consequently tends to 1 − ρ → α 1-\rho\to\alpha 1 − ρ → α , regardless of the incoming color. The independent randomness at different vertices therefore gives the product law Ber ( α ) ⊗ N \operatorname{Ber}(\alpha)^{\otimes N} Ber ( α ) ⊗ N . Applying the second engine yields the finite version of Figure 18 .
To justify the exchange of limits, choose 1 − α < u ˉ < ρ 2 1-\alpha<\bar u<\rho_2 1 − α < u ˉ < ρ 2 and restrict to 1 − α < ρ ≤ u ˉ 1-\alpha<\rho\leq\bar u 1 − α < ρ ≤ u ˉ . Since ρ > α \rho>\alpha ρ > α , we have b α , ρ ≥ b ρ , ρ b_{\alpha,\rho}\geq b_{\rho,\rho} b α , ρ ≥ b ρ , ρ . The stationary one-color Martin coupling with densities 1 − ρ 1-\rho 1 − ρ and ρ \rho ρ has carrier law q - P o i ( b ρ , ρ ) q\text{-}\mathrm{Poi}(b_{\rho,\rho}) q - Poi ( b ρ , ρ ) and Bernoulli product occupation output of density ρ \rho ρ , by Theorem 2.3 and Proposition 2.21 . Since the q q q -Poisson laws are stochastically increasing in their parameter, the common graphical realization couples the first-engine boundary carrier above this stationary carrier and its occupation output below the stationary Bernoulli sequence. It is therefore also dominated by a Bernoulli product sequence of density u ˉ \bar u u ˉ . Since u ˉ < ρ 2 \bar u<\rho_2 u ˉ < ρ 2 , the erasing-block coupling following Lemma 4.12 gives a finite-engine approximation for the second engine on every fixed output window, uniformly in ρ \rho ρ . For each fixed truncation, the Bernoulli convergence established above applies. Removing the truncation proves that the two iterated limits agree.
For every 1 − α < ρ < ρ 2 1-\alpha<\rho<\rho_2 1 − α < ρ < ρ 2 , the limit as N → ∞ N\to\infty N → ∞ is stationary by Theorem thm:engine-array-stationarity . Since the ASEP generator maps cylinder functions to cylinder functions, the stationarity identity passes to the local limit ρ ↓ 1 − α \rho\downarrow1-\alpha ρ ↓ 1 − α . Consequently, the limiting measure is stationary. ◻
Let η \eta η , π \pi π , and μ \mu μ denote the configurations below, between, and above the two rows in Figure 18 , respectively. The input η \eta η has Bernoulli product law π α \pi^\alpha π α . Reading from right to left, the unreflected row realizes Martin’s queue with arrival density α \alpha α and service density ρ 2 \rho_2 ρ 2 . Proposition 2.21 therefore gives
π ∼ π α , ρ 2 , \pi\sim\pi^{\alpha,\rho_2}, π ∼ π α , ρ 2 ,
where the full-space law is restricted to the positive sites. Its two-site marginal is given by Theorem 2.4 .
At the left boundary, the unreflected row supplies the input ( g , ∞ ) (g,\infty) ( g , ∞ ) . Given the entire unreflected row, the boundary kernel depends only on this input and, by Lemma 5.2 , returns ( h 0 , 0 ) (h_0,0) ( h 0 , 0 ) , where
h 0 ∼ q - P o i ( b α , ρ 2 ) . h_0\sim q\text{-}\mathrm{Poi}(b_{\alpha,\rho_2}). h 0 ∼ q - Poi ( b α , ρ 2 ) .
This conditional output law is the same for every g g g , so h 0 h_0 h 0 is independent of π \pi π . Starting from ( h 0 , 0 ) (h_0,0) ( h 0 , 0 ) , the reflected row is sampled from left to right using fresh, independent vertex randomness. At site i i i , the vertical input is π ( i ) \pi(i) π ( i ) and the output color μ ( i ) \mu(i) μ ( i ) is sampled according to (5.6) , with ρ = ρ 2 \rho=\rho_2 ρ = ρ 2 and the current horizontal arrow configuration. The latter is updated by the conservation rule in Lemma 5.3 . By Lemma 5.4 , the resulting configuration has law μ ∼ μ α , α , ρ 2 \mu\sim\mu^{\alpha,\alpha,\rho_2} μ ∼ μ α , α , ρ 2 .
For the two direct calculations, we use the elementary identities
1 − b u , v = u + v − 1 u v , 1 − q b u , v = u v − q ( 1 − u ) ( 1 − v ) u v \begin{equation}
1-b_{u,v}=\frac{u+v-1}{uv},
\qquad
1-qb_{u,v}=\frac{uv-q(1-u)(1-v)}{uv} \tag*{(5.7)}
\end{equation} 1 − b u , v = uv u + v − 1 , 1 − q b u , v = uv uv − q ( 1 − u ) ( 1 − v ) (5.7)
and the low–high identity
J 1 − J 2 = α ( 1 − α ) − ρ 2 ρ ˉ 2 = ( ρ 2 − α ) ( α + ρ 2 − 1 ) . \begin{equation}
J_1-J_2
=\alpha(1-\alpha)-\rho_2\bar\rho_2
=(\rho_2-\alpha)(\alpha+\rho_2-1). \tag*{(5.8)}
\end{equation} J 1 − J 2 = α ( 1 − α ) − ρ 2 ρ ˉ 2 = ( ρ 2 − α ) ( α + ρ 2 − 1 ) . (5.8)
We first compute p 22 p_{22} p 22 .
Proposition. The first identity in (5.1) holds under regime (L) of Theorem 1.4 .
Proof. Since the boundary output has no color–2 2 2 arrows, (5.6) forces π ( 1 ) = π ( 2 ) = 2 \pi(1)=\pi(2)=2 π ( 1 ) = π ( 2 ) = 2 whenever μ ( 1 ) = μ ( 2 ) = 2 \mu(1)=\mu(2)=2 μ ( 1 ) = μ ( 2 ) = 2 . Each 2 → 2 2\to2 2 → 2 transition has weight ρ 2 q h 0 \rho_2q^{h_0} ρ 2 q h 0 and leaves ( h 0 , 0 ) (h_0,0) ( h 0 , 0 ) unchanged, so independence of π \pi π and h 0 h_0 h 0 gives
p 22 = ρ 2 2 P ( π ( 1 ) = 2 , π ( 2 ) = 2 ) E [ q 2 h 0 ] . \begin{equation}
p_{22}=\rho_2^2
\mathbb P\bigl(\pi(1)=2,\pi(2)=2\bigr)
\mathbb E[q^{2h_0}]. \tag*{(5.9)}
\end{equation} p 22 = ρ 2 2 P ( π ( 1 ) = 2 , π ( 2 ) = 2 ) E [ q 2 h 0 ] . (5.9) Theorem 2.4 gives
P ( π ( 1 ) = 2 , π ( 2 ) = 2 ) = ( ρ 2 − α ) ( ( 1 − α ) ρ 2 − q α ρ ˉ 2 ) . \mathbb P\bigl(\pi(1)=2,\pi(2)=2\bigr)
=(\rho_2-\alpha)
\bigl((1-\alpha)\rho_2-q\alpha\bar\rho_2\bigr). P ( π ( 1 ) = 2 , π ( 2 ) = 2 ) = ( ρ 2 − α ) ( ( 1 − α ) ρ 2 − q α ρ ˉ 2 ) . Substituting this and the moment formula (5.5) into (5.9) , and using (5.8) and (5.7) , proves the claim since θ = ρ 2 + q ρ ˉ 2 \theta=\rho_2+q\bar\rho_2 θ = ρ 2 + q ρ ˉ 2 and
( α ρ 2 − q ( 1 − α ) ρ ˉ 2 ) ( ( 1 − α ) ρ 2 − q α ρ ˉ 2 ) = α ( 1 − α ) ( ρ 2 + q ρ ˉ 2 ) 2 − q ρ 2 ρ ˉ 2 = J 1 θ 2 − q J 2 . \bigl(\alpha\rho_2-q(1-\alpha)\bar\rho_2\bigr)
\bigl((1-\alpha)\rho_2-q\alpha\bar\rho_2\bigr)
=\alpha(1-\alpha)(\rho_2+q\bar\rho_2)^2
-q\rho_2\bar\rho_2=J_1\theta^2-qJ_2. ( α ρ 2 − q ( 1 − α ) ρ ˉ 2 ) ( ( 1 − α ) ρ 2 − q α ρ ˉ 2 ) = α ( 1 − α ) ( ρ 2 + q ρ ˉ 2 ) 2 − q ρ 2 ρ ˉ 2 = J 1 θ 2 − q J 2 . ◻
We next compute p 20 p_{20} p 20 .
Proposition. The second identity in (5.1) holds under regime (L) of Theorem 1.4 .
Proof. As in the preceding proof, the first output 2 2 2 requires π ( 1 ) = 2 \pi(1)=2 π ( 1 ) = 2 and leaves ( h 0 , 0 ) (h_0,0) ( h 0 , 0 ) unchanged. Separating the cases π ( 2 ) = 0 \pi(2)=0 π ( 2 ) = 0 and π ( 2 ) ∈ { 1 , 2 } \pi(2)\in\{1,2\} π ( 2 ) ∈ { 1 , 2 } , we obtain from (5.6) and independence of π \pi π and h 0 h_0 h 0
p 20 = ρ 2 2 { P ( π ( 1 ) = 2 , π ( 2 ) = 0 ) E [ q h 0 ] + P ( π ( 1 ) = 2 , π ( 2 ) ∈ { 1 , 2 } ) E [ q h 0 ( 1 − q h 0 ) ] } . \begin{align}
p_{20}
&=\rho_2^2\Bigl\{
\mathbb P\bigl(\pi(1)=2,\pi(2)=0\bigr)\mathbb E[q^{h_0}]
+\mathbb P\bigl(\pi(1)=2,\pi(2)\in\{1,2\}\bigr)
\mathbb E\bigl[q^{h_0}(1-q^{h_0})\bigr]\Bigr\}. \tag*{(5.10)}
\end{align} p 20 = ρ 2 2 { P ( π ( 1 ) = 2 , π ( 2 ) = 0 ) E [ q h 0 ] + P ( π ( 1 ) = 2 , π ( 2 ) ∈ { 1 , 2 } ) E [ q h 0 ( 1 − q h 0 ) ] } . (5.10) Theorem 2.4 gives
P ( π ( 1 ) = 2 , π ( 2 ) ∈ { 1 , 2 } ) = ( ρ 2 − α ) ( ρ 2 + α ( 1 − θ ) ) , P ( π ( 1 ) = 2 , π ( 2 ) = 0 ) = ( ρ 2 − α ) [ 1 − ρ 2 − α ( 1 − θ ) ] . \begin{align*}
\mathbb P\bigl(\pi(1)=2,\pi(2)\in\{1,2\}\bigr)
&=(\rho_2-\alpha)\bigl(\rho_2+\alpha(1-\theta)\bigr),\\
\mathbb P\bigl(\pi(1)=2,\pi(2)=0\bigr)
&=(\rho_2-\alpha)\bigl[1-\rho_2-\alpha(1-\theta)\bigr].
\end{align*} P ( π ( 1 ) = 2 , π ( 2 ) ∈ { 1 , 2 } ) P ( π ( 1 ) = 2 , π ( 2 ) = 0 ) = ( ρ 2 − α ) ( ρ 2 + α ( 1 − θ ) ) , = ( ρ 2 − α ) [ 1 − ρ 2 − α ( 1 − θ ) ] . Substituting these probabilities and the moments (5.5) into (5.10) yields
p 20 = ρ 2 2 ( 1 − b α , ρ 2 ) ( ρ 2 − α ) [ 1 − ( 1 − q b α , ρ 2 ) ( ρ 2 + α ( 1 − θ ) ) ] . \begin{equation}
p_{20}=\rho_2^2(1-b_{\alpha,\rho_2})(\rho_2-\alpha)
\Bigl[1-(1-qb_{\alpha,\rho_2})
\bigl(\rho_2+\alpha(1-\theta)\bigr)\Bigr]. \tag*{(5.11)}
\end{equation} p 20 = ρ 2 2 ( 1 − b α , ρ 2 ) ( ρ 2 − α ) [ 1 − ( 1 − q b α , ρ 2 ) ( ρ 2 + α ( 1 − θ ) ) ] . (5.11) Applying (5.8) , (5.7) , and 1 − θ = ( 1 − q ) ρ ˉ 2 1-\theta=(1-q)\bar\rho_2 1 − θ = ( 1 − q ) ρ ˉ 2 gives the second identity in (5.1) . ◻
Propositions (?) and (?) establish (5.1) in regime (L). The reduction at the beginning of this section therefore proves regime (L) of Theorem 1.4 .
The mixed crossing and the two-engine construction
Direct computation from the original two-engine construction is difficult, since the upper engine receives the lower engine’s half-space output. Introducing a mixed crossing allows us to bring the two unreflected rows together, where they form Martin’s two-level queue. We can then use its known limiting output law and conditional queue distributions, substantially simplifying the calculation.
Throughout this subsection, assume
0 < α < 1 , 1 2 < ρ 1 < ρ 2 < 1 , α + ρ 1 > 1. 0<\alpha<1,\qquad
\frac12<\rho_1<\rho_2<1,\qquad
\alpha+\rho_1>1. 0 < α < 1 , 2 1 < ρ 1 < ρ 2 < 1 , α + ρ 1 > 1.
The lower m = 1 m=1 m = 1 and upper m = 2 m=2 m = 2 engines have densities ρ 1 \rho_1 ρ 1 and ρ 2 \rho_2 ρ 2 , respectively. For a row with spectral parameter x x x and spin s s s , the service density is ρ = ( 1 − s x ) − 1 \rho=(1-sx)^{-1} ρ = ( 1 − s x ) − 1 . The ASEP specialization (4.26) keeps this density fixed as x ↓ 0 x\downarrow0 x ↓ 0 , which determines the spin parameters below. Write ( x 1 , τ ) (x_1,\tau) ( x 1 , τ ) and ( x 2 , σ ) (x_2,\sigma) ( x 2 , σ ) for the parameters of the two engines, and set a = α / ( α − 1 ) a=\alpha/(\alpha-1) a = α / ( α − 1 ) . The resulting specialization is
z = x 1 x 2 , τ : = − ρ ˉ 1 ρ 1 x 1 , σ : = − ρ ˉ 2 ρ 2 x 2 , x 1 , x 2 ↓ 0. \begin{equation}
z=x_1x_2,
\qquad
\tau:=-\frac{\bar\rho_1}{\rho_1x_1},
\qquad
\sigma:=-\frac{\bar\rho_2}{\rho_2x_2},
\qquad x_1,x_2\downarrow0. \tag*{(5.12)}
\end{equation} z = x 1 x 2 , τ := − ρ 1 x 1 ρ ˉ 1 , σ := − ρ 2 x 2 ρ ˉ 2 , x 1 , x 2 ↓ 0. (5.12)
The following proposition shows that this rearrangement preserves the local output law in the infinite-volume limit.
Proposition 5.7. Under the assumptions above and the specialization (5.12) , the two constructions in Figure 19 have the same local limiting output law.
[
baseline={([yshift=-.5ex]current bounding box.center)},
scale=.58,
thickgray/.style={paper normal},
thicksalmon/.style={paper hole},
thingray/.style={paper wire},
every node/.style={inner sep=1.2pt}
]
\foreach \x in {2,...,7}
\draw[thingray,->] (\x,-.7) -- (\x,3.7);
\draw[thickgray] (8,2) -- (1,2) -- (0,2.5);
\draw[thicksalmon,->] (0,2.5) -- (1,3) -- (8,3);
\fill[black] (0,2.5) circle (1.7pt);
\draw[thickgray] (8,0) -- (1,0) -- (0,.5);
\draw[thicksalmon,->] (0,.5) -- (1,1) -- (8,1);
\fill[black] (0,.5) circle (1.7pt);
\foreach \x in {2,3,4,6,7}
\node[below] at (\x,-.7) {$0$};
\node[below] at (5,-.7) {$\cdots$};
\foreach \x/\lab in {2/\mu_1,3/\mu_2,4/\mu_3,5/\cdots,6/\cdots,7/\cdots}
\node[above] at (\x,3.7) {$\lab$};
\node[align=center] at (10,2.45)
{\scriptsize same local\\[-1pt]\scriptsize output law};
\node at (10,1.35) {$\Longleftrightarrow$};
\foreach \x in {14,...,19}
\draw[thingray,->] (\x,-.7) -- (\x,3.7);
\draw[thickgray] (20,1) -- (13,1) -- (12,2.25);
\draw[thicksalmon,->] (12,2.25) -- (13,3) -- (20,3);
\fill[black] (12,2.25) circle (1.7pt);
\draw[thickgray] (20,0) -- (13,0) -- (12,.75);
\draw[thicksalmon,->] (12,.75) -- (13,2) -- (20,2);
\fill[black] (12,.75) circle (1.7pt);
\fill[black] (12.6,1.5) circle (1.9pt);
\foreach \x in {14,15,16,18,19}
\node[below] at (\x,-.7) {$0$};
\node[below] at (17,-.7) {$\cdots$};
\foreach \x/\lab in {14/\mu_1,15/\mu_2,16/\mu_3,17/\cdots,18/\cdots,19/\cdots}
\node[above] at (\x,3.7) {$\lab$};Figure 19. Local limits of the two diagrams in Figure 20 : the original two-engine construction (left) and the representation with a mixed vertex between the boundary rows (right). Both have the same stationary output law.
Proof. Fix N N N , and let H ~ R ( N ) \widetilde{\mathfrak H}^{(N)}_{\mathrm R} H R ( N ) and H ~ L ( N ) \widetilde{\mathfrak H}^{(N)}_{\mathrm L} H L ( N ) denote the partition functions in Figure 20 , with the crossing at the right and left endpoints, respectively. For fixed exposed arrow configurations, successive applications of the continued Yang–Baxter identity of Proposition 3.11 give
H ~ R ( N ) = H ~ L ( N ) . \begin{equation}
\widetilde{\mathfrak H}^{(N)}_{\mathrm R}
=\widetilde{\mathfrak H}^{(N)}_{\mathrm L}. \tag*{(5.13)}
\end{equation} H R ( N ) = H L ( N ) . (5.13) At fixed N N N , we now take the specialization (5.12) . The limiting kernels are stochastic by Propositions 4.8 and 5.8 , so (5.13) gives equality of the finite-volume output laws.
[
baseline={([yshift=-.5ex]current bounding box.center)},
scale=0.58,
every node/.style={inner sep=1.2pt}
]
\foreach \x in {2,...,7}
\draw[paper wire,->] (\x,-.7) -- (\x,3.7);
\draw[paper normal]
(8.5,1) -- (8,1.5) -- (7.5,2)
-- (1,2) -- (0,2.5);
\draw[paper hole,->]
(0,2.5) -- (1,3) -- (8,3);
\draw[paper normal]
(8,0) -- (1,0) -- (0,.5);
\draw[paper hole,->]
(0,.5) -- (1,1) -- (7.5,1)
-- (8,1.5) -- (8.5,2);
\node[paper boundary] at (0,2.5) {};
\node[paper boundary] at (0,.5) {};
\node[right=2pt] at (8,0) {$(\infty,0)$};
\node[right=36pt] at (8,0) {$(x_1,\tau)$};
\node[right=2pt] at (8.5,1) {$(0,\infty)$};
\node[right=36pt] at (8.5,1) {$(x_2,\sigma)$};
\node[right=2pt,text=holecolor] at (8.5,2)
{$\sum H^{(1)}$};
\node[right=2pt,text=holecolor] at (8,3)
{$\sum H^{(2)}$};
\node[below] at (2,-.7) {$0$};
\node[below] at (3,-.7) {$0$};
\node[below] at (4,-.7) {$0$};
\node[below] at (5,-.7) {$\cdots$};
\node[below] at (6,-.7) {$\cdots$};
\node[below] at (7,-.7) {$0$};
\node[above] at (2,3.7) {$\mu_1$};
\node[above] at (3,3.7) {$\mu_2$};
\node[above] at (4,3.7) {$\mu_3$};
\node[above] at (5,3.7) {$\cdots$};
\node[above] at (6,3.7) {$\cdots$};
\node[above] at (7,3.7) {$\mu_N$};
\node at (11.8,1.5) {$=$};
\begin{scope}[xshift=1.25cm]
\foreach \x in {14,...,19}
\draw[paper wire,->] (\x,-.7) -- (\x,3.7);
\draw[paper normal]
(20,1) -- (13,1) -- (12,2.25);
\draw[paper hole,->]
(12,2.25) -- (13,3) -- (20,3);
\draw[paper normal]
(20,0) -- (13,0) -- (12,.75);
\draw[paper hole,->]
(12,.75) -- (13,2) -- (20,2);
\node[paper boundary] at (12,2.25) {};
\node[paper boundary] at (12,.75) {};
\node[right=2pt] at (20,0) {$(\infty,0)$};
\node[right=36pt] at (20,0) {$(x_1,\tau)$};
\node[right=2pt] at (20,1) {$(0,\infty)$};
\node[right=36pt] at (20,1) {$(x_2,\sigma)$};
\node[right=2pt,text=holecolor] at (20,2)
{$\sum H^{(1)}$};
\node[right=2pt,text=holecolor] at (20,3)
{$\sum H^{(2)}$};
\node[below] at (14,-.7) {$0$};
\node[below] at (15,-.7) {$0$};
\node[below] at (16,-.7) {$0$};
\node[below] at (17,-.7) {$\cdots$};
\node[below] at (18,-.7) {$\cdots$};
\node[below] at (19,-.7) {$0$};
\node[above] at (14,3.7) {$\mu_1$};
\node[above] at (15,3.7) {$\mu_2$};
\node[above] at (16,3.7) {$\mu_3$};
\node[above] at (17,3.7) {$\cdots$};
\node[above] at (18,3.7) {$\cdots$};
\node[above] at (19,3.7) {$\mu_N$};
\end{scope}Figure 20. The finite-volume Yang–Baxter identity at cutoff N N N . The mixed vertex is moved from the right endpoint (left) to the position between the two boundary rows (right).
In the diagram with the crossing at the right endpoint, its inputs are G = ( 0 , ∞ ) G=(0,\infty) G = ( 0 , ∞ ) and H = ( h 0 , 0 ) H=(h_0,0) H = ( h 0 , 0 ) . The case g 1 = 0 g_1=0 g 1 = 0 of Proposition 5.8 gives
g 1 ′ = h 0 ′ ∼ q - P o i ( b ρ 1 , ρ 2 ) , g_1'=h_0'\sim q\text{-}\mathrm{Poi}(b_{\rho_1,\rho_2}), g 1 ′ = h 0 ′ ∼ q - Poi ( b ρ 1 , ρ 2 ) , independently of h 0 h_0 h 0 . Since b ρ 1 , ρ 2 < 1 b_{\rho_1,\rho_2}<1 b ρ 1 , ρ 2 < 1 and this law does not depend on N N N , the laws of g 1 ′ g_1' g 1 ′ form a tight family.
The crossing changes the upper engine’s entrance from ( 0 , ∞ ) (0,\infty) ( 0 , ∞ ) to ( g 1 ′ , ∞ ) (g_1',\infty) ( g 1 ′ , ∞ ) . Since the laws of g 1 ′ g_1' g 1 ′ are tight, given ε > 0 \varepsilon>0 ε > 0 , choose B B B so that P ( g 1 ′ > B ) < ε \mathbb P(g_1'>B)<\varepsilon P ( g 1 ′ > B ) < ε . On { g 1 ′ ≤ B } \{g_1'\leq B\} { g 1 ′ ≤ B } , the erasing-block coupling following Lemma 4.12 removes the additional entrance before any fixed output window, uniformly over its colors. Letting N → ∞ N\to\infty N → ∞ and then ε ↓ 0 \varepsilon\downarrow0 ε ↓ 0 shows that this change does not affect the limiting output law. We may therefore let N → ∞ N\to\infty N → ∞ in (5.13) and conclude that the two constructions in Figure 19 have the same local limiting output law. ◻
In the right panel of Figure 19 , the mixed vertex receives G = ( g 1 , ∞ ) G=(g_1,\infty) G = ( g 1 , ∞ ) from Martin’s queue and H = ( h 0 , 0 ) H=(h_0,0) H = ( h 0 , 0 ) from the lower boundary. We first compute its transition law for fixed g 1 , h 0 g_1,h_0 g 1 , h 0 , by applying the specialization (5.12) to the weight W ^ z , σ , τ \widehat W_{z,\sigma,\tau} W z , σ , τ from Example 3.10 .
Proposition 5.8. Let ρ 1 , ρ 2 \rho_1,\rho_2 ρ 1 , ρ 2 and the parameters be as in (5.12) , and fix inputs G = ( g , ∞ ) G=(g,\infty) G = ( g , ∞ ) and H = ( h , 0 ) H=(h,0) H = ( h , 0 ) , with g , h ∈ Z ≥ 0 g,h\in\mathbb Z_{\geq0} g , h ∈ Z ≥ 0 . Under this specialization, the output is obtained by sampling h 0 ′ ∼ q - P o i ( b ρ 1 , ρ 2 ) , P ( ψ = t ) = M q ( t ∣ g , h ) , h_0'\sim q\text{-}\mathrm{Poi}(b_{\rho_1,\rho_2}),
\qquad
\mathbb P(\psi=t)=\mathsf M_q(t\mid g,h), h 0 ′ ∼ q - Poi ( b ρ 1 , ρ 2 ) , P ( ψ = t ) = M q ( t ∣ g , h ) , independently, where M q ( t ∣ g , h ) : = 1 { 0 ≤ t ≤ min ( g , h ) } q ( g − t ) ( h − t ) ( q ; q ) g ( q ; q ) h ( q ; q ) t ( q ; q ) g − t ( q ; q ) h − t .
\mathsf M_q(t\mid g,h)
:=
\mathbf1_{\{0\leq t\leq\min(g,h)\}}
q^{(g-t)(h-t)}
\frac{(q;q)_g(q;q)_h}
{(q;q)_t(q;q)_{g-t}(q;q)_{h-t}}.
M q ( t ∣ g , h ) := 1 { 0 ≤ t ≤ m i n ( g , h )} q ( g − t ) ( h − t ) ( q ; q ) t ( q ; q ) g − t ( q ; q ) h − t ( q ; q ) g ( q ; q ) h . The output vectors are G ′ = ( g 1 ′ , ∞ ) G'=(g_1',\infty) G ′ = ( g 1 ′ , ∞ ) and H ′ = ( h 0 ′ , h 2 ′ ) H'=(h_0',h_2') H ′ = ( h 0 ′ , h 2 ′ ) , where h 2 ′ = h − ψ , g 1 ′ = h 0 ′ + g − ψ .
h_2'=h-\psi,
\qquad
g_1'=h_0'+g-\psi.
h 2 ′ = h − ψ , g 1 ′ = h 0 ′ + g − ψ .
Proof. Fix integers r ≥ 0 r\geq0 r ≥ 0 and 0 ≤ t ≤ min ( g , h ) 0\leq t\leq\min(g,h) 0 ≤ t ≤ min ( g , h ) . At a finite cutoff R ≥ h − t R\geq h-t R ≥ h − t , the corresponding arrow configurations are
G = ( g , R ) , H = ( h , 0 ) , G ′ = ( r + g − t , R − h + t ) , H ′ = ( r , h − t ) . \begin{aligned}
G&=(g,R),& H&=(h,0),\\
G'&=(r+g-t,R-h+t),& H'&=(r,h-t).
\end{aligned} G G ′ = ( g , R ) , = ( r + g − t , R − h + t ) , H H ′ = ( h , 0 ) , = ( r , h − t ) . We first send R → ∞ R\to\infty R → ∞ and write
W z , σ , τ [ 2 ] ( ( g , ∞ ) , ( h , 0 ) ; ( r + g − t , ∞ ) , ( r , h − t ) ) : = lim R → ∞ W ^ z , σ , τ ( ( g , R ) , ( h , 0 ) ; ( r + g − t , R − h + t ) , ( r , h − t ) ) . \begin{align}
&\mathbb{W}^{[2]}_{z,\sigma,\tau}
\bigl((g,\infty),(h,0);(r+g-t,\infty),(r,h-t)\bigr)
\notag\\
&\quad:=\lim_{R\to\infty}
\widehat W_{z,\sigma,\tau}
\bigl((g,R),(h,0);(r+g-t,R-h+t),(r,h-t)\bigr). \tag*{(5.16)}
\end{align} W z , σ , τ [ 2 ] ( ( g , ∞ ) , ( h , 0 ) ; ( r + g − t , ∞ ) , ( r , h − t ) ) := R → ∞ lim W z , σ , τ ( ( g , R ) , ( h , 0 ) ; ( r + g − t , R − h + t ) , ( r , h − t ) ) . (5.16) We will show that the subsequent density specialization gives
lim x 1 , x 2 ↓ 0 W z , σ , τ [ 2 ] ( ( g , ∞ ) , ( h , 0 ) ; ( r + g − t , ∞ ) , ( r , h − t ) ) = p b ρ 1 , ρ 2 ( q ) ( r ) M q ( t ∣ g , h ) . \begin{equation}
\lim_{x_1,x_2\downarrow0}
\mathbb{W}^{[2]}_{z,\sigma,\tau}
\bigl((g,\infty),(h,0);(r+g-t,\infty),(r,h-t)\bigr)
=p_{b_{\rho_1,\rho_2}}^{(q)}(r)
\mathsf M_q(t\mid g,h). \tag*{(5.17)}
\end{equation} x 1 , x 2 ↓ 0 lim W z , σ , τ [ 2 ] ( ( g , ∞ ) , ( h , 0 ) ; ( r + g − t , ∞ ) , ( r , h − t ) ) = p b ρ 1 , ρ 2 ( q ) ( r ) M q ( t ∣ g , h ) . (5.17) For fixed finite values of all output coordinates other than the infinite coordinate, the limiting weight vanishes unless the output has this form.
Since h 2 = 0 h_2=0 h 2 = 0 , only P 2 = 0 P_2=0 P 2 = 0 contributes to (3.23) . In the summation notation of that formula, p = P 1 + P 2 = P 1 p=P_1+P_2=P_1 p = P 1 + P 2 = P 1 . Sending R → ∞ R\to\infty R → ∞ gives
W z , σ , τ [ 2 ] ( ( g , ∞ ) , ( h , 0 ) ; ( r + g − t , ∞ ) , ( r , h − t ) ) = N z , σ , τ ( σ z ) r ( q ; q ) h ( q ; q ) r ( q ; q ) h − t S g , h , t , r ( z , τ ) , \mathbb{W}^{[2]}_{z,\sigma,\tau}
\bigl((g,\infty),(h,0);(r+g-t,\infty),(r,h-t)\bigr)
=
\mathcal N_{z,\sigma,\tau}(\sigma z)^r
\frac{(q;q)_h}{(q;q)_r(q;q)_{h-t}}
S_{g,h,t,r}(z,\tau), W z , σ , τ [ 2 ] ( ( g , ∞ ) , ( h , 0 ) ; ( r + g − t , ∞ ) , ( r , h − t ) ) = N z , σ , τ ( σ z ) r ( q ; q ) r ( q ; q ) h − t ( q ; q ) h S g , h , t , r ( z , τ ) , where
S g , h , t , r ( z , τ ) : = ∑ p = 0 r + g − t ( − 1 ) p + r q ( r 2 ) + ( h − t ) ( r + g − t ) + t p + ( p + 1 2 ) ( z / q ; q ) p ( z ; q ) h + p × ( τ q 1 − r − h + t ; q ) r + g − t − p ( q ; q ) r + g − t − p ( τ q 1 − h − p ; q ) p ( q ; q ) p . \begin{align*}
S_{g,h,t,r}(z,\tau)
&:=\sum_{p=0}^{r+g-t}
(-1)^{p+r}
q^{\binom r2+(h-t)(r+g-t)+tp+\binom{p+1}2}
\frac{(z/q;q)_p}{(z;q)_{h+p}}
\notag\\
&\quad\times
\frac{(\tau q^{1-r-h+t};q)_{r+g-t-p}}
{(q;q)_{r+g-t-p}}
\frac{(\tau q^{1-h-p};q)_p}{(q;q)_p}.
\end{align*} S g , h , t , r ( z , τ ) := p = 0 ∑ r + g − t ( − 1 ) p + r q ( 2 r ) + ( h − t ) ( r + g − t ) + tp + ( 2 p + 1 ) ( z ; q ) h + p ( z / q ; q ) p × ( q ; q ) r + g − t − p ( τ q 1 − r − h + t ; q ) r + g − t − p ( q ; q ) p ( τ q 1 − h − p ; q ) p . The terminating q q q -Chu–Vandermonde identity gives the coefficient extraction
lim τ → − ∞ τ − r S g , h , t , r ( 0 , τ ) = q ( g − t ) ( h − t ) [ g t ] q . \lim_{\tau\to-\infty}\tau^{-r}S_{g,h,t,r}(0,\tau)
=q^{(g-t)(h-t)}\begin{bmatrix}g\\t\end{bmatrix}_{\!q}. τ → − ∞ lim τ − r S g , h , t , r ( 0 , τ ) = q ( g − t ) ( h − t ) [ g t ] q . Equivalently, all powers of τ \tau τ above r r r cancel at z = 0 z=0 z = 0 , and the coefficient of τ r \tau^r τ r is the right-hand side. At nonzero z z z , every excess power of τ \tau τ comes with a power of τ z = O ( x 2 ) \tau z=O(x_2) τ z = O ( x 2 ) ; hence the same limit holds along the joint specialization (5.12) . Since
( σ z ) r = b ρ 1 , ρ 2 r τ − r , N z , σ , τ ⟶ ( b ρ 1 , ρ 2 ; q ) ∞ , (\sigma z)^r=b_{\rho_1,\rho_2}^{\,r}\tau^{-r},
\qquad
\mathcal N_{z,\sigma,\tau}
\longrightarrow(b_{\rho_1,\rho_2};q)_\infty, ( σ z ) r = b ρ 1 , ρ 2 r τ − r , N z , σ , τ ⟶ ( b ρ 1 , ρ 2 ; q ) ∞ , we obtain (5.17) . Finally,
∑ t = 0 min ( g , h ) q ( g − t ) ( h − t ) ( q ; q ) g ( q ; q ) h ( q ; q ) t ( q ; q ) g − t ( q ; q ) h − t = 1 \begin{equation}
\sum_{t=0}^{\min(g,h)}
q^{(g-t)(h-t)}
\frac{(q;q)_g(q;q)_h}
{(q;q)_t(q;q)_{g-t}(q;q)_{h-t}}=1 \tag*{(5.18)}
\end{equation} t = 0 ∑ m i n ( g , h ) q ( g − t ) ( h − t ) ( q ; q ) t ( q ; q ) g − t ( q ; q ) h − t ( q ; q ) g ( q ; q ) h = 1 (5.18) is another terminating q q q -Chu–Vandermonde identity. Thus M q \mathsf M_q M q is a probability kernel, and the factorization in (5.17) gives the stated independent sampling rule and output map. The q = 0 q=0 q = 0 statement is the continuous extension of the limiting kernel; one does not substitute q = 0 q=0 q = 0 into the prelimit expression containing z / q z/q z / q . ◻
For the random inputs considered next, write
ω : = g 1 ′ − h 0 ′ = g 1 − ψ . \omega:=g_1'-h_0'=g_1-\psi. ω := g 1 ′ − h 0 ′ = g 1 − ψ .
We average the crossing law over a random finite bottom input and an independent q q q -Poisson horizontal input.
Proof. For v ∈ Z ≥ 0 v\in\mathbb Z_{\geq0} v ∈ Z ≥ 0 , abbreviate the sum by
Fix r , v , k ∈ Z ≥ 0 r,v,k\in\mathbb Z_{\geq0} r , v , k ∈ Z ≥ 0 , and write t = g − v t=g-v t = g − v , h = t + k h=t+k h = t + k . Averaging the kernel (5.17) against γ g p β ( q ) ( h ) \gamma_g p_\beta^{(q)}(h) γ g p β ( q ) ( h ) and summing over g ≥ v g\geq v g ≥ v gives
P ( g 1 ′ = r + v , h 0 ′ = r , h 2 ′ = k ) = p b ρ 1 , ρ 2 ( q ) ( r ) ( β ; q ) ∞ β k q k v ( q ; q ) k T v g 1 ( β ) . \begin{equation}
\mathbb P(g_1'=r+v,h_0'=r,h_2'=k)
=p_{b_{\rho_1,\rho_2}}^{(q)}(r)
\frac{(\beta;q)_\infty\beta^kq^{kv}}{(q;q)_k}
\mathcal T_v^{g_1}(\beta). \tag*{(5.20)}
\end{equation} P ( g 1 ′ = r + v , h 0 ′ = r , h 2 ′ = k ) = p b ρ 1 , ρ 2 ( q ) ( r ) ( q ; q ) k ( β ; q ) ∞ β k q k v T v g 1 ( β ) . (5.20) Summing in r r r and k k k , using the q q q -binomial theorem, gives the stated law of ω \omega ω . Dividing the joint law of ( ω , h 2 ′ ) (\omega,h_2') ( ω , h 2 ′ ) by this marginal gives the conditional q q q -Poisson law. The separate factor p b ρ 1 , ρ 2 ( q ) ( r ) p_{b_{\rho_1,\rho_2}}^{(q)}(r) p b ρ 1 , ρ 2 ( q ) ( r ) gives the law of h 0 ′ h_0' h 0 ′ and its independence of ( h 2 ′ , ω ) (h_2',\omega) ( h 2 ′ , ω ) . ◻
For the conditioned queues used below, we need the case where the bottom queue length is the sum of independent q q q -Poisson and Bernoulli variables.
Proof. Use the transform (5.19) for the inputs υ \upsilon υ and υ + 1 \upsilon+1 υ + 1 . The recursion
[ g + 1 v ] q = q v [ g v ] q + [ g v − 1 ] q \begin{bmatrix}g+1\\v\end{bmatrix}_{\!q}
=q^v\begin{bmatrix}g\\v\end{bmatrix}_{\!q}
+\begin{bmatrix}g\\v-1\end{bmatrix}_{\!q} [ g + 1 v ] q = q v [ g v ] q + [ g v − 1 ] q gives
T v υ + 1 ( β ) = β q v T v υ ( β ) + 1 { v ≥ 1 } T v − 1 υ ( β ) . \mathcal T_v^{\upsilon+1}(\beta)
=\beta q^v\mathcal T_v^\upsilon(\beta)
+\mathbf1_{\{v\geq1\}}\mathcal T_{v-1}^\upsilon(\beta). T v υ + 1 ( β ) = β q v T v υ ( β ) + 1 { v ≥ 1 } T v − 1 υ ( β ) . The q q q -binomial theorem yields
T v υ ( β ) = ( γ ; q ) ∞ ( γ β ; q ) ∞ γ v ( q ; q ) v . \mathcal T_v^\upsilon(\beta)
=\frac{(\gamma;q)_\infty}{(\gamma\beta;q)_\infty}
\frac{\gamma^v}{(q;q)_v}. T v υ ( β ) = ( γ β ; q ) ∞ ( γ ; q ) ∞ ( q ; q ) v γ v . Combining these two formulas for g 1 = υ + ξ g_1=\upsilon+\xi g 1 = υ + ξ in (5.20) and summing in r r r gives, for v , k ∈ Z ≥ 0 v,k\in\mathbb Z_{\geq0} v , k ∈ Z ≥ 0 ,
P ( ω = v , h 2 ′ = k ) = ( γ ; q ) ∞ ( β ; q ) ∞ ( γ β ; q ) ∞ β k q v k ( q ; q ) k [ ( 1 − p + p β q v ) γ v ( q ; q ) v + p 1 { v ≥ 1 } γ v − 1 ( q ; q ) v − 1 ] . \begin{equation}
\mathbb P(\omega=v,h_2'=k)
=\frac{(\gamma;q)_\infty(\beta;q)_\infty}{(\gamma\beta;q)_\infty}
\frac{\beta^kq^{vk}}{(q;q)_k}
\left[
(1-p+p\beta q^v)\frac{\gamma^v}{(q;q)_v}
+p\mathbf1_{\{v\geq1\}}
\frac{\gamma^{v-1}}{(q;q)_{v-1}}
\right]. \tag*{(5.23)}
\end{equation} P ( ω = v , h 2 ′ = k ) = ( γ β ; q ) ∞ ( γ ; q ) ∞ ( β ; q ) ∞ ( q ; q ) k β k q v k [ ( 1 − p + pβ q v ) ( q ; q ) v γ v + p 1 { v ≥ 1 } ( q ; q ) v − 1 γ v − 1 ] . (5.23) Summing in v v v gives
P ( h 2 ′ = k ) = p γ , β ( q ) ( k ) [ 1 − p ( 1 − β ) + p ( 1 − γ β ) q k ] , \mathbb P(h_2'=k)
=p_{\gamma,\beta}^{(q)}(k)
\left[1-p(1-\beta)+p(1-\gamma\beta)q^k\right], P ( h 2 ′ = k ) = p γ , β ( q ) ( k ) [ 1 − p ( 1 − β ) + p ( 1 − γ β ) q k ] , which is the mixture (5.21) . Applying Lemma 5.1 to this mixture gives (5.22) . ◻
Two-species high–high-density stationary measure
Throughout this subsection we assume 0 < α < 1 0<\alpha<1 0 < α < 1 , 1 2 < ρ 1 < ρ 2 < 1 \frac12<\rho_1<\rho_2<1 2 1 < ρ 1 < ρ 2 < 1 , and α + ρ 1 > 1 \alpha+\rho_1>1 α + ρ 1 > 1 . We compute the two probabilities in (5.1) using the high–high-density construction with ( u , v ) = ( ρ 1 , ρ 2 ) (u,v)=(\rho_1,\rho_2) ( u , v ) = ( ρ 1 , ρ 2 ) . The two-engine zero-input construction is stationary by Theorem thm:engine-array-stationarity , and Proposition 5.7 gives the representation obtained by Yang–Baxter moves that is used below.
The two unreflected rows in Figure 21 realize Martin’s construction with densities ( ρ 1 , ρ 2 ) (\rho_1,\rho_2) ( ρ 1 , ρ 2 ) . By Proposition 2.21 , their output satisfies π ∼ π ρ 1 , ρ 2 \pi\sim\pi^{\rho_1,\rho_2} π ∼ π ρ 1 , ρ 2 , with two-site marginal given by Theorem 2.4 . The lower reflected row maps π \pi π to ν \nu ν , and the upper row maps ν \nu ν to μ \mu μ , using (5.6) with parameters ρ 1 \rho_1 ρ 1 and ρ 2 \rho_2 ρ 2 , respectively.
[
baseline={([yshift=-.5ex]current bounding box.center)},
scale=0.7
]
\foreach \x in {2,...,7}
\draw[paper wire,->] (\x,-.7) -- (\x,3.7);
\draw[paper normal]
(8,1) -- (1,1) -- (0,2.25);
\draw[paper hole,->]
(0,2.25) -- (1,3) -- (8,3);
\draw[paper normal]
(8,0) -- (1,0) -- (0,.75);
\draw[paper hole,->]
(0,.75) -- (1,2) -- (8,2);
\node[paper boundary] at (0,2.25) {};
\node[paper boundary] at (0,.75) {};
\node[right=2pt] at (8,0) {$(\infty,0)$};
\node[right=36pt] at (8,0) {$(x_1,\tau)$};
\node[right=2pt] at (8,1) {$(0,\infty)$};
\node[right=36pt] at (8,1) {$(x_2,\sigma)$};
\node[right=2pt,text=holecolor] at (8,2)
{$\sum H^{(1)}$};
\node[right=2pt,text=holecolor] at (8,3)
{$\sum H^{(2)}$};
\node[below] at (2,-.7) {0};
\node[below] at (3,-.7) {0};
\node[below] at (4,-.7) {0};
\node[below] at (5,-.7) {$\cdots$};
\node[below] at (6,-.7) {$\cdots$};
\node[below] at (7,-.7) {$\cdots$};
\node[anchor=east,xshift=-2pt,inner sep=0pt]
at (2,1.5) {$\pi_1$};
\node[anchor=east,xshift=-2pt,inner sep=0pt]
at (3,1.5) {$\pi_2$};
\node[anchor=east,xshift=-2pt,inner sep=0pt]
at (4,1.5) {$\pi_3$};
\node[anchor=east,xshift=-2pt,inner sep=0pt]
at (5,1.5) {$\cdots$};
\node[anchor=east,xshift=-2pt,inner sep=0pt]
at (6,1.5) {$\cdots$};
\node[anchor=east,xshift=-2pt,inner sep=0pt]
at (7,1.5) {$\cdots$};
\node[anchor=east,xshift=-2pt,inner sep=0pt]
at (2,2.5) {$\nu_1$};
\node[anchor=east,xshift=-2pt,inner sep=0pt]
at (3,2.5) {$\nu_2$};
\node[anchor=east,xshift=-2pt,inner sep=0pt]
at (4,2.5) {$\nu_3$};
\node[anchor=east,xshift=-2pt,inner sep=0pt]
at (5,2.5) {$\cdots$};
\node[anchor=east,xshift=-2pt,inner sep=0pt]
at (6,2.5) {$\cdots$};
\node[anchor=east,xshift=-2pt,inner sep=0pt]
at (7,2.5) {$\cdots$};
\node[above] at (2,3.7) {$\mu_1$};
\node[above] at (3,3.7) {$\mu_2$};
\node[above] at (4,3.7) {$\mu_3$};
\node[above] at (5,3.7) {$\cdots$};
\node[above] at (6,3.7) {$\cdots$};
\node[above] at (7,3.7) {$\cdots$};Figure 21. The high–high construction: π \pi π is the output of the two unreflected rows, ν \nu ν the output of the lower reflected row, and μ \mu μ the final configuration.
We use θ , ϕ \theta,\phi θ , ϕ from (2.10) and the identity
b ρ ˉ 1 , ρ 2 b α , ρ 1 = b α , ρ 2 . \begin{equation}
b_{\bar\rho_1,\rho_2}\,b_{\alpha,\rho_1}
=b_{\alpha,\rho_2}. \tag*{(5.24)}
\end{equation} b ρ ˉ 1 , ρ 2 b α , ρ 1 = b α , ρ 2 . (5.24)
For a , b ∈ { 0 , 1 , 2 } a,b\in\{0,1,2\} a , b ∈ { 0 , 1 , 2 } , write
π a b : = P ( π 1 = a , π 2 = b ) , ν a b : = P ( ν 1 = a , ν 2 = b ) . \pi_{ab}:=\mathbb P(\pi_1=a,\pi_2=b),
\qquad
\nu_{ab}:=\mathbb P(\nu_1=a,\nu_2=b). π ab := P ( π 1 = a , π 2 = b ) , ν ab := P ( ν 1 = a , ν 2 = b ) .
For a b ∈ { 11 , 12 , 21 , 10 } ab\in\{11,12,21,10\} ab ∈ { 11 , 12 , 21 , 10 } , let g 1 a b g_1^{ab} g 1 ab have the law of Q a b Q^{ab} Q ab in Proposition 2.5 , with r 12 = b ρ ˉ 1 , ρ 2 r_{12}=b_{\bar\rho_1,\rho_2} r 12 = b ρ ˉ 1 , ρ 2 . Conditional on the π \pi π -word a b ab ab , the mixed vertex has inputs G = ( g 1 a b , ∞ ) G=(g_1^{ab},\infty) G = ( g 1 ab , ∞ ) and H = ( h 0 , 0 ) H=(h_0,0) H = ( h 0 , 0 ) , where h 0 ∼ q - P o i ( b α , ρ 1 ) h_0\sim q\text{-}\mathrm{Poi}(b_{\alpha,\rho_1}) h 0 ∼ q - Poi ( b α , ρ 1 ) is independent of g 1 a b g_1^{ab} g 1 ab by Lemma 5.2 . Its hole-indexed output H ′ = ( h 0 l o w , h 2 a b ) H'=(h_0^{\mathrm{low}},h_2^{ab}) H ′ = ( h 0 low , h 2 ab ) initializes the lower reflected row; the upper reflected row starts from ( h 0 u p , 0 ) (h_0^{\mathrm{up}},0) ( h 0 up , 0 ) . Proposition 5.8 and Lemma 5.2 show that these two color–0 0 0 coordinates are independent, with laws
h 0 l o w ∼ q - P o i ( b ρ 1 , ρ 2 ) , h 0 u p ∼ q - P o i ( b α , ρ 2 ) . \begin{equation}
h_0^{\mathrm{low}}\sim q\text{-}\mathrm{Poi}(b_{\rho_1,\rho_2}),
\qquad
h_0^{\mathrm{up}}\sim q\text{-}\mathrm{Poi}(b_{\alpha,\rho_2}). \tag*{(5.25)}
\end{equation} h 0 low ∼ q - Poi ( b ρ 1 , ρ 2 ) , h 0 up ∼ q - Poi ( b α , ρ 2 ) . (5.25)
Moreover, h 0 l o w h_0^{\mathrm{low}} h 0 low is independent of π \pi π and, conditional on the π \pi π -word a b ab ab , of h 2 a b h_2^{ab} h 2 ab . The upper boundary law does not depend on its input, so h 0 u p h_0^{\mathrm{up}} h 0 up is independent of ν \nu ν . Proposition 2.5 and Corollary 5.10 give
h 2 11 ∼ q - N B ( b ρ ˉ 1 , ρ 2 , b α , ρ 1 ) , h 2 12 , h 2 21 ∼ q - N B ( q b ρ ˉ 1 , ρ 2 , b α , ρ 1 ) . \begin{equation}
h_2^{11}\sim q\text{-}\mathrm{NB}(b_{\bar\rho_1,\rho_2},b_{\alpha,\rho_1}),
\qquad
h_2^{12},h_2^{21}\sim q\text{-}\mathrm{NB}(qb_{\bar\rho_1,\rho_2},b_{\alpha,\rho_1}). \tag*{(5.26)}
\end{equation} h 2 11 ∼ q - NB ( b ρ ˉ 1 , ρ 2 , b α , ρ 1 ) , h 2 12 , h 2 21 ∼ q - NB ( q b ρ ˉ 1 , ρ 2 , b α , ρ 1 ) . (5.26)
Lemma 5.1 therefore gives
E [ 1 { h 2 11 ≥ 2 } ( 1 − q h 2 11 ) ( 1 − q h 2 11 − 1 ) ] = b α , ρ 1 2 ( 1 − b ρ ˉ 1 , ρ 2 ) ( 1 − q b ρ ˉ 1 , ρ 2 ) ( 1 − b α , ρ 2 ) ( 1 − q b α , ρ 2 ) , E [ 1 − q h 2 12 ] = E [ 1 − q h 2 21 ] = b α , ρ 1 ( 1 − q b ρ ˉ 1 , ρ 2 ) 1 − q b α , ρ 2 , E [ 1 − q h 2 11 ] = b α , ρ 1 ( 1 − b ρ ˉ 1 , ρ 2 ) 1 − b α , ρ 2 . \begin{align}
\mathbb E\!\left[
\mathbf 1_{\{h_2^{11}\geq2\}}
(1-q^{h_2^{11}})(1-q^{h_2^{11}-1})
\right]
&=
\frac{b_{\alpha,\rho_1}^{2}
(1-b_{\bar\rho_1,\rho_2})
(1-qb_{\bar\rho_1,\rho_2})}
{(1-b_{\alpha,\rho_2})(1-qb_{\alpha,\rho_2})}, \tag*{(5.27)}
\\
&\mathbb E[1-q^{h_2^{12}}]
=\mathbb E[1-q^{h_2^{21}}]
=\frac{b_{\alpha,\rho_1}
(1-qb_{\bar\rho_1,\rho_2})}
{1-qb_{\alpha,\rho_2}}, \tag*{(5.28)}
\\
&\mathbb E[1-q^{h_2^{11}}]
=\frac{b_{\alpha,\rho_1}
(1-b_{\bar\rho_1,\rho_2})}
{1-b_{\alpha,\rho_2}}. \tag*{(5.29)}
\end{align} E [ 1 { h 2 11 ≥ 2 } ( 1 − q h 2 11 ) ( 1 − q h 2 11 − 1 ) ] = ( 1 − b α , ρ 2 ) ( 1 − q b α , ρ 2 ) b α , ρ 1 2 ( 1 − b ρ ˉ 1 , ρ 2 ) ( 1 − q b ρ ˉ 1 , ρ 2 ) , E [ 1 − q h 2 12 ] = E [ 1 − q h 2 21 ] = 1 − q b α , ρ 2 b α , ρ 1 ( 1 − q b ρ ˉ 1 , ρ 2 ) , E [ 1 − q h 2 11 ] = 1 − b α , ρ 2 b α , ρ 1 ( 1 − b ρ ˉ 1 , ρ 2 ) . (5.27) (5.28) (5.29)
Finally, applying the same corollary to (2.14) , with β 10 \beta_{10} β 10 as in (2.13) , gives
E [ 1 − q h 2 10 ] = b α , ρ 1 ( 1 − b ρ ˉ 1 , ρ 2 ) [ 1 − β 10 ( 1 − b α , ρ 1 ) 1 − b α , ρ 2 + q β 10 ( 1 − b α , ρ 1 ) 1 − q b α , ρ 2 ] . \begin{equation}
\mathbb E[1-q^{h_2^{10}}]
=b_{\alpha,\rho_1}(1-b_{\bar\rho_1,\rho_2})
\Biggl[
\frac{1-\beta_{10}(1-b_{\alpha,\rho_1})}{1-b_{\alpha,\rho_2}}
+\frac{q\beta_{10}(1-b_{\alpha,\rho_1})}{1-qb_{\alpha,\rho_2}}
\Biggr]. \tag*{(5.30)}
\end{equation} E [ 1 − q h 2 10 ] = b α , ρ 1 ( 1 − b ρ ˉ 1 , ρ 2 ) [ 1 − b α , ρ 2 1 − β 10 ( 1 − b α , ρ 1 ) + 1 − q b α , ρ 2 q β 10 ( 1 − b α , ρ 1 ) ] . (5.30)
We now compute p 22 p_{22} p 22 .
Proposition 5.11. Under the assumptions of this subsection, the first identity in (5.1) holds.
Proof. Since the upper reflected row starts with no color–2 2 2 arrows, (5.6) forces ν 1 ν 2 = 22 \nu_1\nu_2=22 ν 1 ν 2 = 22 whenever μ 1 μ 2 = 22 \mu_1\mu_2=22 μ 1 μ 2 = 22 . Both transitions leave ( h 0 u p , 0 ) (h_0^{\mathrm{up}},0) ( h 0 up , 0 ) unchanged, so independence of h 0 u p h_0^{\mathrm{up}} h 0 up and ν \nu ν gives
p 22 = ρ 2 2 E [ q 2 h 0 u p ] ν 22 . \begin{equation}
p_{22}
=\rho_2^2\mathbb E[q^{2h_0^{\mathrm{up}}}]\nu_{22}. \tag*{(5.31)}
\end{equation} p 22 = ρ 2 2 E [ q 2 h 0 up ] ν 22 . (5.31) For the lower reflected row, only the π \pi π -words 22 , 12 , 21 , 11 22,12,21,11 22 , 12 , 21 , 11 contribute. By (5.6) , each output 2 2 2 leaves h 0 l o w h_0^{\mathrm{low}} h 0 low unchanged, while each 1 → 2 1\to2 1 → 2 transition decreases the color–2 2 2 coordinate by one. The contribution from 11 11 11 therefore uses h 2 11 − 1 h_2^{11}-1 h 2 11 − 1 at the second site and vanishes when h 2 11 < 2 h_2^{11}<2 h 2 11 < 2 . Conditional independence at the mixed vertex gives
ν 22 = ρ 1 2 E [ q 2 h 0 l o w ] [ π 22 + π 12 E [ 1 − q h 2 12 ] + π 21 E [ 1 − q h 2 21 ] ∗ + π 11 E [ 1 { h 2 11 ≥ 2 } ( 1 − q h 2 11 ) ( 1 − q h 2 11 − 1 ) ] ] . \begin{align}
\nu_{22}
&=\rho_1^2\mathbb E[q^{2h_0^{\mathrm{low}}}]
\Biggl[
\pi_{22}
+\pi_{12}\mathbb E[1-q^{h_2^{12}}]
+\pi_{21}\mathbb E[1-q^{h_2^{21}}]
\notag\\*
&\hspace{37mm}
+\pi_{11}\mathbb E\!\left[
\mathbf1_{\{h_2^{11}\geq2\}}
(1-q^{h_2^{11}})(1-q^{h_2^{11}-1})
\right]
\Biggr]. \tag*{(5.32)}
\end{align} ν 22 ∗ = ρ 1 2 E [ q 2 h 0 low ] [ π 22 + π 12 E [ 1 − q h 2 12 ] + π 21 E [ 1 − q h 2 21 ] + π 11 E [ 1 { h 2 11 ≥ 2 } ( 1 − q h 2 11 ) ( 1 − q h 2 11 − 1 ) ] ] . (5.32) Evaluate the h 0 h_0 h 0 moments in (5.31) –(5.32) using (5.25) and (5.5) . Substituting the full-space probabilities from Theorem 2.4 and the moments (5.27) –(5.28) , and simplifying with (5.7) and J 1 − J 2 = ( ρ 2 − ρ 1 ) ( ρ 1 + ρ 2 − 1 ) J_1-J_2=(\rho_2-\rho_1)(\rho_1+\rho_2-1) J 1 − J 2 = ( ρ 2 − ρ 1 ) ( ρ 1 + ρ 2 − 1 ) , gives
p 22 = J 1 − J 2 α 2 ( ρ 2 ϕ − q ρ 1 ) ( ρ 1 θ − q ρ ˉ 2 ) = J 1 − J 2 α 2 ( J 1 θ 2 − q J 2 ) , p_{22}=\frac{J_1-J_2}{\alpha^2}
(\rho_2\phi-q\rho_1)(\rho_1\theta-q\bar\rho_2)
=\frac{J_1-J_2}{\alpha^2}(J_1\theta^2-qJ_2), p 22 = α 2 J 1 − J 2 ( ρ 2 ϕ − q ρ 1 ) ( ρ 1 θ − q ρ ˉ 2 ) = α 2 J 1 − J 2 ( J 1 θ 2 − q J 2 ) , which is the first identity in (5.1) . ◻
It remains to compute p 20 p_{20} p 20 .
Proposition 5.12. Under the assumptions of this subsection, the second identity in (5.1) holds.
Proof. As in the preceding proof, the first output 2 2 2 requires ν 1 = 2 \nu_1=2 ν 1 = 2 and leaves ( h 0 u p , 0 ) (h_0^{\mathrm{up}},0) ( h 0 up , 0 ) unchanged. Separating the cases ν 2 = 0 \nu_2=0 ν 2 = 0 and ν 2 ∈ { 1 , 2 } \nu_2\in\{1,2\} ν 2 ∈ { 1 , 2 } , and using (5.6) , independence, and the q q q -Poisson moments (5.5) for (5.25) , gives
p 20 = ρ 2 2 ( 1 − b α , ρ 2 ) [ ( 1 − q b α , ρ 2 ) ν 20 + q b α , ρ 2 ( ν 20 + ν 21 + ν 22 ) ] . \begin{align}
p_{20}
&=\rho_2^2(1-b_{\alpha,\rho_2})
\Bigl[
(1-qb_{\alpha,\rho_2})\nu_{20}
+qb_{\alpha,\rho_2}
(\nu_{20}+\nu_{21}+\nu_{22})
\Bigr]. \tag*{(5.33)}
\end{align} p 20 = ρ 2 2 ( 1 − b α , ρ 2 ) [ ( 1 − q b α , ρ 2 ) ν 20 + q b α , ρ 2 ( ν 20 + ν 21 + ν 22 ) ] . (5.33) For the lower reflected row, output 20 20 20 requires π 1 ∈ { 1 , 2 } \pi_1\in\{1,2\} π 1 ∈ { 1 , 2 } , while π 2 \pi_2 π 2 may be any color. The first transition leaves h 0 l o w h_0^{\mathrm{low}} h 0 low unchanged; a 1 → 2 1\to2 1 → 2 transition decreases the color–2 2 2 coordinate by one, but the second-site weights for output 0 0 0 do not depend on that coordinate. Applying (5.6) and conditional independence, and evaluating the h 0 l o w h_0^{\mathrm{low}} h 0 low moments by (5.5) , yields
ν 20 = ρ 1 2 ( 1 − b ρ 1 , ρ 2 ) [ π 20 + π 10 E [ 1 − q h 2 10 ] ∗ + q b ρ 1 , ρ 2 ( π 21 + π 22 + π 11 E [ 1 − q h 2 11 ] + π 12 E [ 1 − q h 2 12 ] ) ] . \begin{align}
\nu_{20}
&=\rho_1^2(1-b_{\rho_1,\rho_2})
\Bigl[
\pi_{20}+\pi_{10}\mathbb E[1-q^{h_2^{10}}]
\notag\\*
&\qquad
+qb_{\rho_1,\rho_2}
\bigl(
\pi_{21}+\pi_{22}
+\pi_{11}\mathbb E[1-q^{h_2^{11}}]
+\pi_{12}\mathbb E[1-q^{h_2^{12}}]
\bigr)
\Bigr]. \tag*{(5.34)}
\end{align} ν 20 ∗ = ρ 1 2 ( 1 − b ρ 1 , ρ 2 ) [ π 20 + π 10 E [ 1 − q h 2 10 ] + q b ρ 1 , ρ 2 ( π 21 + π 22 + π 11 E [ 1 − q h 2 11 ] + π 12 E [ 1 − q h 2 12 ] ) ] . (5.34) Substituting the full-space entries from Theorem 2.4 and the moment formulas (5.30) , (5.29) , and (5.28) into (5.34) , and then using (5.7) and θ + ϕ − q = 1 + ( 1 − q ) ( ρ 2 − ρ 1 ) \theta+\phi-q=1+(1-q)(\rho_2-\rho_1) θ + ϕ − q = 1 + ( 1 − q ) ( ρ 2 − ρ 1 ) , gives
ν 20 = ( J 1 − J 2 ) [ J 1 θ ( 1 − θ ) + q ρ ˉ 2 ( α + ρ 2 − 1 ) ] ( α + ρ 2 − 1 ) [ α ρ 2 − q ( 1 − α ) ρ ˉ 2 ] . \begin{equation}
\nu_{20}
=\frac{(J_1-J_2)
\bigl[J_1\theta(1-\theta)
+q\bar\rho_2(\alpha+\rho_2-1)\bigr]}
{(\alpha+\rho_2-1)
[\alpha\rho_2-q(1-\alpha)\bar\rho_2]}. \tag*{(5.35)}
\end{equation} ν 20 = ( α + ρ 2 − 1 ) [ α ρ 2 − q ( 1 − α ) ρ ˉ 2 ] ( J 1 − J 2 ) [ J 1 θ ( 1 − θ ) + q ρ ˉ 2 ( α + ρ 2 − 1 ) ] . (5.35) For the row sum in (5.33) , the same upper-row transition at the first site gives
P ( μ ( 1 ) = 2 ) = ρ 2 E [ q h 0 u p ] P ( ν ( 1 ) = 2 ) = ρ 2 ( 1 − b α , ρ 2 ) P ( ν ( 1 ) = 2 ) . \mathbb P(\mu(1)=2)
=\rho_2\mathbb E[q^{h_0^{\mathrm{up}}}]
\mathbb P(\nu(1)=2)
=\rho_2(1-b_{\alpha,\rho_2})\mathbb P(\nu(1)=2). P ( μ ( 1 ) = 2 ) = ρ 2 E [ q h 0 up ] P ( ν ( 1 ) = 2 ) = ρ 2 ( 1 − b α , ρ 2 ) P ( ν ( 1 ) = 2 ) . The one-species projections and Proposition 2.2 give P ( μ ( 1 ) = 2 ) = ( J 1 − J 2 ) / α \mathbb P(\mu(1)=2)=(J_1-J_2)/\alpha P ( μ ( 1 ) = 2 ) = ( J 1 − J 2 ) / α , hence
ν 20 + ν 21 + ν 22 = J 1 − J 2 α + ρ 2 − 1 . \begin{equation}
\nu_{20}+\nu_{21}+\nu_{22}
=\frac{J_1-J_2}{\alpha+\rho_2-1}. \tag*{(5.36)}
\end{equation} ν 20 + ν 21 + ν 22 = α + ρ 2 − 1 J 1 − J 2 . (5.36) Substituting (5.35) and (5.36) into (5.33) , and using (5.7) together with q ρ ˉ 2 ( α + ρ 2 − 1 ) + q ( 1 − α ) ρ ˉ 2 = q J 2 q\bar\rho_2(\alpha+\rho_2-1)+q(1-\alpha)\bar\rho_2=qJ_2 q ρ ˉ 2 ( α + ρ 2 − 1 ) + q ( 1 − α ) ρ ˉ 2 = q J 2 , proves the second identity in (5.1) . ◻
Together with the low–high-density calculation in Sub§ 5.2 and the color-projection reduction, Propositions 5.11 and 5.12 prove Theorem 1.4 for 0 < α < 1 0<\alpha<1 0 < α < 1 .
Boundary correlations for α ≥ 1 \alpha\geq1 α ≥ 1
We now prove Theorem 1.4 in regime (H) for α ≥ 1 \alpha\geq1 α ≥ 1 . The stationary law has already been constructed in Theorem 1.2 : for α > 1 \alpha>1 α > 1 , it uses the exact specialization (4.27) , and both boundary outputs are the zero hole-indexed state. It remains to adapt the mixed-crossing representation and compute the two probabilities in (5.1) .
We first assume α > 1 \alpha>1 α > 1 and 0 < q < 1 0<q<1 0 < q < 1 ; the endpoints α = 1 \alpha=1 α = 1 and q = 0 q=0 q = 0 are treated at the end. Set
a = α α − 1 , x 1 = x 2 = a − 1 , τ = − a ρ ˉ 1 ρ 1 , σ = − a ρ ˉ 2 ρ 2 , z = a − 2 . \begin{equation}
a=\frac{\alpha}{\alpha-1},\qquad x_1=x_2=a^{-1},\qquad
\tau=-\frac{a\bar\rho_1}{\rho_1},\qquad
\sigma=-\frac{a\bar\rho_2}{\rho_2},\qquad z=a^{-2}. \tag*{(5.37)}
\end{equation} a = α − 1 α , x 1 = x 2 = a − 1 , τ = − ρ 1 a ρ ˉ 1 , σ = − ρ 2 a ρ ˉ 2 , z = a − 2 . (5.37)
Thus
σ τ z = b ρ 1 , ρ 2 , σ / τ = b ρ ˉ 1 , ρ 2 , τ z = b α , ρ 1 , σ z = b α , ρ 2 , τ − 1 = b α , ρ ˉ 1 , σ − 1 = b α , ρ ˉ 2 . \begin{equation}
\begin{gathered}
\sigma\tau z=b_{\rho_1,\rho_2},\qquad
\sigma/\tau=b_{\bar\rho_1,\rho_2},\\
\tau z=b_{\alpha,\rho_1},\quad \sigma z=b_{\alpha,\rho_2},\quad
\tau^{-1}=b_{\alpha,\bar\rho_1},\quad
\sigma^{-1}=b_{\alpha,\bar\rho_2}.
\end{gathered} \tag*{(5.38)}
\end{equation} σ τ z = b ρ 1 , ρ 2 , σ / τ = b ρ ˉ 1 , ρ 2 , τ z = b α , ρ 1 , σ z = b α , ρ 2 , τ − 1 = b α , ρ ˉ 1 , σ − 1 = b α , ρ ˉ 2 . (5.38)
Under this specialization, Lemma 4.3 gives the zero boundary state, while the usual and return vertices are obtained from Figure 1 and Figure 2 by setting x = a − 1 x=a^{-1} x = a − 1 . We use these vertex rules below, together with the update H ′ = H + E ^ i − E ^ j H'=H+\widehat E_i-\widehat E_j H ′ = H + E i − E j for the return carrier.
We next compute the mixed crossing with empty horizontal input at z = a − 2 z=a^{-2} z = a − 2 .
Proposition 5.13. Fix g , r , k ∈ Z ≥ 0 g,r,k\in\mathbb Z_{\geq0} g , r , k ∈ Z ≥ 0 . For inputs G = ( g , ∞ ) G=(g,\infty) G = ( g , ∞ ) and H = ( 0 , 0 ) H=(0,0) H = ( 0 , 0 ) and outputs G ′ = ( g + r + k , ∞ ) G'=(g+r+k,\infty) G ′ = ( g + r + k , ∞ ) and H ′ = ( r , k ) H'=(r,k) H ′ = ( r , k ) , the queue specialization of the mixed vertex is W z , σ , τ [ 2 ] ( ( g , ∞ ) , ( 0 , 0 ) ; ( g + r + k , ∞ ) , ( r , k ) ) = N z , σ , τ b ρ 1 , ρ 2 r ( − b α , ρ 1 ) k q g k + ( k 2 ) ( b α , ρ ˉ 1 ; q ) r + k ( b α , ρ 1 ; q ) g ( q ; q ) r ( q ; q ) k ( a − 2 ; q ) g + r + k , \begin{aligned}
&\mathbb W^{[2]}_{z,\sigma,\tau}
\bigl((g,\infty),(0,0);(g+r+k,\infty),(r,k)\bigr)\notag\\
&\quad=\mathcal N_{z,\sigma,\tau}
\frac{b_{\rho_1,\rho_2}^{\,r}(-b_{\alpha,\rho_1})^k
q^{gk+\binom{k}{2}}
(b_{\alpha,\bar\rho_1};q)_{r+k}(b_{\alpha,\rho_1};q)_g}
{(q;q)_r(q;q)_k(a^{-2};q)_{g+r+k}},
\end{aligned} W z , σ , τ [ 2 ] ( ( g , ∞ ) , ( 0 , 0 ) ; ( g + r + k , ∞ ) , ( r , k ) ) = N z , σ , τ ( q ; q ) r ( q ; q ) k ( a − 2 ; q ) g + r + k b ρ 1 , ρ 2 r ( − b α , ρ 1 ) k q g k + ( 2 k ) ( b α , ρ ˉ 1 ; q ) r + k ( b α , ρ 1 ; q ) g , where z = a − 2 z=a^{-2} z = a − 2 and N z , σ , τ = ( a − 2 ; q ) ∞ ( b ρ 1 , ρ 2 ; q ) ∞ ( b α , ρ 1 ; q ) ∞ ( b α , ρ 2 ; q ) ∞ .
\mathcal N_{z,\sigma,\tau}
=\frac{(a^{-2};q)_\infty(b_{\rho_1,\rho_2};q)_\infty}
{(b_{\alpha,\rho_1};q)_\infty(b_{\alpha,\rho_2};q)_\infty}.
N z , σ , τ = ( b α , ρ 1 ; q ) ∞ ( b α , ρ 2 ; q ) ∞ ( a − 2 ; q ) ∞ ( b ρ 1 , ρ 2 ; q ) ∞ . For fixed input g g g , the weights form the joint probability distribution of the output coordinates ( h 0 ′ , h 2 ′ ) (h_0',h_2') ( h 0 ′ , h 2 ′ ) , evaluated at ( r , k ) (r,k) ( r , k ) . The first coordinate has the input-independent law h 0 ′ ∼ q - N B ( b α , ρ ˉ 1 , b ρ 1 , ρ 2 ) .
h_0'\sim q\text{-}\mathrm{NB}
(b_{\alpha,\bar\rho_1},b_{\rho_1,\rho_2}).
h 0 ′ ∼ q - NB ( b α , ρ ˉ 1 , b ρ 1 , ρ 2 ) . The output vectors are H ′ = ( h 0 ′ , h 2 ′ ) H'=(h_0',h_2') H ′ = ( h 0 ′ , h 2 ′ ) and G ′ = ( g 1 ′ , ∞ ) G'=(g_1',\infty) G ′ = ( g 1 ′ , ∞ ) , with g 1 ′ = g + h 0 ′ + h 2 ′ g_1'=g+h_0'+h_2' g 1 ′ = g + h 0 ′ + h 2 ′ .
Proof. Substitute G = ( g , R ) G=(g,R) G = ( g , R ) , H = ( 0 , 0 ) H=(0,0) H = ( 0 , 0 ) , G ′ = ( g + r + k , R − k ) G'=(g+r+k,R-k) G ′ = ( g + r + k , R − k ) , H ′ = ( r , k ) H'=(r,k) H ′ = ( r , k ) in (3.23) . Only P 2 = 0 P_2=0 P 2 = 0 survives, with p = P 1 p=P_1 p = P 1 in the notation of that formula. After R → ∞ R\to\infty R → ∞ , the identity ( τ q 1 − p ; q ) p = ( − τ ) p q − ( p 2 ) ( 1 / τ ; q ) p (\tau q^{1-p};q)_p=(-\tau)^pq^{-\binom p2}(1/\tau;q)_p ( τ q 1 − p ; q ) p = ( − τ ) p q − ( 2 p ) ( 1/ τ ; q ) p reduces the sum to the following finite identity, with n = g + r + k n=g+r+k n = g + r + k :
∑ p = 0 n ( τ q 1 − r − k ; q ) n − p ( 1 / τ ; q ) p ( q ; q ) n − p ( q ; q ) p ( z / q ; q ) p ( z ; q ) p ( τ q 1 − k ) p = ( z / q ) k ( τ q 1 − r − k ; q ) r + k ( τ z ; q ) g ( z ; q ) g + r + k . \sum_{p=0}^{n}
\frac{(\tau q^{1-r-k};q)_{n-p}(1/\tau;q)_p}
{(q;q)_{n-p}(q;q)_p}
\frac{(z/q;q)_p}{(z;q)_p}(\tau q^{1-k})^p
=(z/q)^k(\tau q^{1-r-k};q)_{r+k}
\frac{(\tau z;q)_g}{(z;q)_{g+r+k}}. p = 0 ∑ n ( q ; q ) n − p ( q ; q ) p ( τ q 1 − r − k ; q ) n − p ( 1/ τ ; q ) p ( z ; q ) p ( z / q ; q ) p ( τ q 1 − k ) p = ( z / q ) k ( τ q 1 − r − k ; q ) r + k ( z ; q ) g + r + k ( τ z ; q ) g . It follows by expanding ( z / q ; q ) p / ( z ; q ) p (z/q;q)_p/(z;q)_p ( z / q ; q ) p / ( z ; q ) p geometrically for ∣ z ∣ < q |z|<q ∣ z ∣ < q and applying the q q q -binomial theorem, then by rational continuation. Restoring the prefactors gives
N z , σ , τ ( σ τ z ) r ( − τ z ) k q g k + ( k 2 ) ( 1 / τ ; q ) r + k ( τ z ; q ) g ( q ; q ) r ( q ; q ) k ( z ; q ) g + r + k , N z , σ , τ = ( z ; q ) ∞ ( σ τ z ; q ) ∞ ( τ z ; q ) ∞ ( σ z ; q ) ∞ . \begin{equation}
\mathcal N_{z,\sigma,\tau}
\frac{(\sigma\tau z)^r(-\tau z)^kq^{gk+\binom k2}
(1/\tau;q)_{r+k}(\tau z;q)_g}
{(q;q)_r(q;q)_k(z;q)_{g+r+k}},\qquad
\mathcal N_{z,\sigma,\tau}
=\frac{(z;q)_\infty(\sigma\tau z;q)_\infty}
{(\tau z;q)_\infty(\sigma z;q)_\infty}. \tag*{(5.42)}
\end{equation} N z , σ , τ ( q ; q ) r ( q ; q ) k ( z ; q ) g + r + k ( σ τ z ) r ( − τ z ) k q g k + ( 2 k ) ( 1/ τ ; q ) r + k ( τ z ; q ) g , N z , σ , τ = ( τ z ; q ) ∞ ( σ z ; q ) ∞ ( z ; q ) ∞ ( σ τ z ; q ) ∞ . (5.42) For its sum over k k k , use the confluent q q q -Gauss identity
∑ k ≥ 0 ( u ; q ) k q ( k 2 ) ( − v / u ) k ( v ; q ) k ( q ; q ) k = ( v / u ; q ) ∞ ( v ; q ) ∞ \sum_{k\geq0}\frac{(u;q)_kq^{\binom k2}(-v/u)^k}
{(v;q)_k(q;q)_k}=\frac{(v/u;q)_\infty}{(v;q)_\infty} k ≥ 0 ∑ ( v ; q ) k ( q ; q ) k ( u ; q ) k q ( 2 k ) ( − v / u ) k = ( v ; q ) ∞ ( v / u ; q ) ∞ with u = q r / τ u=q^r/\tau u = q r / τ , v = z q g + r v=zq^{g+r} v = z q g + r . The result is
( σ τ z ; q ) ∞ ( σ z ; q ) ∞ ( 1 / τ ; q ) r ( σ τ z ) r ( q ; q ) r = p b α , ρ ˉ 1 , b ρ 1 , ρ 2 ( q ) ( r ) , \frac{(\sigma\tau z;q)_\infty}{(\sigma z;q)_\infty}
\frac{(1/\tau;q)_r(\sigma\tau z)^r}{(q;q)_r}
=p_{b_{\alpha,\bar\rho_1},b_{\rho_1,\rho_2}}^{(q)}(r), ( σ z ; q ) ∞ ( σ τ z ; q ) ∞ ( q ; q ) r ( 1/ τ ; q ) r ( σ τ z ) r = p b α , ρ ˉ 1 , b ρ 1 , ρ 2 ( q ) ( r ) , proving the marginal law and the sum-to-one property. ◻
Proposition 5.14. Under (5.37) , the two constructions in Figure 19 have the same local limiting output law. Equivalently, Figure 21 , with both boundary outputs equal to the zero hole-indexed state, represents the stationary two-engine law of Theorem 1.2 .
Proof. Use the same finite-volume Yang–Baxter argument as in the proof of Proposition 5.7 , now with the exact specialization (5.37) . The engine and boundary kernels are stochastic by Proposition 4.8 . It remains only to check the crossing at the right endpoint and the effect of its outgoing carrier.
For input ( 0 , ∞ ) , ( h , 0 ) (0,\infty),(h,0) ( 0 , ∞ ) , ( h , 0 ) , sample
P ( ψ 0 = j ) = [ h j ] q ( − σ z ) h − j q ( h − j 2 ) ( σ z ; q ) h , 0 ≤ j ≤ h . \mathbb P(\psi_0=j)=\begin{bmatrix}h\\j\end{bmatrix}_{\!q}
\frac{(-\sigma z)^{h-j}q^{\binom{h-j}{2}}}{(\sigma z;q)_h},
\qquad 0\leq j\leq h. P ( ψ 0 = j ) = [ h j ] q ( σ z ; q ) h ( − σ z ) h − j q ( 2 h − j ) , 0 ≤ j ≤ h . Independently of ψ 0 \psi_0 ψ 0 , sample the output coordinates ( h ~ 0 , h ~ 2 ) (\widetilde h_0,\widetilde h_2) ( h 0 , h 2 ) from (5.42) with g = 0 g=0 g = 0 and ( z , σ , τ ) (z,\sigma,\tau) ( z , σ , τ ) replaced by ( z q h , σ , τ q − h ) (zq^h,\sigma,\tau q^{-h}) ( z q h , σ , τ q − h ) . The full output vectors are
H ′ = ( h − ψ 0 + h ~ 0 , ψ 0 + h ~ 2 ) , G ′ = ( h ~ 0 + h ~ 2 , ∞ ) . H'=(h-\psi_0+\widetilde h_0,\psi_0+\widetilde h_2),
\qquad G'=(\widetilde h_0+\widetilde h_2,\infty). H ′ = ( h − ψ 0 + h 0 , ψ 0 + h 2 ) , G ′ = ( h 0 + h 2 , ∞ ) . This identity follows from the terminating Heine transformation of (3.23) . Both factors are probability distributions, so the right-end crossing is stochastic. The positive-recurrence argument in the proof of Proposition 4.13 gives tightness of the incoming family h h h , and the displayed factorization then gives tightness of its finite outgoing coordinates. Given ε > 0 \varepsilon>0 ε > 0 , restrict these coordinates to a fixed finite set with probability at least 1 − ε 1-\varepsilon 1 − ε . On this event, the erasing-block coupling following Lemma 4.12 removes the resulting right entrance before any fixed output window. Letting the cutoff tend to infinity and then ε ↓ 0 \varepsilon\downarrow0 ε ↓ 0 completes the same last step as in the proof of Proposition 5.7 . ◻
Unlike in Sub§ 5.4 , the unreflected rows under the exact specialization (5.37) are not in the Martin specialization of Proposition 2.21 : here x = a − 1 > 0 x=a^{-1}>0 x = a − 1 > 0 , rather than x → 0 x\to0 x → 0 . Consequently, their internal queue lengths have α \alpha α -dependent stationary laws, and the identification of their two-site output with the corresponding marginal of π ρ 1 , ρ 2 \pi^{\rho_1,\rho_2} π ρ 1 , ρ 2 does not follow directly from that proposition. The only new input is the stationary queue law; the two-site conditioning is the same calculation as in Proposition 2.5 .
Lemma 5.15. Start the upper unreflected row at site 3 3 3 with g 3 ∼ q - N B ( b α , ρ ˉ 2 , b ρ ˉ 1 , ρ 2 ) g_3\sim q\text{-}\mathrm{NB}
(b_{\alpha,\bar\rho_2},b_{\bar\rho_1,\rho_2}) g 3 ∼ q - NB ( b α , ρ ˉ 2 , b ρ ˉ 1 , ρ 2 ) , independently of the incoming colors and vertex randomness at sites 2 2 2 and 1 1 1 . Process site 2 2 2 and then site 1 1 1 , and denote the output colors by d ( 2 ) , d ( 1 ) d(2),d(1) d ( 2 ) , d ( 1 ) and the resulting queue length by g 1 g_1 g 1 . Then g 1 g_1 g 1 has the stationary law g 1 ∼ q - N B ( b α , ρ ˉ 2 , b ρ ˉ 1 , ρ 2 ) .
g_1\sim q\text{-}\mathrm{NB}
(b_{\alpha,\bar\rho_2},b_{\bar\rho_1,\rho_2}).
g 1 ∼ q - NB ( b α , ρ ˉ 2 , b ρ ˉ 1 , ρ 2 ) . Moreover, ( d ( 1 ) , d ( 2 ) ) (d(1),d(2)) ( d ( 1 ) , d ( 2 )) has the same law as the two-site marginal of π ρ 1 , ρ 2 \pi^{\rho_1,\rho_2} π ρ 1 , ρ 2 in Theorem 2.4 . If g 1 i j g_1^{ij} g 1 ij denotes the conditional law g 1 i j = d ( g 1 ∣ ( d ( 1 ) , d ( 2 ) ) = ( i , j ) ) , g_1^{ij}\overset d=
\bigl(g_1\mid(d(1),d(2))=(i,j)\bigr), g 1 ij = d ( g 1 ∣ ( d ( 1 ) , d ( 2 )) = ( i , j ) ) , then g 1 11 ∼ q - N B ( b α , ρ ˉ 2 , b ρ ˉ 1 , ρ 2 ) , g 1 12 , g 1 21 ∼ q - N B ( q − 1 b α , ρ ˉ 2 , q b ρ ˉ 1 , ρ 2 ) .
g_1^{11}\sim q\text{-}\mathrm{NB}
(b_{\alpha,\bar\rho_2},b_{\bar\rho_1,\rho_2}),\qquad
g_1^{12},g_1^{21}\sim q\text{-}\mathrm{NB}
(q^{-1}b_{\alpha,\bar\rho_2},qb_{\bar\rho_1,\rho_2}).
g 1 11 ∼ q - NB ( b α , ρ ˉ 2 , b ρ ˉ 1 , ρ 2 ) , g 1 12 , g 1 21 ∼ q - NB ( q − 1 b α , ρ ˉ 2 , q b ρ ˉ 1 , ρ 2 ) .
Proof. Detailed balance for the usual vertex in Figure 1 gives (5.43) . For the conditional laws, repeat the proof of Proposition 2.5 with
u = b α , ρ ˉ 2 , v = b ρ ˉ 1 , ρ 2 , x = a − 1 . u=b_{\alpha,\bar\rho_2},\qquad
v=b_{\bar\rho_1,\rho_2},\qquad x=a^{-1}. u = b α , ρ ˉ 2 , v = b ρ ˉ 1 , ρ 2 , x = a − 1 . The defining mass formula (2.7) gives
( 1 − q m + 1 ) p u , v ( q ) ( m + 1 ) = v ( 1 − u q m ) p u , v ( q ) ( m ) , v = ρ 1 ρ ˉ 2 ρ ˉ 1 ρ 2 , q u a d u v = − ρ 1 x ρ ˉ 1 . (1-q^{m+1})p_{u,v}^{(q)}(m+1)
=v(1-uq^m)p_{u,v}^{(q)}(m),
\qquad
v=\frac{\rho_1\bar\rho_2}{\bar\rho_1\rho_2},quad
uv=-\frac{\rho_1x}{\bar\rho_1}. ( 1 − q m + 1 ) p u , v ( q ) ( m + 1 ) = v ( 1 − u q m ) p u , v ( q ) ( m ) , v = ρ ˉ 1 ρ 2 ρ 1 ρ ˉ 2 , q u a d uv = − ρ ˉ 1 ρ 1 x . Thus the additional x x x -terms cancel in the same site-by-site case split. The output probabilities are those in (2.11) ; conditioning on 11 11 11 leaves ( u , v ) (u,v) ( u , v ) unchanged, while conditioning on 12 12 12 or 21 21 21 replaces it by ( q − 1 u , q v ) (q^{-1}u,qv) ( q − 1 u , q v ) . This proves (5.44) . ◻
Lemma 5.16. Conditional on the output word a b ab ab , feed G = ( g 1 a b , ∞ ) G=(g_1^{ab},\infty) G = ( g 1 ab , ∞ ) and H = ( 0 , 0 ) H=(0,0) H = ( 0 , 0 ) through the crossing and write its hole-indexed output as H ′ = ( h 0 l o w , h 2 a b ) H'=(h_0^{\mathrm{low}},h_2^{ab}) H ′ = ( h 0 low , h 2 ab ) . For m ≥ 0 m\geq0 m ≥ 0 , the required moments are E [ q m h 0 l o w ] = ( b ρ 1 , ρ 2 ; q ) m ( b α , ρ 2 ; q ) m , E [ q m ( h 0 l o w + h 2 11 ) ] = ( b ρ 1 , ρ 2 ; q ) m ( b α , ρ 1 ; q ) m , E [ q 2 h 0 l o w + h 2 11 ] = ( b ρ 1 , ρ 2 ; q ) 2 [ 1 − q b α , ρ 1 − ( 1 − q ) b α , ρ 2 ] ( 1 − b α , ρ 1 ) ( 1 − b α , ρ 2 ) ( 1 − q b α , ρ 1 ) , E [ q 2 h 0 l o w + h 2 12 ] = E [ q 2 h 0 l o w + h 2 21 ] = ( b ρ 1 , ρ 2 ; q ) 2 ( 1 − b α , ρ 1 ) ( 1 − b α , ρ 2 ) . \begin{aligned}
\mathbb E[q^{m h_0^{\mathrm{low}}}]
&=\frac{(b_{\rho_1,\rho_2};q)_m}{(b_{\alpha,\rho_2};q)_m},
\qquad
\mathbb E[q^{m(h_0^{\mathrm{low}}+h_2^{11})}]
=\frac{(b_{\rho_1,\rho_2};q)_m}{(b_{\alpha,\rho_1};q)_m},
\\
\mathbb E[q^{2h_0^{\mathrm{low}}+h_2^{11}}]
&=\frac{(b_{\rho_1,\rho_2};q)_2
[1-qb_{\alpha,\rho_1}-(1-q)b_{\alpha,\rho_2}]}
{(1-b_{\alpha,\rho_1})(1-b_{\alpha,\rho_2})
(1-qb_{\alpha,\rho_1})},
\\
\mathbb E[q^{2h_0^{\mathrm{low}}+h_2^{12}}]
=\mathbb E[q^{2h_0^{\mathrm{low}}+h_2^{21}}]
&=\frac{(b_{\rho_1,\rho_2};q)_2}
{(1-b_{\alpha,\rho_1})(1-b_{\alpha,\rho_2})}.
\end{aligned} E [ q m h 0 low ] E [ q 2 h 0 low + h 2 11 ] E [ q 2 h 0 low + h 2 12 ] = E [ q 2 h 0 low + h 2 21 ] = ( b α , ρ 2 ; q ) m ( b ρ 1 , ρ 2 ; q ) m , E [ q m ( h 0 low + h 2 11 ) ] = ( b α , ρ 1 ; q ) m ( b ρ 1 , ρ 2 ; q ) m , = ( 1 − b α , ρ 1 ) ( 1 − b α , ρ 2 ) ( 1 − q b α , ρ 1 ) ( b ρ 1 , ρ 2 ; q ) 2 [ 1 − q b α , ρ 1 − ( 1 − q ) b α , ρ 2 ] , = ( 1 − b α , ρ 1 ) ( 1 − b α , ρ 2 ) ( b ρ 1 , ρ 2 ; q ) 2 .
Proof. The first identity in (5.45) follows from the input-independent marginal in Proposition 5.13 and Lemma 5.1 .
For input ( g 1 , ∞ ) (g_1,\infty) ( g 1 , ∞ ) , use H ′ = ( h 0 ′ , h 2 ′ ) H'=(h_0',h_2') H ′ = ( h 0 ′ , h 2 ′ ) for the generic crossing output, and fix a value ℓ ∈ Z ≥ 0 \ell\in\mathbb Z_{\geq0} ℓ ∈ Z ≥ 0 of h 0 ′ + h 2 ′ h_0'+h_2' h 0 ′ + h 2 ′ . The finite q q q -binomial theorem sums (5.42) over k k k , and averaging over g 1 g_1 g 1 then uses
∑ g ≥ 0 ( τ z ; q ) g ( q ℓ / σ ; q ) g ( q ; q ) g ( z q ℓ ; q ) g ( σ / τ ) g = ( q ℓ / τ ; q ) ∞ ( σ z ; q ) ∞ ( z q ℓ ; q ) ∞ ( σ / τ ; q ) ∞ . \sum_{g\geq0}\frac{(\tau z;q)_g(q^\ell/\sigma;q)_g}
{(q;q)_g(zq^\ell;q)_g}(\sigma/\tau)^g
=\frac{(q^\ell/\tau;q)_\infty(\sigma z;q)_\infty}
{(zq^\ell;q)_\infty(\sigma/\tau;q)_\infty}. g ≥ 0 ∑ ( q ; q ) g ( z q ℓ ; q ) g ( τ z ; q ) g ( q ℓ / σ ; q ) g ( σ / τ ) g = ( z q ℓ ; q ) ∞ ( σ / τ ; q ) ∞ ( q ℓ / τ ; q ) ∞ ( σ z ; q ) ∞ . This gives h 0 ′ + h 2 ′ ∼ q - N B ( b α , ρ ˉ 2 , b ρ 1 , ρ 2 ) h_0'+h_2'\sim
q\text{-}\mathrm{NB}(b_{\alpha,\bar\rho_2},b_{\rho_1,\rho_2}) h 0 ′ + h 2 ′ ∼ q - NB ( b α , ρ ˉ 2 , b ρ 1 , ρ 2 ) , proving the second identity in (5.45) . Inserting q h 0 ′ q^{h_0'} q h 0 ′ in the same sums gives
E [ q h 0 ′ ∣ h 0 ′ + h 2 ′ = ℓ ] = q ℓ [ 1 + 1 − σ / τ 1 − σ z q ℓ − 1 σ q ( 1 − q ℓ − 1 / σ ) ] . \mathbb E[q^{h_0'}\mid h_0'+h_2'=\ell]
=q^\ell\left[1+\frac{1-\sigma/\tau}{1-\sigma z}
\frac{q^\ell-1}{\sigma q(1-q^{\ell-1}/\sigma)}\right]. E [ q h 0 ′ ∣ h 0 ′ + h 2 ′ = ℓ ] = q ℓ [ 1 + 1 − σ z 1 − σ / τ σ q ( 1 − q ℓ − 1 / σ ) q ℓ − 1 ] . Multiplication by q ℓ q^\ell q ℓ and summation with p ℓ = p 1 / σ , σ τ z ( q ) ( ℓ ) p_\ell=p_{1/\sigma,\sigma\tau z}^{(q)}(\ell) p ℓ = p 1/ σ , σ τ z ( q ) ( ℓ ) uses p ℓ ( q ℓ − 1 ) / ( 1 − q ℓ − 1 / σ ) = − σ τ z p ℓ − 1 p_\ell(q^\ell-1)/(1-q^{\ell-1}/\sigma)
=-\sigma\tau z\,p_{\ell-1} p ℓ ( q ℓ − 1 ) / ( 1 − q ℓ − 1 / σ ) = − σ τ z p ℓ − 1 , proving eq:large-alpha-11-mixed-moment . Finally, write E g 1 \mathbb E_{g_1} E g 1 and E g 1 + 1 \mathbb E_{g_1+1} E g 1 + 1 for expectations with bottom input ( g 1 , ∞ ) (g_1,\infty) ( g 1 , ∞ ) and ( g 1 + 1 , ∞ ) (g_1+1,\infty) ( g 1 + 1 , ∞ ) , respectively, and horizontal input ( 0 , 0 ) (0,0) ( 0 , 0 ) . Shifting the bottom input gives
σ z q E g 1 + 1 [ q 2 h 0 ′ + h 2 ′ ] = E g 1 [ q 2 h 0 ′ + h 2 ′ ] − ( 1 − q b ρ 1 , ρ 2 ) E g 1 [ q h 0 ′ + h 2 ′ ] . \sigma zq\,\mathbb E_{g_1+1}[q^{2h_0'+h_2'}]
=\mathbb E_{g_1}[q^{2h_0'+h_2'}]
-(1-qb_{\rho_1,\rho_2})\mathbb E_{g_1}[q^{h_0'+h_2'}]. σ z q E g 1 + 1 [ q 2 h 0 ′ + h 2 ′ ] = E g 1 [ q 2 h 0 ′ + h 2 ′ ] − ( 1 − q b ρ 1 , ρ 2 ) E g 1 [ q h 0 ′ + h 2 ′ ] . This follows by shifting adjacent indices in (5.42) . Since g 1 12 g_1^{12} g 1 12 and g 1 21 g_1^{21} g 1 21 have the second law in (5.44) , the defining mass formula (2.7) shows that the corresponding difference of the g 1 g_1 g 1 and g 1 + 1 g_1+1 g 1 + 1 expectations gives eq:large-alpha-12-mixed-moment . ◻
These crossing moments allow us to compute p 22 p_{22} p 22 and p 20 p_{20} p 20 for the present specialization.
Proposition 5.17. For α > 1 \alpha>1 α > 1 and 0 < q < 1 0<q<1 0 < q < 1 , the stationary law μ α , ρ 1 , ρ 2 \mu^{\alpha,\rho_1,\rho_2} μ α , ρ 1 , ρ 2 of Theorem 1.2 satisfies the two identities in (5.1) . By the color-projection reduction, its two-site marginal is the one stated in Theorem 1.4 .
Proof. The lower output 22 22 22 . Condition on the two-letter output a b ab ab of the unreflected rows and apply the return-vertex rules in Figure 2 twice. For example, input 00 00 00 , with carrier state ( r , k ) (r,k) ( r , k ) , produces output 22 22 22 with weight ρ 1 2 a − 2 q 2 r + 1 ( 1 − q k ) ( 1 − q k − 1 ) \rho_1^2a^{-2}q^{2r+1}(1-q^k)(1-q^{k-1}) ρ 1 2 a − 2 q 2 r + 1 ( 1 − q k ) ( 1 − q k − 1 ) : the first conversion changes the carrier state to ( r + 1 , k − 1 ) (r+1,k-1) ( r + 1 , k − 1 ) before the second vertex is applied. Combining the path weights with the joint queue/output probabilities from the two-site calculation in Lemma 5.15 , and then using the moments in Lemma 5.16 , gives
ν 22 ρ 1 2 = π 22 α 2 E [ q 2 h 0 l o w ] + ( ρ 2 − ρ 1 ) ( ρ 1 + a − 1 ρ ˉ 1 ) ( 1 + θ α + 1 − q a ) ( E [ q 2 h 0 l o w ] − E [ q 2 h 0 l o w + h 2 12 ] ) + ( ρ 1 + a − 1 ρ ˉ 1 ) ( ρ 1 + q a − 1 ρ ˉ 1 ) q E [ q 2 h 0 l o w ( q h 2 11 − 1 ) ( q h 2 11 − q ) ] . \begin{align}
\frac{\nu_{22}}{\rho_1^2}
&=\frac{\pi_{22}}{\alpha^2}
\mathbb E[q^{2h_0^{\mathrm{low}}}]\notag\\
&\quad +(\rho_2-\rho_1)(\rho_1+a^{-1}\bar\rho_1)
\left(\frac{1+\theta}{\alpha}+\frac{1-q}{a}\right)
\left(
\mathbb E[q^{2h_0^{\mathrm{low}}}]
-\mathbb E[q^{2h_0^{\mathrm{low}}+h_2^{12}}]
\right)\notag\\
&\quad +\frac{(\rho_1+a^{-1}\bar\rho_1)
(\rho_1+qa^{-1}\bar\rho_1)}q
\mathbb E\!\left[
q^{2h_0^{\mathrm{low}}}(q^{h_2^{11}}-1)(q^{h_2^{11}}-q)
\right]. \tag*{(5.46)}
\end{align} ρ 1 2 ν 22 = α 2 π 22 E [ q 2 h 0 low ] + ( ρ 2 − ρ 1 ) ( ρ 1 + a − 1 ρ ˉ 1 ) ( α 1 + θ + a 1 − q ) ( E [ q 2 h 0 low ] − E [ q 2 h 0 low + h 2 12 ] ) + q ( ρ 1 + a − 1 ρ ˉ 1 ) ( ρ 1 + q a − 1 ρ ˉ 1 ) E [ q 2 h 0 low ( q h 2 11 − 1 ) ( q h 2 11 − q ) ] . (5.46) The lower output 20 20 20 . The same conditioning and sequential state update, now summing the paths with output 20 20 20 , gives the following convenient expression for the row sum containing ν 20 \nu_{20} ν 20 :
ν 20 + ν 22 ρ 1 2 = ρ 2 − ρ 1 α ( E [ q h 0 l o w ] − ( ρ 1 + a − 1 ρ ˉ 1 ) E [ q 2 h 0 l o w + h 2 12 ] ) + ( ρ 1 + a − 1 ρ ˉ 1 ) ( ρ 1 + q a − 1 ρ ˉ 1 ) q ( E [ q 2 h 0 l o w + 2 h 2 11 ] − E [ q 2 h 0 l o w + h 2 11 ] ) + ( ρ 1 + a − 1 ρ ˉ 1 ) ( E [ q h 0 l o w ] − E [ q h 0 l o w + h 2 11 ] ) . \begin{align}
\frac{\nu_{20}+\nu_{22}}{\rho_1^2}
&=\frac{\rho_2-\rho_1}{\alpha}
\left(
\mathbb E[q^{h_0^{\mathrm{low}}}]
-(\rho_1+a^{-1}\bar\rho_1)
\mathbb E[q^{2h_0^{\mathrm{low}}+h_2^{12}}]
\right)\notag\\
&\quad+\frac{(\rho_1+a^{-1}\bar\rho_1)
(\rho_1+qa^{-1}\bar\rho_1)}q
\left(
\mathbb E[q^{2h_0^{\mathrm{low}}+2h_2^{11}}]
-\mathbb E[q^{2h_0^{\mathrm{low}}+h_2^{11}}]
\right)\notag\\
&\quad+(\rho_1+a^{-1}\bar\rho_1)
\left(
\mathbb E[q^{h_0^{\mathrm{low}}}]
-\mathbb E[q^{h_0^{\mathrm{low}}+h_2^{11}}]
\right). \tag*{(5.47)}
\end{align} ρ 1 2 ν 20 + ν 22 = α ρ 2 − ρ 1 ( E [ q h 0 low ] − ( ρ 1 + a − 1 ρ ˉ 1 ) E [ q 2 h 0 low + h 2 12 ] ) + q ( ρ 1 + a − 1 ρ ˉ 1 ) ( ρ 1 + q a − 1 ρ ˉ 1 ) ( E [ q 2 h 0 low + 2 h 2 11 ] − E [ q 2 h 0 low + h 2 11 ] ) + ( ρ 1 + a − 1 ρ ˉ 1 ) ( E [ q h 0 low ] − E [ q h 0 low + h 2 11 ] ) . (5.47) Substitute (5.45) – eq:large-alpha-12-mixed-moment . For the first expression, use π 22 = ( ρ 2 − ρ 1 ) ( ρ 2 − ρ 1 θ ) \pi_{22}=(\rho_2-\rho_1)(\rho_2-\rho_1\theta) π 22 = ( ρ 2 − ρ 1 ) ( ρ 2 − ρ 1 θ ) and
ρ 1 ( b α , ρ 2 − b α , ρ 1 ) = ρ 2 − ρ 1 a ρ 2 , ρ 1 ( q b α , ρ 2 − b α , ρ 1 ) = ρ 2 − ρ 1 θ a ρ 2 . \rho_1(b_{\alpha,\rho_2}-b_{\alpha,\rho_1})
=\frac{\rho_2-\rho_1}{a\rho_2},\qquad
\rho_1(qb_{\alpha,\rho_2}-b_{\alpha,\rho_1})
=\frac{\rho_2-\rho_1\theta}{a\rho_2}. ρ 1 ( b α , ρ 2 − b α , ρ 1 ) = a ρ 2 ρ 2 − ρ 1 , ρ 1 ( q b α , ρ 2 − b α , ρ 1 ) = a ρ 2 ρ 2 − ρ 1 θ . The factor multiplying ρ 1 2 ( b ρ 1 , ρ 2 ; q ) 2 π 22 / ( b α , ρ 2 ; q ) 2 \rho_1^2(b_{\rho_1,\rho_2};q)_2\pi_{22}/(b_{\alpha,\rho_2};q)_2 ρ 1 2 ( b ρ 1 , ρ 2 ; q ) 2 π 22 / ( b α , ρ 2 ; q ) 2 is exactly
α − 2 + 1 a ρ 2 ( 1 + θ α + 1 − q a ) + q a 2 ρ 2 2 = ( b α , ρ 2 ; q ) 2 . \alpha^{-2}+\frac1{a\rho_2}
\left(\frac{1+\theta}{\alpha}+\frac{1-q}{a}\right)
+\frac q{a^2\rho_2^2}=(b_{\alpha,\rho_2};q)_2. α − 2 + a ρ 2 1 ( α 1 + θ + a 1 − q ) + a 2 ρ 2 2 q = ( b α , ρ 2 ; q ) 2 . The second expression simplifies using α − 1 + ( a ρ 2 ) − 1 = 1 − b α , ρ 2 \alpha^{-1}+(a\rho_2)^{-1}=1-b_{\alpha,\rho_2} α − 1 + ( a ρ 2 ) − 1 = 1 − b α , ρ 2 . Consequently
ν 22 = ρ 1 2 ( b ρ 1 , ρ 2 ; q ) 2 π 22 , ν 20 + ν 22 = ρ 1 2 ( 1 − b ρ 1 , ρ 2 ) ( ρ 2 − ρ 1 ) ( ρ ˉ 1 + q ρ 1 b ρ 1 , ρ 2 ) , \nu_{22}=\rho_1^2(b_{\rho_1,\rho_2};q)_2\pi_{22},\qquad
\nu_{20}+\nu_{22}=\rho_1^2(1-b_{\rho_1,\rho_2})
(\rho_2-\rho_1)(\bar\rho_1+q\rho_1b_{\rho_1,\rho_2}), ν 22 = ρ 1 2 ( b ρ 1 , ρ 2 ; q ) 2 π 22 , ν 20 + ν 22 = ρ 1 2 ( 1 − b ρ 1 , ρ 2 ) ( ρ 2 − ρ 1 ) ( ρ ˉ 1 + q ρ 1 b ρ 1 , ρ 2 ) , or, by (5.7) ,
The upper reflected row. It starts with the zero hole-indexed state. By Figure 2 , each output 0 0 0 or 2 2 2 requires the same input color, has weight ρ 2 ( 1 − a − 1 ) = ρ 2 / α \rho_2(1-a^{-1})=\rho_2/\alpha ρ 2 ( 1 − a − 1 ) = ρ 2 / α , and leaves the carrier state equal to zero. Hence
p 22 = ( ρ 2 / α ) 2 ν 22 , p 20 = ( ρ 2 / α ) 2 ν 20 . p_{22}=(\rho_2/\alpha)^2\nu_{22},\qquad
p_{20}=(\rho_2/\alpha)^2\nu_{20}. p 22 = ( ρ 2 / α ) 2 ν 22 , p 20 = ( ρ 2 / α ) 2 ν 20 . Together with (5.48) , these are precisely the two identities in (5.1) . ◻
Endpoints.
At α = 1 \alpha=1 α = 1 , the common specialization in § 4 has zero boundary state. Set a − 1 = 0 a^{-1}=0 a − 1 = 0 in the row kernels; no finite value of a , τ , σ a,\tau,\sigma a , τ , σ is needed. All b 1 , ρ i b_{1,\rho_i} b 1 , ρ i and b 1 , ρ ˉ i b_{1,\bar\rho_i} b 1 , ρ ˉ i vanish, and the crossing law is 1 { k = 0 } p b ρ 1 , ρ 2 ( q ) ( r ) \mathbf1_{\{k=0\}}p_{b_{\rho_1,\rho_2}}^{(q)}(r) 1 { k = 0 } p b ρ 1 , ρ 2 ( q ) ( r ) . Thus h 2 a b = 0 h_2^{ab}=0 h 2 ab = 0 , and h 0 l o w ∼ q - P o i ( b ρ 1 , ρ 2 ) h_0^{\mathrm{low}}\sim q\text{-}\mathrm{Poi}(b_{\rho_1,\rho_2}) h 0 low ∼ q - Poi ( b ρ 1 , ρ 2 ) . Substitution in the preceding proof gives (5.1) at α = 1 \alpha=1 α = 1 . The result extends to q = 0 q=0 q = 0 as the expressions are continuous at q = 0 q=0 q = 0 , which complete the proof of Theorem 1.4 .
Application: speeds of colored particles in half-space
Throughout this section, we set q = 0 q=0 q = 0 and fix 0 < α ≤ 1 0<\alpha\leq1 0 < α ≤ 1 . We first recall the necessary preliminary results and determine the limiting distribution of the signed speed of color 1 1 1 . Assuming a two-species local-equilibrium conjecture, we then use the stationary measure constructed earlier to compute the joint limiting law of the first two particles, conditional on both particles remaining on the positive half-line.
Let Z ∗ = Z ∖ { 0 } \mathbb Z^\ast=\mathbb Z\setminus\{0\} Z ∗ = Z ∖ { 0 } . The multispecies half-space TASEP is the continuous-time Markov process ( η t ) t ≥ 0 (\eta_t)_{t\geq 0} ( η t ) t ≥ 0 on signed permutations of Z ∗ \mathbb Z^\ast Z ∗ , satisfying η t ( − x ) = − η t ( x ) \eta_t(-x)=-\eta_t(x) η t ( − x ) = − η t ( x ) for x ∈ Z ∗ x\in\mathbb Z^\ast x ∈ Z ∗ , with initial condition η 0 ( x ) = x \eta_0(x)=x η 0 ( x ) = x . Here η t ( x ) \eta_t(x) η t ( x ) denotes the color occupying site x x x at time t t t and X i ( t ) : = η t − 1 ( i ) X_i(t):=\eta_t^{-1}(i) X i ( t ) := η t − 1 ( i ) denotes the signed position of color i ≥ 1 i\geq1 i ≥ 1 . For every x ≥ 1 x\geq 1 x ≥ 1 , a rate-one clock exchanges the colors at x , x + 1 x,x+1 x , x + 1 and − x , − x − 1 -x,-x-1 − x , − x − 1 simultaneously when η t ( x ) < η t ( x + 1 ) \eta_t(x)<\eta_t(x+1) η t ( x ) < η t ( x + 1 ) . A rate-α \alpha α clock exchanges the colors at − 1 , 1 -1,1 − 1 , 1 whenever η t ( − 1 ) < η t ( 1 ) \eta_t(-1)<\eta_t(1) η t ( − 1 ) < η t ( 1 ) .
We have the following color-position symmetry property of the signed permutation.
Proposition 6.1 ([67 ] , Proposition 2.1). For every t ≥ 0 t\geq 0 t ≥ 0 , η t = d η t − 1 . \eta_t\overset{d}=\eta_t^{-1}. η t = d η t − 1 .
For a color threshold i ∈ Z > 0 i\in\mathbb Z_{>0} i ∈ Z > 0 , a site x ∈ Z < 0 x\in\mathbb Z_{<0} x ∈ Z < 0 , and t ≥ 0 t\geq0 t ≥ 0 , define the height function
h ≥ i ( t , x ) : = # { y ∈ Z ∗ : y ≤ x , η t ( y ) ≥ i } . h^{\geq i}(t,x)
:=\#\{y\in\mathbb Z^\ast : y\leq x,\ \eta_t(y)\geq i\}. h ≥ i ( t , x ) := # { y ∈ Z ∗ : y ≤ x , η t ( y ) ≥ i } .
Thus, h ≥ i ( t , x ) h^{\geq i}(t,x) h ≥ i ( t , x ) counts the particles with color at least i i i located at or to the left of x x x at time t t t . This count is finite at every finite time.
Theorem 6.2 ([82 ] , Theorem 1.6). Fix t ≥ 0 t\geq 0 t ≥ 0 . Let i 1 , … , i K 1 , i 1 ′ , … , i K 2 ′ ∈ Z > 0 , x 1 , … , x K 1 , x 1 ′ , … , x K 2 ′ ∈ Z < 0 , i_1,\ldots,i_{K_1},\ i'_1,\ldots,i'_{K_2}\in\mathbb Z_{>0},
\qquad
x_1,\ldots,x_{K_1},\ x'_1,\ldots,x'_{K_2}\in\mathbb Z_{<0}, i 1 , … , i K 1 , i 1 ′ , … , i K 2 ′ ∈ Z > 0 , x 1 , … , x K 1 , x 1 ′ , … , x K 2 ′ ∈ Z < 0 , and suppose that 1 ≤ i k ≤ i l ′ 1\leq i_k\leq i'_l 1 ≤ i k ≤ i l ′ and − 1 ≥ x k > x l ′ -1\geq x_k>x'_l − 1 ≥ x k > x l ′ for every k , l k,l k , l . Then ( ( h ≥ i k ( t , x k ) ) k = 1 K 1 , ( h ≥ i l ′ ( t , x l ′ ) ) l = 1 K 2 ) = d ( ( h ≥ i k ( t , x k ) ) k = 1 K 1 , ( h ≥ i l ′ + 1 ( t , x l ′ + 1 ) ) l = 1 K 2 ) . \left(\bigl(h^{\geq i_k}(t,x_k)\bigr)_{k=1}^{K_1},
\bigl(h^{\geq i'_l}(t,x'_l)\bigr)_{l=1}^{K_2}\right)
\overset{d}=
\left(\bigl(h^{\geq i_k}(t,x_k)\bigr)_{k=1}^{K_1},
\bigl(h^{\geq i'_l+1}(t,x'_l+1)\bigr)_{l=1}^{K_2}\right). ( ( h ≥ i k ( t , x k ) ) k = 1 K 1 , ( h ≥ i l ′ ( t , x l ′ ) ) l = 1 K 2 ) = d ( ( h ≥ i k ( t , x k ) ) k = 1 K 1 , ( h ≥ i l ′ + 1 ( t , x l ′ + 1 ) ) l = 1 K 2 ) .
For an integer m ≥ 0 m\geq 0 m ≥ 0 , define the color projection on Z > 0 \mathbb Z_{>0} Z > 0 by
ζ t [ m ] ( x ) : = 1 { η t ( x ) ≤ m } , x ≥ 1. \begin{equation}
\zeta_t^{[m]}(x):=\mathbf 1_{\{\eta_t(x)\leq m\}},\qquad x\geq 1. \tag*{(6.1)}
\end{equation} ζ t [ m ] ( x ) := 1 { η t ( x ) ≤ m } , x ≥ 1. (6.1)
Lemma 6.3. For every t ≥ 0 t\geq 0 t ≥ 0 and m ≥ 0 m\geq 0 m ≥ 0 , P ( X 1 ( t ) ≤ m ) = P ( ζ t [ m ] ( 1 ) = 1 ) .
\mathbb P\bigl(X_1(t)\leq m\bigr)
=\mathbb P\bigl(\zeta_t^{[m]}(1)=1\bigr).
P ( X 1 ( t ) ≤ m ) = P ( ζ t [ m ] ( 1 ) = 1 ) .
Proof. Proposition 6.1 and (6.1) give
P ( X 1 ( t ) ≤ m ) = P ( η t ( 1 ) ≤ m ) = P ( ζ t [ m ] ( 1 ) = 1 ) , \mathbb P(X_1(t)\leq m)=\mathbb P(\eta_t(1)\leq m)
=\mathbb P(\zeta_t^{[m]}(1)=1), P ( X 1 ( t ) ≤ m ) = P ( η t ( 1 ) ≤ m ) = P ( ζ t [ m ] ( 1 ) = 1 ) , which proves (6.2) . ◻
We first record a consequence of Bahadoran’s hydrodynamic theorem for half-line TASEP with a step initial condition.
Theorem 6.4 (Hydrodynamic limit). Let m N m_N m N be nonnegative integers such that m N / N → u ∈ [ 0 , 1 ] m_N/N\to u\in[0,1] m N / N → u ∈ [ 0 , 1 ] . For x > 0 x>0 x > 0 , define the density profile as follows. If u ≥ 1 − 2 α u\geq1-2\alpha u ≥ 1 − 2 α , set ρ α , u ( x ) = { 1 + u − x 2 , 0 < x ≤ u + 1 , 0 , x > u + 1.
\rho^{\alpha,u}(x)=
\begin{cases}
\dfrac{1+u-x}{2},&0<x\leq u+1,\\[2mm]
0,&x>u+1.
\end{cases}
ρ α , u ( x ) = ⎩ ⎨ ⎧ 2 1 + u − x , 0 , 0 < x ≤ u + 1 , x > u + 1. If u < 1 − 2 α u<1-2\alpha u < 1 − 2 α , set ρ α , u ( x ) = { α , 0 < x < ( 1 − 2 α − u ) 2 , 1 + u − x 2 , ( 1 − 2 α − u ) 2 ≤ x ≤ u + 1 , 0 , x > u + 1.
\rho^{\alpha,u}(x)=
\begin{cases}
\alpha,
&0<x<\bigl(\sqrt{1-2\alpha}-\sqrt u\bigr)^2,\\[2mm]
\dfrac{1+u-x}{2},
&\bigl(\sqrt{1-2\alpha}-\sqrt u\bigr)^2\leq x\leq u+1,\\[2mm]
0,&x>u+1.
\end{cases}
ρ α , u ( x ) = ⎩ ⎨ ⎧ α , 2 1 + u − x , 0 , 0 < x < ( 1 − 2 α − u ) 2 , ( 1 − 2 α − u ) 2 ≤ x ≤ u + 1 , x > u + 1. Then, for every φ ∈ C c ( ( 0 , ∞ ) ) \varphi\in C_c((0,\infty)) φ ∈ C c (( 0 , ∞ )) , 1 N ∑ j ≥ 1 φ ( j N ) ζ N [ m N ] ( j ) → P ∫ 0 ∞ φ ( x ) ρ α , u ( x ) d x .
\frac1N\sum_{j\geq1}\varphi\left(\frac jN\right)\zeta_N^{[m_N]}(j)
\xrightarrow{\mathbb P}
\int_0^\infty\varphi(x)\rho^{\alpha,u}(x)\,dx.
N 1 ∑ j ≥ 1 φ ( N j ) ζ N [ m N ] ( j ) P ∫ 0 ∞ φ ( x ) ρ α , u ( x ) d x .
Proof. We apply [55 Theorem 2.2] to the totally asymmetric simple exclusion process on Ω = ( 0 , ∞ ) \Omega=(0,\infty) Ω = ( 0 , ∞ ) , which is included in the framework of [55 Section 2] . The Bernoulli product measures of density r r r for the full-line process give the flux J ( r ) = r ( 1 − r ) J(r)=r(1-r) J ( r ) = r ( 1 − r ) . To verify the boundary and initial assumptions, take the constant reservoir density λ N ≡ α \lambda_N\equiv\alpha λ N ≡ α on Z ≤ 0 \mathbb Z_{\leq0} Z ≤ 0 and the initial density ρ N ( j ) = 1 { 1 ≤ j ≤ m N } \rho^N(j)=\mathbf1_{\{1\leq j\leq m_N\}} ρ N ( j ) = 1 { 1 ≤ j ≤ m N } . This boundary choice gives exactly our entrance dynamics and satisfies [55 (12)] , while m N / N → u m_N/N\to u m N / N → u verifies [55 (13)–(14)] . Thus the hydrodynamic limit is the unique entropy solution of
∂ t ρ + ∂ x J ( ρ ) = 0 , x > 0 , \partial_t\rho+\partial_xJ(\rho)=0,\qquad x>0, ∂ t ρ + ∂ x J ( ρ ) = 0 , x > 0 , with initial condition 1 ( 0 , u ) \mathbf1_{(0,u)} 1 ( 0 , u ) and boundary condition α \alpha α . The profile of the entropy solution at time t = 1 t=1 t = 1 is precisely ρ α , u \rho^{\alpha,u} ρ α , u , which proves (6.5) . ◻
Corollary 6.5. Let N t i n , [ m ] N_t^{\mathrm{in},[m]} N t in , [ m ] denote the number of successful injections into ζ [ m ] \zeta^{[m]} ζ [ m ] by time t t t .
Let m T m_T m T be nonnegative integers such that m T / T → u ∈ [ 0 , 1 ] m_T/T\to u\in[0,1] m T / T → u ∈ [ 0 , 1 ] . Then N T i n , [ m T ] T → P { α ( 1 − α − u ) , u < 1 − 2 α , ( 1 − u ) 2 4 , otherwise .
\frac{N_T^{\mathrm{in},[m_T]}}T
\xrightarrow{\mathbb P}
\begin{cases}
\alpha(1-\alpha-u),&u<1-2\alpha,\\[1mm]
\dfrac{(1-u)^2}{4},&\text{otherwise}.
\end{cases}
T N T in , [ m T ] P ⎩ ⎨ ⎧ α ( 1 − α − u ) , 4 ( 1 − u ) 2 , u < 1 − 2 α , otherwise .
For every x > 0 x>0 x > 0 , lim T → ∞ E ζ T [ 0 ] ( ⌈ x T ⌉ ) = ρ α , 0 ( x ) .
\lim_{T\to\infty}\mathbb E\zeta_T^{[0]}(\lceil xT\rceil)
=\rho^{\alpha,0}(x).
lim T → ∞ E ζ T [ 0 ] (⌈ x T ⌉) = ρ α , 0 ( x ) .
Proof. It suffices to prove the assertions for T = N ∈ N T=N\in\mathbb N T = N ∈ N .
For (i), we first extend Theorem 6.4 to the total mass. Since occupations are bounded by one,
1 N ∑ 1 ≤ j ≤ ε N ζ N [ m N ] ( j ) ≤ ε . \frac1N\sum_{1\leq j\leq\varepsilon N}
\zeta_N^{[m_N]}(j)\leq\varepsilon. N 1 1 ≤ j ≤ εN ∑ ζ N [ m N ] ( j ) ≤ ε . Moreover, the rightmost occupied site at time N N N is stochastically bounded by m N + 1 + Pois ( N ) m_N+1+\operatorname{Pois}(N) m N + 1 + Pois ( N ) . Thus, for every R > u + 1 R>u+1 R > u + 1 ,
P ( ζ N [ m N ] ( j ) = 1 for some j > R N ) ⟶ 0. \mathbb P\bigl(\zeta_N^{[m_N]}(j)=1
\text{ for some }j>RN\bigr)\longrightarrow0. P ( ζ N [ m N ] ( j ) = 1 for some j > R N ) ⟶ 0. Applying the hydrodynamic limit to continuous, compactly supported cutoffs equal to one on [ ε , R ] [\varepsilon,R] [ ε , R ] , and then letting ε ↓ 0 \varepsilon\downarrow0 ε ↓ 0 , gives
1 N ∑ j ≥ 1 ζ N [ m N ] ( j ) → P ∫ 0 ∞ ρ α , u ( x ) d x . \frac1N\sum_{j\geq1}\zeta_N^{[m_N]}(j)
\xrightarrow{\mathbb P}
\int_0^\infty\rho^{\alpha,u}(x)\,dx. N 1 j ≥ 1 ∑ ζ N [ m N ] ( j ) P ∫ 0 ∞ ρ α , u ( x ) d x . Using the fact that ρ α , u \rho^{\alpha,u} ρ α , u has compact support and
N N i n , [ m N ] = ∑ j ≥ 1 ζ N [ m N ] ( j ) − m N , N_N^{\mathrm{in},[m_N]}
=\sum_{j\geq1}\zeta_N^{[m_N]}(j)-m_N, N N in , [ m N ] = j ≥ 1 ∑ ζ N [ m N ] ( j ) − m N , and subtracting m N / N m_N/N m N / N and integrating the profiles in (6.3) and (6.4) proves (i).
For (ii), (6.21) , derived below in the proof of Theorem 6.9 , shows that n ↦ E ζ t [ 0 ] ( n ) n\mapsto\mathbb E\zeta_t^{[0]}(n) n ↦ E ζ t [ 0 ] ( n ) is nonincreasing. Let n N n_N n N be positive integers such that n N / N → x > 0 n_N/N\to x>0 n N / N → x > 0 . For 0 < ε < x 0<\varepsilon<x 0 < ε < x , this monotonicity bounds E ζ N [ 0 ] ( n N ) \mathbb E\zeta_N^{[0]}(n_N) E ζ N [ 0 ] ( n N ) between the mean occupation probabilities on the blocks of ⌊ ε N ⌋ \lfloor\varepsilon N\rfloor ⌊ εN ⌋ sites immediately to its right and left. The hydrodynamic limit and boundedness therefore give
1 ε ∫ x x + ε ρ α , 0 ( y ) d y ≤ lim inf N → ∞ E ζ N [ 0 ] ( n N ) ≤ lim sup N → ∞ E ζ N [ 0 ] ( n N ) ≤ 1 ε ∫ x − ε x ρ α , 0 ( y ) d y . \frac1\varepsilon
\int_x^{x+\varepsilon}\rho^{\alpha,0}(y)\,dy
\leq\liminf_{N\to\infty}\mathbb E\zeta_N^{[0]}(n_N)
\leq\limsup_{N\to\infty}\mathbb E\zeta_N^{[0]}(n_N)
\leq\frac1\varepsilon
\int_{x-\varepsilon}^{x}\rho^{\alpha,0}(y)\,dy. ε 1 ∫ x x + ε ρ α , 0 ( y ) d y ≤ N → ∞ lim inf E ζ N [ 0 ] ( n N ) ≤ N → ∞ lim sup E ζ N [ 0 ] ( n N ) ≤ ε 1 ∫ x − ε x ρ α , 0 ( y ) d y . Since ρ α , 0 \rho^{\alpha,0} ρ α , 0 is continuous on ( 0 , ∞ ) (0,\infty) ( 0 , ∞ ) , letting ε ↓ 0 \varepsilon\downarrow0 ε ↓ 0 and taking n N = ⌈ x N ⌉ n_N=\lceil xN\rceil n N = ⌈ x N ⌉ proves (ii). ◻
Boundary local equilibrium for step initial contion
Throughout this subsection, we consider only the particle-hole TASEP on Z > 0 \mathbb Z_{>0} Z > 0 . Let S t α S_t^\alpha S t α denote its Markov semigroup, acting on bounded measurable functions by
( S t α f ) ( ξ ) = E [ f ( ζ t ξ ) ] , (S_t^\alpha f)(\xi)=\mathbb E[f(\zeta_t^\xi)], ( S t α f ) ( ξ ) = E [ f ( ζ t ξ )] ,
where ζ t ξ \zeta_t^\xi ζ t ξ is the process started from ξ ∈ { 0 , 1 } Z > 0 \xi\in\{0,1\}^{\mathbb Z_{>0}} ξ ∈ { 0 , 1 } Z > 0 . For a probability measure ν \nu ν and a bounded measurable function f f f , write ν ( f ) = ∫ f d ν \nu(f)=\int f\,d\nu ν ( f ) = ∫ f d ν . Define ν S t α \nu S_t^\alpha ν S t α to be the probability measure satisfying
( ν S t α ) ( f ) = ∫ ( S t α f ) ( ξ ) ν ( d ξ ) . (\nu S_t^\alpha)(f)=\int (S_t^\alpha f)(\xi)\,\nu(d\xi). ( ν S t α ) ( f ) = ∫ ( S t α f ) ( ξ ) ν ( d ξ ) .
Thus ν S t α \nu S_t^\alpha ν S t α is the law at time t t t with initial distribution ν \nu ν . For deterministic ξ \xi ξ , we write ξ S t α = δ ξ S t α \xi S_t^\alpha=\delta_\xi S_t^\alpha ξ S t α = δ ξ S t α .
For any probability measure ν \nu ν , let ν ∣ [ 1 , k ] \nu|_{[1,k]} ν ∣ [ 1 , k ] denote its marginal on the first k k k sites. We recall the notation μ α , ρ \mu^{\alpha,\rho} μ α , ρ for the high density half-space stationary measures from the preceding section. π ρ \pi^\rho π ρ is the bernoulli product measure in half-space. Liggett proved in [83 Theorem 1.8] the following local convergence of measures:
lim t → ∞ π ρ S t α ⟹ μ α , ρ . \begin{equation}
\lim_{t\to\infty} \pi^\rho S_t^\alpha\Longrightarrow\mu^{\alpha,\rho}. \tag*{(6.8)}
\end{equation} t → ∞ lim π ρ S t α ⟹ μ α , ρ . (6.8)
Proposition 6.6. Let n T n_T n T be nonnegative integers with n T / T → v n_T/T\to v n T / T → v and set ρ = ( 1 + v ) / 2 \rho=(1+v)/2 ρ = ( 1 + v ) /2 . Assume 0 < α ≤ 1 0<\alpha\leq1 0 < α ≤ 1 and max { 0 , 1 − 2 α } < v < 1 \max\{0,1-2\alpha\}<v<1 max { 0 , 1 − 2 α } < v < 1 . Then, for every fixed k ≥ 1 k\geq 1 k ≥ 1 , ( ζ 0 [ n T ] S T α ) ∣ [ 1 , k ] ⟹ μ α , ρ ∣ [ 1 , k ] . \bigl(\zeta_0^{[n_T]}S_T^\alpha\bigr)|_{[1,k]}
\Longrightarrow
\mu^{\alpha,\rho}|_{[1,k]}. ( ζ 0 [ n T ] S T α ) ∣ [ 1 , k ] ⟹ μ α , ρ ∣ [ 1 , k ] .
We prove the proposition after two lemmas. The first identifies the only step-height shape needed in the argument, and the second localizes a backward path for a Bernoulli initial configuration.
For a one-color configuration ξ \xi ξ , anchor its height by
h ξ ( 0 ) = 0 , h ξ ( x ) − h ξ ( x − 1 ) = 1 − 2 ξ ( x ) . h_\xi(0)=0,
\qquad h_\xi(x)-h_\xi(x-1)=1-2\xi(x). h ξ ( 0 ) = 0 , h ξ ( x ) − h ξ ( x − 1 ) = 1 − 2 ξ ( x ) .
Write N t i n N_t^{\mathrm{in}} N t in for the number of successful injections in the process ζ t ξ \zeta_t^\xi ζ t ξ . For any initial vertical shift C C C , define its evolving height by
h ( x , t ) : = C + 2 N t i n + x − 2 ∑ j = 1 x ζ t ξ ( j ) , x ∈ Z ≥ 0 . h(x,t):=C+2N_t^{\mathrm{in}}+x-2\sum_{j=1}^x\zeta_t^\xi(j),
\qquad x\in\mathbb Z_{\geq0}. h ( x , t ) := C + 2 N t in + x − 2 j = 1 ∑ x ζ t ξ ( j ) , x ∈ Z ≥ 0 .
Thus h ( x , 0 ) = h ξ ( x ) + C h(x,0)=h_\xi(x)+C h ( x , 0 ) = h ξ ( x ) + C and h ( 0 , t ) = C + 2 N t i n h(0,t)=C+2N_t^{\mathrm{in}} h ( 0 , t ) = C + 2 N t in ; additive constants are preserved by the evolution. At a restart time s s s , we use the actual profile h ( ⋅ , s ) h(\cdot,s) h ( ⋅ , s ) , without resetting its boundary height. All height processes below are under basic coupling, driven by the same boundary and bulk clocks.
For 0 ≤ s ≤ t 0\leq s\leq t 0 ≤ s ≤ t and y ∈ Z ≥ 0 y\in\mathbb Z_{\geq0} y ∈ Z ≥ 0 , let h y , s s t e p ( ⋅ , r ) h^{\mathrm{step}}_{y,s}(\,\cdot\,,r) h y , s step ( ⋅ , r ) , r ≥ s r\geq s r ≥ s , be the half-line TASEP height function with boundary rate α \alpha α , started at time s s s from the step profile centered at y y y :
h y , s s t e p ( z , s ) = ∣ z − y ∣ , z ∈ Z ≥ 0 . h^{\mathrm{step}}_{y,s}(z,s)=|z-y|,
\qquad z\in\mathbb Z_{\geq0}. h y , s step ( z , s ) = ∣ z − y ∣ , z ∈ Z ≥ 0 .
This is the packed configuration on [ 1 , y ] [1,y] [ 1 , y ] , with initial boundary height y y y rather than zero. The dependence on α \alpha α is suppressed from the notation. Under the basic coupling, the variational formula gives, for every half-line TASEP height function h h h , every 0 ≤ s ≤ t 0\leq s\leq t 0 ≤ s ≤ t , and every x ≥ 0 x\geq0 x ≥ 0 ,
h ( x , t ) = min y ≥ 0 { h ( y , s ) + h y , s s t e p ( x , t ) } . \begin{equation}
h(x,t)=\min_{y\geq0}
\{h(y,s)+h^{\mathrm{step}}_{y,s}(x,t)\}. \tag*{(6.9)}
\end{equation} h ( x , t ) = y ≥ 0 min { h ( y , s ) + h y , s step ( x , t )} . (6.9)
This is the standard step-height form of the variational coupling. Under the present height normalization, it is equivalent to the half-space Poisson-avoiding-metric formulation in [72 (4)–(5)] : the variational kernel between ( y , s ) (y,s) ( y , s ) and ( x , t ) (x,t) ( x , t ) there is h y , s s t e p ( x , t ) h^{\mathrm{step}}_{y,s}(x,t) h y , s step ( x , t ) .
We also recall the corresponding backward-path interpretation. Starting from ( x , t ) (x,t) ( x , t ) , trace the clock rings backward. When the path is at z z z and encounters a ring of the clock associated with the height at z z z , it stays at z z z if the height was raised at that ring; otherwise it moves to a neighboring site w ∈ Z ≥ 0 w\in\mathbb Z_{\geq0} w ∈ Z ≥ 0 with
h ( w , r ) = h ( z , r ) − 1. h(w,r)=h(z,r)-1. h ( w , r ) = h ( z , r ) − 1.
At the boundary this neighbor is w = 1 w=1 w = 1 . Whenever two neighbors are admissible, choose the larger one. Between clock rings the path stays put. This rule defines the canonical rightmost backward path. For the height process started from h ξ h_\xi h ξ , denote it by B ξ ; x , t B^{\xi;x,t} B ξ ; x , t . Then
h ( x , t ) = h ( B ξ ; x , t ( r ) , r ) + h B ξ ; x , t ( r ) , r s t e p ( x , t ) , 0 ≤ r ≤ t . \begin{equation}
h(x,t)=h(B^{\xi;x,t}(r),r)
+h^{\mathrm{step}}_{B^{\xi;x,t}(r),r}(x,t),
\qquad 0\leq r\leq t. \tag*{(6.10)}
\end{equation} h ( x , t ) = h ( B ξ ; x , t ( r ) , r ) + h B ξ ; x , t ( r ) , r step ( x , t ) , 0 ≤ r ≤ t . (6.10)
In particular, for each s ∈ [ 0 , t ] s\in[0,t] s ∈ [ 0 , t ] , the point B ξ ; x , t ( s ) B^{\xi;x,t}(s) B ξ ; x , t ( s ) is a minimizer in (6.9) with starting time s s s ; its time-zero endpoint is the corresponding minimizer when s = 0 s=0 s = 0 . This is the classic backward-path form of the variational coupling; under the present height normalization it is equivalent to the formulation of [72 ] recalled above.
We shall use the elementary bounds
h y , s s t e p ( x , t ) ≥ ∣ y − x ∣ , ∣ h y , s s t e p ( x , t ) − h z , s s t e p ( x , t ) ∣ ≤ ∣ y − z ∣ , ∣ h y , s s t e p ( x , t ) − h y , s s t e p ( z , t ) ∣ ≤ ∣ x − z ∣ . \begin{align}
h^{\mathrm{step}}_{y,s}(x,t)&\geq |y-x|, \tag*{(6.11)}
\\
|h^{\mathrm{step}}_{y,s}(x,t)-h^{\mathrm{step}}_{z,s}(x,t)|&\leq |y-z|, \tag*{(6.12)}
\\
|h^{\mathrm{step}}_{y,s}(x,t)-h^{\mathrm{step}}_{y,s}(z,t)|&\leq |x-z|. \tag*{(6.13)}
\end{align} h y , s step ( x , t ) ∣ h y , s step ( x , t ) − h z , s step ( x , t ) ∣ ∣ h y , s step ( x , t ) − h y , s step ( z , t ) ∣ ≥ ∣ y − x ∣ , ≤ ∣ y − z ∣ , ≤ ∣ x − z ∣. (6.11) (6.12) (6.13)
The first follows because a height evolves only by raising local minima. For the second, the two initial wedges differ uniformly by at most ∣ y − z ∣ |y-z| ∣ y − z ∣ , and the coupled height evolution is order preserving and commutes with addition of constants. The last bound follows because every height profile has slopes in { − 1 , 1 } \{-1,1\} { − 1 , 1 } .
For 0 < α ≤ 1 0<\alpha\leq1 0 < α ≤ 1 and u ∈ [ 0 , 1 ] u\in[0,1] u ∈ [ 0 , 1 ] , define
γ α ( u ) = 1 + u 2 − ( 1 − 2 α − u ) + 2 2 . \begin{equation}
\gamma_\alpha(u)
=\frac{1+u^2-(1-2\alpha-u)_+^2}{2}. \tag*{(6.14)}
\end{equation} γ α ( u ) = 2 1 + u 2 − ( 1 − 2 α − u ) + 2 . (6.14)
Lemma 6.7. Let m T m_T m T be nonnegative integers such that m T / T → u ∈ [ 0 , 1 ] m_T/T\to u\in[0,1] m T / T → u ∈ [ 0 , 1 ] . Then, for every fixed integer k ≥ 0 k\geq0 k ≥ 0 , max 0 ≤ x ≤ k ∣ 1 T h m T , 0 s t e p ( x , T ) − γ α ( u ) ∣ → P 0.
\max_{0\leq x\leq k}
\left|\frac1T h^{\mathrm{step}}_{m_T,0}(x,T)-\gamma_\alpha(u)\right|
\xrightarrow{\mathbb P}0.
max 0 ≤ x ≤ k T 1 h m T , 0 step ( x , T ) − γ α ( u ) P 0.
Proof. The step profile centered at n n n is the packed configuration on [ 1 , n ] [1,n] [ 1 , n ] , with boundary height h n , 0 s t e p ( 0 , 0 ) = n h^{\mathrm{step}}_{n,0}(0,0)=n h n , 0 step ( 0 , 0 ) = n . Consequently,
h n , 0 s t e p ( 0 , T ) = n + 2 N T i n , [ n ] . \begin{equation}
h^{\mathrm{step}}_{n,0}(0,T)=n+2N_T^{\mathrm{in},[n]}. \tag*{(6.16)}
\end{equation} h n , 0 step ( 0 , T ) = n + 2 N T in , [ n ] . (6.16) Corollary 6.5 (i) and the definition of γ α \gamma_\alpha γ α therefore give
1 T h m T , 0 s t e p ( 0 , T ) → P γ α ( u ) . \frac1T h^{\mathrm{step}}_{m_T,0}(0,T)
\xrightarrow{\mathbb P}\gamma_\alpha(u). T 1 h m T , 0 step ( 0 , T ) P γ α ( u ) . The bound (6.13) makes the difference between the values at 0 0 0 and at any x ∈ { 0 , … , k } x\in\{0,\ldots,k\} x ∈ { 0 , … , k } at most k k k , which proves (6.15) . ◻
We denote B ξ ρ ; x , T B^{\xi^\rho;x,T} B ξ ρ ; x , T by B ρ ; x , T B^{\rho;x,T} B ρ ; x , T in short.
Lemma 6.8. Assume 0 < α ≤ 1 0<\alpha\leq1 0 < α ≤ 1 and max { 1 2 , 1 − α } < ρ < 1 \max\{\frac12,1-\alpha\}<\rho<1 max { 2 1 , 1 − α } < ρ < 1 . Then, for every fixed x ∈ Z ≥ 0 x\in\mathbb Z_{\geq0} x ∈ Z ≥ 0 , B ρ ; x , T ( 0 ) T → P 2 ρ − 1.
\frac{B^{\rho;x,T}(0)}T
\xrightarrow{\mathbb P}2\rho-1.
T B ρ ; x , T ( 0 ) P 2 ρ − 1.
Proof. Fix x ∈ Z ≥ 0 x\in\mathbb Z_{\geq0} x ∈ Z ≥ 0 and write
F T ( y ) : = h ξ ρ ( y ) + h y , 0 s t e p ( x , T ) , Φ ( u ) : = γ α ( u ) − ( 2 ρ − 1 ) u . F_T(y):=h_{\xi^\rho}(y)+h^{\mathrm{step}}_{y,0}(x,T),
\qquad
\Phi(u):=\gamma_\alpha(u)-(2\rho-1)u. F T ( y ) := h ξ ρ ( y ) + h y , 0 step ( x , T ) , Φ ( u ) := γ α ( u ) − ( 2 ρ − 1 ) u . By the strong law of large numbers,
h ξ ρ ( y ) y ⟶ 1 − 2 ρ almost surely as y → ∞ . \frac{h_{\xi^\rho}(y)}y\longrightarrow 1-2\rho
\qquad\text{almost surely as }y\to\infty. y h ξ ρ ( y ) ⟶ 1 − 2 ρ almost surely as y → ∞. Together with Lemma 6.7 , this gives, for each u ∈ [ 0 , 1 ] u\in[0,1] u ∈ [ 0 , 1 ] ,
F T ( ⌊ u T ⌋ ) T → P Φ ( u ) . \frac{F_T(\lfloor uT\rfloor)}T
\xrightarrow{\mathbb P}\Phi(u). T F T (⌊ u T ⌋) P Φ ( u ) . We claim that this convergence is uniform on [ 0 , 1 ] [0,1] [ 0 , 1 ] . Indeed, F T F_T F T and Φ \Phi Φ are both Lipschitz functions. For any finite δ \delta δ -net { u 0 , … , u M } \{u_0,\ldots,u_M\} { u 0 , … , u M } of [ 0 , 1 ] [0,1] [ 0 , 1 ] ,
sup 0 ≤ y ≤ T ∣ F T ( y ) T − Φ ( y T ) ∣ ≤ max 0 ≤ j ≤ M ∣ F T ( ⌊ u j T ⌋ ) T − Φ ( u j ) ∣ + 4 δ + 2 T , \sup_{0\leq y\leq T}
\left|\frac{F_T(y)}T-\Phi\left(\frac yT\right)\right|
\leq
\max_{0\leq j\leq M}
\left|\frac{F_T(\lfloor u_jT\rfloor)}T-\Phi(u_j)\right|
+4\delta+\frac2T, 0 ≤ y ≤ T sup T F T ( y ) − Φ ( T y ) ≤ 0 ≤ j ≤ M max T F T (⌊ u j T ⌋) − Φ ( u j ) + 4 δ + T 2 , where the supremum is over integer y y y . The maximum tends to zero in probability for fixed δ \delta δ . Letting δ ↓ 0 \delta\downarrow0 δ ↓ 0 proves
To exclude minimizers beyond T T T , we apply the preceding almost sure limit and (6.11) to derive
lim inf T → ∞ inf y ≥ T F T ( y ) T ≥ 2 ( 1 − ρ ) almost surely . \liminf_{T\to\infty}\inf_{y\geq T}
\frac{F_T(y)}T\geq 2(1-\rho)
\qquad\text{almost surely}. T → ∞ lim inf y ≥ T inf T F T ( y ) ≥ 2 ( 1 − ρ ) almost surely . On the other hand,
F T ( ⌊ ( 2 ρ − 1 ) T ⌋ ) T → P 2 ρ ( 1 − ρ ) < 2 ( 1 − ρ ) . \frac{F_T(\lfloor(2\rho-1)T\rfloor)}T
\xrightarrow{\mathbb P}2\rho(1-\rho)
<2(1-\rho). T F T (⌊( 2 ρ − 1 ) T ⌋) P 2 ρ ( 1 − ρ ) < 2 ( 1 − ρ ) . Hence every minimizer lies in [ 0 , T ] [0,T] [ 0 , T ] with probability tending to one.
Finally, Φ \Phi Φ has a unique minimizer at 2 ρ − 1 2\rho-1 2 ρ − 1 , as follows from the definition of γ α \gamma_\alpha γ α . By (6.10) , B ρ ; x , T ( 0 ) B^{\rho;x,T}(0) B ρ ; x , T ( 0 ) minimizes F T F_T F T . The uniform convergence therefore imply (6.17) . ◻
Proof of Proposition 6.6 . Choose ε > 0 \varepsilon>0 ε > 0 so that ρ − : = ρ − ε \rho_-:=\rho-\varepsilon ρ − := ρ − ε and ρ + : = ρ + ε \rho_+:=\rho+\varepsilon ρ + := ρ + ε both lie in ( 1 2 , 1 ) (\frac12,1) ( 2 1 , 1 ) if 1 2 ≤ α ≤ 1 \frac12\leq\alpha\leq1 2 1 ≤ α ≤ 1 , and in ( 1 − α , 1 ) (1-\alpha,1) ( 1 − α , 1 ) if 0 < α < 1 2 0<\alpha<\frac12 0 < α < 2 1 . Then 2 ρ − − 1 < v < 2 ρ + − 1 2\rho_--1<v<2\rho_+-1 2 ρ − − 1 < v < 2 ρ + − 1 .
Truncation. For a configuration ξ \xi ξ , define ( T n ξ ) ( j ) = ξ ( j ) 1 { j ≤ n } (\mathcal T_n\xi)(j)=\xi(j)\mathbf 1_{\{j\leq n\}} ( T n ξ ) ( j ) = ξ ( j ) 1 { j ≤ n } , so that
h T n ξ ( y ) − h ξ ( y ) = { 0 , y ≤ n , 2 ∑ j = n + 1 y ξ ( j ) , y > n , h_{\mathcal T_n\xi}(y)-h_\xi(y)=
\begin{cases}0,&y\leq n,\\2\sum_{j=n+1}^y\xi(j),&y>n,\end{cases} h T n ξ ( y ) − h ξ ( y ) = { 0 , 2 ∑ j = n + 1 y ξ ( j ) , y ≤ n , y > n , and the added term is nonnegative. Suppose that B ξ ; x , T ( 0 ) ≤ n B^{\xi;x,T}(0)\leq n B ξ ; x , T ( 0 ) ≤ n . By (6.10) , this endpoint attains the minimum in (6.9) with s = 0 s=0 s = 0 ; since the truncation term vanishes there and is nonnegative everywhere, truncation does not change the height at ( x , T ) (x,T) ( x , T ) . Consequently, if this holds for every x = 0 , … , k x=0,\ldots,k x = 0 , … , k , then
ζ T T n ξ ∣ [ 1 , k ] = ζ T ξ ∣ [ 1 , k ] , \zeta_T^{\mathcal T_n\xi}|_{[1,k]}
=\zeta_T^\xi|_{[1,k]}, ζ T T n ξ ∣ [ 1 , k ] = ζ T ξ ∣ [ 1 , k ] , because the two height functions agree at x = 0 , … , k x=0,\ldots,k x = 0 , … , k .
Let
G T − : = ⋂ x = 0 k { B ρ − ; x , T ( 0 ) ≤ n T } . G_T^-:=\bigcap_{x=0}^k
\{B^{\rho_-;x,T}(0)\leq n_T\}. G T − := x = 0 ⋂ k { B ρ − ; x , T ( 0 ) ≤ n T } . Put a − : = 2 ρ − − 1 a_-:=2\rho_--1 a − := 2 ρ − − 1 and η − : = ( v − a − ) / 3 > 0 \eta_-:=(v-a_-)/3>0 η − := ( v − a − ) /3 > 0 . Since n T / T → v n_T/T\to v n T / T → v , for all sufficiently large T T T a union bound and Lemma 6.8 give
P ( ( G T − ) c ) ≤ ∑ x = 0 k P ( B ρ − ; x , T ( 0 ) > n T ) ≤ ∑ x = 0 k P ( B ρ − ; x , T ( 0 ) T > a − + η − ) ⟶ 0. \mathbb P((G_T^-)^c)
\leq\sum_{x=0}^k
\mathbb P\bigl(B^{\rho_-;x,T}(0)>n_T\bigr)
\leq\sum_{x=0}^k
\mathbb P\left(
\frac{B^{\rho_-;x,T}(0)}T>a_-+\eta_-
\right)
\longrightarrow0. P (( G T − ) c ) ≤ x = 0 ∑ k P ( B ρ − ; x , T ( 0 ) > n T ) ≤ x = 0 ∑ k P ( T B ρ − ; x , T ( 0 ) > a − + η − ) ⟶ 0. Moreover, pathwise, T n T ξ ρ − ≤ ζ 0 [ n T ] \mathcal T_{n_T}\xi^{\rho_-}\leq\zeta_0^{[n_T]} T n T ξ ρ − ≤ ζ 0 [ n T ] .
Filling. Define
( F n ξ ) ( j ) = { 1 , j ≤ n , ξ ( j ) , j > n , Λ n ( ξ ) : = 2 ∑ j = 1 n ( 1 − ξ ( j ) ) . (\mathcal F_n\xi)(j)=
\begin{cases}1,&j\leq n,\\ \xi(j),&j>n,\end{cases}
\qquad
\Lambda_n(\xi):=2\sum_{j=1}^n(1-\xi(j)). ( F n ξ ) ( j ) = { 1 , ξ ( j ) , j ≤ n , j > n , Λ n ( ξ ) := 2 j = 1 ∑ n ( 1 − ξ ( j )) . Then
h F n ξ ( y ) + Λ n ( ξ ) − h ξ ( y ) = { 2 ∑ j = y + 1 n ( 1 − ξ ( j ) ) , y < n , 0 , y ≥ n . h_{\mathcal F_n\xi}(y)+\Lambda_n(\xi)-h_\xi(y)=
\begin{cases}2\sum_{j=y+1}^n(1-\xi(j)),&y<n,\\0,&y\geq n.\end{cases} h F n ξ ( y ) + Λ n ( ξ ) − h ξ ( y ) = { 2 ∑ j = y + 1 n ( 1 − ξ ( j )) , 0 , y < n , y ≥ n . Again the added term is nonnegative. Hence, if B ξ ; x , T ( 0 ) ≥ n B^{\xi;x,T}(0)\geq n B ξ ; x , T ( 0 ) ≥ n for every x = 0 , … , k x=0,\ldots,k x = 0 , … , k , then
ζ T F n ξ ∣ [ 1 , k ] = ζ T ξ ∣ [ 1 , k ] . \zeta_T^{\mathcal F_n\xi}|_{[1,k]}
=\zeta_T^\xi|_{[1,k]}. ζ T F n ξ ∣ [ 1 , k ] = ζ T ξ ∣ [ 1 , k ] . Indeed, apply the same variational argument to h F n ξ + Λ n ( ξ ) h_{\mathcal F_n\xi}+\Lambda_n(\xi) h F n ξ + Λ n ( ξ ) . Adding this constant commutes with the height evolution and disappears upon taking adjacent height differences.
Let
G T + : = ⋂ x = 0 k { B ρ + ; x , T ( 0 ) ≥ n T } . G_T^+:=\bigcap_{x=0}^k
\{B^{\rho_+;x,T}(0)\geq n_T\}. G T + := x = 0 ⋂ k { B ρ + ; x , T ( 0 ) ≥ n T } . Put a + : = 2 ρ + − 1 a_+:=2\rho_+-1 a + := 2 ρ + − 1 and η + : = ( a + − v ) / 3 > 0 \eta_+:=(a_+-v)/3>0 η + := ( a + − v ) /3 > 0 . Since n T / T → v n_T/T\to v n T / T → v , for all sufficiently large T T T a union bound and Lemma 6.8 give
P ( ( G T + ) c ) ≤ ∑ x = 0 k P ( B ρ + ; x , T ( 0 ) < n T ) ≤ ∑ x = 0 k P ( B ρ + ; x , T ( 0 ) T < a + − η + ) ⟶ 0. \mathbb P((G_T^+)^c)
\leq\sum_{x=0}^k
\mathbb P\bigl(B^{\rho_+;x,T}(0)<n_T\bigr)
\leq\sum_{x=0}^k
\mathbb P\left(
\frac{B^{\rho_+;x,T}(0)}T<a_+-\eta_+
\right)
\longrightarrow0. P (( G T + ) c ) ≤ x = 0 ∑ k P ( B ρ + ; x , T ( 0 ) < n T ) ≤ x = 0 ∑ k P ( T B ρ + ; x , T ( 0 ) < a + − η + ) ⟶ 0. Moreover, pathwise, ζ 0 [ n T ] ≤ F n T ξ ρ + \zeta_0^{[n_T]}\leq\mathcal F_{n_T}\xi^{\rho_+} ζ 0 [ n T ] ≤ F n T ξ ρ + .
The squeeze. Couple all evolutions using the clocks already fixed above. On G T − G_T^- G T − the truncated process agrees with ζ T ξ ρ − \zeta_T^{\xi^{\rho_-}} ζ T ξ ρ − on [ 1 , k ] [1,k] [ 1 , k ] , and on G T + G_T^+ G T + the filled process agrees with ζ T ξ ρ + \zeta_T^{\xi^{\rho_+}} ζ T ξ ρ + there. Attractiveness therefore gives, for every increasing 0 ≤ f ≤ 1 0\leq f\leq1 0 ≤ f ≤ 1 depending only on [ 1 , k ] [1,k] [ 1 , k ] ,
( π ρ − S T α ) ( f ) − o ( 1 ) ≤ E f ( ζ T [ n T ] ) ≤ ( π ρ + S T α ) ( f ) + o ( 1 ) . \begin{equation}
(\pi^{\rho_-}S_T^\alpha)(f)-o(1)
\leq\mathbb E f(\zeta_T^{[n_T]})
\leq(\pi^{\rho_+}S_T^\alpha)(f)+o(1). \tag*{(6.19)}
\end{equation} ( π ρ − S T α ) ( f ) − o ( 1 ) ≤ E f ( ζ T [ n T ] ) ≤ ( π ρ + S T α ) ( f ) + o ( 1 ) . (6.19) Here we used that ξ ρ ± \xi^{\rho_\pm} ξ ρ ± are independent of the clocks and have laws π ρ ± \pi^{\rho_\pm} π ρ ± ; the two error terms are bounded by P ( ( G T ± ) c ) \mathbb P((G_T^\pm)^c) P (( G T ± ) c ) .
Letting T → ∞ T\to\infty T → ∞ and using (6.8) yields
μ α , ρ − ( f ) ≤ lim inf T → ∞ E f ( ζ T [ n T ] ) ≤ lim sup T → ∞ E f ( ζ T [ n T ] ) ≤ μ α , ρ + ( f ) . \mu^{\alpha,\rho_-}(f)
\leq\liminf_{T\to\infty}\mathbb E f(\zeta_T^{[n_T]})
\leq\limsup_{T\to\infty}\mathbb E f(\zeta_T^{[n_T]})
\leq\mu^{\alpha,\rho_+}(f). μ α , ρ − ( f ) ≤ T → ∞ lim inf E f ( ζ T [ n T ] ) ≤ T → ∞ lim sup E f ( ζ T [ n T ] ) ≤ μ α , ρ + ( f ) . By the matrix-product formula in Proposition 2.1 , the finite-dimensional marginals of μ α , ρ \mu^{\alpha,\rho} μ α , ρ depend continuously on ρ \rho ρ , so letting ε ↓ 0 \varepsilon\downarrow0 ε ↓ 0 in this sandwich gives the claimed convergence. ◻
The signed speed of color 1
Theorem 6.9. As t → ∞ t\to\infty t → ∞ , X 1 ( t ) t ⟹ V α , \frac{X_1(t)}t\Longrightarrow V_\alpha, t X 1 ( t ) ⟹ V α , whose absolutely continuous part has density f α ( v ) = { 1 2 1 ( − 1 , 0 ) ( v ) + v 2 α 1 ( 0 , 1 ) ( v ) , 1 2 ≤ α ≤ 1 , 1 2 1 ( − 1 , 2 α − 1 ) ( v ) + v 2 α 1 ( 1 − 2 α , 1 ) ( v ) , 0 < α < 1 2 .
f_\alpha(v)=
\begin{cases}
\displaystyle
\frac12\mathbf 1_{(-1,0)}(v)
+\frac{v}{2\alpha}\mathbf 1_{(0,1)}(v),
&\frac12\leq\alpha\leq1,\\[3mm]
\displaystyle
\frac12\mathbf 1_{(-1,\,2\alpha-1)}(v)
+\frac{v}{2\alpha}\mathbf 1_{(1-2\alpha,\,1)}(v),
&0<\alpha<\frac12.
\end{cases}
f α ( v ) = ⎩ ⎨ ⎧ 2 1 1 ( − 1 , 0 ) ( v ) + 2 α v 1 ( 0 , 1 ) ( v ) , 2 1 1 ( − 1 , 2 α − 1 ) ( v ) + 2 α v 1 ( 1 − 2 α , 1 ) ( v ) , 2 1 ≤ α ≤ 1 , 0 < α < 2 1 . If α > 1 2 \alpha>\frac12 α > 2 1 , the limiting law also has an atom at zero of mass ( 2 α − 1 ) / ( 4 α ) (2\alpha-1)/(4\alpha) ( 2 α − 1 ) / ( 4 α ) ; this mass vanishes at α = 1 2 \alpha=\frac12 α = 2 1 . For 0 < α < 1 2 0<\alpha<\frac12 0 < α < 2 1 , the limiting law has no atoms.
Proof. We first consider negative speeds. For n ≥ 1 n\geq1 n ≥ 1 , signed symmetry and Proposition 6.1 give
P ( X 1 ( t ) ≤ − n ) = P ( η t ( − 1 ) ≥ n ) = E [ h ≥ n ( t , − 1 ) − h ≥ n ( t , − 2 ) ] . \mathbb P(X_1(t)\leq-n)
=\mathbb P(\eta_t(-1)\geq n)
=\mathbb E\bigl[
h^{\geq n}(t,-1)-h^{\geq n}(t,-2)
\bigr]. P ( X 1 ( t ) ≤ − n ) = P ( η t ( − 1 ) ≥ n ) = E [ h ≥ n ( t , − 1 ) − h ≥ n ( t , − 2 ) ] . By Theorem 6.2 , applied to ( n , − 1 ) (n,-1) ( n , − 1 ) and ( n , − 2 ) (n,-2) ( n , − 2 ) , this expectation equals
E [ h ≥ n ( t , − 1 ) − h ≥ n + 1 ( t , − 1 ) ] . \mathbb E\bigl[
h^{\geq n}(t,-1)-h^{\geq n+1}(t,-1)
\bigr]. E [ h ≥ n ( t , − 1 ) − h ≥ n + 1 ( t , − 1 ) ] . The difference inside the expectation is the indicator that color n n n lies on the negative half-line. Another application of Proposition 6.1 therefore yields
P ( X 1 ( t ) ≤ − n ) = P ( X n ( t ) < 0 ) = P ( η t ( n ) < 0 ) = E ζ t [ 0 ] ( n ) . \begin{equation}
\mathbb P(X_1(t)\leq-n)
=\mathbb P(X_n(t)<0)
=\mathbb P(\eta_t(n)<0)
=\mathbb E\zeta_t^{[0]}(n). \tag*{(6.21)}
\end{equation} P ( X 1 ( t ) ≤ − n ) = P ( X n ( t ) < 0 ) = P ( η t ( n ) < 0 ) = E ζ t [ 0 ] ( n ) . (6.21) Taking n = ⌈ s t ⌉ n=\lceil st\rceil n = ⌈ s t ⌉ and applying Corollary 6.5 (ii), we obtain
lim t → ∞ P ( X 1 ( t ) t ≤ − s ) = ρ α , 0 ( s ) , s > 0. \begin{equation}
\lim_{t\to\infty}
\mathbb P\left(\frac{X_1(t)}t\leq-s\right)
=\rho^{\alpha,0}(s),
\qquad s>0. \tag*{(6.22)}
\end{equation} t → ∞ lim P ( t X 1 ( t ) ≤ − s ) = ρ α , 0 ( s ) , s > 0. (6.22) For positive speeds, let v > 0 v>0 v > 0 and put m t = ⌊ v t ⌋ m_t=\lfloor vt\rfloor m t = ⌊ v t ⌋ . By (6.2) ,
P ( X 1 ( t ) t ≤ v ) = P ( ζ t [ m t ] ( 1 ) = 1 ) . \begin{equation}
\mathbb P\left(\frac{X_1(t)}t\leq v\right)
=\mathbb P\bigl(\zeta_t^{[m_t]}(1)=1\bigr). \tag*{(6.23)}
\end{equation} P ( t X 1 ( t ) ≤ v ) = P ( ζ t [ m t ] ( 1 ) = 1 ) . (6.23) If max { 0 , 1 − 2 α } < v < 1 \max\{0,1-2\alpha\}<v<1 max { 0 , 1 − 2 α } < v < 1 , Proposition 6.6 applies with ρ = ( 1 + v ) / 2 \rho=(1+v)/2 ρ = ( 1 + v ) /2 , and Proposition 2.2 gives
μ α , ρ ( ξ ( 1 ) = 0 ) = 1 − v 2 4 α . \mu^{\alpha,\rho}(\xi(1)=0)
=\frac{1-v^2}{4\alpha}. μ α , ρ ( ξ ( 1 ) = 0 ) = 4 α 1 − v 2 . Consequently,
lim t → ∞ P ( X 1 ( t ) t ≤ v ) = 1 − 1 − v 2 4 α , max { 0 , 1 − 2 α } < v < 1. \begin{equation}
\lim_{t\to\infty}
\mathbb P\left(\frac{X_1(t)}t\leq v\right)
=1-\frac{1-v^2}{4\alpha},
\qquad \max\{0,1-2\alpha\}<v<1. \tag*{(6.24)}
\end{equation} t → ∞ lim P ( t X 1 ( t ) ≤ v ) = 1 − 4 α 1 − v 2 , max { 0 , 1 − 2 α } < v < 1. (6.24) For 0 < α < 1 2 0<\alpha<\frac12 0 < α < 2 1 , the limits in (6.22) and (6.24) both approach α \alpha α as v ↑ 2 α − 1 v\uparrow 2\alpha-1 v ↑ 2 α − 1 and v ↓ 1 − 2 α v\downarrow 1-2\alpha v ↓ 1 − 2 α , respectively. By monotonicity,
lim t → ∞ P ( X 1 ( t ) t ≤ v ) = α , 2 α − 1 ≤ v ≤ 1 − 2 α . \lim_{t\to\infty}
\mathbb P\left(\frac{X_1(t)}t\leq v\right)
=\alpha,\qquad 2\alpha-1\leq v\leq1-2\alpha. t → ∞ lim P ( t X 1 ( t ) ≤ v ) = α , 2 α − 1 ≤ v ≤ 1 − 2 α . Differentiating the limiting distribution function gives (6.20) . Its jump at zero has size ( 2 α − 1 ) / ( 4 α ) (2\alpha-1)/(4\alpha) ( 2 α − 1 ) / ( 4 α ) when α ≥ 1 2 \alpha\geq\frac12 α ≥ 2 1 and is zero otherwise. This proves the theorem. ◻
Joint speeds of two boundary particles
For integers 0 ≤ m ≤ n 0\leq m\leq n 0 ≤ m ≤ n , let χ [ m , n ] = ( χ t [ m , n ] ) t ≥ 0 \chi^{[m,n]}=(\chi_t^{[m,n]})_{t\geq0} χ [ m , n ] = ( χ t [ m , n ] ) t ≥ 0 be the two-species half-line TASEP with priorities 1 ≻ 2 ≻ 0 1\succ2\succ0 1 ≻ 2 ≻ 0 , boundary transitions 0 → 1 0\to1 0 → 1 and 2 → 1 2\to1 2 → 1 at rate α \alpha α , and initial configuration
χ 0 [ m , n ] ( x ) = { 1 , 1 ≤ x ≤ m , 2 , m < x ≤ n , 0 , x > n . \chi_0^{[m,n]}(x)=
\begin{cases}
1,&1\leq x\leq m,\\
2,&m<x\leq n,\\
0,&x>n.
\end{cases} χ 0 [ m , n ] ( x ) = ⎩ ⎨ ⎧ 1 , 2 , 0 , 1 ≤ x ≤ m , m < x ≤ n , x > n .
The process χ [ m , n ] \chi^{[m,n]} χ [ m , n ] is the basic coupling of its two nested one-color projections:
1 { χ t [ m , n ] ( x ) = 1 } = ζ t [ m ] ( x ) , 1 { χ t [ m , n ] ( x ) ∈ { 1 , 2 } } = ζ t [ n ] ( x ) , x ≥ 1 , t ≥ 0 , \mathbf 1_{\{\chi_t^{[m,n]}(x)=1\}}=\zeta_t^{[m]}(x),
\qquad
\mathbf 1_{\{\chi_t^{[m,n]}(x)\in\{1,2\}\}}=\zeta_t^{[n]}(x),
\qquad x\geq1, t\geq0, 1 { χ t [ m , n ] ( x ) = 1 } = ζ t [ m ] ( x ) , 1 { χ t [ m , n ] ( x ) ∈ { 1 , 2 }} = ζ t [ n ] ( x ) , x ≥ 1 , t ≥ 0 ,
Proposition 6.6 identifies the boundary limit of each projection separately. It is therefore natural to expect the coupled process to converge to this measure near the boundary as well. We state it as a conjecture.
Conjecture 6.10. Let m T , n T m_T,n_T m T , n T be nonnegative integers such that 0 ≤ m T ≤ n T 0\leq m_T\leq n_T 0 ≤ m T ≤ n T , m T / T → u m_T/T\to u m T / T → u , and n T / T → v n_T/T\to v n T / T → v , where max { 0 , 1 − 2 α } < u < v < 1. \max\{0,1-2\alpha\}<u<v<1. max { 0 , 1 − 2 α } < u < v < 1. Set ρ 1 = ( 1 + u ) / 2 \rho_1=(1+u)/2 ρ 1 = ( 1 + u ) /2 and ρ 2 = ( 1 + v ) / 2 \rho_2=(1+v)/2 ρ 2 = ( 1 + v ) /2 . Then, for every fixed k ≥ 1 k\geq1 k ≥ 1 , ( χ 0 [ m T , n T ] S T α ) ∣ [ 1 , k ] ⟹ μ α , ρ 1 , ρ 2 ∣ [ 1 , k ] . \bigl(\chi_0^{[m_T,n_T]}S_T^\alpha\bigr)|_{[1,k]}
\Longrightarrow
\mu^{\alpha,\rho_1,\rho_2}|_{[1,k]}. ( χ 0 [ m T , n T ] S T α ) ∣ [ 1 , k ] ⟹ μ α , ρ 1 , ρ 2 ∣ [ 1 , k ] . Here μ α , ρ 1 , ρ 2 \mu^{\alpha,\rho_1,\rho_2} μ α , ρ 1 , ρ 2 is the high–high stationary two-species measure constructed in Sub§ 5.4 .
We now consider the joint limiting distribution of X 1 ( t ) / t X_1(t)/t X 1 ( t ) / t and X 2 ( t ) / t X_2(t)/t X 2 ( t ) / t , and set S t = { X 1 ( t ) > 0 , X 2 ( t ) > 0 } \mathcal S_t=\{X_1(t)>0,\ X_2(t)>0\} S t = { X 1 ( t ) > 0 , X 2 ( t ) > 0 } .
Theorem 6.11. Set α ^ = max { 0 , 1 − 2 α } \hat{\alpha}=\max\{0,1-2\alpha\} α ^ = max { 0 , 1 − 2 α } and assume Conjecture 6.10 . Then, conditional on S t \mathcal S_t S t , the pair ( X 1 ( t ) / t , X 2 ( t ) / t ) \bigl(X_1(t)/t,X_2(t)/t\bigr) ( X 1 ( t ) / t , X 2 ( t ) / t ) converges weakly to a probability measure supported on [ α ^ , 1 ] 2 [\hat{\alpha},1]^2 [ α ^ , 1 ] 2 , with off-diagonal density 1 ( 1 − α ^ 2 ) 2 { 2 u v ( v 2 − u 2 ) , α ^ < u < v < 1 , v ( 1 + 2 u + 3 u 2 − 2 v 2 ) , α ^ < v < u < 1 , \frac{1}{(1-\hat{\alpha}^2)^2}
\begin{cases}
2uv(v^2-u^2),&\hat{\alpha}<u<v<1,\\[1mm]
v(1+2u+3u^2-2v^2),&\hat{\alpha}<v<u<1,
\end{cases} ( 1 − α ^ 2 ) 2 1 { 2 uv ( v 2 − u 2 ) , v ( 1 + 2 u + 3 u 2 − 2 v 2 ) , α ^ < u < v < 1 , α ^ < v < u < 1 , and diagonal line density at ( u , u ) (u,u) ( u , u ) given by u ( 1 + u ) 2 ( 1 − u 2 ) 2 ( 1 − α ^ 2 ) 2 , α ^ < u < 1. \frac{u(1+u)^2(1-u^2)}{2(1-\hat{\alpha}^2)^2},
\qquad \hat{\alpha}<u<1. 2 ( 1 − α ^ 2 ) 2 u ( 1 + u ) 2 ( 1 − u 2 ) , α ^ < u < 1.
Proof. Set ρ w = ( 1 + w ) / 2 \rho_w=(1+w)/2 ρ w = ( 1 + w ) /2 . By color–position symmetry, [83 Theorem 1.8] , and Proposition 2.2 ,
P ( S t ) = P ( ζ t [ 0 ] ( 1 ) = ζ t [ 0 ] ( 2 ) = 0 ) ⟶ c α : = ( 1 − α ^ 2 ) 2 16 α 2 . \mathbb P(\mathcal S_t)
=\mathbb P\bigl(\zeta_t^{[0]}(1)=\zeta_t^{[0]}(2)=0\bigr)
\longrightarrow
c_\alpha:=\frac{(1-\hat{\alpha}^2)^2}{16\alpha^2}. P ( S t ) = P ( ζ t [ 0 ] ( 1 ) = ζ t [ 0 ] ( 2 ) = 0 ) ⟶ c α := 16 α 2 ( 1 − α ^ 2 ) 2 . For α ^ < u < v < 1 \hat{\alpha}<u<v<1 α ^ < u < v < 1 , write p i j ( u , v ) p_{ij}(u,v) p ij ( u , v ) for the probability of the word i j ij ij under μ α , ρ u , ρ v \mu^{\alpha,\rho_u,\rho_v} μ α , ρ u , ρ v . Color–position symmetry and Conjecture 6.10 identify the limiting joint distribution functions with p 11 ( u , v ) + p 12 ( u , v ) p_{11}(u,v)+p_{12}(u,v) p 11 ( u , v ) + p 12 ( u , v ) when u < v u<v u < v , and p 11 ( v , u ) + p 21 ( v , u ) p_{11}(v,u)+p_{21}(v,u) p 11 ( v , u ) + p 21 ( v , u ) when v < u v<u v < u . Thus, the unnormalized density in the first quadrant can be computed by
f 0 ( u , v ) = { ∂ u ∂ v p 12 ( u , v ) , α ^ < u < v < 1 , ∂ u ∂ v p 21 ( v , u ) , α ^ < v < u < 1. f_0(u,v)=
\begin{cases}
\partial_u\partial_v p_{12}(u,v),
&\hat{\alpha}<u<v<1,\\[1mm]
\partial_u\partial_v p_{21}(v,u),
&\hat{\alpha}<v<u<1.
\end{cases} f 0 ( u , v ) = { ∂ u ∂ v p 12 ( u , v ) , ∂ u ∂ v p 21 ( v , u ) , α ^ < u < v < 1 , α ^ < v < u < 1. Likewise, the word 22 22 22 corresponds to both positions lying in ( u , u + ε ] (u,u+\varepsilon] ( u , u + ε ] , so the diagonal line density is
d 0 ( u ) = lim ε ↓ 0 p 22 ( u , u + ε ) ε , α ^ < u < 1. d_0(u)=
\lim_{\varepsilon\downarrow0}
\frac{p_{22}(u,u+\varepsilon)}{\varepsilon},
\qquad \hat{\alpha}<u<1. d 0 ( u ) = ε ↓ 0 lim ε p 22 ( u , u + ε ) , α ^ < u < 1. Substituting the two-site probabilities from Theorem 1.4 gives the densities in the theorem after division by the normalization constant c α c_\alpha c α . ◻
Conjectural full two-speed distribution
We record a conjectural expression for the unconditioned joint law of the first two signed asymptotic speeds: We have not addressed its negative-speed sectors in this paper. See Figure 22 for the simulation.
Figure 22. Simulation of ( X 1 ( t ) / t , X 2 ( t ) / t ) \bigl(X_1(t)/t,X_2(t)/t\bigr) ( X 1 ( t ) / t , X 2 ( t ) / t ) in the half-space TASEP at t = 250 t=250 t = 250 , with 120,000 120{,}000 120 , 000 independent samples.
Conjecture A.1. Assume Conjectures 1.5 and 6.10 . Set α ^ = max { 0 , 1 − 2 α } \hat\alpha=\max\{0,1-2\alpha\} α ^ = max { 0 , 1 − 2 α } . The absolutely continuous part of the joint law of ( U 1 , U 2 ) (U_1,U_2) ( U 1 , U 2 ) has density f α ( 2 ) f_\alpha^{(2)} f α ( 2 ) described, for α ^ < u , v < 1 \hat\alpha<u,v<1 α ^ < u , v < 1 with u ≠ v u\ne v u = v , by f α ( 2 ) ( u , v ) = { u v ( v 2 − u 2 ) 8 α 2 , u < v , v ( 1 + 2 u + 3 u 2 − 2 v 2 ) 16 α 2 , v < u , f α ( 2 ) ( − u , − v ) = { 1 4 , u < v , u − v 4 , v < u , f α ( 2 ) ( u , − v ) = { u 4 α , u < v , ( u − v ) ( 2 + 3 u + 3 v ) 16 α , v < u , f α ( 2 ) ( − u , v ) = { v ( α + u ) 4 α , v < u , ( v − u ) ( 2 α + 3 α ( u + v ) + 2 u 2 + 5 u v + 2 v 2 − 1 ) 16 α , u < v . \begin{aligned}
f_\alpha^{(2)}(u,v)
&=\begin{cases}
\dfrac{uv(v^2-u^2)}{8\alpha^2},&u<v,\\[2mm]
\dfrac{v(1+2u+3u^2-2v^2)}{16\alpha^2},&v<u,
\end{cases}\\[2mm]
f_\alpha^{(2)}(-u,-v)
&=\begin{cases}
\dfrac14,&u<v,\\[2mm]
\dfrac{u-v}{4},&v<u,
\end{cases}\\[2mm]
f_\alpha^{(2)}(u,-v)
&=\begin{cases}
\dfrac{u}{4\alpha},&u<v,\\[2mm]
\dfrac{(u-v)(2+3u+3v)}{16\alpha},&v<u,
\end{cases}\\[2mm]
f_\alpha^{(2)}(-u,v)
&=\begin{cases}
\dfrac{v(\alpha+u)}{4\alpha},&v<u,\\[2mm]
\dfrac{(v-u)\bigl(2\alpha+3\alpha(u+v)
+2u^2+5uv+2v^2-1\bigr)}{16\alpha},&u<v.
\end{cases}
\end{aligned} f α ( 2 ) ( u , v ) f α ( 2 ) ( − u , − v ) f α ( 2 ) ( u , − v ) f α ( 2 ) ( − u , v ) = ⎩ ⎨ ⎧ 8 α 2 uv ( v 2 − u 2 ) , 16 α 2 v ( 1 + 2 u + 3 u 2 − 2 v 2 ) , u < v , v < u , = ⎩ ⎨ ⎧ 4 1 , 4 u − v , u < v , v < u , = ⎩ ⎨ ⎧ 4 α u , 16 α ( u − v ) ( 2 + 3 u + 3 v ) , u < v , v < u , = ⎩ ⎨ ⎧ 4 α v ( α + u ) , 16 α ( v − u ) ( 2 α + 3 α ( u + v ) + 2 u 2 + 5 uv + 2 v 2 − 1 ) , v < u , u < v . The joint law also has singular components along the four diagonals, with the following densities with respect to the parameter d s ds d s , for α ^ < s < 1 \hat\alpha<s<1 α ^ < s < 1 : Location Density ( s , s ) s ( 1 + s ) 2 ( 1 − s 2 ) 32 α 2 ( − s , − s ) 1 − s 2 8 ( s , − s ) s ( 1 − s 2 ) 8 α ( − s , s ) s ( α + s ) ( 1 − s 2 ) 8 α \begin{array}{c|c}
\text{Location}&\text{Density}\\ \hline
(s,s)&\displaystyle\frac{s(1+s)^2(1-s^2)}{32\alpha^2}\\[2mm]
(-s,-s)&\displaystyle\frac{1-s^2}{8}\\[2mm]
(s,-s)&\displaystyle\frac{s(1-s^2)}{8\alpha}\\[2mm]
(-s,s)&\displaystyle\frac{s(\alpha+s)(1-s^2)}{8\alpha}
\end{array} Location ( s , s ) ( − s , − s ) ( s , − s ) ( − s , s ) Density 32 α 2 s ( 1 + s ) 2 ( 1 − s 2 ) 8 1 − s 2 8 α s ( 1 − s 2 ) 8 α s ( α + s ) ( 1 − s 2 ) If α > 1 2 \alpha>\tfrac12 α > 2 1 , there are additionally singular components along the coordinate axes, with densities with respect to d s ds d s , for 0 < s < 1 0<s<1 0 < s < 1 : Location Density ( s , 0 ) ( 2 α − 1 ) s ( 3 s + 2 ) 32 α 2 ( − s , 0 ) ( 2 α − 1 ) s 8 α ( 0 , s ) ( 2 α − 1 ) s ( 2 s 2 + 3 α s + 2 α − 1 ) 32 α 2 ( 0 , − s ) 2 α − 1 8 α \begin{array}{c|c}
\text{Location}&\text{Density}\\ \hline
(s,0)&\displaystyle\frac{(2\alpha-1)s(3s+2)}{32\alpha^2}\\[2mm]
(-s,0)&\displaystyle\frac{(2\alpha-1)s}{8\alpha}\\[2mm]
(0,s)&\displaystyle\frac{(2\alpha-1)s(2s^2+3\alpha s+2\alpha-1)}{32\alpha^2}\\[2mm]
(0,-s)&\displaystyle\frac{2\alpha-1}{8\alpha}
\end{array} Location ( s , 0 ) ( − s , 0 ) ( 0 , s ) ( 0 , − s ) Density 32 α 2 ( 2 α − 1 ) s ( 3 s + 2 ) 8 α ( 2 α − 1 ) s 32 α 2 ( 2 α − 1 ) s ( 2 s 2 + 3 α s + 2 α − 1 ) 8 α 2 α − 1 and an atom at the origin of mass P ( U 1 = U 2 = 0 ) = 2 α − 1 16 α . \mathbb P(U_1=U_2=0)=\frac{2\alpha-1}{16\alpha}. P ( U 1 = U 2 = 0 ) = 16 α 2 α − 1 . For 0 < α ≤ 1 2 0<\alpha\le\tfrac12 0 < α ≤ 2 1 , there are no axis components or atom at the origin.
(Alexey Bufetov)
Institute of Mathematics, Leipzig University, Germany
Email address: alexey.bufetov@gmail.com
(Yuan Tian)
Max Planck Institute for Mathematics in the Sciences, Germany
Institute of Mathematics, Leipzig University, Germany
Email address: yuan.tian@mis.mpg.de