This paper presents a unified framework for soliton cellular automata using rigged configurations, providing proofs for soliton behavior, scattering, and phase shifts in various cases, enhancing theoretical understanding.
Contribution
It introduces a uniform approach to analyze soliton cellular automata with rigged configurations, covering cases previously studied separately.
Findings
01
Rigged configurations describe solitons and their interactions.
02
Proofs of soliton scattering and phase shifts in specific automata cases.
03
Unified theoretical framework for soliton cellular automata.
Abstract
For soliton cellular automata, we give a uniform description and proofs of the solitons, the scattering rule of two solitons, and the phase shift using rigged configurations in a number of special cases. In particular, we prove these properties for the soliton cellular automata using Br,1 when r is adjacent to 0 in the Dynkin diagram or there is a Dynkin diagram automorphism sending r to 0.
Tables4
Table 1. Table 1. Local energy on B r , 1 ⊗ B r , 1 tensor-product superscript 𝐵 𝑟 1 superscript 𝐵 𝑟 1 B^{r,1}\otimes B^{r,1} for r ∼ 0 similar-to 𝑟 0 r\sim 0 , where u = u ( B r , 1 ) 𝑢 𝑢 superscript 𝐵 𝑟 1 u=u(B^{r,1}) , v = v ( B r , 1 ) 𝑣 𝑣 superscript 𝐵 𝑟 1 v=v(B^{r,1}) , x ∈ B ( Λ ¯ r ) ∖ { u , f r u } 𝑥 𝐵 subscript ¯ Λ 𝑟 𝑢 subscript 𝑓 𝑟 𝑢 x\in B(\overline{\Lambda}_{r})\setminus\{u,f_{r}u\} .
Table 2. Table 2. The restrictions for type E n ( 1 ) superscript subscript 𝐸 𝑛 1 E_{n}^{(1)} , where we disregard any A k ( 1 ) superscript subscript 𝐴 𝑘 1 A_{k}^{(1)} with k ≤ 0 𝑘 0 k\leq 0 .
Table 3. Table 3. The restrictions given by removing node r 𝑟 r in type 𝔤 𝔤 \mathfrak{g} considered.
Table 4. Table 4. The factors ( γ i ) i ∈ I subscript subscript 𝛾 𝑖 𝑖 𝐼 (\gamma_{i})_{i\in I} .
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
X. Liu]Department of Statistics, North Carolina State University, 2311 Stinson Dr., Raleigh, NC 27695
A uniform approach to soliton cellular automata using rigged configurations
For soliton cellular automata, we give a uniform description and proofs of the solitons, the scattering rule of two solitons, and the phase shift using rigged configurations in a number of special cases.
In particular, we prove these properties for the soliton cellular automata using Br,1 when r is adjacent to [math] in the Dynkin diagram or there is a Dynkin diagram automorphism sending r to [math].
TS was partially supported by the National Science Foundation RTG grant NSF/DMS-1148634.
1. Introduction
A soliton cellular automaton (SCA) is a discrete dynamical system on a one-dimensional lattice that evolves according to a particular deterministic rule.
Some of the key properties of SCA are that they possess stable configurations called solitons, isolated solitons move proportional to their length, and the number of solitons and their lengths do not change after collisions.
A classic and, despite its simplicity, surprisingly rich example is the box-ball system of Takahashi and Satsuma [TS90].
The box-ball system is an integrable nonlinear dynamical system and is related to the difference analog of the Lotka–Volterra equation under tropicalization [TNS99, TTMS96].
It is also an ultradiscrete version of the Korteweg–de Vries (KdV) equation [Bou77, KdV95]: a nonlinear partial differential equation that models shallow water waves in 1D (such as a thin channel).
Solutions of the KdV equation were shown to separate in solitary waves, where they retained their shape after interaction, by Kruskal and Zabusky [KZ64].
These solitary waves are called solitons, and solitons in the box-ball system are the ultradiscrete analog.
The inverse scattering transform was constructed in [GGKM74] and applied to the KdV equation, showing m-soliton solutions exist and that the KdV equation is an exactly solvable model.
The next breakthrough in studying SCA came from using the theory of Kashiwara’s crystal bases [Kas90, Kas91] and certain finite crystals for affine Kac–Moody algebras called Kirillov–Reshetikhin (KR) crystals [FOS09, HKO*+*99, HKO*+*02b, JS10, KKM*+*92b, KMOY07, OS08, Yam98].
SCA were reformulated using tensor products of KR crystals (Br,1)⊗∞,111This could be given more generally as ⨂i=1∞Bri,si for any sequence {(ri,si)∈I0×Z≥0}i=1∞. However, we will not consider this level of generality. where the time evolution was given using the combinatorial R-matrix with a carrier Br,s (typically for s≫1) and the invariants were described using the local energy function [bM12, FOY00, HHI*+*01, HKO*+*02a, HKT00, MOW12, MW13, TNS99, Yam04, Yam07].
Based on these results, it is conjectured that solitons are parameterized by “decoupled” KR crystals (removing nodes [math] and r from the Dynkin diagram and taking the appropriate affinization), the scattering rule is determined by the “decoupled” combinatorial R-matrix, and the phase shift is given by the local energy function for all SCA.
We note that the phase shift corresponds to the change in the coefficient of the null root δ if we consider the affinization crystal (we refer the reader to [HK02, Ch. 10] for details) of “decoupled” KR crystals.
Additionally, the time evolution can also be described using the row-to-row transfer matrix of integrable 2D lattice models at q=0.
In particular, the box-ball system is given using the KR crystal B1,1 in type A1(1).
SCA are also intimately connected to the Bethe ansatz [Bet31] of Heisenberg spin chains.
The connection comes from the fact that the Hamiltonian of the Heisenberg spin chain commutes with the row-to-row transfer matrix of the 2D lattice model and can be simultaneously diagonalized [KKM*+*92a].
The analysis of the 2D lattice model and the Bethe ansatz led to the X=M conjecture [HKO*+*99, HKO*+*02b], but there is a more direct combinatorial interpretation.
Baxter’s corner transfer matrix [Bax89] can be to solve the 2D lattice model, which naturally corresponds to classically highest weight elements in a tensor product of KR crystals.
In [KKR86, KR86], Kerov, Kirillov, and Reshetikhin introduced combinatorial objects called rigged configurations to parameterize solutions to the Bethe ansatz and developed a bijection Φ between rigged configurations and classically highest weight elements in ⨂i=1NB1,si in type An(1).
The bijection Φ was later extended to an affine crystal isomorphism with the full tensor product in general (i.e., for ⨂i=1NBri,si) in type An(1) [DS06, KSS02, SW10].
The SCA for type An(1) has similar dynamics to the box-ball system, but now there are n colored balls (for r=1).
In the bijection Φ, the addition of vacuum states to the end of the tensor product does not change the rigged configuration, and thus we can extend Φ to be a bijection between rigged configurations and states of the SCA.
Moreover, the combinatorial R-matrix intertwines with the identity map on rigged configurations under Φ, and thus time evolution acts by increasing the riggings Ji(r) by i.
Hence, the corresponding rigged configuration under Φ−1 encodes the action-angle variables of the SCA, and in particular, the partition ν(r) of the rigged configuration encodes the sizes of the solitons (with no interactions) [KNTW18, KS09, KOS*+*06, Tak05].
The scattering of two solitons has been identified with the affine combinatorial R-matrices [KSY07, Sak08], which ensures the Yang–Baxter property and is also valid for all intermediate states during multiple scatterings.
In [KSY07], it was shown that Φ can be described by a tropicalization of the τ function from the Kadomtsev–Petviashvili (KP) hierarchy (we refer the reader to [JM83] for details).
Additionally, time evolution is a tropicalization of the nonautonomous discrete KP equation [HHI*+*01].
In type An(1), there is an intermediate geometric (or rational) model between the KdV equation and the box-ball system introduced by Hirota [Hir81] called the discrete KdV equation.
For the discrete KdV equation, Kashiwara’s crystals are replaced by geometric crystals [BK00, BK07]; more specifically, with the affine geometric crystals of [KNO08, LP12].
The geometric R-matrix was described by Yamada [Yam01], where the ring of geometric R-matrix invariants was studied in [LP13].
This led to a conjectural description of a geometric version of Φ in [LPS16, Scr17a] using these invariants, where it is known that it tropicalizes to describe ν(1) [LPS16].
Transitioning back to the more general setting, SCA have been well studied through explicit description of the action of the combinatorial R-matrix; e.g., [bM12, FOY00, HHI*+*01, HKO*+*02a, HKT00, MOW12, MW13, TNS99, Yam04, Yam07].
Moreover, rigged configurations have been used to describe properties of SCA in types An(1) [KOS*+*06, KSY07, Sak08] and Dn(1) [KSY11, Sak17].
There exists an analogous (conjectural) bijection Φ for all types [DS06, JS10, KSS02, OSSS17, OS12, OSS18, OSS03a, OSS03b, OSS03c, SS15, SS06, SW10, Scr16, Scr17c].
Thus, it is expected that similar results hold for all types; in particular, that rigged configurations and the (conjectural) bijection Φ can be applied to show properties about SCA.
The main goal of this paper is to do this in as general as possible with uniform methods.
In particular, our results give an interpretation of [HKO*+*02b, App. B] as “decoupling” rules on the level of rigged configurations by forgetting ν(r) and instead using ν(r) to describe the “decoupled” KR crystals.
Moreover, our results subsume the results on the scattering and phase shift of SCA (see Conjecture 2.10) from [bM12, FOY00, HHI*+*01, HKO*+*02a, HKT00, MOW12, MW13, TNS99, Yam04, Yam07] as the requisite properties of Φ are known [KSS02, OSSS17, OSS18, Scr17c].
Our results also include other types that have not previously been considered; e.g., E6,7(1) and F4(1).
One key aspect of our results is that they are largely type-independent, typically relying on the properties of the KR crystals.
Moreover, the proofs are typically short and straightforward, relying on (expected) properties of Φ and utilizing the natural information of rigged configurations.
An important advantage to this approach is that we do not require an understanding of the often intricate combinatorial R-matrix as it (conjecturally) becomes the identity map on rigged configurations under Φ.
In contrast, directly studying the SCA using KR crystals requires detailed descriptions of the combinatorial R-matrix or the evolution rules of [HKT01], as well as doing multiple applications, in order to prove properties about the SCA, leading to complicated (and type-dependent) proofs.
See, e.g., [bM12, FOY00, HHI*+*01, HKO*+*02a, HKT00, MOW12, MW13, TNS99, Yam04, Yam07].
We note that in order to give a uniform description and proofs of SCA, we require a formal, uniform definition of solitons and their length.
As far as the authors are aware, no such definition has been given in the literature.
Provided the conjectured properties of Φ are true, we mostly achieve this, but our description of length is somewhat ad-hoc.
Our description of length requires a special considerations for elements not in the maximal component B(Λr)⊆Br,1 despite being entirely determined by the crystal.
It is based upon the (conjectural) algorithm for Φ and that ν(r) should describe the lengths of the solitons (which naturally shows their speed corresponds to their length).
The latter property is expected as all rows of ν(r) are connected with solitons of the KP hierarchy [KSY07].
Hence, we are not certain our definition of length will fully generalize.
Specifically in type Cn(1), we can contrast this with the description of the solitons given in [HKO*+*02a, Sec. 2.3] and [HKT00, Sec. 3.2], where a vacuum element gets bounded as part of the soliton.
Our approach also allows us to give a simple description of the phase shift, the shift to the left of the larger soliton after scattering compared to its movement without scattering, in terms of the vacancy numbers of the rigged configuration.
In particular, the phase shift is measuring the change in the vacancy numbers, where we discard any contribution from the tensor factors (Br,1)⊗∞, of ν(r) after adding a smaller soliton.
Furthermore, the larger class of SCA that we can examine from our results allows us to construct a number of examples where the phase shift is negative, a phenomenon only previously observed in types D4(3) [Yam07] and G2(1) [MOW12].
We construct such examples not just in nonexceptional types, but the simply-laced type D4(1).
Moreover, our results suggest that a large class of SCA can exhibit negative phase shifts.
In addition, our results also connect the phase shift to the local energy function of the decoupled in certain special cases, recovering previous known results.
Rigged configurations and the bijection Φ are known to be well behaved under the virtualization map [OSS18, OSS03b, OSS03c, SS15, Scr16, Scr17c], an embedding of a crystal of non-simply-laced type into one of simply-laced type.
Furthermore, it is known that an SCA constructed using B1,1 in every nonexceptional type can be embedded in a type Dn(1) SCA [KTT04].
Therefore, we expect that our results could be applied to obtain analogous embedding results for other SCA and SCA in exceptional types.
We note that some of the KR crystals we consider in this paper have not been shown to exist (more specifically, in the exceptional types).
Yet, this is implicit in our assumption that the combinatorial R-matrix corresponds to the identity map on rigged configurations under Φ.
Thus, our results give further evidence that these KR crystals should exist.
Furthermore, they are additional evidence for some of the conjectural properties of KR crystals.
This paper is organized as follows.
In Section 2, we give the necessary background on crystals, KR crystals, SCA, and rigged configurations.
In Section 3, we describe solitons in a number of cases using the properties of the KR crystals.
In Section 4, we give our main results under some natural conjectures, where we show rigged configurations encode the sizes of the solitons and give simple uniform proofs of scattering and the phase shift.
In Section 5, we summarize the cases when our results are not based on any conjectures.
2. Background
Let g be an affine Kac–Moody Lie algebra with index set I, Cartan matrix (Aij)i,j∈I, simple roots (αi)i∈I, fundamental weights (Λi)i∈I, weight lattice P, simple coroots (αi∨)i∈I, and canonical pairing ⟨,⟩:P∨×P→Z given by ⟨αi∨,αj⟩=Aij.
Let Uq(g) denote the corresponding (Drinfel’d–Jimbo) quantum group.
Define ti∨:=max(ci∨/ci,c0), where ci and ci∨ are the Kac and dual Kac labels respectively [Kac90, Table Aff1-3].
We write i∼j if Aij=0 and i=j.
Let g0 (resp. g0,r) denote the canonical semisimple Lie algebra given by the index set I0=I∖{0} (resp. I0,r=I∖{0,r}) and quantum group Uq(g0) (resp. Uq(g0,r)).
Let Λi and αi denote the natural projection of Λi and αi, respectively, onto the weight lattice P of g0.
Note that (αi)i∈I0 are the simple roots in g0.
Denote the fundamental weights of g0,r by {ϖi}i∈I0,r.
We say an r∈I0 is special if it is in the orbit of [math] in I under Dynkin diagram automorphisms.
We say r is minuscule if it is special and g is of dual untwisted type (i.e., it is the dual type to an untwisted type).
In particular, if a r node is minuscule, then B(Λr) is a minuscule Uq(g0)-representation.
An abstract Uq(g)-crystal is a set B with crystal operatorsei,fi:B→B⊔{0}, for i∈I, and weight functionwt:B→P that satisfy the following conditions:
(1)
φi(b)=εi(b)+⟨hi,wt(b)⟩ for all b∈B and a∈I,
(2)
fib=b′ if and only if b=eib′ for b,b′∈B and a∈I,
where εi,φi:B→Z≥0 are the statistics
[TABLE]
Hence, we can express an entire i-string through an element b∈B diagrammatically by
[TABLE]
More generally, we identify the abstract crystal B with its crystal graph, an I-edge-colored weighted directed graph, where there is an edge b→b′ if fib=b′.
We say an element b∈B is highest weight if eib=0 for all a∈I.
Remark 2.1**.**
The definition of an abstract crystal given in this paper is sometimes called a regular or seminormal abstract crystal in the literature.
We call an abstract Uq(g)-crystal B a Uq(g)-crystal if B is the crystal basis of some Uq(g)-module.
Kashiwara has shown that the irreducible highest weight module V(λ) admits a crystal basis [Kas91].
We denote this crystal basis by B(λ), and let uλ∈B(λ) denote the unique highest weight element, which is the unique element of weight λ.
Since the crystal graph of B(λ) is acyclic, we regard B(Λr) as a poset with b≤b′ if there exists a path fiL⋯fi1b=b′.
In particular, the crystal graph is the Hasse diagram of this poset.
We define the tensor product of abstract Uq(g)-crystals B1 and B2 as the crystal B2⊗B1 that is the Cartesian product B2×B1 with the crystal structure
[TABLE]
Remark 2.2**.**
Our tensor product convention is opposite of Kashiwara [Kas91].
Consider Uq(g)-crystals B1,…,BL.
The action of the crystal operators on the tensor product B=BL⊗⋯⊗B2⊗B1 can be computed by the signature rule.
Let b=bL⊗⋯⊗b2⊗b1∈B, and for i∈I, we write
[TABLE]
Then by successively deleting any +−-pairs (in that order) in the above sequence, we obtain a sequence
[TABLE]
called the reduced signature.
Suppose 1≤j−,j+≤L are such that bj− contributes the rightmost − in sgni(b) and bj+ contributes the leftmost + in sgni(b).
Then, we have
[TABLE]
Let B1 and B2 be two abstract Uq(g)-crystals.
A crystal morphismψ:B1→B2 is a map B1⊔{0}→B2⊔{0} with ψ(0)=0 such that the following properties hold for all b∈B1 and i∈I:
(1)
If ψ(b)∈B2, then \operatorname{wt}\bigl{(}\psi(b)\bigr{)}=\operatorname{wt}(b), \varepsilon_{i}\bigl{(}\psi(b)\bigr{)}=\varepsilon_{i}(b), and \varphi_{i}\bigl{(}\psi(b)\bigr{)}=\varphi_{i}(b).
(2)
We have ψ(eib)=eiψ(b) if ψ(eib)=0 and eiψ(b)=0.
(3)
We have ψ(fib)=fiψ(b) if ψ(fib)=0 and fiψ(b)=0.
An embedding (resp. isomorphism) is a crystal morphism such that the induced map B1⊔{0}→B2⊔{0} is an embedding (resp. bijection).
Let r be a minuscule node.
Following [JS10, Scr17c], we first note that b∈B(Λr) is determined by the subset
[TABLE]
where i∈I.
To ease notation, we will write this simply as a word, which we call the minuscule word of b.
See Figure 3 for two examples.
For r∼0, we decompose the crystal B(Λr)={xα}⊔{yi}, where
•
xα is the unique element weight α, which is a root of the root system of g;
•
yi satisfies εj(yi)=φj(yi)=δij (note that wt(yi)=0).
See Figure 2 for an example.
We will also represent elements of B(Λ1) in nonexceptional types by the common 1,…,1 from [KM94, KN94].
Next, we want to characterize the elements in the unique connected component B(sΛr)⊆B(Λr)⊗s.
Let r be such that Λr is a minuscule weight. Then B(sΛr)⊆B(Λr)⊗s is characterized by
[TABLE]
We will write the elements of B(sΛr) as the single row tableaux
[TABLE]
This was also used to describe the elements of B(sΛ1) for types An, Bn, Cn, and Dn in [KN94] and for type G2 in [KM94].
However, when there is an element y1∈B(Λ1) of weight [math] (and is the unique such element and denoted [math] in [KM94, KN94]), it can only appear once in a tableau.
For example, a typical element in B(sΛ1) in type Bn is of the form:
[TABLE]
2.1. Kirillov–Reshetikhin crystals
Let ca denote the Kac labels [Kac90, Table Aff1-3].
Let Uq′(g):=Uq([g,g]), and we note that the weight lattice is given by P′=P/Zδ, where δ=∑a∈Icaαa is the null root.
In particular, the simple roots in P′ have a linear dependence.
We will not be considering Uq(g)-crystals in this paper, and so we abuse notation and denote the Uq′(g)-weight lattice by P.
For a Uq′(g)-crystal B, we say b∈B is classically highest weight if eib=0 for all i∈I0.
An important class of finite-dimensional irreducible Uq′(g)-modules are Kirillov–Reshetikhin (KR) modules, which are characterized by their Drinfel’d polynomials [CP95, CP98].
A (conjectural [HKO*+*99, HKO*+*02b]) remarkable property of KR modules is that they admit crystal bases, which are known as Kirillov–Reshetikhin (KR) crystals.
A KR crystal is denoted by Br,s, where r∈I0 and s∈Z>0.
KR crystals were shown to exist in all nonexceptional types in [OS08] and a combinatorial model given in [FOS09].
Jones and Schilling showed KR crystals exist and gave a combinatorial model for Br,s, where r=1,2,6, in type E6(1) [JS10].
The cases B1,s in type D4(3) [KMOY07] and B2,s in type G2(1) [Yam98] are also known to exist and have a combinatorial model.
The KR crystal Br,1 in all types was constructed uniformly using projected level-zero LS paths by the work of Naito and Sagaki [NS08a, NS08b].
We will also describe the elements of Br,1 when r∼0 following [BFKL06].
Specifically for g not of type An(1) or A2n(2)†, we have Br,1≅B(Λr)⊕B(0) as Uq(g0)-crystals.
We denote the unique element ∅∈B(0), which plays the role of y0.
For type A2n(2)†, we have Br,1≅B(Λr) as Uq(g0)-crystals.
There exists a unique classical component B(sΛr)⊆Br,s.
Moreover, we have B(sΛr)≅Br,s as Uq(g0)-crystals when r is a minuscule node.
Let u(Br,s)=urΛs∈B(sΛr)⊆Br,s denote the maximal element, which is the unique element in Br,s of classical weight sΛr.
For B=⨂i=1NBri,si, the maximal element is u(B)=u(Br1,s1)⊗⋯⊗u(BrN,sN), which is the unique element of classical weight ∑i=1NsiΛri.
Let v(B) denote the minimal element of B, which is the unique element of classical weight −∑i=1NsiΛri.
It is conjectured that tensor products of KR crystals are connected, which is known in nonexceptional types [Oka13] and when the KR crystals are perfect of the same level [FSS07, ST12].
Since tensor products of KR crystals are (conjecturally) connected, there exists a unique Uq′(g)-crystal morphism R:B⊗B′→B′⊗B, called the combinatorial R-matrix, defined by
[TABLE]
We denote the combinatorial R-matrix R(b⊗b′)=b′⊗b pictorially by
[TABLE]
We now describe an important statistic that arises from mathematical physics called the local energy function.
Let b′⊗b=R(b⊗b′), and define the following conditions:
(LL)
e0(b⊗b′)=e0b⊗b′ and e0(b′⊗b)=e0b′⊗b;
(RR)
e0(b⊗b′)=b⊗e0b′ and e0(b′⊗b)=b′⊗e0b.
The local energy function H:Br,s⊗Br′,s′→Z is defined by
[TABLE]
and it is known H is defined up to an additive constant [KKM*+*92a].
We normalize H by setting H\bigl{(}u(B^{r,s})\otimes u(B^{r^{\prime},s^{\prime}})\bigr{)}=0.
Note that H is constant on classical components.
For special nodes, the local energy has the following form.
Let r be a special node.
Then the classically highest weight elements of Br,s⊗Br,s′ are of the form b⊗u(Br,s′) and H\bigl{(}b\otimes u(B^{r,s^{\prime}})\bigr{)} equals the number of r-arrows in the path from b to usΛr in B(sΛr).
Let r∼0. Then the local energy of Br,1⊗Br,1 is given in Table 1 (it is specified on the I0-highest weight elements).
Remark 2.6**.**
The local energy function on Br,1⊗Br,1 from [BFKL06] in Table 1 is renormalized to our convention.
Let u=u(Br,1).
We note that there are two minor errors in [BFKL06], where it is stated H(x⊗u)=1 and H(fru⊗u)=1 (the only difference is for types Dn+1(2) and A2n(2)).
Define φ(b)=∑i∈Iφi(b)Λi.
Let b♯∈Br,s be the unique element such that φ(b♯)=ℓΛ0, where ℓ=min{⟨c,φ(b)⟩∣b∈Br,s} and c is the canonical central element.
For example, when r is a special node, we have b♯=v(Br,s).
Following [HKO*+*02b], we then define DBr,s:Br,s→Z by
[TABLE]
Let B=⨂k=1NBrk,sk. We define energy [HKO*+*99] D:B→Z by
[TABLE]
where Rj and Hj are the combinatorial R-matrix and local energy function, respectively, acting on the j-th and (j+1)-th factors and DBrj,sj acts on the rightmost factor. Note that D is constant on classical components since H is and R is a Uq′(g)-crystal isomorphism.
If we restrict ourselves to the case when B=(Br,s)⊗N for r a minuscule node, then we can simplify the energy function to
[TABLE]
2.2. Soliton cellular automata
A soliton cellular automaton (SCA) using Br,1 of type g is a discrete dynamical system, where a state is an element in ⨂k=−∞0Br,1 of the form
[TABLE]
where us is the maximal element of Br,s, for some L≫1.
The element u1 in a state is called a vacuum element.
Given a state b, define the time evolution operatorTℓ(b) by
[TABLE]
Note that this is well defined because eventually we have R(u1⊗uℓ)=uℓ⊗u1.
We depict this by
[TABLE]
The state energy is defined as
[TABLE]
When ℓ=1, the state energy may be simplified as
[TABLE]
where b1=b−L−1=u1, since the combinatorial R-matrix R:Br,s⊗Br,s→Br,s⊗Br,s is the identity map.
Definition 2.7**.**
Consider an SCA using Br,1 of type g.
A soliton is a tensor product b=b−L⊗⋯⊗b0 such that bk=u1, for all k, and E1(b)=H(fru1⊗u1) (with b considered as a state by ⋯⊗u1⊗u1⊗b).
The length of a soliton is ∑k=0LNr(b−k), where
[TABLE]
for ei1⋯eimb−k=uΛr.
Example 2.8**.**
Consider r=1 in type C3(1).
Then 2⊗1 is a soliton of length 3 as e1e2e3e2e11=1=u1 and E1(2⊗1)=H(2⊗1)=1.
Therefore, ℓ is not necessarily equal L.
In particular, we apply T5(⋯⊗1⊗1⊗2⊗1):
[TABLE]
Note that the soliton moved 3 steps to the left, which agrees with its length.
Let S(r)(ℓ1,ℓ2,…,ℓm) denote the set of states consisting of a solitons of length ℓ1,…,ℓm, in that order from right to left, in the SCA using Br,1 of type g that are “far apart;” i.e., the solitons (pairwise) will not be interacting after applying T∞.
Note that the set of solitons of length ℓ is equivalent to S(r)(ℓ) up to removing vacuum states.
Example 2.9**.**
Let g be of type D5(2).
In this example and all subsequent examples, unless otherwise stated, we will evolve the SCA by T∞ (or Tℓ for ℓ≫1) and we omit the tensor products.
We give the evolution of the SCA starting with a state in S(1)(2,3,4):
[TABLE]
Next, we recall some conjectures about solitons.
First, we define g0,r roughly by removing the node r from the classical Dynkin diagram and taking the affine version of each of the remaining components, taking the twisted version if g was twisted.
More specifically, suppose g is of type XR(n)(t).
If g is of nonexceptional type except for r=n−2,n−1 in type Dn(1), then g0,r is of type Ar−1(1)⊗XR(n−r)(t).222We consider D3(1)=A3(1) and D2(1)=A1(1)×A1(1). Furthermore, we consider XR(1)(t)=A1(1) whenever XR(1)(t)=A2(2).
Because of the trivalent node in the classical Dynkin diagram of Dn, for type Dn(1), we have g0,n−1=g0,n, which has type An−1(1), and g0,n−2 of type An−3(1)×A1(1)×A1(1).
For type E6,7,8(1), we consider the untwisted affine version of g0,r (see Table 2).
Otherwise, g0,r for the r we consider is given by Table 3.
Let (γi)i∈I be given by Table 4 and
[TABLE]
Three of the fundamental questions about SCA are given as the following conjecture.333Two other fundamental questions include determining the soliton equations and an ultradiscrete description.
This has not been explicitly stated in the literature as far as the authors are aware, but it is known to experts.
Conjecture 2.10**.**
Consider an SCA using Br,1 of type g, and fix some integers ℓ1<ℓ2.
(1)
There exists a bijection Ψ between solitons of length ℓ and elements in
[TABLE]
of type gr,0, where σ=1 (resp. τ=1) if the remainder of ℓ/3 is at least 1 (resp. equals 2) and [math] otherwise.
2. (2)
The scattering rule of two solitons, a state in S(r)(ℓ1,ℓ2) evolving to S(r)(ℓ2,ℓ1) under sufficiently many time evolutions, is given by the combinatorial R-matrix
[TABLE]
of type g0,r.
3. (3)
The phase shift, the shift of the soliton positions after scattering compared to if there was no interaction, is given by
[TABLE]
where x∈B(r)(ℓ1) and y∈B(r)(ℓ2) correspond to the solitons given by Part (1) and Cr∈Z.
Remark 2.11**.**
Conjecture 2.10(1) can be considered an interpretation of the formulas given in [HKO*+*02b, App. B].
We make some remarks about Conjecture 2.10.
First, the ordering of the tensor factors in Part (1) does not matter by the combinatorial R-matrix.
Additionally, we can extend Part (1) to a more general case.
Definition 2.12** (Decoupling rule).**
Define
[TABLE]
We construct a bijection between S(r)(ℓ1,…,ℓk) and B(r)(ℓ1,…,ℓk) by applying the bijection Ψ from Part (1) on each soliton of a fixed state p∈S(r)(ℓ1,…,ℓk).
We call the resulting bijection the decoupling rule.
By slight abuse of notation, we also denote the decoupling rule by Ψ.
More explicitly, consider solitons b1,…,bk (in that order), then
[TABLE]
We also note that we have γˇr/γr′=1 only if g0,r=An−1(1).
Furthermore, the phase shift of one soliton is the negative phase shift of the other in two body scattering.
Example 2.13**.**
Consider an SCA starting with a state in S(1)(2,3) of type A3(1):
[TABLE]
We underline the positions how the solitons propagate under no interaction.
We note that the phase shift is ±2.
Under Conjecture 2.10(1), the two solitons correspond to 23⊗123∈B1,2⊗B1,3 in type A2(1).
We have R(23⊗123)=233⊗12 and H(23⊗123)=2, which agrees with Part (2) and Part (3).
2.3. Rigged configurations
Denote H0:=I0×Z>0. Fix a tensor product of KR crystals B=⨂k=1NBrk,sk.
A configuration\nu=\bigl{(}\nu^{(i)}\bigr{)}_{i\in I_{0}} is a sequence of partitions.
Let mℓ(i) denote the multiplicity of ℓ in ν(i).
Define the vacancy numbers
[TABLE]
where Ls(r) equals the number of factors Br,s that occur in B.
When there is no danger of confusion, we will simply write pℓ(i).
A B-rigged configuration is the pair (ν,J), where ν is a configuration and J=(Jℓ(i))(i,ℓ)∈H0 be such that Jℓ(i) is a multiset {x∈Z∣x≤pℓ(i)(ν;B)}444If g=A2n(2)† and i=n and i odd, then we take x∈Z+21. with ∣Jℓ(i)∣=mℓ(i) for all (i,ℓ)∈H0.
The integers in Jℓ(i) are called riggings or labels, and we can associate each rigging in Jℓ(i) to a row of length ℓ in ν(i).
The corigging or colabel of a rigging x∈Jℓ(i) is defined as pℓ(i)−x.
For any K⊆I, a K-highest weightB-rigged configuration is a rigged configuration (ν,J) such that minJℓ(i)≥0 (we define the minimum to be [math] when ∣Jℓ(i)∣=0) for all (i,ℓ)∈K×Z>0.
When K=I, we say the B-rigged configuration is highest weight.
Let RC∇(B) denote the set of all highest weight B-rigged configurations.
When B is clear, we call a B-rigged configuration simply a rigged configuration.
Next, let RC(B) denote the closure of RC∇(B) under the following crystal operators.
For simplicity of the exposition, we consider g to not be of type A2n(2) nor A2n(2)† and refer the reader to [SS15, Def. 3.1].
Fix a B-rigged configuration (ν,J) and i∈I0.
For simplicity, we assume there exists a row of length [math] in ν(a) with a rigging of [math].
Let x=min{minJℓ(i)∣ℓ∈Z>0}; i.e., the smallest rigging in ν(i).
**ei****: **
If x=0, then define ei(ν,J)=0.
Otherwise, remove a box from the smallest row with rigging x, replace that label with x+1, and change all other riggings so that the coriggings remain fixed.
The result is ei(ν,J).
**fi****: **
If the smallest corigging of ν(i) is [math], then define fi(ν,J)=0.
Otherwise, add a box from the largest row with rigging x, replace that label with x−1, and change all other riggings so that the coriggings remain fixed.
The result is fi(ν,J).
We finish the Uq(g0)-crystal structure on RC(B) by defining
Let B be a tensor product of KR crystals. Fix some (ν,J)∈RC∇(B). Let X(ν,J) denote the closure of (ν,J) under ei and fi for all a∈I0.
Then, we have X(ν,J)≅B(λ), where λ=wt(ν,J).
Rigged configurations also come with a natural statistics from mathematical physics called cocharge given by
[TABLE]
Cocharge is invariant under the classical crystal operators.
Fix a classical component X(ν,J) as given in Theorem 2.14.
Cocharge is constant on X(ν,J).
Next, fix B=(Br,1)⊗N, where r is a minuscule node.
We define a bijection Φ:RC(B)→B by repeating the process below for each factor from left to right.
Start at b=uΛr, and set ℓ0=1.
Consider step j.
Let ℓj denote the minimal ki≥ℓj−1 over all i∈I0 such that fib=0 and ν(i) has a singular row of length ki that has not been previously selected.
If no such row exists, terminate, set all ℓj′=∞ for j′≥j, and return b.
Otherwise, select such a row and repeat the above with fi′(b), where ν(i′) is the partition that the row was selected from.
We then construct δ(ν,J) by removing a box from all selected rows and keeping those rows singular.
We sketch the inverse bijection Φ−1 when r is a minuscule node.
This is given by adding factors right to left by starting at b and finding a path to uΛr by selecting the largest singular rows that were at most as large as the previously selected row.
We terminate when we reach uΛr.
When r∼0, the bijection Φ is similar to when r is minuscule except we are allowed to select a row twice when at a negative root and we can select a quasisingular row, a row such that the rigging equals pℓ(i)−1 and maxJℓ(i)=pℓ(i)−1, when going into yi for some i∈I0.
For the remaining nodes, we need the box-splitting map, which we do not describe here.
Instead, for a precise description of Φ, we refer the reader to [KSS02, OSSS17, OSS18, Scr17c].
We recall some conjectural properties of the bijection Φ (see, e.g., [SS15]).
We will need the map θ:RC(B)→RC(B) on highest weight rigged configurations that sends every rigging to its corresponding corigging and extended as a classical crystal isomorphism.
Conjecture 2.16**.**
Let B=⨂k=1NBrk,sk.
The map Φ:RC(B)→B is a classical crystal isomorphism such that cc=D∘Φ∘θ.
Conjecture 2.17**.**
Let B=⨂k=1NBrk,sk.
The diagram
[TABLE]
commutes for any reordering B′=⨂k=1NBrk′,sk′.
It is known that Conjecture 2.16 and Conjecture 2.17 hold in general for nonexceptional types An(1) [KSS02, OSSS17, OSS18].
These conjectures have been proven in a number of special cases for exceptional types [OS12, SS15, SS06, Scr16, Scr17c].
3. Solitons
In this section, we describe the solitons of length ℓ by using tensor products of KR crystals in a number of special cases.
Two particular cases we cover in general are when r is minuscule and r∼0.
We adopt the following notation.
Let (ϖr)r∈I0,r denote the fundamental weights of type g0,r.
Let ϖ=∑r′∼rϖr′ and uϖ=fruΛr.
Note that this is a slight abuse of notation, but uϖ is the unique I0,r-highest weight element of the unique Uq(g0,r)-crystal B(ϖ)⊆B(Λr).
Let vϖ denote the I0,r-lowest weight element of B(ϖ)⊆B(Λr).
Let u=u(Br,1) and v=v(Br,1).
Proposition 3.1**.**
Let r be a special node or r=1 for g of type Bn(1), Cn(1), A2n(2)†, or D4(3).
For a soliton p=b−L⊗⋯⊗b0∈S(r)(ℓ), we have
[TABLE]
where yr appears at most once.
Moreover, we have ℓ=L+mv+1, where mv is the number of factors equal to v in p.
Proof.
We claim H(b0⊗u)=1 if and only if b0=u in type Cn(1), A2n(2)† or b0∈B(ϖ) otherwise.
First, note that fr(b0⊗u)=b0⊗(fru) and fi(b0⊗u)=(fib0)⊗u for all i∈I0,r.
Recall that H is constant on classical components.
Thus, it remains to show the claim on all I0,r-highest weight elements, and we show this case by case.
For special nodes, the claim follows from Theorem 2.4.
For type Bn(1), we have f0f2f3⋯fnfn⋯f2(uϖ⊗u)=u⊗u and f0(v⊗u)=uϖ⊗u.
For type Cn(1), we have f0f12f2⋯fn⋯f2(uϖ⊗u)=u⊗uϖ and f0(v⊗u)=u⊗u.
For type A2n(2)†, we have f0f12f2⋯fnfn⋯f2(uϖ⊗u)=u⊗uϖ and f0(v⊗u)=u⊗u.
For types D4(3), this is a finite computation.
Note that b0=u by the definition of soliton.
We have H(uϖ⊗u)=1 in all cases, and thus we require E1(p)=1.
Since the local energy is nonnegative and E1(p) is the sum of local energy, if H(b0⊗u)≥2, we will have E1(p)≥2, so p is not a soliton.
Therefore, in order to have E1(p)=1, we need H(b0⊗u)=1.
Next, we must have H(b−1⊗b0)=0 in order to have E1(p)=1.
Recall that this implies b−1⊗b0 is in the I0-connected component of u⊗u, which is isomorphic to B(2Λr).
From Proposition 2.3, we have b−1≤b0.
Similarly, we must have bj≤bj+1 for all −L≤j<0.
From the definition of the length of a soliton, we have ℓ=L+mv+1.
∎
Example 3.2**.**
Consider type D4(3) and r=1, and note v=1, vω1=2, and y1=0.
Consider an SCA starting with a state in S(1)(1,2,3) of:
[TABLE]
Proposition 3.3**.**
Let r=1 and g of type Dn+1(2) or A2n(2).
For a soliton p=b−L⊗⋯⊗b0∈S(r)(ℓ), we have
[TABLE]
where y1 (and ∅) appears at most once and we consider v<∅.
Moreover, we have ℓ=L+mv+1.
Proof.
In both of these cases, we have 1∼0, and so the local energy is given by Theorem 2.5.
In particular, we have H(uϖ⊗u)=2.
Note that H(∅⊗∅)=2 and H(b⊗∅)=H(∅⊗b)=1 for all b∈B(Λr).
The remainder of the proof is similar to the proof of Proposition 3.1.
∎
We note that the description of a soliton for r=1 with g of nonexceptional type in Proposition 3.1 and Proposition 3.3 agrees with the description from [HKO*+*02a, Sec. 2.3] by [HKO*+*02a, Lemma 2.5].
Proposition 3.1 also covers the cases considered by [bM12, Yam04, Yam07].
The proofs are similar to ours except we use the uniform statements Theorem 2.4 and Theorem 2.5 to compute the local energy instead of type specific computations.
Example 3.4**.**
Consider an SCA starting with a state in S(1)(1,2,4) of type D4(2):
[TABLE]
Proposition 3.5**.**
Let g be of affine type except type An(1), Cn(1), Dn+1(2), A2n(2) or A2n(2)†.
Suppose r∼0.
For a soliton p=b−L⊗⋯⊗b0∈S(r)(ℓ), we have
[TABLE]
where ℓ=L+1 and
•
in type Bn(1), there is at most one xΛ1 or xΛ1−α1,
•
in type G2(1), there is at most one xα1+α2 or x2α1+α2.
Proof.
We have H(uϖ⊗u)=1.
We note that any r′∼r is a special node in g0,r.
Therefore, we have B(r)(s)≅B(sϖ) as Uq(g0,r)-crystals.
Next, we note that if H(b0⊗u)=1 then either b0∈B(ϖ) or b0=∅.
The proof of this is similar to the proof given in Proposition 3.1, and the lowest weight element is vϖ⊗u.
We note that we cannot have ∅⊗u as H(x⊗∅)=1 for all x∈B(Λr), which would give a state energy of at least 2.
Next, consider b−1⊗b0 with b1=u and for a fixed uϖ≤b0≤vϖ.
We claim H(b−1⊗b0)=0 if and only if b−1∈B(ϖ) and b−1≤b0.
For the exceptional types, this is a finite computation.
Thus, we assume g is of type Bn(1), Dn(1), A2n−1(2), or A2n(2)†, and we note that Proposition 2.3 holds for B(sϖ) in all of these cases (even if r′ is not necessarily minuscule).
If b−1∈B(ϖ) and b−1≤b0, then H(b−1⊗b0)=0 by Proposition 2.3 and that er2(uϖ⊗uϖ)=u⊗u.
To show the converse, we proceed by induction.
The base case is uϖ⊗b0, for which the claim immediately follows.
Assume the claim holds for some b−1⊗b0, and consider fi(b−1⊗b0)=(fib−1)⊗b0=0.
If i=r, then the claim follows from Proposition 2.3.
Next, for i=r, we must have frb0=0 since b−1≤b0.
However, this contradicts the tensor product rule, and hence we must have b−1∈X and b−1≤b0.
Similarly, we must have bi≤bi+1 for all −L≤j<0.
∎
We give an example of the computation of Proposition 3.5.
We note that B(Λ3) in type C3, which comes from F4(1), is also characterized by Proposition 2.3, but not B(Λ4) in type C4.
Consider an SCA starting with a state in S(2)(2,4) in type B4(1):
[TABLE]
Note that in this example, the phase shift is [math].
Proposition 3.5 yields the solitons as given in [MOW12, Prop. 8], and similar to the above, our proof is essentially the same as [MOW12, Prop. 8].
Our next result shows that Conjecture 2.10(1) holds for some special cases, which we show by direct computation.
Proposition 3.7**.**
Let r be a special node or g is not of type An(1) with r∼0.
There exists a Uq(g0,r)-crystal isomorphism
[TABLE]
Proof.
We first need to take care of the special case of type C2(1), where we define Ψ by
[TABLE]
where ℓ=m+2m, and extended as a Uq(g0,r)-crystal morphism.
It is straightforward to see that this is a Uq(g0,r)-crystal isomorphism as I0,r={1}.
We note that v and ∅ both have weight [math] as Uq(g0,r)-crystals and contribute 2 and 1, respectively, to the length of the soliton.
These are also the only elements that appear in the solitons that are not in B(ϖ).
Therefore, we define Ψ by
[TABLE]
where m+2m+m∗=ℓ (and m∗∈{0,1}), and extend as a Uq(g0,r)-crystal morphism.
Note that the defining condition of the solitons from Proposition 3.1, Proposition 3.3, or Proposition 3.5 and elements in B(kϖ) from Proposition 2.3 agree with the description of single row tableaux, which are given pairwise by x≤y for x⊗y with yr appearing at most once.
Therefore Ψ is a bijection by considering the classical decompositions of B(r)(ℓ).
It is clear that the Uq(g0,r)-weights agree and Ψ(fip)=fiΨ(p) for all i∈I0,r.
Hence, the map Ψ is a Uq(g0,r)-crystal isomorphism as desired.
∎
We can describe the map Ψ given by Proposition 3.7 explicitly using Kashiwara–Nakashima (KN) tableaux [FOS09, KN94] for r=2, which is adjacent to [math], in types A2n−1(2), Bn(1), and Dn(1).555For type B3(1), the map is slightly more complicated because the right factor should instead be BA1,⌊ℓ/2⌋⊗BA1,⌈ℓ/2⌉. This map is similar to the C2(1) for r=1 case, and we leave the details to the reader.
We consider type Dn(1) [MW13], but the other types are similar.
We have
[TABLE]
where BA1,ℓ is a KR crystal of type A1(1) and BD1,ℓ is a KR crystal of type Dn−2(1) and y↓ decreases all (barred) entries by 2 of
[TABLE]
Example 3.8**.**
Let g be of type B4(1), then we have
[TABLE]
where the image is in BA1,5⊗BB1,5 of type A1(1)×B2(1).
A similar description of Ψ exists for r=1 in types Cn(1), Dn+1(2), A2n(2), and A2n(2)† using KN tableaux.
In this case, it is a single row tableaux mapping to a single row tableaux, removing all 1 and ∅ entries, and decreasing all (barred) entries by 1.
In [MOW12, Prop. 8], the map Ψ was described explicitly for r=2 in type G2(1).
Proposition 3.9**.**
Fix r such that B(r)(ℓ)≅B(ℓϖ) as Uq(g0,r)-crystals.
Let p∈S(r)(ℓ).
Then we have Ek(p)=tr∨min(k,ℓ) and Tk(p) moves the soliton min(k,ℓ) steps to the left.
Proof.
Since B(r)(ℓ)≅B(ℓϖ), there exist a unique I0,r-highest weight element.
Therefore, we can apply ei, where i∈I0,r, as many times as possible to obtain the I0,r-highest weight element
[TABLE]
Note that H does not change and ei commutes with the combinatorial R-matrix.
Therefore, we have Ek(p′)=Ek(p).
Next, we note that our time evolution and local energy correspond to those for the box-ball system under identifying uΛr and uϖ with an empty box and a ball, respectively.
Hence, the claim follows from [FOY00, Lemma 4.1].
∎
Now we consider the case when g is of type Bn(1) and r=n.
We recall that Bn,1≅B(Λn) as Uq(g0)-crystals and B(Λn) is a minuscule representation.
Proposition 3.10**.**
Let r=n and g of type Bn(1).
Let v∗ denote the lowest weight vector in the Uq(g0,r)-subcrystal B∗ generated by u∗:=fnfn−1fnu.
For a soliton p=b−L⊗⋯⊗b0∈S(r)(ℓ), we have
[TABLE]
Moreover, we have ℓ=L+m∗+1, where m∗ are the number of elements in B∗ in the soliton.
Proof.
All classically highest weight elements in Bn,1⊗Bn,1 are of the form
[TABLE]
where the element on the left is written as a minuscule word.
A straightforward computation shows that H(u(k))=⌈k/2⌉.
Note that u(1)=uϖ⊗u and u(2)=u∗⊗u.
Since B(Λn) is a minuscule representation, the subset B(2Λn)⊆B(Λn)⊗B(Λn) is given by the elements x⊗y such that x≤y.
Thus, the remainder of the proof is similar to the proof of Proposition 3.1.
∎
Proposition 3.11**.**
Let g be of type Bn(1) and r=n.
Define u∗:=fnfn−1fnu.
There exists a Uq(g0,r)-crystal isomorphism
[TABLE]
where we remove the left factor if ℓ=1,
defined by
[TABLE]
Proof.
Since each u∗ contributes 2 to the length of the soliton, we have m∗≤ℓ/2.
It is straightforward to see that Ψ is an Uq(g0,r)-crystal morphism.
From [Ste01], the highest weight elements of B(⌊ℓ/2⌋ϖn−1)⊗B(⌈ℓ/2⌉ϖn−1) are given by
[TABLE]
Hence, the map Ψ is a Uq(g0,r)-crystal isomorphism.
∎
Example 3.12**.**
We begin with the spin representation of [KN94] (see also [BS17, HK02]) to represent elements of B(Λn), where the elements are given by a sequence (s1,…,sn) with si=±.
Next, we consider this to be the binary representation of an integer written in reverse order with +↦0 and −↦1.
For example, we have
[TABLE]
Thus, consider an SCA starting with an initial state in S(3)(1,3) in type B3(1):
[TABLE]
Note that the right soliton after scattering uϖ⊗u∗ is not connected to uϖ⊗uϖ by e1 and e2 operators.
Furthermore, we have
[TABLE]
Note that 46 and Φ(46) are I0,3-highest weight elements, but 66 another I0,r-highest weight element. This demonstrates the necessity of the two tensor factors as there is only a unique I0,3 highest weight element for any KR crystal Br,s of type A2(1).
Example 3.13**.**
Keeping the same conventions as Example 3.12, we give an SCA with an initial state in S(3)(1,3) in type B3(1):
[TABLE]
Also, we have Ψ(421)=\young(1,2)⊗\young(12,33).
Next, we consider r=1 for type G2(1).
The local energy on highest weight elements is given by
[TABLE]
We have H(b⊗b′)=0 if and only b≤b′ and we do not have b=b′=0.
Proposition 3.14**.**
Let r=1 and g of type G2(1).
For a soliton p=b−L⊗⋯⊗b0∈S(r)(ℓ), we have
[TABLE]
where [math] appears at most once.
Moreover, we have ℓ=L+m0+2(m3+m2), where mb denotes the number of occurrences of b in the soliton.
Proof.
This reduces to a computation of local energy on B1,1⊗B1,1, which is a finite computation.
∎
Proposition 3.15**.**
Let g be of type G2(1) and r=1.
Define
[TABLE]
where σ=1 (resp. τ=1) if the remainder of ℓ/3 is at least 1 (resp. equals 2) and [math] otherwise (we remove factors of Br′,0), by
[TABLE]
for
[TABLE]
where M=min{m3,m3} and d=m3−M+m2.
Then Ψ is a Uq(g0,r)-crystal isomorphism.
Proof.
We first consider I0,r-highest weight elements, where m3−m3≥0 and m2=0.
So we have M=m3 and d=0.
It is clear that Ψ is a weight preserving bijection and Ψ(p) is I0,r-highest weight.
For the general case, it is straightforward to see that Ψ commutes with the crystal operators.
∎
Example 3.16**.**
Consider p=233032, and so ℓ=11. Thus, we have σ=τ=1 and
[TABLE]
4. SCA using rigged configurations
In this section, we give a proof of Conjecture 2.10 using rigged configurations under various assumptions.
Throughout this section, we assume Conjecture 2.16 and Conjecture 2.17 hold.
We note that our results are known in general for type An(1) [FOY00, HHI*+*01, KOS*+*06, Sak08, Sak09, Yam04], some of which also use rigged configurations in their proofs, and generalize the other cases done in [bM12, HKO*+*02a, HKT00, MOW12, MW13, TNS99, Yam07].
We start with our first main result, where the partition ν(r) encodes the sizes of the solitons under Φ.
Theorem 4.1**.**
Suppose r is a special node or r∼0.
Consider a state b with solitons of type g of sizes ℓ1>ℓ2>⋯>ℓm that are sufficiently far apart (not necessarily in that order).
Then we have ν(r)=(ℓ1,ℓ2,…,ℓm), where (ν,J)=Φ(b).
Proof.
We first consider the case r is a minuscule node.
We note that when we add every box of a soliton, we add exactly one box to ν(r) as there is only one r arrow in the path from any entry of the soliton to uΛr or for ∅.
Because the solitons are sufficiently far apart, we can make the difference between the riggings Ji(r) and the vacancy numbers pi(r) as large as we want.
Therefore, we have precisely one singular row in ν(r) for each soliton and the length corresponds to the number of elements of the currently soliton we have added.
Next, when r∼0, we have x⊗y in a soliton if and only if x≤y by Proposition 3.1, Proposition 3.3, and Proposition 3.5.
Thus, when we add b0, we add a row of length equal to the number of r-arrows in the path from b0→u to ν(r) as there are no singular rows in ν(r), where we add the first box under Φ−1.
Thus, the newly added row is the only singular row in ν(r) as the solitons are far apart.
Therefore, for each subsequent bi, we can select at most the same rows that were previously selected by bi+1.
Hence, all boxes added to ν(r) are in the same row and the claim follows.
For r=1 in type Bn(1), the proof is similar to the minuscule case.
For r=n in type Cn(1), we note that the only box in the column (x1,…,xn) that would change ν(n) is n<xn<1 as xk<n for all k<n.
Moreover, the addition of xn only adds a single box to ν(n), and hence the proof is similar to the minuscule case.
∎
Theorem 4.1 suggests the following as an equivalent definition of solitons.
This suggested equivalence also comes from the description of solitons from inverse scattering transform and the R-matrix invariance of rigged configurations (see Proposition 4.3 below).
Conjecture 4.2**.**
Let p be a state and (ν,J)=Φ−1(p).
Then p corresponds to a soliton of length ℓ if and only if ν(r)=(ℓ).
Moreover, Theorem 4.1 holds for all r∈I0.
We can now give a description of time evolution on rigged configurations.
Let As denote the map on rigged configurations given by adding min(i,s) to all riggings Ji(r) for all i∈Z≥0.
The following was shown in [KOS*+*06, Prop. 2.6] (see also [KSY11, Thm. 5.2]), and we include a proof for completeness.
Proposition 4.3**.**
We have
[TABLE]
Proof.
Let us=u(Br,s).
Consider a state b and (ν,J)=Φ−1(b).
We claim Φ−1(b⊗us)=(ν,J′)=As(ν,J), where J′ is formed by adding min(i,s) to all riggings in Ji(r) for all i.
This follows from the fact that Φ is only based upon the coriggings, and that after adding us, we still have the empty rigged configuration.
Thus, every subsequent step is the same as for Φ−1 applied to b except pi(r) has increased by i for all i∈Z≥0, and the claim follows from the fact that we make every changed row singular.
Next, we have \Phi^{-1}(b\otimes u_{s})=\Phi^{-1}\bigl{(}u_{s}\otimes T_{\infty}(b)\bigr{)} from Conjecture 2.17.
Furthermore, from the definition of Φ−1, we have \Phi^{-1}\bigl{(}u_{s}\otimes T_{\infty}(b)\bigr{)}=\Phi^{-1}\bigl{(}T_{\infty}(b)\bigr{)}, and the claim follows from Theorem 4.1.
∎
We use rigged configurations to give an alternative (and uniform) proof of Proposition 3.9 and the conservation laws.
These were shown in [FOY00, Thm. 3.2], where the proof given is also uniform using the Yang–Baxter equation.
Proposition 4.4**.**
Suppose Conjecture 4.2 holds.
For p∈S(r)(ℓ), we have Es(p)=tr∨min(s,ℓ) and Ts(p) moves the soliton min(s,ℓ) steps to the left.
Proof.
Let (ν,J)=Φ(p), and note that ν(r)=(ℓ) from Conjecture 4.2.
From Proposition 4.3, \Phi^{-1}\bigl{(}T_{s}(p)\bigr{)} differs from Φ−1(p) by adding min(s,ℓ) to the rigging Jℓ(r).
Thus, we have nonvacuum factors min(s,ℓ) steps earlier under Φ−1.
Moreover, the image of the soliton under Φ−1 must be the same as Φ−1 only depends on the coriggings.
Hence Ts(p) moves the soliton min(s,ℓ) steps to the left.
Next, we note that \operatorname{cc}\bigl{(}A_{s}(\nu,J)\bigr{)}-\operatorname{cc}(\nu,J)=t_{r}^{\vee}\min(k,\ell).
We consider the state p truncated to K≫1 factors, which we denote by pK.
From the definition of energy, we have
[TABLE]
since R\bigl{(}u_{s}\otimes T_{s}(p_{K})\bigr{)}=p_{K}\otimes u_{s} and D(us)=0.
Note that (\theta\circ\Phi^{-1})\bigl{(}u_{s}\otimes T_{s}(p_{K})\bigr{)}=(\nu,J) since As preserves coriggings and the extra us factor increases the vacancy numbers pi(r) by min(i,s).
Hence, we have Es(pK)=tr∨min(s,ℓ) since cc=D∘Φ∘θ.
∎
It is clear that Ts∘Ts′=Ts′∘Ts from Proposition 4.3 and the description of As.
Next, we have
[TABLE]
by Proposition 4.4.
Therefore, we have Es∘Ts′=Es.
∎
We now prove the desired decoupling rules using rigged configurations.
Proposition 4.6**.**
Let B=⨂i=1NBr,si of type g.
Let μ={s1,…,sN} be a partition and
[TABLE]
of type gr,0, where σi=1 (resp. τi=1) if the remainder of si/3 at least 1 (resp. equals 2) and [math] otherwise.
Then, the map
[TABLE]
where mμ=∣{(ν,J)∈RC∇(B)∣ν(r)=μ}∣,
given by deleting ν(r) is a Uq(g0,r)-crystal isomorphism.
Proof.
For I0,r-highest weight rigged configurations, this follows from the definition of the vacancy numbers.
The remaining cases follow from the definition of the crystal operators on rigged configurations.
∎
We note that Proposition 3.7 follows immediately from Theorem 4.1 and Proposition 4.6.
Moreover, Equation (4.1) is the decoupling rule on rigged configurations.
Thus, we have a proof of Proposition 3.7 using rigged configurations.
Example 4.7**.**
Consider soliton p from Example 3.8. The corresponding rigged configuration (ν,J) under Φ is
[TABLE]
Therefore, we have
[TABLE]
in RC(B1,5) in type A1(1)×B2(1). Therefore, we have
[TABLE]
which agrees with Ψ(p).
Lemma 4.8**.**
We have B(r)(ℓ)≅B(ℓϖ) as Uq(g0,r)-crystals if and only if for all r′∼r, we must have r′ a special node and γˇr/γr′∈Z.
Proof.
This is a straightforward check.
∎
Proposition 4.9**.**
Fix an r such that B(r)(ℓ)≅B(ℓϖ) as Uq(g0,r)-crystals.
Let S(r)(ℓ1,…,ℓk;K) denote the truncation of states in S(r)(ℓ1,…,ℓk) to (Br,1)⊗K from (Br,1)⊗∞.
For K≫1, the diagram
Next, assume it holds for k−1.
We note that Φ−1, B(r), and Ψ are Uq(g0,r)-crystal isomorphisms, so it is sufficient to consider the case when we have a I0,r-highest weight element.
Additionally, note that there is a unique I0,r-highest weight element uℓ1∈B(r)(ℓ1).
Consider a state p∈S(r)(ℓ1,…,ℓk;K).
Therefore, the rightmost soliton of p is uϖ⊗ℓk, which maps to uℓ1 under Ψ.
Let p=p⊗uϖ⊗ℓk.
Let
[TABLE]
We obtain (ν,J) from (ν,J) by adding min(i,ℓk) to each rigging of Ji(r′) for all r′∼r as adding u\bigl{(}\mathcal{B}^{(r)}(\ell_{k})\bigr{)} does not change the rigged configuration.
Next we consider how (ν,J) differs from (ν,J).
We note that adding uϖ⊗ℓk only adds a single row of length ℓk to ν(r) similar to the proof of Proposition 3.7.
Since the solitons are far apart, we never change this row, so it does not affect the remaining steps of Φ−1 other than the final riggings.
Hence, the riggings Ji(r′) are min(i,ℓk) larger than the riggings Ji(r′) for all r′∼r.
Hence, we have B(r)∘Φ−1=Φ−1∘Ψ by induction.
∎
We expect a similar proof to work in general, but describing the difference between (ν,J) and (ν,J) is more complicated.
Next, we give our second main result, a proof of scattering using rigged configurations.
Theorem 4.11**.**
Suppose Conjecture 4.10 holds.
Let Ψ:S(r)(ℓ1,ℓ2)→B(r)(ℓ1,ℓ2), where ℓ1>ℓ2.
Then we have
[TABLE]
for k≫1.
Proof.
Fix some k≫1.
Let S(r)(ℓ1,ℓ2)k denote the set of states p such that T∞k(p)∈S(r)(ℓ2,ℓ1).
Let RC(S) denote the image of the states S under Φ−1, which is well defined since adding the left factors of u1 does not change the rigged configuration under Φ−1.
Consider the cube
[TABLE]
We first show the back face commutes.
Considering the path of B(r)∘A∞k, we first change the riggings associated with the partition ν(r), and then B deletes the partition ν(r).
Therefore, we have the new rigged configurations \operatorname{RC}\bigl{(}\mathcal{B}^{(r)}(\ell_{2},\ell_{1})\bigr{)} without the partition ν(r).
Next, if we begin with the path of B(r) and id, we will delete the partition ν(r) first by B(r) and then change nothing by id, so we will also get the rigged configurations \operatorname{RC}\bigl{(}\mathcal{B}^{(r)}(\ell_{2},\ell_{1})\bigr{)}.
Hence, we have B(r)∘A∞k=id∘B(r) as desired.
The top face commutes by Proposition 4.3.
The bottom face commutes by our assumption that Conjecture 2.17 holds.
The left and right faces commute by Conjecture 4.10.
Hence, by [KSS02, Lemma 5.3] and that Φ is a bijection, the front face commutes as desired.
∎
Finally, we give our last main result: a description of the phase shift and a proof using rigged configurations.
Theorem 4.12**.**
Fix an r such that B(r)(ℓ)≅B(ℓϖ) as Uq(g0,r)-crystals.
Consider a two soliton state with solitons s1 and s2 of lengths ℓ1<ℓ2.
The phase shift is
[TABLE]
where r′∼r.
Proof.
Note that for B(r)(ℓ)≅B(ℓϖ) as Uq(g0,r)-crystals, for all r′,r′′∼r, we have Arr′=Arr′′, so the statement is well defined.
Moreover, our assumptions satisfy the assumptions of Proposition 4.9 (and hence, Conjecture 4.10 holds).
Consider a state b∈S(r)(ℓ1,ℓ2) with ℓ1<ℓ2 and is I0,r-highest weight, and let (ν,J)=Φ−1(b).
Let s1 and s2 denote the solitons of length ℓ1 and ℓ2 respectively.
Without loss of generality, assume there are no vacuums to the right of s2.
By Proposition 3.7/Proposition 4.6, it is sufficient to consider p to be a I0,r-highest weight states.
We modify the vacancy numbers by
[TABLE]
and note that for B=(Br,1)⊗κ, we have pi(a)=Pi(a)+δarκ.
Let ζ denote the starting position of the right soliton s2 and j denote the rigging of Jℓ2(r).
By our assumptions, we have \Psi(s_{2})=u\bigl{(}\mathcal{B}^{(r)}(\ell_{2})\bigr{)}; in particular, the only nonempty partition of Φ(s2) is ν(r)=(ℓ2) with rigging j=−ζ=−ℓ2.
Let
[TABLE]
which is the rigging of Jℓ2(r) after k time evolutions.
We choose k≫1 such that Φ(ν,J)∈S(r)(ℓ2,ℓ1): we have two solitons of length ℓ2>ℓ1 that are not interacting.
Let ξ be such that =ξ+Pℓ2(r), and so
[TABLE]
is the position of the left soliton s2.
Note that
[TABLE]
since ℓ1<ℓ2 and by Lemma 4.8.
Note that each box added to ν(r′) when performing Φ on b⊗uℓ2ϖ in type g0,r corresponds to an r′ arrow from b to uℓ1ϖ.
Moreover, we add one to the local energy for each of these r′ arrows by Theorem 2.4.
Hence, we have H\bigl{(}\Psi(s_{1})\otimes\Psi(s_{2})\bigr{)}=\sum_{r^{\prime}\sim r}\lvert\nu^{(r^{\prime})}\rvert.
Thus, the phase shift is
[TABLE]
for some r′∼r as desired.
∎
From the proof above, observe that the phase shift is determined by the change in the vacancy number Pℓ2(r) by adding the soliton s1 under Φ.
Example 4.13**.**
Consider an SCA in type E6(1) with an initial sate in S(1)(1,2), where we separate tensor factors with ‘∣’:
which agrees with the phase shift of 2⋅1−1=1.
Furthermore, the corresponding rigged configuration (ν,Jt) after t time evolutions is
[TABLE]
where we write the vacancy number of the left and the rigging on the right of each partition (we omit the vacancy numbers pi(1)).
Note that P2(1)(ν)=−3 and P1(1)(ν)=−2.
In contrast, the rigged configuration Φ(256⊗246)=(ν,J) is
[TABLE]
and we have P2(1)(ν)=−2.
Note that P2(1)(ν)−P2(1)(ν)=1, which agrees with the phase shift.
5. Summary
In this section, we summarize the cases that are proven by our results.
We continue assuming that Conjecture 2.16 and Conjecture 2.17 hold.
We note that Conjecture 4.2 is equivalent to Conjecture 2.10(1) by Proposition 4.6 and Proposition 4.9.
Conjecture 4.2/Theorem 4.1 holds for all special nodes and r∼0 in all affine types.
for all I0 in every simply-laced type, A2n−1(2), and D4(3);
•
r=n in type Bn(1);
•
r=1,2,3 in type E6(2); and
•
r=2 in type G2(1).
Therefore, Conjecture 2.10(2, 3) holds in these cases for those nodes which are adjoint or special in the above list.
If we additionally assume Conjecture 4.2, then Conjecture 2.10(2, 3) holds for all cases in the above list.
Next, we discuss some aspects of the phase shift.
As mentioned above, the phase shift is precisely how the vacancy number Pℓ2(r) changes when adding the second soliton.
Furthermore, using the results of this paper, we can construct SCA where the phase shift is negative: the larger soliton is shifted to the right (equivalently, the smaller soliton is shifted to the left) by 1 step after scattering.
This is a phenomenon that had only been previously observed in types D4(3) [Yam07] and G2(1) [MOW12].
Example 5.1**.**
Consider a state p∈S(2)(1,3) in type E6(1) such that
[TABLE]
Note that H\bigl{(}\Psi(p)\bigr{)}=3, and so the resulting phase shift is δ=2⋅2+(−1)⋅3=−1.
Explicitly, we have the SCA
[TABLE]
where
[TABLE]
Example 5.2**.**
Consider an SCA starting with a state in S(2)(1,3) in type D4(1), B4(1), or A9(2):
[TABLE]
Finally, we note that Conjecture 2.10(3) requires a little bit of care when defining what the positions of the solitons are.
We first consider an SCA in type C3(1) with an initial state in S(1)(1,2):
[TABLE]
In this case, note that
[TABLE]
but after scattering, the phase shift appears to be 2 for the left soliton and 1 for the right soliton.
However, we can fix this by considering the left soliton to consist of the right nonvacuum element, so the resulting phase shift is 2⋅1−1=1.
In this example, note that if the soliton 1 was concentrated at one point, we should get to t=3 before the solitons start to interact.
Instead, they begin to interact at t=3, as if there is an additional 1 linked together with the 1; in other words, we should consider the soliton 1 instead as 11.
With this modification, we see the phase shift would indeed be 1 for the left soliton.
As another example, consider an initial state in S(1)(3,4) in type C3(1):
[TABLE]
Here, we have
[TABLE]
If, after scattering, we consider the left soliton to consist of the two right nonvacuum elements and add a nonvacuum to the right soliton, then the phase shift is precisely 2⋅3−2=4.
As in the previous example, we see them interacting at t=2, when the two solitons are still separated by multiple vacuum elements.
This can be seen by the fact that the carrier has not returned the maximal element when it reaches the next soliton (see also Example 2.8).
This is indicating that every 1 should be linked with a 1 as part of the soliton.
With this interpretation, we obtain the description of the solitons in type Cn(1) given in [HKO*+*02a, Sec. 2.3] (see also [HKT00, Sec. 3.2]).
This would also yield the desired phase shift of 2.
Contrast this with the (conjectural) definition of solitons from Definition 2.7 and the rigged configurations under Φ.
Indeed, under Φ the 1 should be a soliton with doubled weighting as removing the 1 removes two boxes from ν(1) (assuming ν(1) is a single row as we consider the single soliton case here).
We give one more example with an initial state in S(1)(2,4) in type C3(1):
[TABLE]
where we have
[TABLE]
and a phase shift of 2⋅2−2=2.
For additional examples for this soliton in type Cn(1), see [HKO*+*02a, Ex. 4.6] and [HKT00, Ex. 3.5,3.6].
Acknowledgments
The authors thank Atsuo Kuniba and Masato Okado for valuable discussions and comments on an earlier version of this paper.
The authors thank Ben Salisbury for comments on an earlier version of this paper.
This work benefited from computations using SageMath [Dev17, SCc08].
The authors would like to thank the referee for comments on our paper.
Appendix A Examples with SageMath
We give some examples using SageMath [Dev17], which has been implemented by the second author (the examples given here are using [Scr17b]).
We begin with the code used to construct Example 3.4.
Appendix B Classical single row crystals for types E6,7
Proposition B.1**.**
The classically highest weight elements in B1,s⊗B1,s′, where B1,s and B1,s′ are of type E6(1), are given by
[TABLE]
where k1+k2+k3=s and k2+k3≤s′.
Proof.
As noted in the proof [JS10, Lemma 3.1], the {2,3,4,5,6}-highest weight elements in B(sΛ1) are of the form
[TABLE]
with ε1(b)=k2+k3.
Note that us′Λ1=[01,…,01] is the unique classically highest weight element in B1,s′ and that φ1(us′Λ1)=s.
By the tensor product rule, e1(b⊗us′Λ1)=0 if and only if k2+k3≤s′.
Similarly, we have ei(b⊗usΛ1)=0 for all i∈{2,3,4,5,6}.
Next, by the tensor product rule, any highest element in B1,s⊗B1,s′ must be of the form b⊗us′Λ1.
Note that εi(usΛ1)=0 for all i∈{2,3,4,5,6}, so b must be a {2,3,4,5,6}-highest weight element.
Therefore, we have described all classically highest weight elements above.
∎
Proposition B.2**.**
The classically highest weight elements in B7,s⊗B7,s′, where are B7,s⊗B7,s′ are of type E7(1), are given by
[TABLE]
where k1+k2+k3+k4=s and k2+k3+k4≤s′.
Proof.
As noted in the proof [JS10, Lemma 3.1], the {1,2,3,4,5,6}-highest weight elements in B(sΛ7) are of the form
[TABLE]
with ε1(b)=k2+k3+k4.
Note that us′Λ7=[7,…,7] is the unique classically highest weight element in B7,s′ and that φ1(us′Λ7)=s.
By the tensor product rule, e7(b⊗us′Λ7)=0 if and only if k2+k3+k4≤s′.
Similarly, we have ei(b⊗usΛ7)=0 for all i∈{1,2,3,4,5,6}.
Next, by the tensor product rule, any highest element in B7,s⊗B7,s′ must be of the form b⊗us′Λ7.
Note that εi(usΛ7)=0 for all i∈{1,2,3,4,5,6}, so b must be a {1,2,3,4,5,6}-highest weight element.
Therefore, we have described all classically highest weight elements above.
∎
Bibliography83
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[Bax 89] Rodney J. Baxter. Exactly solved models in statistical mechanics . Academic Press Inc. [Harcourt Brace Jovanovich Publishers], London, 1989. Reprint of the 1982 original.
2[Bet 31] H. Bethe. Zur Theorie der Metalle. Zeitschrift für Physik , 71(3-4):205–226, 1931.
3[BFKL 06] Georgia Benkart, Igor Frenkel, Seok-Jin Kang, and Hyeonmi Lee. Level 1 perfect crystals and path realizations of basic representations at q = 0 𝑞 0 q=0 . Int. Math. Res. Not. , pages Art. ID 10312, 28, 2006.
4[BK 00] Arkady Berenstein and David Kazhdan. Geometric and unipotent crystals. Geom. Funct. Anal. , Special Volume, Part I:188–236, 2000. GAFA 2000 (Tel Aviv, 1999).
5[BK 07] Arkady Berenstein and David Kazhdan. Geometric and unipotent crystals. II. From unipotent bicrystals to crystal bases. In Quantum groups , volume 433 of Contemp. Math. , pages 13–88. Amer. Math. Soc., Providence, RI, 2007.
6[b M 12] Mahathir bin Mohammad. Scattering rules in soliton cellular automata associated with U q ( D n ( 1 ) ) subscript 𝑈 𝑞 superscript subscript 𝐷 𝑛 1 U_{q}(D_{n}^{(1)}) -crystal B n , 1 superscript 𝐵 𝑛 1 B^{n,1} . J. Phys. A , 45(7):075208, 22, 2012.
7[Bou 77] J. Boussinesq. Essai sur la théorie des eaux courantes. Mémoires preséntés par divers savants á l’Acad. des Sci. Inst. Nat. France , XXIII(1):1–680, 1877.
8[BS 17] Daniel Bump and Anne Schilling. Crystal bases . World Scientific Publishing Co. Pte. Ltd., Hackensack, NJ, 2017. Representations and combinatorics.