Weak Faddeev-Takhtajan-Volkov algebras; Lattice $W_n$ algebras
Farrokh Razavinia

TL;DR
This paper explores the construction of lattice $W_n$ algebras using Poisson brackets, universal variables, and computational tools, advancing the understanding of algebraic structures in mathematical physics.
Contribution
It introduces a new Poisson bracket on $sl_2$, constructs lattice $W_n$ algebras systematically, and provides computational methods for their analysis.
Findings
Construction of a new Poisson bracket on $sl_2$
Development of lattice $W_n$ algebra structures
Implementation of Mathematica code for algebra analysis
Abstract
In this paper, we will start by looking through our project's historical general view and then we will try to construct a new Poisson bracket on our simplest example and then we will try to give a universal construction based on our universal variables and then will try to construct lattice algebras which will play a key role in our other constructions on lattice algebras and finally we will try to find the only nontrivial dependent generator of our lattice algebras and so on for lattice algebras. And at the end of this paper, we will have appendix A, which will contain some parts of the Mathematica coding which we have used and have made for to find our algebra structures.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Topics in Algebra · Advanced Combinatorial Mathematics
Weak Faddeev-Takhtajan-Volkov algebras; Lattice algebras;
Farrokh Razavinia***Farrokh Razavinia1
1Department of discrete mathematics,
Moscow Institute of Physics and Technology (MIPT)
††† The author would like to thank Professor Yaroslav Pugai for his helpful discussion during the preparation for this paper.
1 ‡‡‡ subjclass[2010]: Primary 16D10, 17B37, 81R50; Secondary 20G42. §§§keywords: Lattice W algebras, quantum groups, Feigin’s homomorphisms, Mathematica.
Abstract.
In this paper, we will start by looking through our project’s historical general view and then we will try to construct a new Poisson bracket on our simplest example and then we will try to give a universal construction based on our universal variables and then will try to construct lattice algebras which will play a key role in our other constructions on lattice algebras and finally we will try to find the only nontrivial dependent generator of our lattice algebras and so on for lattice algebras.
And at the end of this paper we will have appendix A, which will contain some parts of the Mathematica coding which we have used and have made for to find our algebra structures.
1. Introduction
There is an old problem which has been considered and introduced by Boris Feigin in 1992. It has been born in its new formulation; on quantum Gelfand-Kirillov conjecture; in a public talk at RIMS in 1992 based on the nilpotent part of i.e. for a simple Lie algebra.
Now, this problem is known as “Feigin’s Conjecture”.
In the mentioned talk, Feigin proposed the existence of a certain family of homomorphisms on the quantized enveloping algebra which will led us to a deffinition of lattice algebras.
These “homomorphisms” has been turned to a very useful tool for to study the fraction field of quantized enveloping algebras. [6]
There have been many attempts to construct lattice -algebras in Feigin’s sence, which ensures the simplicity of the construction process of lattice -algebra; for example the best known articles in the subject has been written by Kazuhiro Hikami and Rei Inoue who tried to obtain the algebra structure by using lax operators and generalized R matrices. [7] [8]
Or Alexander Belov and Alexander Antonov and Karen Chaltikian, who first tried to follow Feigin’s construction but finaly they also solved part of the conjecture by getting help of lax operators, and it made it very difficult to follow their publication.[9] [10]
But here, in this paper, we will proceed and will introduce the simplest way of constructing such kind of algebras by just employing Feigin’s homomorphisms and screening operators by defining a Poisson bracket on our variables just based on our Cartan matrix. [1] [2]
We have to note that in [2], Yaroslav Pugai has constructed lattice algebras already, but here we will introduce its weaker version based on our newly defined Poisson bracket, constructed just based on the Cartan matrix , which will make our job easier and more elegant.
For to do this, let us set an arbitrary symmetrizable Cartan matrix of rank and let be the standard maximal nilpotent sub-algebra of the Kac-Moody algebra associated with .
So is generated by elements which are satisfying in Serre relations, [11] Where stands for .
In [1], we proved that screening operators ; for generators of the commutative ring and for the ’s components of our Cartan matrix ; are satisfying in quantum Serre relations for adjoint action and , [5], for and , for the root lattice and for a free Abelian group of rank with basis and be the linear space spanned by . [5] will be called dual weight lattice and the Cartan subalgebra. And will stand for our ground field.[5]
Here for our Cartan matrix , the quantum Serre relation will be
Where stands for quantum number .
And again as what we had in [1], we can define
U_{q}(n):=\big{\langle}S_{X_{i}^{ji}},S_{X_{k}^{jk}}\mid(\text{ad}_{q}(S_{X_{i}^{ji}}))^{2}(S_{X_{k}^{jk}})=0\big{\rangle},
and for the quantum polynomial ring in one variable and twisted tensor product , we can define
U_{q}(n)\bar{\otimes}\mathbb{C}_{q}[X_{l}^{jl}]:=\big{\langle}S_{X_{i}^{ji}},S_{X_{k}^{jk}},X_{l}^{jl}\mid(\text{ad}_{q}(S_{X_{i}^{ji}}))^{2}(S_{X_{k}^{jk}})=0
,S_{X_{i}^{ji}}X_{l}^{jl}=q^{2}X_{l}^{jl}S_{X_{i}^{ji}},S_{X_{k}^{jk}}X_{l}^{jl}=q^{-1}X_{l}^{jl}S_{X_{k}^{jk}}\big{\rangle}
such that we have the following embeding
[TABLE]
where \mathbb{C}_{q}[X_{l}^{jl}]\bar{\otimes}\mathbb{C}_{q}[X_{m}^{jm}]=\mathbb{C}\big{\langle}X_{l}^{jl},X_{m}^{jm}\mid X_{l}^{jl}X_{m}^{jm}=q^{a_{lm}}X_{m}^{jm}X_{l}^{jl}.[1]
Which will ensure the well-definedness of our definition of lattice algebras.
2. Weak Faddeev-Takhtajan-Volkov algebras
As it has been mentioned already in [1], the main tools which we will use, are difference equations, screening operators, Feigin’s homomorphisms, adjoint actions, partial differential equations, and Cartan matrices.
We know that from an abstract view is an algebra related to the Cartan matrix , for and so for it will consist of just one row and one column, i.e. we have and let us denote by the skew polynomial ring on generators labeled by and the defining commutation relations with all having the same color.
Definition 2.1**.**
Let’s define our Poisson bracket as follows in the case of :
[TABLE]
The main problem is to find solutions of the system of difference equations from infinite number of non-commutative variables in quantum case and commutative variables in classical case. It is significant that commutation relations (2.1) depend just on the sign of the difference and is based on our Cartan matrix. We should try to find all solutions of the system:
[TABLE]
Let us define our system of variables as follows
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
And let us equip this system of variables with lexicographic ordering, i.e. if and if . And we need this kind of ordering because we have different kind of set of variables with a proper coloring such that each set has its own color different from its neighbors.
We have , a multi-variable function depend on ’s for and comes from
[TABLE]
where is related to our Cartan matrix and is a screening operator on one of our variable sets, i.e. . Then we will obtain the whole set of solutions by using the following shift operator:
[TABLE]
[TABLE]
[TABLE]
Definition 2.2**.**
Let us define our lattice W-algebra based on its generators according to [2] [1].
Generators of lattice W-algebra associated with simple Lie algebra constitute of the functional basis of the space of invariants
[TABLE]
with additional requirements
[TABLE]
where and will be specified later.
Equation (2.4) means that the generators have to satisfy in quantum Serre relations and the first equation in (2.6) means that they should have zero degree.
Here in this paper we just will work on the case where and we will use instead of . Where stands for in .
2.1. Lattice algebra
Let us first consider the case and to simplifying the notations, let us consider our set of variables as .
And as it has shown in [1], it is enough just to work with , because the other parts for and will tend to zero.
By setting , for the Planck constant , we will try to find generators of our lattice -algebra, in the case of .
**First step:
**First let us try to find .
For to do this and for simplicity, we will set . And as it has been defined already, we have
[TABLE]
Now for to understand what is (2.7), we note that and also we note that our function is a polynomial function consist of powers of . What I mean is that, it is enough to find on just powers of for different values of .
So
[TABLE]
Where according to rules which has been pointed out in [1], we have
Where by setting and letting at the end, we will have:
First case: ;
;
Second case: ;
.
Third case: ;
.
And so we have
So we found which is as follows and we can omit 2, because finally we will make the action equal to zero and we can cancel 2 from both sides. So we have
[TABLE]
**Second step:
**Now we will try to find .
For to find , we note that it resembles the degree of our polynomial function. So if for example acts on , then we should get .
So let us define:
[TABLE]
and then we have;
.
Which gives us
and on the other side we have
Which gives us
.
And it shows that is well defined.
Now the only thing that remains is just to find the solutions of the following system of 2-linear homogeneous equations in one unknown :
[TABLE]
Now the goal is to find such which satisfies in our system of equations (2.11).
The second equation ensures that the solution has degree 0 and also the partial differentials will give us a multi-variable function dependent on just .
The system of PDEs (2.11) can be solved using the procedure described in Chapter V, Section IV of [3].
And after doing some calculation in mathematica it become clear that the system (2.11) has only one functional dependent nontrivial solution:
[TABLE]
And again as before, goes back to 2 in and is a default index which will be used later for to employ shifting operator.
According to the number of variables, we will have two shifts and then everything will be in a loop.
So here in case we have three solutions for our system of linear equations which belong to the fraction ring of polynomial functions:
[TABLE]
We go to define our non-commutative Poisson algebra according to definition of Poisson brackets given by Poisson himself [4] with the difference that here we work on commutative ring , based on the generators which are the solutions of PDEs system .
For to do this we will use the following bracket:
[TABLE]
where is our previously defined Poisson bracket on our set of variables.
For instance in the case of we have
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
So we have
[TABLE]
And it is enough to find our brackets just based on the first generator, because after that we are able to find other brackets based on the other generators, so for in an almost same process we have:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We have to note that we almost are done with our Poisson algebra in case, but for the further plan i.e. to find our Volterra system, the differential-difference chain of non-linear equations
[TABLE]
where stands for [2], we have to write down the brackets in terms of their decompositions to ’s for .
So we need to write it as the decomposition of our generators and it will be done by using the Mathematica coding which we have produced in Appendix A.
And the result is as follows:
[TABLE]
This result is weaker than the Faddeev-Takhtajan-Volkov algebra which has been mentioned in [2] and if we continue this for , then we will have again a weaker version of what which has been mentioned in [2].
2.2. Lattice algebra
In this case we will use the following defined Poisson bracket based on Cartan matrix A_{2}=\left[\begin{array}[]{cc}2&-1-1&2\\ \end{array}\right], but for to do this according to our previous ordering and list of variables, let us for simplicity set our variables as follows
Set and .
Definition 2.3**.**
Let’s define our Poisson bracket as follows in the case of :
[TABLE]
And instead of we will have the following commutation relations
[TABLE]
And we will get the following equations in a same manner as in :
First case: ;
Second case: ;
[TABLE]
As in case we will try to find as follows:
.
Now let us as usual suppose and then we will define the following quantities.
Here for s we have:
.
And the same will be for s.
And for the different quantities and s we have:
First case: for we have
.
Second case: for we have
According to what has just mentioned we have
.
And
And in a same way we can find the desired results for and .
So let us define
[TABLE]
And then we will have
[TABLE]
And
[TABLE]
And
[TABLE]
And finally we get
.
For we have
For we have
For we have
And after all these, let us define
.
And finally let us define
.
**Next step:
**Now let us try to find :
For , let us define as follows:
For we have
For we have 0.
Let us again have the following definitions
[TABLE]
[TABLE]
[TABLE]
Now let us define
[TABLE]
And now as before we have
.
And in a same way we are able to define and . So let us define
[TABLE]
Then we will have
[TABLE]
And
[TABLE]
And
[TABLE]
So we will have
.
And therefore as in (2.11) we will have the following system of s
[TABLE]
And according to appendix A, we have the following functional dependent nontrivial solution for the whole system of s (2.24)
[TABLE]
And again as before, goes back to 3 in the and is a default index which later we will use it for to employ our shifting operators.
According to the number of variables, we will have 6 shifts and then after that it will be in a loop.
So here in case we have six solutions which belong to the fraction ring of polynomial functions.
[TABLE]
Where .
Again by setting and and and according to we have to write down the following brackets as a composition of s, because of the algebra structure and it will be done by using Mathematica coding in appendix A.
[TABLE]
2.3. Lattice algebra; main generator
In this case we will use the following defined Poisson bracket (2.28) based on Cartan matrix
A_{3}=\left[\begin{array}[]{ccc}2&-1&0-1&2&-10&-1&2\\ \end{array}\right].
But for to do this according to our previous ordering and list of variables, and the same as what we have done in case, let us for simplicity of the calculations, order the set of our variables as follows:
Set and and and so on.
Definition 2.4**.**
Let’s define our Poisson bracket as follows in the case of :
[TABLE]
And instead of (2.1) we will have the following commutation relations for and as always :
[TABLE]
And by using the same approach as in the and case, it become clear that the equations , and and also , and will have the following forms:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
And the functional dependent nontrivial solutions for the whole system of first order partial differential equation is as follows:
[TABLE]
And again as before, goes back to 4 in the and is a default index which later we will use it for to employ our shifting operators.
According to the number of variables, we will have 9 shifts and then after that it will be in a loop.
So here in case we have nine solutions:
;
which belong to the fraction ring of polynomial functions.
2.4. Lattice algebra; main generator
In this case we will use the following defined Poisson bracket based on Cartan matrix
A_{4}=\left[\begin{array}[]{cccc}2&-1&0&0-1&2&-1&00&0&-1&2\\ \end{array}\right].
But for to do this according to our previous ordering and list of variables, and the same as what we have done in case, let us for simplicity in the calculations, order the set of our variables as follows:
Set and and and .
Definition 2.5**.**
Let’s define our Poisson bracket as follows in the case of :
[TABLE]
And instead of we will have the following commutation relations for and as always :
[TABLE]
And by using the same approach as , and case , it become clear that the equations , , and and also , , and will have the following forms:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
And the functional dependent nontrivial solution for the whole system of first order partial differential equation is as follows:
[TABLE]
And again as before, goes back to 5 in the and is a default index which later we will use it for to employ our shifting operators.
According to the number of variables, we will have 12 shifts and then after that it will be in a loop.
So here in case we will have twelve solutions just as what we did in the case, and here we skip to write them down.
2.5. Lattice algebra; main generator
Here for , we skip writing down all steps which we have been done in the previous sections and we just will write down the main generator of the lattice algebra.
The functional dependent nontrivial solution for the whole system of the first order partial differential equations will be as what comes in follow:
[TABLE]
[TABLE]
We should notice that s are different of each other for any
Acknowledgement
The research in this paper would have taken far longer to complete without the encouragement from many others. It is a delight to acknowledge those who have supported me over the last three years during the preparation of this paper.
I would like to thank Prof. Yaroslav Pugai, for his guidance and relaxed, thoughtful insight.
I thank all of the Institute for information transmission problems (Kharkevich Institute)’s staff for their hospitality over the last year.
I am particularly thankful for the help and advice of Prof. Brendan Godfrey, without whom the learning Mathematica would have been very much steeper and unimaginable.
And I would like to thank Prof. Boris Feigin for suggesting me this interesting problem and enlightening discussions during the preparation for my first paper which was my first step in this subject!
And finally, I would like to thank Prof. Alexei Kanel-Belov for his support and for whom I will always be indebted for being a constant source of inspiration and for the great talent and patience which he has always guided me with.
3. Appendix A
*Brendan B. Godfrey * and *Farrokh Razavinia *
This section has been completed by getting help from professor Brendan B. Godfrey from the Institute for Research in Electronics and Applied Physics (The University of Maryland), indirect communications and discussions through email, and also through a series of questions and discussions in Mathematica StackExchange.
And I have to say that without his great Mathematica skills, it nearly was impossible to get such interesting results!
In this appendix, you will find some parts of Mathematica codings which we have used to obtain our algebra structures.
And we believe that what is written in this appendix can open a new approach in solving the following system of linear homogeneous equations in one unknown .
[TABLE]
Where the coefficients are functions of independent variables and do not contain the unknown function . [3]
And we have to mention that, to reach to this point was impossible without using Mathematica!
3.1. Lattice algebra
.
As you see DSolve returns un-evaluated i.e. it means that it is not able to solve our system of first order partial differential equations.
Consequently, the dimensionality of this problem can be reduced from six to four.
Although DSolve cannot solve these equations as a pair either. But it can solve each separately.
The first results indicates that is a function of
and also
The second list of functions can be simplified by
Now the next step is to combine the previous two expressions for for to obtain a single expression, presumably as a function of two variables.
The system of PDEs above can be solved using the procedure described in Chapter V, Sec IV of Goursat’s Differential Equations [3].
The first step is to find the complete, non-commutative group of differential operators that includes and .
which by inspection is independent of and . On the other hand, and do not yield independent equations, again by inspection. Thus is a complete group of three operators in four independent variables. From this information alone, we know that is an arbitrary function of precisely one first integral. This first integral can be obtained by systematically eliminating variables and equations, one pair at a time, until a single equation of two variable remains. We start by solving any one of the equations.
and use the solution as the basis for a change of variables:
indicating that is independent of . This leaves us with two equations in three variables
Proceeding as before, we next solve one of and . (We choose the simpler one.)
and use it as the basis for a further change of variables.
indicating that is independent of . This leaves us with one equation in two variables.
Finally, yields
Transforming back to the original independent variables gives
Finally, designating the solution for as ,
3.2. Lattice algebra
.
Again returns un-evaluated, meaning that it can not solve the system of equations.
As before, this computation can be simplified by the substitution,
in which case the six equations become
As before, this system of first-order can be solved by using the procedure described in Chapter V, Sec IV of Goursat’s Differential Equations.
The first step is to find the complete, non-commutative group of differential operators that includes , , and . To do so, we use the function , generalized from
which are independent of the first three operators, increasing the size of the group to five. vanishes identically and so does not add an operator. On the other hand, the seven additional commutators involving and yield expressions that are linear combinations of . Thus, these five operators comprise the entire group.
From this information alone, we know that is an arbitrary function of precisely one first integral. This first integral can be obtained by systematically eliminating variables and equations, one pair at a time, until a single equation of two variable remains. Start by solving any one of the equations.
Final solution
3.3. Expressing a fractional multivariate polynomials to its low-order polynomial decomposition
Suppose we have given the following question.
Question:
Let be fractional multivariate polynomial as follows
and also let and be given as follows
then express as a low - order polynomial in and .
This can be done as follows.
First, generate a generic low order polynomial.
and then use SolveAlways. After about twenty seconds we will gwt result
And we have the final solution
which is the desired result.
And for completeness we have
Also here we have much faster alternative:
Because SolveAlways determines the coefficients for any , Solve must be able to obtain the same values for the coefficients for specific values of , and much faster. As before we do have and and .
Question:
Let be fractional multivariate polynomial as follows
and also let , , , , and be given as follows
then express as a low - order polynomial in , , , , and .
Which is the desired result.
And as before for completeness we have
By using Groebner Basis:
Also there is another way for to reach to the solution by using Groebner Basis. But this approach is very slow!
Now let us compute Groebner Basis
The remainder gives a representation of poly in terms of , , , , and .
Where is our solution in , , , , and . And the following code validates correctness:
And please note that, this may take a while. (May be more than a while! It depends on how powerful is your computer. )
3.4. Checking symmetries in our shift operators
. First, before starting, we need to know which variables are employed in our functions. For to do this we employ the following code:
Set
and
Then by using the following code we will obtain the set of our variables which have been employed
Now in what comes below, we specifically mean that for example in in a process for finding , the substitution
[TABLE]
instead of
[TABLE]
transforms to , to , to , and to while leaving unchanged.
Therefore, those four pairs must enter the expression for symmetrically.
As a result, the generic polynomials we have been using above, can be reduced greatly in numbers of terms, a factor of . Corresponding running time then should be reduced by a factor of , other things being equal. It is possible that additional symmetries exist! It needs to be checked!
Here for simplification and for to be able in codding them, we write instead and ;
**Checking symmetries in F6: **
We can find the set of variables in a same way as what we did for and so here we omit most of the calculations.
Again as in , here we specifically mean that the substitution
instead of
transforms to , to , to while leaving unchanged.
Therefore, those three pairs must enter the expression for symmetrically.
555Farrokh Razavinia, Department of discrete mathematics, Moscow Institute of Physics and Technology, Institutskiy per., 9, Dolgoprudny, Moscow Oblast, Russia
1
666Brendan B. Godfrey, Institute for Research in Electronics and Applied Physics (The University of Maryland), College Park, United States of America
2
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Antonov, A., Belov, A.A. and Chaltikian, K., 1997. Lattice conformal theories and their integrable perturbations.// Journal of Geometry and Physics, 22(4), pp.298-318.
- 2[2] Belov, A.A. and Chaltikian, K.D., 1993. Lattice analogues of W-algebras and classical integrable equations.// Physics Letters B, 309(3-4), pp.268-274.
- 3[3] Berenstein, A., 1996. Group-like elements in quantum groups, and Feigin’s conjecture.// ar Xiv preprint q-alg/9605016.
- 4[4] Caressa, P., 2000. The algebra of Poisson brackets.// In Young Algebra Seminar, Roma Tor Vergata.
- 5[5] Feigin, B.L. //talk at RIMS 1992.
- 6[6] Faddeev, L. and Volkov, A.Y., 1993. Abelian current algebra and the Virasoro algebra on the lattice. //Physics Letters B, 315(3-4), pp.311-318.
- 7[7] Gainutdinov, A.M., Saleur, H. and Tipunin, I.Y., 2014. Lattice W-algebras and logarithmic CF Ts. //Journal of Physics A: Mathematical and Theoretical, 47(49), p.495401.
- 8[8] Goursat, E., 1916. A Course in Mathematical Analysis: pt. 2. Differential equations.//[c 1917 (Vol. 2). Dover Publications.
