Internal control of systems of semilinear coupled 1-D wave equations
Christophe Zhang

TL;DR
This paper establishes the internal controllability of certain 1-D coupled wave systems using the fictitious control method, addressing both non-degenerate and degenerate cubic couplings with novel trajectory constructions.
Contribution
It extends controllability results to coupled wave equations with degenerate cubic coupling by adapting trajectory construction techniques.
Findings
Proves controllability for systems with non-degenerate coupling.
Establishes controllability for systems with degenerate cubic coupling.
Develops new trajectory construction methods for degenerate cases.
Abstract
We prove the internal controllability of some systems of two coupled wave equations in one space dimension, with one control, under certain conditions on the coupling. To do this we apply the "fictitious control method" in two cases: general systems with a "non-degenerate" coupling, and a particular case where the coupling is "degenerate", namely a cubic coupling. In the latter case, our proof requires to find nontrivial trajectories of the control system that go from to . We build these trajectories by adapting (in space dimension) a construction developed by Jean-Michel Coron, Sergio Guerrero and Lionel Rosier for the study of coupled parabolic systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStability and Controllability of Differential Equations · Advanced Mathematical Physics Problems
Internal control of systems of semilinear coupled 1-D wave equations
Christophe ZHANG
Abstract
We prove the internal controllability of some systems of two coupled wave equations in one space dimension, with one control, under certain conditions on the coupling. To do this we apply the “fictitious control method” in two cases: general systems with a “non-degenerate” coupling, and a particular case where the coupling is “degenerate”, namely a cubic coupling.
In the latter case, our proof requires to find nontrivial trajectories of the control system that go from to . We build these trajectories by adapting (in space dimension) a construction developed by Jean-Michel Coron, Sergio Guerrero and Lionel Rosier for the study of coupled parabolic systems.
Keywords. Wave equations, coupled systems, exact internal controllability, fictitious control method, algebraic solvability, return method.
1 Main results and outline of proof
1.1 Control systems
Let , and . We study the following class of systems:
[TABLE]
where is the control, , , . In what follows we shall note, for any such ,
[TABLE]
We will also study the following particular system:
[TABLE]
These are systems of coupled semilinear wave equations, with different speeds, which we seek to control with a single control, which takes the form of a source term in the first equation. In both cases, as we will study solutions with regularity in order to establish a controllability result with two controls, the initial and final conditions have to satisfy some compatibility conditions. For example, the conditions of order and read as:
[TABLE]
To write the compatibility conditions of order , the idea is to first write the time derivatives of and as a function of their lower order space and time derivatives.
There exists a multivariate polynomial such that
[TABLE]
where denotes the -jet of time derivatives of and , that is
[TABLE]
Now, define by recurrence the following family of operators:
[TABLE]
Then, near the corners , using the equations of system (1.1) and keeping in mind that the control is supported away from the corners, we have
[TABLE]
Now, thanks to the boundary conditions,
[TABLE]
Moreover, it is clear thanks to the recurrence in (1.5) that there exist multivariate polynomials such that:
[TABLE]
where denotes the -jet of space derivatives f and . Now, (1.6) can be written in the corners using only , which gives the following compatibility conditions of order :
[TABLE]
The existence and unicity of solutions to these systems can be derived from TaTsien Li’s general results on quasilinear wave equations (see [LR03] or [Li10, chapter 5, section 5.2]).
The method we present yields two internal controllability results. The first is a local result:
Theorem 1.1**.**
Let , and , such that
[TABLE]
If
[TABLE]
then there exists such that for initial and final conditions
[TABLE]
where denotes the ball centered in and with radius in the usual topology, satisfying (1.8) at the order , there exists such that
[TABLE]
and such that the corresponding solution of (1.1) with initial values satisfies
[TABLE]
and
[TABLE]
The second theorem concerns a system that does not satisfy (1.10). However, it is global, thanks to the system’s homogeneity.
Theorem 1.2**.**
Let , satisfying (1.9). There exists a constant depending on such that, for any given initial and final conditions
[TABLE]
satisfying (1.8) at the order 11, there exists such that
[TABLE]
and such that the corresponding solution of (1.2) with initial values satisfies
[TABLE]
and
[TABLE]
1.2 Related results
Boundary controllability results for quasilinear first order hyperbolic systems, coupled or not, can be found in Tatsien Li’s book ([Li10, chapter 3]).
As for second order systems, results of global boundary and internal controllability for the semilinear wave equation are well known, and were first proven by Enrique Zuazua in [Zua93] and [Zua91]. These articles introduced the use of HUM (Hilbert Uniqueness Method) to prove controllability results for semilinear and quasilinear equations. Boundary controllability results for scalar systems with regularity can be found in [Li10, chapter 5], and can be adapted to coupled systems, and for regularity.
Regarding controllability with a reduced number of controls, results for boundary and internal control of linear wave systems with a reduced number of controls have been proved by Fatiha Alabau-Boussouira ([ABL13] and [AB13]) in any space dimension, using energy methods. This was used by Fatiha Alabau Boussouira in [AB14] to prove the existence of insensitizing controls for a single wave equation, as this is linked to the controllability of linear cascade systems in one space dimension, with the same speed in both equations.
In the nonlinear case, Louis Tebou followed the same path for semilinear equations in [Teb11], where he proves the controllability of cascade systems of the form:
[TABLE]
where is a portion of the boundary, and where is subject to a growth constraint to have global well-posedness. To prove the controllability of such systems, the author first establishes the controllability of a linear problem, using a form of HUM combined with Carleman estimates. Then, using the Schauder fixed-point theorem, he establishes the controllability of the nonlinear problem.
A similar strategy of proof appears in [CGR10] for parabolic systems with cubic coupling. In this case, as for system (1.2), the linearised system around the equilibrium is not controllable. A classical tool to handle this problem in finite dimension is the use of iterated Lie brackets, see for example [Isi95, chapter 2], [NvdS90, chapter 3], and [Cor07, chapter 3]. However, this tool does not work (see for example [Cor07, chapter 5]) for many partial differential equations, including our control system (1.2). In that case, a method to handle this situation is the return method. It consists in looking for trajectories going from to and such that the linearised system around them is controllable (return trajectories). This method has been introduced in [Cor92] for the stabilisation of driftless control systems and in [Cor96] and in [Cor93] for the controllability of the Euler equations of incompressible fluids. Following this method, in [CGR10] the authors build return trajectories, using the structure of the coupling. Then, using Carleman estimates, they prove the controllability of a family of related parabolic linear systems close to the return trajectory, from which they deduce null-controllability using Kakutani’s fixed-point theorem.
In other cases, a phenomenon of loss of derivatives can occur when working with regularities: this can be handled with an inversion theorem of the Nash-Moser type, with a stronger condition on the linearised system. This was done in the case for quasilinear first order hyperbolic systems, which have been studied in [ABCO17], using the “fictitious control method”, which we will explain in the following section. More precisely the result that has been obtained concerns systems of the form:
[TABLE]
with
[TABLE]
1.3 The fictitious control method
The fictitious control method was introduced in [Cor92] and [GBPGa05], and successfully used in [CL14], [ABCO17] and[CG17]. The idea is to first prove a controllability result with two controls (the fictitious controls), then reduce the number of controls, using some sort of fixed-point theorem.
In this article, we apply it to second order hyperbolic systems, which present the same problem of loss of derivatives as the systems in [ABCO17]. This loss of derivatives is handled by using Gromov’s notion of algebraic solvability, which allows for differential operators to be inverted in a special way under some condition (infinitesimal inversion) on their derivative. This yields local results around the equilibrium, but we will also work around other trajectories than the stationary trajectory at the equilibrium, in the spirit of the return method, paying close attention to the regularities involved. Indeed, condition (1.10) from Theorem 1.1 is identical to condition (1.16), and is crucial to solving the system algebraically (see Proposition 2.2). If, as in Theorem 1.2, it is not satisfied, then, following the spirit of the return method, one can build trajectories of the system along which such a condition is verified, at least on some appropriate spatial domain.
Remark 1.1**.**
In both cases, conditions (1.10) and (1.16) appear as a sufficient condition on the coupling for internal controllability with a reduced number of controls. However there is no indication (except in trivial cases like the linearised system above) that this sort of condition is necessary.
We can thus sum up our strategy of proof in three steps:
When necessary, find smooth trajectories around which Theorem 2.1 can be used. 2. 2.
Prove a local controllability result with two controls (fictitious controls) around the return trajectory, using classical boundary control results. 3. 3.
Use Theorem 2.1 to reduce the number of controls to one.
This article is organised as follows: in section 2, we illustrate Gromov’s ideas on a linear example, and then prove Theorem 1.1, which is a case where we do not need to find return trajectories. This will allow us to present how Gromov’s ideas can be applied in a nonlinear setting. In section 3 we prove Theorem 1.2. In this case we need to find return trajectories, and the application of Theorem 2.1 around those trajectories will require a more detailed knowledge of the supports of the return trajectory. Finally section 4 is devoted to possible improvements and further questions on this topic.
2 The non-degenerate case
As mentioned in section 1.3, we build on the method presented in [ABCO17]. One of the main ingredients of this method is the theory of differential operators, and the notion of algebraic solvability, which we briefly present in the subsection below. The use of algebraic solvability in the study of control systems first appears in [Cor92], where it was used to prove the stabilisability of finite dimensional systems without drift with time-varying feedbacks. It was first used in the context of partial differential equations in [CL14] for the control of the Navier-Stokes equation.
But first let us give an informal explanation of our method in the case of a linear system: first we have to rewrite the control problem using differential operators. We note the operator associated with the equation of our control problem. Then, the control problem, given initial and final conditions, consists in finding with those initial and final conditions, and a control such that
[TABLE]
This corresponds to an inversion problem, but with a twist: one has to find an inverse image with the right initial and final conditions. Now, using the solutions to forward- and backward-evolving Cauchy problems corresponding to the initial and final conditions, one can build functions with the right initial and final conditions. The nonlinear version of this is done at the beginning of subsection 2.2. In general, one can do this so that for some ,
[TABLE]
Now suppose is invertible. We can make the following computation, the nonlinear version of which is made in subsection 2.2:
[TABLE]
This seems to yield a solution to the control problem, however we still need to check that the “corrective term” does not change the initial and final conditions. This is where Gromov’s notion of algebraic solvability comes into play: the right property for is not to be invertible, but to be algebraically solvable. That is, that the inverse can also be written as a differential operator:
[TABLE]
for some functions . With this additional property, one can see that, because vanish for ,
[TABLE]
Hence, still has the right initial and final conditions.
2.1 Differential relations and Gromov’s theorem
In this section we sum up some basic notions regarding differential operators, and Gromov’s local inversion theorem for differential operators. More details can be found in [Gro86].
In what follows, is the closure of a non-empty open bounded smooth subset of , and . We note . Recall the definition of the -jet of a function :
[TABLE]
Definition 2.1**.**
A map is a nonlinear differential operator of order if there exists such that
[TABLE]
This clearly implies that is (with the usual topologies), and we denote by
[TABLE]
its Fréchet differential at .
We now define some sort of manifold, over which we can invert these operators:
Definition 2.2**.**
A subset of is a differential relation of order if there exists such that
[TABLE]
It is said to be open if is an open subset of . For , we note
[TABLE]
For classical local inversion theorems, one needs the differential at one point to be invertible. Here the requirement is somewhat stronger: we need the differential at any point to be invertible, with the extra property that the inverse of each differential is also a linear differential operator.
Definition 2.3**.**
Let be a differential relation of order , and let be a differential operator of order . We say that admits an infinitesimal inversion of order over if there exists a family of linear differential operators of order
[TABLE]
such that:
For every , is a differential operator of order d (possibly nonlinear) and it is a -differential operator in . 2. 2.
(Algebraic solvability) For every ,
[TABLE]
We can now state Gromov’s inversion theorem (see [Gro86, Section 2.3.2, main theorem]):
Theorem 2.1** (Gromov).**
Let be a non-empty open differential relation of order , and let be a differential operator of order . Assume that admits an infinitesimal inversion of order over . Let
[TABLE]
[TABLE]
Then, there exists a family of sets and a family of operators where , such that:
(Neighbourhood property) For every , and
[TABLE]
is an open subset of . 2. 2.
(Inversion property)
[TABLE] 3. 3.
(Normalisation property)
[TABLE] 4. 4.
(Regularity and continuity) Let , then for all and ,
[TABLE]
Moreover,
[TABLE]
Finally, if , then (2.5) and (2.6) hold for . 5. 5.
(Locality) For every , and for every , if we have
[TABLE]
then,
[TABLE]
Remark 2.1**.**
The neighbourhood property allows to relate the domains of inversion for each local inversion to each other: local inverses at two “neighbouring” points will be defined on domains that have “neighbouring” sizes. In particular that means the domains of inversions are bound to overlap. The locality property tells us that when this happens (albeit locally), the images of the local inverses agree locally. In the linear case, this corresponds to the fact that when a function vanishes on an open set, its image by any linear differential operator also vanishes on this open set (see the beginning of the section).
2.2 From two controls to one: algebraic solvability
As in the linear case, we first build a trajectory with the right initial and final conditions, but with potentially non-zero on some restricted domain. In terms of control theory, this amounts to solving the control problem with two controls (the fictitious controls), with restricted supports. In fact, for systems of the form
[TABLE]
where , we have the following local controllability result, which is a consequence of boundary control results presented in [Li10, chapter , sections 5.2 and 5.3]:
Proposition 2.1**.**
Let , , such that (1.9) holds. For every satisfying
[TABLE]
there exists such that, for initial and final conditions
[TABLE]
satisfying (1.8) at the order , there exist controls and constants depending on satisfying
[TABLE]
such that the corresponding solution of (2.7) with initial values satisfies
[TABLE]
[TABLE]
This result is a particular case of Proposition 3.2 which we will prove in the following section, when dealing with a degenerate system.
For now, let , , and let be such that (1.9) holds. Let such that (2.8) holds for (note that it also holds for ). Define
[TABLE]
[TABLE]
and let be a smooth closed set such that
[TABLE]
Define the following nonempty open differential relation of order :
[TABLE]
We define the following nonlinear differential operator of order :
[TABLE]
and its differential at :
[TABLE]
We now have the following result, thanks to the definition of :
Proposition 2.2**.**
* admits an infinitesimal inversion of order over .*
Proof.
Let , . Using the fact that never vanishes, if we set:
[TABLE]
then we have
[TABLE]
Moreover, the above formulae clearly show that is a (nonlinear, with the usual topology of ) differential operator of order on , and is also . ∎
We can now apply Theorem 2.1 with , , , . This yields a collection of open sets, which all contain ,
[TABLE]
the open subset of
[TABLE]
and the collection of operators
[TABLE]
Now, thanks to condition (1.10),
[TABLE]
[TABLE]
and
[TABLE]
so that, thanks to the neighbourhood property of Theorem 2.1, there exists such that
[TABLE]
By the continuity property of Theorem 2.1 with , there exists such that for ,
[TABLE]
Proposition 2.1 with yields such that for any initial and final conditions
[TABLE]
there exist two controls , supported in (condition (2.9)), that steer system (2.7) from the given initial conditions to the given final conditions, with the corresponding trajectory satisfying (2.11). Together with (2.12), this implies that there exists such that for initial and final conditions
[TABLE]
the corresponding trajectory of system (2.7) satisfies
[TABLE]
[TABLE]
[TABLE]
Let us now set, keeping in mind the regularity property of Theorem 2.1 with ,
[TABLE]
Then, by the inversion property of Theorem 2.1, and (2.13),
[TABLE]
Now, let us show that on . This will allow us to extend on .
Let . As the are supported in ,
[TABLE]
Thus, using the locality property of Theorem 2.1,
[TABLE]
that is, using the normalisation property:
[TABLE]
We can now extend by setting
[TABLE]
Then,
[TABLE]
and satisfies the same initial, boundary and final conditions as :
[TABLE]
[TABLE]
and
[TABLE]
Finally, we get (1.12) from (2.15) and the continuity property of Theorem 2.1.
This proves Theorem 1.1.
Remark 2.2**.**
Theorem 1.1 actually holds for coupled quasilinear equations:
[TABLE]
where , , and . One can check that when one modifies the recurrence relation in (1.5) to match the new equations, the operators can still be written using only , and , and thus the compatibility conditions will have the same form as (1.8).
Indeed, in this case we can still use Li’s results for the perturbed quasilinear system, as we consider the “perturbations” around . This will yield a “universal” time condition, because the propagation speeds are close to for the perturbed system. On the other hand if we work around a nonzero trajectory (return method), the perturbed quasilinear system could present quite smaller propagation speeds. The final time condition would then depend on the return trajectories that are found.
Theorem 2.2**.**
Let , , such that
[TABLE]
If
[TABLE]
then there exists such that for initial and final conditions
[TABLE]
compatible at the order , there exists such that
[TABLE]
and such that the corresponding solution of (2.23) with initial values satisfies
[TABLE]
and inequality (1.12) holds.
3 A degenerate case: cubic coupling
We now turn to system (1.2). Let us mention a few important specificities of this system. First, around the equilibrium , the linearised system is obviously not controllable:
[TABLE]
the control gives us no influence on the dynamics of.
This fact can also be described as a degenerescence: system (1.2) does not satisfy condition (1.10), so the coupling can be seen as degenerate. Thus, the computations from the beginning of subsection 2.2 do not hold: we cannot work around the stationary trajectory , thus we need to find another trajectory around which to work. More precisely, keeping in mind Proposition 2.2, we look for a return trajectory going from to such that for some smooth closed set ,we have
[TABLE]
Additionnally, will have to satisfy some properties so that a result with two controls can be proved.
To find such a trajectory, we follow the same idea as in [CGR10], where return trajectories are built for coupled heat equations with a cubic coupling. The additional derivative in time simply adds terms and makes for heavier computations. However, condition (3.2) will account for additional work.
We will then prove and use a more general controllability result with two controls. After that, the application of Gromov’s theorem is rather straightforward.
3.1 A preliminary construction: elementary trajectories
In this subsection, we describe a construction of a smooth trajectory of system (1.2) that goes from to . For now we consider condition (3.2) but without any special requirements for .
In what follows, we suppose, without loss of generality (by scaling the space variable) that .
To build trajectories that start at and return there, the idea is to use the cascade structure of the equation: first we find a function such that is the third power of a function . By setting the right conditions at the start and end times, this gives us a return trajectory. The corresponding control will then be .
Let us recall that is on . So, by composition, the cubic root of a function is at all the points where is non-zero. At the points where vanishes, by Taylor’s formula, a fairly simple sufficient condition for to be at those points is for to vanish, along with its first and second derivatives, while its third derivative is non-zero.
Now, to find functions whose image by the wave operator is a third power of a function, we consider the solutions to the corresponding stationary problem, namely functions whose Laplacian is the third power of a function. The solution of this problem corresponds to the following proposition, proven (with instead of ) in [CGR10]:
Proposition 3.1** (Coron, Guerrero, Rosier).**
There exist such that
[TABLE]
In a sense, this proposition gives us the simplest example of functions the second derivative of which is the third power of a smooth function: vanishes exponentially in , and has only one vanishing point on , around which it has a cubic behaviour. The idea of the construction is then to perturb this function of space and make it evolve in time, so slightly as to preserve the properties 3.3 of the stationary problem. Let , and such that (1.9) holds.
Let such that (3.4) holds. Set to be a function such that
[TABLE]
and write for some to be determined.
Remark 3.1**.**
In [CGR10], the authors take
[TABLE]
In our case however, we will see that we need to fit a rectangle of the form inside the support of , see Figure 3. With a polynomial as in (3.5), the smaller gets, the smaller has to be. This in itself would not be an obstruction to prove our controllability result, but using definition (3.4) has the advantage to fix the width of the rectangle for all satisfying (2.8).
Set
[TABLE]
Finally, let be the solution to the stationary problem (see Proposition 3.1). Let , and choose . We now look for in the form
[TABLE]
Note that the fact that vanishes faster than at and compensates the singularity that occurs in the term of the first term of the sum. We will see that the have a similar property, thus ensuring that functions of the form above are indeed . We also require that the satisfy
[TABLE]
where is as defined in Proposition 3.1, so that
[TABLE]
Let us then set, in order to simplify the notations for our computations:
[TABLE]
[TABLE]
which we note, in the new set of variables,
[TABLE]
We are now looking for functions and such that is of class . In order to achieve this, we will work with the new set of variables , and study . We now need to have precise knowledge of the behaviour of when it vanishes.
More precisely, the aim is to write near as:
[TABLE]
Note that has to be negative because of the minus sign in the wave operator. Hence, we look for satisfying
[TABLE]
Additionally, since we have the following condition on :
[TABLE]
we will make sure to have
[TABLE]
Let us now compute and its first, second and third derivatives:
[TABLE]
[TABLE]
Now, for small enough (note that this depends on the value of ),
[TABLE]
and, using the notation ,
[TABLE]
Now, if we impose
[TABLE]
and if we define by
[TABLE]
we get:
[TABLE]
We now compute the first derivative of :
[TABLE]
Again, we impose
[TABLE]
and we set
[TABLE]
so that
[TABLE]
Finally,
[TABLE]
Again we impose
[TABLE]
then, by setting:
[TABLE]
we get:
[TABLE]
Now all that remains is to estimate the third derivative: on , by definition of , we have
[TABLE]
with:
[TABLE]
and
[TABLE]
Let us note that (3.6), combined with the properties of exponential functions, yields
[TABLE]
where the are rational fractions, the poles of which are and . Now, one can see in (3.19), (3.13), (3.15) and (3.17) that the divergent behaviour of these fractions near and is always compensated by the exponential behaviour of and its derivatives. Furthermore, differentiating the does not change this fact. Hence, keeping (3.11) in mind:
[TABLE]
where the notation (resp. ) means times a bounded function of time on (resp. time and space). Hence, near , we have
[TABLE]
the dominant term being . Consequently, using (3.18) and (3.23), for a small enough , there exists a constant such that:
[TABLE]
Thus, on , we can write, thanks to the Taylor-Laplace formula:
[TABLE]
Additionally, by definition of , vanishes exponentially for , and (3.8) ensures that vanishes exponentially for , so that
[TABLE]
We now have
[TABLE]
Moreover, on , thanks to the constraint on the supports of the , we have:
[TABLE]
As, thanks to Proposition 3.1, we have
[TABLE]
for small enough , we have:
[TABLE]
Now, let us recall that, on ,
[TABLE]
So that are bounded near , allowing us to write
[TABLE]
The notation meaning times a bounded function of space on . So for small enough , there exists a function with positive values on , such that
[TABLE]
Finally, for all , vanishes exponentially at , and for all , vanishes exponentially for . Hence,
[TABLE]
This, together with (3.25), proves that
[TABLE]
Now, as is on , by composition we deduce from (3.29) that
[TABLE]
To deal with the missing point , let us recall that for all , for all such that (i.e. ),
[TABLE]
where , and vanishes exponentially for , along with all its derivatives.
We now see that the terms in of are actually in , which compensates the singularity at of the map . Thus, from the smoothness of we get, by composition, . Thus we have proved that, by chosing that verify (3.8), (3.12), (3.14) and (3.16), we get
[TABLE]
Finally, we set
[TABLE]
where is defined by (3.4), the are some functions satisfying (3.8), (3.12), (3.14), and (3.16), and the are defined by (3.6), (3.13), (3.15), and (3.17).
Let us check that we have indeed built a return trajectory: for , the vanish at and , along with all their derivatives. Hence,
[TABLE]
[TABLE]
∎
Remark 3.2**.**
Most of the work in the construction above comes from the vanishing points “in the middle of the domain”. So one could wonder, would it not be simpler to try and build a function that only vanishes, along with all its derivatives, at the points ?
Let us remind that our strategy to build the return trajectory is to start from a solution to the stationary problem, and then make it evolve through time so as to stay “not too far away from it”. But the reason we have vanishing points “in the middle of the domain” has to do with that same stationary problem. More precisely, the stationary problem consists in finding functions that vanish, along with their derivatives, on the boundary of the domain. In our case this condition corresponds to
[TABLE]
We further require that the Laplacians of these functions be third powers of functions. In our case this condition becomes
[TABLE]
Now, we could instead demand that be non-negative (or non-positive). But then, by convexity arguments (or Hopf’s maximum principle), we would get
[TABLE]
Which contradicts condition (3.31). But that condition is very helpful in proving the smoothness of near the boundary. Giving it up would mean setting more conditions on the functions near the boundary, so we would have to give up condition (3.8), and then set additional conditions on the to make sure is well defined (as ), preserve the sign of or more generally its smoothness, in particular near the boundary…Which would probably be more trouble than what we had to do at the vanishing points .
3.2 Covering sets and return trajectories
As mentioned at the beginning of this section, we want to work on a smooth subset of where . However, to do so we need more than the elementary trajectory described above: rather, we use the elementary trajectory as a building block for our final return trajectory. Indeed, let such that (2.8) is satisfied. The preliminary construction gives us a real number (after the right rescaling of the space variable) and, for any , a trajectory such that on , which contains any rectangle of the form with . Moreover, each of these rectangles can be fit into the interior of a smooth closed subset of .
Now there are cases (if is too long and - and consequently, - too small), where none of the rectangles satisfies the Geometric Control Condition (GCC). Thus we cannot apply Proposition 2.1 with controls supported in some , as time condition (3.52) does not hold in these cases. So we need to build a return trajectory such that on a smooth closed set containing a set that satisfies the GCC.
Now there is a simple type of set that would fit our needs for : in Section 2 we worked in , but we do not need the whole rectangle in general for the GCC to be satisfied. We can in fact work with a number of much smaller rectangles, as long as they are close enough to each other:
Definition 3.1**.**
Let , such that (2.8) is satisfied. A -covering set of for system (1.1) is a union of rectangles of the form for some , such that
[TABLE]
Now the idea is to add the elementary trajectories obtained by the preliminary construction on disjoint supports centered in , that are close enough, and with a small enough so that the rectangles form a -covering set. Take small enough for the preliminary construction to work, and such that . We then define the following sequence: take large enough so that
[TABLE]
and define, for ,
[TABLE]
and the trajectory obtained by the preliminary construction corresponding to the chosen , centered in . Let be a smooth closed subset of containing in its interior. Then,
[TABLE]
is a -covering set,
[TABLE]
is a smooth closed set such that , and we can define
[TABLE]
which is supported in , and satisfies (3.2).
3.3 Local controllability with two controls and Gromov inversion
We now have our return trajectory . Now let , and notice that for all , is also a return trajectory, with the same support. Thus, we can now suppose without loss of generality, that
[TABLE]
Let , . Let us consider the trajectory , controlled by , we get the following control system for and :
[TABLE]
This is a coupled semilinear system with a source term, and falls in the category of systems (2.7). The aim of this section is to prove the following proposition:
Proposition 3.2**.**
Let , , such that
[TABLE]
For every satisfying (2.8), for every -covering set of , there exists and constants depending on such that, for initial and final values
[TABLE]
satisfying (1.8) at the order , there exist controls satisfying
[TABLE]
such that the corresponding solution of (2.7) with initial values satisfies
[TABLE]
[TABLE]
Remark 3.3**.**
It is clear, by Definition 3.1, that for any such that (2.8) is satisfied, is a -covering set of . Thus Proposition 3.2 implies Proposition 2.1.
To prove this proposition, we use the following propositions, which are particular cases of more general quasilinear results proved in [LR03] (see also [Li10, chapter 5, sections 5.3 and 5.4]):
Proposition 3.3** (two–sided control).**
Let , , , , . If
[TABLE]
then there exists and a constant depending on , such that for any initial and final values
[TABLE]
there exist controls and satisfying compatibility conditions
[TABLE]
such that the solution to the vector system
[TABLE]
satisfies
[TABLE]
[TABLE]
Proposition 3.4** (one-sided control).**
Let , , , , . If
[TABLE]
then there exists and a constant depending on , such that for any initial and final values
[TABLE]
there exists a control satisfying compatibility conditions
[TABLE]
such that the solution to the vector system
[TABLE]
satisfies
[TABLE]
[TABLE]
Proof of Proposition 3.2.
Let us note
[TABLE]
for some . for every , let such that
[TABLE]
Thanks to Propositions 3.3 and 3.4, Definition 3.1 and conditions (2.8) and (3.46), there exists such that for initial and final values
[TABLE]
satisfying (1.8),
- •
There exist boundary controls at and that steer on from to .
- •
There exist two boundary controls at and that steer on from to , and from to while satisfying the boundary conditions of the system at and .
We note , and the corresponding trajectory on . Then, (3.45) and (3.42) imply
[TABLE]
for some constant .
On the other hand, for small enough, for initial and final conditions
[TABLE]
for the forward evolving solutions of the vector equations
[TABLE]
are defined on . Let us also note the backward evolving solutions of the vector equations on
[TABLE]
Then we define by
[TABLE]
where is a time cut-off function such that
[TABLE]
Note that, by well-posedness of the Cauchy problems, there exists such that the norm of satisfies
[TABLE]
Finally, let us define by smoothly extending on with
[TABLE]
where is a constant depending on the . Then, we define by
[TABLE]
where is a space cut-off function satisfying
[TABLE]
[TABLE]
Then, by construction, we have
[TABLE]
and
[TABLE]
Finally, (3.47), (3.48) and (3.49) imply that there exists a constant such that (3.39) holds, and, by continuity of the , noting
[TABLE]
there exists a constant such that (3.37) holds. ∎
Now, we define
[TABLE]
which is clearly nonempty, and
[TABLE]
Then, we have the following proposition, similar to Proposition 2.2:
Proposition 3.5**.**
* admits an infinitesimal inversion of order over .*
Moreover, thanks to (3.33) and (3.2),
Proposition 3.6**.**
[TABLE]
Now, we can use Theorem 2.1: there exists such that for initial and final conditions
[TABLE]
the corresponding trajectories of system (3.35) with two controls are small enough in norm so that can be inverted locally around , and so that, by the continuity property, satisfies
[TABLE]
Together with (3.34), this yields
[TABLE]
This proves the following local controllability result:
Theorem 3.1**.**
Let , and , such that
[TABLE]
There exists such that for given initial and final conditions
[TABLE]
satisfying (1.8), there exists satisfying
[TABLE]
such that the corresponding solution of (1.2) with initial values satisfies
[TABLE]
and (3.51) holds.
Now let such that (1.8) is satisfied. Let us note
[TABLE]
and . Then,
[TABLE]
and these functions satisfy (1.8). We can now apply Theorem 3.1, and for any support and time compatible with that support, we get with initial and final conditions such that
[TABLE]
Then we also have
[TABLE]
Thus, steers to in .
Finally, to get estimate (1.14), recall (3.51)
[TABLE]
hence, in terms of the original control system,
[TABLE]
This proves Theorem 1.2.
3.4 A general criterion for internal controllability
Let us now give a general definition, which gives the main criterion our return trajectories must fulfill to apply our method:
Definition 3.2**.**
A suitable return trajectory for time is a trajectory of system (1.1), such that
[TABLE]
[TABLE]
[TABLE]
and such that there exists satisfying (2.8), a -covering set , a smooth closed set such that such that
[TABLE]
We can now give a general statement to sum up our work on system (1.2):
Proposition 3.7**.**
Let , and such that (1.9) holds. Suppose condition (1.10) does not hold. If one can find a suitable return trajectory, then system (1.1) is locally controllable in time for initial and final conditions, with trajectories, and with a control supported in .
4 Further questions
4.1 Regularity
Our method requires somewhat specific regularities: ( for the time-derivative) for the initial and final data. As is often the case when using a Nash-Noser scheme, these regularities are probably not optimal. However, if we require for example regularity for the control, , the initial and final data have to be at least one notch smoother. Indeed, note
[TABLE]
and consider to the following computation, where one requires the control and the trajectories to be :
[TABLE]
hence, for a fixed and for characteristics going from to ,
[TABLE]
Now the left-hand side of (4.1) is of class , so we need to upgrade the regularity of to , and that of , and to . This shows a partial derivative loss (in the space dimension) between the trajectory and the control, and, taking , a derivative loss between the initial and final data for , and the control.
For linear cascade systems with smooth coefficients, the same procedure can be repeated on the second equation to establish similar losses of derivatives, showing that because has increased spatial regularity, the initial and final data for have to be . Note that with two controls, this would not be the case, as each control “absorbs” the loss of derivatives in each equation.
Furthermore, it would be interesting to consider other iteration schemes such as the one presented in [Cor07], section 4.2.1, where one considers the following linear system:
[TABLE]
where, for ,
[TABLE]
[TABLE]
Then, by superposition one can restrict to the study of
[TABLE]
But ultimately, this only shifts the problem of the regularity gap between data and control, although we now have a linear system instead of a semilinear one.
On the other hand, it is now well known that in some cases, results that were obtained using the Nash-Moser iteration scheme can also be obtained through more classical iteration schemes, see for example the works of Matthias Gunther ([G8̈9], [G9̈1]). It would be interesting to know if a similar do-over is possible for our result.
Finally, it would be interesting to investigate a version of this result, using other versions of the Nash-Moser implicit function theorem.
4.2 Other degenerate couplings
Our scheme of proof also allows to prove a controllability result for systems of the form
[TABLE]
Indeed, this simply adds a term in the definition of when we build our return trajectory. However, is no longer supported in . The other steps remain unchanged, as the additional term does not prevent the differential operator from being algebraically solvable. So we get a local internal controllability result with the same time conditions, but no condition on the support of the control. Finally, if is homogeneous of degree , we can use the scaling argument to deduce a global result.
In addition to adding a coupling term to the first equation, we can also change the power of the coupling term in the second equation. There are two cases:
Even powers As such, our method cannot work for even powers: indeed, has nonnegative values. In particular, by the same convexity argument as in Remark 3.2, solutions to the stationary problem cannot vanish smoothly in . So the perturbative approach would allow us to build smooth return trajectories only if (and thus ) is spatially supported in all of .
Another way of answering this question would be to switch to complex values, as is done in the appendix of [CGR10] for the quadratic case. 2. 2.
Odd powers Thanks to Proposition 3.7, we know that the part that requires the most work is the construction of return trajectories: say the power of the coupling is , in order to control all the derivatives of up to , we would have to look for in the form
[TABLE]
This would call for ever longer computations, and for now there is no indication that there might or might not be new difficulties with these additional terms.
4.3 Boundary controllability
In this article we have explored a method to prove internal controllability with one control. However, to our knowledge there is no result for boundary controllability with one control for semilinear systems such as (1.1). Although boundary controllability is relatively easy to establish for simple equations, or when there are the same number of controls and equations, we cannot use results on the inversion of differential operators to reduce the number of controls.
Acknowledgements
I would like to thank Jean-Michel Coron, who suggested that I work on this problem, for his continuous support and valuable remarks. I would also like to thank Shengquan Xiang, Amaury Hayat, Pierre Lissy and Frédéric Marbach for our discussions on this problem. Finally, I would like to express my gratitude towards the ETH-FIM for their generous support and their hospitality.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[AB 13] Fatiha Alabau-Boussouira. A hierarchic multi-level energy method for the control of bidiagonal and mixed n 𝑛 \displaystyle n -coupled cascade systems of PDE’s by a reduced number of controls. Adv. Differential Equations , 18(11-12):1005–1072, 2013.
- 2[AB 14] Fatiha Alabau-Boussouira. Insensitizing exact controls for the scalar wave equation and exact controllability of 2-coupled cascade systems of PDE’s by a single control. Math. Control Signals Systems , 26(1):1–46, 2014.
- 3[ABCO 17] Fatiha Alabau-Boussouira, Jean-Michel Coron, and Guillaume Olive. Internal Controllability of First Order Quasi-linear Hyperbolic Systems with a Reduced Number of Controls. SIAM J. Control Optim. , 55(1):300–323, 2017.
- 4[ABL 13] Fatiha Alabau-Boussouira and Matthieu Léautaud. Indirect controllability of locally coupled wave-type systems and applications. J. Math. Pures Appl. (9) , 99(5):544–576, 2013.
- 5[BLR 92] Claude Bardos, Gilles Lebeau, and Jeffrey Rauch. Sharp sufficient conditions for the observation, control, and stabilization of waves from the boundary. SIAM J. Control Optim. , 30(5):1024–1065, 1992.
- 6[CG 17] Jean-Michel Coron and Jean-Philippe Guilleron. Control of Three Heat Equations Coupled with Two Cubic Nonlinearities. SIAM J. Control Optim. , 55(2):989–1019, 2017.
- 7[CGR 10] Jean-Michel Coron, Sergio Guerrero, and Lionel Rosier. Null controllability of a parabolic system with a cubic coupling term. SIAM J. Control Optim. , 48(8):5629–5653, 2010.
- 8[CL 14] Jean-Michel Coron and Pierre Lissy. Local null controllability of the three-dimensional Navier-Stokes system with a distributed control having two vanishing components. Invent. Math. , 198(3):833–880, 2014.
