Lie Algebra Classification, Conservation Laws, and Invariant Solutions for a Generalization of the Levinson–Smith Equation
Abstract
We obtain the optimal system’s generating operators associated with a generalized Levinson–Smith equation; this one is related to the Liénard equation which is important for physical, mathematical, and engineering points of view. The underlying equation has applications in mechanics and nonlinear dynamics as well. This equation has been widely studied in the qualitative scheme. Here, we treat the equation by using the Lie group method, and we obtain certain operators; using those operators, we characterized all invariants solutions associated with the generalized equation of Levinson Smith considered in this paper. Finally, we classify the Lie algebra associated with the given equation.
1. Introduction
Lie group symmetry method is a powerful tool employed to study ODEs, PDEs, FPDEs, FODEs, and so on. This theory was introduced in the 19th century by Sophus Lie [1], following the idea of Galois theory in algebra. Lie group method applied to differential equations has received great interest among researchers in different fields of science such as mathematics, theoretical, and applied physics, due to the physical interpretations of the underlying equations that are studied. As a consequence, this method leads to construct, for example, conservation laws, using the well known Noether’s theorem [2], even more applying Ibragimov’s approach [3]. In the same way, it is possible to build similarity solutions which, in the traditional methods, are not possible.
Furthermore, this method contributes to establish schemes and the usefulness of some numerical methods; here, many packages are being built in different environments of computations, e.g., [4, 5]. In general, taking into account the importance of the equations’ study (such as ODEs, PDEs, and others), this method can be interesting to different researchers. A vast reference in Lie group method can be found in the literature, e.g., [6–9]. Recently, the Lie group method approach has been applied to solve and analyze different problems in many scientific fields, e.g., in [10], the authors applied the Lie symmetry method to investigate a fourth-order 1 + 2 evolutionary partial differential equation which has been proposed for the image processing noise reduction. References in the latest progress in symmetry analysis can be found in [11–18] and therein.
2. Continuous Group of Lie Symmetries
In this section, we study the Lie symmetry group for (3). The main result of this section can be presented as follows.
Proposition 1. The Lie symmetry group for equation (3) is generated by the following vector fields:
Proof. A general form of the one-parameter Lie group admitted by (3) is given by
Being Dx as the total derivative operator, . Replacing (8) into (7) and using (3), we obtain
From (9), canceling the coefficients of the monomial variables in derivatives , and yx, we obtain the determining equations for the symmetry group of (3). That is,
Solving the system of equations (9a)–(9d) for ξ and η, we get
Thus, the infinitesimal generators of the group of symmetries of (3) are the operators Π1 − Π5 described in the statement of Proposition 1, thus having the proposed result.
3. Optimal System
Π1 | Π2 | Π3 | Π4 | Π5 | |
---|---|---|---|---|---|
Π1 | 0 | Π2 | 0 | −Π4 | −2Π5 |
Π2 | −Π2 | 0 | 0 | 0 | 2Π4 |
Π3 | 0 | 0 | 0 | −2Π4 | −2Π5 |
Π4 | Π4 | 0 | 2Π4 | 0 | 0 |
Π5 | 2Π5 | −2Π4 | 2Π5 | 0 | 0 |
Making use of this operator, we can construct Table 2, which shows the adjoint representation for each Πi.
adj[, ] | Π1 | Π2 | Π3 | Π4 | Π5 |
---|---|---|---|---|---|
Π1 | Π1 | e−λΠ2 | Π3 | eλΠ4 | e2λΠ5 |
Π2 | Π1 + λΠ2 | Π2 | Π3 | Π4 | Π5 − 2λΠ4 |
Π3 | Π1 | Π2 | Π3 | e2λΠ4 | e2λΠ5 |
Π4 | Π1 − λΠ4 | Π2 | Π3 − 2λΠ4 | Π4 | Π5 |
Π5 | Π1 − 2λΠ5 | Π2 + 2λΠ4 | Π3 − 2λΠ5 | Π4 | Π5 |
Proposition 2. The optimal system associated to equation (3) is given by the vector fields
Proof. To calculate the optimal system, we start with the generators of symmetries (4) and a generic nonzero vector. Let
The objective is to simplify as many coefficients, ai, as possible, through maps adjoint to G, using Table 2.
- (1)
Assuming a5 = 1 in (14), we have that G = a1Π1 + a2Π2 + a3Π3 + a4Π4 + Π5. Applying the adjoint operator to (Π1, G) and (Π3, G), we do not have any reduction; on the other hand, applying the adjoint operator to (Π2, G), we get
(15)-
(1.1) Case a1 ≠ 0. Using λ1 = (−a2/a1)a1 ≠ 0, in (15), Π2 is eliminated, therefore G1 = a1Π1 + a3Π3 + b1Π4 + Π5, where b1 = a4 + (2a2/a1). Now, applying the adjoint operator to (Π4, G1), we get G2 = Ad(exp(λ2Π4))G1 = a1Π1 + a3Π3 + (b1 − λ2(a1 + 2a3))Π4 + Π5.
-
(1.1.A) Case a1 + 2a3 ≠ 0. Using λ2 = (b1/a1 + 2a3), with a1 + 2a3 ≠ 0, eliminated is Π4, and then G2 = a1Π1 + a3Π3 + Π5. Applying the adjoint operator to (Π5, G2), we get
(16) -
(1.1.A.A1) Case a1 + a3 ≠ 0. Using λ3 = (1/2(a1 + a3))), with a1 + a3 ≠ 0, in (16), Π5 is eliminated, therefore G3 = a1Π1 + a3Π3. Then, we have the first element of the optimal system.
(17) -
with a1 ≠ 0, a1 + 2a3 ≠ 0, and a1 + a3 ≠ 0. This is how the first reduction of the generic element (14) ends.
-
(1.1.A.A2) Case a1 + a3 = 0. We get G3 = −a3Π1 + a3Π3 + Π5. Then, we have the other element of the optimal system.
(18) -
with a3 ≠ 0. This is how the other reduction of the generic element (14) ends.
-
(1.1.B) Case a1 + 2a3 = 0. We get G2 = −2a3Π1 + a3Π3 + b1Π4 + Π5. Applying the adjoint operator to (Π5, G2), we have
(19) -
(1.1.B.1) Case a3 ≠ 0. Using λ19 = (−1/4a3), with a3 ≠ 0, in (19), Π5 is eliminated, therefore G19 = −2a3Π1 + a3Π3 + b1Π4. Then, we have the other element of the optimal system.
(20) -
with a1 ≠ 0, a1 + 2a3 ≠ 0, and a1 + a3 ≠ 0. This is how the other reduction of the generic element (14) ends.
-
(1.1.B.2) Case a3 = 0. We get G19 = b1Π4 + Π5. Then, we have the other element of the optimal system.
(21) -
This is how the other reduction of the generic element (14) ends.
-
(1.2) Case a1 = 0. We get G1 = a2Π2 + a3Π3 + (a4 − 2λ1)Π4 + Π5, using λ1 = (a4/2), then Π4 is eliminated, and then G1 = a2Π2 + a3Π3 + Π5. Now, applying the adjoint operator to (Π4, G1), we have G16 = Ad(exp(λ16Π4))G1 = a2Π2 + a3Π3 − 2a3λ16Π4 + Π5. It is clear that we do not have any reduction.
-
(1.2.1) Case a3 ≠ 0. Then, using λ16 = (−b9/2a3), with a3 ≠ 0, we get G16 = a2Π2 + a3Π3 + b9Π4 + Π5. Applying the adjoint operator to (Π5, G16), we have
(22) -
Using λ17 = (1/2a3), with a3 ≠ 0, in (22), Π5 is eliminated, therefore G17 = a2Π2 + a3Π3 + (b9 + (a2/a3))Π4. Then, we have the other element of the optimal system.
(23) -
(1.2.2) Case a3 = 0. We get G16 = a2Π2 + Π5. Applying the adjoint operator to (Π5, G16), we have
(24) -
It is clear that we do not have any reduction.
-
(1.2.2.A) Case a2 ≠ 0. Then, using λ18 = (−b10/2a2), with a2 ≠ 0, in (24), we get G18 = a2Π2 + b10Π4 + Π5. Then, we have the other element of the optimal system.
(25) -
(1.2.2.B) Case a2 = 0. Then, we get G18 = Π5, hence we have the other element of the optimal system.
(26) -
- (2)
Assuming a5 = 0 and a4 = 1 in (14), we have that G = a1Π1 + a2Π2 + a3Π3 + Π4. Applying the adjoint operator to (Π1, G) and (Π3, G), we do not have any reduction; on the other hand, applying the adjoint operator to (Π2, G), we get
(27)-
(2.1) Case a1 ≠ 0. Using λ4 = (−a2/a1) with a1 ≠ 0, in (27), Π2 is eliminated, therefore G4 = a1Π1 + a3Π3 + Π4. Now, applying the adjoint operator to (Π4, G4), we get G5 = Ad(exp(λ5Π4))G4 = a1Π1 + a3Π3 + (1 − λ5(a1 + 2a3))Π4.
-
(2.1.A) Case a1 + 2a3 ≠ 0. Using λ5 = (1/a1 + 2a3), with a1 + 2a3 ≠ 0, eliminated is Π4, then G5 = a1Π1 + a3Π3. Applying the adjoint operator to (Π5, G5), we get
(28) -
It is clear that we do not have any reduction.
-
(2.1.A.A1) Case a1 + a3 ≠ 0. Then, substituting λ6 = (−b2/2(a1 + a3)) with a1 + a3 ≠ 0, we have the other element of the optimal system
(29) -
with a1 ≠ 0, a1 + 2a3 ≠ 0, and a1 + a3 ≠ 0. This is how the other reduction of the generic element (14) ends.
-
(2.1.A.A2) Case a1 + a3 = 0. We get G6 = −a3Π1 + a3Π3, and then we have the other element of the optimal system,
(30) -
with a1, a3 ≠ 0 and a1 + 2a3 ≠ 0, a1 = −a3. This is how the other reduction of the generic element (14) ends.
-
(2.1.B) Case a1 + 2a3 = 0. We get G5 = −2a3Π1 + a3Π3 + Π4. Applying the adjoint operator to (Π5, G5), we have
(31) -
It is clear that we do not have any reduction; it is also clear that a1 ≠ 0 and then a3 ≠ 0; then, substituting λ23 = b13, we have the other element of the optimal system
(32) -
with a3 ≠ 0 y a1 + 2a3 = 0. This is how the other reduction of the generic element (14) ends.
-
(2.2) Casea1 = 0. We get G4 = a2Π2 + a3Π3 + Π4. Now, applying the adjoint operator to (Π4, G4), we have G20 = Ad(exp(λ20Π4))G4 = a2Π2 + a3Π3 + (1 − 2a3λ20)Π4.
-
(2.2.A) Case a3 ≠ 0. Using λ20 = (1/2a3), with a3 ≠ 0, Π4 is eliminated, then G20 = a2Π2 + a3Π3. Applying the adjoint operator to (Π5, G20), we get
(33) -
It is clear that we do not have any reduction.
-
(2.2.A.1) Case a2 ≠ 0. Then, substituting λ21 = (+b11/2a2) with a2 ≠ 0, we have other element of the optimal system
(34) -
with a2, a3 ≠ 0. This is how the other reduction of the generic element (14) ends.
-
(2.2.A.2) Case a2 = 0. We get G21 = a3Π3 − 2a3λ21Π5; we do not have any reduction; then, using λ21 = b12, we have the other element of the optimal system
(35) -
This is how the other reduction of the generic element (14) ends.
-
(2.2.B) Case a3 = 0. We get G20 = a2Π2 + Π4. Applying the adjoint operator to (Π5, G20), we get
(36) -
(2.2.B.1) Case a2 ≠ 0. Using λ22 = (1/2a2) with a2 ≠ 0, Π4 is eliminated, then we have the other element of the optimal system
(37) -
This is how the other reduction of the generic element (14) ends.
-
(2.2.B.2) Case a2 = 0. We get G22 = Π4, and then we have the other element of the optimal system
(38) -
This is how the other reduction of the generic element (14) ends.
-
- (3)
Following a procedure analogous to the previous one and analyzing the respective cases for a4 = a5 = 0, a3 = 1 in (14); a3 = a4 = a5 = 0, a2 = 1 in (14) and a2 = a3 = a4 = a5 = 0, a1 = 1 in (14); we can reduce and obtain all the elements presented for the optimal system.
4. Invariant Solutions by Some Generators of the Optimal System
Using the element Π5 from Proposition 2, under the condition (39), we obtain that Q = η5 − yxξ5 = 0, which implies (−2x2y + x3y2) − yx(x3) = 0; then, solving this ODE, we have y(x) = (1/x(c1x + 1)), where c is an arbitrary constant, which is an invariant solution for (3); using an analogous procedure with all of the elements of the optimal system (Proposition 2), we obtain both implicit and explicit invariant solutions that are shown in Table 3, with c being a constant.
Elements | Q(x, y, yx) = 0 | Solutions | Type solution | |
---|---|---|---|---|
1 | Π5 | (−2x2y + x3y2) − yx(x3) = 0 | y(x) = (1/x(cx + 1)) | Explicit |
2 | Π2 | (y2) − yx(0) = 0 | y(x) = 0 | Trivial |
3 | Π4 | x2y2 − yx(0) = 0 | y(x) = 0 | Trivial |
4 | Π1 + Π3 | (y + xy2) − yx(2x) = 0 | Explicit | |
5 | Π4 + Π5 | (x3y2 + x2y2 − 2x2y) − yx(x3) = 0 | y(x) = (2/cx2 + 2x + 1) | Explicit |
6 | −Π1 + Π3 | (xy2 − y) − yx(0) = 0 | xy2 − y = 0. | Implicit |
7 | Π3 − 2Π5 | (−2x3y2 + 4x2y + xy2) − yx(−2x3 − x) = 0 | y(x) = (1/cx2 + x + c). | Explicit |
8 | Π2 + Π4 | (y2(1 + x2)) − yx(0) = 0 | y(x) = 0 | Trivial |
9 | −Π1 + Π3 + Π5 | (x3y2 + xy2 − 2x2y − y) − yx(x3) = 0 | Explicit | |
10 | Π2 + Π3 + 2Π4 | (xy2 + 2x2y2 + y2) − yx(−x) = 0 | y(x) = (1/c + x2 + x + log(x)) | Explicit |
11 | Π2 + Π4 + Π5 | (y2 + x2y2 + x3y2 − 2x2y) − yx(x3) = 0 | y(x) = (4x2/cx4 + 4x3 + 2x2 + 1) | Explicit |
12 | Π1 + Π3 + Π5 | (x3y2 + xy2 − 2x2y + y) − yx(−2x + x3) = 0 | Explicit | |
13 | −Π1 + Π3 + Π4 | (x2y2 + xy2 − y) − yx(0) = 0 | x2y + xy − 1 = 0, y(x) ≠ 0 | Implicit |
14 | −2Π1 + Π3 + Π5 | (x3y2 + xy2 − 2x2y − 2y) − yx(x + x3) = 0 | y(x) = (1/x(cx + 1)) | Explicit |
15 | Π1 + Π4 + Π5 | (x3y2 + x2y2 − 2x2y + y) − yx(x3 − x) = 0 | Explicit | |
16 | Π1 + Π2 + Π5 | (x3y2 − 2x2y + y2 + y) − yx(x3 − x) = 0 | Explicit | |
17 | −2Π1 + Π3 + Π4 + Π5 | (x3y2 + x2y2 + xy2 − 2x2y − y) − yx(x + 2x3) = 0 | Explicit | |
18 | Π2 + Π3 + Π4 − Π5 | (−x3y2 + x2y2 + xy2 + y2 + 2x2 y) − yx(−x − x3) = 0 | y(x) = (2/2c1x2 + 2c1 + 2(x2 + 1)log(x) − (x2 + 1)log(x2 + 1) + 2x) | Explicit |
19 | Π1 + Π3 + Π4 + Π5 | (x3y2 + x2y2 + xy2 − 2x2y + y) − yx(x3 − 2x) = 0 | Explicit | |
20 | −2Π1 + Π3 + Π4 + Π5 | (x3y2 + x2y2 + xy2 − 2x2y − 2y) − yx(x3 + x) = 0 | y(x) = (2/x(cx + x log(x2 + 1) − 2x log(x) + 2)) | Explicit |
5. Variational Symmetries and Conserved Quantities
6. Nonlinear Self-Adjointness
In this section, we present the main definitions in the N. Ibragimov’s approach to nonlinear self-adjointness of differential equations adopted to our specific case. For further details, the interested reader is directed to [29–31].
Definition 1. Let be a differential function and ν = ν(x) be the new dependent variable, known as the adjoint variable or nonlocal variable [31]. The formal Lagrangian for is the differential function defined by
Definition 2. Let be a differential function and for the differential equation (49), denoted by , we define the adjoint differential function to by
Definition 3. The differential equation (40) is said to be nonlinearly self-adjoint if there exists a substitution
Now, we shall obtain the adjoint equation to equation (3). For this purpose, we write (3) in the form (49), where
Then, the corresponding formal Lagrangian (50) is given by
We calculate explicitly the Euler operator previously applied to determined by (58). In this way, we obtain the adjoint equation (52) to (3):
The main result in this section can be stated as follows.
Proposition 3. Equation (3) is nonlinearly self-adjoint, with the substitution given by
Proof. Substituting in (60), and then in (56), ν = ϕ(x, y) and its respective derivatives, and comparing the corresponding coefficients, we get the following five equations:
We observe that equation (62c) is obtained from equation (62b) by differentiation with respect to x. Therefore, we have to study only equations (62b), (62d), and (62e). Solving for ϕ in (62b), we obtain
7. Conservation Laws
8. Classification of Lie Algebra
Generically, a finite-dimensional Lie algebra in a field of characteristic 0 is classified by the Levi’s theorem, which states that any finite-dimensional Lie algebra can be written as a semidirect product of a semisimple Lie algebra and a solvable Lie algebra; the solvable Lie algebra is the radical of that algebra. In other words, there exist two important classes of Lie algebras, the solvable and the semisimple. In each class mentioned above, there are some particular classes that have other classifications, for example, in the solvable one, we have the nilpotent Lie algebra.
According the Lie group symmetry of generators given in Table 1, we have a five-dimensional Lie algebra. First of all, we remember some basic criteria to classify a Lie algebra. In the case of solvable and semisimple Lie algebra, we will denote K(⋅, ⋅) as the Cartan-Killing form. The next propositions can be found in [32].
Proposition 4. (Cartan’s theorem). A Lie algebra is semisimple if and only if its Cartan-Killing form is nondegenerate.
Proposition 5. A Lie subalgebra is solvable if and only if K(X, Y) = 0 for all and . Another way to write that is .
We also need the next statements to make the classification.
Definition 4. Let be a finite-dimensional Lie algebra over an arbitrary field k. Choose a basis ej, 1 ≤ i ≤ n, in where and set . Then, the coefficients are called structure constants.
Proposition 6. Let and be two Lie algebras of dimension n. Suppose each has a basis with respect to which the structure constants are the same. Then, and are isomorphic.
Let be the Lie algebra related to the symmetry group of infinitesimal generators of equation (1) as stated by the table of the commutators; it is enough to consider the next relations: [Π1, Π2] = Π2, [Π1, Π4] = −Π4, [Π1, Π5] = −2Π5, [Π2, Π5] = 2Π4, [Π3, Π4] = −2Π4, and [Π3, Π5] = −2Π5. Using that, we calculate Cartan-Killing form K as follows:
We verify that the Lie algebra is solvable using the Cartan criteria to solvability (Proposition 5), and then we have a solvable non-nilpotent Lie algebra. The nilradical of the Lie algebra , M is generated by Π2, Π4, Π5, and it is isomorphic to , the Heisenberg Lie algebra, and so we have a solvable Lie algebra with three-dimensional nilradical. Let m be the dimension of the nilradical M of a solvable Lie algebra. In this case, in fifth-dimensional Lie algebra, we have that 3 ≤ m ≤ 5.
Mubarakzyanov in [33] classified the 5-dimensional solvable non-nilpotent Lie algebras, in particular the solvable non-nilpotent Lie algebra with three-dimensional nilradical. Then, by Proposition 6 and consequently, we establish an isomorphism of Lie algebras with and the Lie algebra . In summary, we have the next proposition.
Proposition 7. The 5-dimensional Lie algebra related to the symmetry group of equation (1) is a solvable non-nilpotent Lie algebra with three-dimensional nilradical; this nilradical is isomorphic to , the Heisenberg Lie algebra. Besides that, Lie algebra is isomorphic with in the Mubarakzyanov’s classification.
9. Conclusion
For a generalized Levinson–Smith equation (3), we obtained the optimal system’s generating operators (see Proposition 2); using those operators, it was possible to characterize all invariant solutions as it is shown in Table 3; these invariant solutions do not appear in the literature known until today.
It has been shown in the variational symmetries for (3), as it was shown in (46) with its corresponding conservation laws (48) and all these were using Noether’s theorem, but nontrivial conservation laws were also calculated using the Ibragimov’s method as it is shown in (67) using the nonlinearly self-adjoint of equation (3) as mentioned in Proposition 3.
The results obtained in this study are new, and according to the phenomena that govern this equation, which reaches several fields of science, for instance, the nonlinear oscillators, it may be of significant importance for several researchers. Therefore, the goal initially proposed was achieved.
The Lie algebra associated to equation (3) is a solvable non-nilpotent Lie algebra with three-dimensional nilradical, and it is isomorphic with in the Mubarakzyanov’s classification; therefore, the goal initially proposed was achieved.
For future works, equivalence group theory could be also considered to obtain preliminary classifications associated to a complete classification of (3).
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Acknowledgments
The author Danilo A. García Hernández acknowledges the financial support from Coordenação de Aperfeiçoamento de Pessoal de Nível Superior, Brasil (CAPES), under the finance code 001. In the same way, the EAFIT University is thanked for all the financial supports (Scholarship for Master’s Student). Moreover G. Loaiza and Y. Acevedo also thank the Project of MinScience “Sobre procesos de difusión y simplificación de información” (code 121671250122).
Open Research
Data Availability
The data used to support the findings of this study are included within the article.