1. College of Mathematics, Hunan Institute of Science and Technology, Yueyang 414000, China
2. School of Mathematical Sciences, Capital Normal University, Beijing 100037, China
yudeming8640024@126.com
Show less
History+
Received
Accepted
Published
2023-10-15
Issue Date
Revised Date
2023-12-27
PDF
(963KB)
Abstract
In this paper, a new infinite-dimensional necklace Lie algebra is studied and the left and right index arrays of a necklace word in necklace Lie algebra is first defined. Using the left and right index arrays, we divide the necklace words into 5 classes. We discuss finite-dimensional Lie subalgebras of necklace Lie algebras intensively and prove that some subalgebras are isomorphism to simple Lie algebra sl.
Necklace Lie algebra is a relatively new class of infinite-dimensional Lie algebras characterized by 0. In the study of noncommutative geometry, when considering the role of -algebraic automorphism group of Weyl algebra on orbital (in this case is the field of complex numbers), we get an on matrix orbital space on migration. However, this effect is non-differentiable and therefore non-algebraic. Berest and Wilson propose whether can be equated with some kind of coadjoint orbit of an infinite-dimensional Lie algebra. Both Lothaire and Reutenauer [4, 8] have failed to use necklace words to characterize the basis of free Lie algebras in an attempt to solve the problem posed by Berest and Wilson. Ginzburg [2] and Bocklandt [1] introduced necklace Lie algebra, respectively, to solve this problem.
A necklace Lie algebra is an infinite-dimensional vector space generated by all necklace characters in a repetitive arrow diagram induced by an arrow diagram , and the special Lie operations are defined on this vector space. The application of the arrow diagram [3, 6] in algebraic representation theory has become more and more widespread, and has become the basic concept of algebraic representation theory. Necklace Lie algebras have important applications in noncommutative geometry and singularity theory, quantum groups, and other fields. We have studied the isomorphisms and homomorphisms of some necklace Lie algebras [11, 12]. In [12], we have studied the isomorphisms of some special arrow diagrams, including unidirectional cyclic arrow diagrams, mixed cyclic arrow diagrams, and the isomorphisms of vertically superimposed arrow diagrams and horizontally superimposed arrow diagrams. We have also studied the homomorphisms of some special arrow diagrams in [11], including homomorphisms with only 2 vertices, 2 arrow diagrams in different directions, only 3 vertices, 3 arrow diagrams in the same direction, and vertices, arrow diagrams in different directions. Mei [5] studied some special necklaces Lie algebra structures.
Post [7] studied the structure of transitive Lie algebras, focusing on finite-dimensional Lie subalgebras of infinite-dimensional transitive Lie algebras, and proved that finite-dimensional maximal Lie subalgebras contain semi-simple Lie algebras, and finite-dimensional maximum Lie subalgebras have nontrivial modules. We have also considered some special infinite-dimensional Lie algebras [9, 10]. This paper focuses on finite-dimensional subalgebras of infinite-dimensional necklace Lie algebras, and proves that some of these subalgebras are isomorphic to the canonical simple Lie algebra . Follow-up research will explore some important properties of necklace Lie algebra, such as semi-singleness, solvability, and decomposability.
2 Definition of necklace Lie algebra and index arrays of necklace Lie algebra
Let be any connected directed diagram with two or more vertices, where is the set of vertices of . Directed edges in are called arrows, is the set of all arrows in , , is a mapping from to such that for any is the starting point of , is the end of . Denoted , and , and is called an arrow diagram. There are arrow sequences in , here . If , then is the road in . If there is also , then is said to be a cycle, and is called the length of the cycle. Define the relationship on the set of all loops in the arrow diagram as follows. Let be a loop in . If is the loop obtained by rotating the arrows in sequentially, define . Obviously is an equivalence relation. A circular equivalent class of is called a necklace word of . If is a loop, then the corresponding necklace word is represented by a diagram (see Fig.1).
Represented by , is a representative of the cyclic equivalence class. Each loop in the loop equivalence class has the same length, which is called the length of the necklace word, denoted by .
For each arrow in , add about of symmetric arrow , i.e., is called the starization of , and the repetitive arrow diagram is induced by . Note , then , and . Similarly, it can be defined as: is also known as the starification of . Obviously, from the definition, we know . All cyclic equivalence classes in are all necklace words form the set , based on all elements in this set on into vector space .
For any and (once the subscript order of the arrows and is determined, it cannot be replaced), and any , binary operations are defined in set as follows [3, 12]:
The new necklace word is defined as a first-order conection of at position with respect to . The Lie operation that defines the necklace word is as follows:
Extend the above Lie operation linearly to , let , definition
It can be verified that the definition of the Lie operation is independent of , the selected loop representation, and the order in which the arrows are arranged.
According to the illustration of equation (1) and the necklace word, we can visualize the Lie operation: , see Fig.2, i.e., , if appears in , and then look for in . If so, delete both and to open the two necklaces of and and connect the two paths after opening (the same vertex is connected together), to form a new necklace word. If appears times at , and if appears times at , the process needs to be repeated times, and the combination of necklace words and the sum of the necklace words constitutes a new necklace word. If is not in , the new necklace word is treated as 0. Then look for the above in , look for in , repeat the above operation, get another new necklace word combination. Subtract the necklace word combination obtained by subtracting the new necklace word combination obtained first, and finally iterate , add up all the necklace words obtained after subtraction, and the sum is .
Since
we have . Then this Lie operation satisfies the antisymmetry on the vector space , and it can also be verified that this Lie operation satisfies the bilinearity, closure, and the Jacobi identity.
For a given arrow diagram , note , then , is of starvation. Take any , let be a loop in the class of circular equivalence represented by . From apex , the arrows in that passes through in turn is , and let ; the arrow in the is , and let . Now take out all the subscripts of all elements in and denote , that is, , and we can also get , which are called the left index array and the right index array of , respectively. We stipulate that such an index array is unordered. Since the arrows in the can be repeated, the elements in the index array are repeatable. If an index array is represented by , then when is an element in , denote . The number of elements in is denoted by . If there are no elements in , remember .
Let be any two index arrays, and we define the relationship and movement between index arrays as follows:
(i) if and only if , the number of occurrences of in is equal to the number of times it occurs in , , the number of occurrences of in is equal to the number of times it occurs in . Otherwise, is not equal to and denoted as .
(ii) if and only if , there must be , and does not appear more times in than it appears in .
(iii) if and only if and at least one does not appear in or appears in more times than it appears in .
(iv) or , and the number of occurrences of is equal to the number of occurrences of in plus the number of occurrences in .
(v) , and the number of occurrences of is equal to the lesser of the number of occurrences of in and the number of occurrences in . When there are no common elements in and , define index array without any elements.
(vi) , and the number of occurrences of is equal to the number of occurrences of in minus the number of occurrences of in .
By definition, the relationship between the two index arrays and the operation and the set are both related to and different from the operation. For example, if , then ; if , then , .
Example 1 Set as shown in Fig.3.
In , take , then . There is .
, the relationship between the index arrays is as follows:
A) , contains . In Example 1, take , then , there is .
B) , contains . In Example 1, take , then , there is .
C) , contains . In Example 1, take , then , with .
D) , and . As shown in Fig.4.
Take , then .
E) , and . As shown in Fig.5.
Take , then .
As the definitions of and , for any definite , and are determined. Since the above categories A)–E) already contain all the relations between any two index arrays, the elements in can be divided into the above 5 categories.
By equation (1), . If , record , corresponding record . Using the definitions of the index array and , it is known that such that
3 Main results
Set the arrow diagram as shown in Fig.6:
All necklace words of length 2 in Fig.6 are and . The order is a linear space generated by and .
Proposition 1is a subalgebra of , and the derivative algebraofis a subspace generated byand .
Since is the linear space generated by all necklace words of length 2, , then any non-zero necklace word in has a length of 2, and is a subalgebra of . Because
the subspaces generated by and must contain the derivative algebra of . And it can be concluded that . Conversely, if , then there must be the necklace word such that appears in the expression of . Since the length of is 2, there must be necklace words with length of 2, and or . As
can never be solved. Thus, Proposition 1 holds.
Proposition 2is a three-dimensional simple Lie algebra.
Proof The three-dimensional simple Lie algebra exists based on , and , such that
is a subspace generated by and , so
The isomorphic map between and is constructed as follows:
The basis vectors expand linearly, then . The original proposition holds.
Proposition 3The centerof , .
Proof Let . Thus,
And and are linear independent, ,
Thus, . Thereby, Proposition 3 holds.
Proposition 4only has two proper ideals, and , andcan be decomposed into the direct sum of two proper ideals .
Proof is a three-dimensional subspace generated by , and , while is a subspace generated by , and . As the direct sum of subspaces, then and are ideal. So, there is .
Assuming that is ideal for , then is also ideal for , and is a simple Lie algebra, thus or .
If , then or .
If , then , while , thus or . In summary, Proposition 4 holds.
Set the arrow diagram as shown in Fig.7.
All necklace words of length 2 are and . The order is a linear space generated by and .
Proposition 5is a subalgebra of , and the derivative algebraofis a linear space generated by , and .
Proof Similar as the proof of Proposition 1.
Proposition 6is a three-dimensional simple Lie algebra.
Proof The three-dimensional simple Lie algebra exists based on , and , such that
is a subspace generated by , and . So
The isomorphism map between and is constructed as follows:
Then the question of the basis vector is linearly expanded, and . Proposition 6 holds.
From Proposition 2 and Proposition 6, the derivative algebra of and the derivative algebra of are isomorphic to , so we find the implementation of two different arrow diagrams when . Since , is isomorphic with ? Now, we extend from the isomorphism of to to the isomorphism between and .
Proposition 7is isomorphic to .
Proof Construct the isomorphic map as follows:
expands linearly between the basis vectors of . , and the correspondence of the basis vector is
, and the correspondence of the basis vector is
The construction process from has
So, is an isomorphism of to .
Further,
Thus, is an isomorphism of to .
We can actually construct an isomorphic map from to as follows:
also maintains the isomorphism of to .
Set the arrow diagram as shown in Fig.8.
All necklace words of length 2 are and . Let be the linear space generated by all necklace words of length 2. is a subalgebra of . The derivative algebra of is the linear space generated by , and .
Proposition 8The centerof , .
Proof Let
Then
, and are linear independent. So,
and are linearly independent, thus . Therefore,
Thus, there must be . Conversely, when , it can be verified that there are for . In fact, for any necklace word of length 2, , and is all necklace words of length 2. Thus, Proposition 8 holds.
Proposition 9 .
Proof Let . Then there exist , such that
Then
and
Therefore, . Proposition 9 holds.
According to Proposition 2, the derivative algebra contains at least 3 three-dimensional simple Lie algebras, namely , and . is a linear space generated by , , and , is a linear space generated by , and , is a linear space generated by , and . However, it can be verified that , and are not ideal for . For linear subspaces , and , any two of them can be the direct sum of linear subspaces, but , and cannot be the direct sum of linear subspaces, otherwise the dimension of is 9. While , actually because , and .
is a typical simple-Lie algebra on , with a set of bases of , , , and ( denotes the matrix with the elements of the row and column as 1 and the remaining elements as 0).
Proposition 10is a simple Lie algebra.
Proof A typical simple Lie algebra has a set of bases of , and , while has a set of bases of , and , construct isomorphic maps as follows:
Then expand linearly between the basis vectors of . ,
In the above discussion, when , ; when , , i.e., and have exactly the same operation rules. For any necklace word , and is a simple Lie algebra. Thus, is a simple Lie algebra.
Set the arrow diagram as shown in Fig.9.
All necklace words of length 2 are . Let be the linear space generated by all necklace words of length 2, and it can be similarly shown that is a subalgebra of , while the derivative algebra of is a linear subspace generated by and .
Proposition 11isomorphic to , is a simple Lie algebra.
Proof Typical simple Lie algebra has a set base of and , and the set base for is and , construct the isomorphic map as follows:
Then expand linearly between the basis vectors of . ,
In the above discussion, when , ; when , , that is, has exactly the same operation rules as . For any necklace word , and is a simple Lie algebra, so is a simple Lie algebra.
Set the arrow diagram as shown in Fig.10.
. Let be the linear space generated by and . is the linear space generated by , is the linear space generated by and , is the linear space generated by , and .
Proposition 12is the solvable subalgebra of . are solvable ideals, and .
Proof Since , thus . While is a one-dimensional commutative Lie algebra, are solvable ideals, and , thus Proposition 12 holds.
Bocklandt R, Le Bruyn L. Necklace Lie algebras and noncommutative symplectic geometry. Math Z2002; 240(1): 141–167
[2]
Ginzburg V. Non-commutative symplectic geometry, quiver varieties, and operads. Math Res Lett2001; 8(3): 377–400
[3]
Guo J Y, Martínez-Villa R. Algebra pairs associated to McKay quivers. Comm Algebra2002; 30(2): 1017–1032
[4]
LothaireM. Combinations on Words. Encyclopedia Math Appl, Vol 17. Reading: Addison-Wesley Publishing Co, 1983
[5]
Mei C Q, Yu D M. The structure of Necklace Lie algebras. Math Pract Theory2012; 42(1): 195–204
[6]
Peng L G. Lie algebras determined by finite Auslander-Reiten quivers. Comm Algebra1998; 26(9): 2711–2725
[7]
Post G F. On the structure of transitively differential algebras. J Lie Theory2001; 11(1): 111–128
[8]
ReutenauerC. Free Lie Algebras. London Math Soc Monogr Ser, Vol 7. Oxford: Clarendon Press, 1993
[9]
Yu D M, Li B J, Wan Q H. The automorphism group and simplicity of the generalized Virasoro-like Lie algebra. Adv Math (China)2013; 42(5): 620–624
[10]
Yu D M, Lu C H. Special property of Lie algebra L(Z, f, δ). Adv Math (China)2006; 35(6): 707–711
[11]
Yu D M, Mei C Q, Guo J Y. Homomorphisms of some special necklace Lie algebras. Chinese Ann Math Ser A2009; 30(4): 551–562
[12]
Yu D M, Mei C Q, Guo J Y. Automorphisms and automorphism groups of Necklace Lie algebras. Chinese Ann Math Ser A2013; 34(5): 569–578
RIGHTS & PERMISSIONS
Higher Education Press 2023
AI Summary 中Eng×
Note: Please be aware that the following content is generated by artificial intelligence. This website is not responsible for any consequences arising from the use of this content.