About this Journal Submit a Manuscript Table of Contents
Journal of Function Spaces and Applications
VolumeΒ 2012Β (2012), Article IDΒ 679465, 30 pages
doi:10.1155/2012/679465
Research Article

A Weak Comparison Principle for Reaction-Diffusion Systems

Centro de Investigación Operativa, Universidad Miguel Hernández de Elche, Avenida Universidad s/n, 03202 Elche, Spain

Received 4 May 2012; Accepted 17 July 2012

Academic Editor: S.Β Romaguera

Copyright Β© 2012 José Valero. 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.

Abstract

We prove a weak comparison principle for a reaction-diffusion system without uniqueness of solutions. We apply the abstract results to the Lotka-Volterra system with diffusion, a generalized logistic equation, and to a model of fractional-order chemical autocatalysis with decay. Moreover, in the case of the Lotka-Volterra system a weak maximum principle is given, and a suitable estimate in the space of essentially bounded functions 𝐿 ∞ is proved for at least one solution of the problem.

1. Introduction

Comparison results for parabolic equations and ordinary differential equations are well known in the literature (see, e.g., [14] among many others). One of the important applications of such kind of results is the theory of monotone dynamical systems, which leads to a more precise characterization of πœ” -limit sets and attractors. In the last years, several authors have been working in this direction (see, e.g., [48] for the deterministic case, and [912] for the stochastic case). In all these papers, it is considered the classical situation where the initial-value problem possesses a unique solution.

However, the situation is more complicated when we consider a differential equation for which uniqueness of the Cauchy problem fails (or just it is not known to hold). Let us consider an abstract parabolic problem: 𝑑 𝑒 𝑑 𝑑 = 𝐴 ( 𝑑 , 𝑒 ( 𝑑 ) ) , 𝜏 ≀ 𝑑 ≀ 𝑇 , 𝑒 ( 𝜏 ) = 𝑒 𝜏 , ( 1 . 1 ) for which we can prove that for every initial data in the phase space 𝑋 (with a partial order ≀ ) there exists at least one solution.

If we try to compare solutions of (1.1) for two ordered initial data 𝑒 1 𝜏 ≀ 𝑒 2 𝜏 , then we can consider a strong comparison principle and a weak one.

The strong version would imply the existence of a solution 𝑒 1 with 𝑒 1 ( 𝜏 ) = 𝑒 1 𝜏 such that 𝑒 1 ( 𝑑 ) ≀ 𝑒 2 [ ] , ( 𝑑 ) f o r 𝑑 ∈ 𝜏 , 𝑇 ( 1 . 2 ) for any solution 𝑒 2 with 𝑒 2 ( 𝜏 ) = 𝑒 2 𝜏 , and, viceversa, the existence of a solution 𝑒 2 with 𝑒 2 ( 𝜏 ) = 𝑒 2 𝜏 such that (1.2) is satisfied for any solution 𝑒 1 with 𝑒 1 ( 𝜏 ) = 𝑒 1 𝜏 . This kind of result is established in [13] for a delayed ordinary differential equations, defining then a multivalued order-preserving dynamical system.

The weak version of the comparison principle says that if 𝑒 1 𝜏 ≀ 𝑒 2 𝜏 , then there exist two solutions 𝑒 1 , 𝑒 2 of (1.1) such that 𝑒 1 ( 𝜏 ) = 𝑒 1 𝜏 , 𝑒 2 ( 𝜏 ) = 𝑒 2 𝜏 , and (1.2) hold.

There is in fact an intermediate version of the comparison principle, which says that if we fix a solution 𝑒 1 of (1.1) with 𝑒 1 ( 𝜏 ) = 𝑒 1 𝜏 , then there exists a solution 𝑒 2 with 𝑒 2 ( 𝜏 ) = 𝑒 2 𝜏 such that (1.2) is satisfied (and vice versa). This is proved in [14] for a differential inclusion generated by a subdifferential map.

In this paper, we establish a weak comparison principle for a reaction-diffusion system in which the nonlinear term satisfies suitable dissipative and growth conditions, ensuring existence of solutions but not uniqueness. This principle is applied to several well-known models in physics and biology. Namely, a weak comparison of solutions is proved for the Lotka-Volterra system, the generalized logistic equation and for a model of fractional-order chemical autocatalysis with decay. Moreover, in the case of the Lotka-Volterra system a weak maximum principle is given, and a suitable estimate in the space of essentially bounded functions 𝐿 ∞ is proved for at least one solution of the problem.

We note that in the papers [15, 16] the existence of a global attractor is proved for such kind of reaction-diffusion systems. In the near future, we will apply these results to obtain theorems concerning the structure of the global attractor.

2. Comparison Results for Reaction-Diffusion Systems

We shall denote by | β‹… | and ( β‹… , β‹… ) the norm and scalar product in the space ℝ π‘š , π‘š β‰₯ 1 . Let 𝑑 > 0 be an integer and Ξ© βŠ‚ ℝ 𝑁 be a bounded open subset with smooth boundary. Consider the problem: πœ• 𝑒 πœ• 𝑑 βˆ’ π‘Ž Ξ” 𝑒 + 𝑓 ( 𝑑 , 𝑒 ) = β„Ž ( 𝑑 , π‘₯ ) , ( 𝑑 , π‘₯ ) ∈ ( 𝜏 , 𝑇 ) Γ— Ξ© , 𝑒 | π‘₯ ∈ πœ• Ξ© 𝑒 | = 0 , 𝑑 = 𝜏 = 𝑒 𝜏 ( π‘₯ ) , ( 2 . 1 ) where 𝜏 , 𝑇 ∈ ℝ , 𝑇 > 𝜏 , π‘₯ ∈ Ξ© , 𝑒 = ( 𝑒 1 ( 𝑑 , π‘₯ ) , … , 𝑒 𝑑 ( 𝑑 , π‘₯ ) ) , 𝑓 = ( 𝑓 1 , … , 𝑓 𝑑 ) , π‘Ž is a real 𝑑 Γ— 𝑑 matrix with a positive symmetric part ( π‘Ž + π‘Ž 𝑑 ) / 2 β‰₯ 𝛽 𝐼 , 𝛽 > 0 , β„Ž ∈ 𝐿 2 ( 𝜏 , 𝑇 ; ( 𝐿 2 ( Ξ© ) ) 𝑑 ) . Moreover, 𝑓 = ( 𝑓 1 ( 𝑑 , 𝑒 ) , … , 𝑓 𝑑 ( 𝑑 , 𝑒 ) ) is jointly continuous on [ 𝜏 , 𝑇 ] Γ— ℝ 𝑑 and satisfies the following conditions: 𝑑  𝑖 = 1 | | 𝑓 𝑖 | | ( 𝑑 , 𝑒 ) 𝑝 𝑖 / ( 𝑝 𝑖 βˆ’ 1 ) ≀ 𝐢 1  1 + 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 ξƒͺ , ( 𝑓 ( 𝑑 , 𝑒 ) , 𝑒 ) β‰₯ 𝛼 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 βˆ’ 𝐢 2 , ( 2 . 2 ) where 𝑝 𝑖 β‰₯ 2 , 𝛼 , 𝐢 1 , 𝐢 2 > 0 .

Let 𝐻 = ( 𝐿 2 ( Ξ© ) ) 𝑑 , 𝑉 = ( 𝐻 1 0 ( Ξ© ) ) 𝑑 , and let 𝑉 ξ…ž be the dual space of 𝑉 . By β€– β‹… β€– , β€– β‹… β€– 𝑉 we denote the norm by 𝐻 and 𝑉 , respectively. For 𝑝 = ( 𝑝 1 , … , 𝑝 𝑑 ) , we define the spaces 𝐿 𝑝 ( Ξ© ) = 𝐿 𝑝 1 ( Ξ© ) Γ— β‹― Γ— 𝐿 𝑝 𝑑 ( 𝐿 Ξ© ) , 𝑝 ( 𝜏 , 𝑇 ; 𝐿 𝑝 ( Ξ© ) ) = 𝐿 𝑝 1 ( 𝜏 , 𝑇 ; 𝐿 𝑝 1 ( Ξ© ) ) Γ— β‹― Γ— 𝐿 𝑝 𝑑 ( 𝜏 , 𝑇 ; 𝐿 𝑝 𝑑 ( Ξ© ) ) . ( 2 . 3 ) We take π‘ž = ( π‘ž 1 , … , π‘ž 𝑑 ) , where ( 1 / 𝑝 𝑖 ) + ( 1 / π‘ž 𝑖 ) = 1 .

We say that the function 𝑒 ( β‹… ) is a weak solution of (2.1) if 𝑒 ∈ 𝐿 𝑝 ( 𝜏 , 𝑇 ; 𝐿 𝑝 ( Ξ© ) ) ∩ 𝐿 2 ( 𝜏 , 𝑇 ; 𝑉 ) ∩ 𝐢 ( [ 𝜏 , 𝑇 ] ; 𝐻 ) , 𝑑 𝑒 / 𝑑 𝑑 ∈ 𝐿 2 ( 𝜏 , 𝑇 ; 𝑉 ξ…ž ) + 𝐿 π‘ž ( 𝜏 , 𝑇 ; 𝐿 π‘ž ( Ξ© ) ) , 𝑒 ( 𝜏 ) = 𝑒 𝜏 , and ξ€œ 𝑇 𝜏  𝑑 𝑒 ξ‚­ ξ€œ 𝑑 𝑑 , πœ‰ 𝑑 𝑑 + 𝑇 𝜏 ξ€œ Ξ© ξ€œ ( βˆ‡ ( π‘Ž 𝑒 ) , βˆ‡ πœ‰ ) 𝑑 π‘₯ 𝑑 𝑑 + 𝑇 𝜏 ξ€œ Ξ© ξ€œ ( 𝑓 ( 𝑑 , 𝑒 ) , πœ‰ ) 𝑑 π‘₯ 𝑑 𝑑 = 𝑇 𝜏 ξ€œ Ξ© ( β„Ž , πœ‰ ) 𝑑 π‘₯ 𝑑 𝑑 , ( 2 . 4 ) for all πœ‰ ∈ 𝐿 𝑝 ( 𝜏 , 𝑇 ; 𝐿 𝑝 ( Ξ© ) ) ∩ 𝐿 2 ( 𝜏 , 𝑇 ; 𝑉 ) , where ⟨ β‹… , β‹… ⟩ denotes pairing in the space 𝑉 ξ…ž + 𝐿 π‘ž ( Ξ© ) , and βˆ‘ ( βˆ‡ 𝑒 , βˆ‡ 𝑣 ) = 𝑑 𝑖 = 1 ( βˆ‡ 𝑒 𝑖 , βˆ‡ 𝑣 𝑖 ) .

Under conditions (2.2), it is known [17, page 284] that for any 𝑒 𝜏 ∈ 𝐻 there exists at least one weak solution 𝑒 = 𝑒 ( 𝑑 , π‘₯ ) of (2.1), and also that the function 𝑑 ↦ β€– 𝑒 ( 𝑑 ) β€– 2 is absolutely continuous on [ 𝜏 , 𝑇 ] and ( 𝑑 / 𝑑 𝑑 ) β€– 𝑒 ( 𝑑 ) β€– 2 = 2 ⟨ 𝑑 𝑒 / 𝑑 𝑑 , 𝑒 ⟩ for a.a. 𝑑 ∈ ( 𝜏 , 𝑇 ) .

Denote π‘Ÿ = ( π‘Ÿ 1 , … , π‘Ÿ 𝑑 ) , π‘Ÿ 𝑖 = m a x { 1 ; 𝑁 ( 1 / π‘ž 𝑖 βˆ’ 1 / 2 ) } . Any weak solution satisfies ( 𝑑 𝑒 / 𝑑 𝑑 ) ∈ 𝐿 π‘ž ( 𝜏 , 𝑇 ; 𝐻 βˆ’ π‘Ÿ ( Ξ© ) ) and 𝐿 π‘ž ( 0 , 𝑇 ; 𝐻 βˆ’ π‘Ÿ ( Ξ© ) ) = 𝐿 π‘ž 1 ( 0 , 𝑇 ; 𝐻 βˆ’ π‘Ÿ 1 ( Ξ© ) ) Γ— β‹― Γ— 𝐿 π‘ž 𝑑 ( 0 , 𝑇 ; 𝐻 βˆ’ π‘Ÿ 𝑑 ( Ξ© ) ) . ( 2 . 5 )

If, additionally, we assume that that 𝑓 ( 𝑑 , 𝑒 ) is continuously differentiable with respect to 𝑒 for any 𝑑 ∈ [ 𝜏 , 𝑇 ] , 𝑒 ∈ ℝ 𝑑 , and ξ€· 𝑓 𝑒 ξ€Έ ( 𝑑 , 𝑒 ) 𝑀 , 𝑀 β‰₯ βˆ’ 𝐢 3 ( 𝑑 ) | 𝑀 | 2 , βˆ€ 𝑀 , 𝑒 ∈ ℝ 𝑑 , ( 2 . 6 ) where 𝐢 3 ( β‹… ) ∈ 𝐿 1 ( 𝜏 , 𝑇 ) , 𝐢 3 ( 𝑑 ) β‰₯ 0 , the weak solution of (2.1) is unique. Here, 𝑓 𝑒 denotes the Jacobian matrix of 𝑓 .

We consider also the following assumption: there exists 𝑅 0 > 0 such that 𝑓 𝑖 ( 𝑑 , 𝑒 ) β‰₯ 𝑓 𝑖 ( 𝑑 , 𝑣 ) , ( 2 . 7 ) for any 𝑑 ∈ [ 𝜏 , 𝑇 ] and any 𝑒 , 𝑣 ∈ ℝ 𝑑 such that 𝑒 𝑖 = 𝑣 𝑖 and 𝑒 𝑗 ≀ 𝑣 𝑗 if 𝑗 β‰  𝑖 , and | 𝑒 | , | 𝑣 | ≀ 𝑅 0 , which means that the systems is cooperative in the ball with radius 𝑅 0 centered at 0 .

Consider the two problems: πœ• 𝑒 πœ• 𝑑 βˆ’ π‘Ž Ξ” 𝑒 + 𝑓 1 ( 𝑑 , 𝑒 ) = β„Ž 1 ( 𝑑 , π‘₯ ) , ( 𝑑 , π‘₯ ) ∈ ( 𝜏 , 𝑇 ) Γ— Ξ© , 𝑒 | π‘₯ ∈ πœ• Ξ© 𝑒 | = 0 , 𝑑 = 𝜏 = 𝑒 𝜏 ( π‘₯ ) , ( 2 . 8 ) πœ• 𝑒 πœ• 𝑑 βˆ’ π‘Ž Ξ” 𝑒 + 𝑓 2 ( 𝑑 , 𝑒 ) = β„Ž 2 𝑒 | ( 𝑑 , π‘₯ ) , ( 𝑑 , π‘₯ ) ∈ ( 𝜏 , 𝑇 ) Γ— Ξ© , π‘₯ ∈ πœ• Ξ© = 0 , 𝑒 | 𝑑 = 𝜏 = 𝑒 𝜏 ( π‘₯ ) , ( 2 . 9 ) where 𝑓 𝑗 are jointly continuous on [ 𝜏 , 𝑇 ] Γ— ℝ 𝑑 . Among conditions (2.2) and (2.6)-(2.7), we shall consider the following: β„Ž 1 ( 𝑑 , π‘₯ ) ≀ β„Ž 2 ( 𝑑 , π‘₯ ) , f o r a . a . ( 𝑑 , π‘₯ ) , 𝑓 𝑖 1 ( 𝑑 , 𝑒 ) β‰₯ 𝑓 𝑖 2 ( 𝑑 , 𝑒 ) , βˆ€ 𝑑 , 𝑒 . ( 2 . 1 0 )

Lemma 2.1. If 𝑓 𝑗 satisfy (2.2) and (2.10), then the constants 𝑝 𝑖 have to be the same for 𝑓 1 and 𝑓 2 .

Proof. Denote by 𝑝 𝑗 𝑖 , 𝛼 𝑗 , 𝐢 𝑗 1 , and 𝐢 𝑗 2 the constants corresponding to 𝑓 𝑗 in (2.2). By contradiction let, for example, 𝑝 2 1 > 𝑝 1 1 . Take the sequence 𝑒 𝑛 = ( 𝑒 1 𝑛 , 0 , … , 0 ) , where 𝑒 1 𝑛 β†’ + ∞ as 𝑛 β†’ ∞ . Then by (2.2), (2.10), and Young’s inequality, we have 𝛼 2 | | 𝑒 1 𝑛 | | 𝑝 2 1 βˆ’ 𝐢 2 2 ≀ ξ€· 𝑓 2 ξ€· 𝑑 , 𝑒 𝑛 ξ€Έ , 𝑒 𝑛 ξ€Έ ≀ ξ€· 𝑓 1 ξ€· 𝑑 , 𝑒 𝑛 ξ€Έ , 𝑒 𝑛 ξ€Έ = 𝑓 1 1 ξ€· 𝑑 , 𝑒 𝑛 ξ€Έ 𝑒 1 𝑛 ≀ ξ‚€ 𝐢 1 1 ξ‚€ | | 𝑒 1 + 1 𝑛 | | 𝑝 1 1   ( 𝑝 1 1 βˆ’ 1 ) / 𝑝 1 1 𝑒 𝑛 1 ξ‚€ | | 𝑒 ≀ 𝐢 1 + 1 𝑛 | | 𝑝 1 1  . ( 2 . 1 1 ) But 𝑝 2 1 > 𝑝 1 1 implies the existence of 𝑛 such that 𝛼 2 | 𝑒 1 𝑛 | 𝑝 2 1 βˆ’ 𝐢 2 2 > 𝐢 ( 1 + | 𝑒 1 𝑛 | 𝑝 1 1 ) , which is a contradiction. Hence, 𝑝 2 1 ≀ 𝑝 1 1 .
Conversely, let 𝑝 2 1 < 𝑝 1 1 . Then we take 𝑒 𝑛 = ( 𝑒 1 𝑛 , 0 , … , 0 ) with 𝑒 1 𝑛 β†’ βˆ’ ∞ as 𝑛 β†’ ∞ so that 𝛼 1 | | 𝑒 1 𝑛 | | 𝑝 1 1 βˆ’ 𝐢 1 2 ≀ ξ€· 𝑓 1 ξ€· 𝑑 , 𝑒 𝑛 ξ€Έ , 𝑒 𝑛 ξ€Έ ≀ ξ€· 𝑓 2 ξ€· 𝑑 , 𝑒 𝑛 ξ€Έ , 𝑒 𝑛 ξ€Έ = 𝑓 1 2 ξ€· 𝑑 , 𝑒 𝑛 ξ€Έ 𝑒 1 𝑛 ≀ ξ‚€ 𝐢 2 1 ξ‚€ | | 𝑒 1 + 1 𝑛 | | 𝑝 2 1   ( 𝑝 2 1 βˆ’ 1 ) / 𝑝 2 1 𝑒 𝑛 1 ξ‚€ | | 𝑒 ≀ 𝐢 1 + 1 𝑛 | | 𝑝 2 1  . ( 2 . 1 2 ) As before, we obtain a contradiction, so 𝑝 2 1 = 𝑝 1 1 .
Repeating similar arguments for the other 𝑝 𝑗 𝑖 , we obtain that 𝑝 1 𝑖 = 𝑝 2 𝑖 for 𝑖 = 1 , … , 𝑑 .

We recall [15] that under conditions (2.2) any solution 𝑒 ( β‹… ) of (2.8) satisfies the inequality: β€– 𝑒 ( 𝑑 ) β€– 2 ξ€œ + 2 𝛽 𝑑 𝑠 β€– βˆ‡ 𝑒 ( 𝜏 ) β€– 2 𝑑 𝜏 + 𝛼 𝑑  𝑖 = 1 ξ€œ 𝑑 𝑠 β€– β€– 𝑒 𝑖 β€– β€– ( π‘Ÿ ) 𝑝 𝑖 𝐿 𝑝 𝑖 ( Ξ© ) 𝑑 π‘Ÿ ≀ β€– 𝑒 ( 𝑠 ) β€– 2 ξ€œ + 𝐢 𝑑 𝑠 ξ‚€ β€– β€– β„Ž 1 β€– β€– ( π‘Ÿ ) 2  + 1 𝑑 π‘Ÿ , ( 2 . 1 3 ) for some constant 𝐢 > 0 . Of course, the same is valid for any solution of (2.9). From (2.13), for any 𝑇 > 𝜏 we obtain β€– 𝑒 ( 𝑑 ) β€– 2 ≀ β€– β€– 𝑒 𝜏 β€– β€– 2 ξ€œ + 𝐢 𝑇 𝜏 ξ‚€ β€– β€– β„Ž 1 β€– β€– ( π‘Ÿ ) 2  + 1 𝑑 π‘Ÿ = 𝐾 2 ξ€· β€– β€– 𝑒 𝜏 β€– β€– ξ€Έ , 𝜏 , 𝑇 βˆ€ 𝜏 ≀ 𝑑 ≀ 𝑇 . ( 2 . 1 4 )

We shall denote by 𝑒 1 ( 𝑑 ) the solution of (2.8) corresponding to the initial data 𝑒 1 𝜏 and by 𝑒 2 ( 𝑑 ) the solution of (2.9) corresponding to the initial data 𝑒 2 𝜏 . Also, we take 𝑒 + = m a x { 𝑒 , 0 } for 𝑒 ∈ ℝ .

We obtain the following comparison result.

Theorem 2.2. Assume that 𝑓 𝑗 , β„Ž 𝑗 satisfy (2.2), (2.6), and (2.10). If 𝑒 1 𝜏 ≀ 𝑒 2 𝜏 and we suppose that 𝑓 2 satisfies (2.7) with 𝑅 2 0 β‰₯ 2 m a x { 𝐾 2 ( β€– 𝑒 1 𝜏 β€– , 𝜏 , 𝑇 ) , 𝐾 2 ( β€– 𝑒 2 𝜏 β€– , 𝜏 , 𝑇 ) } , where 𝐾 ( β€– 𝑒 𝑗 𝜏 β€– , 𝜏 , 𝑇 ) is taken from (2.14), we have 𝑒 1 ( 𝑑 ) ≀ 𝑒 2 ( 𝑑 ) , for all 𝑑 ∈ [ 𝜏 , 𝑇 ] .

Remark 2.3. The results remain valid if, instead, 𝑓 1 satisfies (2.7) with 𝑅 2 0 β‰₯ 𝐾 2 ( β€– 𝑒 1 𝜏 β€– , 𝑇 ) .

Remark 2.4. If 𝑓 2 satisfies (2.7) for an arbitrary 𝑅 0 > 0 (i.e., in the whole space ℝ 𝑑 ), then the result is true for any initial data 𝑒 1 𝜏 ≀ 𝑒 2 𝜏 .

Proof. Let 𝑔 2 ( 𝑑 , 𝑒 ) = 𝑓 2 ( 𝑑 , 𝑒 ) + 𝐢 3 ( 𝑑 ) 𝑒 . The function 𝑔 2 ( 𝑑 , β‹… ) satisfies (2.6) with 𝐢 3 ≑ 0 . For any 𝑒 1 , 𝑒 2 ∈ ℝ 𝑑 define 𝑣 2 ( 𝑒 1 , 𝑒 2 ) by 𝑣 𝑖 2 = ξ‚» 𝑒 𝑖 2 , i f 𝑒 𝑖 1 β‰₯ 𝑒 𝑖 2 , 𝑒 𝑖 1 , i f 𝑒 𝑖 1 < 𝑒 𝑖 2 . ( 2 . 1 5 ) Note that 𝑒 1 βˆ’ 𝑣 2 = ( 𝑒 1 βˆ’ 𝑒 2 ) + and 𝑣 2 βˆ’ 𝑒 2 = βˆ’ ( 𝑒 2 βˆ’ 𝑒 1 ) + , so 𝑣 𝑖 2 ≀ 𝑒 𝑖 2 for all 𝑖 . For the function ( 𝑒 1 βˆ’ 𝑒 2 ) + , we can obtain by (2.10) and the mean value theorem that 1 2 𝑑 β€– β€– ξ€· 𝑒 𝑑 𝑑 1 βˆ’ 𝑒 2 ξ€Έ + β€– β€– 2 β€– β€– ξ€· 𝑒 + π‘Ž 1 βˆ’ 𝑒 2 ξ€Έ + β€– β€– 2 𝑉 ξ€œ ≀ βˆ’ Ξ© ξ‚€ 𝑓 1 ξ€· 𝑑 , 𝑒 1 ξ€Έ βˆ’ 𝑓 2 ξ€· 𝑑 , 𝑒 2 ξ€Έ , ξ€· 𝑒 1 βˆ’ 𝑒 2 ξ€Έ +  ξ€œ 𝑑 π‘₯ ≀ βˆ’ Ξ© ξ‚€ 𝑓 2 ξ€· 𝑑 , 𝑒 1 ξ€Έ βˆ’ 𝑓 2 ξ€· 𝑑 , 𝑣 2 ξ€Έ , ξ€· 𝑒 1 βˆ’ 𝑒 2 ξ€Έ +  ξ€œ 𝑑 π‘₯ βˆ’ Ξ© ξ‚€ 𝑓 2 ξ€· 𝑑 , 𝑣 2 ξ€Έ βˆ’ 𝑓 2 ξ€· 𝑑 , 𝑒 2 ξ€Έ , ξ€· 𝑒 1 βˆ’ 𝑒 2 ξ€Έ +  ξ€œ 𝑑 π‘₯ = βˆ’ Ξ© ξ‚€ 𝑔 2 𝑒 ξ€· ξ€· 𝑑 , 𝑣 𝑑 , π‘₯ , 𝑒 1 , 𝑒 2 𝑒 ξ€Έ ξ€Έ ξ€· 1 βˆ’ 𝑣 2 ξ€Έ , ξ€· 𝑒 1 βˆ’ 𝑒 2 ξ€Έ +  𝑑 π‘₯ + 𝐢 3 ( β€– β€– ξ€· 𝑒 𝑑 ) 1 βˆ’ 𝑒 2 ξ€Έ + β€– β€– 2 βˆ’ ξ€œ Ξ© ξ‚€ 𝑓 2 ξ€· 𝑑 , 𝑣 2 ξ€Έ βˆ’ 𝑓 2 ξ€· 𝑑 , 𝑒 2 ξ€Έ , ξ€· 𝑒 1 βˆ’ 𝑒 2 ξ€Έ +  ξ€œ 𝑑 π‘₯ = βˆ’ Ξ© ξ‚€ 𝑔 2 𝑒 ξ€· ξ€· 𝑑 , 𝑣 𝑑 , π‘₯ , 𝑒 1 , 𝑒 2 𝑒 ξ€Έ ξ€Έ ξ€· 1 βˆ’ 𝑒 2 ξ€Έ + , ξ€· 𝑒 1 βˆ’ 𝑒 2 ξ€Έ +  𝑑 π‘₯ + 𝐢 3 β€– β€– ξ€· 𝑒 ( 𝑑 ) 1 βˆ’ 𝑒 2 ξ€Έ + β€– β€– 2 βˆ’ ξ€œ Ξ© ξ‚€ 𝑓 2 ξ€· 𝑑 , 𝑣 2 ξ€Έ βˆ’ 𝑓 2 ξ€· 𝑑 , 𝑒 2 ξ€Έ , ξ€· 𝑒 1 βˆ’ 𝑒 2 ξ€Έ +  𝑑 π‘₯ ≀ 𝐢 3 β€– β€– ξ€· 𝑒 ( 𝑑 ) 1 βˆ’ 𝑒 2 ξ€Έ + β€– β€– 2 βˆ’ ξ€œ Ξ© ξ‚€ 𝑓 2 ξ€· 𝑑 , 𝑣 2 ξ€Έ βˆ’ 𝑓 2 ξ€· 𝑑 , 𝑒 2 ξ€Έ , ξ€· 𝑒 1 βˆ’ 𝑒 2 ξ€Έ +  𝑑 π‘₯ . ( 2 . 1 6 )
For all 𝑑 , we have ξ‚€ 𝑓 2 ξ€· 𝑑 , 𝑣 2 ξ€Έ βˆ’ 𝑓 2 ξ€· 𝑑 , 𝑒 2 ξ€Έ , ξ€· 𝑒 1 βˆ’ 𝑒 2 ξ€Έ +  =  𝑖 ∈ 𝐽 ξ€· 𝑓 𝑖 2 ξ€· 𝑑 , 𝑣 2 ξ€Έ βˆ’ 𝑓 𝑖 2 ξ€· 𝑑 , 𝑒 2 𝑒 ξ€Έ ξ€Έ ξ€· 𝑖 1 βˆ’ 𝑒 𝑖 2 ξ€Έ + , ( 2 . 1 7 ) where 𝑒 𝑖 1 βˆ’ 𝑒 𝑖 2 > 0 , for 𝑖 ∈ 𝐽 , and 𝑒 𝑖 1 βˆ’ 𝑒 𝑖 2 ≀ 0 if 𝑖 βˆ‰ 𝐽 . For any 𝑖 ∈ 𝐽 , we have that 𝑣 𝑖 2 = 𝑒 𝑖 2 , and then by 𝑣 2 ≀ 𝑒 2 , | 𝑣 2 | 2 ≀ | 𝑒 1 | 2 + | 𝑒 2 | 2 , (2.14), and (2.7), we get 𝑓 𝑖 2 ξ€· 𝑑 , 𝑣 2 ξ€Έ βˆ’ 𝑓 𝑖 2 ξ€· 𝑑 , 𝑒 2 ξ€Έ β‰₯ 0 . ( 2 . 1 8 )
By Gronwall’s lemma, we get β€– β€– ξ€· 𝑒 1 ( 𝑑 ) βˆ’ 𝑒 2 ξ€Έ ( 𝑑 ) + β€– β€– 2 ≀ β€– β€– ξ€· 𝑒 1 𝜏 βˆ’ 𝑒 2 𝜏 ξ€Έ + β€– β€– 2 𝑒 ∫ 𝑑 𝜏 2 𝐢 3 ( 𝑠 ) 𝑑 𝑠 = 0 . ( 2 . 1 9 ) Thus β€– ( 𝑒 1 βˆ’ 𝑒 2 ) + β€– = 0 , which means that 𝑒 𝑖 1 ( π‘₯ , 𝑑 ) βˆ’ 𝑒 𝑖 2 ( π‘₯ , 𝑑 ) ≀ 0 , for a.a. π‘₯ ∈ Ξ© , and all 𝑖 ∈ { 1 , … , 𝑑 } , 𝑑 ∈ [ 𝜏 , 𝑇 ] .

Remark 2.5. In the scalar case, that is, 𝑑 = 1 , condition (2.7) is trivially satisfied.

When condition (2.6) fails to be true, we will obtain a weak comparison principle.

Define a sequence of smooth functions πœ“ π‘˜ ∢ ℝ + β†’ [ 0 , 1 ] satisfying πœ“ π‘˜ ( ⎧ βŽͺ ⎨ βŽͺ ⎩ 𝑠 ) = 1 , i f 0 ≀ 𝑠 ≀ π‘˜ , 0 ≀ πœ“ π‘˜ ( 𝑠 ) ≀ 1 , i f π‘˜ ≀ 𝑠 ≀ π‘˜ + 1 , 0 , i f 𝑠 β‰₯ π‘˜ + 1 . ( 2 . 2 0 )

For every π‘˜ β‰₯ 1 we put 𝑓 𝑖 π‘˜ ( 𝑑 , 𝑒 ) = πœ“ π‘˜ ( | 𝑒 | ) 𝑓 𝑖 ( 𝑑 , 𝑒 ) + ( 1 βˆ’ πœ“ π‘˜ ( | 𝑒 | ) ) 𝑔 𝑖 ( 𝑒 ) , where 𝑔 𝑖 ( 𝑒 ) = | 𝑒 𝑖 | 𝑝 𝑖 βˆ’ 2 𝑒 𝑖 . Then 𝑓 π‘˜ ∈ β„‚ ( [ 𝜏 , 𝑇 ] Γ— ℝ 𝑑 ; ℝ 𝑑 ) and for any 𝐴 > 0 , s u p 𝑑 ∈ [ 𝜏 , 𝑇 ] s u p | 𝑒 | ≀ 𝐴 | | 𝑓 π‘˜ | | ( 𝑑 , 𝑒 ) βˆ’ 𝑓 ( 𝑑 , 𝑒 ) β†’ 0 , a s π‘˜ β†’ ∞ . ( 2 . 2 1 )

Let 𝜌 πœ€ ∢ ℝ 𝑑 β†’ ℝ + be a mollifier, that is, 𝜌 πœ– ∈ β„‚ ∞ 0 ( ℝ 𝑑 ; ℝ ) , s u p p 𝜌 πœ– βŠ‚ 𝐡 πœ– = { π‘₯ ∈ ℝ 𝑑 ∢ | π‘₯ | < πœ– } , ∫ ℝ 𝑑 𝜌 πœ– ( 𝑠 ) 𝑑 𝑠 = 1 and 𝜌 πœ– ( 𝑠 ) β‰₯ 0 for all 𝑠 ∈ ℝ 𝑑 . We define the functions 𝑓 πœ– π‘˜ ( ξ€œ 𝑑 , 𝑒 ) = ℝ 𝑑 𝜌 πœ– ( 𝑠 ) 𝑓 π‘˜ ( 𝑑 , 𝑒 βˆ’ 𝑠 ) 𝑑 𝑠 . ( 2 . 2 2 ) Since for any π‘˜ β‰₯ 1 𝑓 π‘˜ is uniformly continuous on [ 0 , 𝑇 ] Γ— [ βˆ’ π‘˜ βˆ’ 1 , π‘˜ + 1 ] , there exist πœ– π‘˜ ∈ ( 0 , 1 ) such that for all 𝑒 satisfying | 𝑒 | ≀ π‘˜ , and for all 𝑠 for which | 𝑒 βˆ’ 𝑠 | < πœ– π‘˜ we have s u p 𝑑 ∈ [ 𝜏 , 𝑇 ] | | 𝑓 π‘˜ ( 𝑑 , 𝑒 ) βˆ’ 𝑓 π‘˜ | | ≀ 1 ( 𝑑 , 𝑠 ) π‘˜ . ( 2 . 2 3 ) We put 𝑓 π‘˜ ( 𝑑 , 𝑒 ) = 𝑓 πœ– π‘˜ π‘˜ ( 𝑑 , 𝑒 ) . Then 𝑓 π‘˜ ( 𝑑 , β‹… ) ∈ β„‚ ∞ ( ℝ 𝑑 ; ℝ 𝑑 ) , for all 𝑑 ∈ [ 𝜏 , 𝑇 ] , π‘˜ β‰₯ 1 .

For further arguments we need the following technical result [16, Lemma 2].

Lemma 2.6. Let 𝑓 satisfy (2.2). For all π‘˜ β‰₯ 1 , the following statements hold: s u p 𝑑 ∈ [ 𝜏 , 𝑇 ] s u p | 𝑒 | ≀ 𝐴 | | 𝑓 π‘˜ | | ( 𝑑 , 𝑒 ) βˆ’ 𝑓 ( 𝑑 , 𝑒 ) β†’ 0 , a s π‘˜ β†’ ∞ , βˆ€ 𝐴 > 0 , ( 2 . 2 4 ) 𝑑  𝑖 = 1 | | 𝑓 π‘˜ 𝑖 | | ( 𝑑 , 𝑒 ) 𝑝 𝑖 / ( 𝑝 𝑖 βˆ’ 1 ) ≀ 𝐷 1  1 + 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 ξƒͺ , ξ€· 𝑓 π‘˜ ξ€Έ ( 𝑑 , 𝑒 ) , 𝑒 β‰₯ 𝛾 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 βˆ’ 𝐷 2 , ξ€· 𝑓 ( 2 . 2 5 ) π‘˜ 𝑒 ξ€Έ ( 𝑑 , 𝑒 ) 𝑀 , 𝑀 β‰₯ βˆ’ 𝐷 3 ( π‘˜ ) | 𝑀 | 2 , βˆ€ 𝑒 , 𝑀 , ( 2 . 2 6 ) where 𝐷 3 ( π‘˜ ) is a nonnegative number, and the positive constants 𝐷 1 , 𝐷 2 β‰₯ 𝐢 2 , 𝛾 do not depend on π‘˜ .

Consider first the scalar case.

Theorem 2.7. Let 𝑑 = 1 . Assume that 𝑓 𝑗 , β„Ž 𝑗 satisfy (2.2) and (2.10). If 𝑒 1 𝜏 ≀ 𝑒 2 𝜏 , there exist two solutions 𝑒 1 , 𝑒 2 (of (2.8) and (2.9), resp.) such that 𝑒 1 ( 𝑑 ) ≀ 𝑒 2 ( 𝑑 ) for all 𝑑 ∈ [ 𝜏 , 𝑇 ] .

Proof. For the functions 𝑓 𝑗 we take the approximations 𝑓 π‘˜ 𝑗 (defined in Lemma 2.6), which satisfy (2.24)–(2.26), and consider the problems πœ• 𝑒 πœ• 𝑑 βˆ’ π‘Ž Ξ” 𝑒 + 𝑓 π‘˜ 𝑗 ( 𝑑 , 𝑒 ) = β„Ž 𝑗 ( 𝑑 , π‘₯ ) , ( 𝑑 , π‘₯ ) ∈ ( 𝜏 , 𝑇 ) Γ— Ξ© , 𝑒 | π‘₯ ∈ πœ• Ξ© 𝑒 | = 0 , 𝑑 = 𝜏 = 𝑒 𝜏 , ( 2 . 2 7 ) for 𝑗 = 1 , 2 . Problem (2.27) has a unique solution for any initial data 𝑒 𝜏 ∈ 𝐻 . In view of Lemma 2.1, the constant 𝑝 is the same for 𝑓 1 and 𝑓 2 . We note that 𝑓 1 π‘˜ ( 𝑑 , 𝑒 ) = πœ“ π‘˜ ( | 𝑒 | ) 𝑓 1 ξ€· ( 𝑑 , 𝑒 ) + 1 βˆ’ πœ“ π‘˜ ξ€Έ ( | 𝑒 | ) | 𝑒 | 𝑝 βˆ’ 2 𝑒 β‰₯ πœ“ π‘˜ ( | 𝑒 | ) 𝑓 2 ξ€· ( 𝑑 , 𝑒 ) + 1 βˆ’ πœ“ π‘˜ ξ€Έ ( | 𝑒 | ) | 𝑒 | 𝑝 βˆ’ 2 𝑒 = 𝑓 2 π‘˜ ( 𝑑 , 𝑒 ) . ( 2 . 2 8 ) Then, it is clear that 𝑓 π‘˜ 1 ( 𝑑 , 𝑒 ) β‰₯ 𝑓 π‘˜ 2 ( 𝑑 , 𝑒 ) for every ( 𝑑 , 𝑒 ) .
By Theorem 2.2 we know that as 𝑒 1 𝜏 ≀ 𝑒 2 𝜏 , we have 𝑒 π‘˜ 1 ( 𝑑 ) ≀ 𝑒 π‘˜ 2 ( 𝑑 ) , for all 𝑑 ∈ [ 𝜏 , 𝑇 ] , for the corresponding solutions of (2.27).
In view of Lemma 2.6, one can obtain in a standard way that (2.13) is satisfied for the solutions of (2.27) with a constant 𝐢 not depending on π‘˜ and replacing 𝛼 by 𝛾 . Hence, the sequences 𝑒 π‘˜ 𝑗 ( β‹… ) are bounded in 𝐿 ∞ ( 𝜏 , 𝑇 ; 𝐻 ) ∩ 𝐿 2 ( 𝜏 , 𝑇 ; 𝑉 ) ∩ 𝐿 𝑝 ( 𝜏 , 𝑇 ; 𝐿 𝑝 ( Ξ© ) ) . It follows from (2.25) that 𝑓 𝑗 π‘˜ ( β‹… , 𝑒 π‘˜ 𝑗 ( β‹… ) ) are bounded in 𝐿 π‘ž ( 𝜏 , 𝑇 ; 𝐿 π‘ž ( Ξ© ) ) and also that { ( 𝑑 𝑒 π‘˜ / 𝑑 𝑑 ) ( β‹… ) } is bounded in 𝐿 π‘ž ( 𝜏 , 𝑇 ; 𝐻 βˆ’ π‘Ÿ ( Ξ© ) ) , where π‘Ÿ 𝑖 = m a x { 1 ; ( 1 / 2 βˆ’ 1 / 𝑝 𝑖 ) 𝑁 } . By the Compactness Lemma [18], we have that for some functions 𝑒 𝑗 = 𝑒 𝑗 ( 𝑑 , π‘₯ ) , 𝑗 = 1 , 2 : 𝑒 π‘˜ 𝑗 β†’ 𝑒 𝑗 w e a k l y s t a r i n 𝐿 ∞ 𝑒 ( 𝜏 , 𝑇 ; 𝐻 ) , ( 2 . 2 9 ) π‘˜ 𝑗 β†’ 𝑒 𝑗 i n 𝐿 2 ( 𝜏 , 𝑇 ; 𝐻 ) , 𝑒 π‘˜ 𝑗 ( 𝑑 ) β†’ 𝑒 𝑗 𝑒 ( 𝑑 ) i n 𝐻 f o r a . a . 𝑑 ∈ ( 𝜏 , 𝑇 ) , ( 2 . 3 0 ) π‘˜ 𝑗 ( 𝑑 , π‘₯ ) β†’ 𝑒 𝑗 𝑒 ( 𝑑 , π‘₯ ) f o r a . a . ( 𝑑 , π‘₯ ) ∈ ( 𝜏 , 𝑇 ) Γ— Ξ© , ( 2 . 3 1 ) π‘˜ 𝑗 β†’ 𝑒 𝑗 w e a k l y i n 𝐿 2 ( 𝜏 , 𝑇 ; 𝑉 ) , ( 2 . 3 2 ) 𝑑 𝑒 π‘˜ 𝑗 β†’ 𝑑 𝑑 𝑑 𝑒 𝑗 𝑑 𝑑 w e a k l y i n 𝐿 π‘ž ( 𝜏 , 𝑇 ; 𝐻 βˆ’ π‘Ÿ 𝑒 ( Ξ© ) ) , ( 2 . 3 3 ) π‘˜ 𝑗 β†’ 𝑒 𝑗 w e a k l y i n 𝐿 𝑝 ( 𝜏 , 𝑇 ; 𝐿 𝑝 ( Ξ© ) ) . ( 2 . 3 4 ) Also, arguing as in [19, page 3037] we obtain 𝑒 π‘˜ 𝑗 ( 𝑑 ) β†’ 𝑒 𝑗 [ ] . ( 𝑑 ) w e a k l y i n 𝐻 βˆ€ 𝑑 ∈ 𝜏 , 𝑇 ( 2 . 3 5 ) Moreover, by (2.24) and (2.31) we have 𝑓 𝑗 π‘˜ ( 𝑑 , 𝑒 π‘˜ ( 𝑑 , π‘₯ ) ) β†’ 𝑓 𝑗 ( 𝑑 , 𝑒 ( 𝑑 , π‘₯ ) ) for a.a. ( 𝑑 , π‘₯ ) ∈ ( 𝜏 , 𝑇 ) Γ— Ξ© and then the boundedness of 𝑓 𝑗 π‘˜ ( β‹… , 𝑒 π‘˜ 𝑗 ( β‹… ) ) in 𝐿 π‘ž ( 𝜏 , 𝑇 ; 𝐿 π‘ž ( Ξ© ) ) implies that 𝑓 𝑗 π‘˜ ( β‹… , 𝑒 π‘˜ 𝑗 ( β‹… ) ) converges to 𝑓 ( β‹… , 𝑒 ( β‹… ) ) weakly in 𝐿 π‘ž ( 𝜏 , 𝑇 ; 𝐿 π‘ž ( Ξ© ) ) [18]. It follows that 𝑒 1 ( β‹… ) , 𝑒 2 ( β‹… ) are weak solutions of (2.8) and (2.9), respectively, with 𝑒 1 ( 𝜏 ) = 𝑒 1 𝜏 , 𝑒 2 ( 𝜏 ) = 𝑒 2 𝜏 .
Moreover, one can prove that 𝑒 π‘˜ 𝑗 ( 𝑑 ) β†’ 𝑒 𝑗 [ ] . ( 𝑑 ) s t r o n g l y i n 𝐻 βˆ€ 𝑑 ∈ 𝜏 , 𝑇 ( 2 . 3 6 ) Indeed, we define the functions 𝐽 𝑗 π‘˜ ( 𝑑 ) = β€– 𝑒 π‘˜ 𝑗 ( 𝑑 ) β€– 2 ∫ βˆ’ 𝐢 𝑑 𝜏 ( β€– β„Ž 𝑗 ( 𝑠 ) β€– 2 + 1 ) 𝑑 𝑠 , 𝐽 𝑗 ( 𝑑 ) = β€– 𝑒 𝑗 ( 𝑑 ) β€– 2 ∫ βˆ’ 𝐢 𝑑 𝜏 ( β€– β„Ž 𝑗 ( 𝑠 ) β€– 2 + 1 ) 𝑑 𝑠 , which are nonincreasing in view of (2.13). Also, from (2.30) we have 𝐽 𝑗 π‘˜ ( 𝑑 ) β†’ 𝐽 𝑗 ( 𝑑 ) for a.a. 𝑑 ∈ ( 𝜏 , 𝑇 ) . Then one can prove that l i m s u p π‘˜ β†’ ∞ 𝐽 𝑗 π‘˜ ( 𝑑 ) ≀ 𝐽 𝑗 ( 𝑑 ) for all 𝑑 ∈ [ 𝜏 , 𝑇 ] (see [15, page 623] for the details). Hence, l i m s u p π‘˜ β†’ ∞ β€– 𝑒 π‘˜ 𝑗 ( 𝑑 ) β€– ≀ β€– 𝑒 𝑗 ( 𝑑 ) β€– . Together with (2.35) this implies (2.36) (see again [15, page 623] for more details).
Hence, passing to the limit we obtain 𝑒 1 ( 𝑑 ) ≀ 𝑒 2 [ ] . ( 𝑑 ) , βˆ€ 𝑑 ∈ 𝜏 , 𝑇 ( 2 . 3 7 )

Further, let us prove the general case for an arbitrary 𝑑 ∈ β„• .

Theorem 2.8. Assume that 𝑓 𝑗 , β„Ž 𝑗 satisfy (2.2) and (2.10). Also, suppose that either 𝑓 1 or 𝑓 2 satisfies (2.7) for an arbitrary 𝑅 0 > 0 . If 𝑒 1 𝜏 ≀ 𝑒 2 𝜏 , there exist two solutions 𝑒 1 , 𝑒 2 (of (2.8) and (2.9), resp.) such that 𝑒 1 ( 𝑑 ) ≀ 𝑒 2 ( 𝑑 ) , for all 𝑑 ∈ [ 𝜏 , 𝑇 ] .

Proof. Let 𝑓 1 be the function which satisfies (2.7). We take the approximations 𝑓 π‘˜ 1 , 𝑓 π‘˜ 2 (defined in Lemma 2.6), which satisfy (2.24)–(2.26). Then, we consider problems (2.27).
In view of Lemma 2.1, the constants 𝑝 𝑖 are the same for 𝑓 1 and 𝑓 2 . We note that 𝑓 𝑖 1 π‘˜ ( 𝑑 , 𝑒 ) = πœ“ π‘˜ ( | 𝑒 | ) 𝑓 𝑖 1 ξ€· ( 𝑑 , 𝑒 ) + 1 βˆ’ πœ“ π‘˜ ξ€Έ | | 𝑒 ( | 𝑒 | ) 𝑖 | | 𝑝 𝑖 βˆ’ 2 𝑒 𝑖 β‰₯ πœ“ π‘˜ ( | 𝑒 | ) 𝑓 𝑖 2 ξ€· ( 𝑑 , 𝑒 ) + 1 βˆ’ πœ“ π‘˜ ξ€Έ | | 𝑒 ( | 𝑒 | ) 𝑖 | | 𝑝 𝑖 βˆ’ 2 𝑒 𝑖 = 𝑓 𝑖 2 π‘˜ ( 𝑑 , 𝑒 ) . ( 2 . 3 8 ) Then, it is clear that 𝑓 π‘˜ 1 ( 𝑑 , 𝑒 ) β‰₯ 𝑓 π‘˜ 2 ( 𝑑 , 𝑒 ) for every ( 𝑑 , 𝑒 ) .
Using Lemma 2.6 it is standard to obtain estimate (2.14) with a constant 𝐢 not depending on π‘˜ . Hence, the solutions 𝑒 π‘˜ 𝑗 ( β‹… ) of (2.27) satisfy β€– β€– 𝑒 π‘˜ 𝑗 β€– β€– ( 𝑑 ) 2 ≀ β€– β€– 𝑒 𝑗 𝜏 β€– β€– 2 ξ€œ + 𝐢 𝑇 𝜏 ξ‚€ β€– β€– β„Ž 𝑗 β€– β€– ( π‘Ÿ ) 2  + 1 𝑑 π‘Ÿ = 𝐾 2 ξ€· β€– β€– 𝑒 𝑗 𝜏 β€– β€– ξ€Έ . , 𝜏 , 𝑇 ( 2 . 3 9 ) We note that 𝑓 1 π‘˜ ( 𝑑 , 𝑒 ) = 𝑓 1 ( 𝑑 , 𝑒 ) , ( 2 . 4 0 ) if | 𝑒 | ≀ π‘˜ , since in such a case πœ“ π‘˜ ( | 𝑒 | ) = 1 . Hence, if π‘˜ 2 β‰₯ 2 m a x { 𝐾 2 ( β€– 𝑒 1 𝜏 β€– , 𝜏 , 𝑇 ) , 𝐾 2 ( β€– 𝑒 2 𝜏 β€– , 𝜏 , 𝑇 ) } , the functions 𝑓 1 π‘˜ satisfy condition (2.7) with 𝑅 0 = π‘˜ . Therefore, for any 𝑑 ∈ [ 𝜏 , 𝑇 ] and any 𝑒 , 𝑣 ∈ ℝ 𝑑 such that 𝑒 𝑖 = 𝑣 𝑖 and 𝑒 𝑗 ≀ 𝑣 𝑗 if 𝑗 β‰  𝑖 , and | 𝑒 | , | 𝑣 | ≀ π‘˜ βˆ’ 1 , we have 𝑓 π‘˜ 1 ( ξ€œ 𝑑 , 𝑒 ) = ℝ 𝑑 𝜌 πœ– π‘˜ ( 𝑠 ) 𝑓 1 π‘˜ ( ξ€œ 𝑑 , 𝑒 βˆ’ 𝑠 ) 𝑑 𝑠 β‰₯ ℝ 𝑑 𝜌 πœ– π‘˜ ( 𝑠 ) 𝑓 1 π‘˜ ( 𝑑 , 𝑣 βˆ’ 𝑠 ) 𝑑 𝑠 = 𝑓 π‘˜ 2 ( 𝑑 , 𝑒 ) . ( 2 . 4 1 ) Thus, if ( π‘˜ βˆ’ 1 ) 2 β‰₯ 2 m a x { 𝐾 2 ( β€– 𝑒 1 𝜏 β€– , 𝑇 ) , 𝐾 2 ( β€– 𝑒 2 𝜏 β€– , 𝑇 ) } , the functions 𝑓 π‘˜ 1 satisfy condition (2.7) with 𝑅 0 = π‘˜ βˆ’ 1 .
By Theorem 2.2 we know that as 𝑒 1 𝜏 ≀ 𝑒 2 𝜏 , we have 𝑒 π‘˜ 1 ( 𝑑 ) ≀ 𝑒 π‘˜ 2 ( 𝑑 ) , for all 𝑑 ∈ [ 𝜏 , 𝑇 ] , π‘˜ β‰₯ 1 + ( 2 m a x { 𝐾 2 ( β€– 𝑒 1 𝜏 β€– , 𝑇 ) , 𝐾 2 ( β€– 𝑒 2 𝜏 β€– , 𝑇 ) } ) 1 / 2 , for the corresponding solutions of (2.27).
Repeating the same proof of Theorem 2.7, we obtain that the sequences 𝑒 π‘˜ 1 , 𝑒 π‘˜ 2 converge (up to a subsequence) in the sense of (2.29)–(2.36) to the solutions 𝑒 1 , 𝑒 2 of problems (2.8) and (2.9), respectively. Also, it holds 𝑒 1 ( 𝑑 ) ≀ 𝑒 2 [ ] . ( 𝑑 ) , βˆ€ 𝑑 ∈ 𝜏 , 𝑇 ( 2 . 4 2 )

In the applications we need to generalize this theorem to the case where the constant 𝛼 can be negative. We shall do this when 𝑓 1 , 𝑓 2 have sublinear growth (i.e., 𝑝 𝑖 = 2 for all 𝑖 ). Consider for (2.1) the following conditions: | | | | 𝑓 ( 𝑑 , 𝑒 ) ≀ 𝐢 1 ( 1 + | 𝑒 | ) , ( 𝑓 ( 𝑑 , 𝑒 ) , 𝑒 ) β‰₯ 𝛼 | 𝑒 | 2 βˆ’ 𝐢 2 , ( 2 . 4 3 ) where 𝛼 ∈ ℝ , and 𝐢 1 , 𝐢 2 > 0 .

Let 𝑓 1 , 𝑓 2 satisfy (2.43) with constants 𝛼 𝑗 , 𝐢 𝑗 1 , 𝐢 𝑗 2 , 𝑗 = 1 , 2 . Then if m i n { 𝛼 1 , 𝛼 2 } ≀ 0 , we make in (2.1) the change of variable 𝑣 = 𝑒 βˆ’ 𝛽 𝑑 𝑒 , where 𝛽 > βˆ’ m i n { 𝛼 1 , 𝛼 2 } . Hence, multiplying (2.8) and (2.9) by 𝑒 βˆ’ 𝛽 𝑑 we have πœ• 𝑣 πœ• 𝑑 βˆ’ π‘Ž Ξ” 𝑣 + 𝑒 βˆ’ 𝛽 𝑑 𝑓 1 ξ€· 𝑑 , 𝑒 𝛽 𝑑 𝑣 ξ€Έ + 𝛽 𝑣 = 𝑒 βˆ’ 𝛽 𝑑 β„Ž 1 ( 𝑑 , π‘₯ ) , ( 𝑑 , π‘₯ ) ∈ ( 𝜏 , 𝑇 ) Γ— Ξ© , 𝑣 | π‘₯ ∈ πœ• Ξ© = 0 , 𝑣 | 𝑑 = 𝜏 = 𝑒 βˆ’ 𝛽 𝜏 𝑒 𝜏 ( π‘₯ ) , ( 2 . 4 4 ) πœ• 𝑣 πœ• 𝑑 βˆ’ π‘Ž Ξ” 𝑣 + 𝑒 βˆ’ 𝛽 𝑑 𝑓 2 ξ€· 𝑑 , 𝑒 𝛽 𝑑 𝑣 ξ€Έ + 𝛽 𝑣 = 𝑒 βˆ’ 𝛽 𝑑 β„Ž 2 ( 𝑑 , π‘₯ ) , ( 𝑑 , π‘₯ ) ∈ ( 𝜏 , 𝑇 ) Γ— Ξ© , 𝑣 | π‘₯ ∈ πœ• Ξ© = 0 , 𝑣 | 𝑑 = 𝜏 = 𝑒 βˆ’ 𝛽 𝜏 𝑒 𝜏 ( π‘₯ ) . ( 2 . 4 5 )

It is easy to check that if 𝑣 ( 𝑑 ) is a weak solution of (2.44), then 𝑒 ( 𝑑 ) = 𝑒 𝛽 𝑑 𝑣 ( 𝑑 ) is a weak solution of (2.8) (and the same is true, of course, for (2.45) and (2.9)). Conversely, if 𝑒 ( 𝑑 ) is a weak solution of (2.8), then 𝑣 ( 𝑑 ) = 𝑒 βˆ’ 𝛽 𝑑 𝑒 ( 𝑑 ) is a weak solution of (2.44).

The functions  𝑓 𝑗 ( 𝑑 , 𝑣 ) = 𝑒 βˆ’ 𝛽 𝑑 𝑓 𝑗 ( 𝑑 , 𝑒 𝛽 𝑑 𝑣 ) + 𝛽 𝑣 satisfy (2.2) with 𝑝 𝑖 = 2 for all 𝑖 . Indeed, | |  𝑓 𝑗 | | ( 𝑑 , 𝑣 ) ≀ 𝑒 βˆ’ 𝛽 𝑑 𝐢 𝑗 1 ξ€· 1 + 𝑒 𝛽 𝑑 ξ€Έ  𝐢 | 𝑣 | + 𝛽 | 𝑣 | ≀ 𝑗 1 ξ‚€  𝑓 ( 1 + | 𝑣 | ) , 𝑗  ( 𝑑 , 𝑣 ) , 𝑣 β‰₯ 𝑒 βˆ’ 2 𝛽 𝑑 ξ€· 𝑓 𝑗 ξ€· 𝑑 , 𝑒 𝛽 𝑑 𝑣 ξ€Έ , 𝑒 𝛽 𝑑 𝑣 ξ€Έ + 𝛽 | 𝑣 | 2 β‰₯ ξ€· 𝛼 𝑗 ξ€Έ + 𝛽 | 𝑣 | 2 βˆ’ 𝐢 𝑗 2 , ( 2 . 4 6 ) where 𝛼 𝑗 + 𝛽 > 0 .

Then, we obtain the following.

Theorem 2.9. Assume that 𝑓 𝑗 , β„Ž 𝑗 satisfy (2.43) and (2.10). Also, suppose that either 𝑓 1 or 𝑓 2 satisfies (2.7) for an arbitrary 𝑅 0 > 0 . If 𝑒 1 𝜏 ≀ 𝑒 2 𝜏 , there exist two solutions 𝑒 1 , 𝑒 2 (of (2.8) and (2.9), resp.) such that 𝑒 1 ( 𝑑 ) ≀ 𝑒 2 ( 𝑑 ) , for all 𝑑 ∈ [ 𝜏 , 𝑇 ] .

Proof. We consider problems (2.44) and (2.45). In view of (2.46)  𝑓 𝑗 ( 𝑑 , 𝑣 ) = 𝑒 βˆ’ 𝛽 𝑑 𝑓 𝑗 ( 𝑑 , 𝑒 𝛽 𝑑 𝑣 ) + 𝛽 𝑣 satisfy (2.2). Also, defining  β„Ž 𝑗 ( 𝑑 , π‘₯ ) = 𝑒 βˆ’ 𝛽 𝑑 β„Ž 𝑗 ( 𝑑 , π‘₯ ) it is clear that (2.10) holds. Finally, if, for example, 𝑓 1 satisfies (2.7) for any 𝑅 0 > 0 , then it is obvious that for  𝑓 1 is true as well.
Hence, by Theorem 2.8 there exist two solutions 𝑣 1 , 𝑣 2 (of (2.44) and (2.45), resp.), with 𝑣 𝑗 ( 𝜏 ) = 𝑒 βˆ’ 𝛽 𝜏 𝑒 𝑗 𝜏 such that 𝑣 1 ( 𝑑 ) ≀ 𝑣 2 ( 𝑑 ) for all 𝑑 ∈ [ 𝜏 , 𝑇 ] . Thus 𝑒 1 ( 𝑑 ) = 𝑒 𝛽 𝑑 𝑣 1 ( 𝑑 ) ≀ 𝑒 𝛽 𝑑 𝑣 2 ( 𝑑 ) = 𝑒 2 [ ] , ( 𝑑 ) , f o r 𝑑 ∈ 𝜏 , 𝑇 ( 2 . 4 7 ) and 𝑒 1 , 𝑒 2 are solutions of (2.8) and (2.9), respectively such that 𝑒 𝑗 ( 𝜏 ) = 𝑒 𝑗 𝜏 .

Remark 2.10. If 𝑓 𝑗 satisfy (2.6), then the solutions 𝑒 1 , 𝑒 2 given in Theorem 2.9 are unique for the corresponding initial data.

3. Comparison for Positive Solutions

Denote ℝ 𝑑 + = { 𝑒 ∈ ℝ 𝑑 ∢ 𝑒 𝑖 β‰₯ 0 } . Let us consider the previous results in the case where the solutions have to be positive. Consider now the following conditions. β„Ž T h e m a t r i x π‘Ž i s d i a g o n a l , ( 3 . 1 ) 𝑖 ( 𝑑 , π‘₯ ) βˆ’ 𝑓 𝑖 ξ€· 𝑑 , 𝑒 1 , … , 𝑒 𝑖 βˆ’ 1 , 0 , 𝑒 𝑖 + 1 , … , 𝑒 𝑑 ξ€Έ β‰₯ 0 , ( 3 . 2 ) for all 𝑖 , a.e. ( 𝑑 , π‘₯ ) ∈ ( 𝜏 , 𝑇 ) Γ— Ξ© and 𝑒 𝑗 β‰₯ 0 if 𝑗 β‰  𝑖 . Obviously, in the scalar case these conditions just mean that β„Ž ( 𝑑 , π‘₯ ) βˆ’ 𝑓 ( 𝑑 , 0 ) β‰₯ 0 , ( 3 . 3 ) for a.e. ( 𝑑 , π‘₯ ) ∈ ( 𝜏 , 𝑇 ) Γ— Ξ© .

It is well known (see [16, Lemma 5] for a detailed proof) that if we assume conditions (2.2) only for 𝑒 ∈ ℝ 𝑑 + , and also (2.6) and (3.1)-(3.2), then for any 𝑒 𝜏 β‰₯ 0 there exists a unique weak solution 𝑒 ( β‹… ) of (2.1). Moreover, 𝑒 ( β‹… ) is such that 𝑒 ( 𝑑 ) β‰₯ 0 for all 𝑑 ∈ [ 𝜏 , 𝑇 ] .

On the other hand, if we assume these conditions except (2.6), then there exists at least one weak solution 𝑒 ( β‹… ) of (2.1) such that 𝑒 ( 𝑑 ) β‰₯ 0 for all 𝑑 ∈ [ 𝜏 , 𝑇 ] [16, Theorem 4]. Moreover, we can prove the following.

Lemma 3.1. Assume conditions (2.2), (2.6) only for 𝑒 ∈ ℝ 𝑑 + , and also (3.1)-(3.2). Then there exists a weak solution 𝑒 ( β‹… ) of (2.1), which is unique in the class of solutions satisfying 𝑒 ( 𝑑 ) β‰₯ 0 for all 𝑑 ∈ [ 𝜏 , 𝑇 ] .

Proof. Let 𝑒 1 , 𝑒 2 be two solutions with 𝑒 𝑖 ( 𝜏 ) = 𝑒 𝜏 , 𝑖 = 1 , 2 such that 𝑒 𝑖 ( 𝑑 ) β‰₯ 0 for all 𝑑 . Denote 𝑀 ( 𝑑 ) = 𝑒 1 ( 𝑑 ) βˆ’ 𝑒 2 ( 𝑑 ) . Then in a standard way by the mean value theorem, we obtain 1 2 𝑑 ( 𝑑 𝑑 β€– 𝑀 𝑑 ) β€– 2 ξ€œ ≀ βˆ’ Ξ© ξ€· 𝑓 ξ€· 𝑑 , 𝑒 1 ( ξ€Έ ξ€· 𝑑 , π‘₯ ) βˆ’ 𝑓 𝑑 , 𝑒 2 ( ξ€Έ ξ€Έ ξ€œ 𝑑 , π‘₯ ) , 𝑀 ( 𝑑 , π‘₯ ) 𝑑 π‘₯ = βˆ’ Ξ© ξ€· 𝑓 𝑒 ξ€· ξ€· 𝑑 , 𝑣 𝑑 , π‘₯ , 𝑒 1 , 𝑒 2 ξ€Έ ξ€Έ ξ€Έ 𝑀 ( 𝑑 , π‘₯ ) , 𝑀 ( 𝑑 , π‘₯ ) 𝑑 π‘₯ ≀ 𝐢 3 ( 𝑑 ) β€– 𝑀 ( 𝑑 ) β€– 2 , ( 3 . 4 ) where 𝑣 ( 𝑑 , π‘₯ , 𝑒 1 , 𝑒 2 ) ∈ 𝐿 ( 𝑒 1 ( 𝑑 , π‘₯ ) , 𝑒 2 ( 𝑑 , π‘₯ ) ) = { 𝛼 𝑒 1 ( 𝑑 , π‘₯ ) + ( 1 βˆ’ 𝛼 ) 𝑒 2 ( 𝑑 , π‘₯ ) ∢ 𝛼 ∈ 0 , 1 ] } so that 𝑣 ( 𝑑 , π‘₯ , 𝑒 1 , 𝑒 2 ) β‰₯ 0 . The uniqueness follows from Gronwall’s lemma

We prove also a result, which is similar to Lemma 2.1. Denote by 𝑝 𝑗 𝑖 , 𝛼 𝑗 , 𝐢 𝑗 1 , and 𝐢 𝑗 2 the constants corresponding to 𝑓 𝑗 in (2.2) for problems (2.8) and (2.9), respectively. Arguing as in the proof of Lemma 2.1 we obtain the following lemma.

Lemma 3.2. If 𝑓 𝑗 satisfy (2.2) and (2.10) for 𝑒 ∈ ℝ + 𝑑 , then 𝑝 1 𝑖 β‰₯ 𝑝 2 𝑖 for all 𝑖 .

Theorem 3.3. Let 𝑓 𝑗 , β„Ž 𝑗 satisfy (2.6) and (3.1)-(3.2). Assume that 𝑓 𝑗 , β„Ž 𝑗 satisfy (2.2) and (2.10) for 𝑒 ∈ ℝ + 𝑑 . If 0 ≀ 𝑒 1 𝜏 ≀ 𝑒 2 𝜏 and one supposes that 𝑓 2 satisfies (2.7) for 𝑒 ∈ ℝ 𝑑 + with 𝑅 2 0 β‰₯ 2 m a x { 𝐾 2 ( β€– 𝑒 1 𝜏 β€– , 𝜏 , 𝑇 ) , 𝐾 2 ( β€– 𝑒 2 𝜏 β€– , 𝜏 , 𝑇 ) } , where 𝐾 ( β€– 𝑒 𝑗 𝜏 β€– , 𝜏 , 𝑇 ) is taken from (2.14), one has 0 ≀ 𝑒 1 ( 𝑑 ) ≀ 𝑒 2 ( 𝑑 ) for all 𝑑 ∈ [ 𝜏 , 𝑇 ] , where 𝑒 1 ( β‹… ) , 𝑒 2 ( β‹… ) are the solutions corresponding to 𝑒 1 𝜏 and 𝑒 2 𝜏 , respectively.

Proof. As the solutions 𝑒 1 ( β‹… ) , 𝑒 2 ( β‹… ) corresponding to 𝑒 1 𝜏 and 𝑒 2 𝜏 are nonnegative, repeating exactly the same steps of the proof of Theorem 2.2 we obtain the desired result.

Remark 3.4. The results remain valid if, instead, 𝑓 1 satisfies (2.7) with the same 𝑅 0 .

Remark 3.5. If 𝑓 2 satisfies (2.7) for an arbitrary 𝑅 0 > 0 (i.e., in the whole space ℝ 𝑑 ), then the result is true for any initial data 0 ≀ 𝑒 1 𝜏 ≀ 𝑒 2 𝜏 .

We shall need also the following modification of Theorem 3.3.

Theorem 3.6. Let 𝑓 𝑗 , β„Ž 𝑗 satisfy (2.6) and (3.1)-(3.2). Assume that 𝑓 𝑗 , β„Ž 𝑗 satisfy (2.2) and (2.10) for 𝑒 ∈ ℝ 𝑑 + . Let 0 ≀ 𝑒 1 𝜏 ≀ 𝑒 2 𝜏 . One supposes that 𝑓 2 satisfies 𝑓 𝑖 2 ( 𝑑 , 𝑒 ) β‰₯ 𝑓 𝑖 2 ( 𝑑 , 𝑣 ) βˆ’ πœ€ , ( 3 . 5 ) for any 𝑑 ∈ [ 𝜏 , 𝑇 ] and any 𝑒 , 𝑣 ∈ ℝ 𝑑 + such that 𝑒 𝑖 = 𝑣 𝑖 and 𝑒 𝑗 ≀ 𝑣 𝑗 if 𝑗 β‰  𝑖 , and | 𝑒 | , | 𝑣 | ≀ 𝑅 0 with 𝑅 2 0 β‰₯ 2 m a x { 𝐾 2 ( β€– 𝑒 1 𝜏 β€– , 𝜏 , 𝑇 ) , 𝐾 2 ( β€– 𝑒 2 𝜏 β€– , 𝜏 , 𝑇 ) } , where 𝐾 ( β€– 𝑒 𝑗 𝜏 β€– , 𝜏 , 𝑇 ) is taken from (2.14).
Then there exists a constant 𝐢 ( 𝜏 , 𝑇 ) such that β€– β€– ξ€· 𝑒 1 ( 𝑑 ) βˆ’ 𝑒 2 ( ξ€Έ 𝑑 ) + β€– β€– [ ] , ≀ 𝐢 ( 𝜏 , 𝑇 ) πœ€ , βˆ€ 𝑑 ∈ 𝜏 , 𝑇 ( 3 . 6 ) where 𝑒 1 ( β‹… ) , 𝑒 2 ( β‹… ) are the solutions corresponding to 𝑒 1 𝜏 and 𝑒 2 𝜏 , respectively.

Proof. Arguing as in the proof of Theorem 2.2 we obtain the inequality 1 2 𝑑 β€– β€– ξ€· 𝑒 𝑑 𝑑 1 βˆ’ 𝑒 2 ξ€Έ + β€– β€– 2 β€– β€– ξ€· 𝑒 + π‘Ž 1 βˆ’ 𝑒 2 ξ€Έ + β€– β€– 2 𝑉 ≀ 𝐢 3 β€– β€– ξ€· 𝑒 ( 𝑑 ) 1 βˆ’ 𝑒 2 ξ€Έ + β€– β€– 2 βˆ’ ξ€œ Ξ© ξ‚€ 𝑓 2 ξ€· 𝑑 , 𝑣 2 ξ€Έ βˆ’ 𝑓 2 ξ€· 𝑑 , 𝑒 2 ξ€Έ , ξ€· 𝑒 1 βˆ’ 𝑒 2 ξ€Έ +  𝑑 π‘₯ , ( 3 . 7 ) where 𝑣 2 is defined in (2.15).
Using (2.17), 𝑣 2 ≀ 𝑒 2 , | 𝑣 2 | 2 ≀ | 𝑒 1 | 2 + | 𝑒 2 | 2 , (2.14), and (3.5), we get 𝑓 𝑖 2 ξ€· 𝑑 , 𝑣 2 ξ€Έ βˆ’ 𝑓 𝑖 2 ξ€· 𝑑 , 𝑒 2 ξ€Έ β‰₯ βˆ’ πœ€ . ( 3 . 8 ) Thus 𝑑 β€– β€– ξ€· 𝑒 𝑑 𝑑 1 βˆ’ 𝑒 2 ξ€Έ + β€– β€– 2 ≀ 2 𝐢 3 ( β€– β€– ξ€· 𝑒 𝑑 ) 1 βˆ’ 𝑒 2 ξ€Έ + β€– β€– 2 ξ€œ + 2 πœ€ Ξ©  𝑖 ∈ 𝐽 ξ€· 𝑒 𝑖 1 βˆ’ 𝑒 𝑖 2 ξ€Έ + ≀ ξ€· 𝑑 π‘₯ 2 𝐢 3 ξ€Έ β€– β€– ξ€· 𝑒 ( 𝑑 ) + 1 1 βˆ’ 𝑒 2 ξ€Έ + β€– β€– 2 + 𝐾 πœ€ 2 , ( 3 . 9 ) for some constant 𝐾 > 0 . By Gronwall’s lemma, we get β€– β€– ξ€· 𝑒 1 ( 𝑑 ) βˆ’ 𝑒 2 ( ξ€Έ 𝑑 ) + β€– β€– 2 ≀ β€– β€– ξ€· 𝑒 1 𝜏 βˆ’ 𝑒 2 𝜏 ξ€Έ + β€– β€– 2 𝑒 ∫ 𝑑 𝜏 ( 2 𝐢 3 ( 𝑠 ) + 1 ) 𝑑 𝑠 + 𝐾 πœ€ 2 ξ€œ 𝑑 𝜏 𝑒 ∫ 𝑑 π‘Ÿ ( 2 𝐢 3 ( 𝑠 ) + 1 ) 𝑑 𝑠 𝑑 π‘Ÿ ≀ 𝐢 2 ( 𝜏 , 𝑇 ) πœ€ 2 . ( 3 . 1 0 )

Let us consider now the multivalued case. We will obtain first some auxiliary statements.

We shall define suitable approximations. For any 𝑛 β‰₯ 1 we put 𝑓 𝑖 𝑛 ( 𝑑 , 𝑒 ) = πœ“ 𝑛 ( | 𝑒 | ) 𝑓 𝑖 ( 𝑑 , 𝑒 ) + ( 1 βˆ’ πœ“ 𝑛 ( | 𝑒 | ) ) 𝑔 𝑖 ( 𝑑 , 𝑒 ) , where 𝑔 𝑖 ( 𝑑 , 𝑒 ) = | 𝑒 𝑖 | 𝑝 𝑖 βˆ’ 2 𝑒 𝑖 + 𝑓 𝑖 ( 𝑑 , 0 , … , 0 ) , and πœ“ 𝑛 was defined in (2.20). Then 𝑓 𝑛 ∈ β„‚ ( [ 𝜏 , 𝑇 ] Γ— ℝ 𝑑 ; ℝ 𝑑 ) and for any 𝐴 > 0 , s u p 𝑑 ∈ [ 𝜏 , 𝑇 ] s u p | 𝑒 | ≀ 𝐴 | | 𝑓 𝑛 | | ( 𝑑 , 𝑒 ) βˆ’ 𝑓 ( 𝑑 , 𝑒 ) β†’ 0 , a s 𝑛 β†’ ∞ . ( 3 . 1 1 ) We will check first that 𝑓 𝑛 satisfy conditions (2.2) for 𝑒 ∈ ℝ 𝑑 + , where the constants do not depend on 𝑛 .

Lemma 3.7. Let 𝑓 satisfy (2.2) for 𝑒 ∈ ℝ 𝑑 + . For all 𝑛 β‰₯ 1 one has 𝑑  𝑖 = 1 | | 𝑓 𝑖 𝑛 | | ( 𝑑 , 𝑒 ) 𝑝 𝑖 / ( 𝑝 𝑖 βˆ’ 1 ) ≀ 𝐷 1  1 + 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 ξƒͺ , ξ€· 𝑓 𝑛 ξ€Έ ( 𝑑 , 𝑒 ) , 𝑒 β‰₯ 𝛾 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 βˆ’ 𝐷 2 , ( 3 . 1 2 ) for 𝑒 ∈ ℝ + 𝑑 , where the positive constants 𝐷 1 , 𝐷 2 , and 𝛾 do not depend on 𝑛 .
If | 𝑒 | > 𝑛 + 1 , then for any 𝑀 ∈ ℝ 𝑑 one has ξ€· 𝑓 𝑛 𝑒 ξ€Έ ( 𝑑 , 𝑒 ) 𝑀 , 𝑀 β‰₯ 0 . ( 3 . 1 3 ) Moreover, if 𝑓 , β„Ž satisfy (3.2), then 𝑓 𝑛 , β„Ž also satisfies this condition.

Proof. In view of (2.2) we get ξ€· 𝑓 𝑛 ξ€Έ ( 𝑑 , 𝑒 ) , 𝑒 = πœ“ 𝑛 ξ€· ( | 𝑒 | ) ( 𝑓 ( 𝑑 , 𝑒 ) , 𝑒 ) + 1 βˆ’ πœ“ 𝑛 ξ€Έ ( | 𝑒 | ) ( 𝑔 ( 𝑒 ) , 𝑒 ) β‰₯ πœ“ 𝑛  𝛼 ( | 𝑒 | ) 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 βˆ’ 𝐢 2 ξƒͺ + ξ€· 1 βˆ’ πœ“ 𝑛 ξ€Έ ( | 𝑒 | ) 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 + ξ€· 1 βˆ’ πœ“ 𝑛 ξ€Έ ( | 𝑒 | ) 𝑑  𝑖 = 1 𝑓 𝑖 ( 𝑑 , 0 , … , 0 ) 𝑒 𝑖 β‰₯ πœ“ 𝑛 ( | 𝑒 | ) 𝛼 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 βˆ’ 𝐢 2 + ξ€· 1 βˆ’ πœ“ 𝑛 ξ€Έ 1 ( | 𝑒 | ) 2 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 βˆ’ 𝐾 1 ξ€· 1 βˆ’ πœ“ 𝑛 ξ€Έ ( | 𝑒 | ) 𝑑  𝑖 = 1 | | 𝑓 𝑖 | | ( 𝑑 , 0 , … , 0 ) 𝑝 𝑖 / ( 𝑝 𝑖 βˆ’ 1 ) β‰₯  𝛼 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 βˆ’ 𝐢 2 βˆ’ 𝐾 1 𝐢 1 , ( 3 . 1 4 ) where  𝛼 = m i n { 1 / 2 , 𝛼 } , for some constant 𝐾 1 > 0 . Also, 𝑑  𝑖 = 1 | | 𝑓 𝑖 𝑛 | | ( 𝑑 , 𝑒 ) 𝑝 𝑖 / ( 𝑝 𝑖 βˆ’ 1 ) ≀ 𝐾 2  𝑑  𝑖 = 1 | | 𝑓 𝑖 | | ( 𝑑 , 𝑒 ) 𝑝 𝑖 / ( 𝑝 𝑖 βˆ’ 1 ) + 𝑑  𝑖 = 1 | | 𝑔 𝑖 | | ( 𝑒 ) 𝑝 𝑖 / ( 𝑝 𝑖 βˆ’ 1 ) ξƒͺ ≀ 𝐾 3  𝐢 1  1 + 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 ξƒͺ + 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 + 𝑑  𝑖 = 1 | | 𝑓 𝑖 | | ( 𝑑 , 0 , … , 0 ) 𝑝 𝑖 / ( 𝑝 𝑖 βˆ’ 1 ) ξƒͺ ≀ 𝐾 4  𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 ξƒͺ , + 1 ( 3 . 1 5 ) for some constant 𝐾 4 > 0 . Thus, for 𝐷 1 = 𝐾 4 , 𝐷 2 = 𝐢 2 + 𝐾 1 𝐢 1 ,  𝛼 = m i n { 1 / 2 , 𝛼 } we have (3.12) for the functions 𝑓 𝑛 .
Moreover, if | 𝑒 | > 𝑛 + 1 , then for any 𝑀 ∈ ℝ 𝑑 , ξ€· 𝑓 𝑛 𝑒 ξ€Έ = ξ€· 𝑔 ( 𝑑 , 𝑒 ) 𝑀 , 𝑀 𝑒 ξ€Έ = ( 𝑑 , 𝑒 ) 𝑀 , 𝑀 𝑑  𝑖 = 1 ξ€· 𝑝 𝑖 ξ€Έ | | 𝑒 βˆ’ 1 𝑖 | | 𝑝 𝑖 βˆ’ 2 𝑀 2 𝑖 β‰₯ 0 . ( 3 . 1 6 )
Finally, if (3.2) is satisfied, then β„Ž 𝑖 ( 𝑑 , π‘₯ ) βˆ’ 𝑓 𝑖 𝑛 ( 𝑑 , 𝑒 ) = πœ“ 𝑛 ξ€· β„Ž ( | 𝑒 | ) 𝑖 ( 𝑑 , π‘₯ ) βˆ’ 𝑓 𝑖 ξ€Έ + ξ€· ( 𝑑 , 𝑒 ) 1 βˆ’ πœ“ 𝑛 β„Ž ( | 𝑒 | ) ξ€Έ ξ€· 𝑖 ( 𝑑 , π‘₯ ) βˆ’ 𝑓 𝑖 ξ€Έ ( 𝑑 , 0 , … , 0 ) β‰₯ 0 , ( 3 . 1 7 ) for all 𝑖 , a.e. ( 𝑑 , π‘₯ ) ∈ ( 𝜏 , 𝑇 ) Γ— Ξ© and 𝑒 such that 𝑒 𝑖 = 0 and 𝑒 𝑗 β‰₯ 0 if 𝑗 β‰  𝑖 .

Let 2 ≀ π‘ž 𝑖 ≀ 𝑝 𝑖 , 𝑖 = 1 , … , 𝑑 . We define also the following approximations  𝑓 𝑖 𝑛 ( 𝑑 , 𝑒 ) = πœ“ 𝑛 ( | 𝑒 | ) 𝑓 𝑖 ( 𝑑 , 𝑒 ) + ( 1 βˆ’ πœ“ 𝑛 ( | 𝑒 | ) ) Μƒ 𝑔 𝑖 ( 𝑑 , 𝑒 ) , where Μƒ 𝑔 𝑖 ( 𝑑 , 𝑒 ) = | 𝑒 𝑖 | 𝑝 𝑖 βˆ’ 2 𝑒 𝑖 + | 𝑒 𝑖 | π‘ž 𝑖 βˆ’ 2 𝑒 𝑖 + 𝑓 𝑖 ( 𝑑 , 0 , … , 0 ) . Then (3.11) holds. We check that  𝑓 𝑛 satisfy conditions (2.2) for 𝑒 ∈ ℝ 𝑑 + , where the constants do not depend on 𝑛 .

Lemma 3.8. Let 𝑓 satisfy (2.2) for 𝑒 ∈ ℝ 𝑑 + . For all 𝑛 β‰₯ 1 one has 𝑑  𝑖 = 1 | | |  𝑓 𝑖 𝑛 | | | ( 𝑑 , 𝑒 ) 𝑝 𝑖 / ( 𝑝 𝑖 βˆ’ 1 ) ≀ 𝐷 1  1 + 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 ξƒͺ , ξ‚€  𝑓 𝑛  ( 𝑑 , 𝑒 ) , 𝑒 β‰₯ 𝛾 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 βˆ’ 𝐷 2 , ( 3 . 1 8 ) for 𝑒 ∈ ℝ + 𝑑 , where the positive constants 𝐷 1 , 𝐷 2 , and 𝛾 do not depend on 𝑛 .
If | 𝑒 | > 𝑛 + 1 , then for any 𝑀 ∈ ℝ 𝑑 one has ξ‚€  𝑓 𝑛 𝑒  ( 𝑑 , 𝑒 ) 𝑀 , 𝑀 β‰₯ 0 . ( 3 . 1 9 )
Moreover, if 𝑓 , β„Ž satisfy (3.2), then  𝑓 𝑛 , β„Ž also satisfy this condition.

Proof . In view of (3.12), we have ξ‚€  𝑓 𝑛  = ξ€· 𝑓 ( 𝑑 , 𝑒 ) , 𝑒 𝑛 ξ€Έ + ξ€· ( 𝑑 , 𝑒 ) , 𝑒 1 βˆ’ πœ“ 𝑛 ξ€Έ ( | 𝑒 | ) 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | π‘ž 𝑖 β‰₯ 𝛾 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 βˆ’ 𝐷 2 , 𝑑  𝑖 = 1 | | |  𝑓 𝑖 𝑛 | | | ( 𝑑 , 𝑒 ) 𝑝 𝑖 / ( 𝑝 𝑖 βˆ’ 1 ) ≀ 𝐾 1  𝑑  𝑖 = 1 | | 𝑓 𝑖 𝑛 | | ( 𝑑 , 𝑒 ) 𝑝 𝑖 / ( 𝑝 𝑖 βˆ’ 1 ) + 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 ( π‘ž 𝑖 βˆ’ 1 ) / ( 𝑝 𝑖 βˆ’ 1 ) ξƒͺ ≀ 𝐾 1  𝐷 1  1 + 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 ξƒͺ + 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | π‘ž 𝑖 ξƒͺ ≀ 𝐾 2  1 + 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 ξƒͺ , ( 3 . 2 0 ) where we have used that 𝑝 𝑖 β‰₯ π‘ž 𝑖 implies 𝑝 𝑖 / ( 𝑝 𝑖 βˆ’ 1 ) ≀ π‘ž 𝑖 / ( π‘ž 𝑖 βˆ’ 1 ) . Finally, (3.19) and condition (3.2) are proved in the same way as in Lemma 3.7.

For every 𝑛 β‰₯ 1 consider the sequence 𝑓 πœ€ 𝑛 ( 𝑑 , 𝑒 ) defined by 𝑓 πœ– 𝑛 ∫ ( 𝑑 , 𝑒 ) = ℝ 𝑑 𝜌 πœ– ( 𝑠 ) 𝑏 𝑛 ( 𝑑 , 𝑒 βˆ’ 𝑠 ) 𝑑 𝑠 , where either 𝑏 𝑛 = 𝑓 𝑛 or 𝑏 𝑛 =  𝑓 𝑛 , defined before. Since any 𝑏 𝑛 are uniformly continuous on [ 𝜏 , 𝑇 ] Γ— [ βˆ’ π‘˜ βˆ’ 1 , π‘˜ + 1 ] , for any π‘˜ β‰₯ 1 , there exist πœ– π‘˜ , 𝑛 ∈ ( 0 , 1 ) such that for all 𝑒 satisfying | 𝑒 | ≀ π‘˜ , and for all 𝑠 for which | 𝑒 βˆ’ 𝑠 | < πœ– π‘˜ , 𝑛 we have s u p 𝑑 ∈ [ 𝜏 , 𝑇 ] | | 𝑏 𝑛 ( 𝑑 , 𝑒 ) βˆ’ 𝑏 𝑛 | | ≀ 1 ( 𝑑 , 𝑠 ) π‘˜ . ( 3 . 2 1 ) We put 𝑓 π‘˜ 𝑛 ( 𝑑 , 𝑒 ) = 𝑓 πœ– π‘˜ , 𝑛 𝑛 ( 𝑑 , 𝑒 ) . Then, 𝑓 π‘˜ 𝑛 ( 𝑑 , β‹… ) ∈ β„‚ ∞ ( ℝ 𝑑 ; ℝ 𝑑 ) for all 𝑑 ∈ [ 𝜏 , 𝑇 ] , π‘˜ , 𝑛 β‰₯ 1 . Since for any compact subset 𝐴 βŠ‚ ℝ 𝑑 and any 𝑛 we have 𝑓 π‘˜ 𝑛 β†’ 𝑏 𝑛 uniformly on [ 𝜏 , 𝑇 ] Γ— 𝐴 , we obtain the existence of a sequence 𝛿 𝑛 π‘˜ ∈ ( 0 , 1 ) such that 𝛿 𝑛 π‘˜ β†’ 0 , as π‘˜ β†’ ∞ , and | 𝑓 𝑛 π‘˜ 𝑖 ( 𝑑 , 𝑒 ) βˆ’ 𝑏 𝑖 𝑛 ( 𝑑 , 𝑒 ) | ≀ 𝛿 𝑛 π‘˜ , for any 𝑖 , 𝑛 and any 𝑒 satisfying | 𝑒 | ≀ 𝑛 + 2 . We define the function 𝐹 π‘˜ 𝑛 = ( 𝐹 𝑛 π‘˜ 1 , … , 𝐹 𝑛 π‘˜ 𝑑 ) given by 𝐹 𝑛 π‘˜ 𝑖 ( 𝑑 , 𝑒 ) = 𝑓 𝑛 π‘˜ 𝑖 ( 𝑑 , 𝑒 ) βˆ’ 𝑝 𝛿 𝑛 π‘˜ , ( 3 . 2 2 ) where 𝑝 ∈ β„• .

Lemma 3.9. Let 𝑓 satisfy (2.2) for 𝑒 ∈ ℝ 𝑑 + . For all 𝑛 , π‘˜ β‰₯ 1 we have 𝑑  𝑖 = 1 | | 𝐹 𝑛 π‘˜ 𝑖 | | ( 𝑑 , 𝑒 ) 𝑝 𝑖 / ( 𝑝 𝑖 βˆ’ 1 ) ≀ 𝐷 3  1 + 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 ξƒͺ , ξ€· 𝐹 π‘˜ 𝑛 ξ€Έ ( 𝑑 , 𝑒 ) , 𝑒 β‰₯ 𝜈 𝑑  𝑖 = 1 | | 𝑒 𝑖 | | 𝑝 𝑖 βˆ’ 𝐷 4 , ( 3 . 2 3 ) for 𝑒 ∈ ℝ 𝑑 + , where the positive constants 𝐷 3 , 𝐷 4 , and    𝜈 do not depend neither on 𝑛 nor π‘˜ .
Moreover, if 𝑓 , β„Ž satisfy (3.2), then 𝐹 π‘˜ 𝑛 , β„Ž also satisfy this condition if | 𝑒 | ≀ 𝑛 + 2 .

Proof. Since 𝑓 𝑛 satisfy (3.12) and  𝑓 𝑛 satisfies (3.18), we have 𝑑  𝑖 = 1 | | 𝐹 𝑛 π‘˜ 𝑖 | | ( 𝑑 , 𝑒 ) 𝑝 𝑖 / ( 𝑝 𝑖 βˆ’ 1 ) ≀ 𝑅 1  𝑑  𝑖 = 1 | | 𝑓 𝑛 π‘˜ 𝑖 | | ( 𝑑 , 𝑒 ) 𝑝 𝑖 / ( 𝑝 𝑖 βˆ’ 1 ) ξƒͺ + 1 ≀ 𝑅 1  𝑑  𝑖 = 1  ξ‚΅ ξ€œ ℝ 𝑑 𝜌 πœ– π‘˜ ξ‚Ά ( 𝑠 ) 𝑑 𝑠 1 / ( 𝑝 𝑖 βˆ’ 1 ) ξ€œ ℝ 𝑑 𝜌 πœ– π‘˜ | | 𝑏 ( 𝑠 ) 𝑖 𝑛 | | ( 𝑑 , 𝑒 βˆ’ 𝑠 ) 𝑝 𝑖 / ( 𝑝 𝑖 βˆ’ 1 ) ξƒͺ ξƒͺ 𝑑 𝑠 + 1 ≀ 𝑅 2  𝑑  𝑖 = 1 ξ€œ ℝ 𝑑