Abstract
The Cauchy–Dirichlet problem for the superquadratic viscous Hamilton–Jacobi equation (VHJ) from stochastic control theory, admits a unique, global viscosity solution. Solutions thus exist in the weak sense after appearance of singularity, which occurs through gradient blow-up (GBU) on the boundary. Whereas viscosity solution theory has been extensively applied to many PDEs, there seem to be less results on refined singular behavior of solutions. Although occurrence of two types of GBU, with or without loss of boundary condition (LBC), are known, detailed behavior after GBU has remained open except for a strongly restricted special class of one dimensional solutions.
In this paper, in general dimensions, we construct solutions which undergo GBU with LBC arbitrarily many times and then recover regularity, as well as solutions without LBC at first GBU time. In one space dimension, we obtain the complete classification of viscosity solutions at each time, which extends to radial case in higher dimensions. Furthermore we show the existence of solutions exhibiting an arbitrarily given combination of GBU types with/without LBC at multiple times, in which a new type of behavior called “bouncing” is discovered.
Global weak solutions of VHJ with multiple times singularity turn out to display larger variety of behaviors than in Fujita equation. We introduce a method based on an arbitrary number of critical parameters, whose continuity requires delicate arguments. Since we do not rely on any known special solution unlike in Fujita equation, our method is expected to apply to other equations. Singular behaviors at multiple times are completely new in the context of VHJ but also of stochastic control theory. Our results imply that for certain spatial distributions of rewards, if a controlled Brownian particle starts near the boundary, then the net gain attains profitable values on different time horizons but not on some intermediate times.
Keywords
Introduction and main results
Problem
We consider the initial boundary value problem for the viscous Hamilton-Jacobi equation:
By standard theory [19], problem (1.1) admits a unique, maximal classical solution u satisfying
Whereas the theory of viscosity solutions (cf. [12]) has been extensively studied and applied to many partial differential equations, there seem to be less results on refined behavior of the weak solution. Our purpose is to investigate the behavior of the global viscosity solution u for
On the other hand, it was shown in [35] that u becomes a classical solution again for all sufficiently large time, i.e. there exists
In view of the very large literature devoted to the viscous Hamilton–Jacobi equation, this introduction makes no attempt to be exhaustive. For other aspects of (1.1) and related problems, we refer to, e.g., [2,4,5,9–11,13–15,17,21,23,24,32,37–39,41] and the references therein.
Applications to stochastic control problems
Let us recall that (1.1) arises in stochastic control problems. Namely, consider the controlled n-dimensional stochastic differential equation
Results in general domains
Our first main result in general domains is the following. It shows the existence of solutions undergoing GBU with losses and recoveries of boundary conditions at arbitrarily many times.
Let
We can also show that the scenario in Theorem 1.1 can be preceded by the first GBU without LBC. Let ∙ GBU without LBC at ∙ and then at least m losses and recoveries of boundary conditions; namely there exist times
We will obtain more precise results in the case of
Set
The following two theorems are our main one-dimensional results. The first one gives a classification of all possible behaviors at any time, for any viscosity solution to problem (1.1).
Let
(i) The set
(ii) On each interval between two consecutive times
∙ classical up to
∙ or of LBC type at
Our results also answer another question left open in [34]: as a consequence of Theorem 1.3, we see that waiting time phenomena cannot occur, at least in one space dimension. Once a solution undergoes gradient blowup, the solution either loses boundary conditions immediately or is immediately regularized.
The next result is in some sense the reciprocal of Theorem 1.3. It shows that any given finite sequence of behaviors a priori permitted by Theorem 1.3 is actually realized for suitable choice of initial data. In the following, the letters
Let
for each
u is classical up to
Typical behaviors given in Theorems 1.3 and 1.4 are illustrated in Fig. 1–3.
The name transition set for

A solution with exactly 4 losses and recoveries of boundary conditions.

A solution with exactly 1 bouncing.

A solution with mixed behaviors (2 LBC, 2 GBU without LBC and 1 double bouncing).
(i) Assume
(Radial case in higher dimensions).
Consider (1.1) in the case that Ω is a ball or an annulus in
(Further development).
Our solutions given in Theorem 1.4 lose at most two intersections with
Differences from Fujita equation
Blow-up problems in nonlinear parabolic equations have been studied the most extensively for the so-called Fujita equation
Whereas complete blow-up solutions of the Fujita equation (1.14) cease to exist in any weak sense at blow-up time, solutions of (1.1) undergoing GBU with LBC continue to exist in viscosity sense after blow-up time and recover regularity after a while. This makes the description of behavior of viscosity solutions after blow-up time more complicated than in (1.14). In other words, when a radial solution of (1.14) undergoes blow-up at multiple blow-up times, only the immediate regularization is possible except at final blow-up time. On the contrary, various combinations of GBU with LBC and without LBC turn out to occur in (1.1), including the new type of behavior called bouncing. Accordingly, as we shall explain in the next subsection, we introduce a method based on an arbitrary number of critical parameters, whose continuity requires a delicate argument. Since we do not rely on any known special solution unlike in the proof for Fujita equation, our method is expected to apply to other equations.
Ideas of proofs
(i) The main idea of the proof of Theorem 1.1 is as follows. We construct a multiscale, compactly supported initial data, made of m, suitably rescaled, bumps which are located farther and farther from the boundary. The distribution of the sizes and locations of the bumps in terms of the distance to the boundary is rather delicate and the construction has to be made in a recursive way. The bump which is closest to the boundary generates the first GBU and LBC. The second bump is much farther from the boundary and its influence becomes significant only after some lapse of time, leaving enough time for the solution to get regularized by an effect of the diffusion, before producing a second GBU and LBC. Repeating the process, we construct an m-bump initial data which leads to a solution undergoing GBU and LBC (at least) m times.1
Although the above description is more convenient for heuristic purposes, the actual construction is done in the converse direction, first constructing the bump which is farthest from the boundary.
(ii) The basic idea of the proof of Theorem 1.3(i) is to show that
(iii) The proof of Theorem 1.4 is rather long and delicate. It is based on a modification of the multibump construction in the proof of Theorems 1.1 combined with deformation, zero number and recursion arguments. More precisely we construct a multi-parameter family of initial data based on suitable deformations of multibumps initial data, and the desired solution is obtained by iteratively selecting appropriate critical values of the parameters. The required continuity properties of the critical parameter functions rely upon zero number arguments applied to the difference of two solutions, whereas the exact structure of the resulting solution depends on dropping properties of the number of intersections with
Throughout the paper, we shall denote the function distance to the boundary by
We start by recalling (see, e.g., [34,35]) that (1.1) can be approximated (away from the boundary) by the truncated problems
We next give two versions of the comparison principle that will be used repeatedly in what follows. The first one is a standard comparison principle for sub-/supersolutions (see e.g. [40, Proposition 2.1])
Let ω be any bounded open subset of
The second one is a suitable form of the comparison principle for viscosity solutions. A key point is that comparison is guaranteed although we only assume
Let
For convenience, we give a short proof.
Consider the smooth solutions
The solution u satisfies the following continuous dependence estimate with respect initial data (see e.g. [34, Theorem 3.1]):
We next recall (see [8]) that the existence of a unique global viscosity solution u of (1.1), with
Let
The time τ can be chosen uniform in terms of
Altough Proposition 2.3 does not seem to have appeared in the literature, it is essentially a consequence of Bernstein-type and approximation arguments from [35]. Since the motivation in [35] was ultimate regularization for large time, we need to adapt them to our present purpose and we give a full proof for completeness. Let As in the proof of Proposition 2.2, we next introduce a sequence of truncated problems, this time with slightly better behaved truncated nonlinearities. For each integer Now, following [35], in order to obtain gradient estimates for It remains to show that
Finally, since U is in particular a viscosity solution, it has to coincide with the unique viscosity solution u. This in turn guarantees the uniqueness of U. The proof of Proposition 2.3 is complete. □
For each
In our first proposition, we show that LBC in short time occurs for suitable initial data, with support concentrated near the boundary and precisely controlled, small
(i) There exists
(ii) Let
Our second proposition gives a regularity property for the solution at suitable times, depending on the behavior of the initial data at given distance from the boundary.
Let
Consider the following problem
Next pick some point
Now, following [24], we consider the following rescaled functions:
(ii) The argument is similar, now considering the problem
For the proof of Proposition 3.2, we need two lemmas. Our first simple lemma gives a pointwise control from above with linear growth in time.
Let
Set
Our second lemma shows that the solution becomes classical again after some short time, provided it is suitably controlled in amplitude2
We stress that, unlike in more standard criteria, we do not assume any control of the gradient of the solution near the boundary.
There exist
We modify a comparison argument from [35] (see [35, Lemma 3.2]). Let
Fix
Finally set
Let
Fix
Now set
For future reference, we note that since
We next turn to the proof of Theorem 1.2. We shall use the following uniform lower bound from [17] on the boundary gradient blow-up profile of maximal classical solutions. First recall that, thanks to the regularity of Ω, we can find
Let
Proposition 4.1 was essentially proved in [17] (see Proposition 5.2 and estimate (1.13)), except for the uniform dependence of η. The latter can be easily checked along the proof, using the fact that the Bernstein estimate
It is based on a modification of the proof of Theorem 1.1 and a limiting argument. Let Next let
On the other hand, by definition, there exists a sequence
Let us first recall the following estimates from [34] (see [34, Lemmas 5.1–5.4]).
Let
(i) For all
(ii) Let
We shall use also the following simple lemma, which connects the sign of
Let
Set
First assume
Next assume
The following lemma will enable us to compare
Let
(i) Assume that
(ii) Assume that
First observe that if the function
Let us first assume (5.10). Suppose for contradiction that (5.11) fails, i.e.
Let us next assume (5.12) and (5.13). Suppose for contradiction that (5.14) fails, i.e.
The lemma is proved. □
The next lemma shows that the solutions
Let
Let
We start with the following intersection properties. Note that these properties are well known for classical solutions, but are not standard in the context of viscosity solutions.
Let
(i) For any
(ii) For any
(iii) For all
We shall also establish a monotonicity property for the number of intersections of two solutions, which will be used in the proof of Theorem 1.4. Actually, we will need to compare solutions of problem (1.1) on different space intervals. To this end, for any
Let
The next result shows that the assumption
There exists
In the proof of Proposition 6.1 we shall use the following two lemmas.
Let
Let
Let
Set
Fix
First of all, we have
In view of the proof of assertions (ii)(iii), we prepare the following lemma which gives a more general property of the zero number on intervals
Let
It suffices to consider the case
We claim that for each The first part of assertion (ii) is a direct consequence of Lemma 6.6. The second part follows from the fact that, by the strong maximum principle,
To prove assertion (iii), taking Let We next claim that for each The monotonicity of Fix Now taking
Define the sets:
Next, for all
The goal of this section is to prove the following two propositions. The first one guarantees immediate loss of boundary conditions (resp., regularization) at any time at which the solution dominates (resp., is dominated by) the singular steady state near the boundary. Moreover, the recovery of boundary conditions or loss of regularity cannot occur as long as the intersection number remains constant.
Let
(i) If
(ii) If
Our second proposition shows that the intersection number has to drop at any transition time
Let
In view of the proof of Propositions 7.1 and 7.2 we need the following two lemmas.
Let
Set
Next, by (7.1), there exist
Now, the set
Let
(i) If
(ii) If
(i) By Lemma 7.3 there exists
Fix
(ii) By our assumptions and (1.5), there exist
With Lemmas 7.3 and 7.4 at hand we can now turn to the proof of Propositions 7.1 and 7.2.
Set
(i) Assume for contradiction that
Case 1: there exists
Case 2:
Therefore, there exists
(ii) By our assumption, there exists
Case 1: there exists a sequence
Case 2: there exists
Let
By continuity, there exists
The last statement of the proposition follows from the fact that, when
We end this section with the following variant of Lemma 7.3, concerning the number of intersections of two solutions, which will be useful in the proof of Theorem 1.4.
Let
It is completely similar to the proof of Lemma 7.3, replacing
We first give a simpler proof of Theorem 1.3(i) in a special but already representative case.
Set
We now turn to the proof of Theorem 1.3(i) in the general case. Since N need not be monotone in general (cf. Proposition 6.3), the proof is more delicate. We shall show that, around any transition time
Let
We need to carefully control the zeros of Case A. Case B. In each case, by Lemma 6.6 and Proposition 7.2 there exists Case 1. Case 2. Set Let Let Case 1: there exists Case 2: Finally, by (8.16) and parabolic estimates we conclude that u is a classical solution on
It is convenient to first state and prove the following special case of Theorem 1.4, whose proof, based on Theorem 1.1 and on a simple application of zero number, is considerably easier but will serve as a starting point for the general case.
Let
It follows from Theorem 1.1 that there exists
Solutions are described in Theorem 1.4 by arbitrary finite sequences
Let
∙ if
∙ if
Moreover, u is classical up to
The integer

The times
In Theorem 9.1 (via Theorem 1.1), we have constructed multibump initial data such that the corresponding solutions satisfy
An additional difficulty now is that, whereas multibump solutions with separated LBC time intervals should be rather stable, the phenomena of GBU without LBC or of bouncing are expected to be unstable. To produce an arbitrary solution as in the statements of Theorem 1.4/1.4’, the idea is to deform this multibump initial data by performing one of the following three operations on each space bump
Reduce the amplitude of
(if
Leave
We will actually make a continuous deformation along operations (1) and (2) above, leading to a suitable q-parameter family of initial data
In view of the proof, we need two propositions. The first one gives the building blocks of our multibump construction, namely the individual bumps and the linking functions between two bumps (cf. Fig. 5).
(i) There exist
(ii) Let

The functions in Proposition 9.2 (the function h is the dotted curve).
In order not to interrupt the main flow of ideas, the proof of Proposition 9.2, which is somewhat technical, is postponed to the appendix.
In the second proposition, we prepare the preliminary sequence of bumps

The bumps and linking functions in Proposition 9.3 (for
Let the constants
In view of the application of Proposition 3.2, bumps will be sequentially added by moving toward the boundary
Observe that, by (9.9) and (9.23), we have
Finally, we define
Let us compute the number m of space bumps, and the deformation type of each bump, in terms of the given sequence
The numbers
The bumps 
We construct a q-parameter deformation of
Setting
For all
Sign changes of 
On the other hand, we observe that, for all
Define the times
Time behavior of the deformed solutions for 
We claim that for all
Time behavior of the deformed solutions for 
Let us first check the regularity properties in (9.41) and (9.44). Let
Next assume
As for the LBC properties, (9.42) and the second part of (9.43) follow from (9.8). To check the second part of (9.44), note that if
For any
We shall iteratively define q critical parameter functions
For further use, we immediately note by induction that each of the functions
Let
We shall prove by joint induction that, for all
To initialize the induction, we observe that the continuity property (9.51) is true for
Here and below this notation of course means that the formulae are understood with the index j replaced by the index in subscript (here
First observe that, for all
To prove
We next assume
We now turn to the proof of the lower semicontinuity in
To reach a contradiction, the idea is now to apply the natural scaling to w and to examine the dropping properties of their number of intersections with the solution v. Namely, for
Let
Next, writing
Finally, in view of (9.63) and since the intervals
As for property
We observe that, for all
In order to conclude, it remains to enumerate the other elements of

Indeed, the first case in (9.77) is guaranteed by (9.73)–(9.74) and the second case by (9.41)–(9.42) and Theorem 1.3(ii). To check the last case, by (9.26), we see that for each
Now, by Proposition 7.2, (9.30) and (9.77), for all
Footnotes
Appendix
We here prove Proposition 9.2. The proof of assertion (ii) will use the following simple lemma.
Acknowledgements
NM is supported by the JSPS Grant-in-Aid for Scientific Research (B) (No.20H01814). PhS is partially supported by the Labex MME-DII (ANR11-LBX-0023-01).
