Abstract

The method of approximate transformation groups, which was proposed by Baikov et al. (1988 and 1996), is extended on Hamiltonian and bi-Hamiltonian systems of evolution equations. Indeed, as a main consequence, this extended procedure is applied in order to compute the approximate conservation laws and approximate recursion operators corresponding to these types of equations. In particular, as an application, a comprehensive analysis of the problem of approximate conservation laws and approximate recursion operators associated to the Gardner equation with the small parameters is presented.

1. Introduction

The investigation of the exact solutions of nonlinear evolution equations has a fundamental role in the nonlinear physical phenomena. One of the significant and systematic methods for obtaining special solutions of systems of nonlinear differential equations is the classical symmetries method, also called Lie group analysis. This well-known approach originated at the end of nineteenth century from the pioneering work of Lie [1]. The fact that symmetry reductions for many PDEs cannot be determined, via the classical symmetry method, motivated the creation of several generalizations of the classical Lie group approach for symmetry reductions. Consequently, several alternative reduction methods have been proposed, going beyond Lie’s classical procedure and providing further solutions. One of these techniques which is extremely applied particularly for nonlinear problems is perturbation analysis. It is worth mentioning that sometimes differential equations which appear in mathematical modelings are presented with terms involving a parameter called the perturbed term. Because of the instability of the Lie point symmetries with respect to perturbation of coefficients of differential equations, a new class of symmetries has been created for such equations, which are known as approximate (perturbed) symmetries. In the last century, in order to have the utmost result from the methods, combination of Lie symmetry method and perturbations are investigated and two different so-called approximate symmetry methods (ASMs) have been developed. The first method is due to Baikov et al. [2, 3]. The second procedure was proposed by Fushchich and Shtelen [4] and later was followed by Euler et al. [5, 6]. This method is generally based on the perturbation of dependent variables. In [7, 8], a comprehensive comparison of these two methods is presented.

As it is well known, Hamiltonian systems of differential equations are one of the famous and significant concepts in physics. These important systems appear in the various fields of physics such as motion of rigid bodies, celestial mechanics, quantization theory, fluid mechanics, plasma physics, and so forth. Due to the significance of Hamiltonian structures, in this paper, by applying the linear behavior of the Euler operator, characteristics, prolongation, and Fréchet derivative of vector fields, we have extended ASM on the Hamiltonian and bi-Hamiltonian systems of evolution equations, in order to investigate the interplay between approximate symmetry groups, approximate conservation laws, and approximate recursion operators.

The structure of the present paper is as follows. In Section 2, some necessary preliminaries regarding to the Hamiltonian structures are presented. In Section 3, a comprehensive investigation of the approximate Hamiltonian symmetries and approximate conservation laws associated to the perturbed evolution equations is proposed. Also, as an application of this procedure, approximate Hamiltonian symmetry groups, approximate bi-Hamiltonian structures, and approximate conservation laws of the Gardner equation are computed. In Section 4, the approximate recursion operators are studied and the proposed technique is implemented for the Gardner equation as an application. Finally, some concluding remarks are mentioned at the end of the paper.

2. Preliminaries

In this section, we will mention some necessary preliminaries regarding Hamiltonian structures. In order to be familiar with the general concepts of the ASM, refer to [9]. It is also worth mentioning that most of this paper’s definitions, theorems and techniques regarding Hamiltonian and bi-Hamiltonian structures are inspired from [10].

Let denote a fixed connected open subset of the space of independent and dependent variables and . The algebra of differential functions over is denoted by . We further define to be the vector space of -tuples of differential functions, , where each .

A generalized vector field will be a (formal) expression of the form in which and are smooth differential functions. The Prolonged generalized vector field can be defined as follows: whose coefficients are determined by the formula with the same notation as before. Given a generalized vector field , its infinite prolongation (or briefly prolongation) is the formally infinite sum as follows: where each is given by (3), and the sum in (4) now extends over all multi-indices for .

A generalized vector field is a generalized infinitesimal symmetry of a system of differential equations as follows: if and only if for every smooth solution .

Among all the generalized vector fields, those in which the coefficients of the are zero play a distinguished role. Let be a -tuple of differential functions. The generalized vector field is called an evolutionary vector field, and is called its characteristic.

A manifold with a Poisson bracket is called a Poisson manifold, the bracket defining a Poisson structure on . Let be a Poisson manifold and be a smooth function. The Hamiltonian vector field associated with is the unique smooth vector field on satisfying the following identity: for every smooth function . The equations governing the flow of are referred to as Hamilton’s equations for the “Hamiltonian” function .

Let be local coordinates on and be a real-valued function. The following basic formula can be obtained for the Poisson bracket: In other words, in order to compute the Poisson bracket of any pair of functions in some given set of local coordinates, it suffices to know the Poisson brackets between the coordinate functions themselves. These basic brackets, are called the structure functions of the Poisson manifold relative to the given local coordinates and serve to uniquely determine the Poisson structure itself. For convenience, we assemble the structure functions into a skew-symmetric matrix , called the structure matrix of . Using to denote the (column) gradient vector for , the local coordinate form (9) for the Poisson bracket can be written as

Therefore, in the given coordinate chart, Hamilton’s equations take the form of Alternatively, using (9), we could write this in the “bracket form” as follows: the th component of the right-hand side being . A system of first-order ordinary differential equations is said to be a Hamiltonian system if there is a Hamiltonian function and a matrix of functions determining a Poisson bracket (11) whereby the system takes the form (12).

If is a differential operator, its (formal) adjoint is the differential operator which satisfies for every pair of differential functions , which vanish when . Also, for every domain and every function of compact support in . An operator is self-adjoint if ; it is skew-adjoint if .

The principal innovations needed to convert a Hamiltonian system of ordinary differential equations (12) to a Hamiltonian system of evolution equations are as follows (refer to [10] for more details):(i)replacing the Hamiltonian function by a Hamiltonian functional , (ii)replacing the vector gradient operation by the variational derivative of the Hamiltonian functional, and (iii)replacing the skew-symmetric matrix by a skew-adjoint differential operator which may depend on . The resulting Hamiltonian system will take the form of Clearly, for a candidate Hamiltonian operator the correct expression for the corresponding Poison bracket has the form of whenever , are functionals. Off course, the Hamiltonian operator must satisfy certain further restrictions in order that (17) be a true Poisson bracket. A linear operator is called Hamiltonian if its Poisson bracket (17) satisfies the conditions of skew-symmetry and the Jacobi identity.

Proposition 1. Let be a Hamiltonian operator with Poisson bracket (17). To each functional , there is an evolutionary vector field , called the Hamiltonian vector field associated with , which for all functionals satisfies the following identity: Indeed, has characteristic , in which is Euler operator (Proposition 7.2 of [10]).

3. Approximate Hamiltonian Symmetries and Approximate Conservation Laws

Consider a system of perturbed evolution equations: in which ,  ,   and is a parameter.

Substituting according to (19) and its derivatives, we see that any evolutionary symmetry must be equivalent to one whose characteristic depends only on , , , and the -derivatives of . On the other hand, (19) itself can be considered as the equations corresponding to the flow of the evolutionary vector field with characteristic . The symmetry criterion (6), which in this case is can be readily seen to be equivalent to the following Lie bracket condition on the two approximate generalized vector fields. Indeed, this point generalizes the correspondence between symmetries of systems of first-order perturbed ordinary differential equations and the Lie bracket of the corresponding vector fields.

Considering the above assumptions, some useful relevant theorems and definitions could be rewritten as follows.

Proposition 2. An approximate evolutionary vector field is a symmetry of the system of perturbed evolution equations if and only if holds identically in . (Here denotes the evolutionary vector field with characteristic .).

Any approximate conservation law of a system of perturbed evolution equations takes the form of in which denotes spatial divergence. Without loss of generality, the conserved density can be assumed to depend only on -derivatives of . Equivalently, for , the functional is a constant, independent of , for all solutions such that as . Note that if is any such differential function, and is a solution of the perturbed evolutionary system , then where denotes the partial -derivative. Thus is the density for a conservation law of the system if and only if its associated functional satisfies the following identity: In the case that our system is of Hamiltonian form, the bracket relation (18) immediately leads to the Noether relation between approximate Hamiltonian symmetries and approximate conservation laws.

Definition 3. Let be a approximate Hamiltonian differential operator. An approximate distinguished functional for is a functional satisfying for all .

In other words, the Hamiltonian system corresponding to a distinguished functional is completely trivial: .

Now, according to [10], the perturbed Hamiltonian version of Noether’s theorem can be presented as follows.

Theorem 4. Let be a Hamiltonian system of perturbed evolution equations. An approximate Hamiltonian vector field with characteristic , determines an approximate generalized symmetry group of the system if and only if there is an equivalent functional differing only from by a time-dependent approximate distinguished functional , such that determines an approximate conservation law.

Example 5. The Gardner equation can in fact be written in Hamiltonian form in two distinct ways. Firstly, we see where and is an approximate conservation law. Note that is certainly skew-adjoint and Hamiltonian. The Poisson bracket is The second Hamiltonian form is in which is skew-adjoint and satisfies the Jacobi identity. Therefore it is Hamiltonian.

In [11], we have comprehensively analyzed the problem of approximate symmetries for the Gardner equation. We have shown that the approximate symmetries of the Gardner equation are given by the following generators: with corresponding characteristics (up to sign).

For the first Hamiltonian operator , there is one independent nontrivial approximate distinguished functional, the mass which is consequently approximately conserved.

For the above seven characteristics, we have with the following approximately conserved functionals: For the second Hamiltonian operator , the following approximately conserved functionals are the corresponding approximate conservation laws: In this case, nothing new is obtained. Note that the other approximate conservation law did not arise from one of the geometrical symmetries. According to Theorem 4, however, there is an approximate Hamiltonian symmetry which gives rises to it, namely . The characteristic of this approximate generalized symmetry is Note that happens to satisfy the Hamiltonian condition (34) for with the following functional: Consequently, another approximate conservation law is provided for the Gardner equation.

Keeping on this procedure recursively, further approximate conservation laws could be generated. But, this procedure will be done in the next section by applying approximate recursion operators.

4. Approximate Recursion Operators

Definition 6. Let be a system of perturbed differential equations. An approximate recursion operator for is a linear operator in the space of -tuples of differential functions with the property that whenever is an approximate evolutionary symmetry of , so is with .

For nonlinear perturbed systems, there is an analogous criterion for a differential operator to be an approximate recursion operator, but to state it we need to introduce the notion of the (formal) Fréchet derivative of a differential function.

Definition 7. Let be an -tuple of differential functions. The Fréchet derivative of is the perturbed differential operator defined so that for any .

Proposition 8. If and then

Theorem 9. Suppose that be a system of perturbed differential equations. If is a linear operator such that for all solutions of , where is a linear differential operator, then is an approximate recursion operator for the system.

Suppose that is a perturbed evolution equation. Then . If is an approximate recursion operator, then it is not hard to observe that the operator in (42) must be the same as . Therefore, the condition (42) in this case reduces to the commutator condition for an approximate recursion operator of a perturbed evolution equation.

From (43), we can conclude that if is an approximate recursion operator, then for all in which ,   is an approximate recursion operator as follows: In order to illustrate the significance of the above theorem, we discuss a couple of examples, including the potential Burgers’ equation and the Gardner equation. In the first example, we apply some technical methods, used in Examples 5.8 and 5.30 of [10].

Example 10. Consider the potential Burgers’ equation As mentioned in [7], approximate symmetries of the potential Burgers’ equation are given by the following twelve vector fields plus the infinite family of vector fields where are arbitrary solutions of the heat equation .

The corresponding characteristics of the first twelve approximate symmetries are (up to sign).

Inspection of  , , , leads us to the conjecture that is an approximate recursion operator, since , , and so forth. To prove this, we note that the Fréchet derivative for the right-hand side of potential Burgers’ equation is We must verify (43). The time derivative of the first approximate recursion operator on the solutions of the potential Burgers’ equation is the multiplication operator as follows: On the other hand, the commutator is computed using Leibniz’ rule for differential operators: Comparing these two verifies (43) and proves that is an approximate recursion operator for the potential Burgers’ equation.

There is thus an infinite hierarchy of approximate symmetries, with characteristics , For example, the next characteristic after in the sequence is To obtain the characteristics depending on and , we require a second approximate recursion operator, which by inspection, we guess to be Using the fact that satisfies (43), we readily find whereas proving that is also an approximate recursion operator. There is thus a doubly infinite hierarchy of approximate generalized symmetries of potential Burgers’ equation, with characteristics ,  . For instance, , and so on.

Example 11. Consider the Gardner equation, which was shown to have two Hamiltonian structures with Hence, the operator connecting our hierarchy of approximate Hamiltonian symmetries is Therefore, our results on approximate bi-Hamiltonian systems will provide ready-made proofs of the existence of infinitely many approximate conservation laws and approximate symmetries for the Gardner equation.
Note that the Fréchet derivative for the right-hand side of Gardner’s equation is

Theorem 12. Let . For each , the differential polynomial is a total -derivative, , and hence we can recursively define . Each is the characteristic of an approximate symmetry of the Gardner equation.

Proof. To prove this theorem, we apply the similar method applied in Theorem 5.31 of [10].
We proceed by induction on , so suppose that for some . From the form of the approximate recursion operator, If we can prove that for some differential polynomial , , we will indeed have proved that , where is the above expression in brackets. Consequently, the induction step will be completed.
To prove this fact, note that the formal adjoint of the approximate recursion operator is We apply this in order to integrate the expression , by parts, so for some differential function . On the other hand, using a further integration by parts, for some the following identity holds: Substituting into the previous identity, we conclude which proves our claim.

Definition 13. A pair of skew-adjoint matrix of differential operators and is said to form an approximately Hamiltonian pair if every linear combination , , is an approximate Hamiltonian operator. A system of perturbed evolution equations is an approximate bi-Hamiltonian system if it can be written in the form of where , form an approximately Hamiltonian pair, and and are appropriate Hamiltonian functionals.

Lemma 14. If , are skew-adjoint operators, then they form an approximately Hamiltonian pair if and only if , and are all approximate Hamiltonian operators.

Corollary 15. Let and be Hamiltonian differential operators. Then , form an approximately Hamiltonian pair if and only if where are the functional bi-vectors representing the respective Poisson brackets.

Example 16. Consider the approximate Hamiltonian operators , associated with the Gardner equation. We have in the case of the second approximate Hamiltonian operator for the Gardner equation, we have trivially, by the properties of the wedge product, it is deduced that Thus and form an approximately Hamiltonian pair.

Definition 17. A differential operator is approximately degenerate if there is a nonzero differential operator such that .

Now, according to [10], we are in a situation to state the main theorem on approximate bi-Hamiltonian systems.

Theorem 18. Let be an approximate bi-Hamiltonian system of perturbed evolution equations. Assume that the operator of the approximately Hamiltonian pair is approximate nondegenerate. Let be the corresponding approximate recursion operator, and let . Assume that for each one can recursively define meaning that for each , lies in the image of . Then there exists a sequence of functionals such that (i)for each the perturbed evolution equation is an approximate bi-Hamiltonian system; (ii)the corresponding approximate evolutionary vector fields all mutually commute (iii)the approximate Hamiltonian functionals are all in involution with respect to either Poisson bracket: and hence provide an infinite collection of approximate conservation laws for each of the approximate bi-Hamiltonian systems (65).

We have seen that given an approximate bi-Hamiltonian system, the operator , when applied successively to the initial equation , produces an infinite sequence of approximate generalized symmetries of the original system (subject to the technical assumptions contained in Theorem 18). It is still not clear that is a true approximate recursion operator for the system, in the sense that whenever is an approximate generalized symmetry, so is . So far, we only know it for approximate symmetries with for some . In order to establish this more general result, we need a formula for the infinitesimal change of the approximate Hamiltonian operator itself under a Hamiltonian flow.

Lemma 19. Let be an approximate Hamiltonian system of perturbed evolution equations with corresponding vector field . Then

Theorem 20. Let be an approximate bi-Hamiltonian system of perturbed evolution equations. Then the operators , , are approximate recursion operators for the system.

Judging from , when , this type of approximate recursion operators have less significance than .

Example 21. The approximate recursion operators of the Gardner equation are and we can apply to the right-hand side of the Gardner equation to obtain the approximate symmetries. The first step in this recursion is the flow which is not approximately total derivative, so we cannot reapply the approximate recursion operator to get a meaningful approximate generalized symmetry.
But if we set then we can apply successively to in order to obtain the approximate symmetries. The first phase become in which is another approximate conservation law.
Now, for we have where is a further approximate conservation law.

5. Concluding Remarks

Sometimes, differential equations appearing in mathematical modelings are written with terms involving a small parameter which is known as the perturbed term. Taking into account the instability of the Lie point symmetries with respect to perturbation of coefficients of differential equations, the approximate (perturbed) symmetries for such equations are obtained. Different methods for computing the approximate symmetries of a system of differential equations are available in the literature [24].

The approximate symmetry method proposed by Fushchich and Shtelen [4] is based on a perturbation of dependent variables. This method has so many advantages such as producing more approximate group-invariant solutions, consistence with the perturbation theory, solving singular perturbation problems [7, 8], and close relationship with approximate homotopy symmetry method [12]. But despite the above-mentioned benefits, this procedure converts a perturbed evolution equation to an equivalent perturbed evolutionary system. In his case, obtaining the corresponding Hamiltonian formulation will be hard. Due to the increase of the dimensions of Hamiltonian operators , computation of the approximate recursion operator is difficult.

Since prolongation and Fréchet derivative of vector fields are linear, both of the approximate symmetry methods can be extended on the Hamiltonian structures. But due to the significance of vector fields in Hamiltonian and bi-Hamiltonian systems, the approximate symmetry method proposed by Baikov et al. [2, 3] seems to be more consistent.

Acknowledgments

It is a pleasure to thank the anonymous referees for their constructive suggestions and helpful comments which have improved the presentation of the paper. The authors wish to express their sincere gratitude to Fatemeh Ahangari for her useful advice and suggestions.