Abstract
In this paper we consider a penalized Stokes equation defined in a regular domain
Introduction
Main results
Let
The main objective of this paper is to prove that system (1.1) is null controllable with a one-dimensional control whose cost is uniformly bounded with respect to ε. We prove it for almost every direction, being these directions different for each Ω. In addition, if Ω is strictly convex we prove it for all the directions.
First of all, we state what hypothesis Ω must satisfy to be controllable by a force parallel to
Since the
Let
Hypothesis 1.1 means that if Ω is a
Hypothesis 1.1 is not restrictive at all, thanks to the following lemma, which we prove at the beginning of Section 4.1:
Let Ω be a
With Lemma 1.3 in mind, we state one of the main results of this paper:
Let
As usual, in Theorem 1.4 and throughout this paper
From Lemma 1.3 and since system (1.1) is invariant with respect to rotations, we actually have for almost all directions
A natural question that may arise is the relation between the control problem (1.4) and the control problem:
In order to prove the null controllability of (1.4), we consider as usual its adjoint system:
In order to prove estimate (1.7) we prove a Carleman inequality. Before presenting it, let us define the weights we use throughout the paper as follows:
Let Ω be a regular domain that satisfies Hypothesis
1.1
, let
Proving (1.7) from (1.9) is mainly done by an energy estimate on
We remark that in (1.6) we can simplify the pressure and get the following equations for
Let Ω be a
By continuity, (1.12) remains true for
Thanks to Poincaré inequality, there is
By symmetry, we get an analogous estimate for
The reason why (1.12) is useful to prove (1.9) is the following one:
Let us consider
Finally, let us make some remarks about possible extensions of the work: The case of Theorem 1.4 and Theorem 1.7 for The construction provided in Section 2.1 for Lipschitz domains in which (1.4) is not null-controllable just gives one problematic ε for each Ω. Thus, it is an open problem to know if for all Lipschitz domain
Getting an approximation of the Stokes and the Navier–Stokes systems by approximating the incompressibility condition by a term involving the pressure was made for the first time in [31], where the author considered the almost incompressible Navier–Stokes system. Many other ways of approximating the Navier–Stokes equations have been presented throughout the years. In the survey [29] the author presents different ways of approximating the Navier–Stokes system through the incompressibility condition and compares them. Moreover, there are physical systems which satisfy in some ways the property of being almost incompressible, as shown in [30] and the references therein.
The interior null controllability of system (1.1) was first proved in [23, Section 4] with a control bounded uniformly with respect to ε, for ε small enough. Then, in [4], this same property is proved with an additional first order term. Moreover, in [4] the author also proves the local controllability to trajectories of the penalized Navier–Stokes system uniformly on ε for ε small enough.
There is an extensive literature on controllability of partial differential equations uniformly with respect to a vanishing parameter. For a transport equation with a small diffusion term, see [11] (see also [19] and [27]). The case of the KdV equation is treated in [7,20] and [8], while a chemotaxis system is presented in [10].
As for the restriction of having controls with a reduced number of components, it is not new in the Navier–Stokes mathematical context. This same property has already been proved for the Stokes problem (1.2) in [12]. Consequently, in this paper we prove that a system which approximates the Stokes system conserves that property after choosing a valid reference system. Moreover, controllability results with controls having one null component have been proved for other systems: for instance, the local null controllability of the Navier–Stokes system (see [6]), the local controllability to the trajectories of the Navier–Stokes and the Boussineq system when the domain “touches” the boundary (see [17]), or the existence of insensitizing controls (see [9,22]). Similarly, the approximate controllability of the Stokes system in a cylindrical domain with a control having two null components is proved in [26]. Finally, the local null controllability of the Navier–Stokes system in dimension three with one scalar control is proved in [13].
Outside the Navier–Stokes context, there is a huge literature on controllability results with controls having a reduced number of components. For instance, the null controllability in the context of linear thermoelasticity (see [24]), the existence of insensitizing controls for the heat equation (see [14]), the controllability to trajectories in phase-field models (see [2]), the controllability in cascade-like systems (see [21]) and the controllability in reaction-diffusion systems (see [1]). For more results on the controllability of parabolic systems with a reduced number of control, see the survey [3] and the references therein.
The main difference of the problem we consider in this paper with respect to the above cited papers is the coupling. Indeed, in all the papers cited above (and in the literature as far as we know) the coupling is constituted by a zero, first or second order term which induces a norm in the subset of
The rest of the paper is organized as follows: in Section 2 we present some analytical results; in Section 3 we prove Theorem 1.8 when Ω is strictly convex; in Section 4 we prove Lemma 1.3 and Theorem 1.8; and in Section 5 we end the proof of Theorem 1.7. Finally, in the Appendix we prove some technical results stated in Section 2.
In this section we present some results that are either interesting for understanding the problem or needed later. The section is split in three parts: first, in Section 2.1 we prove that there is a domain Ω which is not
A negative controllability result
In this subsection we provide a counterexample on null controllability with one component of (1.4) when Ω is not
We recall that system (1.4) is approximately null controllable if for all
Let
In order to prove Proposition 2.2 we use the technique presented in [26, Section 3]. It is a classical result that system (1.4) is not approximately null controllable if there is The third equation of (2.1) is satisfied if The solutions Finally, we have to consider that the function With this method we can find for The “reason” why unique continuation fails is that
In this subsection we present some results about the Stokes penalized problem: first with Dirichlet boundary conditions and then with Neumann boundary conditions. We also present a classical estimate about a linear differential equation. But before, we recall the definition of the interpolation spaces, for
Let
The proof of Lemma 2.5 is mainly by induction. The base case (
Let us now state the Stokes penalized system with non-homogeneous Neumann boundary conditions:
Let
It is not necessary to assume that ε is small enough if we just want to prove existence and uniqueness of the energy solution of (2.6). Indeed, we prove collaterally that for all
Let
These results are not optimal in terms of the regularity imposed on h, but they are enough for our purpose.
Finally, we recall the following classical estimate for a linear ordinary differential equation:
Let
In this subsection we present some Carleman estimates that are needed later. We first state a Carleman estimate which concerns a parabolic equation with non-homogeneous Neumann boundary conditions. More precisely, we consider the following system:
Let Ω be a
The case
Next, we also need the following elliptic inequality, whose proof can be found in [12, Lemma 3]:
Let Ω be a
Finally, we need a Carleman inequality for the backwards solution of (2.6) (see (2.16) below). For a simpler statement of the Carleman inequality, we define the weights:
Let Ω be a
The proof of this Carleman estimate is presented in Appendix B.
Proposition 2.13 with
Up to our knowledge the result presented in Remark 2.14 is new.
In Section 3 we first give some remarks about how much Theorem 1.8 can be improved and we then prove Theorem 1.8 when Ω is strictly convex. The proof is simpler, clearer and more explicit than when we are in a general domain. We recall that Ω strictly convex means that its boundary consists of one connected component and that:
When Ω is a strictly convex convex domain, we do not need
Let Ω be a strictly convex
Throughout this section we prove Proposition 3.1, which automatically implies Theorem 1.8 if Ω is strictly convex.
Estimate (3.2) is false if we remove the term
Although it might be possible that the spaces we give on the right of (3.2) are not optimal, the statement is false if we replace
Let Ω a
The hypothesis of Proposition 3.3 includes circles, ellipses and p-norm spheres (for
We prove this assertion by contradiction. Let us suppose that there is
We consider
Thus, if we take limits in (3.4) we get:
In order to make the proof more understandable we split it in three steps: first, we obtain a differential equation on the boundary in terms of
Step 1: Getting an equation on the boundary.
In order to get a differential equation on the boundary, we consider that because of the Dirichlet boundary condition u satisfies the equation:
The idea is to get an equality from (3.6) in which we only have
Step 2: Defining an auxiliary function.
We now consider the lower part of the boundary:
First, we estimate the
Next, we estimate the
Step 3: Getting the information from the ordinary differential equation ( 3.11 ).
We split Ω in different subsets depending on the sign of
Because of (3.9) we have that
We first prove estimate (3.2) in
Let us set
An illustration of the strictly convex case.
First, considering that
This method also works for
As for getting the estimate in
Finally, it is quite clear that we can get the estimate in a similar way for
In this section we present the proof of Theorem 1.8 as well as some strongly related results. First, in Section 4.1 we prove Lemma 1.3. Second, in Sections 4.2 and 4.3 we state and prove some geometrical consequences of Hypothesis 1.1. Finally, in Section 4.4 we prove Theorem 1.8, using, among others, Section 3.
We recall that some of the notation used in this section has been introduced above Hypothesis 1.1.
Proof of Lemma 1.3
Lemma 1.3 is a consequence of Sard’s Theorem:
Let
In order to apply Sard’s Theorem, we consider the functions:
Let us consider Finally, the measure of (Sard’s Theorem).
In order to prove Theorem 1.8, we need to define equivalent notions to the ones presented in the convex case (see Section 3).
We define Γ as the subset of
When Ω is convex we have that Γ is the bottom of Ω. Moreover, for an illustration on what Γ may look like in a non-convex domain, we can regard Fig. 2 below.
The relative boundary of Γ is given by points of tangent vectors
Let

An illustration of S in a non-convex domain.
We remark that when Ω is convex
Let
Moreover, we see that Hypothesis 1.1 implies the existence of segments like in the case of a convex domain:
Let Ω be a domain that satisfies Hypothesis
1.1
. Then, there is a subset
S is a finite union of horizontal segments
In Fig. 2 S is given by the segments:
The proof of Lemma 4.6 is postponed to Section 4.3. We first prove some geometrical results:
Let Ω be a domain that satisfies Hypothesis
1.1
. We have:
If
The number of points in
Given any
Given any
We have
In the set
There is some
There exists
Firstly, implication 1 is an easy consequence of Ω being at least
Secondly, we prove implication 2 for points of tangent vector
Thirdly, given any line
Fourthly, statement 4 is a consequence of assertion 2. Indeed, the only possibility is that there is an infinite number of curves of
Fifthly, assertion 5 is an easy consequence of statements 1 and 2 and of picking the neighbourhoods small enough.
Finally, statement 6 is a consequence of assertion 2. Indeed, we consider
In this subsection we first present the proof of Lemma 4.6; and then, we state some direct consequences.
First of all, we define some useful notation:
Let
Now we are ready to present the proof: Without loss of generality we can suppose that:
First, we remark that Next, let us show that Finally, let us show that For the points in As for the points in Because of the conclusion of Lemma 4.6, the left endpoint of each segment Another easy consequence of Lemma 4.6 is that, if Ω satisfies Hypothesis 1.1, since Given any segment
Summing up, since all this happens for a finite number of situations, for
In order to prove Theorem 1.8 we get an estimate in each segment
First, for getting a pointwise estimate on
So, once we have (4.5), we have to propagate the estimate in

Case 1 of the proof of Theorem 1.8.
Let us first deal with the case 1. We recall that by Remark 4.12, functions like
If
Case 3 of the proof of Theorem 1.8.
As for the case 3 (see Fig. 4 for the notation), we mainly replicate the method of the previous section. In this paragraph and in the following one, we do all the estimates by
Case 4 of the proof of Theorem 1.8.
The last case is that
Finally, by Remark 4.6, since we have (4.4) for all segments in S, we have (1.12).
For the proof of this theorem we define a subdomain
Step 1: Estimates of the crossed derivative. First of all, we consider estimate (1.15) squared, multiplied by
Next, we apply the elliptic estimate (2.12) to
To continue with, we deal with each term of
It is well-known since [12] that by taking enough derivatives we can absorb the trace. Indeed, each time we use (2.12), the weight is, up to a constant, divided by
Step 2: Absorbing the trace terms. Let us start absorbing
Finally, we have to absorb
Summing up, if we combine (5.3) and (5.4), and then do the corresponding absorptions, we have the estimate:
Step 3: Bounding the local terms. In order to bound the local terms, we start estimating everything by a local term of
In order to get in the right-hand side of (5.8) only a weighted local
Finally, we have to estimate the term of
Footnotes
Acknowledgements
I would like to thank my thesis advisor Sergio Guerrero and one anonymous referee for their helpful comments and suggestions. This work was supported by grants from Région Ile-de-France. This work has been partially supported by the ANR research project IFSMACS (ANR-15-CE40-0010).
Existence,uniqueness and regularity of ( 2.6 )
In this section we first prove Lemma 2.6 and then prove Lemma 2.8. Our proofs are classical, since they use Galerkin method and elliptic estimates (see Lemma A.1 below). We follow the steps of [15, Chapter 7.1], but we do the necessary adaptations due to the different boundary conditions.
In order to apply Lemma A.1 it suffices to take As for the proof of Lemma 2.8, it consists of repeating the Galerkin method for
Proof of Proposition 2.13
Throughout this proof we consider
Step 1: Bounding by a trace and a local term. To begin with, we have that
Next, we consider that the divergence satisfies:
Next, we remark that the term of
Step 2: Absorption of the trace. In this step we absorb the traces with the estimates established in Lemma 2.6. We recall that on
Let us first bound the third integral on the right-hand side of (B.3). First, we consider that, integrating by parts:
We can bound the fourth integral at the right-hand side of (B.3) similarly. Indeed, integrating by parts, we get that, if
So, we first deal with the term
Let us now estimate the term
Let us now estimate the first norm at the right-hand side of (B.8). To begin with, since
Finally, we remove the derivative from the local terms. We do it with the usual localizing techniques: we multiply by a cut-off function χ, integrate by parts and use Cauchy–Schwarz weighted inequalities. So, if
