Volume 8, Issue 3 (Vol. 8,No. 3, 2022)
mmr 2022, 8(3): 144-152 |
Back to browse issues page
University of Bojnord , hesam.safa@gmail.com
Abstract: (491 Views)
Introduction
The notion of Leibniz algebras is introduced by Blokh in 1965 as a noncommutative version of Lie algebras and rediscovered by Loday in 1993. A Leibniz algebra is a vector space A over a field F together with a bilinear map [ , ] : A × A A usually called the Leibniz bracket of A, satisfying the Leibniz identity:
The classification of nilpotent Leibniz algebras is one of the most important subject in the study of Leibniz algebras. In the present paper, we obtain an upper bound for the nilpotency class of a finitely generated nilpotent Leibniz algebra A in terms of the maximum of the nilpotency classes of maximal subalgebras of A and the minimal number of generators of A.
Main results
Throughout the paper, any Leibniz algebra A is considered over a fixed field F, c denotes the maximum of the nilpotency classes of maximal subalgebras of A, d is the minimal number of generators of A and
Lemma 1. Let A be a nilpotent Leibniz algebra and M be a maximal subalgebra of A. Then M is a two-sided ideal of A.
Lemma 2. Let I be a two-sided ideal of a Leibniz algebra A and {x1,x2, … ,xk} be a subset of A which contains at least n elements of I (n ≤ k). Then
Theorem 3. Let A be a finitely generated nilpotent Leibniz algebra such that d > 1. Then A is nilpotent of class at mostcd d
Corollary 4. Let A be a finitely generated nilpotent Leibniz algebra and {x1,x2, … ,xd} be a minimal generating set of A with d > 1. Then
cl A ≤ max 1≤ i ≤ d cl Mi d d
where Mi is the two-sided ideal generated by the set { x1 , …, xi-1 , xi+1 , … ,xd} and cl denotes the nilpotency class.
Corollary 5. Let A be a finitely generated nilpotent Leibniz algebra of class k with d > 1. Then c ≤ k ≤ 2c.
Corollary 6. Let A be a finitely generated nilpotent Leibniz algebra such that d > c+1. Then A is nilpotent of class c.
Corollary 7. Let A be a finitely generated nilpotent Leibniz algebra of class 2c such that d > 1. Then d=2.
Proposition 8. There is not any non-Lie Leibniz algebra with at least two generators, whose maximal subalgebras are all abelian.
The classification of nilpotent Leibniz algebras is one of the most important subject in the study of Leibniz algebras. In the present paper, we obtain an upper bound for the nilpotency class of a finitely generated nilpotent Leibniz algebra A in terms of the maximum of the nilpotency classes of maximal subalgebras of A and the minimal number of generators of A.
Main results
Throughout the paper, any Leibniz algebra A is considered over a fixed field F, c denotes the maximum of the nilpotency classes of maximal subalgebras of A, d is the minimal number of generators of A and
Lemma 1. Let A be a nilpotent Leibniz algebra and M be a maximal subalgebra of A. Then M is a two-sided ideal of A.
Lemma 2. Let I be a two-sided ideal of a Leibniz algebra A and {x1,x2, … ,xk} be a subset of A which contains at least n elements of I (n ≤ k). Then
Theorem 3. Let A be a finitely generated nilpotent Leibniz algebra such that d > 1. Then A is nilpotent of class at most
Corollary 4. Let A be a finitely generated nilpotent Leibniz algebra and {x1,x2, … ,xd} be a minimal generating set of A with d > 1. Then
where Mi is the two-sided ideal generated by the set { x1 , …, xi-1 , xi+1 , … ,xd} and cl denotes the nilpotency class.
Corollary 5. Let A be a finitely generated nilpotent Leibniz algebra of class k with d > 1. Then c ≤ k ≤ 2c.
Corollary 6. Let A be a finitely generated nilpotent Leibniz algebra such that d > c+1. Then A is nilpotent of class c.
Corollary 7. Let A be a finitely generated nilpotent Leibniz algebra of class 2c such that d > 1. Then d=2.
Proposition 8. There is not any non-Lie Leibniz algebra with at least two generators, whose maximal subalgebras are all abelian.
Type of Study: S |
Subject:
alg
Received: 2020/01/2 | Revised: 2023/06/18 | Accepted: 2021/01/19 | Published: 2022/12/20 | ePublished: 2022/12/20
Received: 2020/01/2 | Revised: 2023/06/18 | Accepted: 2021/01/19 | Published: 2022/12/20 | ePublished: 2022/12/20
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |