Hindawi Publishing Corporation Advances in Mathematical Physics Volume 2013, Article ID 568632, 9 pages http://dx.doi.org/10.1155/2013/568632 Research Article Approximate Hamiltonian Symmetry Groups and Recursion Operators for Perturbed Evolution Equations M. Nadjafikhah1 and A. Mokhtary2 1 2 School of Mathematics, Iran University of Science and Technology, Narmak, Tehran 1684613114, Iran Department of Complementary Education, Payame Noor University, Tehran 19395-3697, Iran Correspondence should be addressed to A. Mokhtary; rdmokhtary@gmail.com Received 11 October 2012; Revised 18 December 2012; Accepted 1 January 2013 Academic Editor: Rutwig Campoamor-Stursberg Copyright © 2013 M. Nadjafikhah and A. Mokhtary. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 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 FreΜ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. 2 Advances in Mathematical Physics 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 biHamiltonian structures are inspired from [10]. Let π ⊂ π × π denote a fixed connected open subset of the space of independent and dependent variables π₯ = (π₯1 , . . . , π₯π ) and π’ = (π’1 , . . . , π’π ). The algebra of differential functions π(π₯, π’(π) ) = π[π’] over π is denoted by A. We further define Aπ to be the vector space of π-tuples of differential functions, π[π’] = (π1 [π’], . . . , ππ [π’]), where each ππ ∈ A. A generalized vector field will be a (formal) expression of the form π v = ∑ ππ [π’] π=1 π π π + ∑ π [π’] πΌ ππ₯π πΌ=1 πΌ ππ’ (1) in which ππ and ππΌ are smooth differential functions. The Prolonged generalized vector field can be defined as follows: (n) pr π v=v+∑ ∑ πΌ=1 β―π½≤π ππΌπ½ π [π’] πΌ , ππ’π½ (2) whose coefficients are determined by the formula π π π=1 π=1 πΌ ππΌπ½ = π·π½ (ππΌ − ∑ ππ π’ππΌ ) + ∑ ππ π’π½,π , (3) with the same notation as before. Given a generalized vector field v, its infinite prolongation (or briefly prolongation) is the formally infinite sum as follows: π pr v = ∑ ππ π=1 π π π + ∑ ∑ ππ½ , ππ₯π πΌ=1 π½ πΌ ππ’π½πΌ (4) where each ππΌπ½ is given by (3), and the sum in (4) now extends over all multi-indices π½ = (π1 , . . . , ππ ) for π ≥ 0, 1 ≤ ππ ≤ π. A generalized vector field v is a generalized infinitesimal symmetry of a system of differential equations as follows: Δ π [π’] = Δ π (π₯, π’(π) ) = 0, π = 1, . . . , π, (5) if and only if pr v [Δ π ] = 0, π = 1, . . . , π, (6) for every smooth solution π’ = π(π₯). Among all the generalized vector fields, those in which the coefficients ππ [π’] of the π/ππ₯π are zero play a distinguished role. Let π[π’] = (π1 [π’], . . . , ππ [π’]) ∈ Aπ be a π-tuple of differential functions. The generalized vector field π vπ = ∑ ππΌ [π’] πΌ=1 π ππ’πΌ (7) 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 π» : π → R be a smooth function. The Hamiltonian vector field associated with π» is the unique smooth vector field vΜH on π satisfying the following identity: vΜH = {πΉ, π»} = − {π», πΉ} (8) for every smooth function πΉ : π → R. The equations governing the flow of vΜH are referred to as Hamilton’s equations for the “Hamiltonian” function π». Let π₯ = (π₯1 , . . . , π₯π ) be local coordinates on π and π»(π₯) be a real-valued function. The following basic formula can be obtained for the Poisson bracket: π π {πΉ, π»} = ∑ ∑ {π₯π , π₯π } π=1 π=1 ππΉ ππ» . ππ₯π ππ₯π (9) 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, π½ππ (π₯) = {π₯π , π₯π } , π, π = 1, . . . , π, (10) 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 {πΉ, π»} = ∇πΉ ⋅ π½∇π». (11) Therefore, in the given coordinate chart, Hamilton’s equations take the form of ππ₯ = π½ (π₯) ∇π» (π₯) . ππ‘ (12) Alternatively, using (9), we could write this in the “bracket form” as follows: ππ₯ = {π₯, π»} , ππ‘ (13) Advances in Mathematical Physics 3 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 D = ∑ ππ½ [π’] π·π½ , π½ ππ½ ∈ A (14) is a differential operator, its (formal) adjoint is the differential operator D∗ which satisfies ∫ π ⋅ Dπ ππ₯ = ∫ π ⋅ D∗ π ππ₯ Ω Ω (15) for every pair of differential functions π, π ∈ A which vanish when π’ ≡ 0. Also, for every domain Ω ⊂ Rπ and every function π’ = π(π₯) of compact support in Ω. An operator D is self-adjoint if D∗ = D; it is skew-adjoint if D∗ = −D. 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 H[π’], (ii) replacing the vector gradient operation ∇π» by the variational derivative πΏH of the Hamiltonian functional, and (iii) replacing the skew-symmetric matrix π½(π₯) by a skewadjoint differential operator D which may depend on π’. The resulting Hamiltonian system will take the form of ππ’ = D ⋅ πΏH [π’] . ππ‘ (16) 3. Approximate Hamiltonian Symmetries and Approximate Conservation Laws Consider a system of perturbed evolution equations: ππ’ = π [π’, π] ππ‘ (19) in which π[π’, π] = π(π₯, π’(π) , π) ∈ Aπ , π₯ ∈ Rπ , π’ ∈ Rπ 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 exp(π‘vπ ) of the evolutionary vector field with characteristic π. The symmetry criterion (6), which in this case is π·π‘ ππ = pr vπ (ππ ) + π (ππ ) , π = 1, . . . , π, (20) 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 vπ is a symmetry of the system of perturbed evolution equations π’π‘ = π[π’, π] if and only if πvπ + [vπ , vπ] = π (ππ ) ππ‘ (21) Clearly, for a candidate Hamiltonian operator D the correct expression for the corresponding Poison bracket has the form of holds identically in (π₯, π‘, π’(π) , π). (Here πvπ/ππ‘ denotes the evolutionary vector field with characteristic ππ/ππ‘.). {P, L} = ∫ πΏP ⋅ DπΏL ππ₯, Any approximate conservation law of a system of perturbed evolution equations takes the form of (17) whenever P, L ∈ F are functionals. Off course, the Hamiltonian operator D must satisfy certain further restrictions in order that (17) be a true Poisson bracket. A linear operator D : Aπ → Aπ is called Hamiltonian if its Poisson bracket (17) satisfies the conditions of skew-symmetry and the Jacobi identity. Proposition 1. Let D be a Hamiltonian operator with Poisson bracket (17). To each functional H = ∫ π» ππ₯ ∈ F, there is an evolutionary vector field pr vΜH , called the Hamiltonian vector field associated with H, which for all functionals P ∈ F satisfies the following identity: pr vΜH (P) = {P, H} . (18) Indeed, vΜH has characteristic DπΏH = DE(π»), in which E is Euler operator (Proposition 7.2 of [10]). π·π‘ π + Div π = π (ππ ) , (22) in which Div denotes spatial divergence. Without loss of generality, the conserved density π(π₯, π‘, π’(π) , π) can be assumed to depend only on π₯-derivatives of π’. Equivalently, for Ω ⊂ π, the functional T [π‘; π’, π] = ∫ π (π₯, π‘, π’(π) , π) ππ₯ Ω (23) is a constant, independent of π‘, for all solutions π’ such that π(π₯, π‘, π’(π) , π) → 0 as π₯ → πΩ. Note that if π(π₯, π‘, π’(π) , π) is any such differential function, and π’ is a solution of the perturbed evolutionary system π’π‘ = π[π’, π], then π·π‘ π ≈ ππ‘ π + pr vπ (π) , (24) 4 Advances in Mathematical Physics where ππ‘ = π/ππ‘ denotes the partial π‘-derivative. Thus π is the density for a conservation law of the system if and only if its associated functional T satisfies the following identity: πT + pr vπ (T) = π (ππ ) . ππ‘ (25) 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 D be a π × π approximate Hamiltonian differential operator. An approximate distinguished functional for D is a functional G ∈ F satisfying DπΏG = π(ππ ) for all π₯, π’. In other words, the Hamiltonian system corresponding to a distinguished functional is completely trivial: π’π‘ = 0. Now, according to [10], the perturbed Hamiltonian version of Noether’s theorem can be presented as follows. Theorem 4. Let π’π‘ = DπΏH be a Hamiltonian system of perturbed evolution equations. An approximate Hamiltonian vector field vΜP with characteristic DπΏP, P ∈ F determines an approximate generalized symmetry group of the system if and Μ ≈ P − G differing only if there is an equivalent functional P only from P by a time-dependent approximate distinguished Μ determines an approximate functional G[π‘; π’, π], such that P conservation law. (26) can in fact be written in Hamiltonian form in two distinct ways. Firstly, we see 2 3 π’π‘ = π·π₯ (3π’ + 2ππ’ − π’π₯π₯ ) = DπΏH1 , (27) where D = π·π₯ and π’2 π H1 [π’, π] = ∫ (π’3 + π’4 + π₯ ) ππ₯ 2 2 (28) is an approximate conservation law. Note that D is certainly skew-adjoint and Hamiltonian. The Poisson bracket is {P, L} = ∫ πΏP ⋅ π·π₯ (πΏL) ππ₯. (29) The second Hamiltonian form is π’π‘ = (4π’π·π₯ + 2π’π₯ + 3π (π’π’π₯ + π’2 π·π₯ ) − π·π₯3 ) π’ = EπΏH0 , (30) in which 1 H0 [π’, π] = ∫ π’2 ππ₯ 2 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: v1 = ππ₯ , v2 = ππ‘ , v3 = 6π‘ππ₯ + (2ππ’ − 1) ππ’ , v4 = πv1 , v5 = πv2 , (32) v6 = π (6π‘ππ₯ − ππ’ ) = πv3 , v7 = π (π₯ππ₯ + 3π‘ππ‘ − 2π’ππ’ ) , with corresponding characteristics π1 = π’π₯ , π2 = 6 (π’ + ππ’2 ) π’π₯ − π’π₯π₯π₯ , π3 = 6π‘π’π₯ + 1 − 2ππ’, π4 = ππ1 = ππ’π₯ , (33) π5 = ππ2 = π (6π’π’π₯ − π’π₯π₯π₯ ) , Example 5. The Gardner equation π’π‘ = 6 (π’ + ππ’2 ) π’π₯ − π’π₯π₯π₯ , E is skew-adjoint and satisfies the Jacobi identity. Therefore it is Hamiltonian. (31) π6 = ππ3 = π (6π‘π’π₯ + 1) , π7 = π (2π’ + π₯π’π₯ + 3π‘ (6π’π’π₯ − π’π₯π₯π₯ )) , (up to sign). For the first Hamiltonian operator D = π·π₯ , there is one independent nontrivial approximate distinguished functional, the mass P0 = M = ∫ π’ππ₯ which is consequently approximately conserved. For the above seven characteristics, we have ππ ≈ π·π₯ πΏPπ , π = 1, 2, 4, 5, 6, (34) with the following approximately conserved functionals: 1 P1 = H0 [π’, π] = ∫ π’2 ππ₯, 2 π 1 P2 = H1 [π’, π] = ∫ (π’3 + π’4 + π’π₯2 ) ππ₯, 2 2 π P4 = πP1 = ∫ π’2 ππ₯, 2 1 P5 = πP2 = π ∫ (π’3 + π’π₯2 ) ππ₯, 2 P6 = π ∫ (3π‘π’2 + π₯π’) ππ₯. (35) Advances in Mathematical Physics 5 For the second Hamiltonian operator E = 4π’π·π₯ + 2π’π₯ + 3π(π’π’π₯ + π’2 π·π₯ ) − π·π₯3 , Μπ , ππ ≈ EπΏP π = 2, 4, 5, 7, (36) the following approximately conserved functionals are the corresponding approximate conservation laws: Μ 5 = πP Μ 2 = π ∫ 1 π’2 ππ₯, P 2 (37) In this case, nothing new is obtained. Note that the other approximate conservation law P5 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 vΜP5 . The characteristic of this approximate generalized symmetry is ≈ π (π’π₯π₯π₯π₯π₯ − 10π’π’π₯π₯π₯ − 20π’π₯ π’π₯π₯ + 30π’2 π’π₯ ) . (38) Note that π5 happens to satisfy the Hamiltonian condition (34) for D with the following functional: P5 = π 2 − 5π’2 π’π₯π₯ + 5π’4 ) ππ₯. ∫ (π’π₯π₯ 2 π σ΅¨σ΅¨σ΅¨σ΅¨ σ΅¨ π [π’ + ππ [π’, π]] ππ σ΅¨σ΅¨σ΅¨π=0 (40) Proposition 8. If π ∈ Aπ and π ∈ Aπ then Μ 7 = 1 P6 = π ∫ (3π‘π’2 + π₯π’) ππ₯. P 2 2 π5 ≈ EπΏP5 = Eπ (3π’2 − π’π₯π₯ ) Dπ (π) = for any π ∈ Aπ . Μ 2 = P1 = ∫ 1 π’2 ππ₯, P 2 Μ 4 = π P0 = π ∫ π’ ππ₯, P 2 2 perturbed differential operator Dπ : Aπ → Aπ defined so that Dπ (π) ≈ pr vπ (π) . (41) Theorem 9. Suppose that Δ[π’, π] = 0 be a system of perturbed differential equations. If R : Aπ → Aπ is a linear operator such that for all solutions π’ of Δ, Μ ⋅ DΔ , DΔ ⋅ R ≈ R (42) where R : Aπ → Aπ is a linear differential operator, then R is an approximate recursion operator for the system. Suppose that Δ[π’, π] = π’π‘ − πΎ[π’, π] is a perturbed evolution equation. Then DΔ = π·π‘ − DπΎ . If R is an approximate recursion operator, then it is not hard to observe that the Μ in (42) must be the same as R. Therefore, operator R the condition (42) in this case reduces to the commutator condition (39) 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 R : Aπ → Aπ in the space of π-tuples of differential functions with the property that whenever vπ is an approxiΜ ≈ Rπ. mate evolutionary symmetry of Δ, so vπΜ 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) FreΜchet derivative of a differential function. Definition 7. Let π[π’, π] = π(π₯, π’(π) , π) ∈ Aπ be an π-tuple of differential functions. The FreΜchet derivative of π is the Rπ‘ ≈ [DπΎ , R] for an approximate recursion operator of a perturbed evolution equation. From (4), we can conclude that if R is an approximate recursion operator, then for all π ≥ 1 in which ππ R =ΜΈ 0, ππ R is an approximate recursion operator as follows: (ππ R)π‘ = ππ Rπ‘ ≈ ππ [DπΎ , R] ≈ [DπΎ , ππ R] . 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 π’π‘ = π’π₯π₯ + ππ’π₯2 . (43) 6 Advances in Mathematical Physics As mentioned in [7], approximate symmetries of the potential Burgers’ equation are given by the following twelve vector fields v1 = ππ₯ , v2 = ππ‘ , v3 = π₯ππ₯ + 2π‘ππ‘ , v4 = 2π‘ππ₯ − (π₯π’ − ππ‘ v5 = (π’ − ππ‘ π·πΎ = π·π₯2 + 2ππ’π₯ π·π₯ . π’2 ) ππ’ , 2 2 π’ ) ππ’ , 2 (R1 )π‘ = (π·π₯ + ππ’π₯ )π‘ = ππ’π₯π‘ = π (π’π₯π₯π₯ + 2ππ’π₯ π’π₯π₯ ) = ππ’π₯π₯π₯ . (49) (44) v7 = πv1 , v8 = πv2 , v11 = ππ’ππ’ = πv5 , v12 = π (4π₯π‘ππ₯ + 4π‘2 ππ‘ − (π₯2 + 2π‘) π’ππ’ ) = πv6 , plus the infinite family of vector fields (45) where π, π are arbitrary solutions of the heat equation π’π‘ = π’π₯π₯ . R1 π12 = π ((π₯2 + 6π‘) π’π₯ + 2π₯ (π’ + 2π‘π’π₯π₯ ) + 4π‘2 π’π₯π₯π₯ ) . (51) To obtain the characteristics depending on π₯ and π‘, we require a second approximate recursion operator, which by inspection, we guess to be R2 = π‘R1 + The corresponding characteristics of the first twelve approximate symmetries are (R2 )π‘ = π‘(R1 )π‘ + R1 = π‘ [π·πΎ , R1 ] + R1 , π2 = π’π₯π₯ + ππ’π₯2 , (46) (52) (53) whereas 1 [π·πΎ , R2 ] = π‘ [π·πΎ , R1 ] + [π·π₯2 + 2ππ’π₯ π·π₯ , π₯] 2 π’2 π4 = π₯π’ + 2π‘π’π₯ − ππ‘ , 2 = π‘ [π·πΎ , R1 ] + (π·π₯ + ππ’π₯ ) = π‘ [π·πΎ , R1 ] + R1 , (54) π’2 π5 = π’ − ππ‘ , 2 π’2 ) + 4π₯π‘π’π₯ + 4π‘2 (π’π₯π₯ + ππ’π₯2 ) , 2 π7 = ππ1 = ππ’π₯ , π8 = ππ2 = ππ’π₯π₯ , proving that R2 is also an approximate recursion operator. There is thus a doubly infinite hierarchy of approximate generalized symmetries of potential Burgers’ equation, with characteristics Rπ2 Rπ1 π1 , π, π ≥ 0. For instance, π2 = R1 π1 , π3 = 2R2 R1 π1 and so on. Example 11. Consider the Gardner equation, which was shown to have two Hamiltonian structures with π9 = ππ3 = π (π₯π’π₯ + 2π‘π’π₯π₯ ) , π10 = ππ4 = π (π₯π’ + 2π‘π’π₯ ) , D = π·π₯ , π11 = ππ5 = ππ’, π12 = ππ6 = π ((π₯2 + 2π‘) π’ + 4π₯π‘π’π₯ + 4π‘2 π’π₯π₯ ) , (47) (up to sign). π₯ . 2 Using the fact that R1 satisfies (4), we readily find π1 = π’π₯ , π3 = π₯π’π₯ + 2π‘ (π’π₯π₯ + ππ’π₯2 ) , (50) Comparing these two verifies (4) and proves that R1 is an approximate recursion operator for the potential Burgers’ equation. There is thus an infinite hierarchy of approximate symmetries, with characteristics Rπ1 π1 , π = 0, 1, 2, . . . For example, the next characteristic after π12 in the sequence is v10 = π (2π‘ππ₯ − π₯π’ππ’ ) = πv4 , vπ,π = (π (π₯, π‘) (1 − ππ’) + ππ (π₯, π‘)) ππ’ , On the other hand, the commutator is computed using Leibniz’ rule for differential operators: [π·πΎ , R1 ] = ππ’π₯π₯π₯ . v9 = π (π₯ππ₯ + 2π‘ππ‘ ) = πv3 , π6 = (π₯2 + 2π‘) (π’ − ππ‘ (48) We must verify (4). The time derivative of the first approximate recursion operator R1 on the solutions of the potential Burgers’ equation is the multiplication operator as follows: π’2 ) ππ’ , 2 v6 = 4π₯π‘ππ₯ + 4π‘2 ππ‘ − (π₯2 + 2π‘) (π’ − ππ‘ Inspection of π1 , π2 , π7 , π8 leads us to the conjecture that R1 = π·π₯ + ππ’π₯ is an approximate recursion operator, since π3 = R1 π1 , π8 = R1 π7 , and so forth. To prove this, we note that the FreΜchet derivative for the right-hand side of potential Burgers’ equation is E = 4π’π·π₯ + 2π’π₯ + 3π (π’π’π₯ + π’2 π·π₯ ) − π·π₯3 . (55) Hence, the operator connecting our hierarchy of approximate Hamiltonian symmetries is R = E ⋅ D−1 = 4π’ + 3ππ’2 + (2 + 3ππ’) π’π₯ π·π₯−1 − π·π₯2 . (56) Advances in Mathematical Physics 7 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 FreΜchet derivative for the right-hand side of Gardner’s equation is Definition 13. A pair of skew-adjoint π × π matrix of differential operators D and E is said to form an approximately Hamiltonian pair if every linear combination πD + πE, π, π ∈ R, is an approximate Hamiltonian operator. A system of perturbed evolution equations is an approximate biHamiltonian system if it can be written in the form of DπΎ = 6 (1 + 2ππ’) π’π₯ + 6 (π’ + ππ’2 ) π·π₯ − π·π₯3 , Rπ‘ = (4 + 6ππ’) π’π‘ + (2π’π₯π‘ + 3ππ’π‘ π’π₯ + ππ’ = πΎ1 [π’, π] ≈ DπΏH1 ≈ EπΏH0 , ππ‘ 3ππ’π’π₯π‘ ) π·π₯−1 = 12π’π’π₯ (2 + 5ππ’) − (4 + 6ππ’) π’π₯π₯π₯ (57) (63) where D, E form an approximately Hamiltonian pair, and H0 and H1 are appropriate Hamiltonian functionals. Lemma 14. If D, E are skew-adjoint operators, then they form an approximately Hamiltonian pair if and only if D, E and D + E are all approximate Hamiltonian operators. + (6π’π’π₯π₯ (2 + 5ππ’) + 12π’π₯2 (1 + 5ππ’) −π’π₯π₯π₯π₯ (2 + 3ππ’) − 3ππ’π₯ π’π₯π₯π₯ ) π·π₯−1 . Theorem 12. Let π0 = ππ’π₯ . For each π ≥ 0, the differential polynomial ππ = Rπ π0 is a total π₯-derivative, ππ = π·π₯ π π , and hence we can recursively define ππ+1 = Rππ . Each ππ is the characteristic of an approximate symmetry of the Gardner equation. Corollary 15. Let D and E be Hamiltonian differential operators. Then D, E form an approximately Hamiltonian pair if and only if pr vDπ (ΘE ) + pr vEπ (ΘD ) = π (ππ ) , (64) where 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 ππ = Rπ π0 for some π π ∈ A. From the form of the approximate recursion operator, ππ+1 = π (4π’ππ + 2π’π₯ π·π₯−1 ππ − π·π₯2 ππ ) = ππ·π₯ (2π’π·π₯−1 ππ + 2π·π₯−1 (π’ππ ) − π·π₯ ππ ) . (58) If we can prove that for some differential polynomial ππ ∈ A, π’ππ = π·π₯ ππ , we will indeed have proved that ππ+1 = π·π₯ π π+1 , where π π+1 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 πR is ∗ πR = π (4π’ − 2π·π₯−1 ⋅ π’π₯ − π·π₯2 ) = π·π₯−1 πRπ·π₯ . (59) We apply this in order to integrate the expression π’ππ , by parts, so π ππ = π’Rπ [ππ’π₯ ] = π’π₯ ⋅ (πR∗ ) [π’] + π·π₯ π΄ π (60) for some differential function π΄ π ∈ A. On the other hand, using a further integration by parts, for some π΅π ∈ A the following identity holds: ∗ π π’π₯ ⋅ (πR ) [π’] = π’π₯ ⋅ π·π₯−1 πR [π’π₯ ] = π’π₯ ⋅ π·π₯−1 ππ (61) which proves our claim. 1 (π΄ + π΅π ) , 2 π ΘE = 1 ∫ {π ∧ Eπ} ππ₯ (65) 2 are the functional bi-vectors representing the respective Poisson brackets. Example 16. Consider the approximate Hamiltonian operators D, E associated with the Gardner equation. We have pr vDπ = ∑ π·π½ (Dπ)πΌ πΌ,π½ π ππ’π½πΌ π π = ∑ π·π½ ( ∑ DπΌπ½ ππ½ ) πΌ ππ’π½ πΌ,π½ π½=1 (66) in the case of the second approximate Hamiltonian operator for the Gardner equation, we have pr vEπ (π’2 ) = 2π’Eπ, pr vEπ (π’) = Eπ, pr vEπ (ΘD ) = pr vEπ ∫ 1 {π ∧ ππ₯ } ππ₯ = π (ππ ) 2 (67) trivially, by the properties of the wedge product, it is deduced that pr vDπ (ΘE ) 1 3π 2 π’ ) π ∧ ππ₯ + ππ₯ ∧ π} ππ₯ (68) 2 2 ≈ ∫ {(2 + 3ππ’) ππ₯ ∧ π ∧ ππ₯ } = π (ππ ) . Thus D and E form an approximately Hamiltonian pair. Substituting into the previous identity, we conclude where ππ = 1 ∫ {π ∧ Dπ} ππ₯, 2 = pr vDπ ∫ {(2π’ + = −π’ππ + π·π₯ π΅π . π’ππ = π·π₯ ππ , ΘD = (62) Definition 17. A differential operator D : Aπ → Aπ is approximately degenerate if there is a nonzero differential Μ : Aπ → A such that D Μ ⋅ D ≡ π(ππ ). operator D 8 Advances in Mathematical Physics π Now, according to [10], we are in a situation to state the main theorem on approximate bi-Hamiltonian systems. Judging from Rπ = π(ππ ), when π =ΜΈ 0, this type of approximate recursion operators have less significance than R0 . Theorem 18. Let Example 21. The approximate recursion operators of the Gardner equation are π’π‘ = πΎ1 [π’, π] ≈ DπΏH1 ≈ EπΏH0 (69) be an approximate bi-Hamiltonian system of perturbed evolution equations. Assume that the operator D of the approximately Hamiltonian pair is approximate nondegenerate. Let R = E ⋅ D−1 be the corresponding approximate recursion operator, and let πΎ0 ≈ DπΏH0 . Assume that for each π = 1, 2, . . . one can recursively define πΎπ ≈ RπΎπ−1 , π ≥ 1, (70) meaning that for each π, πΎπ−1 lies in the image of D. Then there exists a sequence of functionals H0 , H1 , H2 , . . . such that R0 = E ⋅ D−1 = 4π’ + 2π’π₯ π·π₯−1 + 3π (π’π’π₯ π·π₯−1 + π’2 ) − π·π₯2 , R1 = π (4π’ + 2π’π₯ π·π₯−1 − π·π₯2 ) (75) and we can apply R0 to the right-hand side of the Gardner equation to obtain the approximate symmetries. The first step in this recursion is the flow π’π‘ ≈ EπΏH1 ≈ DπΏH2 ≈ π’π₯π₯π₯π₯π₯ − 10π’π’π₯π₯π₯ − 20π’π₯ π’π₯π₯ + 30π’2 π’π₯ (i) for each π ≥ 1 the perturbed evolution equation π’π‘ = πΎπ [π’, π] ≈ DπΏHπ ≈ EπΏHπ−1 (ii) the corresponding approximate evolutionary vector fields vπ = vπΎπ all mutually commute [vπ , vπ ] = π (ππ ) , π, π ≥ 0; (72) (iii) the approximate Hamiltonian functionals Hπ are all in involution with respect to either Poisson bracket: {Hπ , Hπ }D = π (ππ ) = {Hπ , Hπ }E , π, π ≥ 0, + π (55π’3 π’π₯ − 39π’π’π₯ π’π₯π₯ − 9π’2 π’π₯π₯π₯ − 12π’π₯3 ) , (71) is an approximate bi-Hamiltonian system; (73) and hence provide an infinite collection of approximate conservation laws for each of the approximate biHamiltonian systems (63). We have seen that given an approximate bi-Hamiltonian system, the operator R = E ⋅ D−1 , when applied successively to the initial equation πΎ0 = DπΏH0 , 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 R is a true approximate recursion operator for the system, in the sense that whenever vπ is an approximate generalized symmetry, so is vRπ. 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. 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 πΎ1 [π’, π] = π5 = ππΎ1 [π’, π] = π (6π’π’π₯ − π’π₯π₯π₯ ) , Μ 5 = πH0 , H0 = P (74) Theorem 20. Let π’π‘ = πΎ ≈ DπΏH1 ≈ EπΏH0 be an approximate bi-Hamiltonian system of perturbed evolution equations. Then the operators Rπ = ππ E ⋅ D−1 , 0 ≤ π ≤ π, are approximate recursion operators for the system. H1 = P5 = πH1 , (77) then we can apply R0 successively to πΎ1 in order to obtain the approximate symmetries. The first phase become π’π‘ ≈ EπΏH1 ≈ DπΏH2 ≈ R0 πΎ1 ≈ π (π’π₯π₯π₯π₯π₯ − 10π’π’π₯π₯π₯ − 20π’π₯ π’π₯π₯ + 30π’2 π’π₯ ) (78) in which H2 = P5 = π 2 − 5π’2 π’π₯π₯ + 5π’4 ) ππ₯ ∫ (π’π₯π₯ 2 (79) is another approximate conservation law. Now, for πΎ2 = R0 πΎ1 we have π’π‘ ≈ EπΏH2 ≈ DπΏH3 ≈ R0 πΎ2 ≈ π (−π’π₯π₯π₯π₯π₯π₯π₯ + 14π’π’π₯π₯π₯π₯π₯ + 42π’π₯ π’π₯π₯π₯π₯ ) + 70π (π’π₯π₯ π’π₯π₯π₯ − π’2 π’π₯π₯π₯ + 2π’3 π’π₯ − 4π’π’π₯ π’π₯π₯ − π’π₯3 ) , (80) Lemma 19. Let π’π‘ = πΎ ≈ DπΏH be an approximate Hamiltonian system of perturbed evolution equations with corresponding vector field vπΎ = vΜH . Then pr vΜH (D) ≈ DπΎ ⋅ D + D ⋅ D∗πΎ . (76) where H3 = 7π ∫ ( 2 π’π₯π₯π₯ 2 + 5π’2 π’π₯2 + π’5 ) ππ₯ + π’π’π₯π₯ 14 is a further approximate conservation law. (81) Advances in Mathematical Physics 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 [2–4]. 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 D, E, computation of the approximate recursion operator R = E ⋅ D−1 is difficult. Since prolongation and FreΜ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 biHamiltonian 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. References [1] S. Lie, “On integration of a class of linear partial differential equations by means of definite integrals,” Archiv der Mathematik, vol. 6, pp. 328–368, 1881. [2] V. A. Baikov, R. K. Gazizov, and N. Kh. Ibragimov, “Approximate symmetries of equations with a small parameter,” MatematicheskiΔ±Μ Sbornik, vol. 136, no. 4, pp. 435–450, 1988. [3] V. A. Baikov, R. K. Gazizov, and N. H. Ibragimov, “Approximate transformation groups and deformations of symmetry Lie algebras,” in CRC Handbook of Lie Group Analysis of Differential Equations, N. H. Ibragimov, Ed., vol. 3, chapter 2, CRC Press, Boca Raton, Fla, USA, 1996. [4] W. I. Fushchich and W. M. Shtelen, “On approximate symmetry and approximate solutions of the nonlinear wave equation with a small parameter,” Journal of Physics A, vol. 22, no. 18, pp. L887– L890, 1989. 9 [5] N. Euler, M. W. Shul’ga, and W.-H. Steeb, “Approximate symmetries and approximate solutions for a multidimensional LandauGinzburg equation,” Journal of Physics A, vol. 25, no. 18, pp. L1095–L1103, 1992. [6] M. Euler, N. Euler, and A. KoΜhler, “On the construction of approximate solutions for a multidimensional nonlinear heat equation,” Journal of Physics A, vol. 27, no. 6, pp. 2083–2092, 1994. [7] M. Pakdemirli, M. YuΜruΜsoy, and IΜ. T. DolapcΜ§i, “Comparison of approximate symmetry methods for differential equations,” Acta Applicandae Mathematicae, vol. 80, no. 3, pp. 243–271, 2004. [8] R. Wiltshire, “Two approaches to the calculation of approximate symmetry exemplified using a system of advection-diffusion equations,” Journal of Computational and Applied Mathematics, vol. 197, no. 2, pp. 287–301, 2006. [9] N. H. Ibragimov and V. F. Kovalev, Approximate and Renormgroup Symmetries, Nonlinear Physical Science, Springer, Berlin, Germany, 2009. [10] P. J. Olver, Applications of Lie Groups to Differential Equations, vol. 107 of Graduate Texts in Mathematics, Springer, New York, NY, USA, 2nd edition, 1993. [11] M. Nadjafikhah and A. Mokhtary, “Approximate symmetry analysis of Gardner equation,” http://arxiv.org/abs/1212.3604 . [12] Z. Zhang, “Approximate homotopy series solutions of perturbed PDEs via approximate symmetrymethod,” http://128.84. 158.119/abs/1112.4225v2. Advances in Hindawi Publishing Corporation http://www.hindawi.com Algebra Advances in Operations Research Decision Sciences Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Journal of Probability and Statistics Mathematical Problems in Engineering Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 The Scientific World Journal Hindawi Publishing Corporation http://www.hindawi.com Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 International Journal of Differential Equations Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Volume 2014 Submit your manuscripts at http://www.hindawi.com International Journal of Advances in Combinatorics Mathematical Physics Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Journal of Complex Analysis Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 International Journal of Mathematics and Mathematical Sciences Hindawi Publishing Corporation http://www.hindawi.com Journal of Hindawi Publishing Corporation http://www.hindawi.com Stochastic Analysis Abstract and Applied Analysis Hindawi Publishing Corporation http://www.hindawi.com Hindawi Publishing Corporation http://www.hindawi.com International Journal of Mathematics Volume 2014 Volume 2014 Journal of Volume 2014 Discrete Dynamics in Nature and Society Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Journal of Applied Mathematics Optimization Hindawi Publishing Corporation http://www.hindawi.com Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Journal of Discrete Mathematics Journal of Function Spaces Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Volume 2014 Volume 2014