<?xml-model href='http://www.tei-c.org/release/xml/tei/custom/schema/relaxng/tei_all.rng' schematypens='http://relaxng.org/ns/structure/1.0'?><TEI xmlns="http://www.tei-c.org/ns/1.0">
	<teiHeader>
		<fileDesc>
			<titleStmt><title level='a'>Asymptotic spreading of interacting species with multiple fronts II: Exponentially decaying initial data</title></titleStmt>
			<publicationStmt>
				<publisher></publisher>
				<date>12/01/2021</date>
			</publicationStmt>
			<sourceDesc>
				<bibl> 
					<idno type="par_id">10335956</idno>
					<idno type="doi">10.1016/j.jde.2021.09.023</idno>
					<title level='j'>Journal of Differential Equations</title>
<idno>0022-0396</idno>
<biblScope unit="volume">303</biblScope>
<biblScope unit="issue">C</biblScope>					

					<author>Shuang Liu</author><author>Qian Liu</author><author>King-Yeung Lam</author>
				</bibl>
			</sourceDesc>
		</fileDesc>
		<profileDesc>
			<abstract><ab><![CDATA[This is part two of our study on the spreading properties of the Lotka-Volterra competition-diffusion systems with a stable coexistence state. We focus on the case when the initial data are exponential decaying. By establishing a comparison principle for Hamilton-Jacobi equations, we are able to apply the Hamilton-Jacobi approach for Fisher-KPP equation due to Freidlin, Evans and Souganidis. As a result, the exact formulas of spreading speeds and their dependence on initial data are derived. Our results indicate that sometimes the spreading speed of the slower species is nonlocally determined. Connections of our results with the traveling profile due to Tang and Fife, as well as the more recent spreading result of Girardin and Lam, will be discussed.]]></ab></abstract>
		</profileDesc>
	</teiHeader>
	<text><body xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink">
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1">Introduction</head><p>For monotone dynamical systems, the pioneering work of Weinberger et al. <ref type="bibr">[55,</ref><ref type="bibr">57]</ref> (see also <ref type="bibr">[43]</ref>) relates the spreading speed of the population to the minimal speed of (monostable) traveling wave solutions. Their result can be applied to the diffusive Lotka-Volterra competition system. Suitably nondimensionalized, the system is given by</p><p>with a, b &#8712; (0, 1). It is clear that (1.1) admits a trivial equilibrium (0, 0), two semi-trivial equilibria (1, 0) and (0, 1), and further a linearly stable equilibrium</p><p>Theorem 1.1 (Lewis et al. <ref type="bibr">[36]</ref>). Let (u, v) be the solution of (1.1) with initial data u(0, x) = &#961; 1 (x), v(0, x) = 1 -&#961; 2 (x),</p><p>where 0 &#8804; &#961; i &lt; 1 (i = 1, 2) are compactly supported functions in R. Then there exists some In this case, we say that u spreads at speed c LLW .</p><p>Remark 1.2. If the initial data (u, v)(0, x) is a compact perturbation of (1, 0), then there exists cLLW &#8712; [2 dr(1 -b), 2 &#8730; dr] such that the species v spreads at speed cLLW .</p><p>It is shown in <ref type="bibr">[38,</ref><ref type="bibr">39]</ref> that the spreading speed c LLW (resp. cLLW ) is identical to the minimum wave speed of traveling wave solution connecting the pair of equilibria (k 1 , k 2 ) and (0, 1) (resp. (1, 0)). It is crucial for the theory that the pair of equilibria forms an ordered pair of equilibria (regarding the comparability of steady states in the theory of monotone semi-flows, see <ref type="bibr">[49]</ref>).</p><p>For the weak competitive diffusive system (1.1), Tang and Fife <ref type="bibr">[50]</ref> proved an additional class of traveling wave solutions connecting the positive equilibrium (k 1 , k 2 ) with the trivial equilibrium (0, 0). In this case, the equilibria (0, 0) and (k 1 , k 2 ) are un-ordered, and hence the existence of traveling wave, due to Tang and Fife <ref type="bibr">[50]</ref>, does not directly follow from the monotone dynamical systems framework due to Weinberger et al. <ref type="bibr">[56,</ref><ref type="bibr">57]</ref> (see also <ref type="bibr">[20,</ref><ref type="bibr">39]</ref>).</p><p>A natural question is whether the speed traveling wave solutions due to Tang and Fife, which connect (k 1 , k 2 ) to (0, 0), determine the spreading speed of the populations in the Cauchy problem <ref type="bibr">(1.1)</ref>, provided the initial data (u 0 , v 0 ) has the same asymptotics at x = &#177;&#8734; as the traveling wave solution? What happens for more general exponentially decaying initial data? Does the two species spread with different speeds?</p><p>In this paper, we continue our investigation in <ref type="bibr">[41]</ref> on the spreading properties of solutions of the Cauchy problem <ref type="bibr">(1.1)</ref>. We are interested in determining the spreading speeds of each of the populations u and v, for the class of initial data (u 0 , v 0 ) satisfying (u 0 , v 0 )(-&#8734;) = (1, 0), (u 0 , v 0 )(&#8734;) = (0, 0) and such that u 0 &#8594; 0 exponentially at &#8734; with rate &#955; u &gt; 0; v 0 &#8594; 0 decays exponentially at &#8734; (resp. -&#8734;) with rate &#955; + v &gt; 0 (resp. &#955; - v &gt; 0). We introduce the Hamilton-Jacobi approach to study the spreading of twointeracting species into an open habitat, and resolve a conjecture by Shigesada <ref type="bibr">[48,</ref><ref type="bibr">Ch. 7]</ref>. Inspired by the pioneering work of Freidlin <ref type="bibr">[22]</ref> and of Evans and Souganidis <ref type="bibr">[17]</ref> on the Fisher-KPP equation, we shall derive, via the thinfront limit, a couple of Hamilton-Jacobi equations for which solutions have to be understood in the viscosity sense. In our previous work <ref type="bibr">[41]</ref>, we considered the Cauchy problem (1.1) endowed with compactly supported initial data, and used the dynamics programming approach to show the uniqueness of the limiting Hamilton-Jacobi equations, and to evaluate the solution by determining the path that minimizes certain action functional. In contrast to our previous paper, we will tackle the Cauchy problem with exponentially decaying initial data using entirely PDE arguments. For this purpose, we establish a general comparison principle for discontinuous viscosity solutions associated with piecewise Lipschitz Hamiltonians, the latter arising naturally in the spreading of multiple species. The proof of the comparison result is based on combining the ideas due to Ishii <ref type="bibr">[33]</ref> and Tourin <ref type="bibr">[51]</ref>. With this comparison principle at our disposal, we are able to obtain large-deviation type estimates of the solutions (u, v) to the Cauchy problem (1.1) by explicit construction of simple piecewise linear superand sub-solutions.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.1">Known results of a single population</head><p>We first recall some classical asymptotic spreading results concerning the single Fisher-KPP equation:</p><p>where d, r are positive constants. If the initial data is a Heaviside function, supported on (-&#8734;, 0], it is shown <ref type="bibr">[3,</ref><ref type="bibr">21,</ref><ref type="bibr">35]</ref> that the population, whose density is given by &#966;(t, x) has the spreading speed c * = 2 dr, i.e., In addition, the spreading speed c * coincides with the minimal speed of the traveling wave solutions to (1.2) in this case. If we broaden the scope of initial data &#966; 0 to include the class of exponentially decaying data, then the asymptotic behavior of the solution to (1.2) is sensitive to the rate of decay of &#966; 0 at x = &#177;&#8734; (see e.g. <ref type="bibr">[30, pp.42]</ref>), which is the leading edge of the front. This is related to the fact that 0 is a saddle for (1.2), see <ref type="bibr">[9,</ref><ref type="bibr">16,</ref><ref type="bibr">34,</ref><ref type="bibr">44,</ref><ref type="bibr">47]</ref>.</p><p>Precisely, denoting &#955; * = r/ d. It is proved <ref type="bibr">[34,</ref><ref type="bibr">44]</ref> that:</p><p>(i) When the initial data &#966; 0 (x) decays faster than exp{-&#955; * x} at x = &#8734;, then the spreading speed c * = 2 dr;</p><p>(ii) When the initial data &#966; 0 (x) is the form of exp{-(&#955; + o( <ref type="formula">1</ref>))x} at x = &#8734; with &#955; &lt; &#955; * , then the population has the spreading speed c(&#955;) = d&#955; + r &#955; which is strictly greater than 2 dr.</p><p>For recent developments in asymptotic spreading of a single population in heterogeneous environments, we refer to <ref type="bibr">[5,</ref><ref type="bibr">7,</ref><ref type="bibr">19]</ref> for the one-dimensional case, and to <ref type="bibr">[6,</ref><ref type="bibr">8,</ref><ref type="bibr">45,</ref><ref type="bibr">56]</ref> for higher-dimensional case.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.2">Known results of multiple populations</head><p>For close to three decades, researchers have been trying to extend these results to reaction-diffusion systems describing two or more interacting populations.</p><p>Motivated by the northward spreading of several tree species into the newly de-glaciated North American continent at the end of the last ice age, Shigesada et al. <ref type="bibr">[48,</ref><ref type="bibr">Ch. 7]</ref> formulated the question of spreading of two or more competing species into an open habitat, i.e., one that is unoccupied by either species. In case of two competing species, it is conjectured that for large time, the solution behaves like stacked traveling fronts, i.e., it exhibits two transition layers moving at two different speeds c 1 &gt; c 2 , connecting three homogeneous equilibrium states (0, 0), E 1 and E 2 . Here E 1 is the semi-trivial equilibrium where the faster species is present, and E 2 is either the other semi-trivial equilibrium or the coexistence equilibrium (if the latter exists). While it is not difficult to see that the spreading speed c 1 of the faster species can be predicted by the underlying single equation (since the slower species is essentially absent at the leading edge of the front), the determination of the second speed remained open over a decade. Lin and Li <ref type="bibr">[40]</ref> first worked on the spreading properties of (1.1) in the weak competition case 0 &lt; a, b &lt; 1 with compactly supported initial condition (u 0 , v 0 ) and obtained estimates for the spreading speed c 2 of the slower species. For the strong competition case a, b &gt; 1, Carr&#232;re <ref type="bibr">[10]</ref> determined both of the spreading speeds, where c 2 is determined by the unique speed of traveling wave solutions connecting the semi-trivial steady state (1, 0) and (0, 1). The predatorprey system was considered by Ducrot et al. <ref type="bibr">[15]</ref>. For cooperative systems with equal diffusion coefficients, the existence of stacked fronts for cooperative systems was also studied by <ref type="bibr">[31]</ref>. In these cases, the spreading speeds of each individual species can be determined locally and is not influenced by the presence of other invasion fronts.</p><p>However, the second speed c 2 can in general be influenced by the first front with speed c 1 , as demonstrated by the work of Holzer and Scheel <ref type="bibr">[29]</ref> which applies in particular to (1.1) for the case a = 0 and b &gt; 0. They showed that the second speed c 2 can be determined by the linear instability of the zero solution of a single equation with space-time inhomogeneous coefficient. For coupled systems, the case 0 &lt; a &lt; 1 &lt; b was treated in a recently appeared paper of Girardin and the third author <ref type="bibr">[26]</ref>. By deriving an explicit formula for c 2 , it is observed that c 2 can sometimes be strictly greater than the minimal speed of traveling wave connecting E 1 and E 2 , and that it depends on the first speed c 1 in a non-increasing manner. The proof in <ref type="bibr">[26]</ref> is based on a delicate construction of (piecewise smooth) super-and sub-solutions for the parabolic system. In our previous paper <ref type="bibr">[41]</ref>, we showed that in the weak competition case 0 &lt; a, b &lt; 1 the formula for c 2 is exactly the same as the one in <ref type="bibr">[26]</ref> but with a novel strategy of proof based on obtaining large deviation estimates via analyzing the Hamilton-Jacobi equations obtained in the thin-front limit. We also mention that coupled parabolic systems were also treated in <ref type="bibr">[18,</ref><ref type="bibr">23]</ref> based on the large deviations approach, but in these papers all components spread with a single spreading speed.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.3">Main results</head><p>In this paper, we study the spreading of two competing species into an open habitat with exponentially decaying (in space) initial data, with attention to how the spreading speeds are influenced by the exponential rates of decay at infinity.</p><p>For a function g : R &#8594; R and &#955; &#8712; R, we say that g(x) &#8764; e -&#955;x at &#8734; if</p><p>Definition for g(x) &#8764; e &#955;x at -&#8734; is similar. We now state our hypothesis for the initial data (u 0 , v 0 ).</p><p>) 2 is strictly positive on R, and there exist positive constants &#952; 0 ,</p><p>where a&#8743;b = min{a, b} for a, b &#8712; R. Here the quantity &#963; 1 (resp. &#963; 2 ) denotes the spreading speed of v (resp. u) in the absence of the competitor <ref type="bibr">[34,</ref><ref type="bibr">44]</ref>. Without loss of generality, we assume &#963; 1 &#8805; &#963; 2 throughout this paper. This amounts to fixing the choice of v to be the faster spreading species.</p><p>Our main result is stated as follows.</p><p>Theorem 1.3. Assume &#963; 1 &gt; &#963; 2 . Let (u, v) be the solution of (1.1) such that the initial data satisfies (H &#955; ). Then there exist c 1 , c 2 , c 3 &#8712; R such that c 3 &lt; 0 &lt; c 2 &lt; c 1 , and for each small &#951; &gt; 0, the following spreading results hold:</p><p>(1.4)</p><p>Precisely, the spreading speeds c 3 &lt; 0 &lt; c 2 &lt; c 1 can be determined as follows:</p><p>where c LLW (resp. cLLW ) is given in Theorem 1.1 (resp. Remark 1.2), and</p><p>with the quantity &#955;nlp being given by</p><p>To visualize the spreading result (1.4) visually, we consider the scaling</p><p>whose asymptotic behaviors can be given in Figure <ref type="figure">1</ref>. Note that while the spreading speed c 1 of the faster species v is entirely determined by &#955; + v (the exponential decay of v 0 at x &#8776; &#8734;), and is unaffected by the slower species u, the corresponding speed c 2 of species u depends upon &#963; 1 and &#955; u (the exponential decay of u 0 at x &#8776; &#8734;). In particular, when &#955; + v &#8805; r d and &#955; u &gt; &#963;1 2 , i.e., v 0 (x) and u 0 (x) decay fast enough, the speeds c 1 and c 2 are the same as that of the case of compactly supported initial data (see <ref type="bibr">[41,</ref><ref type="bibr">Theorem 1.2]</ref>). Remark 1.4. We point out that the speed c 2 in Theorem 1.3 is non-increasing in both &#963; 1 and &#955; u , which follows from the following observations: (i) &#955;nlp given by (1.7) is non-decreasing in both &#963; 1 and &#955; u ;</p><p>This fact makes intuitive sense: (i) a higher &#963; 1 means the region dominated by species v, which is roughly {(t, x) : c 2 t &lt; x &lt; &#963; 1 t}, is larger and thus rendering it more difficult for species u to invade; (ii) a higher &#955; u means there are less population at the front to pull the invasion wave, which also makes it difficult for species u to invade.</p><p>Fix &#963; 1 , &#955; u &gt; 0 and 0 &lt; a &lt; 1, such that &#963; 1 &gt; &#963; 2 holds. We shall see that the quantity &#265;nlp in (1.6) can be equivalently defined by {(t, x) : w 2 (t, x) = 0} = {(t, x) : t &gt; 0 and x &#8804; &#265;nlp t}, where w 2 (t, x) is the unique viscosity solution of the Hamilton-Jacobi equation</p><p>Here &#967; S is the indicator function of the set S &#8712; (0, &#8734;) &#215; R.</p><p>A further point of interest is the involvement of (0, 0) and (k 1 , k 2 ) in coinvasion process of (1.1), which happens only in the weak competition case 0 &lt; a, b &lt; 1. In this case, the equilibrium states (0, 0) and (k 1 , k 2 ) are un-ordered, and hence the existence of traveling wave, due to Tang and Fife <ref type="bibr">[50]</ref>, cannot be established by monotone dynamical systems framework due to Weinberger et al. <ref type="bibr">[57]</ref> (see also <ref type="bibr">[20,</ref><ref type="bibr">39]</ref>). We will see that the invasion front (k 1 , k 2 ) into (0, 0) is indeed realized in (1.1) for initial data with certain values of exponential decay rates &#955; u , &#955; + v at infinity, namely, when &#963; 1 = &#963; 2 .</p><p>Theorem 1.5. Assume &#963; 1 = &#963; 2 . Let (u, v) be the solution of (1.1) such that the initial data satisfies (H &#955; ). Then for each small &#951; &gt; 0, it holds that</p><p>where c 3 = -max{c LLW , &#963; 3 } and that cLLW is given in Remark 1.2.</p><p>For initial data with general exponential decay rates, Theorem 1.3 demonstrates that there are two separate monostable fronts where each of the two species invades with distinct speeds. Moreover, if the parameters of (1.1) changes in such a way that |&#963; 1 -&#963; 2 | &#8594; 0, the distance of the two fronts tends to zero. Therefore, the invasion front of (k 1 , k 2 ) transitioning directly into (0, 0), due to Tang and Fife, is in fact the special case when these two monostable fronts coincide (Theorem 1.5).</p><p>Remark 1.6. As in <ref type="bibr">[17,</ref><ref type="bibr">41]</ref>, our approach can be applied to the spreading problem of competing species in higher dimensions under minor modifications. However, we choose to focus here on the one-dimensional case to keep our exposition simple, and close to the original formulation of the conjecture in <ref type="bibr">[48,</ref><ref type="bibr">Chapter 7]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.4">Outline of main ideas</head><p>To determine c 1 , c 2 , c 3 , we introduce large deviation approach and construct appropriate viscosity super-and sub-solutions for certain Hamilton-Jacobi equations, and then apply the comparison principle (Theorem A.1) to obtain the desired estimations. We outline the main steps leading to the determination of the nonlocally pulled spreading speed c 2 , as stated Theorem 1.3, and remark that c 1 , c 3 can be obtained by a similar even simpler argument as c 2 .</p><p>1. To estimate c 2 from below, we consider the transformation w 2 (t, x) = -log u t , x and show that the half-relaxed limits</p><p>exist, upon establishing uniform bounds in C loc (see <ref type="bibr">Lemma 3.2)</ref>. By constructing viscosity super-solution w 2 , which satisfies {(t, x) : w 2 (t, x) = 0} = {(t, x) : t &gt; 0 and x &#8804; &#265;nlp t}, and using the comparison principle (Theorem A.1), we can show that w * 2 &#8804; w 2 , and thus w 2 &#8594; 0 locally uniformly in {(t, x) : x &lt; &#265;nlp t}. One can then apply the arguments in <ref type="bibr">[17,</ref><ref type="bibr">Section 4]</ref>  The rest of the paper is organized as follows: In Section 2, we give upper estimates c i for i = 1, 2, 3 and c 2 &#8805; c LLW . In Section 3, we give lower estimates of c 1 , c 2 . The approximate asymptotic expressions of u and v are established in Section 4, where we also determine c 2 , c 3 . In Section 5, we discuss the relation of our results with the invasion mode due to Tang and Fife <ref type="bibr">[50]</ref>. In Section 6, we discuss the relation of our result with that of <ref type="bibr">[26]</ref> due to Girardin and the last author. In Section 7, we prove an extension which is associated to the spreading speeds of the three-species competition systems. We conclude the article with the Appendix. Therein we give the comparison principle of Hamilton-Jacobi equation with piecewise Lipschitz continuous Hamiltonian and two other useful lemmas.</p><p>This paper concerns the Cauchy problem of a system of reaction-diffusion equations modeling two competing species. For the spreading of two species into an open habitat, we refer to <ref type="bibr">[37]</ref> for an integro-difference competition model, and to <ref type="bibr">[14]</ref> for a competition model with free-boundaries. See also <ref type="bibr">[27,</ref><ref type="bibr">42,</ref><ref type="bibr">53,</ref><ref type="bibr">54,</ref><ref type="bibr">58]</ref> for other related results in free-boundary problems. We also note that in those works the spreading speeds are always locally determined and thus do not interact.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2">Estimating the maximal and minimal speeds</head><p>The concepts of maximal and minimal spreading speeds are introduced in [28, Definition 1.2] for a single species; see also <ref type="bibr">[24,</ref><ref type="bibr">41]</ref>. In our setting, we define</p><p>where c 1 and c 1 (resp. c 2 and c 2 ) are the maximal and minimal rightward spreading speeds of species v (resp. species u), whereas -c 3 and -c 3 are the maximal and minimal leftward spreading speeds of v, respectively.</p><p>In this section, for initial data satisfying (H &#955; ), we will give some estimates of the maximal and minimal spreading speeds. The main result of this section can be precisely stated as follows.</p><p>Proposition 2.1. Let (u, v) be a solution of (1.1) with initial data satisfying (H &#955; ). Then the spreading speeds defined in (2.1) satisfy</p><p>where &#963; 1 , &#963; 2 , &#963; 3 are defined in (1.3) and c LLW , cLLW are given respectively in Theorem 1.1 and Remark 1.2. Furthermore, we have</p><p>Proof. We will complete the proof in the following order: (1)</p><p>2) holds.</p><p>Step 1. We show assertions (1), ( <ref type="formula">2</ref>) and ( <ref type="formula">3</ref>).</p><p>Observe that for some M &gt; 0 the function</p><p>is a weak super-solution to the single KPP-type equation</p><p>of which u(t, x) is clearly a sub-solution. By choosing the constant M &gt; 0 so large that u 0 (x) &#8804; u(0, x) in R, it follows by comparison that</p><p>This proves c 2 &#8804; &#963; 2 , i.e., assertion (1) holds.</p><p>Similarly, we deduce assertion (2) by comparison with</p><p>To prove assertion (3), let &#7805;(t, x) = v(t, -x), we turn to consider another single KPP-type equation</p><p>Again the scalar comparison principle implies v(t, -x) = &#7805;(t, x) &#8805; v. By the results in <ref type="bibr">[34]</ref> or <ref type="bibr">[44]</ref>, we have</p><p>which means c 3 &#8804; -&#963; 3 .</p><p>Step 2. We show assertions (4) and <ref type="bibr">(5)</ref>.</p><p>Given any non-trivial, compactly supported function &#7805;0 such that 0 &#8804; &#7805;0 &#8804; v 0 . Then</p><p>Let (&#361; LLW , &#7805;LLW ) be the solution to (1.1) with initial value (1, &#7805;0 (x)). Then Theorem 1.1 and Remark 1.2 guarantee the existence of cLLW &#8805; 2 dr(1 -b), such that</p><p>By the comparison principle for (1.1), we have</p><p>This proves c 3 &#8804; -c LLW and thus assertion (4) holds.</p><p>Similarly, we can get show assertion (5), i.e., c 2 &#8805; c LLW . By comparing (u, v) with the solution (u LLW , v LLW ) of (1.1) with initial condition (&#361; 0 , 1), for some compactly supported &#361;0 satisfying 0 &#8804; &#361;0 &#8804; u 0 , and then using Theorem 1.1. In this way, we get</p><p>(2.6)</p><p>Step 3. We show assertion <ref type="bibr">(6)</ref>. In view of (2.5) and (2.6), one can deduce (2.2) from items (a) and (c) of Lemma B.1.</p><p>3 Estimating c 1 and c 2 from below</p><p>We assume &#963; 1 &gt; &#963; 2 throughout this section. In this section, we estimate c 1 and c 2 from below via the large deviation approach and applying Theorem A.1. To this end, we introduce a small parameter via the following scaling</p><p>Under the new scaling, we rewrite the equation of u and v in (1.1) as</p><p>To obtain the asymptotic behaviors of v and u as &#8594; 0, the idea is to consider the WKB ansatz w 1 and w 2 , which are given respectively by</p><p>and satisfy, respectively, the equations</p><p>and</p><p>Proof. We first prove (a) by adapting the arguments from <ref type="bibr">[17,</ref><ref type="bibr">Section 4]</ref>. Let K, K and G be given as above.</p><p>Fix an arbitrary (t 0 , x 0 ) &#8712; K and define the test function</p><p>This yields</p><p>Since w 2 -&#961; attains maximum over K at (t , x ), we have in particular</p><p>Recalling u (t 0 , x 0 ) = e -w 2 (t0,x0) and u (t , x ) = e -w 2 (t ,x ) , we therefore have</p><p>Since this argument is uniform for (t 0 , x 0 ) &#8712; K (depends only on K, K and G), we deduce assertion (a). The proof for (b) is analogous.</p><p>Next, we will pass to the (upper and lower) limits using the half-relaxed limit method, which is due to Barles and Perthame <ref type="bibr">[4]</ref>. Define</p><p>That the above are well defined is due to the following lemma: Lemma 3.2. Let w 1 and w 2 be the solutions to (3.4) and (3.5), respectively. Then there exits some Q &gt; 0, independent of small, such that</p><p>for (t, x) &#8712; [0, &#8734;) &#215; R, where x + = max{x, 0} and x -= max{-x, 0}.</p><p>Proof. We only prove (3.8a) and the estimations (3.8b)-(3.8d) follow from a quite similar argument. Since v &#8804; 1, we have w 1 &#8805; 0 by definition. By (H &#955; ), there exist positive constants C 1 and C 2 such that</p><p>By definition (3.3), we have</p><p>such that</p><p>where the last inequality is due to (3.9). By comparison, (3.10) thus holds. By a similar argument, we can verify</p><p>where Q is defined by <ref type="bibr">(3.11)</ref>. Combining with (3.10) and (3.12) gives the desired upper bound of w 1 .</p><p>To obtain the lower bound of w 1 , we may define functions</p><p>. By the same arguments as before, we can check</p><p>This completes the proof of (3.8a).</p><p>Remark 3.3. According to Lemma 3.2, by letting t = 0 and then &#8594; 0 in (3.8a) and (3.8b), we deduce that</p><p>Similarly, by setting x = 0 and then &#8594; 0 in (3.8c) and (3.8d), we have</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1">Estimating c 1 from below</head><p>By Proposition 2.1, c 2 &#8804; &#963; 2 , so we deduce</p><p>(3.13) Lemma 3.4. Let (u, v) be a solution of (1.1) with initial data satisfying (H &#955; ). Then</p><p>where &#963; 2 is defined by (1.3) and &#955; - v , &#955; + v &#8712; (0, &#8734;) are given in (H &#955; ). Proof. First, observe that w * 1 is upper semicontinuous (usc) by construction. By Remark 3.3, the initial and boundary conditions of (3.14) and (3.15) are satisfied.</p><p>It remains to show that w * 1 is a viscosity sub-solution of min{&#8706; t w +d|&#8706; x w| 2 + r(1 -b&#967; {x&#8804;&#963;2t} ), w} = 0 in the domain (0, &#8734;) &#215; R. According to definition of viscosity sub-solution of Hamilton-Jacobi equation, (see Appendix A), let &#981; &#8712; C &#8734; ((0, &#8734;) &#215; R) and let (t 0 , x 0 ) be a strict local maximum point of w * 1 -&#981; such that w * 1 (t 0 , x 0 ) &gt; 0. By passing to a sequence = k if necessary, w 1 -&#981; has a local maximum point at (t , x ) such that w 1 (t , x ) &#8594; w * 1 (t 0 , x 0 ) and (t , x ) &#8594; (t 0 , x 0 ) uniformly as &#8594; 0. At the point (t , x ), we have</p><p>By the fact that e -w 1 (t ,x )/ &#8594; 0 (as w 1 (t , x ) &#8594; w * 1 (t 0 , x 0 ) &gt; 0), we may pass to the limit = k &#8594; 0 so that</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Hence w *</head><p>1 is a viscosity sub-solution of (3.14) and (3.15).</p><p>Lemma 3.5. Let (u, v) be a solution of (1.1) with initial data satisfying (H &#955; ).</p><p>where &#963; 1 is defined by (1.3).</p><p>Proof. Define the function</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>and by</head><p>Next, we claim that the continuous w 1 is a viscosity super-solution of (3.14). We will check the latter case of &#955; + v &gt; r d as the former case can be verified analogously. Under the condition &#955; + v &gt; r d , we have &#963; 1 = 2 &#8730; dr. According to definition of viscosity super-solution of Hamilton-Jacobi equation (see Appendix A), let &#981; &#8712; C &#8734; ((0, &#8734;) &#215; R) and let (t 0 , x 0 ) be a strict local minimum point of w 1 -&#981;.</p><p>If x 0 /t 0 = 2 &#8730; dr, then w 1 is a classical solution of (3.14). If x 0 /t 0 = 2 &#8730; dr, then w 1 (t 0 , x 0 ) = 0 by definition. Moreover,</p><p>and we must have &#8706; t &#981;(t 0 , x 0 ) + 2 &#8730; dr&#8706; x &#981;(t 0 , x 0 )) = 0, and hence</p><p>where the first equality follows from the fact that x 0 /t 0 = 2 &#8730; dr = &#963; 1 &gt; &#963; 2 . By Remark 3.3 and the expression of w 1 , we have</p><p>And recalling Lemma 3.4(a), w 1 and w * 1 is a pair of viscosity super and subsolutions of <ref type="bibr">(3.14)</ref>. Then, we may apply Theorem A.1 to get</p><p>which implies that</p><p>Letting &#8594; 0, we arrive at</p><p>Hence for each small &#951; &gt; 0, by choosing the compact sets</p><p>, we may apply Lemma 3.1(b) to deduce that</p><p>This implies c 1 &#8805; &#963; 1 .</p><p>Corollary 3.6. Let &#963; 1 &gt; &#963; 2 and let (u, v) be a solution of (1.1) with initial data satisfying (H &#955; ). Then for each small &#951; &gt; 0,</p><p>where &#963; 1 is defined by (1.3). We may then apply Lemma B.1(d) to deduce (3.17b).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Proof</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2">Estimating c 2 from below</head><p>By Corollary 3.6, we have</p><p>(3.18) Lemma 3.7. Let (u, v) be a solution of (1.1) with initial data satisfying (H &#955; ).</p><p>Then, w * 2 is a viscosity sub-solution of</p><p>where &#963; 1 is defined by (1.3) and &#955; u &gt; 0 is given in (H &#955; ).</p><p>Proof. The proof is analogous to Lemma 3.4 and we omit the details. </p><p>It remains to consider cases (a) and (b). We start by defining</p><p>Suppose case (a) holds, then &#265;nlp = cnlp . Define w 2 by </p><p>On the other hand, if x0 t0 = cnlp , then &#8711;&#981;(t 0 , x 0 ) &#8226; (1, cnlp ) = 0, and</p><p>Hence, w 2 is a viscosity super-solution of <ref type="bibr">(3.19)</ref>.</p><p>By Remark 3.3 and the express of w 2 , we have</p><p>And recalling that w * 2 is a viscosity sub-solution of (3.19), we may deduce by Theorem A.1 that</p><p>Now,</p><p>x &#8804; &#265;nlp t}. Hence, w 2 (t, x) = -log u (t, x) &#8594; 0 locally uniformly on {(t, x) : x &lt; &#265;nlp t}.</p><p>Hence for each small &#951; &gt; 0, by choosing the compact sets</p><p>, we may apply Lemma 3.1(a) to get</p><p>which implies c 2 &#8805; &#265;nlp . Finally, for case (b), then we have &#265;nlp = cnlp . We define</p><p>for x t &#8804; cnlp . Then one can verify that w 2 is likewise a viscosity super-solution of (3. <ref type="bibr">19</ref>), so that one can repeat the arguments for case (a) to show, again, that c 2 &#8805; &#265;nlp .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4">Estimating c 2 from above and c 3 from below</head><p>We assume &#963; 1 &gt; &#963; 2 throughout this section. It remains to show c 2 &#8804; max{c LLW , &#265;nlp } and c 3 &#8805; -max{c LLW , &#963; 3 }.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1">Estimating c 2 from above</head><p>For &#948; &#8805; 0, we will construct an exponent &#956;&#948; depending continuously on &#948; such that u(t, (&#963;</p><p>so that we may apply Lemma B.2(a) to estimate c 2 from above.</p><p>Lemma 4.1. Let (u, v) be a solution of (1.1) with initial data satisfying (H &#955; ). Then w 2, * is a viscosity super-solution of</p><p>where &#963; 1 and &#963; 2 are defined in (1.3).</p><p>Proof. It follows from standard arguments as in Lemma 3.4.</p><p>Proposition 4.2. Let (u, v) be a solution of (1.1) with initial data satisfying</p><p>where c LLW and &#265;nlp are defined respectively in Theorem 1.1 and 1.3.</p><p>Proof.</p><p>Step 1. Define w 2 : [0, &#8734;) &#215; R by</p><p>in case &#955; u &gt; 1, and by</p><p>Then it is straightforward to verify that w 2 is a viscosity subsolution of (4.1). Since, w 2, * (0, x) = &#955; u max{x, 0} = w 2 (0, x) in R (by Remark 3.3), we may apply Theorem A.1 to deduce</p><p>Step 2. To show that, for each &#265; &#8805; 0,</p><p>And that w 2 (1, &#963; 1 ) is given by</p><p>and cnlp , cnlp , &#955;nlp are all given in Lemma 3.8. By definition of w 2, * and w 2 (t, x) = -log u (t, x), for each small &gt; 0, by applying Step 1, we have</p><p>which implies (4.4). By the formula of w 2 , we can show (i) For &#963; 1 &lt; 2&#955; u , we substitute (t, x) = (1, &#963; 1 ) in (4.2) to obtain</p><p>where</p><p>(ii) For &#963; 1 &#8805; 2&#955; u , we substitute (t, x) = (1, &#963; 1 ) in (4.2) to obtain</p><p>Recalling the definition of &#955;nlp in (3.20), we have</p><p>Hence, (4.7) becomes</p><p>where cnlp , &#955;nlp are as in <ref type="bibr">(3.20)</ref>.</p><p>This implies (4.5) holds, which completes Step 2.</p><p>Step 3. To show c 2 &#8804; max{c LLW , &#265;nlp }. It follows from Proposition 2.1 and Corollary 3.6 that for &#265; &#8712; (&#963; 2 , &#963; 1 ), lim t&#8594;&#8734; (u, v)(t, 0) = (k 1 , k 2 ) and lim t&#8594;&#8734; (u, v)(t, &#265;t) = (0, 1).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>By</head><p>Step 2 and observation &#955; LLW c LLW = &#955; 2 LLW + 1 -a, then we apply Lemma B.2(a) in Appendix to conclude that for &#265; &#8712; (&#963; 2 , &#963; 1 ),</p><p>Letting &#265; &#963; 1 , (4.10) can be expressed as (denote &#956; = w 2 (1, &#963; 1 )) </p><p>and &#955;nlp is given in Lemma 3.8. Note that</p><p>) By (4.6) and (4.9), &#956; = w 2 (1, &#963; 1 ) can be expressed as</p><p>and &#955; &#956; is as defined in (4.13). Note that G(&#955;) is strictly increasing on [0, &#963;1 2 ]. We note for later purposes that (4.14) is a quadratic equation in &#955; &#956;, so that</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>.15)</head><p>Since &#955; LLW &#8712; (0, &#8730; 1 -a], we divide our discussion into two cases: (i)</p><p>By (4.13), &#955;nlp = &#955; &#956; &lt; &#955; LLW , whence it follows from the observation</p><p>and the monotonicity of s+ 1-a s in (0, &#8730; 1 -a] that &#265;nlp &#8805; c LLW . It remains to show that c &#963;1,&#956; = &#265;nlp . Now, by monotonicity of G, we have</p><p>By (4.11), we have</p><p>. Hence,</p><p>where the first and second equalities follow from (4.15) and (4.14), respectively.</p><p>(ii) Case &#955; LLW &#8804; &#955; &#956;.</p><p>By (4.13),</p><p>It follows from (4.16) that &#265;nlp &#8804; c LLW . It remains to show that &#956; &#8805; G(&#955; LLW ), so that c &#963;1,&#956; = c LLW = max{c LLW , &#265;nlp }. Indeed, one can check that &#955; LLW &#8804; &#955; &#956; &#8804; &#963; 1 /2, and we deduce</p><p>The proof of Proposition 4.2 is now complete.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2">Estimating c 3 from below</head><p>For convenience, let &#361;(t, x) = u(t, -x), &#7805;(t, x) = v(t, -x), and define</p><p>Again we pass to the half-relaxed limit:</p><p>Lemma 4.3. Let (&#361;, &#7805;) be a solution of (1.1) such that x &#8594; (&#361;(0, -x), &#7805;(0, -x)) satisfies (H &#955; ). Then, for each small &#951; &gt; 0,</p><p>Proof. Let v KPP be the solution of</p><p>By choosing C to be sufficiently large, we may apply comparison principle to get 0 &#8804; &#7805; &#8804; v KPP . Therefore, for each &#951; &gt; 0,</p><p>Let u KPP be the solution of</p><p>Again the scalar comparison principle implies u &#8805; u KPP . By the results in <ref type="bibr">[34]</ref> or <ref type="bibr">[44]</ref>, we have, for each small &#951; &gt; 0, </p><p>(4.20)</p><p>Lemma 4.4. Let (&#361;, &#7805;) be a solution of (1.1) such that x &#8594; (&#361;(0, -x), &#7805;(0, -x)) satisfies (H &#955; ). Then, w 3, * is a viscosity super-solution of</p><p>Proof. The proof is similar to proof of Lemma 3.4(b) and is omitted. where cLLW and &#963; 3 are defined in Remark 1.2 and (1.3), respectively.</p><p>Proof.</p><p>Step 1. To show</p><p>where</p><p>As in Step 1 of Proposition 4.2, one can verify that w 3 is a viscosity sub-solution of <ref type="bibr">(4.21)</ref>. By the expression of w 3 , Remark 3.3 and w 1, * (t, -x) = w 3, * (t, x), we have</p><p>Hence we apply Theorem A.1 to obtain <ref type="bibr">(4.22)</ref>.</p><p>Step 2. To show for each &#265; &#8805; 0, we have &#7805;(t, &#265;t) &#8804; exp{(w 3 (1, &#265;) + o(1))t} for t 1.</p><p>(4.23)</p><p>This can be done as in Step 2 of Proposition 4.2.</p><p>Step 3. To show c 3 &#8805; -max{c LLW , &#963; 3 }.  </p><p>We note for later purposes that &#956;2 is a quadratic expression in &#955; - v , so that</p><p>We may then apply Lemma B.2(b) to conclude </p><p>where (4.26) is used for the last inequality.</p><p>(i) For the case &#955; - v &gt; &#955;LLW , we take &#265; &#8594; &#8734; in (4.28) to get &#956;2 &#8805; &#955;LLW (&#265; -cLLW ) , so that by (4.27), -c 3 &#8804; cLLW &#8804; max {c LLW , &#963; 3 };</p><p>. Then</p><p>and &#955; &#265;,&#956;2 &#8804; &#955; - v (by comparing with the second part of (4.26)). Hence, we arrive at</p><p>Next, we claim that</p><p>To this end, subtract the first part of (4.26) from (4.29) to get</p><p>Dividing the above by &#265; and letting &#265; &#8594; &#8734;, we obtain <ref type="bibr">(4.31)</ref>.</p><p>By (4.31), we can take &#265; &#8594; &#8734; in (4.30</p><p>This completes the proof of Proposition 4.5.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.3">Proof of Theorem 1.3</head><p>Proof of Theorem 1. Observe that the first two items of (1.4) is a direct consequence of Corollary 3.6. Next, we shall show that</p><p>Given some small &#951; &gt; 0, definitions of c 3 and c 1 imply the existence of</p><p>Observe that v(t, x) and &#948; form a pair of super-and sub-solutions to the KPPtype equation </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5">The invasion mode due to Tang and Fife</head><p>In this section, we assume &#963; 1 = &#963; 2 and prove Theorem 1.5.</p><p>Proof of Theorem 1.5. For any small &#948; &#8712; (0, 1), let (u &#948; , v &#948; ) and (u &#948; , v &#948; ) be respectively any solution of</p><p>and</p><p>with initial data satisfying (H &#955; ). By comparison, we deduce that</p><p>Notice that (u &#948; , v &#948; ) is a solution of (5.1) if and only if</p><p>where</p><p>enough. By applying Theorem 1.3 to (5.5), we deduce that the rightward and leftward spreading speeds c &#948; 1 and c &#948; 3 of V &#948; (which is the same as v &#948; ), and the rightward spreading speed c &#948; 2 of U &#948; (same as u &#948; ) exist. Furthermore, they can be characterized by</p><p>Precisely, c &#948; LLW (resp. c&#948; LLW ) is the spreading speed for (5.5) as given in Theorem 1.1</p><p>and moreover</p><p>where</p><p>3), we can compare with the spreading speeds c 1 , c 2 and c 3 of (u, v):</p><p>It remains to show that, assuming &#963; 1 = &#963; 2 , we have &#265;&#948; nlp &#8594; &#963; 2 as &#948; &#8594; 0. Divide into the two cases:</p><p>which is due to</p><p>where &#955;nlp is given in (1.7). To this end, observe that</p><p>which is a consequence of</p><p>we deduce (5.9). By (5.8) and (5.9), we have &#963;&#948; 1 &#8805; 2&#955; u and &#955;&#948; nlp &lt; 1 -a &#948; for &#948; small, so</p><p>Since we want &#265;&#948; nlp &#8594; &#963; 2 , it remains to show that &#963; 2 = &#955;nlp + 1-a &#955;nlp . To this end, recall, from the definition of &#955;nlp (1.7), that</p><p>.</p><p>Using</p><p>This implies &#963; 2 = &#955;nlp + 1-a &#955;nlp . The proof is now complete.</p><p>Hence, by the continuity of c &#948; LLW and c&#948; LLW in &#948; (see, e.g. [52, Theorem 4.2 of Ch. 3]), letting &#948; &#8594; 0 in (5.7) yields</p><p>(5.12)</p><p>By a quite similar process, we can obtain (u &#948; , v &#948; ) is a solution of (5.2) if and only if</p><p>where</p><p>By exchanging the roles of u and v in (1.1), we may follow the arguments above, and apply Theorem 1.3 once again to deduce that</p><p>Theorem 1.5 follows from combining c i &#8804; c i , (5.12), <ref type="bibr">(5.14)</ref> and</p><p>6 The case 0 &lt; a &lt; 1 &lt; b due to Girardin and Lam</p><p>The Hamilton-Jacobi approach, which we have so far applied to study the weak competition case (0 &lt; a, b &lt; 1), can also be applied to tackle the case (0 &lt; a &lt; 1 &lt; b), which was previously studied by Girardin and the third author <ref type="bibr">[26]</ref>. This provides an alternative approach which is more transparent than the involved construction of global super-and sub-solutions for the Cauchy problem, as was done in <ref type="bibr">[26]</ref>. By arguing similarly as in Theorem 1.3, one can prove the following result. Theorem 6.1. Assume 0 &lt; a &lt; 1 &lt; b and &#963; 1 &gt; &#963; 2 . Let (u, v) be the solution of (1.1) such that the initial data satisfies (H &#955; ). Then there exist c 1 , c 2 &#8712; (0, &#8734;) such that c 1 &gt; c 2 and, for each small &#951; &gt; 0, the following spreading results hold:</p><p>Precisely, the spreading speeds c 1 and c 2 can be determined as follows:</p><p>where &#963; 1 is defined in (1.3), &#265;LLW denotes the minimal wave speed of (1.1) connecting (1, 0) with (0, 1) and &#265;nlp is given by</p><p>By Theorem 6.1, the spreading speed c 2 is determined by &#963; 1 (i.e., c 1 ) and &#955; u . In what follows, we explore the relation of c 2 and &#963; 1 for fixed &#955; u . Define the following auxiliary functions:</p><p>where &#955;nlp is given by (6.3). It is easily seen that f is decreasing and bijective in</p><p>], while g is decreasing and bijective in</p><p>More precisely, it follows that</p><p>.</p><p>For fixed &#955; u and varied &#955; + v (or &#963; 1 ), by Theorem 6.1 we can rewrite the spreading speed c 2 as follows.</p><p>(a) For g &#8734; &#8804; &#265;LLW , we have the followings:</p><p>for &#963; 1 &#8805; g -1 (&#265; LLW );</p><p>(b) For g &#8734; &gt; &#265;LLW , we have the followings:</p><p>For the case (a) g &#8734; &#8804; &#265;LLW , the relationship between the spreading speeds &#963; 1 and c 2 given by (a1)-(a3) is illustrated in Figure <ref type="figure">2</ref>. Therein we may obtain the exact spreading speeds of (1.1), which are determined entirely by &#955; u , &#955; + v &#8712; (0, &#8734;). Traversing all of &#955; u , the set of admissible speeds &#963; 1 and c 2 agrees with <ref type="bibr">[26,</ref>  , c 2 ) such that (6.4) holds.</p><p>is decreasing in &#955; u . Noting that c &#8712; (f (c), c), we may select the unique</p><p>, c 2 ) such that (6.4) holds;</p><p>). In this case, &#955;nlp &#8712; 0, &#8730; 1 -a and thus g(c</p><p>are also strictly monotone in &#955; u , so that there is the unique &#955; u such that (6.4) holds.</p><p>The proof is now complete. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="7">An extension</head><p>In this section, we consider the following competition system with forcing:</p><p>where lim</p><p>We will make an observation in preparation for our forthcoming work on threespecies competition systems. Recall the definitions of &#963; i (i = 1, 2, 3) from (1.3).</p><p>Theorem 7.1. Let d, r, b &gt; 0, 0 &lt; a &lt; 1 and &#963; 1 &gt; &#963; 2 . Suppose that h(x, t), k(x, t) are non-negative and satisfy (7.2). Let (u, v) be the solution of (7.1) with the initial data satisfying (H &#955; ). Assume</p><p>Then,</p><p>where c i , c i (i = 1, 2) are defined in (2.1). Furthermore, for each small &#951; &gt; 0,</p><p>where &#963; 1 , &#963; 2 are defined in (1.3) and c LLW , &#265;nlp are respectively given in Theorem 1.1 and 1.3.</p><p>Proof. The proof can be mimicked after that of Theorem 1.3.</p><p>Step 1. The estimates c 1 &#8804; &#963; 1 and c 2 &#8804; &#963; 2 can be proved by rather similar arguments as in Proposition 2.1, and the details are omitted here.</p><p>Step 2. We show that for each small &#951; &gt; 0, Here, we just show the first one since the proof of the second one is analogous. For the case of &#955; u &#8805; &#8730; 1 -a, by (7.2) and c 0 &lt; &#963; 2 , the system (7.1) is approximately equal to (1.1) in {(t, x) : x &#8805; Fix any c &#8712; (max{</p><p>It is enough to show that there exist positive constants &#948;, &#955;1 , &#955;2 , T such that &#955;1 &lt; &#955;2 and u(t, x + c t) &#8805; &#948; 4 max e -&#955;1x -e -&#955;2x , 0 for t &#8805; T, x &#8805; 0.</p><p>This implies c 2 &#8805; c for each c &#8712; (max{</p><p>To this end, choose &#948; 1 &gt; 0 small enough so that</p><p>This is possible since c &lt; &#963; 2 and that s &#8594;</p><p>is monotone, so that</p><p>Next, choose T &gt; 0 large so that</p><p>and then choose &#948; &#8712; (0, &#948; 1 ] so that u(T, x) &#8805; &#948; 4 e -&#955;1(x-c T ) for x &#8805; c T,</p><p>where (7.7) follows from (7.2) by noting c &gt; c 0 ; and that (7.8) holds due to u(T, x) &#8764; e -&#955;ux at &#8734; and &#955;1 &gt; &#955; u (see, e.g. [52, Corollary 1 of Ch. 1]). By the choice of &#955;1 &lt; &#955;2 , &#948;, &#948; 1 , T , it follows that u(t, x) := max &#948; 4 e -&#955;1(x-c t) -e -&#955;2(x-c t) , 0 ,</p><p>is a sub-solution of the KPP-type equation</p><p>where &#8486; := {(t, x) : t &#8805; T, x &#8805; c t}.</p><p>For &#948; &#8712; (0, &#948; 1 ] to be specified later, define u(t, x) := max &#948; 4 e -&#955;1(x-c t) -e -&#955;2(x-c t) , 0 ,</p><p>where &#955;1 is given in (7.6) and &#955;2 = 1 2 c + (c ) 2 -4(1 -a -2&#948;) . We will choose T &gt; 0 and &#948; &#8712; (0, &#948; 1 ] so that</p><p>i.e., u and u is a pair of super-and sub-solutions of the KPP-type equation</p><p>where &#8486; := {(t, x) : t &#8805; T, x &#8805; c t}. Hence, by comparison, (7.5) holds.</p><p>To proceed further, as in Section 3, based on the scaling (3.1), we introduce the WKB ansatz w 2 , which is given by w 2 (t, x) = -log u (t, x), satisfying the equation:</p><p>Here h (t, x) = h( t , x ). By Remark 3.3, we also use the half-relaxed limit method and introduce w * 2 and w 2, * . By <ref type="bibr">(7.4)</ref>,</p><p>and u is moreover bounded by 1. We have then, by definitions, that w * 2 (t, (&#963; 2 -&#951;)t) = w 2, * (t, (&#963; 2 -&#951;)t) = 0. (7.13)</p><p>Step 3. We prove c 1 &#8805; &#963; 1 . This follows from (7.4) and definition of c 1 .</p><p>Step 4. We prove c 2 &#8805; &#265;nlp .</p><p>By Step 1 and h &#8805; 0, we have</p><p>In view of &#963; 2 &gt; c 0 , we choose 0 &lt; &#951; 1 such that &#963; 2 -&#951; &gt; c 0 . We then use (7.2) to derive that lim</p><p>Based on (7.13), similar to Lemma 3.4, we can deduce that w * 2 is a viscosity sub-solution of</p><p>We then apply the same arguments developed in Lemmas 3.8 by constructing the same super-solutions, to deduce that c 2 &#8805; &#265;nlp .</p><p>Step 5. We show c 2 &#8804; max{c LLW , &#265;nlp } and (7.3). By (7.2) again, similar to Corollary 3.6, we can get lim inf</p><p>so that we may use (7.13) to deduce that w 2, * is a viscosity super-solution of</p><p>as in Lemma 4.1. Then we can get c 2 &#8804; max{c LLW , &#265;nlp } by the same arguments developed in Proposition 4.2. We finally deduce (7.3) by similar arguments as in the proof of Theorem 1.3, which completes the proof.</p><p>(A4) There exists some M &#8805; 0 such that for each &#955; &#8712; [0, 1) and x 0 &#8712; R N , there exists constants &#175; (&#955;, x 0 ) &gt; 0 and C(&#955;, x 0 ) &gt; 0 such that for all p &#8712; R N ,</p><p>Theorem A.1. Suppose that H satisfies the hypotheses (A1)-(A4). Let w and w be a pair of super-and sub-solutions of (A.1) such that w &#8805; w on &#8706; p &#8486;, then</p><p>where H is convex and coercive in p, and s &#8594; R(s) has bounded variation and satisfies |R(s)| &#8804; M for some M &#8805; 0. Then it is easy to verify that the hypotheses (A1)-(A4) hold. In particular, it applies for all our purposes in this paper.</p><p>Our condition (A3) is a quantitative version of the "local monotonicity condition" that was introduced in <ref type="bibr">[11]</ref>. See <ref type="bibr">[11,</ref><ref type="bibr">33]</ref> for more examples of Hamiltonians verifying the hypotheses (A1)-(A4).</p><p>Proof. Assume to the contrary that sup &#8486; (w -w) &gt; 0.</p><p>(A.2)</p><p>Step 1. We may assume, without loss of generality, that M = 0 in the hypothesis (A4). Indeed, if we make the change of variables w (t, x) = w(t, x) + M t and w (t, x) = w(t, x) + M t, then w , w are, respectively, a sub-solution and a super-solution of (A.1) with L replaced by L = L + M , and H(t, x, p) replaced by H (t, x, p) = H(t, x, p) -M . This function H satisfies the hypotheses (A1)-(A4) with M = 0. Henceforth in the proof we assume that the hypothesis (A4) holds with M = 0.</p><p>Step 2. It suffices to show that w &#8804; w under the additional assumption that w &#8804; K for some K &gt; 0. Indeed, if w is unbounded in &#8486;, then fix a constant K &gt; 0 and take a sequence {g j } of smooth functions satisfying g j (r) min{r, K} and 0 &#8804; g j (r) &#8804; 1, g j (r)r &#8804; r, g j (r) &#8804; min{r, K} for all r &#8712; R.</p><p>Then &#373; := g j (w) is a viscosity sub-solution of (A.1), since in the region {(t, x) : &#373;-Lt &gt; 0} &#8834; {(t, x) : w -Lt &gt; 0}, we may use the hypothesis (A4) to yield</p><p>By the stability of property of viscosity super and sub-solutions [1, Theorem 6.2], we may let j &#8594; &#8734; to conclude that min{w, K} is a viscosity sub-solution of (A.1) for each K &gt; 0. It now remains to prove Theorem A.1 for all bounded above viscosity sub-solutions, since then min{w, K} &#8804; w for all K &gt; 0 &#8658; w &#8804; w.</p><p>For &#955;, &#948; &#8712; (0, 1), denote</p><p>where &#968;(x) = 1 2 log(|x| 2 + 1) and C = C(&#955;, 0) as in the hypothesis (A4).</p><p>Step 3. We choose &#955; 1, &#948; &#8712; (0, &#175; (&#955;, 0)], R &gt; 0 and</p><p>From (A.2) and Step 3, we may fix &#955; 1 and &#948; 0 such that</p><p>whence we may fix R 1 so that max &#8486;R W (t, x) = max &#8486; W (t, x) &gt; 0 holds. It remains to observe that the maximum (t 0 , x 0 ) in &#8486; R is attained in the interior, since W (t, x) &lt; 0 when t = T or when (t, x) &#8712; &#8706; p &#8486;.</p><p>Step 4. With x 0 as being given in Step 3, fix &gt; 0 small enough so that C(&#955;, x 0 ) &#8804; C(&#955;, 0) and &#948; &#8804; &#175; (&#955;, x 0 ), (A.4) and define W (t, x) := W (t, x) -&#948;&#955; &#968;(x -x 0 ) -</p><p>where &#968;(x) = 1 2 log (|x| 2 + 1) and C = C(&#955;, 0) is as before. Then, (t 0 , x 0 ) is a strict global maximum of W (t, x). Define also &#936; &#945;,&#946; (t, x, s, y) =&#955; 2 w(t, x) -w(s, y) -&#948;(&#968;(x)</p><p>Step 5. We claim that there exists &#945; &gt; 0 such that if min{&#945;, &#946;} &#8805; &#945;, then (i) &#936; &#945;,&#946; has a local maximum point (t 1 , x 1 , s 1 , y 1 ) in &#8486; R &#215; &#8486; R ;</p><p>(ii) &#936; &#945;,&#946; (t 1 , x 1 , s 1 , y 1 ) &#8805; W (t 0 , x 0 ) = W (t 0 , x 0 ) &gt; 0;</p><p>(iii) &#946;|t 1 -s 1 | 2 + &#945;|x 1 -y 1 | 2 &#8594; 0, as min{&#945;, &#946;} &#8594; &#8734;;</p><p>(iv) (t 1 , x 1 ) &#8594; (t 0 , x 0 ) and (s 1 , y 1 ) &#8594; (t 0 , x 0 ) as min{&#945;, &#946;} &#8594; &#8734;,</p><p>where &#8486; R = &#8486; &#8745; [(0, T ) &#215; B R (0)]. Since w &#8805; 0 and w &#8804; K by Step 2, we see that sup &#8486;R&#215;&#8486;R &#936; &#945;,&#946; &#8804; K independently of &#945; and &#946;, and has a maximum point (t 1 , x 1 , s 1 , y 1 ) &#8712; &#8486; R &#215; &#8486; R . Now, by (A.3), &#936; &#945;,&#946; (t 1 , x 1 , s 1 , y 1 ) &#8805; max &#8486;R &#936; &#945;,&#946; (t, x, t, x) = W (t 0 , x 0 ) = W (t 0 , x 0 ).</p><p>This proves assertion (ii). Furthermore, the boundedness also yields &#946;|t 1 -s 1 | 2 + &#945;|x 1 -y 1 | 2 = O(1). We claim that (t 1 , x 1 ) &#8594; (t 0 , x 0 ) and (s 1 , y 1 ) &#8594; (t 0 , x 0 ). Indeed, we may pass to a subsequence to get ( t, x) such that (t 1 , x 1 ) &#8594; ( t, x) and (s 1 , y 1 ) &#8594; ( t, x) as min{&#945;, &#946;} &#8594; &#8734;. Now, by (ii) we can write</p><p>-W (t 0 , x 0 ) + ( W (t 1 , x 1 ) + w(t 1 , x 1 )) -w(s 1 , y 1 ).</p><p>Letting min{&#945;, &#946;} &#8594; &#8734;, then (t 1 , x 1 , s 1 , y 1 ) &#8594; ( t, x, t, x). Using the fact that W (t, x) + w(t, x) (which is essentially &#955; 2 w(t, x) up to addition of continuous functions) and -w(s, y) are both upper semi-continuous in &#8486;, we may take limsup as min{&#945;, &#946;} &#8594; &#8734; and deduce that 0 &#8804; lim sup &#945; 2 |x 1 -y 1 | 2 + &#946; 2 |t 1 -s 1 | 2 &#8804; -W (t 0 , x 0 ) + W ( t, x) &#8804; 0.</p><p>Since (t 0 , x 0 ) is a strict maximum point of W , we must have ( t, x) = (t 0 , x 0 ). This proves assertions (iii) and (iv). Finally, (t 1 , x 1 , s 1 , y 1 ) &#8594; (t 0 , x 0 , t 0 , x 0 ) and hence must be an interior point of &#8486; R &#215; &#8486; R when min{&#945;, &#946;} is sufficiently large. This proves (i).</p><p>Step 6. We show the following inequality: &#948; T 2 &#8804; H * (s 1 , y 1 , &#945;(x 1 -y 1 )) -H * (t 1 , x 1 , &#945;(x 1 -y 1 )) + |t 1 -t 0 |.</p><p>(A.6)</p><p>Observe that (t 1 , x 1 ) is an interior maximum point of the function w(t, x)&#981;(t, x), where &#981;(t, x) = 1 &#955; 2 [w(s 1 , y 1 ) + &#948;(&#968;(x) + Ct + 1 T -t ) + &#955;&#948;( &#968;(x -x 0 ) + Ct)</p><p>Also w(t 1 , x 1 ) &gt; 0, which is a consequence of w(s 1 , y 1 ) &#8805; 0 and &#936; &#945; (t 1 , x 1 , s 1 , y 1 ) &gt; 0. By definition of w being a viscosity sub-solution of (A.1), we have where q = 1 &#955; (&#948;D x &#968;(x 1 ) + &#945;(x 1 -y 1 )). In the view of D&#968;(x 1 -x 0 ) = x1-x0 |x1-x0| 2 +1 , we may apply the hypothesis (A4) to get</p><p>where we used C(&#955;, x 0 ) &#8804; C(&#955;, 0) = C (due to (A.4)) in the last inequality.</p><p>Applying the hypothesis (A4) once more, we have -&#948;(C + 1 T 2 + &#955;C) -&#946;(t 1 -s 1 ) -(t 1 -t 0 ) &#8805; [H * (t 1 , x 1 , &#945;(x 1 -y 1 )) -&#948;C] -&#955;&#948;C &#8805; H * (t 1 , x 1 , &#945;(x 1 -y 1 )) -&#948;C -&#955;&#948;C, and hence &#948; T 2 + &#946;(t 1 -s 1 ) + (t 1 -t 0 ) + H * (t 1 , x 1 , &#945;(x 1 -y 1 )) &#8804; 0.</p><p>(A.8)</p><p>In the same way, (s 1 , y 1 ) is a interior minimum point of the function w(s, y)&#968;(s, y) with &#968;(s, y) =&#955; 2 w(t 1 , x 1 ) -&#948;(&#968;(x 1 ) + Ct 1 + 1 T -t ) -&#955;&#948;(&#968;(x 1 -x 0 ) + Ct 1 )</p><p>whence &#946;(t 1 -s 1 ) + H * (s 1 , y 1 , &#945;(x 1 -y 1 )) &#8805; 0. (A.9) Subtracting (A.8) from (A.9), we obtain (A.6) as claimed. By Step 5 (iv), we have (t 1 , x 1 ) &#8594; (t 0 , x 0 ) and (s 1 , y 1 ) &#8594; (t 0 , x 0 ) as min{&#945;, &#946;} &#8594; &#8734;. On the one hand, if (t 0 , x 0 ) / &#8712; &#915;, then there exists &#945; 1 &gt; 0 such that (t 1 , x 1 ) and (s 1 , y 1 ) enter the (&#948; 0 /2)-neighborhood of (t 0 , x 0 ) whenever min{&#945;, &#946;} &#8805; &#945; 1 . Now, fix &#945; and let &#946; &#8594; &#8734;, then after passing to a sequence, we have t 1 , s 1 &#8594; t, x 1 &#8594; x, y 1 &#8594; &#563;.</p><p>with initial data (U (0), V (0)) = (&#948;, 1), so that (U , V )(&#8734;) = (k 1 , k 2 ). By comparison in the time interval [-T, 0], we reveal that for each T &gt; 0, (&#251;, v)(t, x) (U , V )(t + T ) for (t, x) &#8712; [-T, 0] &#215; R, so that we in particular have, for every T &gt; 0, (&#251;, v)(0, 0) (U , V )(T ).</p><p>Letting T &#8594; &#8734;, we obtain (&#251;, v)(0, 0) (k 1 , k 2 ). In particular, we deduce that</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>This is a contradiction and proves (c).</head><p>The following result is applied to prove Proposition 4.2 and Proposition 4.5.</p><p>Lemma B.2 ( [41, Lemma 2.4]). Let &#265; &gt; 0, t 0 &gt; 0, and (&#361;, &#7805;) be a solution of</p><p>&#8706; t &#7805; -d&#8706; xx &#7805; = r&#7805;(1 -b&#361; -&#7805;), 0 &#8804; x &#8804; &#265;t, t &gt; t 0 , &#361;(t 0 , x) = &#361;0 (x), &#7805;(t 0 , x) = &#7805;0 (x), 0 &#8804; x &#8804; &#265;t 0 . , if 0 &lt; &#956; &lt; &#955;LLW (&#265; -cLLW ).</p></div></body>
		</text>
</TEI>
