This paper characterizes monomials in Nichols braided Lie algebras of diagonal type, establishing a connection between monomial connectivity and algebra membership, and provides bases and dimensions for finite Cartan types.
Contribution
It introduces a criterion for monomials in Nichols braided Lie algebras and computes bases and dimensions for finite Cartan type cases.
Findings
01
A monomial belongs to Nichols braided Lie algebra if and only if it is connected.
02
A basis for Nichols braided Lie algebra is constructed.
03
Dimensions of Nichols braided Lie algebra for finite Cartan types are determined.
Abstract
Assume that V is a braided vector space with diagonal type. It is shown that a monomial belongs to Nichols braided Lie algebra L(V) if and only if this monomial is connected. A basis of Nichols braided Lie algebra and dimension of Nichols braided Lie algebra of finite Cartan type are obtained.
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 · Nonlinear Waves and Solitons
Full text
Basis of Nichols Braided Lie Algebras
Weicai Wu a, Jing Wang b and Shouchuan Zhang c
a. Department of Mathematics, Zhejiang University
Hangzhou 310007, P.R. China
b. Department of mathematics, School of Science,Beijing Forestry University,
Assume that V is a braided vector space with diagonal type. It is shown that a monomial belongs to Nichols braided Lie algebra L(V) if and only if
this monomial is connected. A basis of Nichols braided Lie algebra and dimension of Nichols braided Lie algebra of finite Cartan type
are obtained.
The question of finite-dimensionality of Nichols algebras dominates an important part of the recent developments in the theory of (pointed) Hopf algebras(see e.g. [AHS08, AS10, He05, He06a, He06b, WZZ15a, WZZ15b]. The interest in this problem comes from the lifting method by Andruskiewitsch and Schneider to classify finite dimensional (Gelfand-Kirillov) pointed Hopf algebras, which are generalizations of quantized enveloping algebras of semi-simple Lie algebras.
The classification of arithmetic root systems is obtained in [He05] and [He06a].
It is proved in [WZZ15b] that Nichols algebra B(V) is
finite-dimensional if and only if Nichols braided Lie algebra L(V) is finite-dimensional.
The theory of Lie superalgebras has been developed systematically,
which includes the representation theory and classifications of
simple Lie superalgebras and their varieties [Ka77] [BMZP92]. In many physical applications or in pure mathematical
interest, one has to consider not only Z2- or Z-
grading but also G-grading of Lie algebras, where G is an
abelian group equipped with a skew symmetric bilinear form given
by a 2-cocycle. Lie algebras in symmetric and more general
categories were discussed in [Gu86] and [GRR95].
A sophisticated multilinear version of the Lie bracket was
considered in [Kh99] [Pa98]. Various generalized Lie
algebras have already appeared under different names, e.g. Lie
color algebras, ϵ Lie algebras [Sc79], quantum and
braided Lie algebras, generalized Lie algebras [BFM96],
H-Lie algebras [BFM01] and braided m-Lie algebras [ZZ03].
In this paper it is shown that a monomial belongs to Nichols braided Lie algebra L(V) if and only if
this monomial is connected. A basis of Nichols braided Lie algebra and dimension of Nichols braided Lie algebra of finite Cartan type
are obtained for a braided vector space V with diagonal type.
This paper is organized as follows. In Section 1 we provide some preliminaries and set our notations. In Section 2 we obtain that a monomial belongs to L(V) if and only if
this monomial is connected when V is a braided vector space with diagonal type. In Section 3 we obtain a basis of Nichols braided Lie algebra.
In Section 4 we obtain dimension of Nichols braided Lie algebra L(V)
with finite Cartan type. In Section 5 we find some non-zero monomials in Nichols algebras. In Section 6 we give relations between connected components of graphes and Nichols Braided Lie Algebras.
Preliminaries
Let B(V) be the Nichols algebra generated by vector space V. Throughout this paper braided vector space V is of diagonal type with basis
x1,x2,⋯,xn and C(xi⊗xj)=pijxj⊗xi, n>1 without special announcement.
Define linear map p from B(V)⊗B(V) to F such that
p(u⊗v)=χ(deg(u),deg(v)), for any homogeneous element u,v∈B(V).
For convenience, p(u⊗v) is denoted by puv. Let puv:=puvpvu.
Denote ord(puu) the order of puu with respect to multiplication. Let ∣u∣ denote length of homogeneous element u∈B(V).
Let D=:{[u]∣[u] is a hard super-letter }, Δ+(B(V)):={deg(u)∣[u]∈D},
Δ(B(V)):=Δ+(B(V))∪Δ−(B(V)),
which is called the root system of V.
If Δ(B(V)) is finite,
then it is called an arithmetic root system. Let L(V) denote the braided Lie algebras generated by V in B(V) under Lie operations [x,y]=yx−pyxxy, for any homogeneous elements x,y∈B(V). (L(V),[]) is called Nichols braided Lie algebra of V. The other notations are the same as in [WZZ15a].
Recall the dual B(V∗) of Nichols algebra B(V) of rank n
in [He05, Section 1.3]. Let yi be a dual basis of xi. δ(yi)=gi−1⊗yi, gi⋅yj=pij−1yj and Δ(yi)=gi−1⊗yi+yi⊗1. There exists a bilinear map
<⋅,⋅>: (B(V∗)#FG)×B(V)⟶B(V) such that
<yi,uv>=<yi,u>v+gi−1.u<yi,v> and <yi,<yj,u>>=<yiyj,u>
for any u,v∈B(V). Furthermore, for any u∈⊕i=1∞B(V)(i),
one has that u=0 if and only if <yi,u>=0 for any 1≤i≤n.
We have the braided Jacobi identity as follows:
[TABLE]
[TABLE]
Γ(V) be the generalized Dynkin diagram of V omitted pxi,xi,pxi,xj for 1≤i,j≤n, which is called pure generalized Dynkin diagram of V.
Let u=h1h2⋯hm be a monomial with hj=xij for 1≤i1,i2,…,im≤n,1≤j≤m. deg(u)=λ1e1+⋯+λnen, where deg(xi)=ei. Let degxi(u):=λi. Let μ(u):={xi1,⋯,xim} and Γ(u) be a pure generalized Dynkin sub-diagram generated by μ(u).
If Γ(u)
is connected and phi,hi=1 for 1≤i≤m, then u is called connected (or μ(u) is called connected).
If hihi+1=phi+1hihi+1hi, then h1h2⋯hm=phi+1hih1h2⋯hi+1hi⋯hm and h1h2⋯hi+1hi⋯hm is called an elementary quantum equivalent of h1h2⋯hi+1hi⋯hm. If v1 is a monomial and vj+1 is an elementary quantum equivalent of vj for 1≤j≤r−1, then vr is called a quantum equivalent of v1, written as v1∼vr. This is an equivalent relation since hihi+1=phi+1hihi+1hi if and only if phi+1hiphihi+1=1.
If there exist xi∈μ(u) and xj∈μ(v) such that pxi,xj=1, then we say that it is connected between monomial u and monomial v, written u∘v in short.
Throughout, Z=:{x∣x is an integer}.R=:{x∣x is a real number}.
N0=:{x∣x∈Z,x≥0}.N=:{x∣x∈Z,x>0}. F denotes the base field, which is an algebraic closed field with characteristic zero. F∗=F\{0}. Sn denotes symmetric group, n∈N. For any set X, ∣X∣ is the cardinal of X. int(a) means the biggest integer not greater than a∈R.
2 The structure of Nichols braided Lie algebras
In this section we obtain that a monomial belongs to L(V) if and only if
this monomial is connected when V is a braided vector space with diagonal type.
Lemma 2.1**.**
Assumed that u,v,w are homogeneous elements in L(V). Let a,b,c,d,e,f denote 1−pwvpvw,1−puwpwu,1−puvpvu,1−puvpvupuwpwu,1−puvpvupwvpvw,1−pwvpvwpuwpwu, respectively. If ∣{r∣r∈{uv,uw,vw} and r∈L(V)}∣≥2 and ∣{t∣t∈{a,b,c} and t=0}∣≥1, then
uvw,uwv,vwu,vuw,wuv,wvu∈L(V).
Proof. Without loss of generality, we let uv,uw∈L(V). If vuw∈/L(V), then e=0,f=0 by
[WZZ15b, Lemma 3.2(i)] and [WZZ15a, Lemma 4.12]. If a=0, then b=0,c=0, which is a contradiction. If a=0, then b=0,c=0, one obtains a contradiction to [WZZ15b, Lemma 3.1]. Consequently, vuw∈L(V). Similarly, we can obtain others. □
Lemma 2.2**.**
Assume hi∈{x1,⋯,xn} for 1≤i≤m.
(i)* If it is disconnected between monomial u and monomial v (i.e. pxi,xj=1 for any xi∈μ(u), xj∈μ(v) ), then [u,v]=0.*
(ii)* If μ(h1h2⋯hm) is disconnected, then σ(h1,h2,⋯,hm)=0 for any method σ of adding bracket on h1,h2,⋯,hm..*
(iii)* If h1h2⋯hm=0 and μ(h1h2⋯hm) is disconnected, then h1h2⋯hm∈/L(V).*
Proof. (i) u and v are quantum commutative
(i.e. uv=pu,vvu ) since xixj=pxi,xjxjxi for any xi∈μ(u), xj∈μ(v).
(ii) We show this by induction on m. [h2,h1]=[h1,h2]=0 for m=2. For m>2,σ(h1,h2,⋯,hm)=[σ1(hτ(1)hτ(2)⋯hτ(t)),σ2(hτ(t+1)hτ(t+2)⋯hτ(m))],τ∈Sm. If both hτ(1)hτ(2)⋯hτ(t) and hτ(t+1)hτ(t+2)⋯hτ(m) are connected, then it is disconnected between hτ(1)hτ(2)⋯hτ(t) and hτ(t+1)hτ(t+2)⋯hτ(m). By Part (i), σ(h1,h2,⋯,hm)=0.
If either hτ(1)hτ(2)⋯hτ(t) or hτ(t+1)hτ(t+2)⋯hτ(m) is disconnected,
then either σ1(hτ(1)hτ(2)⋯hτ(t))=0 or σ2(hτ(t+1)hτ(t+2)⋯hτ(m))=0 by inductive hypothesis.
(iii) It follows from Part (ii).
□
Lemma 2.3**.**
(i) If u is a monomial, then there exist monomials u1,u2,…,ur such that u∼u1u2⋯ur for {Γ(u1),Γ(u2),⋯,Γ(ur)} is complete set of a connected component of Γ(u) with deg(u)=i=1∑rdeg(ui) and ∣u1∣≥∣u2∣≥⋯≥∣ur∣, (which is called a decomposition of connected components of u)
(ii) If a monomial u is connected with ∣u∣>1, then there exist two connected monomials v and w such that v∘w with u∼vw.
Proof. (i) If u is connected, it is clear. If u is not connected, we show it by induction on ∣u∣. It is clear when ∣u∣=1. Now assume ∣u∣>1. Let Ω:={v∣v is connected }. Let u=v1v2v3 and v2 be in Ω such that ∣v2∣=max{∣v∣∣v∈Ω}.
If v3∈F∗, then v2v3∼v3v2. If v2v3=kv3v2 for ∀k∈F∗, then there exists t such that v2∘hit with
v3=hi1⋯hir and v2his∼hisv2 for 1≤s<t. Consequently, u∼w1v2hitw3 and v2hit is connected. which is a contradiction. Consequently, v2v3∼v3v2.
If v1∈F∗, then v1v2∼v2v1. If v1v2=kv2v1 for ∀k∈F∗, then there exists t such that hit∘v2 with
v1=hi1⋯hir and v2his∼hisv2 for t+1<s≤r. Consequently, u∼w1hitv2w3 and hitv2 is connected. which is a contradiction. Consequently, v1v2∼v2v1.
Thus u=v1v2v3∼v2v1v3 and v1v3∼u2u3⋯ur is a decomposition of connected components of v1v3 since ∣v1v3∣<∣u∣. Set u1:=v2.
(ii) Let u=h1h2⋯hm and h2⋯hm∼u1u2⋯ur be a decomposition of connected components of h2⋯hm.
Consequently, h1u1⋯ur−1 is connected since h1∘ui for 1≤i≤r.
□
Theorem 2.4**.**
Assume hi∈{x1,⋯,xn} and ph1,h1=1 when hi=h1 for 1≤i≤m.
(i)
If h1⋯hb,hb+1⋯hm∈L(V) and
h1⋯hb∘hb+1⋯hm with h1⋯hb=0 or hb+1⋯hm=0,
then there exist τ∈Sm such that h1⋯hm∼hτ(1)⋯hτ(m) with
hτ(1)⋯hτ(m−1)∈L(V)* and hτ(1)⋯hτ(m−1)∘hτ(m),
or with hτ(2)⋯hτ(m)∈L(V) and hτ(2)⋯hτ(m)∘hτ(1).*
(ii)
If h1h2⋯hm−1∈L(V) and h1h2⋯hm−1∘hm or h2h3⋯hm∈L(V) and h2h3⋯hm∘h1, then h1h2⋯hm∈L(V).
(iii) If 0=h1h2⋯hm∈L(V), then there exists τ∈Sm such that h1⋯hm∼hτ(1)⋯hτ(m) with 0=hτ(1)hτ(2)⋯hτ(m−1)∈L(V) and hτ(1)hτ(2)⋯hτ(m−1)∘hτ(m), or 0=hτ(2)hτ(3)⋯hτ(m)∈L(V) and hτ(2)hτ(3)⋯hτ(m)∘hτ(1) .
(iv)
If monomial u is connected, then u∈L(V).
Proof.
We show (i), (ii), (iii) and (iv) by induction on the length of ∣h1h2⋯hm∣=m.
Assume m=2. (i) and (iv) are clear. If h1=h2, then (ii), (iii) follows from [WZZ15a, Lemma 4.12], [WZZ15a, Lemma 5.2], respectively. If h1=h2, then (ii) and (iii) follow from [WZZ15a, Lemma 4.3] and [He05, Lemma 1.3.3(i)].
Now m>2.
(i) If b=m−1 or b=1, let τ=id. Now assume that 1<b<m−1. There exist 1≤a≤b and b+1≤c≤m such that pha,hc=1.
(1). Assumed that h1⋯hb=0, we proceed by induction over b.
We know there exist τ∈S1,…,b such that h1⋯hb∼hτ(1)⋯hτ(b) with
(a) 0=hτ(1)⋯hτ(b−1)∈L(V), hτ(1)hτ(2)⋯hτ(b−1)∘hτ(b)
or with
(b) 0=hτ(2)⋯hτ(b)∈L(V), hτ(2)hτ(3)⋯hτ(b)∘hτ(1) by hτ(1)⋯hτ(b)∈L(V) and induction hypotheses of (iii).
(a)1. If hb+1⋯hm∘hτ(b), then
hτ(b)hb+1⋯hm∈L(V) by induction hypotheses of (ii), and hτ(1)⋯hτ(b−1)∘hτ(b)hb+1⋯hm since
hτ(1)hτ(2)⋯hτ(b−1)∘hτ(b). It is proved since
∣hτ(1)⋯hτ(b−1)∣=b−1<b and induction hypotheses.
(a)2. If all j1∈{b+1,…,m} such that p~hτ(b),hj1=1, then
hτ(b)hb+1⋯hm∼hb+1⋯hmhτ(b). On the other hand, we know hτ(1)⋯hτ(b−1)∘hb+1⋯hm since
h1⋯hb∘hb+1⋯hm,
then hτ1τ(1)⋯hτ1τ(b−1)hτ1(b+1)⋯hτ1(m)∈L(V), hτ(1)⋯hτ(b−1)hb+1⋯hm∼hτ1τ(1)⋯hτ1τ(b−1)hτ1(b+1)⋯hτ1(m) for some τ1∈Sτ(1),…,τ(b−1),b+1,…,m by the induction hypotheses of (i) and (ii). We know hτ1τ(1)⋯hτ1τ(b−1)hτ1(b+1)⋯hτ1(m)∘hτ(b) since
hτ(1)hτ(2)⋯hτ(b−1)∘hτ(b). We obtain
h1⋯hm∼hτ(1)⋯hτ(b)hb+1⋯hm
=hτ1τ(1)⋯hτ1τ(b−1)hτ1τ(b+1)⋯hτ1τ(m)hτ1τ(b) by hτ1(b+1)⋯hτ1(m)=hτ1τ(b+1)⋯hτ1τ(m) since τ∈S1,2,…,b,
and
hτ1τ(b)=hτ(b) since τ1∈Sτ(1),τ(2),…,τ(b−1),b+1,…,m. Set
[TABLE]
then we obtain hτ′(1)⋯hτ′(m−1)∈L(V),hτ′(1)⋯hτ′(m−1)∘hτ′(m) and
h1⋯hm∼hτ′(1)⋯hτ′(m) for some τ′∈S1,…,m.
(b)1. If hτ(2)⋯hτ(b)∘hb+1⋯hm, then hτ1τ(2)⋯hτ1τ(b)hτ1(b+1)⋯hτ1(m)∈L(V) and hτ(2)⋯hτ(b)hb+1⋯hm∼hτ1τ(2)⋯hτ1τ(b)hτ1(b+1)⋯hτ1(m) for some τ1∈Sτ(2),…,τ(b),b+1,…,m by the induction hypotheses of (i) and (ii). We know hτ1τ(2)⋯hτ1τ(b)hτ1(b+1)⋯hτ1(m)∘hτ(1) since hτ(2)hτ(3)⋯hτ(b)∘hτ(1).
We obtain
h1⋯hm∼hτ(1)⋯hτ(b)hb+1⋯hm∼hτ(1)hτ1τ(2)⋯hτ1τ(b)hτ1(b+1)⋯hτ1(m)=hτ1τ(1)hτ1τ(2)⋯hτ1τ(b)hτ1τ(b+1)⋯hτ1τ(m) by
hτ1(b+1)⋯hτ1(m)=hτ1τ(b+1)⋯hτ1τ(m) since
τ∈S1,…,b and hτ1τ(1)=hτ(1) since
τ1∈Sτ(2),…,τ(b),b+1,…,m. Set τ′=τ1τ, then we obtain hτ′(2)⋯hτ′(m)∈L(V),hτ′(2)⋯hτ′(m)∘hτ′(1) and h1⋯hm∼hτ′(1)⋯hτ′(m) for some τ′∈S1,…,m.
(b)2. If all j1∈{2,…,b},l2∈{b+1,…,m} such that p~hτ(j1),hj2=1, then
hτ(2)⋯hτ(b)hb+1⋯hm∼hb+1⋯hmhτ(2)⋯hτ(b). On the other hand, we know hτ(1)∘hb+1⋯hm since h1⋯hb∘hb+1⋯hm, then
hτ(1)hb+1⋯hm∈L(V) by induction hypotheses of (ii). We know h1⋯hm∼hτ(1)⋯hτ(b)hb+1⋯hm∼hτ(1)hb+1⋯hmhτ(2)⋯hτ(b), and hτ(1)hb+1⋯hm∘hτ(2)⋯hτ(b) since hτ(1)∘hτ(2)⋯hτ(b).
It is proved since
∣hτ(2)⋯hτ(b)∣=b−1<b and induction hypotheses.
(2). If h1⋯hb=0, then hb+1⋯hm=0 and hb+1⋯hm is connected by Lemma 2.2(iii). Consequently, 0=h1⋯hm−1∈L(V) and h1⋯hm−1∘hm.
(ii) Assume that h1h2⋯hm∈/L(V). Obviously,
h1h2⋯hm−1=0 and h2h3⋯hm=0.
Set i0:=1 and j0:=m−1 when h1h2⋯hm−1∈L(V);
i0:=2 and j0:=m when h2h3⋯hm∈L(V);
N0:={i0,i0+1,⋯,j0};A0:={1,…,m}−N0,
Now we prove the following Assertion(k) by induction on k, 1≤k≤m−2.
Assertion(k): There exist 1≤ik≤jk≤m, τk∈SNk−1 such that the following conditions hold:
(C1).0=hτk(ik)⋯hτk(jk)∈L(V);(C2).p~hr,ht=1 for ∀r=t∈Ak; (C3).hτk(ik)⋯hτk(jk)∘hr for ∀r∈Ak; (C4).p~hτk(ik)⋯hτk(jk),hr=1 for ∀r∈Ak; (C5).hτk(ik−1)hτk(ik−1+1)⋯hτk(jk−1)∼hτk−1(ik−1)hτk−1(ik−1+1)⋯hτk−1(jk−1)
and hτk(1)⋯hτk(m)∼h1h2⋯hm; (C6).ik−1≤ik≤jk≤jk−1 with jk−1−ik−1=jk−ik+1, where Nk:={τk(ik),τk(ik+1),⋯,τk(jk)}
and Ak:={1,…,m}−Nk, τk:=τkτk−1⋯τ1.
Step 1. For k=1,
now we construct i1 and j1 as follows.
We know 0=hi0⋯hj0∈L(V), then
p~hi0⋯hj0,hr=1 for r∈A1 by [WZZ15a, Lemma 4.12] and there exist τ1∈SN0 such that hi0⋯hj0∼hτ1(i0)⋯hτ1(j0) with (a) 0=hτ1(i0)⋯hτ1(j0−1)∈L(V),i1:=i0 and j1:=j0−1
or with (b) 0=hτ1(i0+1)⋯hτ1(j0)∈L(V),i1:=i0+1 and j1:=j0 by induction hypotheses of (iii). Obviously,
0=hτ1(i1)⋯hτ1(j1)∈L(V) and
hτ1(r)=hr for r∈A0.
Obviously, (C1), (C5) and (C6) hold.
p~ht,hr=1 for any t=r∈A1, i.e. (C2) holds. Indeed, if p~ht,hr=1 for t∈A1−A0,r∈A0, then p~hi1⋯hj1,hr=1 since p~hi0⋯hj0,hr=1.
We obtain
hi1⋯hj1hthr,hthi1⋯hj1hr,hrhi1⋯hj1ht∈L(V) by Lemma 2.1. However, h1⋯hm is
a quantum equivalent with one among
hi1⋯hj1hthr,hthi1⋯hj1hr,hrhi1⋯hj1ht, which is a contradiction to
h1⋯hm∈/L(V).
(C3) and (C4) follow from (C2).
Step 2. Assumed that Assertion(k) hold, we prove that Assertion(k+1) holds, k≤m−3.
Let i:=ik and j:=jk in this proof for convenience.
We know 0=hτk(i)⋯hτk(j)∈L(V), then there exists
τk+1∈SNk such that
hτk(i)⋯hτk(j)∼hτk+1(i)⋯hτk+1(j) with (1∘)
0=hτk+1(i)⋯hτk+1(j−1)∈L(V),ik+1:=τk+1(i) and jk+1:=τk+1(j−1),
or with (2∘)
0=hτk+1(i+1)⋯hτk+1(j)∈L(V),ik+1:=τk+1(i+1) and jk+1:=τk+1(j) by induction hypotheses of (iii). We obtain
h1⋯hm∼hτk+1(1)⋯hτk+1(m).
For convenience, hs′:=hτk+1(s) for all s∈{1,…,m}. We know τk+1(t)=t for all t∈Ak by the definition of τk+1.
Obviously, (C1), (C5) and (C6) hold.
(1∘) If there exists r∈Ak+1 such that p~hα′,hr=1 for all α∈{i,…,j−1}, then
p~hj′,hr=1 by Assertion(k), we know p~hi′⋯hj′,hr=1, it is
a contradiction to Assertion(k). Thus for all r∈Ak+1, there exists α∈{i,…,j−1} such that p~hα′,hr=1 , we obtain
h1′⋯hi−1′hi′⋯hj−1′∈L(V) by induction hypotheses.
Set {g1,⋯,gβ,l1,⋯,lη}={τk+1(j+1),…,τk+1(m−1)} with g1<⋯<gβ,l1<⋯<lη such that
p~hj′,hgλ=1 and p~hj′,hlξ=1 for all λ∈{1,…,β}, all ξ∈{1,…,η}.
Then h1′⋯hj−1′hl1′⋯hlr′∈L(V)
for all r∈{1,…,η} and hj′hg1′⋯hgt′∈L(V)
for all t∈{1,…,β} by induction hypotheses.
If p~hj′,hm′=1, then
p~h1′⋯hj−1′hl1′⋯hlη′,hm′=1 and
p~hj′hg1′⋯hgβ′,hm′=1 by Assertion(k). Then h1′⋯hj−1′hl1′⋯hlη′hj′hg1′⋯hgβ′hm′∈L(V) by Lemma 2.1,
h1⋯hm∼h1′⋯hm′∼h1′⋯hj−1′hl1′⋯hlη′hj′hg1′⋯hgβ′hm′. It is a contradiction. We obtain p~hj′,hm′=1.
We obtain h1′⋯hj−1′hl1′⋯hlη′hm′∈L(V) by induction hypotheses.
If β≥1, then
p~hj′hg1′⋯hgβ−1′,hgβ′=1 and
p~h1′⋯hj−1′hl1′⋯hlη′hm′,hgβ′=1 by Assertion(k). then
h1′⋯hj−1′hl1′⋯hlη′hm′hj′hg1′⋯hgβ−1′hgβ′∈L(V) by Lemma 2.1.
h1h2⋯hm∼h1′⋯hj−1′hl1′⋯hlη′hm′hj′hg1′⋯hgβ−1′hgβ′. It is contradiction. Then β=0.
η=m−j−1, i.e. p~hj′,hr′=1 for all r∈{j+1,…,m}.
So p~hi′⋯hj−1′,hr′=1 for all r∈{j+1,…,m} by Assertion(k).
Assumed that there exists θ∈{1,…,i−1} such that p~hθ′,hj′=1. If
p~hj′,h1′⋯hθ−1′hθ+1′⋯hi−1′hi′⋯hj−1′hj+1′⋯hm′=1,
then p~hj′,h1′⋯hj−1′hj+1′⋯hm′=1, h1′⋯hj−1′hj+1′⋯hm′∈L(V) is clear by induction hypotheses. then h1′⋯hj−1′hj+1′⋯hm′hj′
∈L(V) by [WZZ15a, Lemma 4.12]. h1h2⋯hm∼h1′⋯hj−1′hj+1′⋯hm′hj′. It is contradiction. If
p~hj′,h1′⋯hθ−1′hθ+1′⋯hi−1′hi′⋯hj−1′hj+1′⋯hm′=1,
h1′⋯hθ−1′hθ+1′⋯hi−1′hi′⋯hj−1′hj+1′⋯hm′∈L(V) is clear by induction hypotheses. Then
hθ′h1′⋯hθ−1′hθ+1′⋯hi−1′hi′⋯hj−1′hj+1′⋯hm′hj′
∈L(V) by Lemma 2.1.
h1h2⋯hm∼hθ′h1′⋯hθ−1′hθ+1′⋯hi−1′hi′⋯hj−1′hj+1′⋯hm′hj′. It is contradiction. Then
p~hθ′,hj′=1 for all θ∈{1,…,i−1}, which implies that (C2) holds.
(C3) and (C4) follows from (C2).
(2∘) If there exists r∈Ak+1 such that p~hα′,hr=1 for all α∈{i+1,…,j}, then
p~hi′,hr=1 by Assertion(k), we know p~hi′⋯hj′,hr=1, it is
a contradiction to Assertion(k). Thus for all r∈Ak+1, there exists α∈{i+1,…,j} such that p~hα′,hr=1 , we obtain
hi+1′⋯hj′hj+1′⋯hm′∈L(V) by induction hypotheses.
Set {g1,⋯,gβ,l1,⋯,lη}={τk+1(2),…,τk+1(i−1)} with g1<⋯<gβ,l1<⋯<lη such that
p~hi′,hgλ=1 and p~hi′,hlξ=1 for all λ∈{1,…,β}, all ξ∈{1,…,η}.
Then hl1′⋯hlr′hi+1′⋯hm′∈L(V)
for all r∈{1,…,η} and hg1′⋯hgt′hi′∈L(V)
for all t∈{1,…,β} by induction hypotheses.
If p~hi′,h1′=1, then
p~hl1′⋯hlη′hi+1′⋯hm′,h1′=1 and
p~hg1′⋯hgβ′hi′,h1′=1 by Assertion(k). Then h1′hg1′⋯hgβ′hi′hl1′⋯hlη′hi+1′⋯hm′∈L(V) by Lemma 2.1,
h1⋯hm∼h1′⋯hm′∼h1′hg1′⋯hgβ′hi′hl1′⋯hlη′hi+1′⋯hm′. It is a contradiction. We obtain p~hi′,h1′=1.
We obtain h1′hl1′⋯hlη′hi+1′⋯hm′∈L(V) by induction hypotheses.
If β≥1, then
p~hg2′⋯hgβ′hi′,hg1′=1 and
p~h1′hl1′⋯hlη′hi+1′⋯hm′,hg1′=1 by Assertion(k). then
hg1′hg2′⋯hgβ′hi′h1′hl1′⋯hlη′hi+1′⋯hm′∈L(V) by Lemma 2.1.
h1h2⋯hm∼hg1′hg2′⋯hgβ′hi′h1′hl1′⋯hlη′hi+1′⋯hm′. It is contradiction. Then β=0.
η=i−2, i.e. p~hi′,hr′=1 for all r∈{1,…,i−1}.
So p~hi+1′⋯hj′,hr′=1 for all r∈{1,…,i−1} by Assertion(k).
Assumed that there exists θ∈{j+1,…,m} such that p~hθ′,hi′=1. If
p~hi′,h1′⋯hi−1′hi+1′⋯hj′hj+1′⋯hθ−1′hθ+1′⋯hm′=1,
then p~hi′,h1′⋯hi−1′hi+1′⋯hm′=1, h1′⋯hi−1′hi+1′⋯hm′∈L(V) is clear by induction hypotheses. then hi′h1′⋯hi−1′hi+1′⋯hm′∈L(V) by [WZZ15a, Lemma 4.12]. h1h2⋯hm∼hi′h1′⋯hi−1′hi+1′⋯hm′. It is contradiction. If
p~hi′,h1′⋯hi−1′hi+1′⋯hj′hj+1′⋯hθ−1′hθ+1′⋯hm′=1,
h1′⋯hi−1′hi+1′⋯hj′hj+1′⋯hθ−1′hθ+1′⋯hm′∈L(V) is clear by induction hypotheses. Then
hi′h1′⋯hi−1′hi+1′⋯hj′hj+1′⋯hθ−1′hθ+1′⋯hm′hθ′
∈L(V) by Lemma 2.1.
h1h2⋯hm∼hi′h1′⋯hi−1′hi+1′⋯hj′hj+1′⋯hθ−1′hθ+1′⋯hm′hθ′. It is contradiction. Then
p~hθ′,hi′=1 for all θ∈{j+1,…,m},
which implies that (C2) holds.
(C3) and (C4) follows from (C2).
Step 3. In Assertion(m−2), It is a contradiction by (C3) and (C4).
(iii) By Lemma 2.2, u is connected. which implies that there exist two connected monomials v and w
such that u∼vw. By inductive assumption, v and w belong to L(V).
Consequently, (iii) holds by (i).
(iv) By Lemma 2.3, u∼vw such that v and w are connected,
as well as, v∘w. By inductive assumption,
v,w∈L(V). It follows from (i) and (ii). □
Corollary 2.5**.**
If h1h2⋯hm=0, then h1h2⋯hm∈L(V)
if and only if μ(h1h2⋯hm) is connected.
Proof. It follows from Lemma 2.2 and Theorem 2.4 (iv).
□
3 A basis of Nichols braided Lie algebras
In this section we obtain a basis of Nichols braided Lie algebra.
Lemma 3.1**.**
Assume that V is a braided vector space of diagonal type. If u=0 is homogeneous elements in B(V), Then μ(u) is connected (i.e. every monomial of u is connected ) if and only if u∈L(V).
Proof. The necessity follows from Corollary 2.5. The sufficiency. If u is not connected and u=i=1∑rkiσi(ui) with ki∈F∗, where ui is a non-zero disconnected monomial and
σi is a method of bracket on letters of ui for 1≤i≤r. By Lemma 2.2, σi(ui)=0 for 1≤i≤r and u=0, which is a contradiction.
□
Lemma 3.2**.**
If [u]∈D, then u is connected and u=0.
Proof. By [Kh99, Cor. 1], u=0. Obviously [u]=0 and [u]∈L(V). Considering Lemma 3.1 we complete the proof. □
Theorem 3.3**.**
If B(V) is Nichols algebra of diagonal type with dimV≥2, then the set {[u1]k1[u2]k2⋯[us]ks∣[ui]∈D,∣D∣=s;0≤ki<hui;1≤i≤s;us<us−1<⋯<u1,μ([u1]k1[u2]k2⋯[us]ks) is connect ,i=1∑ski>0} is a basis of L(V).
Proof. It follows from [He05, Th. 1.4.6], and Corollary 2.5 and Lemma 3.1. □
4 The dimension of L(V)
In this section we obtain dimension of Nichols braided Lie algebra L(V)
with finite Cartan type.
Let Vi1,⋯,ir denote the braided vector subspace generated by {xi1,xi2,⋯,xir} of V; Di1,⋯,ir denote {[u]∣[u] is a hard super-letter of B(Vi1,i2,⋯,ir)};
Li1,⋯,ir:={[u1]k1[u2]k2⋯[us]ks∣[uj]∈Di1,⋯,ir;0≤kj<ord(puj,uj);1≤j≤s;∣Di1,⋯,ir∣=s;us<us−1<⋯<u1,μ([u1]k1[u2]k2⋯[us]ks) is connected ,j=1∑skj>0}.
Bi1,⋯,ir:={[u1]k1[u2]k2⋯[us]ks∣[uj]∈Di1,⋯,ir;0≤kj<ord(puj,uj);1≤j≤s;∣Di1,⋯,ir∣=s,j=1∑skj>0}; Let Vs,t denote Vs,s+1,⋯,t
in short; similarly we have Bs,t and Ls,t. Let Bi,j:=∅ and Li,j:=∅ when i>j.
Lemma 4.1**.**
Assumed that B(V) is connected Nichols algebra of diagonal type with dimV>2 and Δ(B(V)) is an arithmetic root system. The following hold.
where
u0=∣B1,n∣ and
uj=n1=1∑n−2n2=1∑n1−2⋯nj=1∑nj−1−2∣B1,nj∣(∣Bnj+2,nj−1∣−∣Bnj+3,nj−1∣)⋯(∣Bn2+2,n1∣−∣Bn2+3,n1∣)(∣Bn1+2,n∣−∣Bn1+3,n∣) for j>0.
where ∣L1,i∣ is obtained by the formula (7) when 1≤i≤n−2.
Proof.
(i) We only determine which element in B1,n is connected.
It is clear that the left hand of (3) ⊆ the right hand of (3). If u∈B1,n−L1,n, let iu:=min{j∣xj∈/μ(u) and there exists xi∈μ(u) such that 1≤i<j≤n}. By Lemma 3.2, there exist v∈L1,iu−1 and w∈Biu+1,n such that u=vw. Consequently, the right hand of (3) ⊆ the left hand of (3). therefore (3) holds.
[TABLE]
Similarly, we can show (ii) and (iii). □
By [Hu78], ∣D(An)∣=Cn+12,∣D(Bn)∣=n2=∣D(Cn)∣,∣D(Dn)∣=n2−n,∣D(E6)∣=36, ∣D(E7)∣=63, ∣D(E8)∣=120, ∣D(F4)∣=24, ∣D(G2)∣=6.
By Lemma 4.1 and [WZZ15a, Lemma 6.4], we have the following results.
Example 4.2**.**
*Let ord(q):=N.
*(i)
For An, n≥1,
\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\cdots\cdots\cdots\cdots123n-1nq$$q$$q$$q$$q$$q^{-1}$$q^{-1}$$q^{-1}$$,q\in F^{*}/\{1\}.
then
dimL(V)=j=0∑int(2n−1)(−1)juj, where
u0=∣B1,n∣ and
uj=n1=1∑n−2n2=1∑n1−2⋯nj=1∑nj−1−2∣B1,nj∣(∣Bnj+2,nj−1∣−∣Bnj+3,nj−1∣)⋯(∣Bn2+2,n1∣−∣Bn2+3,n1∣)(∣Bn1+2,n∣−∣Bn1+3,n∣) for j>0
and ∣Bi,k∣=NCk−i+22−1 for
1≤i≤k≤n.
Furthermore,*
[TABLE]
*(ii) For Bn, n≥2,
\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\cdots\cdots\cdots\cdots123n-2n-1nq^{2}$$q^{2}$$q^{2}$$q^{2}$$q^{2}$$q$$q^{-2}$$q^{-2}$$q^{-2}$$q^{-2}$$,q\in F^{*}/\{1,-1\}.
then
dimL(V)=j=0∑int(2n−1)(−1)juj, where
u0=∣B1,n∣ and
uj=n1=1∑n−2n2=1∑n1−2⋯nj=1∑nj−1−2∣B1,nj∣(∣Bnj+2,nj−1∣−∣Bnj+3,nj−1∣)⋯(∣Bn2+2,n1∣−∣Bn2+3,n1∣)(∣Bn1+2,n∣−∣Bn1+3,n∣) for j>0; ∣Bi,n∣=N(n−i+1)2−1 for
1≤i<n and ∣Bi,k∣=NCk−i+22−1 for
1≤i≤k<n, when N is odd;
∣Bi,n∣=(2N)(n−i+1)2−n+i−1Nn−i+1−1 for
1≤i<n and ∣Bi,k∣=(2N)Ck−i+22−1 for
1≤i≤k<n, when N is even. Furthermore,*
[TABLE]
when N is odd;
[TABLE]
*when N is even.
(iii) For Cn, n>2,
\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\cdots\cdots\cdots\cdots123n-2n-1nq$$q$$q$$q$$q$$q^{2}$$q^{-1}$$q^{-1}$$q^{-1}$$q^{-2}$$,q\in F^{*}/\{1,-1\}.
then
dimL(V)=j=0∑int(2n−1)(−1)juj, where
u0=∣B1,n∣ and
uj=n1=1∑n−2n2=1∑n1−2⋯nj=1∑nj−1−2∣B1,nj∣(∣Bnj+2,nj−1∣−∣Bnj+3,nj−1∣)⋯(∣Bn2+2,n1∣−∣Bn2+3,n1∣)(∣Bn1+2,n∣−∣Bn1+3,n∣) for j>0; ∣Bi,n∣=N(n−i+1)2−1 for
1≤i<n and ∣Bi,k∣=NCk−i+22−1 for
1≤i≤k<n, when N is odd;
∣Bi,n∣=N(n−i+1)2−n+i−1(2N)n−i+1−1 for
1≤i<n and ∣Bi,k∣=NCk−i+22−1 for
1≤i≤k<n, when N is even.
Furthermore,*
then dimL(V)=∣B1,n∣−∣Bn−1,n−1∣∣Bn,n∣−i=1∑n−3∣L1,i∣(∣Bi+2,n∣−∣Bi+3,n∣)−∣L1,n−3∣∣Bn−1,n∣,
where
∣Bk,n∣=N(n−k+1)2−n+k−1−1 for n−k+1>2,
∣Bn−1,n∣=N3−1, ∣Bn,n∣=∣Bn−1,n−1∣=N−1; ∣L1,t∣ is obtained by the formula (4.2) when 1≤t≤n−3.
Furthermore,*
[TABLE]
*(v) For E6,
\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet123456q$$q$$q$$q$$q$$q$$q^{-1}$$q^{-1}$$q^{-1}$$q^{-1}$$q^{-1}$$,q\in F^{*}/\{1\}.
then*
[TABLE]
*where ∣L1,t∣ is obtained by the formula (4.2) when 1≤t≤4.
*(vi) For E7,
\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet1234567q$$q$$q$$q$$q$$q$$q$$q^{-1}$$q^{-1}$$q^{-1}$$q^{-1}$$q^{-1}$$q^{-1}$$,q\in F^{*}/\{1\}.
then*
[TABLE]
*where ∣L1,t∣ is obtained by the formula (4.2) when 1≤t≤5.
*(vii) For E8,
\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet$$\bullet12345678q$$q$$q$$q$$q$$q$$q$$q$$q^{-1}$$q^{-1}$$q^{-1}$$q^{-1}$$q^{-1}$$q^{-1}$$q^{-1}$$,q\in F^{*}/\{1\}.
then*
[TABLE]
*where ∣L1,t∣ is obtained by the formula (4.2) when 1≤t≤6.
*(viii) For F4.
\bullet$$\bullet$$\bullet$$\bullet1234q^{2}$$q^{2}$$q$$q$$q^{-2}$$q^{-2}$$q^{-1}$$,q\in F^{*}/\{1,-1\}.
then
dimL(V)=j=0∑1(−1)juj, where u0=∣B1,4∣ and
u1=n1=1∑2(∣B1,n1∣)(∣Bn1+2,4∣−∣Bn1+3,4∣); ∣B1,4∣=N24−1, ∣B1,1∣=N−1,
∣B1,2∣=NC32−1=N3−1, ∣B3,4∣=NC32−1=N3−1 and ∣B4,4∣=N−1 when N is odd; ∣B1,4∣=N12(2N)12−1, ∣B1,1∣=2N−1,
∣B1,2∣=(2N)C32−1=(2N)3−1, ∣B3,4∣=NC32−1=N3−1 and ∣B4,4∣=N−1 when N is even.
Furthermore*
[TABLE]
when N is odd;
[TABLE]
when N is even.
*(ix) For G2, \bullet$$\bullet12q$$q^{3}$$q^{-3}$$,q\in F^{*}/\{1,-1\},q^{3}\not=1.
then
dimL(V)=N6−1 when 3∤N; dimL(V)=(3N)3N3−1 when 3∣N.
5 Non-zero monomials in Nichols algebras
In this section we find some non-zero monomials in Nichols algebras.
Let (s)q:=1+q+q2+⋯+qs−1 and (s)q!:=(1)q(2)q⋯(s)q.
Lemma 5.1**.**
Assume hi∈{x1,⋯,xn} for 1≤i≤m and uj is 1 or a monomial with xk∈/μ(uj) for 1≤j≤l+1. Let q:=pxk,xk−1 for convenience.
(i)**
[TABLE]
(ii)**
[TABLE]
(iii)* If ord(phi,hi)>∣deghi(h1⋯hm)∣ for all i∈{1,…,m},
then h1⋯hm=0.*
Proof. (i) It can be obtained by induction on l.
(ii)
We show this by induction on l. If l=1, <yk,u1xku2>=pk,u1−1u1u2. Assume l>1. See that
[TABLE]
(iii) We show this by induction on t:=∣μ(h1h2⋯hm)∣. If t=1, we obtain h1⋯hm=0 by [He05, Lemma 1.3.3 (i)].
Assume t>1 and h1h2⋯hm=u1xku2xk⋯ulxkul+1
with ∣μ(u1u2⋯ul+1)∣=t−1. Thus u1u2⋯ul+1=0 by induction hypotheses,
(1+pkk−1)(1+pkk−1+pkk−2)⋯(1+pkk−1+⋯+pkk−l+1)=0 since ord(pxk,xk)>∣degxk(h1⋯hm)∣=l.
Hence u1xku2xk⋯ulxkul+1=0, completing the proof.
□
Corollary 5.2**.**
If u and v are monomials in B(V), μ(u)∩μ(v)=∅, pijpji=1 for any xi∈μ(u), xj∈μ(v), then the following conditions are equivalent:
(i)u=0,v=0.
(ii)uv=0.
(iii)uv∈/L(V).
Proof. We know (ii) ⟺ (iii) by Lemma 2.2. (ii)⟹ (i) is clear.
(ii) ⟸ (i): Assume ∣u∣=k, then ∃yi1,…,yik∈d(u) such that <yi1⋯yik,u>∈F∗ and <yi1⋯yik,uv>=<yi1⋯yik,u>v=0.
□
Lemma 5.3**.**
If u and v are two homogeneous elements with μ(u)∩μ(v)=∅, then uv=0 implies u=0 or v=0.
Proof. Without lost general, there exists i0 such that μ(v)⊆{1,2,⋯i0} and μ(u)⊆{i0+1,i0+2,⋯n}.
Assume u=0 and v=0 with u=i=1∑skiui and v=j=1∑tki′vi, where ki=0,kj′=0,ui∈B1,i0, vj∈Bi0+1,n for 1≤i≤i0,1+i0≤j≤n. Consequently, uv=i=1∑sj=1∑tkikj′uivj=0 with uivj∈B1,n and kikj=0 for 1≤i≤s,1≤j≤t.□
6 Relations between graphes and Nichols Braided Lie Algebras
In this section we give relations between connected components of graphes and Nichols Braided Lie Algebras.
Obviously, every pure generalized Dynkin diagram is a graph in terms of graph theory (see [Ha69]). Conversely, Assume that Γ is a graph in terms of graph theory with
vertex {1,2,⋯,n}. We define a matrix (qij)n×n as follows:
qijqji=1 if and only if there exists an edge between i and j. Let V be the braided vector space with braiding matrix (qij)n×n. Γ is a
pure generalized Dynkin diagram of V.
Corollary 6.1**.**
(i) Γ(u) is a connected component of Γ(V) with a non-zero monomial u if and only if μ(u) is a maximal element in {μ(v)∣v is a non-zero monomial in L(V)} under order ⊆.
(ii) The following conditions are equivalent.
(a). Γ(V) is connected
(b). xnxn−1⋯x1∈L(V).
(c). x1x2⋯xn∈L(V)
(d). there exists a non-zero monomial u∈L(V) with ∣μ(u)∣=dimV.
(ii) Considering Lemma 5.3
we have xnxn−1⋯x1=0 and x1x2⋯xn=0.
Using Corollary 2.5 we complete the proof. □
Bibliography19
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[AS 10] N. Andruskiewitsch, H.-J. Schneider, On the classification of finite-dimensional pointed Hopf algebras, Ann. Math. 171 (2010), 375-417.
2[AHS 08] N. Andruskiewitsch, I. Heckenberger and H.J. Schneider, The Nichols algebra of a semisimple Yetter-Drinfeld module, Amer. J. Math. 132 (2010), 1493-1547.
3[BFM 96] Y. Bahturin, D. Fishman and S. Montgomery, On the generalized Lie structure of associative algebras, J. Alg. 96 (1996), 27-48.
4[BFM 01] Y. Bahturin, D. Fischman and S. Montgomery, Bicharacter, twistings and Scheunert’s theorem for Hopf algebra, J. Alg. 236 (2001), 246-276.
5[BMZP 92] Y. Bahturin, D. Mikhalev, M. Zaicev and V. Petrogradsky, Infinite dimensional Lie superalgebras, Walter de Gruyter Publ. Berlin, New York, 1992.
6[GRR 95] D. Gurevich, A. Radul and V. Rubtsov, Noncommutative differential geometry related to the Yang-Baxter equation, Zap. Nauchn. Sem. S.-Peterburg Otdel. Mat. Inst. Steklov. (POMI) 199 (1992); translation in J. Math. Sci. 77 (1995), 3051–3062.
7[Gu 86] D. I. Gurevich, The Yang-Baxter equation and the generalization of formal Lie theory, Dokl. Akad. Nauk SSSR, 288 (1986), 797–801.
8[He 06a] I. Heckenberger, Classification of arithmetic root systems, Adv. Math. 220 (2009), 59-124.