In this paper, the asynchronous control problem is investigated and a multiple convex Lyapunov functions (MCLF) approach is introduced for a class of discrete-time switched linear systems under the Φ-dependent integrated dwell time (ΦDIDT) switching strategy. For the problem of asynchronous switching, this paper considers that Lyapunov functions may jump when the subsystem switches or the controller changes. Thus, the constructed MCLF is dependent on both the asynchronous interval and the synchronous interval, and the synchronous interval is divided into the convex interval and non-convex interval parts. Some sufficient conditions of stability with Linear matrix inequality (LMI) forms are obtained, and the asynchronous controller is designed to guarantee the globally uniform exponential stability of the system under study. In addition, the proposed method can degenerate to the existing methods to deal with the asynchronous control problem. Finally, a numerical example illustrates the superiority of the proposed method.
Citation: Qiang Yu, Na Xue. Asynchronously switching control of discrete-time switched systems with a Φ-dependent integrated dwell time approach[J]. AIMS Mathematics, 2023, 8(12): 29332-29351. doi: 10.3934/math.20231501
[1] | Madeeha Tahir, Ayesha Naz, Muhammad Imran, Hasan Waqas, Ali Akgül, Hussein Shanak, Rabab Jarrar, Jihad Asad . Activation energy impact on unsteady Bio-convection nanomaterial flow over porous surface. AIMS Mathematics, 2022, 7(11): 19822-19845. doi: 10.3934/math.20221086 |
[2] | Khalil Ur Rehman, Wasfi Shatanawi, Zeeshan Asghar, Haitham M. S. Bahaidarah . Neural networking analysis for MHD mixed convection Casson flow past a multiple surfaces: A numerical solution. AIMS Mathematics, 2023, 8(7): 15805-15823. doi: 10.3934/math.2023807 |
[3] | Taqi A. M. Shatnawi, Nadeem Abbas, Wasfi Shatanawi . Comparative study of Casson hybrid nanofluid models with induced magnetic radiative flow over a vertical permeable exponentially stretching sheet. AIMS Mathematics, 2022, 7(12): 20545-20564. doi: 10.3934/math.20221126 |
[4] | Nadeem Abbas, Wasfi Shatanawi, Taqi A. M. Shatnawi . Innovation of prescribe conditions for radiative Casson micropolar hybrid nanofluid flow with inclined MHD over a stretching sheet/cylinder. AIMS Mathematics, 2025, 10(2): 3561-3580. doi: 10.3934/math.2025164 |
[5] | Muhammad Asif Zahoor Raja, Kottakkaran Sooppy Nisar, Muhammad Shoaib, Ajed Akbar, Hakeem Ullah, Saeed Islam . A predictive neuro-computing approach for micro-polar nanofluid flow along rotating disk in the presence of magnetic field and partial slip. AIMS Mathematics, 2023, 8(5): 12062-12092. doi: 10.3934/math.2023608 |
[6] | M. S. Alqarni . Thermo-bioconvection flow of Walter's B nanofluid over a Riga plate involving swimming motile microorganisms. AIMS Mathematics, 2022, 7(9): 16231-16248. doi: 10.3934/math.2022886 |
[7] | Kiran Sajjan, N. Ameer Ahammad, C. S. K. Raju, M. Karuna Prasad, Nehad Ali Shah, Thongchai Botmart . Study of nonlinear thermal convection of ternary nanofluid within Darcy-Brinkman porous structure with time dependent heat source/sink. AIMS Mathematics, 2023, 8(2): 4237-4260. doi: 10.3934/math.2023211 |
[8] | J. Kayalvizhi, A. G. Vijaya Kumar, Ndolane Sene, Ali Akgül, Mustafa Inc, Hanaa Abu-Zinadah, S. Abdel-Khalek . An exact solution of heat and mass transfer analysis on hydrodynamic magneto nanofluid over an infinite inclined plate using Caputo fractional derivative model. AIMS Mathematics, 2023, 8(2): 3542-3560. doi: 10.3934/math.2023180 |
[9] | Ali Raza, Umair Khan, Aurang Zaib, Wajaree Weera, Ahmed M. Galal . A comparative study for fractional simulations of Casson nanofluid flow with sinusoidal and slipping boundary conditions via a fractional approach. AIMS Mathematics, 2022, 7(11): 19954-19974. doi: 10.3934/math.20221092 |
[10] | Latifa I. Khayyat, Abdullah A. Abdullah . The onset of Marangoni bio-thermal convection in a layer of fluid containing gyrotactic microorganisms. AIMS Mathematics, 2021, 6(12): 13552-13565. doi: 10.3934/math.2021787 |
In this paper, the asynchronous control problem is investigated and a multiple convex Lyapunov functions (MCLF) approach is introduced for a class of discrete-time switched linear systems under the Φ-dependent integrated dwell time (ΦDIDT) switching strategy. For the problem of asynchronous switching, this paper considers that Lyapunov functions may jump when the subsystem switches or the controller changes. Thus, the constructed MCLF is dependent on both the asynchronous interval and the synchronous interval, and the synchronous interval is divided into the convex interval and non-convex interval parts. Some sufficient conditions of stability with Linear matrix inequality (LMI) forms are obtained, and the asynchronous controller is designed to guarantee the globally uniform exponential stability of the system under study. In addition, the proposed method can degenerate to the existing methods to deal with the asynchronous control problem. Finally, a numerical example illustrates the superiority of the proposed method.
A Poisson algebra is a triple, (L,⋅,[−,−]), where (L,⋅) is a commutative associative algebra and (L,[−,−]) is a Lie algebra that satisfies the following Leibniz rule:
[x,y⋅z]=[x,y]⋅z+y⋅[x,z],∀x,y,z∈L. |
Poisson algebras appear naturally in the study of Hamiltonian mechanics and play a significant role in mathematics and physics, such as in applications of Poisson manifolds, integral systems, algebraic geometry, quantum groups, and quantum field theory (see [7,11,24,25]). Poisson algebras can be viewed as the algebraic counterpart of Poisson manifolds. With the development of Poisson algebras, many other algebraic structures have been found, such as Jacobi algebras [1,9], Poisson bialgebras [20,23], Gerstenhaber algebras, Lie-Rinehart algebras [16,17,26], F-manifold algebras [12], Novikov-Poisson algebras [28], quasi-Poisson algebras [8] and Poisson n-Lie algebras [10].
As a dual notion of a Poisson algebra, the concept of a transposed Poisson algebra was recently introduced by Bai et al. [2]. A transposed Poisson algebra (L,⋅,[−,−]) is defined by exchanging the roles of the two binary operations in the Leibniz rule defining the Poisson algebra:
2z⋅[x,y]=[z⋅x,y]+[x,z⋅y],∀x,y,z∈L, |
where (L,⋅) is a commutative associative algebra and (L,[−,−]) is a Lie algebra.
It is shown that a transposed Poisson algebra possesses many important identities and properties and can be naturally obtained by taking the commutator in the Novikov-Poisson algebra [2]. There are many results on transposed Poisson algebras, such as those on transposed Hom-Poisson algebras [18], transposed BiHom-Poisson algebras [21], a bialgebra theory for transposed Poisson algebras [19], the relation between 12-derivations of Lie algebras and transposed Poisson algebras [14], the relation between 12-biderivations and transposed Poisson algebras [29], and the transposed Poisson structures with fixed Lie algebras (see [6] for more details).
The notion of an n-Lie algebra (see Definition 2.1), as introduced by Filippov [15], has found use in many fields in mathematics and physics [4,5,22,27]. The explicit construction of n-Lie algebras has become one of the important problems in this theory. In [3], Bai et al. gave a construction of (n+1)-Lie algebras through the use of n-Lie algebras and some linear functions. In [13], Dzhumadil′daev introduced the notion of a Poisson n-Lie algebra which can be used to construct an (n+1)-Lie algebra under an additional strong condition. In [2], Bai et al. showed that this strong condition for n=2 holds automatically for a transposed Poisson algebra, and they gave a construction of 3-Lie algebras from transposed Poisson algebras with derivations. They also found that this constructed 3-Lie algebra and the commutative associative algebra satisfy the analog of the compatibility condition for transposed Poisson algebras, which is called a transposed Poisson 3-Lie algebra. This motivated them to introduce the concept of a transposed Poisson n-Lie algebra (see Definition 2.2) and propose the following conjecture:
Conjecture 1.1. [2] Let n≥2 be an integer and (L,⋅,μn) a transposed Poisson n-Lie algebra. Let D be a derivation of (L,⋅) and (L,μn). Define an (n+1)-ary operation:
μn+1(x1,⋯,xn+1):=n+1∑i=1(−1)i−1D(xi)μn(x1,⋯,ˆxi,⋯,xn+1),∀x1,⋯,xn+1∈L, |
where ˆxi means that the i-th entry is omitted. Then, (L,⋅,μn+1) is a transposed Poisson (n+1)-Lie algebra.
In this paper, based on the identities for transposed Poisson n-Lie algebras given in Section 2, we prove that Conjecture 1.1 holds under a certain strong condition described in Section 3 (see Definition 2.3 and Theorem 3.2).
Throughout the paper, all vector spaces are taken over a field of characteristic zero. To simplify notations, the commutative associative multiplication (⋅) will be omitted unless the emphasis is needed.
In this section, we first recall some definitions, and then we exhibit a class of identities for transposed Poisson n-Lie algebras.
Definition 2.1. [15] Let n≥2 be an integer. An n-Lie algebra is a vector space L, together with a skew-symmetric linear map [−,⋯,−]:⊗nL→L, such that, for any xi,yj∈L,1≤i≤n−1,1≤j≤n, the following identity holds:
[[y1,⋯,yn],x1,⋯,xn−1]=n∑i=1(−1)i−1[[yi,x1,⋯,xn−1],y1,⋯,ˆyi,⋯,yn]. | (2.1) |
Definition 2.2. [2] Let n≥2 be an integer and L a vector space. The triple (L,⋅,[−,⋯,−]) is called a transposed Poisson n-Lie algebra if (L,⋅) is a commutative associative algebra and (L,[−,⋯,−]) is an n-Lie algebra such that, for any h,xi∈L,1≤i≤n, the following identity holds:
nh[x1,⋯,xn]=n∑i=1[x1,⋯,hxi,⋯,xn]. | (2.2) |
Some identities for transposed Poisson algebras in [2] can be extended to the following theorem for transposed Poisson n-Lie algebras.
Theorem 2.1. Let (L,⋅,[−,⋯,−]) be a transposed Poisson n-Lie algebra. Then, the following identities hold:
(1) For any xi∈L,1≤i≤n+1, we have
n+1∑i=1(−1)i−1xi[x1,⋯,ˆxi,⋯,xn+1]=0; | (2.3) |
(2) For any h,xi,yj∈L,1≤i≤n−1,1≤j≤n, we have
n∑i=1(−1)i−1[h[yi,x1,⋯,xn−1],y1,⋯,ˆyi,⋯,yn]=[h[y1,⋯,yn],x1,⋯,xn−1]; | (2.4) |
(3) For any xi,yj∈L,1≤i≤n−1,1≤j≤n+1, we have
n+1∑i=1(−1)i−1[yi,x1,⋯,xn−1][y1,⋯,ˆyi,⋯,yn+1]=0; | (2.5) |
(4) For any x1,x2,yi∈L,1≤i≤n, we have
n∑i=1n∑j=1,j≠i[y1,⋯,yix1,⋯,yjx2,⋯,yn]=n(n−1)x1x2[y1,y2,⋯,yn]. | (2.6) |
Proof. (1) By Eq (2.2), for any 1≤i≤n+1, we have
nxi[x1,⋯,xi−1,xi+1,⋯,xn+1]=∑j≠i[x1,⋯,xi−1,xi+1,⋯,xixj,⋯,xn+1]. |
Thus, we obtain
n+1∑i=1(−1)i−1nxi[x1,⋯,ˆxi,⋯,xn+1]=n+1∑i=1n+1∑j=1,j≠i(−1)i−1[x1,⋯,ˆxi,⋯,xixj,⋯,xn+1]. |
Note that, for any i>j, we have
(−1)i−1[x1,⋯,xj−1,xixj,xj+1,⋯,ˆxi,⋯,xn]+(−1)j−1[x1,⋯,ˆxj,⋯,xi−1,xjxi,xi+1,⋯,xn]=(−1)i−1+(i−j−1)[x1,⋯,xj−1,xj+1,⋯,xi−1,xixj,xi+1,⋯,xn]+(−1)j−1[x1,⋯,ˆxj,⋯,xi−1,xjxi,xi+1,⋯,xn]=((−1)−j−2+(−1)j−1)[x1,⋯,xj−1,xj+1,⋯,xi−1,xixj,xi+1,⋯,xn]=0, |
which gives n+1∑i=1n+1∑j=1,j≠i(−1)i−1[x1,⋯,ˆxi,⋯,xixj,⋯,xn+1]=0.
Hence, we get
n+1∑i=1(−1)i−1nxi[x1,⋯,ˆxi,⋯,xn+1]=0. |
(2) By Eq (2.2), we have
−[h[y1,⋯,yn],x1,⋯,xn−1]−n−1∑i=1[[y1,⋯,yn],x1,⋯,hxi,⋯,xn−1]=−nh[[y1,⋯,yn],x1,⋯,xn−1], |
and, for any 1≤j≤n,
(−1)j−1([h[yj,x1,⋯,xn−1],y1,⋯,ˆyj,⋯,yn−1]+n∑i=1,i≠j[[yj,x1,⋯,xn−1],y1,⋯,hyi,⋯,ˆyj,⋯,yn−1])=(−1)j−1nh[[yj,x1,⋯,xn−1],y1,⋯,ˆyj,⋯,yn−1]. |
By taking the sum of the above n+1 identities and applying Eq (2.1), we get
−[h[y1,⋯,yn],x1,⋯,xn−1]−n−1∑i=1[[y1,⋯,yn],x1,⋯,hxi,⋯,xn−1]+n∑j=1(−1)j−1([h[yj,x1,⋯,xn−1],y1,⋯,ˆyj,⋯,yn−1]+n∑i=1,i≠j[[yj,x1,⋯,xn−1],y1,⋯,hyi,⋯,ˆyj,⋯,yn−1])=−nh[[y1,⋯,yn],x1,⋯,xn−1]+nhn∑j=1(−1)j−1[[yj,x1,⋯,xn−1],y1,⋯,ˆyj,⋯,yn−1]=0. |
We denote
Aj:=n∑i=1,i≠j(−1)i−1[[yi,x1,⋯,xn−1],y1,⋯,hyj,⋯,ˆyi,⋯,yn],1≤j≤n,Bi:=[[y1,⋯,yn],x1,⋯,hxi,⋯,xn−1],1≤i≤n−1. |
Then, the above equation can be rewritten as
n∑i=1(−1)i−1[h[yi,x1,⋯,xn−1],y1,⋯,ˆyi,⋯,yn]−[h[y1,⋯,yn],x1,⋯,xn−1]+n∑j=1Aj−n−1∑i=1Bi=0. | (2.7) |
By applying Eq (2.1) to Aj,1≤j≤n, we have
Aj=n∑i=1,i≠j(−1)i−1[[yi,x1,⋯,xn−1],y1,⋯,hyj,⋯,ˆyi,⋯,yn]=[[y1,⋯,hyj,⋯,yn],x1,⋯,xn−1]+(−1)j[[hyj,x1,⋯,xn−1],y1,⋯,ˆyj,⋯,yn]. |
Thus, we get
n∑j=1Aj=n∑j=1[[y1,⋯,hyj,⋯,yn],x1,⋯,xn−1]+n∑j=1(−1)j[[hyj,x1,⋯,xn−1],y1,⋯,ˆyj,⋯,yn]=n[h[y1,⋯,yn],x1,⋯,xn−1]+n∑j=1(−1)j[[hyj,x1,⋯,xn−1],y1,⋯,ˆyj,⋯,yn]. |
By applying Eq (2.1) to Bi,1≤i≤n−1, we have
Bi=[[y1,⋯,yn],x1,⋯,hxi,⋯,xn−1]=n∑j=1(−1)j−1[[yj,x1,⋯,hxi,⋯,xn−1],y1,⋯ˆyj,⋯,yn]. |
Thus, we get
n−1∑i=1Bi=n−1∑i=1n∑j=1(−1)j−1[[yj,x1,⋯,hxi,⋯,xn−1],y1,⋯ˆyj,⋯,yn]=n∑j=1n−1∑i=1(−1)j−1[[yj,x1,⋯,hxi,⋯,xn−1],y1,⋯ˆyj,⋯,yn]. |
Note that, by Eq (2.2), we have
n−1∑i=1(−1)j−1[[yj,x1,⋯,hxi,⋯,xn−1],y1,⋯ˆyj,⋯,yn]=(−1)j−1n[h[yj,x1,⋯,xi,⋯,xn−1],y1,⋯ˆyj,⋯,yn]+(−1)j[[hyj,x1,⋯,xi,⋯,xn−1],y1,⋯ˆyj,⋯,yn]. |
Thus, we obtain
n−1∑i=1Bi=n∑j=1(−1)j−1n[h[yj,x1,⋯,xi,⋯,xn−1],y1,⋯ˆyj,⋯,yn]+n∑j=1(−1)j[[hyj,x1,⋯,xi,⋯,xn−1],y1,⋯ˆyj,⋯,yn]. |
By substituting these equations into Eq (2.7), we have
n∑i=1(−1)i−1[h[yi,x1,⋯,xn−1],y1,⋯,ˆyi,⋯,yn]−[h[y1,⋯,yn],x1,⋯,xn−1]+n[h[y1,⋯,yn],x1,⋯,xn−1]+n∑j=1(−1)j[[hyj,x1,⋯,xn−1],y1,⋯,ˆyj,⋯,yn]−n∑j=1(−1)j−1n[h[yj,x1,⋯,xi,⋯,xn−1],y1,⋯ˆyj,⋯,yn]−n∑j=1(−1)j[[hyj,x1,⋯,xi,⋯,xn−1],y1,⋯ˆyj,⋯,yn]=0, |
which implies that
(n−1)(n∑i=1(−1)i[h[yi,x1,⋯,xn−1],y1,⋯,ˆyi,⋯,yn]+[h[y1,⋯,yn],x1,⋯,xn−1])=0. |
Therefore, the proof of Eq (2.4) is completed.
(3) By Eq (2.2), for any 1≤j≤n+1, we have
(−1)j−1n[yj,x1,⋯,xn−1][y1,⋯,ˆyj,⋯,yn+1]=n+1∑i=1,i≠j(−1)j−1[y1,⋯,yi[yj,x1,⋯,xn−1],⋯,ˆyj,⋯,yn+1]. |
By taking the sum of the above n+1 identities, we obtain
n+1∑j=1(−1)j−1n[yj,x1,⋯,xn−1][y1,⋯,ˆyj,⋯,yn+1]=n+1∑j=1n+1∑i=1,i≠j(−1)j−1[y1,⋯,yi[yj,x1,⋯,xn−1],⋯,ˆyj,⋯,yn+1]. |
Thus, we only need to prove the following equation:
n+1∑j=1n+1∑i=1,i≠j(−1)j−1[y1,⋯,yi[yj,x1,⋯,xn−1],⋯,ˆyj,⋯,yn+1]=0. |
Note that
n+1∑j=1n+1∑i=1,i≠j(−1)j−1[y1,⋯,yi[yj,x1,⋯,xn−1],⋯,ˆyj,⋯,yn+1]=n+1∑i=1n+1∑j=1,j≠i(−1)j−1[y1,⋯,yi[yj,x1,⋯,xn−1],⋯,ˆyj,⋯,yn+1]=n+1∑i=1i−1∑j=1(−1)i+j−1[yi[yj,x1,⋯,xn−1],y1,⋯,ˆyj,⋯,ˆyi,⋯,yn+1]+n+1∑i=1n+1∑j=i+1(−1)i+j[yi[yj,x1,⋯,xn−1],y1,⋯,ˆyi,⋯,ˆyj,⋯,yn+1](2.4)=n+1∑i=1(−1)i[yi[y1,⋯,ˆyi,⋯,yn+1],x1,⋯,xn−1](2.3)=0. |
Hence, the conclusion holds.
(4) By applying Eq (2.2), we have
n2x1x2[y1,y2,⋯,yn]=nx1n∑j=1[y1,⋯,yjx2,⋯,yn]=n∑i=1n∑j=1,j≠i[y1,⋯,yix1,⋯,yjx2,⋯,yn]+n∑j=1[y1,⋯,yjx1x2,⋯,yn]=n∑i=1n∑j=1,j≠i[y1,⋯,yix1,⋯,yjx2,⋯,yn]+nx1x2[y1,⋯,yn], |
which gives
n(n−1)x1x2[y1,y2,⋯,yn]=n∑i=1n∑j=1,j≠i[y1,⋯,yix1,⋯,yjx2,⋯,yn]. |
Hence, the proof is completed.
To prove Conjecture 1.1, we need the following extra condition.
Definition 2.3. A transposed Poisson n-Lie algebra (L,⋅,[−,⋯,−]) is called strong if the following identity holds:
y1[hy2,x1,⋯,xn−1]−y2[hy1,x1,⋯,xn−1]+n−1∑i=1(−1)i−1hxi[y1,y2,x1,⋯,ˆxi,⋯,xn−1]=0 | (2.8) |
for any y1,y2,xi∈L,1≤i≤n−1.
Remark 2.1. When n=2, the identity is
y1[hy2,x1]+y2[x1,hy1]+hx1[y1,y2]=0, |
which is exactly Theorem 2.5 (11) in [2]. Thus, in the case of a transposed Poisson algebra, the strong condition always holds. So far, we cannot prove that the strong condition fails to hold for n≥3.
Proposition 2.1. Let (L,⋅,[−,⋯,−]) be a strong transposed Poisson n-Lie algebra. Then,
y1[hy2,x1,⋯,xn−1]−hy1[y2,x1,⋯,xn−1]=y2[hy1,x1,⋯,xn−1]−hy2[y1,x1,⋯,xn−1] | (2.9) |
for any y1,y2,xi∈L,1≤i≤n−1.
Proof. By Eq (2.3), we have
−hy1[y2,x1,⋯,xn−1]+hy2[y1,x1,⋯,xn−1]=n−1∑i=1(−1)i−1hxi[y1,y2,x1,⋯,ˆxi,⋯,xn−1]. |
Then, the statement follows from Eq (2.8).
In this section, we will prove Conjecture 1.1 for strong transposed Poisson n-Lie algebras. First, we recall the notion of derivations of transposed Poisson n-Lie algebras.
Definition 3.1. Let (L,⋅,[−,⋯,−]) be a transposed Poisson n-Lie algebra. The linear operation D:L→L is called a derivation of (L,⋅,[−,⋯,−]) if the following holds for any u,v,xi∈L,1≤i≤n:
(1) D is a derivation of (L,⋅), i.e., D(uv)=D(u)v+uD(v);
(2) D is a derivation of (L,[−,⋯,−]), i.e.,
D([x1,⋯,xn])=n∑i=1[x1,⋯,xi−1,D(xi),xi+1,⋯,xn]. |
Lemma 3.1. Let (L,⋅,[−,⋯,−]) be a transposed Poisson n-Lie algebra and D a derivation of (L,⋅,[−,⋯,−]). For any yi∈L,1≤i≤n+1, we have the following:
(1)
n+1∑i=1(−1)i−1D(yi)D([y1,⋯,ˆyi,⋯,yn+1])=n+1∑i=1n+1∑j=1,j≠i(−1)i−1D(yi)[y1,⋯,D(yj),⋯,ˆyi,⋯,yn+1]; | (3.1) |
(2)
n+1∑i=1(−1)i−1D(yi)D([y1,⋯,ˆyi,⋯,yn+1])=n+1∑i=1n+1∑j=1,j≠in+1∑k=j+1,k≠i(−1)iyi[y1,⋯,D(yj),⋯,D(yk),⋯,ˆyi,⋯,yn+1], | (3.2) |
where, for any i>j, j∑i denotes the empty sum, which is equal to zero.
Proof. (1) The statement follows immediately from Definition 3.1.
(2) By applying Eq (3.1), we need to prove the following equation:
n+1∑i=1n+1∑j=1,j≠i(−1)i−1nD(yi)[y1,⋯,D(yj),⋯,ˆyi,⋯,yn+1]=n+1∑i=1n+1∑j=1,j≠in+1∑k=j+1,k≠i(−1)inyi[y1,⋯,D(yj),⋯,D(yk),⋯,ˆyi,⋯,yn+1]. |
For any 1≤i≤n+1, denote Ai:=nn+1∑j=1,j≠i(−1)i−1D(yi)[y1,⋯,D(yj),⋯,ˆyi,⋯,yn+1]. Then, we have
n+1∑i=1n+1∑j=1,j≠i(−1)i−1nD(yi)[y1,⋯,D(yj),⋯,ˆyi,⋯,yn+1]=n+1∑i=1Ai. |
Note that
Ai=(−1)i−1(nD(yi)[D(y1),y2,⋯,ˆyi,⋯,yn+1]+nD(yi)[y1,D(y2),y3,⋯,ˆyi,⋯,yn+1]+⋯+nD(yi)[y1,⋯,ˆyi,⋯,yn,D(yn+1)])=(−1)i−1([D(yi)D(y1),y2,⋯,ˆyi,⋯,yn+1]+n+1∑k=2,k≠i[D(y1),y2,⋯,ykD(yi),⋯,ˆyi,⋯,yn+1]+[y1,D(yi)D(y2),y3,⋯,ˆyi,⋯,yn+1]+n+1∑k=1,k≠2,i[y1,D(y2),y3,⋯,ykD(yi),⋯,ˆyi,⋯,yn+1]+⋯+[y1,⋯,ˆyi,⋯,yn,D(yi)D(yn+1)]+n∑k=1,k≠i[y1,⋯,ykD(yi),⋯,ˆyi,⋯,yn,D(yn+1)])=(−1)i−1n+1∑j=1,j≠i[y1,⋯,D(yi)D(yj),⋯,ˆyi,⋯,yn+1]+(−1)i−1n+1∑j=1,j≠in+1∑k=1,k≠j,i[y1,⋯,D(yj),⋯,ykD(yi),⋯,ˆyi,⋯,yn+1]. |
Thus, we have
n+1∑i=1Ai=n+1∑j=1n+1∑i=1,i≠j(−1)j−1[y1,⋯,D(yj)D(yi),⋯,ˆyj,⋯,yn+1]+n+1∑i=1n+1∑j=1,j≠in+1∑k=1,k≠i,j(−1)i−1[y1,⋯,D(yj),⋯,ykD(yi),⋯,ˆyi,⋯,yn+1]=T1+T2, |
where
T1:=n+1∑j=1n+1∑i=1,i≠j(−1)j−1[y1,⋯,D(yj)D(yi),⋯,ˆyj,⋯,yn+1],T2:=n+1∑i=1n+1∑j=1,j≠in+1∑k=1,k≠i,j(−1)i−1[y1,⋯,D(yj),⋯,ykD(yi),⋯,ˆyi,⋯,yn+1]. |
Note that
T1=n+1∑j,i=1Bji, |
where Bji=(−1)j−1[y1,⋯,D(yj)D(yi),⋯,ˆyj,⋯,yn+1] for any 1≤j≠i≤n+1, and Bii=0 for any 1≤i≤n+1.
For any 1≤i,j≤n+1, without loss of generality, assume that i<j; then, we have
Bji+Bij=(−1)j−1[y1,⋯,D(yj)D(yi),⋯,ˆyj,⋯,yn+1]+(−1)i−1[y1,⋯,ˆyi,⋯,D(yi)D(yj),⋯,yn+1]=(−1)j−1[y1,⋯,D(yj)D(yi),⋯,ˆyj,⋯,yn+1]+(−1)i−1+j−i+1[y1,⋯,D(yj)D(yi),⋯,ˆyj,⋯,yn+1]=0, |
which implies that T1=n+1∑j,i=1Bji=0.
Thus, we get that n+1∑i=1Ai=T2.
We rewrite
n+1∑i=1n+1∑j=1,j≠in+1∑k=j+1,k≠i(−1)inyi[y1,⋯,D(yj),⋯,D(yk),⋯,ˆyi,⋯,yn+1]=n+1∑i=1n+1∑j=1,j≠in+1∑k=j+1,k≠in+1∑t=1,t≠j,k,i(−1)i⋅[y1,⋯,D(yj),⋯,D(yk),⋯,ytyi,⋯,ˆyi,⋯,yn+1]+n+1∑i=1n+1∑j=1,j≠in+1∑k=j+1,k≠i(−1)i[y1,⋯,yiD(yj),⋯,D(yk),⋯,ˆyi,⋯,yn+1]+n+1∑i=1n+1∑j=1,j≠in+1∑k=j+1,k≠i(−1)i[y1,⋯,D(yj),⋯,yiD(yk),⋯,ˆyi,⋯,yn+1]=M1+M2+M3, |
where
M1:=n+1∑i=1n+1∑j=1,j≠in+1∑k=j+1,k≠in+1∑t=1,t≠j,k,i(−1)i⋅[y1,⋯,D(yj),⋯,D(yk),⋯,ytyi,⋯,ˆyi,⋯,yn+1],M2:=n+1∑i=1n+1∑j=1,j≠in+1∑k=j+1,k≠i(−1)i[y1,⋯,yiD(yj),⋯,D(yk),⋯,ˆyi,⋯,yn+1],M3:=n+1∑i=1n+1∑j=1,j≠in+1∑k=j+1,k≠i(−1)i[y1,⋯,D(yj),⋯,yiD(yk),⋯,ˆyi,⋯,yn+1]. |
Note that
M1=n+1∑i=1n+1∑j=1,j≠in+1∑k=j+1,k≠in+1∑t=1,t≠j,k,i(−1)i⋅[y1,⋯,D(yj),⋯,D(yk),⋯,ytyi,⋯,ˆyi,⋯,yn+1]=n+1∑i,j,k,t=1Bijkt, |
where
Bijkt={0,if any two indices are equal or k<j;(−1)i[y1,⋯,D(yj),⋯,D(yk),⋯,ytyi,⋯,ˆyi,⋯,yn+1],otherwise. |
For any 1≤j,k≤n+1, without loss of generality, assume that t<i; then, we have
Bijkt+Btjki=(−1)i[y1,⋯,D(yj),⋯,D(yk),⋯,ytyi,⋯,ˆyi,⋯,yn+1]+(−1)t[y1,⋯,D(yj),⋯,D(yk),⋯,ˆyt,⋯,ytyi,⋯,yn+1]=(−1)i[y1,⋯,D(yj),⋯,D(yk),⋯,ytyi,⋯,ˆyi,⋯,yn+1]+(−1)t+i−t−1[y1,⋯,D(yj),⋯,D(yk),⋯,ytyi,⋯,ˆyi,⋯,yn+1]=0, |
which implies that M1=0.
Therefore, we only need to prove the following equation:
M2+M3=n+1∑i=1n+1∑j=1,j≠in+1∑k=1,k≠i,j(−1)i−1[y1,⋯,D(yj),⋯,ykD(yi),⋯,ˆyi,⋯,yn+1]. |
First, we have
n+1∑j=1,j≠in+1∑k=j+1,k≠i(−1)i[y1,⋯,yiD(yj),⋯,D(yk),⋯,ˆyi,⋯,yn+1]+n+1∑j=1,j≠in+1∑k=j+1,k≠i(−1)i[y1,⋯,D(yj),⋯,yiD(yk),⋯,ˆyi,⋯,yn+1]=n+1∑k=1,k≠ik−1∑j=1,j≠i(−1)i[y1,⋯,yiD(yj),⋯,D(yk),⋯,ˆyi,⋯,yn+1]+n+1∑j=1,j≠in+1∑k=j+1,k≠i(−1)i[y1,⋯,D(yj),⋯,yiD(yk),⋯,ˆyi,⋯,yn+1]=n+1∑j=1,j≠ij−1∑k=1,k≠i(−1)i[y1,⋯,yiD(yk),⋯,D(yj),⋯,ˆyi,⋯,yn+1]+n+1∑j=1,j≠in+1∑k=j+1,k≠i(−1)i[y1,⋯,D(yj),⋯,yiD(yk),⋯,ˆyi,⋯,yn+1]=n+1∑j=1,j≠in+1∑k=1,k≠i,j(−1)i[y1,⋯,D(yj),⋯,yiD(yk),⋯,ˆyi,⋯,yn+1]. |
Thus,
M2+M3=n+1∑i=1n+1∑j=1,j≠in+1∑k=1,k≠i,j(−1)i[y1,⋯,D(yj),⋯,yiD(yk),⋯,ˆyi,⋯,yn+1]=n+1∑j=1n+1∑i=1,i≠jn+1∑k=1,k≠i,j(−1)i[y1,⋯,D(yj),⋯,yiD(yk),⋯,ˆyi,⋯,yn+1]=n+1∑j=1n+1∑i=1,i≠ji−1∑k=1,k≠j(−1)i[y1,⋯,D(yj),⋯,yiD(yk),⋯,ˆyi,⋯,yn+1]+n+1∑j=1n+1∑i=1,i≠jn+1∑k=i+1,k≠j(−1)i[y1,⋯,D(yj),⋯,ˆyi,⋯,yiD(yk),⋯,yn+1]. |
Note that, for any 1≤j≤n+1, we have
n+1∑i=1,i≠ji−1∑k=1,k≠j(−1)i[y1,⋯,D(yj),⋯,yiD(yk),⋯,ˆyi,⋯,yn+1]=n+1∑i=1,i≠ji−1∑k=1,k≠j(−1)i[y1,⋯,D(yj),⋯,yk−1,yiD(yk),yk+1,⋯,ˆyi⋯,yn+1]=n+1∑i=1,i≠ji−1∑k=1,k≠j(−1)k−1[y1,⋯,D(yj),⋯,ˆyk,⋯,yi−1,yiD(yk),yi+1,⋯,yn+1]=n+1∑i=1,i≠ji−1∑k=1,k≠j(−1)k−1[y1,⋯,D(yj),⋯,ˆyk,⋯,yiD(yk),⋯,yn+1]. |
Similarly, we have
n+1∑i=1,i≠jn+1∑k=i+1,k≠j(−1)i[y1,⋯,D(yj),⋯,ˆyi,⋯,yiD(yk),⋯,yn+1]=n+1∑i=1,i≠jn+1∑k=i+1,k≠j(−1)k−1[y1,⋯,D(yj),⋯,yiD(yk),⋯,ˆyk,⋯,yn+1]. |
Thus,
M2+M3=n+1∑j=1n+1∑i=1,i≠ji−1∑k=1,k≠j(−1)k−1[y1,⋯,D(yj),⋯,ˆyk,⋯,yiD(yk),⋯,yn+1]+n+1∑j=1n+1∑i=1,i≠jn+1∑k=i+1,k≠j(−1)k−1[y1,⋯,D(yj),⋯,yiD(yk),⋯,ˆyk,⋯,yn+1]=n+1∑j=1n+1∑i=1,i≠jn+1∑k=1,k≠i,j(−1)k−1[y1,⋯,D(yj),⋯,yiD(yk),⋯,ˆyk,⋯,yn+1]=n+1∑k=1n+1∑j=1,j≠kn+1∑i=1,i≠j,k(−1)k−1[y1,⋯,D(yj),⋯,yiD(yk),⋯,ˆyk,⋯,yn+1]=n+1∑i=1n+1∑j=1,j≠in+1∑k=1,k≠j,i(−1)i−1[y1,⋯,D(yj),⋯,ykD(yi),⋯,ˆyi,⋯,yn+1]. |
The proof is completed.
Theorem 3.1. Let (L,⋅,[−,⋯,−]) be a strong transposed Poisson n-Lie algebra and D a derivation of (L,⋅,[−,⋯,−]). Define an (n+1)-ary operation:
μn+1(x1,⋯,xn+1):=n+1∑i=1(−1)i−1D(xi)[x1,⋯,ˆxi,⋯,xn+1] | (3.3) |
for any xi∈L,1≤i≤n+1. Then, (L,μn+1) is an (n+1)-Lie algebra.
Proof. For convenience, we denote
μn+1(x1,⋯,xn+1):=[x1,⋯,xn+1]. |
On one hand, we have
[[y1,⋯,yn+1],x1,⋯,xn](3.3)=n+1∑i=1(−1)i−1[D(yi)[y1,⋯,ˆyi,⋯,yn+1],x1,⋯,xn](3.3)=n+1∑i=1(−1)i−1D(D(yi)[y1,⋯,ˆyi,⋯,yn+1])[x1,⋯,xn]+n+1∑i=1n∑j=1(−1)i+j−1D(xj)[D(yi)[y1,⋯,ˆyi,⋯,yn+1],x1,⋯,ˆxj,⋯,xn]=n+1∑i=1(−1)i−1D2(yi)[y1,⋯,ˆyi,⋯,yn+1][x1,⋯,xn]+n+1∑i=1(−1)i−1D(yi)D([y1,⋯,ˆyi,⋯,yn+1])[x1,⋯,xn]+n+1∑i=1n∑j=1(−1)i+j−1D(xj)[D(yi)[y1,⋯,ˆyi,⋯,yn+1],x1,⋯,ˆxj,⋯,xn](3.1)=n+1∑i=1(−1)i−1D2(yi)[y1,⋯,ˆyi,⋯,yn+1][x1,⋯,xn]+n+1∑i=1n+1∑k=1,k≠i(−1)i−1D(yi)[y1,⋯,D(yk),⋯,ˆyi,⋯,yn+1][x1,⋯,xn]+n+1∑i=1n∑j=1(−1)i+j−1D(xj)[D(yi)[y1,⋯,ˆyi,⋯,yn+1],x1,⋯,ˆxj,⋯,xn]=n+1∑i=1(−1)i−1D2(yi)[y1,⋯,ˆyi,⋯,yn+1][x1,⋯,xn]+n+1∑k=1k−1∑i=1(−1)k+i−1D(yi)[D(yk),y1,⋯,ˆyi,⋯,ˆyk,⋯,yn+1][x1,⋯,xn]+n+1∑k=1n+1∑i=k+1(−1)i+kD(yi)[D(yk),y1,⋯,ˆyk,⋯,ˆyi,⋯,yn+1][x1,⋯,xn]+n+1∑i=1n∑j=1(−1)i+j−1D(xj)[D(yi)[y1,⋯,ˆyi,⋯,yn+1],x1,⋯,ˆxj,⋯,xn]. |
On the other hand, for any 1≤k≤n, we have
(−1)k−1[[yk,x1,⋯,xn],y1,⋯,ˆyk,⋯,yn+1](3.3)=(−1)k−1[D(yk)[x1,⋯,xn],y1,⋯,ˆyk,⋯,yn+1]+n∑j=1(−1)j+k−1[D(xj)[yk,x1,⋯,ˆxj,⋯,xn],y1,⋯,ˆyk,⋯,yn+1](3.3)=(−1)k−1D(D(yk)[x1,⋯,xn])[y1,⋯,ˆyk,⋯,yn+1]+k−1∑i=1(−1)i+k−1D(yi)[D(yk)[x1,⋯,xn],y1,⋯,ˆyi,⋯,ˆyk,⋯,yn+1]+n+1∑i=k+1(−1)i+kD(yi)[D(yk)[x1,⋯,xn],y1,⋯,ˆyk,⋯,ˆyi,⋯,yn+1]+n∑j=1(−1)j+k−1D(D(xj)[yk,x1,⋯,ˆxj,⋯,xn])[y1,⋯,ˆyk,⋯,yn+1]+n∑j=1n+1∑i=k+1((−1)i+jD(yi)⋅[D(xj)[yk,x1,⋯,ˆxj,⋯,xn],y1,⋯,ˆyk,⋯,ˆyi,⋯,yn+1])+n∑j=1k−1∑i=1((−1)i+j−1D(yi)⋅[D(xj)[yk,x1,⋯,ˆxj,⋯,xn],y1,⋯,ˆyi,⋯,ˆyk,⋯,yn+1])=(−1)k−1D2(yk)[x1,⋯,xn][y1,⋯,ˆyk,⋯,yn+1]+k−1∑i=1(−1)i+k−1D(yi)[D(yk)[x1,⋯,xn],y1,⋯,ˆyi,⋯,ˆyk,⋯,yn+1]+n+1∑i=k+1(−1)i+kD(yi)[D(yk)[x1,⋯,xn],y1,⋯,ˆyk,⋯,ˆyi,⋯,yn+1]+n∑j=1(−1)j+k−1D2(xj)[yk,x1,⋯,ˆxj,⋯,xn][y1,⋯,ˆyk,⋯,yn+1]+n∑j=1n+1∑i=k+1((−1)i+jD(yi)⋅[D(xj)[yk,x1,⋯,ˆxj,⋯,xn],y1,⋯,ˆyk,⋯,ˆyi,⋯,yn+1])+n∑j=1k−1∑i=1((−1)i+j−1D(yi)⋅[D(xj)[yk,x1,⋯,ˆxj,⋯,xn],y1,⋯,ˆyi,⋯,ˆyk,⋯,yn+1])+(−1)k−1D(yk)D([x1,⋯,xn])[y1,⋯,ˆyk,⋯,yn+1]+n∑j=1(−1)j+k−1D(xj)D([yk,x1,⋯,ˆxj,⋯,xn])[y1,⋯,ˆyk,⋯,yn+1](3.2)=(−1)k−1D2(yk)[x1,⋯,xn][y1,⋯,ˆyk,⋯,yn+1]+k−1∑i=1(−1)i+k−1D(yi)[D(yk)[x1,⋯,xn],y1,⋯,ˆyi,⋯,ˆyk,⋯,yn+1]+n+1∑i=k+1(−1)i+kD(yi)[D(yk)[x1,⋯,xn],y1,⋯,ˆyk,⋯,ˆyi,⋯,yn+1]+n∑j=1(−1)j+k−1D2(xj)[yk,x1,⋯,ˆxj,⋯,xn][y1,⋯,ˆyk,⋯,yn+1]+n∑j=1n+1∑i=k+1((−1)i+jD(yi)⋅[D(xj)[yk,x1,⋯,ˆxj,⋯,xn],y1,⋯,ˆyk,⋯,ˆyi,⋯,yn+1])+n∑j=1k−1∑i=1((−1)i+j−1D(yi)⋅[D(xj)[yk,x1,⋯,ˆxj,⋯,xn],y1,⋯,ˆyi,⋯,ˆyk,⋯,yn+1])+n∑j=1n∑t=j+1(−1)kyk[x1,⋯,D(xj),⋯,D(xt),⋯,xn][y1,⋯,ˆyk,⋯,yn+1]+n∑i=1n∑j=1,j≠i(−1)k+ixi[D(yk),x1,⋯,D(xj),⋯,ˆxi,⋯,xn][y1,⋯,ˆyk,⋯,yn+1]+n∑i=1n∑j=1,j≠in∑t=j+1,t≠i(−1)k+ixi[yk,x1,⋯,D(xj),D(xt),⋯,ˆxi,⋯,xn]⋅[y1,⋯,ˆyk,⋯,yn+1]. |
We denote
n+1∑i=1(−1)i−1[[yi,x1,⋯,xn],y1,⋯,ˆyi,⋯,yn+1]=7∑i=1Ai, |
where
A1:=n+1∑i=1(−1)i−1D2(yi)[x1,⋯,xn][y1,⋯,ˆyi,⋯,yn+1],A2:=n+1∑k=1n∑j=1(−1)k+j−1D2(xj)[yk,x1,⋯,ˆxj,⋯,xn][y1,⋯,ˆyk,⋯,yn+1],A3:=n+1∑i=1n∑j=1n∑k=j+1(−1)iyi[x1,⋯,D(xj),⋯,D(xk),⋯,xn][y1,⋯,ˆyi,⋯,yn+1],A4:=n+1∑k=1n∑i=1n∑j=1,j≠in∑t=j+1,t≠i((−1)k+ixi[yk,x1,⋯,D(xj),D(xt),⋯,ˆxi,⋯,xn]⋅[y1,⋯,ˆyk,⋯,yn+1]),A5:=n+1∑k=1k−1∑i=1(−1)k+i−1D(yi)[D(yk)[x1,⋯,xn],y1,⋯,ˆyi,⋯,ˆyk,⋯,yn+1]+n+1∑k=1n+1∑i=k+1(−1)i+kD(yi)[D(yk)[x1,⋯,xn],y1,⋯,ˆyk,⋯,ˆyi,⋯,yn+1],A6:=n+1∑k=1n∑i=1n∑j=1,j≠i((−1)k+ixi[D(yk),x1,⋯,D(xj),⋯,ˆxi,⋯,xn]⋅[y1,⋯,ˆyk,⋯,yn+1]),A7:=n+1∑k=1n∑j=1n+1∑i=k+1((−1)k+i+jD(yi)⋅[D(xj)[yk,x1,⋯,ˆxj,⋯,xn],y1,⋯,ˆyk,⋯,ˆyi,⋯,yn+1])+n+1∑k=1n∑j=1k−1∑i=1((−1)k+i+j−1D(yi)⋅[D(xj)[yk,x1,⋯,ˆxj,⋯,xn],y1,⋯,ˆyi,⋯,ˆyk,⋯,yn+1]). |
By Eq (2.5), for fixed j, we have
n+1∑k=1(−1)k+j−1D2(xj)[yk,x1,⋯,ˆxj,⋯,xn][y1,⋯,ˆyk,⋯,yn+1]=0. |
So, we obtain that A2=0.
By Eq (2.3), for fixed j and k, we have
n+1∑i=1(−1)iyi[x1,⋯,D(xj),⋯,D(xk),⋯,xn][y1,⋯,ˆyi,⋯,yn+1]=0. |
So, we obtain that A3=0.
By Eq (2.5), for fixed j and t, we have
n+1∑k=1(−1)k+ixi[yk,x1,⋯,D(xj),D(xt),⋯,ˆxi,⋯,xn][y1,⋯,ˆyk,⋯,yn+1]=0. |
So, we obtain that A4=0.
By Eq (2.9), for fixed i and k, we have
(−1)k+i−1D(yi)[D(yk)[x1,⋯,xn],y1,⋯,ˆyi,⋯,ˆyk,⋯,yn+1]+(−1)i+kD(yk)[D(yi)[x1,⋯,xn],y1,⋯,ˆyi,⋯,ˆyk,⋯,yn+1]=(−1)k+i−1D(yi)[D(yk),y1,⋯,ˆyi,⋯,ˆyk,⋯,yn+1][x1,⋯,xn]+(−1)i+kD(yk)[D(yi),y1,⋯,ˆyi,⋯,ˆyk,⋯,yn+1][x1,⋯,xn]. |
Thus, we obtain
A5=n+1∑k=1k−1∑i=1(−1)k+i−1D(yi)[D(yk),y1,⋯,ˆyi,⋯,ˆyk,⋯,yn+1][x1,⋯,xn]+n+1∑k=1n+1∑i=k+1(−1)i+kD(yi)[D(yk),y1,⋯,ˆyk,⋯,ˆyi,⋯,yn+1][x1,⋯,xn]. |
By Eq (2.3), for fixed j and k, we have
n∑i=1(−1)k+ixi[D(yk),x1,⋯,D(xj),⋯,ˆxi,⋯,xn]=(−1)k−1D(yk)[x1,⋯,D(xj),⋯,xn]+(−1)k+j−1D(xj)[D(yk),x1,⋯,xn]=(−1)k+jD(yk)[D(xj),x1,⋯,ˆxj,⋯,xn]+(−1)k+j−1D(xj)[D(yk),x1,⋯,xn]. |
Thus, we get
A6=n+1∑k=1n∑j=1(−1)k+jD(yk)[D(xj),x1,⋯,ˆxj,⋯,xn][y1,⋯,ˆyk,⋯,yn+1]+n+1∑k=1n∑j=1(−1)k+j−1D(xj)[D(yk),x1,⋯,xn][y1,⋯,ˆyk,⋯,yn+1]. |
By Eq (2.4), for fixed j and i, we have
n+1∑k=i+1(−1)k+i+j−1D(yi)[D(xj)[yk,x1,⋯,ˆxj,⋯,xn],y1,⋯,ˆyi,⋯,ˆyk,⋯,yn+1]+i−1∑k=1(−1)k+i+jD(yi)[D(xj)[yk,x1,⋯,ˆxj,⋯,xn],y1,⋯,ˆyk,⋯,ˆyi,⋯,yn+1]=(−1)j+i−1D(yi)[D(xj)[y1,⋯,ˆyi,⋯,yn+1],x1,⋯,ˆxj,⋯,xn]. |
So, we obtain
A7=n∑j=1n+1∑i=1(−1)j+i−1D(yi)[D(xj)[y1,⋯,ˆyi,⋯,yn+1],x1,⋯,ˆxj,⋯,xn]. |
By Eq (2.9), we have
(−1)i+jD(yi)[D(xj),x1,⋯,ˆxj,⋯,xn][y1,⋯,ˆyi,⋯,yn+1]+(−1)i+j−1D(xj)[D(yi),x1,⋯,xn][y1,⋯,ˆyi,⋯,yn+1]+(−1)j+i−1D(yi)[D(xj)[y1,⋯,ˆyi,⋯,yn+1],x1,⋯,ˆxj,⋯,xn]=(−1)j+i−1D(xj)[D(yi)[y1,⋯,ˆyi,⋯,yn+1],x1,⋯,ˆxj,⋯,xn]. |
So, we get
A6+A7=n+1∑i=1n∑j=1(−1)j+i−1D(xj)[D(yi)[y1,⋯,ˆyi,⋯,yn+1],x1,⋯,ˆxj,⋯,xn]. |
Thus, we have
7∑i=1Ai=A1+A5+A6+A7=[[y1,⋯,yn+1],x1,⋯,xn]. |
Therefore, (L,μn+1) is an (n+1)-Lie algebra.
Now, we can prove Conjecture 1.1 for strong transposed Poisson n-Lie algebras.
Theorem 3.2. With the notations in Theorem 3.1, (L,⋅,μn+1) is a strong transposed Poisson (n+1)-Lie algebra.
Proof. For convenience, we denote μn+1(x1,⋯,xn+1):=[x1,⋯,xn+1]. According to Theorem 3.1, we only need to prove Eqs (2.2) and (2.8).
Proof of Eq (2.2). By Eq (3.3), we have
n+1∑i=1[x1,⋯,hxi,⋯,xn+1]=D(hx1)[x2,⋯,xn+1]+n+1∑j=2(−1)j−1D(xj)[hx1,x2,⋯,ˆxj,⋯,xn+1]−D(hx2)[x1,x3,⋯,xn+1]+n+1∑j=1,j≠2(−1)j−1D(xj)[x1,hx2,x3,⋯,ˆxj,⋯,xn+1]+⋯+(−1)nD(hxn)[x1,⋯,xn]+n∑j=1(−1)j−1D(xj)[x1,⋯,ˆxj,⋯,xn,hxn+1]=n+1∑i=1(−1)i−1D(hxi)[x1,⋯,ˆxi,⋯,xn]+n+1∑i=1n+1∑j=1,j≠i(−1)j−1D(xj)[x1,,⋯,hxi,⋯,ˆxj,⋯,xn+1]=n+1∑i=1(−1)i−1D(hxi)[x1,⋯,ˆxi,⋯,xn+1]+n+1∑j=1n+1∑i=1,i≠j(−1)j−1D(xj)[x1,⋯,hxi,⋯,ˆxj,⋯,xn+1]=n+1∑i=1(−1)i−1hD(xi)[x1,⋯,ˆxi,⋯,xn+1]+n+1∑i=1(−1)i−1xiD(h)[x1,⋯,ˆxi,⋯,xn+1]+n+1∑j=1n+1∑i=1,i≠j(−1)j−1D(xj)[x1,⋯,hxi,⋯,ˆxj,⋯,xn+1](2.3)=n+1∑i=1(−1)i−1hD(xi)[x1,⋯,ˆxi,⋯,xn+1]+n+1∑j=1n+1∑i=1,i≠j(−1)j−1D(xj)[x1,⋯,hxi,⋯,ˆxj,⋯,xn+1](3.3)=h[x1,⋯,xn+1]+n+1∑j=1n+1∑i=1,i≠j(−1)j−1D(xj)[x1,⋯,hxi,⋯,ˆxj,⋯,xn+1](2.2)=h[x1,⋯,xn+1]+nhn+1∑j=1(−1)j−1D(xj)[x1,⋯,ˆxj,⋯,xn+1](3.3)=h[x1,⋯,xn+1]+nh[x1,⋯,xn+1]=(n+1)h[x1,⋯,xn+1]. |
Proof of Eq (2.8). By Eq (3.3), we have
y1[hy2,x1,⋯,xn]−y2[hy1,x1,⋯,xn]+n∑i=1(−1)i−1hxi[y1,y2,x1,⋯,ˆxi,⋯,xn]=y1y2D(h)[x1,⋯,xn]+y1hD(y2)[x1,⋯,xn]−y1D(x1)[hy2,x2,⋯,xn]+y1D(x2)[hy2,x1,x3,⋯,xn]+⋯+(−1)ny1D(xn)[hy2,x1,⋯,xn−1]−y2y1D(h)[x1,⋯,xn]−y2hD(y1)[x1,⋯,xn]+y2D(x1)[hy1,x2,⋯,xn]−y2D(x2)[hy1,x1,x3,⋯,xn]+⋯+(−1)n−1y2D(xn)[hy1,x1,⋯,xn−1]+hx1D(y1)[y2,x2,⋯,xn]−hx1D(y2)[y1,x2,⋯,xn]+hx1D(x2)[y1,y2,x3,⋯,xn]+⋯+(−1)n+1hx1D(xn)[y1,y2,x2,⋯,xn−1]−hx2D(y1)[y2,x1,x3,⋯,xn]+hx2D(y2)[y1,x1,x3,⋯,xn]−hx2D(x1)[y1,y2,x3,⋯,xn]+⋯+(−1)n+2hx2D(xn)[y1,y2,x1,x3,⋯,xn−1]+⋯+(−1)n−1hxnD(y1)[y2,x1,⋯,xn−1]+(−1)nhxnD(y2)[y1,x1,⋯,xn−1]+(−1)n+1hxnD(x1)[y1,y2,x2,⋯,xn−1]+⋯+(−1)2n−1hxnD(xn−1)[y1,y2,x1,⋯,xn−2]=−y2hD(y1)[x1,⋯,xn]+hx1D(y1)[y2,x2,⋯,xn]+n∑i=2(−1)i−1hxiD(y1)[y2,x1,⋯,ˆxi,⋯,xn]+y1hD(y2)[x1,⋯,xn]−hx1D(y2)[y1,x2,⋯,xn]+n∑i=2(−1)ihxiD(y2)[y1,x1,⋯,ˆxi,⋯,xn]−y1D(x1)[hy2,x2,⋯,xn]+y2D(x1)[hy1,x2,⋯,xn]+n∑i=2(−1)i−1hxiD(x1)[y1,y2,x2,⋯,ˆxi,⋯,xn]+y1D(x2)[hy2,x1,x3,⋯,xn]−y2D(x2)[hy1,x1,x3,⋯,xn]+hx1D(x2)[y1,y2,x3,⋯,xn]+n∑i=3(−1)ihxiD(x2)[y1,y2,x1,x3,⋯,ˆxi,⋯,xn]⋯+(−1)ny1D(xn)[hy2,x1,⋯,xn−1]+(−1)n−1y2D(xn)[hy1,x1,⋯,xn−1]+n−1∑j=1(−1)n+j−1hxjD(xn)[y1,y2,x1,⋯,ˆxj,⋯,xn−1]=A1+A2+n∑i=1Bi, |
where
A1:=−y2hD(y1)[x1,⋯,xn]+n∑i=1(−1)i−1hxiD(y1)[y2,x1,⋯,ˆxi,⋯,xn],A2:=y1hD(y2)[x1,⋯,xn]+n∑i=1(−1)ihxiD(y2)[y1,x1,⋯,ˆxi,⋯,xn], |
and, for any 1≤i≤n,
Bi:=(−1)iy1D(xi)[hy2,x1,⋯,ˆxi,⋯,xn]+(−1)i−1y2D(xi)[hy1,x1,⋯,ˆxi,⋯,xn]+i−1∑j=1(−1)i+j−1hxjD(xi)[y1,y2,x1,⋯,ˆxj,⋯,ˆxi,⋯,xn]+n∑j=i+1(−1)i+jhxjD(xi)[y1,y2,x1,⋯,ˆxi,⋯,ˆxj,⋯,xn]. |
By Eq (2.3), we have
A1=hD(y1)(−y2[x1,⋯,xn]+n∑i=1(−1)i−1xi[y2,x1,⋯,ˆxi,⋯,xn])=0. |
Similarly, we have that A2=0.
By Eq (2.8), for any 1≤i≤n, we have
Bi=(−1)iD(xi)(y1[hy2,x1,⋯,ˆxi,⋯,xn]−y2[hy1,x1,⋯,ˆxi,⋯,xn]+i−1∑j=1(−1)j−1hxj[y1,y2,x1,⋯,ˆxj,⋯,ˆxi,⋯,xn]+n∑j=i+1(−1)jhxj[y1,y2,x1,⋯,ˆxi,⋯,ˆxj,⋯,xn])=0. |
Thus, we get
y1[hy2,x1,⋯,xn]−y2[hy1,x1,⋯,xn]+n∑i=1(−1)i−1hxi[y1,y2,x1,⋯,ˆxi,⋯,xn]=0. |
The proof is completed.
Example 3.1. The commutative associative algebra L=k[x1,x2,x3], together with the bracket
[x,y]:=x⋅D1(y)−y⋅D1(x),∀x,y∈L. |
gives a transposed Poisson algebra (L,⋅,[−,−]), where D1=∂x1 ([2, Proposition 2.2]). Note that the transposed Poisson algebra (L,⋅,[−,−]) is strong according to Remark 2.5. Now, let D2=∂x2; one can check that D2 is a derivation of (L,⋅,[−,−]). Then, there exists a strong transposed Poisson 3-Lie algebra defined by
[x,y,z]:=D2(x)(yD1(z)−zD1(y))+D2(y)(zD1(x)−xD1(z))+D2(z)(xD1(y)−yD1(x)), ∀x,y,z∈L. |
We note that [x1,x2,x3]=x3, which is non-zero. The strong condition can be checked as follows:
For any h,y1,y2,z1,z2∈L, by a direct calculation, we have
y1[hy2,z1,z2]=y1z1hD1(z2)D2(y2)−y1z2hD1(z1)D2(y2)+y1y2z1D1(z2)D2(h)−y1y2z2D1(z1)D2(h)−y1y2hD1(z2)D2(z1)+y1z2hD1(y2)D2(z1)+y1y2z2D1(h)D2(z1)+y1y2hD1(z1)D2(z2)−y1z1hD1(y2)D2(z2)−y1y2z1D1(h)D2(z2), |
−y2[hy1,z1,z2]=−y2z1hD1(z2)D2(y1)+y2z2hD1(z1)D2(y1)−y1y2z1D1(z2)D2(h)+y1y2z2D1(z1)D2(h)+y1y2hD1(z2)D2(z1)−y2z2hD1(y1)D2(z1)−y1y2z2D1(h)D2(z1)−y1y2hD1(z1)D2(z2)+y2z1hD1(y1)D2(z2)+y1y2z1D1(h)D2(z2), |
hz1[y1,y2,z2]=hy2z1D1(z2)D2(y1)−hz1z2D1(y2)D2(y1)−hy1z1D1(z2)D2(y2)+hz1z2D1(y1)D2(y2)+hy1z1D1(y2)D2(z2)−hy2z1D1(y1)D2(z2), |
−hz2[y1,y2,z1]=−hy2z2D1(z1)D2(y1)+hz1z2D1(y2)D2(y1)+hy1z2D1(z1)D2(y2)−hz1z2D1(y1)D2(y2)−hy1z2D1(y2)D2(z1)+hy2z2D1(y1)D2(z1). |
Thus, we get
y1[hy2,z1,z2]−y2[hy1,z1,z2]+hz1[y1,y2,z2]−hz2[y1,y2,z1]=0. |
We have studied transposed Poisson n-Lie algebras. We first established an important class of identities for transposed Poisson n-Lie algebras, which were subsequently used throughout the paper. We believe that the identities developed here will be useful in investigations of the structure of transposed Poisson n-Lie algebras in the future. Then, we introduced the notion of a strong transposed Poisson n-Lie algebra and derived an (n+1)-Lie algebra from a strong transposed Poisson n-Lie algebra with a derivation. Finally, we proved the conjecture of Bai et al. [2] for strong transposed Poisson n-Lie algebras.
The authors declare that they have not used artificial intelligence tools in the creation of this article.
Ming Ding was supported by the Guangdong Basic and Applied Basic Research Foundation (2023A1515011739) and the Basic Research Joint Funding Project of University and Guangzhou City under grant number 202201020103.
The authors declare that there is no conflict of interest.
[1] | D. Liberzon, Switching in systems and control, MA: Birkhäuser Boston, 2003. https://doi.org/10.1007/978-1-4612-0017-8 |
[2] |
J. P. Hespanha, Uniform stability of switched linear systems extension of Lasalle's invariance principle, IEEE T. Automat. Contr., 49 (2004), 470–482. https://doi.org/10.1109/TAC.2004.825641 doi: 10.1109/TAC.2004.825641
![]() |
[3] |
H. Lin, P. J. Antsaklis, Stability and stabilizability of switched linear systems: a survey of recent results, IEEE T. Automat. Contr., 54 (2009), 308–322. https://doi.org/10.1109/TAC.2008.2012009 doi: 10.1109/TAC.2008.2012009
![]() |
[4] |
X. Liu, Y. Yu, H. Chen, Stability of perturbed switched nonlinear systems with delays, Nonlinear Anal. Hybri., 25 (2017), 114–125. https://doi.org/10.1016/j.nahs.2017.03.003 doi: 10.1016/j.nahs.2017.03.003
![]() |
[5] |
H. Ren, G. Zong, T. Li, Event-triggered finite-time control for networked switched linear systems with asynchronous switching, IEEE T. Syst. Man Cy. S., 48 (2018), 1874–1884. https://doi.org/10.1109/TSMC.2017.2789186 doi: 10.1109/TSMC.2017.2789186
![]() |
[6] |
G. Zheng, T. Wang, The moment exponential stability of infinite-dimensional linear stochastic switched systems, AIMS Mathematics, 8 (2023), 24663–24680. https://doi.org/10.3934/math.20231257 doi: 10.3934/math.20231257
![]() |
[7] | J. P. Hespanha, A. S. Morse, Stability of switched systems with average dwell-time, Proceedings of the 38th IEEE Conference on Decision and Control, Phoenix, AZ, USA, 1999, 2655–2660. https://doi.org/10.1109/CDC.1999.831330 |
[8] |
L. Liu, H. Zhou, H. Liang, L. Wang, Stability and stabilization of nonlinear switched systems under average dwell time, Appl. Math. Comput., 298 (2017), 77–94. https://doi.org/10.1016/j.amc.2016.11.006 doi: 10.1016/j.amc.2016.11.006
![]() |
[9] |
Y. Yin, G. Zong, X. Zhao, Improved stability criteria for switched positive linear systems with average dwell time, J. Franklin I., 354 (2017), 3472–3484. https://doi.org/10.1016/j.jfranklin.2017.02.005 doi: 10.1016/j.jfranklin.2017.02.005
![]() |
[10] |
X. Zhao, P. Zhang, P. Shi, M. Liu, Stability and stabilization of switched linear systems with mode-dependent average dwell time, IEEE T. Automat. Contr., 57 (2012), 1809–1815. https://doi.org/10.1109/TAC.2011.2178629 doi: 10.1109/TAC.2011.2178629
![]() |
[11] |
Y. Yin, X. Zhao, X. Zheng, New stability and stabilization conditions of switched systems with mode-dependent average dwell time, Circuits Syst. Signal Process., 36 (2017), 82–98. https://doi.org/10.1007/s00034-016-0306-7 doi: 10.1007/s00034-016-0306-7
![]() |
[12] |
Q. Yu, G. S. Zhai, Stability analysis of switched systems under Φ-dependent average dwell time, IEEE Access, 8 (2020), 30655–30663. https://doi.org/10.1109/ACCESS.2020.2971267 doi: 10.1109/ACCESS.2020.2971267
![]() |
[13] |
Q. Yu, H. Lv, The new stability criteria of discrete-time switched systems with an improved mode dependent average dwell time approach, Appl. Math. Comput., 366 (2020), 124730. https://doi.org/10.1016/j.amc.2019.124730 doi: 10.1016/j.amc.2019.124730
![]() |
[14] |
Q. Yu, J. L. Yan, A novel average dwell time strategy for stability analysis of discrete-time switched systems by T-S fuzzy modeling, J. Comput. Appl. Math., 391 (2021), 113306. https://doi.org/10.1016/j.cam.2020.113306 doi: 10.1016/j.cam.2020.113306
![]() |
[15] |
Q. Yu, X. Yuan, Stability analysis for positive switched systems having stable and unstable subsystems based on a weighted average dwell time scheme, ISA Tran., 136 (2023), 275–283. https://doi.org/10.1016/j.isatra.2022.10.019 doi: 10.1016/j.isatra.2022.10.019
![]() |
[16] |
I. Asier, M. Sen, Exponential stability of simultaneously triangularizable switched systems with explicit calculation of common Lyapunov function, Appl. Math. Lett., 22 (2009), 1549–1555. https://doi.org/10.1016/j.aml.2009.03.023 doi: 10.1016/j.aml.2009.03.023
![]() |
[17] |
M. Contzen, Stability of switched linear systems with possible zone behavior: a polytopic approach, Eur. J. Control, 40 (2018), 40–47. https://doi.org/10.1016/j.ejcon.2017.11.001 doi: 10.1016/j.ejcon.2017.11.001
![]() |
[18] |
Y. Chang, G. Zhai, B. Fu, L. Xiong, Quadratic stabilization of switched uncertain linear systems: a convex combination approach, IEEE-CAA J. Automatic., 6 (2019), 1116–1126. https://doi.org/10.1109/JAS.2019.1911681 doi: 10.1109/JAS.2019.1911681
![]() |
[19] | M. S. Branicky, Multiple Lyapunov functions and other analysis tools for switched and hybrid systems, IEEE T. Automat. Contr., 43 (1998), 475–482. https://doi.org/0018-9286(98)02663-4 |
[20] |
S. N. Vassilyev, A. A. Kosov, Common and multiple Lyapunov functions in stability analysis of nonlinear switched systems, AIP Conf. Proc., 1493 (2012), 1066–1073. https://doi.org/10.1063/1.4765620 doi: 10.1063/1.4765620
![]() |
[21] |
L. Zhou, D. W. C. Ho, G. Zhai, Stability analysis of switched linear singular systems, Automatica, 49 (2013), 1481–1487. https://doi.org/10.1016/j.automatica.2013.02.002 doi: 10.1016/j.automatica.2013.02.002
![]() |
[22] |
S. Yuan, L. Zhang, B. De Schutter, S. Baldi, A novel Lyapunov function for a non-weight l2 gain of asynchronously switched linear systems, Automatica, 87 (2018), 310–317. https://doi.org/10.1016/j.automatica.2017.10.018 doi: 10.1016/j.automatica.2017.10.018
![]() |
[23] |
X. D. Zhao, P. Shi, Y. F. Yin, S. K. Nguang, New results on stability of slowly switched system: a multiple discontinuous Lyapunov function approach, IEEE T. Automat. Contr., 57 (2017), 1809–1815. https://doi.org/10.1109/TAC.2016.2614911 doi: 10.1109/TAC.2016.2614911
![]() |
[24] |
R. Wang, L. Hou, G. Zong, S. Fei, D. Yang, Stability and stabilization of continuous-time switched systems: a multiple discontinuous convex Lyapunov function approach, Int. J. Robust Nonlin., 29 (2019), 1499–1514. https://doi.org/10.1002/rnc.4449 doi: 10.1002/rnc.4449
![]() |
[25] | S. Reich, A. J. Zaslavski, Asymptotic behavior of dynamical systems with a convex Lyapunov function, J. Nonlinear Convex A., 1 (2000), 107–113. |
[26] |
R. Wang, T. Jiao, T. Zhang, Improved stability results for discrete-time switched systems: A multiple piecewise convex Lyapunov function approach, Appl. Math. Comput., 353 (2019), 54–65. https://doi.org/10.1016/j.amc.2019.01.065 doi: 10.1016/j.amc.2019.01.065
![]() |
[27] |
L. Zhang, H. Gao, Asynchronously switched control of switched linear systems with average dwell time, Automatica, 46 (2010), 953–958. https://doi.org/10.1016/j.automatica.2010.02.021 doi: 10.1016/j.automatica.2010.02.021
![]() |
[28] |
J. J. Huang, X. Z. Hao, X. Z. Pan, Asynchronous switching control of discrete-time linear system based on mode-dependent average dwell time, Int. J. Control Autom. Syst., 18 (2020), 1705–1714. https://doi.org/10.1007/s12555-019-0495-5 doi: 10.1007/s12555-019-0495-5
![]() |
[29] |
J. H. Cui, R. H. Wang, S. M. Fei, A multiple convex Lyapunov function for asynchronous control of discrete-time switched systems, T. I. Meas. Control, 44 (2021), 162–171. https://doi.org/10.1177/01423312211026547 doi: 10.1177/01423312211026547
![]() |
[30] |
L. Vu, D. Liberzon, Supervisory control of uncertain linear time-varying systems, IEEE T. Automat. Contr., 56 (2011), 27–42. https://doi.org/10.1109/TAC.2010.2060244 doi: 10.1109/TAC.2010.2060244
![]() |
[31] |
S. Shi, Z. Fei, P. Shi, C. K. Ahn, Asynchronous filtering for discrete-time switched T-S fuzzy systems, IEEE T. Fuzzy Syst., 28 (2020), 1531–1541. https://doi.org/10.1109/TFUZZ.2019.2917667 doi: 10.1109/TFUZZ.2019.2917667
![]() |
[32] |
D. W. Ding, G. H. Yang, H∞ static output feedback control for discrete-time switched linear systems with average dwell time, IET Control Theory A., 4 (2010), 381–390. https://doi.org/10.1049/iet-cta.2008.0481 doi: 10.1049/iet-cta.2008.0481
![]() |
[33] |
S. Shi, Z. P. Shi, Z. Y. Fei, Asynchronous control for switched systems by using persistent dwell time modeling, Syst. Control Lett., 133 (2019), 104523. https://doi.org/10.1016/j.sysconle.2019.104523 doi: 10.1016/j.sysconle.2019.104523
![]() |
[34] |
Q. Yu, N. Wei, Stability criteria of switched systems with a binary F-dependent average dwell time approach, Journal of Control and Decision, 2023 (2023), 2191609. https://doi.org/10.1080/23307706.2023.2191609 doi: 10.1080/23307706.2023.2191609
![]() |
1. | Muhammad Sohail, Muhammad Hussain Ali, Kamaleldin Abodayeh, Syed Tehseen Abbas, Bio-convective boundary layer flow of Maxwell nanofluid via optimal homotopic procedure with radiation and Darcy-Forchheimer impacts over a stretched sheet, 2025, 46, 0143-0750, 10.1080/01430750.2025.2462583 |