Metastability and exit problems for systems of stochastic reaction-diffusion equations
Michael Salins, Konstantinos Spiliopoulos

TL;DR
This paper develops a metastability theory for stochastic reaction-diffusion equations with small multiplicative noise, analyzing exit times and shapes from complex domains of attraction without relying on finite-dimensional approximations.
Contribution
It introduces a purely infinite-dimensional approach to metastability in stochastic reaction-diffusion systems with non-gradient nonlinearities and non-uniform attraction domains.
Findings
Proves large deviations asymptotics for exit times.
Characterizes the most probable exit shapes.
Addresses systems with saddles and limit cycles in attraction domains.
Abstract
In this paper we develop a metastability theory for a class of stochastic reaction-diffusion equations exposed to small multiplicative noise. We consider the case where the unperturbed reaction-diffusion equation features multiple asymptotically stable equilibria. When the system is exposed to small stochastic perturbations, it is likely to stay near one equilibrium for a long period of time, but will eventually transition to the neighborhood of another equilibrium. We are interested in studying the exit time from the full domain of attraction (in a function space) surrounding an equilibrium and therefore do not assume that the domain of attraction features uniform attraction to the equilibrium. This means that the boundary of the domain of attraction is allowed to contain saddles and limit cycles. Our method of proof is purely infinite dimensional, i.e., we do not go through finite…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Metastability and exit problems for systems of stochastic reaction-diffusion equations
M. Salins K. Spiliopoulos111Boston University, Department of Mathematics and Statistics, 111 Cummington Mall, Boston, 02215. E-mails: [email protected], [email protected]. K.S. was partially supported by NSF DMS 1550918 and Simons Foundation Award 672441.
Abstract
In this paper we develop a metastability theory for a class of stochastic reaction-diffusion equations exposed to small multiplicative noise. We consider the case where the unperturbed reaction-diffusion equation features multiple asymptotically stable equilibria. When the system is exposed to small stochastic perturbations, it is likely to stay near one equilibrium for a long period of time, but will eventually transition to the neighborhood of another equilibrium. We are interested in studying the exit time from the full domain of attraction (in a function space) surrounding an equilibrium and therefore do not assume that the domain of attraction features uniform attraction to the equilibrium. This means that the boundary of the domain of attraction is allowed to contain saddles and limit cycles. Our method of proof is purely infinite dimensional, i.e., we do not go through finite dimensional approximations. In addition, we address the multiplicative noise case and we do not impose gradient type of assumptions on the nonlinearity. We prove large deviations logarithmic asymptotics for the exit time and for the exit shape, also characterizing the most probable set of shapes of solutions at the time of exit from the domain of attraction.
**MSC: **60F10, 60H15, 35R60, 60G40.
**Keywords: **Stochastic partial differential equations, stochastic reaction-diffusion equation, metastability, small noise, large deviations, exit time, exit place
1 Introduction
In this paper we study the following -dimensional system of stochastic reaction-diffusion equations exposed to small noise on the spatial domain ,
[TABLE]
A uniform large deviations principle for a similar system of equations was investigated in [10] (see also [6, 25, 22]).
The differential operators are elliptic second-order operators such that for
[TABLE]
In the above expression belong to , belong to and the are positive and strictly bounded from below by a positive number.
The vector-valued function given by is locally Lipschitz continuous and satisfies certain dissipativity properties that are specified in Assumption 2.1 below. The matrix-valued function is locally Lipschitz continuous and uniformly elliptic.
The driving noises are independent cylindrical Wiener processes on the Hilbert space . The vector-valued random field is a cylindrical Wiener processes on the Hilbert space .
We let denote the function space of continuous vector-valued functions on that are equal to zero on the endpoints, endowed with the supremum norm. For any initial data , we denote the solution to (1.1) by to emphasize the dependence on the initial data . The process has solutions that are almost surely continuous in time and space (see [8]) and therefore we can consider as -valued for any .
The purpose of this paper is to develop a metastability theory for in the infinite dimensional function space that is analogous to the metastability theory for finite dimensional diffusions developed by [18]. In contrast to previous characterizations of the exit time in infinite dimensions, see [1, 2, 3, 11, 6, 12, 17, 19, 20, 23], we do not assume that the domain of attraction in has uniform attraction to the equilibrium, our method of proof is purely infinite dimensional, i.e. we do not go through finite dimensional approximations, we allow multiplicative noise and we do not impose gradient type of assumptions on the nonlinearity. In addition, we study, for the first time in this paper, the logarithmic asymptotic of the exit shape distribution and we characterize the most likely exit behaviors from the domain of attraction.
A set surrounding an asymptotically stable equilibrium of the unperturbed system is said to be uniformly attractive if
[TABLE]
In this paper we study the problem of exiting from a full domain of attraction. Specifically, if is an asymptotically stable equilibrium of the unperturbed system , we study the exit from
[TABLE]
Such a set is not uniformly attractive and the boundary of can contain unstable equilibria (saddles) or limit cycles. The exit problem from such a is often referred to in the literature as the case of a characteristic boundary. In the finite dimensional case, the characteristic boundary case was studied by Day in [13]. Genuinely new ideas are needed in passing to infinite dimensions since (a): the domain of attraction is not compact, and (b): in infinite dimensions one cannot connect any two points in with a controlled path (both of (a) and (b) are standard tools used in finite dimensions).
The stochastically perturbed system , when is small but positive, is likely to stay in for long periods of time. Once the system exits it can enter a different metastable domain. Due to certain non-degeneracy assumptions on the stochastic perturbations, the exit time is finite with probability one, but diverges as . We will characterize the exponential divergence rates
[TABLE]
as well as the limiting distribution of the exit shape (Theorems 4.5 and 4.9).
In this paper we use recent uniform large deviations principle results for stochastic partial differential equations, [6, 10], to prove logarithmic asymptotics for the mean exit time and for its corresponding distribution function, as the noise converges to zero. In addition, we prove, for the first time in infinite dimensions without uniform attraction, lower and upper bounds for the large deviations principle of the exit shape (analogous to the exit position in finite dimensions). Under additional conditions such lower and upper bounds match, yielding a large deviations principle for the exit shape.
To the best of our knowledge one of the first papers that studied large deviations for infinite dimensional systems with an eye towards metastability is [16]. In [16] the authors study the stochastic Allen-Cahn equation, characterize in detail the set of stable and unstable equilibrium points, properties of the equilibrium action, and obtain upper and lower bounds on the probabilities of tunnleing from one stable equilibrium to another.
Detailed results on mean exit time asymptotics for stochastic reaction diffusion equations (of the type considered in [16]) can also be found in [2], see also [1, 3] and [14, 21]. The setup in [2] is restricted to additive noise, with the nonlinear term in the equation being of gradient type. The method of proof in [2] is based on approximating the mean exit time of the infinite dimensional process by a sequence of mean exit times of appropriate finite dimensional problems making use of the potential theoretic approach to metastability developed in [4, 5]. In this paper, we address the multiplicative noise case, we do not impose gradient type of restrictions on the nonlinear term and our method of proof is purely infinite dimensional without going through the finite dimensional approximation. In addition, we obtain the logarithmic asymptotics of the exit shape distribution.
We comment on the assumptions that we impose on this model. We assume that the differential operator is elliptic. Such an operator generates an analytic semigroup on . We assume that the nonlinear function is locally Lipschitz continuous and features a super-linear dissipativity property (see Assumption 2.1). One important consequence of this kind of dissipativity is that it forces the solutions into a finite part of the space with overwhelming probability (see (3.6)-(3.7)). The compactness of the semigroup along with this dissipativity leads to certain compactness and tightness properties of the solutions. Any nonlinear odd-degree polynomial with negative leading coefficient such as features super-linear dissipativity. The assumption that features super-linear dissipativity enables the proof of exit time and exit shape asymptotics from unbounded domains of the function space. If does not feature super-linear dissipativity (for example, if is globally Lipschitz continuous) then the methods developed in this paper can be adapted to prove exit time and exit shape asymptotics from bounded domains of attraction only. Since we expect the full domains of attraction around an attractor to be unbounded, we focus on the super-linear dissipativity setting.
We assume that the spatial dimension is so that the system exposed to space-time white noise is well-defined. If the spatial dimension were greater than 1, then an appropriately degenerate colored noise would be required for function-valued solutions to exist (See Hypothesis 2 of [10]), however, the methods used in the current paper would not work if the noise were degenerate. We also assume that the diffusion matrix is invertible and that the inverse in uniformly bounded in operator norm (Assumption 2.2). The non-degeneracy of the space-time white noise and non-degeneracy of enable us to prove important results about the ability to connect controlled trajectories (Theorem 5.7). We also make two reasonable assumptions about the boundary of the domain of attraction . We assume that if is an initial condition that does not belong to then deterministic control problems starting at cannot reach with arbitrarily small controls (Assumption 4.3). Essentially this assumption says that acts as a separatrix between different attractive domains in the function space. We also assume that there exists a finite collection of so-called equivalence classes that contain all of the -limit points of the unperturbed system for (see Assumpiton 4.6).
All of the assumptions outlined in the previous paragraphs are important for our analysis, but they are also very general. We do not assume that has any gradient structure. We allow for multiplicative noise and allow for general non-degenerate, bounded, and Lipschitz continuous diffusion matrices . As mentioned before, we study the exit from a full domain of attraction around an asymptotically stable solution. Furthermore, in contrast to the assumptions imposed in most of the investigations of exit place asymptotics in the finite dimensional setting (eg. [18, 13]), we make no assumptions about the regularity of the boundary of . In lieu of assuming boundary regularity we propose two new notions of the quasipotential to characterize the exit shape problem. Without assuming any regularity properties of the boundary of we cannot quite prove a LDP for the exit shape, but rather prove the result with a lower bound and upper bound that do not necessarily match (Theorem 4.9). We expect analogous results to hold for finite dimensional exit place asymptotics from regions with irregular characteristic boundaries. In Section 8 we explore which extra requirements on lead to an LDP for the exit shape.
The rest of the paper is organized as follows. In Section 2 we fix our notations and we describe our main assumptions about , , , and from (1.1). Our other two main assumptions about the domain of attraction are presented in Section 4 after the quasipotential has been defined. In Section 3 we describe the mild formulation of (1.1) and establish some key uniform bounds on its solution that will be used throughout the paper (see Theorem 3.2).
In Section 4, we recall the related uniform large deviations results of [6, 10], and define the quasipotentials , , and in terms of optimal control problems with respect to the large deviations rate function. Then we present the main results of our paper, Theorems 4.5 and 4.9, which characterize the exponential divergence rate of the exit time and the mean exit time (1.3), and the large deviations upper and lower bounds of the distribution of the exit shape , in terms of these quasipotentials.
Section 5 contains a key result of the paper on controllability of the underlying controlled infinite dimensional dynamical system as well as results on continuity, lower semicontinuity, and compactness properties of the the quasipotentials. In particular, even though, and in contrast to the finite dimensional case, we cannot connect any two arbitrary elements of the domain of attraction with a controlled trajectory, we can still construct a control that connects initial conditions to certain given controlled paths after a short time and with minimal additional energy, given that the initial points are close in the uniform norm. The results of Section 5 may be of independent interest.
Sections 6 and 7 contain the proofs of Theorems 4.5 and 4.9 respectively. In Section 6 we prove that the exponential divergence rates of the exit time and the mean exit time (1.3) are characterized in terms of the quasipotential. What allows one to derive the desired results are the controllability results, the continuity and regularity properties of the quasipotential and the uniform bounds established in Section 5.
In Section 7 we prove large deviations lower and upper bounds for the distribution of the exit shape , analogous to the exit place in finite dimensions. Due to the lack of uniform attraction to the stable equilibrium, the characteristic boundary of , and the infinite dimensionality of our setting, the proof here is considerably more complicated than in the analogous finite dimensional case of [18] and [13]. Again we make extensive use of the controllability result of Section 5 and we study the logarithmic asymptotics of appropriate Markov chains, analogous in spirit to the Markov chain constructed in [18] but substantially different in order to deal with the infinite dimensional aspect of the problem and due to the inability to consider reflected process (in contrast to what was done in [13]). Then, in Section 8, we demonstrate that if we impose an additional assumption about boundary regularity of the domain of attraction and controllability of the processes near the boundary, that the large deviations lower and upper bounds in Theorem 4.9 match, leading to a large deviations principle for the exit shape distribution.
2 Assumptions and notation
For any Banach spaces , let be the set of bounded linear operators from endowed with the norm
[TABLE]
We let .
For any Banach space define the distance between a set and
[TABLE]
As introduced in the previous section, let endowed with the supremum norm
[TABLE]
Let with the norm
[TABLE]
and denote the associated inner product by
[TABLE]
In the expressions above denotes the norm and denotes the inner product.
Arguing as in Section 2 of [10] we can assume without loss of generality that the differential operator is in divergence form and its realization in with imposed boundary conditions is self-adjoint. Then there exists a complete orthonormal system of such that . Define fractional powers . Define fractional Sobolev spaces for is the completion of under the norm
[TABLE]
For any subset we let denote the closure of in . We let denote the complement of in . For any and we denote the open ball by
[TABLE]
Assume that the nonlinearity satisfies the following assumption.
Assumption 2.1**.**
- (a)
* is Locally Lipschitz continuous. For any there exists such that whenever with and ,*
[TABLE] 2. (b)
There exist such that for any ,
[TABLE]
and
[TABLE]
Assumption 2.1 is satisfied, for example, when the are polynomials with odd degree and a negative coefficient for the leading term. If is an even number, , and for are polynomials on with degree less than or equal to then
[TABLE]
will satisfy our assumptions. As we will show below, see Theorem 3.2, property (2.3) will guarantee that the process spends most of its time on a finite part of the space.
Define the Nemyitskii operator by for and ,
[TABLE]
Under Assumption 2.1, has the properties that
is locally Lipschitz continuous. For any there exists such that whenever with and , 2. 2.
For any and any
[TABLE] 3. 3.
There exists such that for any ,
[TABLE]
In regards to the diffusion coefficient we impose Assumption 2.2.
Assumption 2.2**.**
There exists such that for all ,
[TABLE]
There exists such that for any
[TABLE]
For , and define
[TABLE]
is a mapping from . Furthermore, it satisfies the following properties.
For any and ,
[TABLE] 2. 2.
For any ,
[TABLE] 3. 3.
For any , is invertible and
[TABLE]
and
[TABLE]
[TABLE]
Remark 2.3*.*
We mention here that the upper boundedness assumption on has been mainly utilized in the proofs of Theorem 3.1, Theorem 3.2, part 3, and Theorem 3.3. At the expense of slightly more elaborate estimates, one could weaken the global upper bound assumption to potentially allow some growth and as long as the statements of Theorem 3.1-3.3 hold, the rest of the results of the paper will also hold. We chose to assume boundedness to simplify those proofs and thus focus on the rest of the results which also constitute the main novelty of the paper.
We close this section by describing the space-time white noises. For any , are independent and have the property that for any and any deterministic ,
[TABLE]
is a Gaussian random variable. They have covariances
[TABLE]
where if and for . Recall that the eigenfunctions of , , form a complete orthonormal basis of . For , let be the th component of then
[TABLE]
is a family of independent identically distributed one-dimensional Brownian motions. Let be the natural filtration of this collection of Brownian motions. Let be the formal sum
[TABLE]
For any -adapted -valued process, satisfying , the stochastic integral is defined to be the limit
[TABLE]
3 The mild solution and its properties
As stated in the previous section, is the realization of in with the imposed boundary conditions. generates a semigroup in , which we call . has many regularization properties including (see for example [7])
[TABLE]
is also a compact semigroup in the sense that for any the image is pre-compact in . Let be defined by (2.6) and be defined by (2.11).
The mild solution of (1.1) is the solution to the integral equation
[TABLE]
The subscript represents the initial -valued condition.
In the sequel, we establish certain boundedness and regularizing properties of , the solution to (3.2). Let us define to be the stochastic convolution
[TABLE]
Using the classical stochastic factorization method and the fact that is uniformly bounded above (2.9) we obtain Theorem 3.1 (see Lemma 4.1 in [9]).
Theorem 3.1**.**
There exists and a constant such that for any and ,
[TABLE]
The main result of this section is the following theorem.
Theorem 3.2**.**
The mild solution solving (3.2) satisfies the following bounds almost surely
There exists such that or any , and ,
[TABLE] 2. 2.
There exists such that for any , , and ,
[TABLE] 3. 3.
For large enough, we have
[TABLE]
The proof of Theorem 3.2 will be given in Appendix A.
In addition, using an estimate from [10], we can show that the probability of staying outside of a bounded set is exponentially small. This result uses the fact that is bounded, but as [10] demonstrated, stopping time arguments can be used to apply this theorem to the case where is unbounded.
Theorem 3.3** (Theorem 3.2 of [10]).**
For any , there exist such that for any and that is adapted to the filtration of ,
[TABLE]
From this we can immediately get exponential estimates on the probability that is large.
Corollary 3.4**.**
For any ,
[TABLE]
Proof.
By Theorem 3.2, for any , , , and ,
[TABLE]
where is given by (3.3). By Theorem 3.3, letting ,
[TABLE]
For arbitrarily large , we can choose large enough so that . Then we can conclude that
[TABLE]
Our result follows because was arbitrary. ∎
4 Uniform large deviations principle and metastability
Define the rate functions for , and ,
[TABLE]
where for any , solves the controlled problem
[TABLE]
For , , and , denote the level sets of the rate function by
[TABLE]
The following uniform large deviations result over bounded sets is well known.
Theorem 4.1** (See [10, 6]).**
For any fixed , satisfies a uniform large deviations principle in with respect to the rate function uniformly over bounded subsets of .
For any , , and bounded subset ,
[TABLE] 2. 2.
For any and , and bounded subset ,
[TABLE]
Let us next present our main results of this work on metastability.
Let be an asymptotically stable equilibrium of the unperturbed system and recall , its domain of attraction,
[TABLE]
Assumption 4.2**.**
Assume that for every and
[TABLE]
Assumption 4.2 is a technical assumption that prevents pathological cases.
We are interested in the time it takes for the stochastic system to exit this attracting set
[TABLE]
We characterize the asymptotic behavior of the exit time and the exit shape in terms of functionals , and , which we call quasipotentials.
For any , define
[TABLE]
Without confusion, for any subsets we define
[TABLE]
In addition to the assumptions of Section 2, we shall also make the following assumption about the domain of attraction defined in (4.5).
Assumption 4.3**.**
For any , .
Remark 4.4*.*
Assumption 4.3 guarantees that acts like a separatrix. An important consequence of Assumption 4.3 is that for any and .
[TABLE]
Because was defined in (4.5) to be the domain of attraction for , and (4.8) also holds for all . Indeed, this is the content of Lemma 5.5 in Section 5.
Theorem 4.5 characterizes the logarithmic asymptotic of the exit time .
Theorem 4.5**.**
Let Assumptions 2.1, 2.2, 4.2, and 4.3 hold. For any ,
[TABLE]
and for any ,
[TABLE]
The proof of Theorem 4.5 is in Section 6.
Let us next analyze the distribution of . Because takes values in , we call this object the exit shape.
As in [17, 18, 13] define an equivalence relation such that
[TABLE]
Any equivalence class defined with respect to this equivalence relation is called a equivalence class.
Assumption 4.6**.**
There exists a finite number of equivalence classes such that every -limit point of for is contained in one of the .
Remark 4.7*.*
If is an equilibrium of the unperturbed system, meaning for all , then should be one of these equivalence classes. Notice that such a is an unstable equilibrium because where is the set of attraction for . If there exists a and a period such that , then the set is called a limit cycle and could also be an example of a equivalence class.
The next lemma demonstrates that each .
Lemma 4.8**.**
If is a equivalence class such that , then .
Proof.
Let and . If then Assumption 4.3 and Remark 4.4 guarantee that so . Therefore, which implies . ∎
The exit shape asymptotics are described by the quasipotentials and as defined below. For any , and define
[TABLE]
and for any , set
[TABLE]
Notice that if , then has the explicit representation
[TABLE]
because there exists such that for all , . In general, for , and
[TABLE]
In addition, let us set
[TABLE]
and
[TABLE]
Clearly for any we have that
[TABLE]
As usual, for any ,
[TABLE]
In other words, and are the minimum actions of any path that connects and without leaving and respectively. So when is small and and are on the boundary of , the paths are allowed to barely leave , but only when they are near or (or one of the ). The expansion around these points and sets enables us to prove our theorems without assumptions on the regularity of the boundary of .
Now we are ready to state our result on the exit shape asymptotics.
Theorem 4.9**.**
Let Assumptions 2.1, 2.2, 4.2, 4.3, and 4.6 hold. The exit shape satisfies a large deviations lower bound with respect to the rate function given by
[TABLE]
In particular, for any , and ,
[TABLE]
The exit shape satisfies a large deviations upper bound with respect to the rate function given by
[TABLE]
For any , and ,
[TABLE]
where .
The proof of Theorem 4.9 is in Section 7.
An immediate corollary of the exit shape upper bound (4.18) is that the limiting distribution of the exit shape is concentrated on the set . The following corollary is analogous to the classical result about the exit place limiting distribution in the finite dimensional case (see Theorems 4.2.1 and 6.5.2 of [18] and Theorem 5.7.11(b) of [15]).
Corollary 4.10**.**
For any , ,
[TABLE]
In particular, if there is a unique minimizer such that , then and converges to in probability.
We will prove that is non-empty and compact in Theorem 5.22 in the following section.
We end this section with two remarks, where we discuss Theorem 4.9 as well as the different notions of quasipotentials appearing in the metastability results.
Remark 4.11*.*
It is instructive to comment here on the different notions of quasipotentials appearing in the metastability results of Theorems 4.5 and 4.9. We use in Section 5 to establish certain continuity and lower semicontinuity properties. In addition, is also used for Theorem 4.5. Notice however that
[TABLE]
so any of these quasipotentials can be used for Theorem 4.5. is used for the lower bound of the logarithmic asymptotics of the exit shape, whereas is used for the upper bound of the logarithmic asymptotics of the exit shape.
Remark 4.12*.*
Notice that Theorem 4.9 does not give a large deviations principle for the exit shape of the random variable . The reason is that in general it is not clear whether, under our current assumptions, the functionals and are equal. We will explore this possibility in Section 8.
5 Controllability properties and the quasipotential
In the case of finite dimensional diffusions considered by Freidlin and Wentzell [18], the quasipotential (4.6) is jointly continuous. That is whenever and , . This continuity, in the finite-dimensional case, is proven by defining a (straight-line) path with arbitrary small action that connects arbitrary close points and . Unfortunately, cannot be jointly continuous in in the infinite dimensional case. In particular, the quasipotential whenever and . Recall the definition of from (2.1).
It will not be possible in the setting of this paper to connect any two elements of with a controlled path. However, certain continuity properties of the quasipotential are still true. The purpose of this section is to explore such properties, which, as will be seen later on, are key in the development of a metastability theory in infinite dimensions.
One of the key concepts here is that of controllability. We show that if is a controlled process for some and and is close to , then we can build a new control such that the controlled process joins after a short period of time. We can also guarantee that the action of is not much bigger than the action of . This is particularly of interest when . We can show that whenever is close to , we can construct a control such that after a short amount of time. This means that while it is usually impossible to make a path that connects and , it is possible to build a path that connects to the unperturbed dynamical system that starts at .
Useful auxiliary properties of the skeleton equation (4.2) are presented in Subsection 5.1. The controllability result is shown in Subsection 5.2. Subsection 5.3 discusses continuity properties of the quasipotential , defined by (4.6). Then, in Subsection 5.4 we discuss regularity properties of the quasipotential , defined by (4.6). In Subsection 5.5 we prove lower semi-continuity and compactness of level sets for and , defined in (4.11) and (4.14) respectively. In Subsection 5.6 we discuss properties of the equivalence classes .
5.1 Some properties of the skeleton equation (4.2)
At this point, we collect some useful results for the skeleton equation (4.2) .
Theorem 5.1** (A priori bounds).**
There exists such that for any , , and ,
[TABLE]
and for any ,
[TABLE]
The proof of Theorem 5.1 is in Appendix A.
Theorem 5.2** (Continuity with respect to initial condition and control, Theorem 8.4 in [6]).**
For any fixed , if and weakly in , then
[TABLE]
Theorem 5.3** (Compactness, Theorem 8.5 in [6]).**
Let , , and . Whenever is a bounded sequence and with , then there exists a subsequence such that for any , converges in .
A useful corollary of Theorems 5.1 and 5.3 is the following compactness result.
Corollary 5.4**.**
For any and , the set
[TABLE]
is pre-compact in .
Proof.
Let and with . Let . By (5.2), there exists such that . We define to be the translation for . Then it is clear that . By Theorem 5.3, there is a convergent subsequence. ∎
Another useful result of Theorems 5.2 and 5.3 is Lemma 5.5.
Lemma 5.5**.**
For all , we have that .
Proof of Lemma 5.5.
By assumption, is an asymptotically stable equilibrium. This means that for all small there exists such that and whenever , for all and . Additionally, there exists such that for any such that , . This uniformity is due to the compactness of the set (see Theorem 5.3). By Theorem 5.2, there exists such that if and , then
[TABLE]
Now, given any , because is the domain of attraction to , there exists such that . By Theorem 5.2, by possibly decreasing we can guarantee that for all , for , and . Then we know that for and because . We can repeat this argument to show that for any , and satisfying , it follows that for and . Now we can guarantee that for any ,
[TABLE]
In particular this proves that . ∎
In Theorem 5.6 we prove that the set of attraction of , an asymptotically stable equilibrium of the unperturbed system, given in (4.5) are open. A similar result for the case of the Allen-Cahn equation can be also found in [16].
Theorem 5.6**.**
The set of attraction is open.
Proof.
Because is asymptotically stable, there exists such that the open ball . We need to show that if , then there exists such that . So, let . Because , there exists such that . By Theorem 5.2, we can find such that for all satisfying it follows that . Therefore, for all satisfying , . Then because the ball around is in , it follows that for all such that , . This proves that is open. ∎
5.2 Controllability
The main result of this subsection is the controlability Theorem 5.7.
Theorem 5.7**.**
For any , and , there exists such that whenever , , , and , there exists such that for all and .
Proof.
Fix , , and . Let satisfying and and satisfying . We will build a control such that after a certain time.
Let solve the Cauchy problem
[TABLE]
Notice that a solution exists and is unique because the mapping is Lipschitz continuous.
Let . Notice that by uniqueness for and . Furthermore, we can calculate that
[TABLE]
For any ,
[TABLE]
For , therefore, it holds that
[TABLE]
Because , it follows that for all
[TABLE]
In particular, this proves that for all . Because , there exists
[TABLE]
Therefore, we can define
[TABLE]
This process solves the Cauchy problem
[TABLE]
Define
[TABLE]
and notice that .
This controlled system has the property that for all . Because , for all .
Now we analyze the norm of . First, observe that
[TABLE]
[TABLE]
Therefore, due to the fact that
[TABLE]
Using the fact that for any , ,
[TABLE]
By the a-priori bounds (5.1), there exists such that for all . Using the fact that is locally Lipschitz continuous (see Assumption 2.1), there exists a such that . Therefore, also taking into account the continuous embedding of into
[TABLE]
Combining (5.3), (5.2), and (5.2), for any ,
[TABLE]
Simple calculations show that for small ,
[TABLE]
We can choose small enough so that whenever the remainder is smaller than . ∎
5.3 Continuity properties of the quasipotential
We collect several results about the continuity, semicontinuity, and compactness of the quasipotential defined in (4.6). The three main theorems in this section are Theorems 5.8, 5.9, and 5.10.
Theorem 5.8**.**
The quasipotential is a continuous function from . That is, whenever and ,
[TABLE]
Theorem 5.9**.**
For any compact set and , the union of sublevel sets of the quasipotential
[TABLE]
is a compact subset of .
Theorem 5.10**.**
The quasipotential is a lower-semicontinuous generalized function from in the sense that whenever and ,
[TABLE]
The proofs of Theorems 5.8, 5.9, and 5.10 will follow after a few preliminary results.
Lemma 5.11**.**
Assume that and , is a convergent sequence in with limit , and with . Then
[TABLE]
Proof.
Observe that
[TABLE]
By (5.1) and (2.8), there exists such that . With this estimate and (A) it follows that
[TABLE]
The right hand side converges to zero because and the semigroup is continuous. ∎
Lemma 5.12**.**
* if and only if or .*
Proof.
By the definition (4.6), for all because . If and , then there exists and such that . In particular,
[TABLE]
Because , Lemmas B.1 and B.2 guarantee that .
Now we show that whenever , . Let and let
[TABLE]
As we argue in the proof of Theorem B.4, where
[TABLE]
and . Similarly to the argument in the proof of Theorem 5.7, define and such that
[TABLE]
Notice that this is slightly different than the control in Theorem 5.7. We calculate that
[TABLE]
Because , these calculations show that for all . In particular, . In this case, is not necessarily small (if is big), but it is necessarily finite. Therefore, . ∎
Lemma 5.13**.**
Whenever and , we have
[TABLE]
Proof of Lemma 5.13.
We construct trajectories satisfying , and . In the finite dimensional setting studied by Freidlin and Wentzell this could be accomplished using a straight line connecting and . In our setting, however, the unboundedness of prevents straight lines from being helpful.
Let with . Let and note that by Sobolev embedding. Define the trajectory
[TABLE]
Such a trajectory starts at , follows the unperturbed dynamics for time, and then reverses, retracing its trajectory until it reaches back to . As discussed in the proof of Theorem B.4, where
[TABLE]
The energy of this control is
[TABLE]
By (B),
[TABLE]
Because , , and is a semigroup on ,
[TABLE]
Furthermore, by Lemma 5.11, . From these calculations, we can see that
[TABLE]
Of course, these are not exactly the trajectories that we want for the proof because they do not connect and . So we construct as in Theorem 5.7 so that . By that theorem it is clear that
[TABLE]
By definition, ∎
Lemma 5.14**.**
If and , then
[TABLE]
Proof.
This is a consequence of Theorem 5.7. Let . We showed in Lemma 5.12 that . If , then it is clear from definition (4.6) that there exists and such that and . If , then arguing using a reversed process as in the proof of Lemma 5.13, we can show that the same property holds.
By Theorem 5.7, there exists large enough so that for any there exists such that and
[TABLE]
This proves
[TABLE]
We can use a similar argument to show that
[TABLE]
By the definition of the quasipotential, there exists a sequence and such that and
[TABLE]
We now explore two cases: and . Assume first that . By Lemma 5.11 and the fact that ,
[TABLE]
It is clear that .
On the other hand, if , then we can find a subsequence of and a such that for all . Fix . By possibly decreasing , Theorem 5.7 guarantees that whenever , there exists a such that and . We can conclude that for large ,
[TABLE]
∎
Proof of Theorem 5.8.
By Lemma 5.12, is finite on .
To prove (5.6), let in and in . The definition of the quasipotential guarantees that
[TABLE]
Lemma 5.14 guarantees that and . Lemma 5.13 guarantees that . Therefore (5.6) holds. ∎
Proof of Theorem 5.9.
Let be compact and . Let and be any sequences such that . Because is compact, there exists a subsequence (relabeled ) such that in . By the definition of there exist and such that and .
We divide this argument into two cases: and .
If , then by Lemma 5.11 it follows that
[TABLE]
implying . Since , is in the sublevel set of .
On the other hand, if then there exists a subsequence of and a such that for all . Note that
[TABLE]
where and . By (5.2) we get that
[TABLE]
Because for , we know that . By (5.1), we get that
[TABLE]
Because is continuous, we have
[TABLE]
Now, we write
[TABLE]
By Lemma B.1,
[TABLE]
Also, by Lemma B.1 and the boundedness of ,
[TABLE]
Finally, because is an analytic semigroup,
[TABLE]
Therefore, we obtain that
[TABLE]
By the Sobolev embedding theorem, embeds compactly into . Therefore, there exists such that . Because the mapping is lower semi-continuous in the norm, and . Arguing as in (5.10), it holds that
[TABLE]
By Lemma 5.14, and . Therefore we can conclude that
[TABLE]
This implies compactness of (5.7). ∎
Proof of Theorem 5.10.
This is a consequence of Theorem 5.9. Let and in . If , then (5.8) holds trivially. If , then the arguments leading to (5.11) prove our result. ∎
5.4 Quasipotential and its regularity properties
Theorem 5.15**.**
For any and , there exists such that whenever ,
[TABLE]
Proof.
Recall from the definition of the rate function (4.1) that the quasipotential can be described in terms of controls as
[TABLE]
To derive a lower bound on for , we need to find a lower bound on the norm for any controlled process satisfying .
We divide this into the cases where and and use estimates (5.1) and (5.2) respectively.
If , then it follows from (5.1) that
[TABLE]
Therefore, it follows that
[TABLE]
If , then we use the fact that when for . It follows from (5.2),
[TABLE]
It follows that
[TABLE]
Then depending on whether or , (5.12) or (5.13) holds. Consequently we can choose big enough so that if is such that , then . This proves the result. ∎
Theorem 5.16**.**
Let be defined by (4.5). For any , let where . If , then there exists such that .
Proof.
The boundary can be decomposed into
[TABLE]
Let . By the lower bound of the quasipotential, Theorem 5.15, there exists such that whenever , In particular, this proves that any approximate minimizing points with the property that for , have the property that and therefore . Furthermore, any has the property that and therefore . This proves that any approximate minimizers of belong to and any approximate minimizers of belong to . Consequently, . ∎
Now we prove certain internal regularity properties of the quasipotential. Define for ,
[TABLE]
Because is a domain of attraction, for sufficiently small , we shall have that
[TABLE]
Theorem 5.17** (Internal regularity near the boundary).**
For any
[TABLE]
Proof.
Fix . First we prove that for any ,
[TABLE]
Assume . By the definition of there exist and such that and . By continuity, there must exist such that . Then it is clear from the definition of that
[TABLE]
We can take the infimum over all and satisfying and to conclude
[TABLE]
Now we show that
[TABLE]
Let be a sequence such that
[TABLE]
There exist such that By Theorem 5.9, there exists a subsequence such that converges to a limit . Clearly for any . Therefore by (5.15). On the other hand, so it follows that . Therefore, by Theorem 5.10
[TABLE]
∎
Next for , let us recall that and define
[TABLE]
A consequence of Theorems 5.16 and 5.17 is the following Corollary.
Corollary 5.18**.**
For any , there is large enough so that
[TABLE]
Proof.
An inspection of the proof of Theorem 5.16 shows that for any , there is large enough so that uniformly in we have
[TABLE]
Then, Theorem 5.17 concludes the proof of the corollary. ∎
5.5 Continuity properties of the quasipotential and
In this section, we prove lower semi-continuity as well as compactness of level sets of the quasipotentials and defined in (4.11) and (4.14) respectively.
Let us first discuss the lower-semi-continuity properties of .
Theorem 5.19** (Lower semi-continuity of ).**
If converge in norm to and converge to in norm, then
[TABLE]
Proof of Theorem 5.19.
The result is trivially true if or . Assume and . Let be arbitrary.
By (4.12), . Because we assumed that this is finite for large , there exist and such that , , for and .
By Lemma 5.11, if , then and . Because the lemma is trivially true when , we can assume that
[TABLE]
For large , we can guarantee that . By possibly increasing , Theorem 5.7 guarantees that there exists such that , for , for and
By Theorem B.4, we can find small enough so that the revered process starting at has action . By possibly decreasing , we can also guarantee that for all . Then the process
[TABLE]
has the properties that for all and .
Then Theorem 5.7 guarantees that for large enough there exists such that , , for all and .
We concatenate setting
[TABLE]
and set . Then for large , has the properties that , , for , and
[TABLE]
Therefore, for large
[TABLE]
Because was arbitrary and ,
[TABLE]
Finally, we can take the limit as to conclude that
[TABLE]
∎
Theorem 5.20** (Compactness of level sets for ).**
For any compact and , the set
[TABLE]
is compact.
Proof.
By (4.12), . This means that the set in (5.18) is a subset of the set in (5.7). By Theorem 5.9, therefore, we know that the set in (5.18) is pre-compact. Then the compactness is an immediate consequence of Theorem 5.19. Specifically, if and such that . Then there exists a subsequence such that and in norm. By Theorem 5.19, ∎
Theorems analogous to (5.21) and (5.20) are also true for . Since the proof of these results are identical to those for we only include the statements and not the proofs.
Theorem 5.21** (Lower semi-continuity of ).**
If converge in norm to and converge to in norm, then
[TABLE]
Theorem 5.22** (Compactness of level sets for ).**
For any compact and , the set
[TABLE]
is compact.
5.6 Properties of the equivalence classes
In Assumption 4.6, we assumed there there exist a finite collection of equivalence classes that contain all the -limit points of the deterministic dynamical system for .
A Corollary of Theorem 5.9 is that each is a compact subset of .
Corollary 5.23**.**
If is a equivalence class then is compact.
Proof.
Let . Then it is clear that is a subset of the sublevel set , which is compact by Theorem 5.9. Therefore is precompact. We can prove that is compact by proving that it is also closed. Suppose with . Theorems 5.8 and 5.10 guarantee that
[TABLE]
Therefore and . ∎
Because of the way we defined in (4)-(4.14), we will need the following result
Lemma 5.24**.**
For any any , there exists such that whenever and has the properties that for some , , , and , it follows that
[TABLE]
Proof.
Fix . Let , be arbitrary sequences such that , , . Let be an arbitrary sequence and let .
By Theorem 5.9 and the fact that is compact, there exists a subsequence such that and and . Furthermore, by Theorem 5.10,
[TABLE]
implying that . Because is a equivalence class and by Lemma 4.8, . Because the sequences and were arbitrary, we have shown that
[TABLE]
∎
6 Proof of Theorem 4.5: Logarithmic asymptotic for the exit time
The proof of Theorem 4.5 is given in Subsections 6.1 and 6.2, where the upper and lower bounds respectively are being established.
6.1 Upper bound of the exit time
In this section we prove an upper bound for the exponential growth rate of the exit time as , see Theorem 6.1.
Theorem 6.1**.**
For any ,
[TABLE]
and for any ,
[TABLE]
We will prove Theorem 6.1 at the end of this section. First we introduce several lemmas.
Notice that the domain is (possibly) unbounded, which leads to some complications in the analysis of exit times because we can only prove uniform large deviations principles over bounded domains (see Theorem 4.1).
Lemma 6.2**.**
For let be given by (5.14). For any , and , there exists such that for all
[TABLE]
Proof.
Corollary 5.4 guarantees that the set
[TABLE]
is pre-compact in . For any there exists a finite collection such that
[TABLE]
Because and there are only a finite number of , there exists such that for all . This proves that for all ,
[TABLE]
∎
Lemma 6.3**.**
For any and , there exists such that for every there exists satisfying , , and .
Proof.
By (5.2), there exists such that . By Theorem 5.7, there exists such that whenever with and , there exists a control such that for all and . By Lemma 6.2 there exists a time such that for all
[TABLE]
This means that for any , we can find such that . By Theorem 5.7 and our choice of there is also a control such that and . Let and define the control by
[TABLE]
Note that by time homogeneity and we observed above that . Because for it follows that for . In particular, because , it follows that .
The result follows by setting . ∎
Lemma 6.4**.**
For any , there exists such that for any there exists a path such that , and .
Proof.
This is an immediate consequence of Theorem 5.7 because for all . ∎
Lemma 6.5**.**
For any there exists a and a path such that , and .
Proof.
By the definition of , there exists , , and such that , and .
By Assumptions 4.2 and 4.3, we can find , close enough to , say , such that by Theorem 5.7 there exists a path with and and .
Let . The path
[TABLE]
has the properties that , , and . ∎
Lemma 6.6**.**
For any and , there exists such that
[TABLE]
where we recall that .
Proof.
Let . By Lemma 6.4 there exists such that whenever , there exists such that , and .
By Lemma 6.3, there exists such that for every , there exists such that , , and .
By Lemma 6.5, there exists and such that , , and .
Let and define the path
[TABLE]
This is a continuous path satisfying , , and .
Because there exists such that . Consequently, for any ,
[TABLE]
Recall that the LDP lower bound (4.3) is only proven to be uniform over bounded subsets of initial conditions. For this reason we prove uniformity over the set for any . By the LDP lower bound (4.3),
[TABLE]
∎
Proof of Theorem 6.1.
For , to be specified later and any and , we decompose the probability as
[TABLE]
By the Markov property,
[TABLE]
This is less than
[TABLE]
By the Markov property, for any , , , , and ,
[TABLE]
For any and ,
[TABLE]
By (6.1) we see that
[TABLE]
The denominator of (6.1) can be written as
[TABLE]
By (3.7), we can choose big enough and small enough so that for
[TABLE]
With this choice, the denominator of (6.1) is bounded by
[TABLE]
Let . By Lemma 6.6, there exists such that
[TABLE]
Then applying (6.1), it follows that
[TABLE]
We conclude the proof of the lemma by noticing that (6.1) follows because was arbitrary and that (6.2) is a consequence of (6.1) and Chebyshev inequality. In particular, we have that
[TABLE]
which converges to zero by (6.1). ∎
6.2 Lower bound of the exit time
Let us recall the definition of from (5.16). The following lemma says that for each , is uniformly attractive for small enough (recall the definition of uniformly attractive (1.2)).
Lemma 6.7**.**
For each , is uniformly attractive for small enough.
Proof.
Fix some . Because is open we can choose small enough so that . Let . Assume by contradiction that there exists and such that
[TABLE]
By the Corollary 5.4, and the fact that
[TABLE]
the family is compact. There exists a subsequence such that . Because , there exists such that
[TABLE]
For large enough , But this contradicts our assumption that the . Therefore, must be uniformly attractive. ∎
For a given , let us define the exit time
[TABLE]
We have the following result for the lower bound of the exit time if the initial point .
Lemma 6.8**.**
Let be small enough so that is uniformly attractive. Then for large enough and for any
[TABLE]
Furthermore for any
[TABLE]
Proof of Lemma 6.8.
Due to the uniform attractiveness and boundedness of , Lemmas 8.8, 8.9 and 8.10 of [6] remain valid here as far as exit properties of the process from are concerned. Then, arguing as in Theorem 5.7.11 of [15] we obtain that for and any
[TABLE]
Then, Corollary 5.18 and the almost sure estimate gives for sufficiently large
[TABLE]
from which the result follows. The lower bound for the expectation of follows by the last display and Chebyshev’s inequality. ∎
Next we prove the full lower bound of the exit time for an initial point .
Theorem 6.9**.**
For any we have
[TABLE]
Furthermore for any and for any
[TABLE]
Proof of Theorem 6.9.
Let . Set so that . Because is open, there exists such that . Because , there exists such that for all , . Therefore, .
Thus the theorem follows directly from Lemma 6.8. ∎
7 Proof of Theorem 4.9: Large deviations lower and upper bounds for exit shape
In this section we analyze the limiting distribution of the exit shape and prove Theorem 4.9.
Let be any set that contains all limit points of the unperturbed process for all . We demonstrate that it is exponentially unlikely for to stay away from for long periods of time. As a first step here we prove that for any small , there is a time , independent of (but depending on ) such that the unperturbed process has the property that for all .
Lemma 7.1**.**
For any small , there exists such that
[TABLE]
Proof.
In the finite dimensional setting considered by Friedlin and Wentzell, this uniform convergence was a consequence of the compactness of . In our setting, we do not assume that is compact and we do not even assume that is bounded. Even though the initial conditions are not in a compact set, we know that is a pre-compact set by Corollary 5.4.
Suppose by contradiction that there exists and such that for all . By compactness, there exists a subsequence (relabeled ) along which in for some . Because of the definition of we are guaranteed that , which means that there exists such that
[TABLE]
for any . By continuity in initial conditions (Theorem 5.2), for large enough , . Therefore for large ,
[TABLE]
contradicting the assumption. ∎
Lemma 7.2**.**
Let be as in Lemma 7.1. There exists such that whenever is a controlled process with , and the properties that for and
[TABLE]
the control must have the lower bound
[TABLE]
Proof.
Assume by contradiction that there is a sequence and such that
[TABLE]
By Corollary 5.4, a subsequence of this has the property that . By continuity with respect to control and initial condition (Theorem 5.2),
[TABLE]
Lemma 7.1 guarantees that
[TABLE]
contradicting the assumption that
[TABLE]
∎
Lemma 7.3**.**
For small ,
[TABLE]
Proof.
Let and be as in Lemma 7.2. By applying Lemma 7.2 times, for any , we know that whenever is a controlled process with , and the properties that for and
[TABLE]
the control must have the lower bound
[TABLE]
This means that we have the inclusion that for any
[TABLE]
The uniform large deviations principle (Theorem 4.1) was proven over bounded subsets of . Unfortunately, may be an unbounded set. To deal with this situation, we use the fact that Corollary 3.4 guarantees that is exponentially unlikely to remain in an unbounded part of the set after positive amounts of time. In particular, for any we can find such that
[TABLE]
By the Markov property, letting ,
[TABLE]
By the uniform large deviation upper bound (4.4),
[TABLE]
[TABLE]
Both and are arbitrary, implying the result. ∎
7.1 Proof of upper bound (4.18)
In this subsection we prove the upper bound (4.18). For presentation purposes, we first define and discuss the properties of an appropriate Markov chain , in subsection 7.1.1. The actual proof of the upper bound (4.18) follows then in subsection 7.1.2.
7.1.1 Transitions for a related Markov chain
Fix . By the definition of and Lemma 5.24, for any and . We can call this quantity . We reorder the equivalence classes and possibly lower the value of so that is the set of equivalence classes that are subsets of and satisfy .
With defined by (4.18) and for a given define by
[TABLE]
In addition, let us set .
By possibly decreasing we can guarantee that contains all of the equivalence classes satisfying and . By Assumption 4.6, the set contains all of the -limit points of for and therefore Lemma 7.3 holds for this collection, i.e., we may set .
For small and for let , be defined as follows
[TABLE]
With these definitions, define the stopping times
[TABLE]
We consider the Markov chain on . Notice that if , then the Markov chain stops and for all .
Remark 7.4*.*
We remark here that the sequences of stopping times and is different than the ones used in [13] or [18]. In the case of finite dimensions, [13] used a reflected process in order to deal with the characteristic boundary. It is unclear how to do that in infinite dimensions. These considerations led us to this choice of stopping times and then to the corresponding Markov chain .
Lemma 7.5** (Transition probabilities).**
For any , there exists such that for all and
[TABLE]
[TABLE]
For any , there exists such that for all and with and ,
[TABLE]
[TABLE]
Before proving the lemma we make the following remark.
Remark 7.6*.*
The fact that for implies that there are points in that are arbitrarily close to . This is fundamentally different from the situation in Chapter 6.3 of [18] where they assume that there is a positive distance between the and . By beginning at arbitrarily close to we see that only the trivial bounds
[TABLE]
and
[TABLE]
hold.
We will use the following preliminary results in the proof of Lemma 7.5.
Lemma 7.7**.**
We emphasize the dependence of on with the notation . For any and
[TABLE]
Proof.
Assume that is finite because the result is trivial otherwise. Let be a sequence of positive numbers such that
[TABLE]
By the definition of (4.15), there exist and such that . By the compactness of (Corollary 5.23) and the definition of , there exists a subsequence such that . Because the set is compact, Theorem 5.20 guarantees that there exists a subsequence such that . By the definitions of , we know that . By Theorem 5.19,
[TABLE]
∎
Lemma 7.8**.**
Assume . Then for any , there exists some and with the property that , , for and . In addition, by decreasing one can guarantee that does not hit after hitting .
Proof of Lemma 7.8.
Let . Let and such that , and
[TABLE]
By Theorem 5.7, there exists such that we can connect to any controlled path starting in the -ball around without increasing the rate function by more than . Similarly, by the local Lipschitz continuity of , we can find such that whenever , it follows that . Find a time such that . Let
[TABLE]
Clearly
[TABLE]
Now we apply Theorem 5.7 to get a path such that , for , and
We can assume that for all . If this were not the case, then we could just begin at the last time that . This would only decrease its rate function.
Now we bound the upper and lower derivatives of the real-valued function . At . We calculate that for any ,
[TABLE]
Observe that because is an equilibrium of the unperturbed system, . Choose such that . By the triangle inequality,
[TABLE]
This means that there exists such that
[TABLE]
Looking at upper-left derivatives, for any , and such that ,
[TABLE]
The previous line follows because . Because is a second-order elliptic differential operator,
[TABLE]
By our original choices of , and for sufficiently small ,
[TABLE]
It is clear that
[TABLE]
Therefore, we have that
[TABLE]
There exists such that
[TABLE]
There cannot be a and such that and because this would imply that
[TABLE]
which is a contradiction. Finally, because is continuous and for all , there exists such that
[TABLE]
For this value of we can conclude that never hits after hitting . The trajectory is the claimed concluding the proof of the lemma. ∎
Proof of Lemma 7.5.
We begin with the lower bounds.
Let us first prove (7.3). Using Lemma 6.4 and the fact that for all , by choosing small enough we can guarantee that for any there exists such that , , and .
If , then there exists some , with the property that , , for . By decreasing we can guarantee that does not hit after hitting , see Lemma 7.8.
By Assumption 4.2 and the fact that , there exists such that . By Assumption 4.3 for all . By Theorem 5.7, there exists such that , , and
Concatenate these paths letting
[TABLE]
Then , , does not hit after leaving , and . We can choose small enough so that any with the property will not hit after hitting and will reach one of the or the boundary . Then
[TABLE]
By the LDP lower bound, (7.3) follows.
Now we prove (7.5). Let respond to the in Theorem 5.7. Let . is compact by Corollary 5.23. Therefore there exists a finite collection such that . By Assumption 4.2, there exists a finite collection of such that and . Therefore . Additionally, by the continuity of the unperturbed equation with respect to the initial condition (Theorem 5.2), we can choose these such that
[TABLE]
Let and let be such that . By Theorem 5.7 there exists a path such that , and . By definition of we have that and for all . There exists such that . By Theorem 5.7 there exists a path such that , , for , and . We next concatenate the two paths and to get the path such that , , and . By Theorem 5.7, and (7.14), for all . Consequently, for . Since , there exists such that for all .
Therefore, we have the inclusion
[TABLE]
We can conclude from the LDP lower bound (4.3) that
[TABLE]
Now we do the arguments for the upper bounds. By Lemma 7.7, for any given , there exists such that for all , . A consequence is that any path with the property that and has the property that . Therefore we have the containment for any and ,
[TABLE]
We will be able to get the positive distance in the set on the right-hand side because Lemma 7.7 states that paths cannot reach . The set on the left-hand side of the above expression is a set of paths that reach . This means that such paths need to be at least distance from the level sets.
By the strong Markov property we can restart the process at when the process first reaches to see that
[TABLE]
For to be chosen later, we can decompose the events
[TABLE]
Let be big enough so that Lemma 7.3 guarantees that
[TABLE]
By (7.1.1) along with the LDP upper bound (4.4) it follows that
[TABLE]
It follows from (7.16) and (7.1.1) that
[TABLE]
proving (7.6). The proof of (7.4) is similar and thus omitted. ∎
Now we define some stopping times for the Markov chain. Let
[TABLE]
Lemma 7.9**.**
Given there exists such that for all , for any , ,
[TABLE]
[TABLE]
and for any ,
[TABLE]
Proof.
Fix . We decompose the event over all of the possible values of . By the strong Markov property,
[TABLE]
Then (7.18) follows from (7.6) and (7.5) using the estimate
[TABLE]
(7.20) follows from (7.4) and (7.3).
(7.19) is a simple consequence of (7.5) and the fact that
[TABLE]
∎
7.1.2 Proof of upper bound (4.18)
Fix . Let , be defined as in Section 7.1.1. We reorder these sets so that
[TABLE]
are in increasing order . Let us recall
[TABLE]
Set . Notice that
[TABLE]
First we derive a lower bound on .
Lemma 7.10**.**
For any and ,
[TABLE]
Remark 7.11*.*
Notice that , , were defined in terms of instead of . Validity of this Lemma 7.10 with the defined in terms of would actually imply that lower and upper bounds for the exit shape distribution match in Theorem 4.9, which would yield a large deviations principle for the exit shape distribution. We believe that Lemma 7.10 is not true when the are defined in terms of unless we impose extra assumptions on our domain . This is the reason that we introduced in (4.14) and defined the in terms of this quasipotential. We will come back to this issue in Section 8.
Proof of Lemma 7.10.
Fix . The result is trivial if or We assume that and
Because is compact, Theorems 5.20 and 5.22 imply that there exist minimizers , and such that
[TABLE]
We also observe that for any ,
[TABLE]
Let and be given. Because , there exists and such that , for all and
[TABLE]
Because is a equivalence class and , Lemma 5.24 guarantees that there exists and such that , for all and
[TABLE]
Because , there exists and such that , , for all and
[TABLE]
Now we concatenate by setting and
[TABLE]
Notice that and has the properties that , , for all and
[TABLE]
By the definition of ,
[TABLE]
Therefore,
[TABLE]
Because and were arbitrary, we can conclude that
[TABLE]
proving the theorem.
∎
Define the stopping times for
[TABLE]
Unfortunately our set-up does not satisfy the assumptions of Lemma 6.3.3 in [18] because there is no distance between the and . We now establish a similar result in our setting.
Lemma 7.12**.**
For any , there exists such that for all and for any
[TABLE]
Proof.
We prove this using an induction-like argument. The case is an immediate consequence of (7.18) and (7.22) because and because by construction .
Now assume that we have already proven the result for and for all . Now we prove it for . There are several ways that our Markov chain can satisfy and . The Markov chain can go from to and back to any number of times . Then the process can go directly from to or it can go from directly to any of the and then hit before hitting the boundary , again or for any .
[TABLE]
For small enough , (7.5) guarantees that for small
[TABLE]
Then the infinite sum in (7.1.2) can be bounded by
[TABLE]
As for the finite sum in (7.1.2), equations (7.18) and (7.22) (or (7.20) if ) tell us that for small enough and and any ,
[TABLE]
By the inductive step, for and small enough and ,
[TABLE]
Then by (7.1.2), (7.34), (7.35), and (7.36),
[TABLE]
and consequently
[TABLE]
We are almost done with the proof. We have proven (7.32) for . It remains to prove the result for and . For such we observe that
[TABLE]
By choosing and small enough, we can bound the above expression by
[TABLE]
Therefore,
[TABLE]
∎
Now we can complete the proof of (4.18).
Proof of (4.18).
If the initial condition , then the probability of the exit shape belonging to is less than the probability of the Markov chain reaching before reaching . In particular, if ,
[TABLE]
By Lemma 7.12,
[TABLE]
If , then because of the fact that is the domain of attraction of , there exists a small (depending on ) such that
[TABLE]
By the strong Markov property, for any
[TABLE]
By (7.21) the above expression is less than and the result follows because was arbitrary.
∎
7.2 Proof of lower bound (4.17)
Let and be given. For let us set
[TABLE]
and
[TABLE]
Let be given as in Assumption 4.6 and . Then Lemma 7.3 holds with . With only a slight modification of what we did earlier in this section we define
[TABLE]
With these definitions and for .
Similarly to our construction of the Markov chain defined earlier in this section, we now we define the Markov chain taking values on . Notice now that the set used for the upper bound has been replaced by for the lower bound.
Lemma 7.13** (Transition probabilities).**
For any there exists such that for all with
[TABLE]
In addition, we have
[TABLE]
Proof of Lemma 7.13.
Using Theorem 5.7 and the fact that for all , by choosing small enough we can guarantee that for any there exists such that , , and .
If , then (7.37) holds trivially. If , then there exists and such that , , for all , and .
Let us now set , i.e., the first time that reaches . Because , we have that . In addition, since for all , , we get that for all and all , . Thus, for sufficiently small we can also have that for all and all , .
Let us set now and for define
[TABLE]
and note that
[TABLE]
There exists sufficiently small such that any path with the property that has the property that for and . Such a will enter before touching any other . Thus, the large deviations lower bound (4.3) yields
[TABLE]
proving (7.37).
The argument for (7.38) is basically the same as that of (7.6) and (7.4) and thus we omit its proof. ∎
Lemma 7.14**.**
For any , there exists such that for all with ,
[TABLE]
Proof.
Let . By Lemma 5.11, there exist and such that whenever is a controlled trajectory with , , then whenever ,
[TABLE]
We can choose . Furthermore, Theorem 5.7 guarantees that by possibly decreasing and letting , we can construct a path connecting any to as long as . By Assumption 4.2 and the fact that , there exists such that . By Theorem 5.7, for any there exists such that , and . By (7.40) we also know that for all . By Assumption 4.3 and Remark 4.4, .
Let . Then, we get the estimate
[TABLE]
If follows near , then it definitely exits and it stays within of the whole time. By the LDP lower bound,
[TABLE]
∎
Let us recall now the definition
[TABLE]
Lemma 7.15**.**
For any , there exists such that for all with ,
[TABLE]
Proof.
Decomposing the event of interest over all possible values of gives,
[TABLE]
Then (7.41) follows from (7.37) and (7.38). ∎
Now, we can finally proceed with the proof of the lower bound (4.17) for general .
Proof of (4.17).
Fix , , and . We observe that for any ,
[TABLE]
By the strong Markov property,
[TABLE]
It follows from (7.41) and (7.39), that for small enough ,
[TABLE]
We can use the strong Markov property to show that (7.42) holds for any initial condition , and not just for . Let and let be small enough for (7.42) to hold. Possibly decrease the value of to guarantee that , guaranteeing in particular that for . Because and is a domain of attraction for ,
[TABLE]
Then by (7.42) and the strong Markov property,
[TABLE]
The result follows because for all and because was arbitrarily chosen. ∎
8 LDP for exit shape under extra assumptions
In Section 7 we proved Theorem 4.9, which characterizes the large deviations lower and upper bounds for the exit shape . In this section, we show that under additional conditions the lower and upper bounds match, leading to a large deviations principle for the exit shape .
As we mentioned in Remark 7.11, Lemma 7.10 is the only step of the proof of the LDP upper bound for the exit time (4.18) that requires us to use instead of . Analogously to our setup section 7.1.2, but defining sets in terms of instead of , for and let
[TABLE]
and set
[TABLE]
ordered so that is increasing.
Assumption 8.1**.**
Assume that we can prove the following strengthened version of Lemma 7.10. For any and ,
[TABLE]
Under Assumption 8.1, we can prove the following strengthened version of Lemma 7.12 using the same proof.
Lemma 8.2**.**
For any there exists such that for all and for any
[TABLE]
Then we can prove under Assumption 8.1 that the exit shape will satisfy a large deviations principle with respect to the rate function .
Theorem 8.3**.**
In addition to the assumptions for Theorem 4.9 let Assumption 8.1 hold. Then the exit shape satisfies a large deviations principle with rate function as defined in Theorem 4.9.
Theorem 8.3 follows from Lemma 8.2 using the arguments from section 7.1.2.
We conclude by discussing what is required for Assumption 8.1 to hold. In the finite dimensional situations considered by [18] and [13], the authors assumed that the boundary of the attracting set was sufficiently smooth. Up to this point in this paper we have not made any assumptions about the regularity of the and we were able to prove Theorems 4.5 and 4.9 without assuming boundary regularity. One necessary ingredient for Assumption 8.1 to hold, however, is that the boundary is sufficiently regular near the . Interestingly, our formulation of makes it unnecessary to impose any regularity assumptions on the rest of . Of course, characterizing boundary regularity is quite a challenge in infinite dimensional settings.
If one can formulate a necessary condition for boundary regularity near the , then we would also need a version of Theorem 5.7 that can connect initial conditions near to controlled trajectories that start near in a way where those trajectories do not leave and do not increase the rate function by much. We proved Lemma 7.10 by building a trajectory that connects approximately minimizing trajectories of and in such a way that the connecting trajectory has an arbitrarily low rate function and stays arbitrarily close to (but possibly exits ). In order for Assumption 8.1 to hold, we need to be able to build similar connecting trajectories with arbitrarily low rate function that do not leave .
In the case of a stochastic Allen-Cahn equation studied in [16], Faris and Jona-Lasinio characterize the sets, which are all singleton sets of unstable equilibria. Furthermore, Faris and Jona-Lasinio characterize the stable and unstable eigenfunctions of the second derivative operator of the dynamics at these equilibria. We believe that in this specific case, one may be able to use these eigenfunctions to prove that the boundary of is sufficiently well-behaved near the and to prove that Assumption 8.1 is valid for the stochastic Allen-Cahn equation. Ultimately such calculations are outside the scope of the present paper and we leave this for future work.
Appendix A Proof of Theorems 3.2 and 5.1
Let us first present the proof of Theorem 3.2. In preparation for that let us prove some intermediate results. Let us consider . We study the solution to
[TABLE]
Theorem A.1**.**
For any , is well-defined.
There exists such that for any ,
[TABLE] 2. 2.
For any there exists such that for any satisfying for ,
[TABLE]
Proof.
Let us set . Let such that
[TABLE]
By assumptions (2.7) and (2.8), and the dissipativity of we get
[TABLE]
Let and let
[TABLE]
Because , . Because is, by definition, the first time that achieves this level, must be increasing at . But at
[TABLE]
contradicting the fact that is increasing. This contradiction proves that and therefore, there exists a constant such that
[TABLE]
Because was arbitrary, there is a constant independent of , , , and such that
[TABLE]
for all .
For the Lipschitz continuity, note that is locally Lipschitz.
[TABLE]
where . Because is the space of continuous functions, is a convex combination of delta measures at maximizing and negative delta measures of minimizing . Without loss of generality, assume that is the delta measure at such that . Then, we get that because is a maximizer. By the local Lipschitz continuity of ,
[TABLE]
Therefore,
[TABLE]
By Hölder’s inequality, for any ,
[TABLE]
The above equation along with a standard contraction mapping argument prove the well-posedness of . ∎
For any let be defined by .
Corollary A.2**.**
The mapping is well-defined and
There exists such that for all ,
[TABLE] 2. 2.
For any and , there exists such that if , ,
[TABLE]
Now we show that as long as the nonlinearity satisfies Assumption 2.1, we can bound and in ways that are independent of the initial condition. For this purpose, for and , let
[TABLE]
The well-posedness of is a consequence of Theorem A.1.
Theorem A.3**.**
There exists a constant independent of , , and such that for any ,
[TABLE]
Proof.
For notational simplicity, let . For any ,
[TABLE]
By (2.7) and (2.8), along with the dissipativity of
[TABLE]
Now we analyze .
[TABLE]
By Young’s inequality there is a large constant such that
[TABLE]
Therefore,
[TABLE]
Because t^{\frac{1}{\rho_{*}}}|v(t)|_{E}\bigg{|}_{t=0}=0, the arguments in the proof of Theorem A.1 guarantee that
[TABLE]
We can conclude that there is a constant independent of , , , and such that
[TABLE]
Consequently,
[TABLE]
This bound is independent of . ∎
Now, we are ready to prove Theorem 3.2.
Proof of Theorem 3.2.
First, let us set
[TABLE]
By (A.1), we have that
[TABLE]
Then
[TABLE]
proving (3.5).
Next, let . Then by (A.2)
[TABLE]
Hence, we obtain
[TABLE]
proving (3.6).
Lastly, we prove (3.7). By (3.6), we can choose (where is the constant from (3.6)). It follows that
[TABLE]
By the Chebyshev inequality and (3.4), it then follows that (3.7) holds. ∎
We conclude this section with the proof of Theorem 5.1.
Proof of Theorem 5.1.
Let
[TABLE]
By (3.1), (2.12), and the Hölder inequality,
[TABLE]
Let . Then
[TABLE]
and by (A.1), for any ,
[TABLE]
Therefore it follows that
[TABLE]
It follows from (A) that
[TABLE]
and (5.1) holds.
On the other hand, we can let so that
[TABLE]
It follows from (A.2) that
[TABLE]
Then
[TABLE]
Now we demonstrate that the in front of the term in (A.5) can be removed. If , then so (5.2) holds. On the other hand, if , then where . Therefore, by (A.5),
[TABLE]
proving (5.2).
∎
Appendix B Time reversed processes
We show that if solves
[TABLE]
with initial condition , then the reversed dynamics satisfy where and is defined in (4.1).
The most important first step is to study the regularity of the semigroup convolution. For let
[TABLE]
Lemma B.1**.**
* is a bounded linear operator from to *
Proof.
Let and set , where form a CONS of that diagonalizes as described in Section 2. For any ,
[TABLE]
As for the bound, we calculate that
[TABLE]
By Young’s inequality for convolutions,
[TABLE]
Therefore,
[TABLE]
∎
Lemma B.2**.**
If , then and
[TABLE]
Proof.
The fact that is the definition of being a semigroup on . As for the bound, if we let ,
[TABLE]
∎
Lemma B.3**.**
If , then .
Proof.
Lemma B.2 guarantees that . Lemma B.1 guarantees that
[TABLE]
We know that and that there exists such that for all , . We also have bounds on the growth on (see (2.8)) and can therefore conclude that
[TABLE]
The proof is then concluded by the a-priori bounds of Theorem 5.1. ∎
Theorem B.4** (Energy of a reversed path ).**
Let and . Let . That is, is a time-reversed version of the dynamics with terminal point . Then it follows that
[TABLE]
where and is independent of and .
Proof.
Let . Then is a weak solution to (B.1). Let and . Then is a weak solution to
[TABLE]
Letting and , we can write . The energy of the control is bounded by (applying (2.15) and Lemmas B.1 and B.2)
[TABLE]
∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] F. Barret, Sharp asymptotics of metastable transition times for one dimensional SPD Es, Ann. Inst. H. Poincaré Probab. Statist. , Vol. 51, No. 1, (2015), pp. 129–166.
- 2[2] N. Berglund and B. Gentz, Sharp estimates for metastable lifetimes in parabolic SPD Es: Kramers’ law and beyond, Electron. J. Probab. , Vol. 18, No. 24, (2013), pp. 1–58.
- 3[3] N. Berglund, G. Di Gesù and H. Weber, An Eyring-–Kramers law for the stochastic Allen–-Cahn equation in dimension two, Electron. J. Probab. , Vol. 22, No. 41, (2017), pp. 1–28.
- 4[4] A. Bovier, M. Eckhoff, V. Gayrard and M. Klein, Metastability in reversible diffusion processes 1. Sharp estimates for capacities and exit times, J. Eur. Math. Soc. , Vol. 6, No. 4, (2004), pp. 399-424.
- 5[5] A. Bovier, V. Gayrard and M. Klein. Metastability in reversible diffusion processes II: Precise estimates for small eigenvalues, J. Eur. Math. Soc. Vol. 7, No. 1, (2005), pp. 69-99.
- 6[6] A. Budhiraja, P. Dupuis, and M. Salins, Uniform large deviatoions principles for Banach space valued stochastic differential equations, Trans. Amer. Math. Soc. , Vol. 372, (2019), pp. 8363-8421.
- 7[7] S. Cerrai, Smoothing properties of transition semigroups relative to SD Es with value in Banach spaces, Probab. Theory Related Fields , Vol. 113, No. 1, (1999), pp. 85–114.
- 8[8] S.Cerrai, Stochastic reaction-diffusion systems with multiplicative noise and non-Lipschitz reaction term, Probab. Theory Related Fields , Vol. 125, No. 2 (2003), pp. 271–304.
