|
Brief communications
On symmetrizers in quantum matrix algebras
D. I. Gurevicha, P. A. Saponovbc, V. V. Sokolova a Institute for Information Transmission Problems of the Russian Academy of Sciences, Moscow
b National Research University Higher School of Economics
c Institute for High Energy Physics, Protvino
Received: 01.05.2023
1. In this note we deal with a particular class of quadratic algebras, which are called quantum matrix algebras. Recall that by a quadratic algebra one means a quotient algebra A=T(V)/⟨J⟩, where V is a vector space over the complex field C, dimCV=N<∞, T(V)=⨁k⩾0V⊗k is the free tensor algebra, generated by V, and ⟨J⟩ is the ideal generated by the subspace J⊂V⊗2. The algebraic properties of such algebras and of their inhomogeneous counterparts are intensively discussed in the mathematics literature (see, for instance, [4]). In this note we consider the problem of constructing some projections onto homogenous components of such algebras, which are analogues of usual symmetrizers. In the classical case such symmetrizers are defined via the flip P. Below, the role of P is played by the so-called Hecke symmetries. Recall that an operator R:V⊗2→V⊗2 is called a braiding if it is subject to the braid relation
R12R23R12=R23R12R23,R12=R⊗I,R23=I⊗R
(here and below I denotes the identity operator in V or another vector space). If a braiding R satisfies the complementary relation (R−qI)(R+q−1I)=0, where q∈C, then R is called a Hecke symmetry. In what follows we assume additionally that qk≠1 for all k∈Z+. In [1] many Hecke symmetries were constructed and symmetrizers for the R- symmetric and R-skew-symmetric algebras of the space V were defined.
2. Well-known examples of quadratic algebras related to R-matrices are the RTT- algebra and the reflection equation (RE) algebra. The first of them is defined by the system
RT1T2=T1T2R,T1=T⊗I,T2=I⊗T,
where T=‖tji‖1⩽i,j⩽N is an N×N matrix, whose entries generate the RTT-algebra. A method for constructing other matrix algebras was proposed in [3]. The main aim of this note is to present a method which hopefully enables one to construct symmetrizers onto homogeneous components of RTT-algebras and other matrix algebras. We illustrate this method by several low-dimensional examples. The defining system (1) can be written in the form T1T2=R(T1T2), where R(T1T2)=R−1T1T2R. If R is a Hecke symmetry, then the operator R:W⊗2→W⊗2, where W=span(tji), has three eigenvalues, 1, −q2, and −q−2. Hence the operator S=2−2q(R+q2I)(R+q−2I), where kqdef=(qk−q−k)/(q−q−1), k∈Z, is an idempotent, called a symmetrizer. It maps the space W⊗2 onto its subspace of symmetric elements, that is, elements such that S(z)=z. Thus, each element z of the second homogeneous component A(2) of the quadratic algebra A=T(W)/⟨J⟩ is equal to its symmetrized form S(z) modulo the ideal ⟨J⟩, where J=Im(R−I). The third-order symmetrizer S(3):W⊗3→W⊗3 projecting onto the homogeneous component A(3)⊂A, was constructed in [2]:
S(3):=αS12S23S12S23S12+βS12S23S12+γS12=αS23S12S23S12S23+βS23S12S23+γS23,
where the coefficients α, β, and γ satisfy the equality α+β+γ=1. Here and in what follows the subscripts of an operator indicate the indices of the components of the tensor product where the operator is applied. Since the operator S(3) defined by (2) has the property
S(3)=S12S(3)=S(3)S12=S23S(3)=S(3)S23,
it can be written in the form S(3)=p(S12S23)=p(S23S12), where p is a polynomial of degree 3. The minimal polynomial of the operator S12S23 is of the form
m3(x)=x(x−1)(x−122q)(x−(22q−2)224q).
Consequently, the operator p(S12S23)/κ, where p(x)=m(x)(x−1)−1 and κ=p(1), projects W⊗3 onto the subspace corresponding to the eigenvalue 1. Note that formula (3) enables one to compute all coefficients in (2).
3. Now we construct the next symmetrizer S(4):W⊗4→W⊗4. To do this, first we compute the minimal polynomial m4(x) for the operator S(3)123S(3)234:W⊗4→W⊗4. It is the fifth-order polynomial m4(x)=x(x−1)(x−ν1)(x−ν2)(x−ν3), where
ν1=132q,ν2=(22q−2)24⋅32qandν3=(32q−3)24⋅34q.
Substituting the product S(3)123S(3)234 into the polynomial p4(x)=m4(x)(x−1)−1, we obtain (after a proper normalization) the required symmetrizer S(4). It can be verified that the answer does not depend on the order of factors: p4(S(3)123S(3)234)=p4(S(3)234S(3)123). Hopefully, a similar procedure enables one to find all higher symmetrizers. Provided that S(n) is known, we define S(n+1) as follows:
S(n+1)1,2,…,n+1=κ−1n+1pn+1(S(n)1,2,…,nS(n)2,3,…,n+1),pn+1(x)=mn+1(x)(x−1)−1,
where mn+1(x) is the minimal polynomial of the operator S(n)1,2,…,nS(n)2,3,…,n+1 and κn+1=pn+1(1) is a normalizing factor. This procedure is based on the conjecture that 1 is a simple root of the polynomial mn(x) for any n. Presumably, the degree of mn(x) is n+1 for a generic q, but in the limit q=1 it becomes equal to 3. This conjecture is justified by our computations for n=5,6,7. The roots of m5(x) are 0, 1, and the following numbers:
ν1=142q,ν2=(2⋅22q−5)29⋅24q,ν3=(2⋅22q−5)29⋅42qandν4=(42q−4)29⋅44q.
It would be interesting to find a regular pattern in the series of the polynomials mn(x). Note that the existence of a symmetrizer S(n) entails the following claim. If a Hecke symmetry R=R(q) is an analytic matrix-function of q in a neighbourhood of q=1, then in some neighbourhood of q=1 the dimensions of the homogenous components A(n) are equal to those for q=1.
|
|
|
Bibliography
|
|
|
1. |
D. I. Gurevich, Leningrad Math. J., 2:4 (1991), 801–828 |
2. |
D. Gurevich, P. Pyatov, and P. Saponov, St. Petersburg Math. J., 20:2 (2009), 213–253 |
3. |
A. Isaev, O. Ogievetsky, and P. Pyatov, J. Phys. A, 32:9 (1999), L115–L121 |
4. |
A. Polishchuk and L. Positselski, Quadratic algebras, Univ. Lecture Ser., 37, Amer. Math. Soc., Providence, RI, 2005, xii+159 pp. |
Citation:
D. I. Gurevich, P. A. Saponov, V. V. Sokolov, “On symmetrizers in quantum matrix algebras”, Russian Math. Surveys, 78:4 (2023), 785–787
Linking options:
https://www.mathnet.ru/eng/rm10111https://doi.org/10.4213/rm10111e https://www.mathnet.ru/eng/rm/v78/i4/p203
|
Statistics & downloads: |
Abstract page: | 494 | Russian version PDF: | 39 | English version PDF: | 70 | Russian version HTML: | 179 | English version HTML: | 173 | References: | 113 | First page: | 20 |
|