1 Introduction
We consider a pure iron steel in contact with an aqueous solution of sodium chloride (NaCl). One of the major failure mechanisms in aggressive aqueous solution is pitting corrosion. It is generally associated with the presence of a special anion, namely the chloride ion. The presence of such an ion leads to the formation of small isolated holes (pits) in the surface of the steel that may reach a considerable depth. Thus, the life cycle of a stainless alloy decreases in the presence of corrosion. For many decades, several computational models have been developed to study and predict the time evolution of pitting corrosion. The objective of these models is to provide powerful means to simulate the propagation of localised corrosion, mainly pitting corrosion, in various environments, and to reduce its impact. In this article, we focus on a physical model which aims to describe the propagation process of one individual corrosion pit. To do so, we consider the one-dimensional mathematical model given in the following references [Reference Scheiner and Hellmich16, Reference Scheiner and Hellmich17]. The model describes a pit growing in stable corrosion mode which refers to the case where propagation of the pit occurs for long periods of time since critical conditions inside it prevents the stop of its propagation [Reference Scheiner and Hellmich17]. Such a case is possible once a salt film is formed at the bottom of the pit.
In this model, we only describe the evolution of the metal atom concentration C that arises from pit dissolution. The evolution of the chloride concentration as well as the sodium concentration are not taken into account. Figure 1 represents a one-dimensional stable pit where corrosion only occurs at the bottom of the pit (the walls of the pit do not move). Note that a one-dimensional pit should be represented as an interval with moving boundary
$[0,z_{d}(t)\big)$
but in order to indicate all the necessary physical parameters, we represent it as a rectangle in Figure 1.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_fig1.png?pub-status=live)
Figure 1. A one-dimensional corrosion pit.
It is composed of the following domains:
-
(1) Solid metal with temporally and spatially constant metal atom concentration. In the following, we represent the metal atom concentration by
$C_{\rm sol}$ .
-
(2) Salt film at the pit bottom: the metal ions released from the solid metal combine with chlorides in the solution, forming metal chloride salt at the bottom of the pit. The more ions are released, the more salt is formed, until the saturation concentration of the salt is reached [Reference Scheiner and Hellmich17]. Thus, at the bottom of the pit, the iron ion concentration remains constant and equal to the saturation limit
$C_{\rm sat}$ .
-
(3) Pit solution with temporally and spatially varying concentration of dissolved iron ions. Their concentration is laying below the saturation concentration:
$C(z,t)< C_{\rm sat}$ .
-
(4) Bulk solution outside of the pit, characterised by the vanishing iron ion concentration
$C=0$ .
The depth of the pit is given by
$z_{d}(t)$
which indicates the position of the moving boundary at time
$t>0$
for suitable initial conditions for
$z_{d}$
and C.
2 The physical model
The physical model is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn1.png?pub-status=live)
where
$D>0$
is the diffusion coefficient of the iron ions,
$z_{d}(t)^{-}$
refers to the liquid side of the moving boundary and
$C_{\rm sol}> C_{\rm sat}$
.
In the following paragraph, we focus our study on the influence of two input parameters: the diffusion coefficient D and the saturated concentration
$C_{\rm sat}$
in Problem (2.1). These two parameters play an important role to understand the evolution of the pit depth as a function of time.
Choice of the input parameters:
In view of literature, we have found some possible values of D and
$C_{\rm sat}$
. Indeed, it was mentioned that in the case of a one-dimensional pit, a reasonable approximation of the value of D is in the range
$\left[7.10^{-6} , 10^{-5}\right]$
$\left(\rm cm^{2}.s^{-1}\right)$
[Reference Srinivasan, Liu and Kelly18] while the value of
$C_{\rm sat}$
can be equal to
$5.02\; \rm{mol/L}$
[Reference Srinivasan, Liu and Kelly18] or
$4.2\; \rm{mol/L}$
[Reference Srinivasan, McGrath and Kelly19]. In [Reference Scheiner and Hellmich17], these parameters were set to
$0.85\times 10^{-5}\, \rm cm^{2}.s^{-1}$
for the diffusion coefficient and to
$5.1 \; \rm{mol/L}$
for the saturated concentration value. Thus, we will focus on these values to describe the evolution of the physics of the corrosion phenomenon. On the other hand, the value of the metal concentration
$C_{\rm sol}$
will be set to
$143 \; \rm{mol/L}$
[Reference Scheiner and Hellmich17].
Effect of the diffusion coefficient on the evolution of the pit depth:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_fig2.png?pub-status=live)
Figure 2. Initial distribution (at
$t=0$
) of the concentration of iron ions in the pit solution for initial pit depth
$z_{d}(0)=1 \; \rm{\mu} m$
.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_fig3.png?pub-status=live)
Figure 3. Evolution of the pit depth after 1000 h of pit propagation for several values of the diffusion.
In order to study the influence of the diffusion coefficient D on the propagation velocity, we perform several computations as a function of D for the following choice of the physical parameters
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn2.png?pub-status=live)
with the initial values given by (see Figure 2):
-
• Initial pit depth :
$z^{0}_{d}=1 \rm{\mu m}$ .
-
• At the pit entrance (
$z=0$ ) :
$C(0,0)=10^{-6} \; {\rm mol/L}$ .
-
• At the pit bottom
$\big(z=z_{d}(0)\big)$ :
$C(z_{d}(0),0)=5.1\; {\rm mol/L}.$
-
• In the pit solution
$\big(0<z<z_{d}(0)\big)$ :
$C(z,0)=$ linear profile from
$10^{-6} \; {\rm mol/L}\;$ at
$z=0$ to
$5.1 \; {\rm mol/L}\;$ at
$z=z_{d}(0)$ .
Figure 3 illustrates the evolution of the pit depth for several values of the diffusion coefficient. We show that the depth increases when D increases. Indeed, we show that after
$\rm Tf=1000$
h of pit propagation, if the diffusion coefficient increases by factor
$\lambda$
, the pit depth increases
$\approx \sqrt{\lambda}$
times.
The values
${z}_{d}^{\rm Tf}$
are the final depths computed by the numerical code.
Remark 2.1 Let
$\big(C_{1},z_{d,1}\big)$
be a solution of Problem (2.1) for
$D=1$
and an initial concentration
$C_{0}$
, then
-
•
$C_{D}(z,t)=C_{1}(z,Dt)$ ,
$z_{d,D}(t)=z_{d,1}(Dt)$ is a solution of Problem (2.1).
-
•
$\tilde{C}_{D}(z,t)= C_{1}\!\left(\displaystyle\frac{z}{\sqrt{D}},t\right)$ ,
$\tilde{z}_{d,D}= \sqrt{D}\; z_{d,1}(t)$ is a solution of Problem (2.1) with the initial condition
$C_{0}\!\left(\displaystyle \frac{z}{\sqrt{D}}\right)$ .
Effect of
$\textbf{C}_{\textbf{sat}}$
on the evolution of the pit depth:
In the case where
$D=0.85 \times 10^{-5}\; \rm cm^{2}. s^{-1}$
, Figure 4 shows a comparison of the evolution of the pit depth during 1000 h as a function of
$\sqrt{\rm time}$
(in
$\sqrt{\rm hours}$
) for several values of
$C_{\rm sat}$
.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_fig4.png?pub-status=live)
Figure 4. Evolution of the pit depth for several values of
$C_{\rm sat}$
during 1000 h.
The parameter
$C_{\rm sat}$
has an influence on the evolution of the pit depth. Indeed, for a fixed time, the most important pit depth is the one computed for the largest value of
$C_{\rm sat}$
.
Let us compare the two extremes values of
$C_{\rm sat}$
where
$C_{\rm sat,1}=5.1 \; {\rm mol/L}$
and
$C_{\rm sat,2}=140.2 \; {\rm mol/L}$
after 1000 h of pit propagation. For
$C_{\rm sat,1}=5.1 \; {\rm mol/L}$
, the pit depth is
$\approx$
1.51 cm while for
$C_{\rm sat,2}=140.2 \; {\rm mol/L}$
is
$\approx$
18.71 cm.
The ratio between the two depths is
$\displaystyle \frac{18.71}{1.51} \approx 12.3$
. Thus, we deduce that even if the value of
$C_{\rm sat}$
is very close to the value of
$C_{\rm sol}$
(which is not realistic), the pit depth increases only 12 times comparing to the more realistic case where
$C_{\rm sat}=5.1 \; {\rm mol/L}.$
Numerical simulations for the convergence to the self similar solution:
In this paragraph, we present some numerical results which illustrate the convergence of the solution
$(C,z_{d})$
of Problem (2.1) to a special solution
$\left(\widetilde{C}, \xi_{d}\right)$
. Indeed, by means of a change of variables using the self-similar variable
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn3.png?pub-status=live)
we can show (see [Reference Scheiner and Hellmich17] and also Section 5) that Problem (2.1) admits a self-similar solution
$\left(\widetilde{C}, \xi_{d}\right)$
(a special solution) given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn4.png?pub-status=live)
where
$\xi_{d}$
is the unique solution of the non-linear equation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn5.png?pub-status=live)
Numerical simulations illustrate the convergence for long time of the solution
$(C,z_{d})$
of Problem (2.1) to the self-similar solution
$\left(\widetilde{C}, \xi_{d}\right)$
. This convergence turns out to hold when starting from rather general initial conditions. We set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn6.png?pub-status=live)
As an example, for
$D=0.85\times 10^{-5}\,\rm cm^{2}.s^{-1}$
,
$C_{\rm sat}=5.1\,{\rm mol/L}$
and
$C_{\rm sol}=143 \,{\rm mol/L}$
, Figure 5 shows the convergence to the self-similar solution when starting from the initial data
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn7.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_fig5.png?pub-status=live)
Figure 5. Large time behaviour of the solution.
The purpose of this article is to prove that under rather general hypotheses on the initial data, the solution of Problem (2.1) converges to the self-similar profile (2.4)
$\left(\widetilde{C}, \xi_{d}\right)$
as
$t\rightarrow +\infty$
. We will do so for a slightly different formulation of the corrosion problem (2.1). In fact, by means of a change of variables, Problem (2.1) can be reformulated as the classical Stefan problem given in Avner Friedman’s book on parabolic equations (Chapter 8 of [Reference Friedman9, p. 215]). To do so, we perform the change of variables
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn8.png?pub-status=live)
and define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn9.png?pub-status=live)
Using the change of variables (2.8), Problem (2.1) becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn10.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn11.png?pub-status=live)
Setting
$\alpha=1$
and
$C_{\rm sat}=h$
in Problem (2.10) yields the problem which we study in this article.
3 Main results
We consider the problem
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn12.png?pub-status=live)
where
$x=s(t)$
is the unknown free boundary which is to be found together with u(x, t).
In [Reference Friedman9], Friedman proves that this problem has a unique smooth classical solution
$\big(u(x, t), s(t)\big)$
in
$Q:=\{(x, t), t>0, 0<x < s(t)\}.$
Moreover it follows from Schaeffer [Reference Schaeffer15] and Friedman [Reference Friedman7] that
$s \in C^\infty (0,\infty)$
and that u is infinitely differentiable up to the free boundary s. We also refer to Fasano and Primicerio [Reference Fasano and Primicerio6] for their study of related moving boundary problems.
The purpose of this article is to study the large time behaviour of the solution pair (u, s). Also let us mention some previous results from literature. Meirmanov [Reference Meirmanov13] has proved that
$\dfrac{s(t)}{\sqrt{t}} \rightarrow a,$
where a is the unique solution of the non-linear equation (3.4) below. Also, Ricci and Xie [Reference Ricci and Xie14] have performed a stability analysis of some special solutions of a related one-phase Stefan problem on the semi-infinite interval
$(s(t),\infty)$
. In particular, they mention that the interface s(t) behaves as
$\beta \sqrt{t}$
for some positive constant
$\beta$
which they characterise. Moreover, Aiki and Muntean [Reference Aiki and Muntean1, Reference Aiki and Muntean2], as mentioned by Zurek [Reference Zurek21], have proved the existence of two positive constants c and C independent of t such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU1.png?pub-status=live)
in the case of a more complicated system.
In this article, we will prove that the solution pair (u, s) converges to a self-similar solution as
$t\rightarrow \infty$
. First, let us define the self-similar solution. To do so, we introduce the self-similar variable
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn13.png?pub-status=live)
Then, the self-similar solution is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn14.png?pub-status=live)
where a is characterised as the unique solution of the non-linear equation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn15.png?pub-status=live)
In the first step, we will write the problem (3.1) in terms of
$\eta$
and t. To do so, we set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn16.png?pub-status=live)
However, the partial differential equation for V which we obtain explicitly involves the time variable t. It is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn17.png?pub-status=live)
This leads us to perform the change of time variable (see Hilhorst and Hulshof [Reference Hilhorst and Hulshof10])
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn18.png?pub-status=live)
and we set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn19.png?pub-status=live)
The full time evolution problem corresponding to the system (3.1) in coordinates
$\eta$
and
$\tau$
is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn20.png?pub-status=live)
It is in the coordinates
$\eta$
and
$\tau$
that we will rigorously characterise the large time behaviour of the solution pair (W, b). However, for technical reasons, we sometimes have to use different variables, namely
$(y,\tau)$
with
$y=\displaystyle \frac{\eta}{b(\tau)}$
for all
$0<\eta<b(\tau)$
. The use of the y variable allows to transform the problem (3.9) into a problem posed on a fixed domain.
To state an exact formulation of the results of this article, it is most convenient to use the variable y lying in [0, 1]. In the variables
$(y,\tau)$
, the problem for
$\big(\hat{W}(y,\tau),b(\tau)\big)=\big(W(\eta,\tau),b(\tau)\big)$
is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn21.png?pub-status=live)
The main result of this article is the following. We suppose that the initial data
$(u_{0},b_0)$
satisfies the hypothesis:
$\textbf{H}_{0} : u_{0} \in C[0,\infty)\cap\mathbb{W}^{1,\infty}(0,b_{0})$
with
$u_{0}(0)=h$
,
$u_0(x)\geqslant 0$
for
$0\leqslant x\leqslant b_0$
and
$u_{0}(x)=0$
for all
$x\geqslant b_{0}$
.
Main Theorem 3.1 Suppose that
$(u_{0},b_0)$
satisfies the hypothesis
$\textbf{H}_{0}$
. The unique solution
$(\hat{W},b)$
of Problem (3.10) is such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn22.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn23.png?pub-status=live)
where
$(\,\hat{\!U},a) $
is the unique solution of the stationary problem
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn24.png?pub-status=live)
which is equivalent to the stationary problem corresponding to Problem (3.9)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn25.png?pub-status=live)
for the self-similar solution of Problem (3.1).
Remark 3.2 The property (3.12) is equivalent to the convergence result
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn26.png?pub-status=live)
which was already proved by Meirmanov [Reference Meirmanov13].
We present in Figure 6 a numerical computation showing the large time behaviour of the solution pair (W, b) defined in (3.9). The initial data
$(u_{0},b_{0})$
is chosen as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn27.png?pub-status=live)
with
$h=2$
.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_fig6.png?pub-status=live)
Figure 6. Large time behaviour of the solution pair (W, b).
Organisation of the paper:
In Section 4, we introduce the Stefan problem given by Friedman [Reference Friedman8] and recall known well-posedness and regularity results [Reference Friedman7, Reference Schaeffer15]. Using a maximum principle [Reference Friedman9], we show that if
$u_{0}$
is non-negative and bounded then the solution u is also non-negative and bounded.
In Section 5, we start by defining a notion of upper and lower solutions for Problem (3.1). Then, we present a comparison principle in the (x, t) coordinates for a pair of upper and lower solutions of Problem (3.1).
In Section 6, we construct the self-similar solution (U, a). We will show that U is as given by (3.3) and a is characterised as the unique solution of the non-linear equation (3.4).
In Section 7, we transform Problem (3.1) in coordinates (x, t) to obtain an equivalent problem, Problem (3.9), in coordinates
$(\eta,\tau)$
where the solution pair becomes (W, b). We present an equivalent comparison principle in these coordinates and a class of functions which include both the lower and upper solutions. We use the notation
$(\bar {\mathcal{W}}, \bar b)$
for the upper solution, respectively
$({\underline {\mathcal W} _\lambda },{\rm{ }}{\underline b _\lambda })$
for the lower solution depending on a parameter
$\lambda$
. We also denote by
$\left(W(\eta,\tau,(u_0,b_0)), b(\tau,(u_0,b_0))\right)$
the solution pair of Problem (3.9) with the initial conditions
$(u_0,b_0)$
.
In Section 6, we also discuss some properties of upper and lower solutions. Then, we prove the monotonicity in time of the solution pair (W, b) of the time evolution Problem (3.9) with the two initial conditions
$(\bar{\mathcal{W}},\bar b)$
and
$({\underline {\mathcal W} _\lambda },{\rm{ }}{\underline b _\lambda })$
. In other words, we show that starting from a lower solution, the solution
$\underline{W}(\eta,\tau) := W\big(\eta,\tau,(\mathcal{\underline{W}_{\lambda} }, \underline{b}_{\lambda} )\big)$
(i.e. with the initial conditions
$(\mathcal{\underline{W}_{\lambda}}, \underline{b}_{\lambda})$
) increases in time as
$\tau\rightarrow \infty$
to a limit function
$\psi$
and the corresponding moving boundary
$\underline{b}(\tau):=b\big(\tau,(\mathcal{\underline{W}_{\lambda}}, \underline{b}_{\lambda})\big)$
increases to a limit
$\underline{b}_{\infty}$
. Similarly, one can show that starting from an upper solution, the solution decreases to another limit function
$\phi$
as
$\tau\rightarrow \infty$
and the moving boundary
$\bar{b}$
converges to a limit
$\bar{b}_{\infty}$
. However, we do not know yet whether
$\psi$
and
$\phi$
coincide with the self-similar profile U and whether
$\underline{b}_{\infty}$
and
$\bar{b}_{\infty}$
coincide with the point a. In order to prove these results, we first have to show extra a priori estimates which we do in the following section.
In Section 8, we prove a number of a priori estimates in the fixed domain. Indeed, we pass to fixed domain
$(y,\tau) \in (0,1)\times \mathbb{R^{+}}$
to avoid technical problems related to the characterisation of the limits
$\underline{b}_{\infty}$
and
$\bar{b}_{\infty}$
. In other words, we need to show that
$\underline{W}_{\eta}(\underline{b}(\tau),\tau)$
converges to
$\psi_{\eta}(\underline{b}_{\infty})$
as
$\tau\rightarrow \infty$
. This requests to prove the uniform convergence of
$\underline{W}_{\eta}(\eta,\tau)$
to its limit as
$\tau\rightarrow \infty$
which we can more easily do in the fix domain coordinates.
Section 9 is devoted to the study of the limits as
$\tau\rightarrow \infty$
. More precisely, we prove that
$(\psi,\underline{b}_{\infty})$
verifies the following conditions
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn28.png?pub-status=live)
and
$\psi$
satisfies the ordinary differential equation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn29.png?pub-status=live)
Similarly, it turns out that
$\big(W\big(\eta,\tau, ( \mathcal{\bar W},\bar b)\big),b\big(\tau,(\mathcal{\bar W},\bar b)\big)\big)$
converges as
$\tau \rightarrow \infty $
towards the unique stationary solution
$\left(\phi,\bar b_\infty\right)$
of Problem (3.9). At the end of Section 9, we show that the solution pair
$(\psi,\underline{b}_{\infty})$
coincides with the unique solution (U, a) of Problem (6.4) which also coincides with the solution pair
$\left(\phi,\bar{b}_{\infty}\right)$
.
4 Friedman’s formulation
Let
$h > 0$
,
$b>0$
. We define the function space
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn30.png?pub-status=live)
and we consider the problem
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn31.png?pub-status=live)
Problem (4.2) is a free boundary problem where
$x=s(t)$
is the free boundary to be found together with the unknown function u(x, t).
Definition 4.1 Let
$T>0$
. We say that the pair (u, s) is a classical solution of Problem (4.2) if
-
(1) s(t) is continuously differentiable for
$0\leqslant t \leqslant T$ ;
-
(2)
$u \in C(\overline{Q_{T}}),$ where
$Q_{T}:=\{(x, t), t\in (0,T], 0<x<s(t)\}$ ;
-
(3)
$u \in C^{2,1}(Q_{T})$ ;
-
(4)
$u_{x} \in C(\overline{Q^{\delta}_{T}})$ for all
$\delta>0$ where
$Q^{\delta}_{T}=\{(x, t), t \in (\delta, T], 0<x<s(t)\}$ ;
-
(5) the equations of Problem (4.2) are satisfied.
Let (u(x, t), s(t)) be a solution of (4.2) for all
$ 0\leqslant t\leqslant T$
. We extend u by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn32.png?pub-status=live)
so that
$u(\cdot,t)$
is defined for all
$x\geqslant 0$
.
Theorem 4.2 ([Reference Friedman8, Theorem 1]) Let
$h>0, b>0$
and
$u_0\in X^{h}(b)$
. Then, there exists a unique solution
$(u(x, t), s(t))$
of (4.2) for all
$t>0$
in the classical sense. Moreover, the solution
$(u, s)$
is such that s is infinitely differentiable on
$(0,\infty)$
and u is infinitely differentiable up to the free boundary for all
$t>0$
(see [Reference Friedman7], [Reference Schaeffer15]). Furthermore, the function s(t) is strictly increasing in t.
Proposition 4.3 Let
$h>0, b>0$
,
$\bar{h}>h$
and
$u_0\in X^{h}(b)$
such that
$0 \leqslant u_0 \leqslant \bar{h}$
. Then, the solution
$(u(x, t), s(t))$
of (4.2) is such that
$0 \leqslant u(x, t)\leqslant \bar{h}$
for all
$(x, t)\in Q_{T} $
.
Proof. We apply the strong maximum principle (Theorem 1 of [Reference Friedman9, p. 34]) which states that if u attains its minimum or its maximum in an interior point
$(x^{0},t^{0}) \in Q_T,$
then u is constant in
$Q_{t^{0}}$
. However, since
$u(0,t) =h >0 \;\textrm{for}\; t \in (0,T]$
and
$u(s(t),t)=0$
,
$u(.,t)$
cannot be constant in space on
$\big(0,s(t)\big)$
, so that u attains its minimum and its maximum on the boundary
$\Gamma:=\{(0,t), 0\leqslant t \leqslant T\} \cup \{(x,0), 0<x<b\} \cup \{(s(t),t), 0\leqslant t \leqslant T\}$
. As
$0 \leqslant u_0 \leqslant \bar{h}$
, we conclude that
$0 \leqslant u(x, t)\leqslant \bar{h}$
for all
$(x, t)\in Q_{T}.$
5 Comparison principle
To begin with, we define the lower and upper solutions of Problem (4.2), which permits to bound the solution pair (u, s) from below and from above.
Definition 5.1 For
$u \in C(\overline{Q_{T}}) \cap C^{2,1}(Q_{T})$
, we define
$\displaystyle{\mathcal{L}(u):=u_t -u_{xx}}$
.
The pair (
$\underline{u},\underline{s}$
) is a lower solution of the Problem (4.2) if it satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn33.png?pub-status=live)
The pair (
$\bar u,\bar s)$
is an upper solution of the Problem (4.2) if it satisfies (5.1) with all
$\leqslant$
replaced by
$\geqslant$
.
Theorem 5.2 (Comparison principle) Let
$(u_1(x, t), s_1(t))$
and
$(u_2(x, t), s_2(t))$
be respectively lower and upper solutions of (4.2) corresponding respectively to the data
$(h_1,u_{01},b_1)$
and
$(h_2,u_{02},b_2)$
.
If
$b_1\leqslant b_2$
,
$h_1\leqslant h_2$
and
$u_{01}\leqslant u_{02}$
, then
$s_1(t) \leqslant s_2(t)$
for
$t\geqslant 0$
and
$u_1(x, t)\leqslant u_2(x, t)$
for
$x\geqslant 0$
and
$t\geqslant 0$
.
Proof of Theorem 5.2 The proof is rather similar to those presented by Du & Lou [Reference Du and Lou5, Lemma 2.2 and Remark 2.3] and Du & Lin [Reference Du and Lin4, Lemma 3.5]. We omit it here.
6 Self-similar solution
We now look for a self-similar solution of the problem
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn34.png?pub-status=live)
in the form
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn35.png?pub-status=live)
for some positive constant a still to be determined. We set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn36.png?pub-status=live)
and deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn37.png?pub-status=live)
The unique solution of (6.4) is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn38.png?pub-status=live)
It remains to determine the constant a. We write that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn39.png?pub-status=live)
which implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn40.png?pub-status=live)
so that a is characterised as the unique solution of the equation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn41.png?pub-status=live)
We remark that the function
$a=a(h)$
is strictly increasing, which in turn implies that the functional
$h \rightarrow U$
is strictly increasing.
We conclude that the self-similar solution of Problem (6.1) coincides with the unique solution (U, a) of Problem (3.14).
Finally, we remark that the self-similar solution given by (6.5) and (6.8) is a translation in time of the Lam–Clapeyron solution [Reference Lamé and Clapeyron11] (see more details in Tarzia [Reference Tarzia20]).
7 New coordinates and construction of upper and lower solutions
We set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn42.png?pub-status=live)
with
$\eta$
given by (6.3). We obtain the problem
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn43.png?pub-status=live)
Finally we set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn44.png?pub-status=live)
The equations in the system (7.2) read as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn45.png?pub-status=live)
where we have set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn46.png?pub-status=live)
Next, we write the full time evolution problem corresponding to the system (7.4). It is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn47.png?pub-status=live)
Finally, we note that the stationary solution of Problem (7.6) coincides with the unique solution of Problem (3.14), or in other words, the self-similar solution of Problem (3.1).
Definition 7.1 We define the linear operator
$\displaystyle{\mathcal{L}(W):=W_\tau -W_{\eta \eta}-\frac{\eta}{2}W_\eta}$
. The pair
$(\underline{W},\underline{b})$
is a lower solution of Problem (7.6) if it satisfies:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn48.png?pub-status=live)
Similarly,
$(\bar W,\bar b)$
is an upper solution of the Problem (7.6) if it satisfies Problem (7.7) with all
$\leqslant$
replaced with
$\geqslant$
.
Finally, one can deduce from Theorem 5.2 the following comparison principle.
Theorem 7.2 Let
$\big(W_1(\eta,\tau),b_1(\tau)\big)$
and
$\big(W_2(\eta,\tau),b_2(\tau)\big)$
be respectively lower and upper solutions of (7.6) corresponding respectively to the data
$(h_1,u_{01},b_{01})$
and
$(h_2,u_{02},b_{02})$
. If
$b_{01} \;\leqslant\; b_{02}$
,
$h_1\leqslant h_{2}$
and
$u_{01}\leqslant u_{02}$
, then
$b_1(\tau) \leqslant b_2(\tau)$
for
$\tau \geqslant 0$
and
$W_1(\eta,\tau)\leqslant W_2(\eta,\tau)$
for
$\eta\geqslant 0$
and
$\tau \geqslant 0$
.
Throughout this paper, we will also make use of the explicit notation
$W\big(\eta,\tau,(u_0,b_0)\big)$
and
$b\big(\tau,(u_0,b_0)\big)$
for the solution pair associated with the initial data
$(u_0,b_0)$
.
Construction of upper and lower solutions. Now, we construct ordered upper and lower solutions for Problem (7.6). Let
$(u_0,b_0)$
be the initial data satisfying the hypothesis
$\textbf{H}_{0}$
in Section 3.
Upper solution. Let
$\bar{h}> h$
. We consider (
$W_\lambda,b_\lambda$
) the unique solution of the problem
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn49.png?pub-status=live)
which is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn50.png?pub-status=live)
and
$b_{\lambda}$
is the unique solution of the equation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn51.png?pub-status=live)
We easily check that
$W_\lambda$
satisfies the following property
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn52.png?pub-status=live)
Now, we suppose that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn53.png?pub-status=live)
and we define
$(\mathcal{\bar{W}}_{1}, {\bar b})$
by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn54.png?pub-status=live)
where
$W_\lambda(\eta)$
is given by (7.9) and
$\bar b$
satisfy the equation (7.10). Then (
$\mathcal{\bar{W}}_{1},\bar{b}$
) with
$\lambda \leqslant 1$
, satisfies the following system
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn55.png?pub-status=live)
Therefore, the pair (
$\mathcal{\bar{W}}_{1},\bar{b}$
) with
$\lambda \leqslant 1$
, will be an upper solution of Problem (7.6) if
$\bar{b}\geqslant b_0$
and
$\mathcal{\bar{W}}_{1} \geqslant u_0$
in
$[0,\bar{b}]$
.
Now, we consider the function
$\mathcal{\bar{W}}_2$
solution of the following problem
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn56.png?pub-status=live)
which is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn57.png?pub-status=live)
where
$ \mathcal{\bar{W}}_{2,{\eta}}(0)>0$
.
We search
$\lambda$
such that
$\mathcal{\bar{W}}_2$
satisfy the following inequality
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn58.png?pub-status=live)
We have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn59.png?pub-status=live)
so that, if
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn60.png?pub-status=live)
then (7.17) holds. So, we consider
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn61.png?pub-status=live)
For all
$\tau\geq 0$
, the function
$\mathcal{\bar{W}}_{2}$
satisfies the problem
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn62.png?pub-status=live)
We recall that we denote by
$\left(W(\eta,\tau,(u_0,b_0)), b(\tau,(u_0,b_0))\right)$
the solution pair of Problem (7.6) with the initial conditions
$(u_0,b_0)$
. According to the classical maximum principle for parabolic equations, we will deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU2.png?pub-status=live)
if we are able to prove that
$\mathcal{\bar{W}}_2 \geqslant u_0$
in
$[0,b_0]$
.
Now we define the pair
$(\mathcal{\bar{W}},\bar{b})$
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn63.png?pub-status=live)
We will prove in the next Lemma that
$\mathcal{\bar{W}}$
is bounded from below by
$u_0$
in
$[0,b_0]$
.
We recall that the function space
$X^h(b)$
is defined in (4.1).
Lemma 7.3 Let
$u_0 \in X^{h}(b_0) \cap \mathbb{W}^{1,\infty}\big(0,b_{0}\big)$
. The pair
$(\mathcal{\bar{W}},\bar{b})$
defined in (7.22) is such that
$ u_0 \leqslant \mathcal{\bar{W}}$
in
$[0,b_0]$
and
$b_0 \leqslant \bar{b}$
. Moreover, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn64.png?pub-status=live)
where
$\left(W(\eta,\tau,(u_0,b_0)), b(\tau,(u_0,b_0))\right)$
denotes the solution pair of Problem (7.6) with the initial conditions
$(u_0,b_0)$
.
Proof. Define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn65.png?pub-status=live)
From the equalities
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU3.png?pub-status=live)
we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn66.png?pub-status=live)
We define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn67.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn68.png?pub-status=live)
with
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn69.png?pub-status=live)
so that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn70.png?pub-status=live)
The pair
$(\mathcal{\bar{W}}_{1}, \bar{b})$
is an upper solution such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn71.png?pub-status=live)
Then, according to the comparison principle Theorem 7.2, it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn72.png?pub-status=live)
Now, we turn to
$\mathcal{\bar{W}}_2$
. In view of (7.20), we recall that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU4.png?pub-status=live)
In particular
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn73.png?pub-status=live)
Next, we compute the coordinates of the intersection point between the lines
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn74.png?pub-status=live)
We note the intersection point by
$P=(\eta_{p},\zeta_{p})$
.
We have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn75.png?pub-status=live)
so that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn76.png?pub-status=live)
In view of (7.35), it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn77.png?pub-status=live)
In view of (7.33), we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn78.png?pub-status=live)
Next, we write that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn79.png?pub-status=live)
that is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn80.png?pub-status=live)
Thus, we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn81.png?pub-status=live)
In view of (7.40), we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn82.png?pub-status=live)
We can easily check that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn83.png?pub-status=live)
Then, according to the classical maximum principle (see [Protter–Weinberger]), we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn84.png?pub-status=live)
Now, in view of (7.30), (7.31), (7.42) and (7.43), it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn85.png?pub-status=live)
and the comparison estimates (7.23) hold.
This completes the proof of Lemma 7.3.
Lower solution. We consider (
$W_\lambda,b_\lambda$
) the unique solution of the problem
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn86.png?pub-status=live)
which is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn87.png?pub-status=live)
and
$b_{\lambda}$
is the unique solution of the equation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn88.png?pub-status=live)
We can easily show the following properties for
$(W_\lambda,b_\lambda)$
.
Lemma 7.4 We have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn89.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn90.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn91.png?pub-status=live)
In particular,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn92.png?pub-status=live)
We easily check that
$W_\lambda$
satisfies the following property
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn93.png?pub-status=live)
Now, we suppose that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn94.png?pub-status=live)
and we define
$(\mathcal{\underline{W}}_{\lambda}, \underline{b}_{\lambda})$
by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn95.png?pub-status=live)
where
$W_\lambda(\eta)$
is given by (7.46) and
$\underline{b}_{\lambda}$
satisfies the equation (7.47). The pair (
$\mathcal{\underline{W}}_\lambda,\underline{b}_\lambda$
) will be a lower solution of Problem (7.6) if
$\underline{b}_{\lambda} \leq b_0$
and
$\mathcal{\underline{W}}_{\lambda} \leq u_0$
in
$[0,b_0]$
.
Next we establish some further properties for the free boundary position
$b_{\lambda}$
.
Lemma 7.5 The following properties hold for
$b_\lambda$
satisfying (6.47).
-
(1)
$b_{\lambda}$ is a decreasing function of
$\lambda$ .
-
(2)
$b_\lambda \to 0$ as
$\lambda \to +\infty$ .
Proof. We start to prove (i). We define
$\mathcal{F}$
as the function given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn96.png?pub-status=live)
and consider the equation
$\mathcal{F}(\lambda,b_{\lambda})=0$
. We compute the differential of
$\mathcal{F}$
through partial derivatives given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn97.png?pub-status=live)
From (7.55), it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn98.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn99.png?pub-status=live)
Since
$\mathcal{F}(\lambda,b_{\lambda})=0$
, it follows from (7.56) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn100.png?pub-status=live)
Thus, since
$\displaystyle \frac{\partial \mathcal{F}}{\partial b_{\lambda}}\neq 0$
, it follows from (7.57), (7.58) and (7.59) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn101.png?pub-status=live)
which completes the proof of (i).
Now, we turn to the proof of (ii). For
$\lambda\geqslant 0$
, we have
$b_\lambda > 0$
and
$b_\lambda$
is a decreasing function of
$\lambda$
. Hence, there exists
$\alpha\geqslant 0$
such that
$b_\lambda \to \alpha$
as
$\lambda \to + \infty$
and
$b_\lambda \geqslant \alpha$
for all
$\lambda \geqslant 0$
. We shall prove that
$\alpha =0$
. This fact mainly relies on the following inequality which will be proved later on. Let
$a\geqslant 0$
. For
$\lambda\geqslant 0$
large enough, the following inequality holds
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn102.png?pub-status=live)
Since
$b_\lambda \geqslant \alpha$
for all
$\lambda \geqslant 0$
, we deduce from (7.47) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn103.png?pub-status=live)
For
$\lambda$
large enough, we infer from the estimate (7.61) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn104.png?pub-status=live)
Letting
$\lambda\to+\infty$
in (7.63), we see that we necessarily have
$\alpha=0$
. It remains to prove that the inequality (7.61) holds for
$\lambda$
large enough. We only have to consider the case where
$a>0$
since (7.61) is trivially true for
$a=0$
. Let us introduce
$f(x)=e^{-\frac{\lambda x^2}{4}}$
. We have
$f''(x)=\frac{\lambda}{2}\!\left(\frac{\lambda}{2} x^2-1\right)e^{-\frac{\lambda x^2}{4}}$
. We choose
$\lambda>0$
large enough to have
$0< \sqrt{\frac{2}{\lambda}} < a$
and then f is convex in
$\left[ \sqrt{\frac{2}{\lambda}} , a\right]$
. Therefore, for all
$x\in\left[\sqrt{\frac{2}{\lambda}} , a \right]$
we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn105.png?pub-status=live)
that is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn106.png?pub-status=live)
Next we prove that (7.64) also holds for
$x\in \left[0,\sqrt{\frac{2}{\lambda}} \right]$
. Indeed, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU5.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU6.png?pub-status=live)
Since
$g(0)\to 0$
as
$\lambda\to +\infty$
, we get, for
$\lambda$
large enough
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn107.png?pub-status=live)
and then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn108.png?pub-status=live)
Combining (7.64) with (7.67) leads to
$f(x) \geqslant g(x)$
for all
$x\in [0,a]$
, that is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn109.png?pub-status=live)
Integrating (7.68) over [0, a] leads to the desired inequality (7.61).
The next result ensures that the pair
$(\mathcal{\underline{W}}_{\lambda}, \underline{b}_{\lambda})$
is actually a lower solution of Problem (7.6) for
$\lambda$
large enough.
Lemma 7.6 Let
$u_0 \in X^{h}(b_0) \cap \mathbb{W}^{1,\infty}\big(0,b_{0}\big)$
and
$(\mathcal{\underline{W}}_{\lambda}, \underline{b}_\lambda)$
defined by (7.54). There exists
$\lambda \geqslant 1$
large enough such that
$\mathcal{\underline{W}}_{\lambda} \leqslant u_0$
in
$[0,b_0]$
and
$\underline{b}_{\lambda} \leqslant b_0$
. Then,
$(\mathcal{\underline{W}}_{\lambda}, \underline{b}_\lambda)$
is a lower solution of Problem (7.6).
Proof. According to (7.51),
$W_\lambda$
is a convex function. Thus, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn110.png?pub-status=live)
From the identity
$u_0(\eta)= h +\displaystyle \int_0^\eta \frac{du_0}{d\eta}(s) ds$
for
$0\leqslant \eta \leqslant b_0$
, we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn111.png?pub-status=live)
where
$M={\left\| \displaystyle \frac{du_0}{d\eta}\right\|}_{L^\infty(0,b_0)}$
. From Lemma 7.5 (ii),
$b_\lambda\to 0$
as
$\lambda\to +\infty$
. Then we can choose
$\lambda \geqslant 1$
large enough so that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn112.png?pub-status=live)
Estimate (7.70) then becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU7.png?pub-status=live)
and we deduce from (7.69) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn113.png?pub-status=live)
Defining
$\mathcal{\underline{W}}_\lambda= {{W}}_\lambda$
and
$\underline{b}_\lambda=b_\lambda$
as in (6.54), we deduce that the pair (
$\mathcal{\underline{W}}_\lambda,\underline{b}_\lambda$
) is a lower solution for Problem (7.6).
In view of Lemma 7.6 and the comparison principle Theorem 7.2, it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn114.png?pub-status=live)
Next, we prove the monotonicity in time of the solution pair (W, b) of the time evolution Problem (7.6) with the two initial conditions
$(\bar{\mathcal{W}},\bar b)$
and
$(\mathcal{\underline{W}_{\lambda}}, \underline{b}_{\lambda})$
. We recall that
$\left(W(\eta,\tau,(u_0,b_0)), b(\tau,(u_0,b_0))\right)$
denotes the solution pair of Problem (6.6) with the initial conditions
$(u_0,b_0)$
.
Lemma 7.7 Let
$\big(\bar{\mathcal{W}},\bar{b}\big)$
be the pair defined by (7.22) and
$(\mathcal{\underline{W}_{\lambda}}, \underline{b}_{\lambda})$
be the lower solution of Problem (6.6) defined by (7.54).
-
(1) The functions
$W\big(\eta,\tau,(\bar{\mathcal{W}},\bar b)\big)$ and
$b\big(\tau,(\bar{\mathcal{W}},\bar b)\big)$ are non-increasing in time. Furthermore, there exist a positive constant
$\bar b_{\infty}$ and a function
$\phi \in L^{\infty}(0,\bar b_{\infty})$ such that
(7.74)\begin{equation} \lim\limits_{\tau \rightarrow +\infty} W\big(\eta,\tau,(\bar{\mathcal{W}},\bar b)\big)= \phi(\eta) \,\,\,\, \textrm{for all}\;\; \eta \in (0,\bar b_{\infty}), \end{equation}
(7.75)\begin{equation} \lim\limits_{\tau \rightarrow +\infty} b\big(\tau,(\bar{\mathcal{W}},\bar b)\big)= \bar b_{\infty}. \end{equation}
-
(2) The function
$W\big(\eta,\tau,(\mathcal{\underline{W}_{\lambda}}, \underline{b}_{\lambda})\big)$ and
$b\big(\tau,(\mathcal{\underline{W}_{\lambda}}, \underline{b}_{\lambda})\big)$ are non-decreasing in time. Furthermore, there exist a positive constant
$\underline{b}_{\infty}$ and a function
$\psi \in L^{\infty}(0,\underline{b}_{\infty})$ such that
(7.76)\begin{equation} \lim\limits_{\tau \rightarrow +\infty} W(\eta,\tau,(\mathcal{\underline{W}_{\lambda}}, \underline{b}_{\lambda}))= \psi(\eta) \,\,\,\, \textrm{for all}\;\; \eta \in (0,\underline{b}_{\infty}), \end{equation}
(7.77)\begin{equation} \lim\limits_{\tau \rightarrow +\infty} b\big(\tau,(\mathcal{\underline{W}_{\lambda}}, \underline{b}_{\lambda})\big)= \underline{b}_{\infty}. \end{equation}
Proof. One can show that
$W\big(\eta,\tau,(\bar{\mathcal{W}},\bar b)\big)$
and
$b\big(\tau,(\bar{\mathcal{W}},\bar b)\big)$
are non-increasing in time and that
$W\big(\eta,\tau,(\mathcal{\underline{W}_{\lambda}}, \underline{b}_{\lambda})\big)$
and
$b\big(\tau,(\mathcal{\underline{W}_{\lambda}}, \underline{b}_{\lambda})\big)$
are non-decreasing in time. Indeed, from (7.23) we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU8.png?pub-status=live)
In particular, with
$u_0=\bar{\mathcal{W}}\;\textrm{and} \; b_0=\bar{b}$
, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn119.png?pub-status=live)
In view of (7.27), (7.41) and (7.44), we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn120.png?pub-status=live)
Then, it follows from Proposition 4.3 that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn121.png?pub-status=live)
Let
$\sigma>0$
be fixed. We apply Theorem 7.2 for (7.78) to obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU9.png?pub-status=live)
Thus for each
$\eta, W\big(\eta,\tau,(\bar{\mathcal{W}},\bar b)\big)$
is non-increasing in
$\tau$
and from (7.80), it is bounded from below by zero. Therefore, it has a limit
$\phi$
as
$\tau\rightarrow \infty$
.
Also
$b\big(\tau,(\bar{\mathcal{W}},\bar b)\big)$
is non-increasing in
$\tau$
and from (7.73) we deduce that it is bounded from below by
$\underline{b}_{\lambda}$
. Therefore, it has a limit
$\bar b_{\infty}$
as
$\tau\rightarrow \infty$
.
The same reasoning can be applied to prove that
$W\big(\eta,\tau,(\mathcal{\underline{W}}_{\lambda}, \underline{b}_{\lambda})\big)$
and
$b\big(\tau,(\mathcal{\underline{W}_{\lambda}}, \underline{b}_{\lambda})\big)$
are non-decreasing in time. Thus for each
$\eta, W\big(\eta,\tau,(\mathcal{\underline{W}}_{\lambda}, \underline{b}_{\lambda})\big)$
is non-decreasing in
$\tau$
and it is bounded from above by the constant function h as follows from Proposition 4.3. Therefore, it has a limit
$\psi$
as
$\tau\rightarrow \infty$
. Also,
$b\big(\tau,(\mathcal{\underline{W}}_{\lambda}, \underline{b}_{\lambda})\big)$
is non-decreasing in
$\tau$
and bounded from above by
$\bar b$
thanks to (7.23). Therefore, it has a limit
$\underline{b}_{\infty}$
as
$\tau\rightarrow \infty$
.
Later we will show that
$\phi$
and
$\psi$
coincide with the unique solution of Problem (3.14). To that purpose, we will derive in the Section 8 estimates for the free boundary Problem (7.6) in fixed domain.
8 A priori estimates for the solution of Problem (7.6) on the fixed domain
Definition 8.1 We define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU10.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU11.png?pub-status=live)
We start by showing successive lemmas for the functions pair
$(\underline{W}, \underline{b})$
and
$(\bar W, \bar b)$
.
Lemma 8.2 We have the following uniform bounds in time
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn122.png?pub-status=live)
and there exists a constant
$\bar{h}\geqslant h$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn123.png?pub-status=live)
Proof. It follows from (7.73) and (7.23) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU12.png?pub-status=live)
In particular, for
$(u_{0},b_{0})=(\mathcal{\underline{W}}_{\lambda}, \underline{b}_{\lambda})$
, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU13.png?pub-status=live)
For
$(u_{0},b_{0})=(\mathcal{\bar{W}}, \bar b)$
, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU14.png?pub-status=live)
We know from (7.48), (7.54) and (7.79) that
$0\leqslant \mathcal{\underline{W}}_{\lambda}(\eta)\leqslant h \leqslant \bar{h}$
and
$0\leqslant \mathcal{\bar{W}}(\eta)\leqslant \bar{h}$
for all
$\eta \in (0,\bar b)$
, which by Proposition 4.3 implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU15.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU16.png?pub-status=live)
We deduce from the comparison principle, Theorem 7.2, that (8.1) and (8.2) hold.
Lemma 8.3 For any
$\epsilon>0$
, there exists
$C_{\epsilon}>0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU17.png?pub-status=live)
Proof. By Lemmas 7.7 and 8.2, it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU18.png?pub-status=live)
Applying the differential equation for
$\bar{b}(\tau)$
in (7.6) to
$(\bar{W},\bar{b})$
, we immediately obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU19.png?pub-status=live)
since
$\bar{W}_{\eta}\big(\bar{b}(\tau),\tau\big)\leqslant 0$
. This yields the desired
$C^{1}$
bound for the free boundary
$\bar{b}(\tau)$
. For the free boundary
$\underline{b}(\tau)$
, we apply a comparison argument. Let
$\epsilon >0$
. We take
$L=\displaystyle \frac{\underline{b}(\epsilon)}{2}$
and define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU20.png?pub-status=live)
with the constant
$\bar{h}\geqslant h$
given in Lemma 8.2. Then we compare
$\underline{W}$
and
$\widetilde{W}$
on the region
$\Omega:=\{(\eta,\tau) : \underline{b}(\tau)-L < \eta < \underline{b}(\tau), \tau>\epsilon\},$
where
$\widetilde{W}$
satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU21.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU22.png?pub-status=live)
Next, we choose
$M>\displaystyle \frac{\bar{h}}{L}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU23.png?pub-status=live)
which implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU24.png?pub-status=live)
Therefore we obtain, by the standard comparison principle, that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU25.png?pub-status=live)
Since
$\widetilde{W}\big(\underline{b}(\tau),\tau\big)=\underline{W}\big(\underline{b}(\tau),\tau\big)=0,$
it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU26.png?pub-status=live)
and hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU27.png?pub-status=live)
The desired estimate for
$\underline{b} (\tau)$
thus follows.
It will be necessary in the sequel to work on a fixed domain. To do so, we start by giving the transformation to the fixed domain
${\hat \Omega}:=\big\{(y,\tau)\in (0,1)\times (0,\infty)\big \}$
. We set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn124.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn125.png?pub-status=live)
The function
$\hat{W}^{1}(y_{1},\tau)$
satisfies the problem
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn126.png?pub-status=live)
and the function
$\hat{W}^{2}(y_{2},\tau)$
satisfies the problem
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn127.png?pub-status=live)
Let
$r\geqslant0$
and
$\sigma>0$
. We define the domain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn128.png?pub-status=live)
Next, we define the extension of
$\hat{W}^{i}$
on the domain
$(-1,2)\times(0,\infty)$
as follows
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn129.png?pub-status=live)
In view of Problem (8.5), we deduce that
$\widetilde{W}^{1}$
satisfies the following problem
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn130.png?pub-status=live)
An analogous problem is also satisfied by
$\widetilde{W}^{2}$
with
$\bar{b}$
in place of
$\underline{b}$
in (7.9).
The extensions
$\widetilde{W^i}, i = 1,2$
, satisfy initial value problems of the form
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn131.png?pub-status=live)
Theorem 8.4 Let
$p>1$
and
$r > \varepsilon > 0$
. There exists a positive constant C which does not depend on r such that the solutions
$\hat{W}^{i}$
of problems (8.5) and (8.6) satisfy the estimate
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn132.png?pub-status=live)
Proof. The coefficient A in (8.10), which only depends on
$\tau$
, is positive and uniformly bounded away from zero on
$[\varepsilon, \infty)$
. Moreover, A satisfies
${\big \| A \big\|}_{{C^{1}} ([\varepsilon,\infty))} \leqslant \mathcal{C}$
for some positive constant
$\mathcal{C}$
. The coefficient B in (8.10) is also uniformly bounded on
$[-1, 2] \times [\varepsilon,\infty)$
. The estimate (8.11) then follows from [Reference Lieberman12, Theorem 7.13], which gives interior estimates, and from its proof. This completes the proof of Theorem 8.4.
Lemma 8.5 We have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU28.png?pub-status=live)
Proof. Lemma 8.5 follows from Lemma 3.5 of [Reference Brochet, Hilhorst and Chen3, p.207].
Corollary 8.6 There exists a positive constant C which does not depend on r such that the solution
$\hat{W}^{i}$
of problems (8.5) and (8.6) satisfies the estimate
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn133.png?pub-status=live)
Proof. We deduce from Lemma 8.5 that there exists some positives constants
$\widetilde{C}>0$
and
$C>0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn134.png?pub-status=live)
which in turn implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn135.png?pub-status=live)
This completes the proof of Corollary 8.6.
9 Limit problem as
$\tau \rightarrow \infty$
Theorem 9.1 Let
$\big(\psi, \underline{b}_{\infty} \big)$
be defined in Lemma 7.7. Then
$\big(\psi, \underline{b}_{\infty} \big)$
is the unique stationary solution of Problem (2.14).
Before proving this theorem, we need to show some preliminary results. Let
$\hat{W}^{1}$
be defined as in (8.3). We also define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn136.png?pub-status=live)
We start by showing the following result.
Lemma 9.2 We have that
$\lim\limits_{r \rightarrow +\infty} ||\hat{W}^{1}(.,r)- \hat{\psi}||_{C^{1+\alpha}([0, 1])}=0 \; \; \textrm{for all}\; \; \alpha \in (0,1)$
.
Lemma 9.3 We have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU29.png?pub-status=live)
Proof. From Theorem 8.4, it follows that there exists a positive constant
$C>0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU30.png?pub-status=live)
which implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn137.png?pub-status=live)
With the change of variable
$S=s-r$
, the inequality (9.2) becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn138.png?pub-status=live)
Thus, there exists
$v\in L^p\!\left((0,1)\times(0,\sigma)\right)$
and a sequence
$\{\hat{W}^{i,n}\}_{n\geq 0}$
of functions in
$W_p^{2,1}\!\left((0,1)\times(0,\sigma)\right)$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn139.png?pub-status=live)
For all
$\varphi\in \mathcal{D}\!\left((0,1)\times(0,\sigma)\right)$
, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn140.png?pub-status=live)
Integration by parts yields, in view of Theorem 8.4 and Lemma 9.2,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn141.png?pub-status=live)
Now, since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn142.png?pub-status=live)
we deduce from (9.5), (9.6) and (9.7) that
$v = \hat{\psi}_{yy} \in L^p(0,1)$
, which completes the proof of Lemma 8.3.
Next, we prove Theorem 9.1.
Proof of Theorem 9.1 The proof will be done through successive Lemmas. The first step of the proof consists in showing the following result.
Lemma 9.4 We have
$\psi(0)=h$
and
$\psi(\underline{b}_{\infty})=0$
.
Proof. We start by showing that
$\psi(0)=h$
. Indeed, we have that (recall that
$\underline{W}$
is non-decreasing in time)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn143.png?pub-status=live)
Letting
$\tau $
tend to
$+\infty$
, we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU31.png?pub-status=live)
Then, for
$\eta=0$
, we obtain
$\mathcal{\underline{W}}_{\lambda}(0)=h \leqslant \psi(0) \leqslant h$
, that is
$\psi(0)=h$
.
Next, we prove that
$\psi(\underline{b}_{\infty})=0$
. We deduce from Lemma 9.2 that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn144.png?pub-status=live)
which is equivalent to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn145.png?pub-status=live)
Since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn146.png?pub-status=live)
we deduce that indeed
$ \psi(\underline{b}_{\infty}) =0.$
The following result holds.
Lemma 9.5 We have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn147.png?pub-status=live)
Proof. First, we prove the corresponding relation for
$\hat{\psi}_y(1)$
and then we will conclude the result for
$\psi_{\eta}$
. We recall that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn148.png?pub-status=live)
In view of the change of variables (8.3) for
$\hat{W}^{1}$
, the equation (9.13) becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn149.png?pub-status=live)
Integrating (9.14) in time between
$\tau$
and
$\tau+\sigma$
and performing the change of variable
$S=s-\tau$
, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn150.png?pub-status=live)
Then, we deduce from Lemma 9.2 that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU32.png?pub-status=live)
and recall that
$\underline{b}(\tau)\rightarrow \underline{b}_{\infty}$
as
$\tau \rightarrow +\infty$
. Passing to the limit as
$\tau \rightarrow +\infty$
in (8.15), we conclude that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn151.png?pub-status=live)
Now, since
$\psi_{\eta}(\eta)=\displaystyle \frac{1}{\underline{b}_{\infty}} \hat{\psi}_{y}(y)$
,
$y= \displaystyle \frac{\eta}{\underline{b}_{\infty}}$
for all
$0\leqslant \eta \leqslant \underline{b}_{\infty}$
(see (9.1)), the relation (9.16) becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn152.png?pub-status=live)
which completes the proof of Lemma 9.5.
The last step of the proof of Theorem 9.1 consists in the following result.
Proposition 9.6 The function
$\psi\in C^{\infty}([0,\underline{b}_{\infty}])$
and satisfies the equation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU33.png?pub-status=live)
Before proving Proposition 9.6, we show the following lemma.
Lemma 9.7 The function
$\hat{\psi}$
satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn153.png?pub-status=live)
for all test functions
${\varphi} \in \mathcal{D}(0,1) $
.
Proof. Recall that the function
$\hat W^{1}(y,\tau)$
satisfies Problem (8.5), in particular we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn154.png?pub-status=live)
From Problem (8.5), we have
$\displaystyle \frac{1}{2}\displaystyle{\frac{d \underline{b}^{2}(\tau)}{d \tau} + \frac{\underline{b}^{2}(\tau)}{2}}= - {\hat{W}^{1}_y}(1,\tau)$
which implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn155.png?pub-status=live)
In view of the equality (9.20), the equation (9.19) becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn156.png?pub-status=live)
Next, we multiply (9.21) by the test function
$\varphi$
and integrate both sides of the equality on
$(0,1)\times (\tau,\tau+\sigma)$
to obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn157.png?pub-status=live)
We integrate by parts the first term on the right-hand side of (9.22) to obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn158.png?pub-status=live)
Next, we integrate by parts the second term on the right-hand side of (9.22) to obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn159.png?pub-status=live)
We deduce from (9.23) and (9.24) that the right-hand side of (9.22) becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn160.png?pub-status=live)
Moreover, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn161.png?pub-status=live)
We deduce from (9.22), (9.25) and (9.26) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn162.png?pub-status=live)
With the change of variables
$S=s-\tau$
, the equality (9.27) becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn163.png?pub-status=live)
Furthermore, according to Lemma 9.2, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn164.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn165.png?pub-status=live)
and from (9.16), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn166.png?pub-status=live)
According to Lemma 7.7, we recall that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn167.png?pub-status=live)
We recall that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn168.png?pub-status=live)
It follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqnU34.png?pub-status=live)
According to Lebesgue’s Dominated Convergence Theorem,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn169.png?pub-status=live)
Similarly, we also have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn170.png?pub-status=live)
Now, we turn to the right-hand side of (9.28). In view of (9.30), (9.31) and (9.32), we deduce that as
$\tau \rightarrow \infty$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn171.png?pub-status=live)
We conclude from (9.28) and (9.34)–(9.36) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn172.png?pub-status=live)
for all test functions
${\varphi} \in \mathcal{D}(0,1) $
which yields the result of Lemma 9.7.
Finally, we present the proof of Proposition 9.6.
Proof of Proposition 8.6 From Lemma 8.3, we have that
$\hat{\psi}_{yy} \in L^{p}(0,1)$
. Then, by means of integration by parts, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn173.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn174.png?pub-status=live)
for all test function
${\varphi} \in \mathcal{D}(0,1)$
. Hence, we deduce from (9.18) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn175.png?pub-status=live)
for all
${\varphi} \in \mathcal{D}(0,1)$
. In view of (9.1), we recall that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn176.png?pub-status=live)
This finally implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn177.png?pub-status=live)
This completes the proof of Proposition 9.6.
We conclude that the pair
$(\underline{W} (\eta,\tau):=W(\eta,\tau,(\mathcal{\underline{W}}_{\lambda},\underline{b}_{\lambda})),\underline{b}(\tau):=b(\tau,(\mathcal{\underline{W}}_{\lambda},\underline{b}_{\lambda})))$
converges to (
$\psi,\underline{b}_{\infty}$
) as
$\tau \rightarrow \infty$
. Thanks to Lemmas 9.4, 9.5 and Proposition 9.6,
$(\psi,\underline{b}_{\infty})$
coincides with the unique stationary solution (U, a) of Problem (3.14). This completes the proof of Theorem 9.1.
Similarly, one can show that
$\big(W\big(\eta,\tau, \big(\mathcal{\bar W},\bar b\big)\big),b(\tau,\big(\mathcal{\bar W},\bar b\big)\big)\big)$
converges as
$\tau \rightarrow \infty $
to
$\big(\phi,\bar b_\infty\big)$
which also coincides with the unique stationary solution (U, a) of Problem (3.14).
The main result of this article is main Theorem 3.1.
Recalling Lemmas 7.6 and 7.3, the main Theorem 3.1 implies the following result in the moving variables framework.
Theorem 9.8 Let
$u_0 \in X^{h}(b_0) \cap \mathbb{W}^{1,\infty}\big(0,b_{0}\big)$
. Let
$(W,b)=\big(W\!\left(\cdot,\cdot,(u_0,b_0)\right) ,b(\cdot,(u_0,b_0))\big)$
be the solution of Problem (7.6) with the initial data
$(u_0,b_0)$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn178.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn179.png?pub-status=live)
where (U, a) is the unique solution of the stationary Problem (3.14).
Proof. For all
$\tau>0$
and
$\eta\geqslant 0$
, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn180.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn181.png?pub-status=live)
According to Lemma 7.7 together with the fact that
$(\psi,\underline{b}_{\infty})=(\phi,\bar b_{\infty})=(U, a)$
, we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn182.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230705121909977-0335:S0956792522000250:S0956792522000250_eqn183.png?pub-status=live)
The result of Theorem 9.8 then follows from (9.45) and (9.46).
This completes the proof of the main result of this article stated in Theorem 3.1 in Section 3.
Acknowledgement
The authors are grateful to the referees for their very careful review of this paper, and for the comments, corrections and suggestions that ensued. They led to a simpler version of this paper and a strong improvement in the results. The authors would also like to thank Professor Philippe LaurenÇot and Professor Hiroshi Matano for their very inspiring comments, Dr. Fabien Rouillard and Dr. Florence Lequien for their invaluable advice during the preparation of this article as well as CEA, ORANO and EDF for their financial support. The third author was supported by JSPS KAKENHI Grant Number 17KK0086.