Time optimal sampled-data controls for heat equations
Gengsheng Wang, Donghui Yang, Yubiao Zhang

TL;DR
This paper develops a framework for time optimal sampled-data controls for heat equations, providing error estimates and connections to distributed controls, advancing numerical methods for such control problems.
Contribution
It introduces a novel approach to approximate time optimal distributed controls using sampled-data controls, with proven error bounds and theoretical properties.
Findings
Error estimates for control and time between sampled-data and distributed controls
Connections established among sampled-data control problems, minimal norm, and minimization problems
Proven optimality of the error bounds in terms of sampling period
Abstract
In this paper, we first design a time optimal control problem for the heat equation with sampled-data controls, and then use it to approximate a time optimal control problem for the heat equation with distributed controls. Our design is reasonable from perspective of sampled-data controls. And it might provide a right way for the numerical approach of a time optimal distributed control problem, via the corresponding semi-discretized (in time variable) time optimal control problem. The study of such a time optimal sampled-data control problem is not easy, because it may have infinitely many optimal controls. We find connections among this problem, a minimal norm sampled-data control problem and a minimization problem. And obtain some properties on these problems. Based on these, we not only build up error estimates for optimal time and optimal controls between the time optimal…
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 · Numerical methods in inverse problems · Advanced Mathematical Modeling in Engineering
Time optimal sampled-data controls for heat equations
Gengsheng Wang School of Mathematics and Statistics, Wuhan University, Wuhan, 430072, China ([email protected]). The author was partially supported by the National Natural Science Foundation of China under grant 11571264.
Donghui Yang School of Mathematical Sciences, Central South University, Changsha, 410075, China ([email protected]). The author was partially supported by the National Natural Science Foundation of China under grant 11371375.
Yubiao Zhang Center for Applied Mathematics, Tianjin University, Tianjin, 300072, China (yubiao¯[email protected]).
Abstract
In this paper, we first design a time optimal control problem for the heat equation with sampled-data controls, and then use it to approximate a time optimal control problem for the heat equation with distributed controls. Our design is reasonable from perspective of sampled-data controls. And it might provide a right way for the numerical approach of a time optimal distributed control problem, via the corresponding semi-discretized (in time variable) time optimal control problem.
The study of such a time optimal sampled-data control problem is not easy, because it may have infinitely many optimal controls. We find connections among this problem, a minimal norm sampled-data control problem and a minimization problem. And obtain some properties on these problems. Based on these, we not only build up error estimates for optimal time and optimal controls between the time optimal sampled-data control problem and the time optimal distributed control problem, in terms of the sampling period, but also prove that such estimates are optimal in some sense.
Keywords. Sampled-data controls, time optimal control, the heat equation, error estimates
2010 Mathematics Subject Classifications. 35K05, 49J20, 93C57
1 Introduction
1.1 Motivation and problems
In most published literature on time optimal control problems, controls are distributed in time, i.e., they can vary at each instant of time. However, in practical application, it is more convenient to use controls which vary only finite times. Sampled-data controls are such kind of controls. In this paper, we will design and study a time optimal control problem for the heat equation with sampled-data controls. And then we use it to approximate a time optimal control problem for the heat equation with distributed controls, through building up several error estimates for optimal time and optimal controls between these two problems, in terms of the sampling period. Such errors estimates have laid foundation for us to replace distributed controls by sampled-data controls in time optimal control problems for heat equations.
Throughout this paper, ; () is a bounded domain with a boundary ; is an open and nonempty subset with its characteristic function ; is the first eigenvalue of with the homogeneous Dirichlet boundary condition over ; denotes the closed ball in , centered at [math] and of radius ; for each measurable set in , denotes its Lebesgue measure; and denote the usual inner product and norm of , respectively; and stand for the usual inner product and norm in , respectively.
First, we introduce a time optimal distributed control problem for the heat equation. Take (with arbitrarily fixed) as our target. For each and , consider the following time optimal distributed control problem:
[TABLE]
where
[TABLE]
and where is the solution to the following distributed controlled heat equation:
[TABLE]
Since as , we find that , for all and . About , we introduce some concepts in the following definition:
Definition 1.1**.**
(i) The number is called the optimal time; is called an admissible control if for some ; is called an optimal control if . (ii) Two optimal controls are said to be different (or the same), if they are different (or the same) on their effective domain \big{(}0,T(M,y_{0})\big{)}.
Several notes on the problem are given in order:
- •
It is shown in Theorem 3.1 that for each and , has a unique optimal control.
- •
In many time optimal distributed control problems for heat equations, controls are taken from . However, the current setting is also significant (see, for instance, [16] and [38]).
Next, we are going to design a time optimal sampled-data control problem for the heat equation. For this purpose, we define the following space of sampled-data controls (where is arbitrarily fixed):
[TABLE]
endowed with the -norm. Here and in what follows, denotes the characteristic function of the interval \big{(}(i-1)\delta,i\delta\big{]} for each . The numbers , , , , are called the sampling instants, while is called the sampling period. Each in the space is called a sampled-data control. For each and each , write for the solution to the following sampled-data controlled heat equation:
[TABLE]
For each , and each , consider the following time optimal sampled-data control problem:
[TABLE]
where
[TABLE]
Since as , we see that , for all , and . With respect to , we introduce some concepts in the following definition:
Definition 1.2**.**
(i) The number is called the optimal time; is called an admissible control if for some ; is called an optimal control if . (ii) A control is called the optimal control with the minimal norm, if is an optimal control and satisfies that for any optimal control . (iii) Two optimal controls are said to be different (or the same), if they are different (or the same) over .
Several notes on this problem are given in order:
- •
The optimal time is a multiple of (see (1.8)). For each , each and each , has a unique optimal control with the minimal norm (see (ii) in Theorem 3.1); Given , there are infinitely many pairs so that has infinitely many different optimal controls (see Theorem 3.2).
- •
We may design a time optimal sampled-data control problem in another way: To find a control in so that enters in the shortest time (which may not be a multiple of ). We denote this problem by . Several reasons for us to design time optimal sampled-data control problem to be are as follows: (i) Each sampled-data control has the form: with some . From the perspective of sampled-data controls, each should be active in the whole subinterval . Thus, our definition for is reasonable. (ii) In the definition , in order to make sure if the control process should be finished, we need to observe the solution (of the controlled equation) at each time. However, in our definition , we only need to observe the solution at time points , with . (iii) Our design on might provide a right way to approach numerically via a discretized time optimal control problem. For instance, if we semi-discretize in time variable, then our design on can be borrowed to define a semi-discretized (in the time variable) time optimal control problem.
1.2 Main results
The main results of this paper are presented in the following three theorems.
Theorem 1.3**.**
Let . Then the following conclusions are true:
(i) For each with , there is so that
[TABLE]
Moreover, depends on , , and continuously.
(ii) For each and , there exists a measurable set (depending also on and ) with so that
[TABLE]
Theorem 1.4**.**
Let . For each and , let and be the optimal control to and the optimal control with the minimal norm to , respectively. Then the following conclusions are true:
(i) For each with , there is so that
[TABLE]
Moreover, depends on , , and continuously.
(ii) For each and , there is a measurable set (depending also on and ) with so that
[TABLE]
Theorem 1.5**.**
Let . For each , let be the optimal control to . Then the following conclusions are true:
(i) For each with , there is so that
[TABLE]
where is any optimal control to . Moreover, depends on , , and continuously.
(ii) For each and , there is a measurable set (depending also on and ) with so that for each , there is an optimal control to so that
[TABLE]
for some positive constant .
Several remarks on the main results are given in order.
- •
Theorem 1.3 and Theorem 1.4 present two facts. First, the error between and and the error between and have the order with respect to the sampling period . Second, this order is optimal, because of the lower bound estimates (1.11) and (1.13), and because of the property that with any . Notice that when , (1.11) may not be true (see Theorem 6.2, as well as Remark 6.3).
- •
Theorem 1.5, as well as Theorem 1.4, presents two facts. First, in , the optimal control with the minimal norm differs from some of other optimal controls, from perspective of the order of the errors. Second, the order of the error between any optimal control of and the optimal control to is , with respect to . Moreover, this order is optimal in the sense (ii) of Theorem 1.5.
- •
Since we aim to approximate by and because the efficient domain of is , we take the -norm in the estimates in Theorem 1.4 and Theorem 1.5.
- •
There have been many publications on optimal sampled-data control problems (with fixed ending time point). In [6] (see also [5]), the authors built up the Pontryagin maximum principle for some optimal sampled-data control problems. In [7], the authors showed that for some LQ problem, the optimal sampled-data control converges to the optimal distributed control as the sampling period tends to zero. In [33], the authors built up some error estimates between the optimal distributed control and the optimal sampled-data control for some periodic heat equations. About more works on sampled-data controls, we would like to mention [1, 3, 4, 8, 13, 14, 19, 20, 23, 32] and the references therein.
- •
There have been some literatures on the approximations of time optimal control problems for the parabolic equations. We refer to [15, 41] for semi-discrete finite element approximations, and [34, 43] for perturbations of equations. About more works on time optimal control problems, we would like to mention [2, 10, 11, 16, 17, 18, 21, 22, 25, 27, 30, 31, 35, 37, 38, 39, 40, 42, 44] and the references therein.
- •
About approximations of time optimal sampled-data controls, we have not found any literature in the past publications.
1.3 The strategy to get the main results
The strategy to prove the main theorems is as follows: We first introduce two norm optimal control problems which correspond to time optimal control problems and respectively; then get error estimates between the above two norm optimal control problems (in terms of ); finally, obtain the desired error estimates between and (in terms of ), through using connections between the time optimal control problems and the corresponding norm optimal control problems (see (iii) of Theorem 3.1 and Theorem 4.1, respectively).
To explain our strategy more clearly, we will introduce two norm optimal control problems. The first one corresponds to and is as:
[TABLE]
where , and is the solution of (1.5) with being replaced by the zero extension of over . The second one corresponds to and is defined by
[TABLE]
where , , ,
[TABLE]
and is the solution of (1.5) with being replaced by the zero extension of over .
Some concepts about the above two norm optimal control problems are given in the following definition:
Definition 1.6**.**
(i) In the problem , is called the optimal norm; is called an admissible control if ; is called an optimal control if and .
(ii) In the problem , is called the optimal norm; is called an admissible control if ; and is called an optimal control if and .
We mention that both and have unique nonzero minimizers in (see Theorems 4.2-4.3).
Inspired by [9], we study the above two minimal norm control problems by two minimization problems. The first one corresponds to and reads
[TABLE]
where is the solution to the adjoint heat equation:
[TABLE]
The second minimization problem corresponds to and is as:
[TABLE]
where is defined by
[TABLE]
We mention that both and have unique nonzero minimizers in (see Theorems 4.2-4.3).
We prove Theorem 1.3 by the following steps:
- (a)
Build up connections between and (see (iii) of Theorem 3.1); and connections between and (see Theorem 4.1).
- (b)
Obtain the lower and upper bounds for the derivative of the map (see Theorem 5.2).
- (c)
Compute the error estimate between the map and the map (see Theorem 5.3).
- (d)
Get (i) of Theorem 1.3, with the aid of the above (a)-(c).
- (e)
By using the above (a)-(c) again, we build up sets and obtain related properties in Theorem 5.4, which leads to (ii) of Theorem 1.3.
The steps to prove Theorem 1.4 and Theorem 1.5 are as follows:
- (1)
Build up connections between and (see (iii) of Theorem 3.1), and connections between and (see Theorem 4.1).
- (2)
With the aid of the connections obtained in (1), we can transfer the estimate in (i) of Theorem 1.4 into an estimate between optimal controls of and .
- (3)
Find connections between (or ) and (or ) (see Theorem 4.3 and Theorem 4.2, respectively).
- (4)
Obtain the error estimate between the minimizers of and .
- (5)
Using the connections obtained in (3) and the estimate obtained in (4), we get an error estimate between optimal controls of and . This, along with results in (2), leads to the estimate in (i) of Theorem 1.4.
- (6)
Using connections obtained in (1) and (3), and using Theorem 5.4, we prove the estimate in (ii) of Theorem 1.4.
- (7)
Obtain the least order of the diameter of the set (in , in terms of , (see Lemma 6.1). Here,
[TABLE]
- (8)
Derive the estimates in Theorem 1.5, with the aid of Lemma 6.1 and the estimates in Theorem 1.4.
We would like to give the following note:
- •
The above introduced strategy was used to study other properties of time optimal distributed control problems (see, for instance, [34] and [42]). It could be used to study numerical approximations of time optimal distributed control problems, via discrete time optimal control problems.
The rest of the paper is organized as follows: Section 2 shows a kind of approximate null controllability for the equation (1.7). Section 3 concerns with the existence and uniqueness of time optimal control problems. Section 4 provides some connections among time optimal control problems, norm optimal control problems and some minimization problems. Section 5 presents several auxiliary estimates. Section 6 proves the main results. Section 7 (Appendix) gives two lemmas. The first one presents an equivalence between controllability and observability in an abstract setting, which was taken from [36]. The second one gives an inequality which was quoted from [29]. Since both [36] and [29] have not appeared, we put them and their proofs in Appendix.
2 -approximate null controllability with a cost
In this section, we present a kind of approximate null controllability for the sampled-data controlled equation (1.7). Such controllability will be defined in the next Definition 2.1 and will play a key role in getting some estimates in Section 5.
Definition 2.1**.**
(i) Let . Equation (1.7) is said to have the -approximate null controllability with a cost over , if for any , there is so that for each , there is (see (1.18)) satisfying that
[TABLE]
(ii) Equation (1.7) is said to have the -approximate null controllability with a cost, if it has the -approximate null controllability with a cost over , for each .
To prove the -approximate null controllability with a cost for Equation (1.7), we need some preliminaries. For each and , we let
[TABLE]
Lemma 2.2**.**
For each and each ,
[TABLE]
Proof.
Arbitrarily fix and . To prove (2.3), it suffices to show
[TABLE]
By (2.2), one can directly check that
[TABLE]
which leads to (2.4). This ends the proof of this lemma. ∎
The following interpolation inequality plays an important role in the proof of the -approximate null controllability with a cost.
Lemma 2.3**.**
There exists so that when ,
[TABLE]
Proof.
Let . Arbitrarily fix . We define a function over by
[TABLE]
By [29, (iii) of Theorem 2.1], (Since the paper [29] has not appeared, we put [29, (iii) of Theorem 2.1] and its proof in Appendix, see Lemma 7.2.), there is so that
[TABLE]
Two facts are given in order: First, it follows from (2.6) that
[TABLE]
Second, write for the family of all eigenvalues of with the zero Dirichlet boundary condition so that . Let be the family of the corresponding normalized eigenvectors. Let for some . Then it follows that
[TABLE]
Since for each , it follows from (2.6) and the above equality that
[TABLE]
Finally, the facts (2.8) and (2.9), along with (2.7), lead to (2.5). This ends the proof. ∎
The next Theorem 2.4 contains the main results of this section. The conclusion (iii) in Theorem 2.4 will play an important role in our further studies.
Theorem 2.4**.**
The following conclusions are true:
(i) Equation (1.7) has the -approximate null controllability with a cost if and only if given , and , there is (which also depends on and ) so that
[TABLE]
where is given by (1.22).
(ii) Given and , Equation (1.7) has the -approximate null controllability with a cost over .
(iii) Given , and , the constants in (2.10) and (2.1) can be taken as
[TABLE]
Proof.
We first prove the conclusion (i). Arbitrarily fix , and . We will put our problems under the framework of [36, Lemma 5.1] in the following manner: Let , and . Define operators and by
[TABLE]
One can directly check that and are given respectively by
[TABLE]
From these, Definition 2.1 and (2.10), we can apply [36, Lemma 5.1] to get the conclusion (i) of Theorem 2.4. (Since the paper [36] has not appeared, we put [36, Lemma 5.1] and its proof in Appendix, see Lemma 7.1.)
We next prove the conclusions (ii) and (iii). Arbitrarily fix , and . By the conclusion (i), we find that it suffices to show (2.10) with the triplet . To this end, we use (2.5) (where and , with the integer so that ) to get that for each ,
[TABLE]
where is given by (2.5). Then by Young’s inequality, we find that for each ,
[TABLE]
Two observations are given in order: First, it follows from (1.22) that for each ,
[TABLE]
Second, since
[TABLE]
one can directly check that
[TABLE]
Finally, from (2.12), (2.13) and (2.14), we get (2.10), with given by (2.11), where may differ from that in (2.14). This proves (ii), as well as (iii).
In summary, we end the proof of Theorem 2.4. ∎
3 Existence and uniqueness of optimal controls
In this section, we will prove that for each , has the unique optimal control, while for some , has infinitely many optimal controls. The later may cause difficulties in our studies. Fortunately, we observe that the optimal control with the minimal norm to (see Definition 1.2) is unique. The first main theorem in this section is stated in the next Theorem 3.1. It deserves mentioning what follows: The conclusion (iii) of Theorem 3.1 should belong to the materials in the next section. The reason that we put it here is that we will use it in the proof of the non-uniqueness of optimal controls to . More precisely, in the proof of Lemma 3.4, we will use it.
Theorem 3.1**.**
Let . Let . The following conclusions are true:
(i) The problem has a unique optimal control.
(ii) For each , has a unique optimal control with the minimal norm.
(iii) Let (with ) be the optimal control with the minimal norm to . Then (the restriction of over ) is an optimal control to and the -norm of is .
Proof.
Arbitrarily fix and . We will prove conclusions (i), (ii) and (iii) one by one.
(i) Because as , the null control is an admissible control to , which implies that has an admissible control. Then by the standard way as that used in the proof of [10, Lemma 1.1], one can show that has an optimal control.
To show the uniqueness of the optimal control to , we first notice that each optimal control to has the property that
[TABLE]
(The property (3.1) can be proved by the same way as that used to show [16, Lemma 4.3].) Next, we notice that if and are optimal controls to , then is also an optimal control to . From this, (3.1) and the parallelogram law in , we can easily use the contradiction argument to get the uniqueness. This ends the proof of the conclusion (i).
(ii) Arbitrarily fix . We first show that has an optimal control. Indeed, since the null control is clearly an admissible control to , it follows by the definition of (see (1.8)) that there exists so that
[TABLE]
Meanwhile, since , by the definition of the infimum in (1.8), we see that there is and so that
[TABLE]
[TABLE]
From (3.2) and (3.3), we find that , which leads to that . This, along with (3.2) and (3.4), yields that , which, together with (3.4), implies that is an optimal control to .
Next, we will prove that has a unique optimal control with the minimal norm. Indeed, since is a closed subspace of , by Definition 1.2, one can use a standard way (i.e., taking a minimization sequence) to show the existence of the optimal control with the minimal norm to . To show the uniqueness, we let and be two optimal controls with the minimal norm. By Definition 1.2, one can easily check that is also an optimal control with the minimal norm to . By making use of Definition 1.2 again, we find that
[TABLE]
These, along with the parallelogram law for , yields that
[TABLE]
So has a unique optimal control with the minimal norm.
(iii) Let be the optimal control with the minimal norm to . We will show that is an optimal control to . Indeed, we have that
[TABLE]
from which, one can easily check that is an admissible control to . Then by the optimality of and the second inequality in (3.5), we see that
[TABLE]
Meanwhile, since has an admissible control, we can use a standard argument (see for instance the proof of [10, Lemma 1.1]) to show that has an optimal control . Write for the zero extension of over . Then we have that
[TABLE]
From (3.7) and (3.6), it follows that is an optimal control to . Since is the optimal control with the minimal norm to , we see from (3.6), (ii) of Definition 1.2 and the second equality in (3.7) that
[TABLE]
The above, together with the first conclusion in (3.5), implies that is an optimal control to and that
[TABLE]
In summary, we end the proof of Theorem 1.5. ∎
The next theorem concerns with the non-uniqueness of optimal controls to .
Theorem 3.2**.**
Let . Then there are sequences dense in and , with , so that for each , the problem has infinitely many different optimal controls.
To prove Theorem 3.2, we need two lemmas.
Lemma 3.3**.**
Let . Then for each , with , it stands that
[TABLE]
Proof.
Let so that . Then by (1.8), we see that
[TABLE]
Thus, (3.8) is equivalent to the following inequality:
[TABLE]
To prove (3.10), we let be an optimal control to . Then we have that
[TABLE]
According to (3.11) and (3.9), is an admissible control to . Then by the optimality of and the first inequality in (3.11), we get that
[TABLE]
which leads to the first inequality in (3.10).
We now show the second inequality in (3.10). By contradiction, we suppose that
[TABLE]
Then we would obtain from (3.12) that has an admissible control, since . Thus, by a standard way (see for instance the proof of [10, Lemma 1.1]), one can prove that has an optimal control . Hence,
[TABLE]
Write for the zero extension of over . From (3.13) and (3.12), we find that is an admissible control to . Then by the optimality of , we get that , which contradicts (3.9). Thus, the second inequality in (3.10) is true. We end the proof of this lemma. ∎
Lemma 3.4**.**
Let . Then for each and , there exists an integer so that .
Proof.
Arbitrarily fix . It is clear that for all and . Thus, we only need to show that for any and , , when . By contradiction, suppose that it were not true. Then there would be and so that
[TABLE]
Let , with , be an optimal control to (see (ii) of Theorem 3.1). Then we have that
[TABLE]
By the last inequality in (3.15), Hölder’s inequality and (3.14), we can easily check that
[TABLE]
This, along with (3.14) and the first conclusion in (3.15), yields that
[TABLE]
which contradicts the assumption that . This ends the proof. ∎
We are now on the position to prove Theorem 3.2.
Proof of Theorem 3.2.
Choose a sequence dense in so that
[TABLE]
By Lemma 3.4, there exists an increasing subsequence (in ), with , so that
[TABLE]
Write , . Then, by (3.17), we can apply Lemma 3.3 to get that
[TABLE]
This, along with (3.16), yields that
[TABLE]
The key to show Theorem 3.2 is to claim that for each , has at least two different optimal controls. By contradiction, we suppose that for some , had a unique optimal control. To get a contradiction, we define two convex subsets in as follows:
[TABLE]
We first show that
[TABLE]
i.e., contains only one element. In fact, by (ii) and (iii) of Theorem 3.1, the optimal control with the minimal norm to satisfies that
[TABLE]
These imply that . We next show that contains only one element. Suppose, by contradiction, that it contained two different elements and . Then by the definition of , there would be two different controls and so that
[TABLE]
[TABLE]
Since , we have that . From this (3.20) and (3.21), one can easily check that
[TABLE]
Meanwhile, since , by the second inequality in (3.20) and the second inequality in (3.21), using the parallelogram law, we find that
[TABLE]
which, together with (3.18), indicates that
[TABLE]
From this and (3.22), we see that is an optimal control to . This, along with Definition 1.2 and the conclusions (ii) and (iii) of Theorem 3.1, yields that
[TABLE]
which contradicts (3.23). Hence, (3.19) is true.
Next, by the definitions of and , one can easily check that each element of can be expressed as:
[TABLE]
Since it was assumed that had a unique optimal control, it follows from (3.24) that contains only one element. This, along with (3.19), yields that
[TABLE]
By (3.25), we can apply the Hahn-Banach separation theorem to find , with , so that
[TABLE]
This, along with (3.25), yields that
[TABLE]
From now on and throughout the proof of Theorem 3.2, we simply write for ; simply write and for (see (1.20)) and (see (1.22)), respectively.
Arbitrarily fix . Three facts are given in order. Fact one: Since (see (3.18)), it follows from the definition of that
[TABLE]
This, along with (3.26), yields that
[TABLE]
Fact two: One can directly check that
[TABLE]
Fact three: we have that
[TABLE]
The proof of (3.29) is as follows: Let and let be the zero extension of over . Since , it follows by (1.6), (2.2) and (1.22) that and (where is treated as its zero extension over ). Then, by Lemma 2.2, we obtain (3.29).
Now, from facts (3.27), (3.28) and (3.29), we see that
[TABLE]
Since was arbitrarily taken from , the above inequality implies that
[TABLE]
Since (see (3.17)), we apply (3.30) and Lemma 2.3 (where and ) to get that in . Then from the backward uniqueness property for the heat equation (see, for instance, [26]), we deduce that . This leads to a contradiction. Hence, we ends the proof of the key claim: For each , has at least two different optimal controls.
Finally, we observe that any convex combination of optimal controls to (with ) is still an optimal control to . Therefore, for each , has infinitely many different optimal controls. This ends the proof of Theorem 3.2. ∎
4 Connections among different problems
This section presents connections among , and (and among , and ). We define, for each ,
[TABLE]
[TABLE]
We mention that for each (because the semigroup has the exponential decay).
4.1 Connections between time optimal control problems and norm optimal control problems
We first present the following equivalence theorem. We will omit its proof, because it can be proved by the same way as one of proofs of [34, Proposition 4.1], [43, Proposition 3.1] and [42, Theorem 1.1 and Theorem 2.1].
Theorem 4.1**.**
Let . Let be given by (4.1). Then the following conclusions are true:
(i) The function is strictly decreasing and continuous from onto . Moreover, .
(ii) When and , and .
(iii) The function is strictly decreasing and continuous from onto .
(iv) For each , the optimal control to , when restricted on , is the optimal control to . For each , the zero extension of the optimal control to is the optimal control to .
We next recall (iii) of Theorem 3.1 for the connections between and .
4.2 Connections between norm optimal control problems and the minimization problems
The first theorem of this subsection concerns with connections between problems and (given by (1.19)). Its proof can be done by the same methods as those in the proofs of of Lemma 3.5 and Proposition 3.6 in [34]. We omit it here.
Theorem 4.2**.**
Let and let , with given by (4.1). Then the following conclusions are true:
(i) The functional has a unique nonzero minimizer in .
(ii) Problem has a unique optimal control , which satisfies that
[TABLE]
and that
[TABLE]
(iii) It holds that .
The next theorem deals with connections between (given by (1.17)) and (given by (1.21)). Recall (1.22) for the definition of .
Theorem 4.3**.**
Let . Let (given (4.2)). Then the following conclusions are true:
(i) The functional has a unique minimizer in . Moreover, and
[TABLE]
(ii) Problem has a unique optimal control , which verifies that
[TABLE]
(where is the minimizer of ) and that
[TABLE]
(iii) .
Proof.
(i) First of all, we show the existence of minimizers of . Indeed, by (1.21), one can easily see that is continuous and convex over . We now show its coercivity. Since , we have that (see (4.2)). Thus, we can apply Theorem 2.4 to see that both (2.10) and (2.11) are true. By taking \varepsilon=\big{(}\frac{r}{2\|y_{0}\|}\big{)}^{2} in (2.10), we find that for each ,
[TABLE]
where is given by (2.11). The above yields that for each ,
[TABLE]
From this and (1.21), one can easily check that
[TABLE]
which leads to the coercivity of over . Hence, has at least one minimizer in .
Next, we claim that [math] is not a minimizer of . By contradiction, suppose that it were not true. Then we would find from (1.21) that for all and ,
[TABLE]
Sending to [math] in the above leads to that
[TABLE]
This yields that
[TABLE]
Since , the above, along with (4.1), indicates that , which contradicts the assumption that (given by (4.2)). Thus, [math] is not a minimizer of .
We now show the uniqueness of the minimizer of . To this end, we claim that the first term on the right hand side of (1.21) is strictly convex. When this claim is proved, it follows from (1.21) that is strictly convex over . So its minimizer is unique.
To show the above claim, we first observe from (1.22) that
[TABLE]
By this, we see that the first term on the right hand side of (1.21) is convex. Next, we suppose, by contradiction, that this term were not strictly convex. Then, by the convexity of this term, there would be and , with , so that
[TABLE]
which, along with (4.9), yields that for each ,
[TABLE]
From this and the strict convexity of , we see that for each ,
[TABLE]
Notice that . Thus, we can apply Lemma 2.3 (where , and ), and use (4.10) to obtain that . This, together with the backward uniqueness of the heat equation, yields that in , which leads to a contradiction. Hence, the first term on the right hand side of (1.21) is strictly convex.
In summary, conclude that has a unique minimizer .
Finally, we prove that the minimizer satisfies (4.5). By contradiction, suppose that it were not true. Then we would have that
[TABLE]
Since is a piece-wise constant function from to (see (1.22)), it follows from (4.11) that
[TABLE]
By (4.12), we can apply Lemma 2.3 (where , and ) to get that
[TABLE]
This, along with the backward uniqueness for the heat equation, yields that in , which leads to a contradiction. Therefore, (4.5) holds. This ends the proof of the conclusion (i) of Theorem 4.3.
(ii) Let be the minimizer of . Let be given by (4.6). It suffices to show that is the unique optimal control to and satisfies (4.7). From now on and throughout the proof of Theorem 4.3, we simply write and for and ; and simply write for .
We first show that is an admissible control to and satisfies (4.7). By (1.21), one can easily check that the Euler-Lagrange equation associated with the minimizer is as follows:
[TABLE]
We claim that for each ,
[TABLE]
To this end, we arbitrarily fix . Let and be the zero extensions of and over . Then by (2.2) and (1.22), we see that
[TABLE]
where and are treated as their zero extensions over . Then by Lemma 2.2, we have that
[TABLE]
which leads to (4.14). Now, from (4.13) and (4.14), it follows that for each ,
[TABLE]
This, along with (4.13), yields that
[TABLE]
From (4.15), is an admissible control to , and satisfies (4.7).
We next prove that is an optimal control to . To this end, we arbitrarily fix an admissible control to . Then we have that . This, together with (4.15), implies that
[TABLE]
Meanwhile, by Lemma 2.2 (where are taken as the zero extensions of and over respectively), and by (2.2) and (1.22), one can easily verify that
[TABLE]
Since and are piece-wise constant functions (see (1.18) and (1.6)), it follows from (4.6), (4.17) and (4.16) that
[TABLE]
This, along with (4.5), yields that . Because is an arbitrarily fixed admissible control to , we see that is an optimal control to .
Finally, we prove the uniqueness of the optimal control to . By contradiction, we suppose that had two different optimal controls and . Then one could easily check that is still an optimal control. Since , we can use the parallelogram law to get that
[TABLE]
which contradicts the optimality of to . This proves the conclusion (ii) of Theorem 4.3.
(iii) Taking in (4.13) leads to that
[TABLE]
Since is the minimizer of , the above equality, along with (1.21), indicates that
[TABLE]
Meanwhile, from (ii) of Theorem 4.3, we see that
[TABLE]
This, along with (4.18) leads to the conclusion (iii) of Theorem 4.3.
In summary, we end the proof of Theorem 4.3. ∎
5 Several auxiliary estimates
This section presents several estimates, as well as properties, on minimizers (of and ), the minimal norm functions and the minimal time functions. These estimate will play important roles in the proofs of the main theorems.
5.1 Some estimates on minimizers
The following theorem concerns with the -estimates on the minimizers of the functionals and .
Theorem 5.1**.**
Let . Let (given by (4.2)) and (given by (4.1)). Write and for the minimizers of and , respectively. Then the following conclusions are true:
(i) There is a positive constant so that
[TABLE]
(ii) There is a positive constant so that
[TABLE]
Proof.
Throughout the proof, stands for a positive constant depending only on and . It may vary in different contexts.
(i) We begin with proving (5.1). From (4.8), we find that
[TABLE]
Since is the minimizer of , the above inequality, along with (1.21), implies that
[TABLE]
which leads to (5.1).
To show (5.2), we need two estimates related to the optimal control of . We first claim that
[TABLE]
Indeed, since , we have that . Thus, by (ii) of Theorem 2.4, Equation (1.7) has the -approximate null controllability with a cost. From this, Definition 2.1 (see (2.1)), and (iii) of Theorem 2.4 (see (2.11)), we find that for , there is so that
[TABLE]
Since , it follows from (5.6) that is an admissible control to . Then by the optimality of and , and by (5.6), we find that
[TABLE]
which leads to (5.5).
Next, we claim that
[TABLE]
For this purpose, we consider the following equation:
[TABLE]
where and . Multiplying on both sides of Equation (5.11) and then integrating it over , after some computations, we obtain that for each ,
[TABLE]
Meanwhile, multiplying on both sides of Equation (5.11) and then integrating it over , after some computations, we obtain that for each ,
[TABLE]
From (5.13) and (5.12), we deduce that for each , and ,
[TABLE]
Then by a standard density argument, we can easily derive from the above inequality that
[TABLE]
Since , the above, along with (5.5), leads to (5.7).
We now show the second inequality in (5.2). From (4.7), we see that
[TABLE]
which, together with (5.1) and (5.7), leads to the second inequality in (5.2).
Then, we show the first inequality in (5.2). Simply write for . Multiplying by on both sides of the equation satisfied by , and then integrating it over , after some computations, we obtain that
[TABLE]
From this, it follows that
[TABLE]
which leads to the first inequality in (5.2). This ends the proof of the conclusion (i).
(ii) Arbitrarily fix so that . For each integer , let be the integer so that
[TABLE]
We first claim
[TABLE]
In fact, for each , has a unique optimal control (see (ii) of Theorem 4.3). Then, by (5.14), one can easily check that the zero extension of over is an admissible control to . From this and the optimality of , one can easily check that
[TABLE]
Since and because for all (which follows from (5.14) and (4.2)), we can apply (iii) of Theorem 4.2 and (iii) of Theorem 4.3 (with =), and use (5.16) to obtain (5.15).
For each integer , write for the minimizer of . The key is to show that on a subsequence of , still denoted in the same manner,
[TABLE]
(Here, is the minimizer of .) To this end, we notice that for all (which follows from (5.14) and (4.2)). Thus, we can use the second inequality in (5.2) (where ; ) to find that is bounded in . So there exists a subsequence of , still denoted in the same manner, and some so that
[TABLE]
From the above, we see that in order to show (5.17), it suffices to prove that . For this purpose, we first claim that for each ,
[TABLE]
[TABLE]
To show (5.19), we arbitrarily fix . By (5.14), we see that . This, along with the time-invariance of Equation (1.20), yields
[TABLE]
Meanwhile, since is contractive, we have that
[TABLE]
Using the triangle inequality, by (5.21) and (5.22), we obtain (5.19).
To show (5.20), we arbitrarily fix and . Three facts are given in order. Fact one: Since , we can use the time-invariance of Equation (1.20) to get that
[TABLE]
Fact two: Since , by (1.22) and the time-invariance of Equation (1.20), we can easily check that
[TABLE]
Fact three: Since is contractive, by (1.22), we see that
[TABLE]
The above three facts (5.23), (5.1) and (5.25), together with the triangle inequality, leads to (5.20).
Two observations are given in order: First, since is uniformly continuous on , we see that two supremums in (5.19) and (5.20) tend to zero as . Second, it follows by (5.14) that . From these two observations, (5.18), (5.19) and (5.20), one can easily check that
[TABLE]
These, together with (1.19), (1.21) and (5.18), indicate that
[TABLE]
This, along with (5.15) and (1.19), yields that
[TABLE]
Hence, is a minimizer of . Then, by the uniqueness of the minimizer, we see that . Hence, (5.17) is true.
Finally, since and because for all (which follows from (5.14) and (4.2)), the conclusion (i) in Theorem 5.1 is available for =. Thus, by (5.1), the second inequality in (5.2) (with =) and (5.17), using the fact that (see (5.14)), we can easily obtain (5.3) and the second inequality in (5.4). Besides, by the same way as that used to prove the first inequality in (5.2), we get the first inequality in (5.4).
In summary, we end the proof of Theorem 5.1. ∎
5.2 Some estimates related to minimal norm functions
Several inequalities related to the minimal norm functions and will be presented in the following two theorems.
Theorem 5.2**.**
Let . Then there is so that for each pair , with (given by (4.1)),
[TABLE]
Proof.
Arbitrarily fix a pair , with . The proof is organized by the following two steps:
Step 1. To show the first inequality in (5.26)
By (i) of Theorem 4.1, we have that
[TABLE]
Then by (iii) in Theorem 4.1, we see that
[TABLE]
Let be an optimal control to . Then we find that
[TABLE]
It follows from the first inequality in (5.29) that
[TABLE]
Since
[TABLE]
the above, along with Hölder’s inequality and the second inequality in (5.29), yields that
[TABLE]
Next, we define a control over as follows:
[TABLE]
From (5.33) and the second inequality in (5.29), it follows that
[TABLE]
Meanwhile, we let
[TABLE]
Since over \big{(}T(M_{1},y_{0}),\infty\big{)}, by (5.33), (5.30) and (5.35), one can easily check that
[TABLE]
Now, it follows from (5.34) and (5.36) that is an admissible control to , which drives the solution to at time . This, along with the optimality of , yields that
[TABLE]
From this, (5.28) and (5.35), we find that
[TABLE]
Since and (see (5.27)), the above leads to the first inequality in (5.26). This ends the proof of Step 1.
Step 2. To show the second inequality in (5.26)
Let be the minimizer of . Throughout this step, we simply write and for and respectively. First, we claim that
[TABLE]
Indeed, according to [28, Theorem 6.13 in Chapter 2], there is so that
[TABLE]
From this, we see that
[TABLE]
This, along with [12, Proposition 3.1], yields that for some ,
[TABLE]
Meanwhile, by (ii) of Theorem 4.3 and the time-invariance of Equation (1.20), we see that
[TABLE]
This, along with (5.38), yields that
[TABLE]
which leads to (5.37).
Next, since , it follows by (i) and (ii) of Theorem 4.1 that . From this and (iii) of Theorem 4.2, it follows that
[TABLE]
This, along with (1.19), yields that
[TABLE]
At the same time, by the time-invariance of Equation (1.20), we have that
[TABLE]
Since the semigroup is contractive, from (5.41), we see that
[TABLE]
From (5.41), we also have that
[TABLE]
Now, by (5.40), (5.42) and (5.2), we obtain that
[TABLE]
By this, (5.39) and (5.37), we get that
[TABLE]
Finally, by [12, Proposition 3.1], we can find so that
[TABLE]
From the first equality in the above, we see that is an admissible to . This, along with the second inequality in the above and the optimality of , indicates
[TABLE]
which, along with (5.44), leads to the second inequality in (5.26) for some .
In summary, we finish the proof of Theorem 5.2. ∎
Theorem 5.3**.**
Let . Let and be given by (4.2) and (4.1) respectively. Then there is so that for each ,
[TABLE]
Proof.
Arbitrarily fix . Let be the minimizer of . Throughout the proof of Theorem 5.3, we simply write respectively and for (see (1.20)) and (see (1.22)). We organize the proof by several steps as follows:
Step 1. To prove that
[TABLE]
Since (see (1.6)), we find that each admissible control to is also an admissible control to . This, along with (1.16) and (1.17), yields that , from which, as well as (iii) of Theorems 4.2 and (iii) of Theorem 4.3, it follows that
[TABLE]
This, along with (1.19) and (1.21), yields that
[TABLE]
which leads to (5.46).
Step 2. To show that
[TABLE]
First, we claim that for each ,
[TABLE]
where is given by (2.2). Indeed, for an arbitrarily fixed , one can directly check that
[TABLE]
Meanwhile, it follows by (2.2) that , where . Then by Lemma 2.2, we obtain that
[TABLE]
This, along with (5.2), leads to (5.49).
Next, by taking to be the zero extension of over in (5.49), we obtain (5.48). Here, we used the fact that in this case, is the zero extension of over , which follows from (2.2) and (1.22).
Step 3. To verify that there exists so that
[TABLE]
From (1.22), it follows that
[TABLE]
Applying the Hölder inequality to the above leads to that
[TABLE]
This, along with (5.2), implies (5.50) for some .
Step 4. To show (5.45)
We first claim that
[TABLE]
In fact, by (i) of Theorem 4.1, we have that
[TABLE]
This, along with the first inequality in (5.26) (where ), yields that
[TABLE]
Since we clearly have that
[TABLE]
(5.51) follows from (5.52) at once.
Meanwhile, from (5.46), (5.48) and (5.50), we obtain that
[TABLE]
From this, (5.47) and (5.51), we find that
[TABLE]
Since , the above leads to (5.45) for some .
In summary, we end the proof of Theorem 5.3. ∎
5.3 Some properties on minimal time functions
Some inequalities, as well as properties, related to the minimal time functions and will be given in this subsection.
Theorem 5.4**.**
Let . For each and , there is a measurable subset (depending also on and ), with , so that for each , there is so that
[TABLE]
Proof.
Arbitrarily fix and . Throughout the proof of Theorem 5.4, we simply write . For each and , we define a subset of in the following manner:
[TABLE]
We then define another subset of as follows:
[TABLE]
The rest proof is divided into the following two steps:
Step 1. To prove that
From (5.54), we see that
[TABLE]
From this and (5.55), it follows that
[TABLE]
For each , we let . For each , we let be the integer so that . Then, by (5.56), one can easily verify that
[TABLE]
[TABLE]
From (5.57) and (5.58), we can easily obtain the conclusion in Step 1.
Step 2. To show (5.53)
We first claim that for each , there is a unique pair so that
[TABLE]
Indeed, the existence of such a pair follows from (5.55) and (5.54) at once, while the uniqueness of such pairs can be directly checked.
Thus, for each , we can define to be the first component of the unique pair satisfying (5.59). We next claim that there exists so that
[TABLE]
To this end, we notice that (see (iii) of Theorem 4.1). Arbitrarily fix so that
[TABLE]
(The existence of such is ensured by (5.56).) Then it follows from (5.61) and (5.59) that
[TABLE]
This, along with (4.2), yields that
[TABLE]
By these, we can apply Theorem 5.3 (with ) and Theorem 5.2 (with and ) to get that
[TABLE]
where is given by (5.45). Meanwhile, by (5.59) and (5.61), we find that
[TABLE]
These, along with (5.62) and (ii) of Theorem 4.1, yield that
[TABLE]
By this and (5.61), we obtain (5.60).
Define a set in the following manner:
[TABLE]
We now show that the second conclusion in (5.53) holds for each in defined by (5.63). To this end, we arbitrarily fix . We claim that
[TABLE]
To show the first inequality in (5.64), we let be an admissible control to and let be the zero extension of over . Since (see (5.60)), one can easily check that is an admissible control (to ), which drives the solution to at time . This, along with the optimality of , leads to the first inequality in (5.64). To prove the second inequality in (5.64), we notice that . This, along with (1.1) and (1.8), yields that . From this and (5.59), we obtain the second inequality in (5.64).
Since is a multiple of (see (1.9)), it follows from (5.64) that
[TABLE]
This, along with (5.60), implies that the second conclusion in (5.53).
Finally, from (5.65) and (5.59), we see that the first conclusion in (5.53) is true for each defined by (5.63).
In summary, we end the proof of Theorem 5.4. ∎
Theorem 5.5**.**
For each ,
[TABLE]
Besides, for each . Here, is given by (4.1).
Proof.
It follows from (4.1) and (1.1) that . To prove (5.66), we arbitrarily fix . We first claim that
[TABLE]
Let , where is the optimal control to . Then we have that
[TABLE]
Define a number by
[TABLE]
Since over \big{(}T(M,y_{2}),\infty\big{)}, by the first conclusion in (5.68) and (5.69), we see that
[TABLE]
From this and the second inequality in (5.68), we see that is an admissible control (to ) which drives the solution to at time . This, along with the optimality of , yields that . From this and (5.69), we deduce (5.67).
Next, by a very similar way as that to show (5.67), we can easily check that
[TABLE]
Finally, (5.66) follows from (5.67) and (5.70) immediately. This completes the proof of Theorem 5.5. ∎
6 The proofs of the main theorems
In this section, we will prove Theorems 1.3-1.5. The strategies to show them have been introduced in Subsection 1.3.
6.1 The proof of Theorem 1.3
Proof of Theorem 1.3.
Let . We will prove the conclusions (i) and (ii) in Theorem 1.3 one by one.
(i) Arbitrarily fix . Then arbitrarily fix . From the conclusion (iii) in Theorem 4.1, it follows
[TABLE]
We take so that
[TABLE]
Let satisfy that
[TABLE]
We first claim that
[TABLE]
Indeed, from (4.2) and (6.1)-(6.3), one can easily check that
[TABLE]
Three facts are given in order: (a) By the second conclusion in (6.5), we can apply Theorem 5.3, with , to obtain that
[TABLE]
where is given by (5.45). (b) By the first conclusion in (6.5), we can use the first inequality in (5.26) in Theorem 5.2 (where and ) to get that
[TABLE]
(c) By (ii) of Theorem 4.1, we have that .
From above three facts (a)-(c), we find that
[TABLE]
Meanwhile, from (6.3), (6.2) and (6.1), one can easily check that
[TABLE]
This, along with (6.6), leads to (6.4).
We next claim that
[TABLE]
where is given by (6.2) and is defined by
[TABLE]
In fact, for an arbitrarily fixed , by (6.4) and (6.8), after some computations, we find that
[TABLE]
Let be the zero extension of an admissible control (to ) over . Then by (6.9), one can easily check that is an admissible control (to ), which drives the solution to at time . This, along with the optimality of , leads to (6.7).
We now show (1.10) with given by (6.7). For this purpose, we arbitrarily fix . Since , it follows by (1.1) and (1.8) that . This, along with (6.3) and (6.7), leads to (1.10).
Finally, we will prove that the above is continuous in . Indeed, according to the definitions of , and (see (6.7), (6.2) and (6.8), respectively), it suffices to show that the maps and are continuous. To show the first one, we notice from Theorem 5.5 that for each , and that the map is continuous outside . Hence, the map is continuous outside . To show the continuity of the map , two observations are given in order: First, it follows from Theorem 5.5 that continuously depends on ; Second, according to the conclusion (iii) of Theorem 4.1, for an fixed , the map is continuous and decreasing. From these two observations, the desired continuity follows at once. This ends the proof of the conclusion (i).
(ii) Let , with and , be given by Theorem 5.4. Then the conclusion (ii) of Theorem 1.3 follows from the first conclusion in (5.53) at once.
In summary, we end the proof of Theorem 1.3. ∎
6.2 The proof of Theorem 1.4
Proof of Theorem 1.4.
Arbitrarily fix . For each and , we let and be the optimal control and the optimal control with the minimal norm to and respectively (see Theorem 3.1). We will prove the conclusions (i)-(ii) one by one.
(i) Let . Let and be given by Theorem 1.3 and Theorem 5.2, respectively. Arbitrarily fix and . In the proof of (i) of Theorem 1.4, we simply write and for and , respectively; simply write and for and , respectively.
Since is a multiple of (see (1.8)), we can write
[TABLE]
In the case that
[TABLE]
one can easily show (1.12) and the desired continuity of . In fact, it follows from (6.11) that
[TABLE]
Since is continuous (see the proof of the continuity of with respect to in Theorem 1.3), and because for all and , we see from (6.12) that is continuous in , , and .
Thus, we only need to show (1.12), as well as the continuous dependence of in (1.12), for the case that
[TABLE]
For this purpose, some preliminaries are needed. First we claim that
[TABLE]
Indeed, (6.14) follows from the next three facts at once. Fact one: From Theorem 4.1, we have that ; Fact two: Since , we find from (1.1) and (1.8) that ; Fact three: By Theorem 1.3 and (6.13), we see that
[TABLE]
Then it follows from (6.14), (6.13) and (4.2) that
[TABLE]
Next, we let and be the minimizers of and , respectively (see Theorem 4.2 and Theorem 4.3). Write
[TABLE]
By (iii) of Theorem 4.1, is the optimal control to . Then by (ii) of Theorem 4.2 (with ), we see that over . Meanwhile, by (ii) of Theorem 4.1, we find that . These, along with (6.16), yield that
[TABLE]
Finally, it follows from (iii) of Theorem 3.1 that is an optimal control to . This, along with the fact that is an optimal control to , yields
[TABLE]
Meanwhile, by (6.15), we can apply Theorem 4.3 (with ), as well as (6.16), to obtain that
[TABLE]
Here, and are given by (1.22) with and is defined by
[TABLE]
We now prove (1.12) for an arbitrarily fixed (satisfying (6.13)) by several steps.
Step 1. To show that
[TABLE]
One can easily check the following two estimates:
[TABLE]
[TABLE]
From these, we see that to prove (6.21), it suffices to show that
[TABLE]
For this purpose, let be the integer so that . Because (see (6.14)) and is a multiple of (see (1.8)), we find that . Since is a piece-wise constant function over , and because
[TABLE]
one can easily check that
[TABLE]
This yields that
[TABLE]
Meanwhile, from the first equality in (6.19), one can easily verify that when ,
[TABLE]
This, along with (6.23), (6.19), (6.20) and the contractivity of , yields that
[TABLE]
Since (see (5.2)), by applying the Hölder inequality to (6.24), we obtain (6.22). This ends the proof of (6.21).
Step 2. To show that
[TABLE]
Observe that
[TABLE]
We first claim that
[TABLE]
Write for the family of all eigenvalues of with the zero Dirichlet boundary condition so that . Let be the family of the corresponding normalized eigenvectors. Arbitrarily fix . Write , . Then we have that
[TABLE]
By some computations, we obtain that
[TABLE]
Two facts are given in order: (a) It is clear that
[TABLE]
(b) By the Hölder inequality, we obtain that
[TABLE]
The above facts (6.29) and (6.30), along with (6.28) and (6.27), yield that
[TABLE]
This implies that
[TABLE]
Since was arbitrarily taken from , the above indicates that
[TABLE]
which leads to (6.26).
We next estimate . Since (see (6.10)) and because , we see from (1.22) that
[TABLE]
By using the Hölder inequality in the above and by (5.2), we see that
[TABLE]
Finally, (6.25) follows from the above estimates on and .
Step 3. To prove that
[TABLE]
*where is continuous in and *
By (6.15), we can use Theorem 5.3, with (where is given by (6.10)), to see that . By (6.18) and (6.20), we find that . These, along with (ii) of Theorem 4.1, yield that
[TABLE]
Meanwhile, by (6.14), we can use Theorem 5.2 (with and ) to see that
[TABLE]
where is given by (5.26). Since (see (6.14)), the above, along with (6.32), yields that
[TABLE]
Since , the above, along with Theorem 1.3, leads to (6.31). Finally, since is continuous in and (see the proof of the continuity of with respect to in Theorem 1.3), we obtain from (6.31) that is continuous in and .
Step 4. To show that
[TABLE]
*where is continuous in , , and *
Define an affiliated control over by
[TABLE]
We divide the rest of the proof of Step 4 by several parts.
Part 4.1. To prove that
[TABLE]
By (6.17) and (6.34), one can directly check that
[TABLE]
Hence, we have that
[TABLE]
This, along with (4.4), (4.7) and (6.16), yields that
[TABLE]
which leads to (6.35).
Part 4.2. To show that there exists so that
[TABLE]
Three facts are given in order. Fact one: By the Hölder inequality, we find that for some ,
[TABLE]
Fact two: Since (which follows from (6.19) and (1.22)), and because (see (6.14)), we find that
[TABLE]
Fact three: By (6.14), we see that
[TABLE]
Now, by the triangle inequality, (6.37), (6.21), (6.38), (6.39) and the Poincaré inequality, we obtain (6.36) for some .
Part 4.3. To show that there exists so that
[TABLE]
Recall (6.16) for the definition of . In Part 4.3, we simply write respectively and for and ; simply write , and for , and respectively. From (6.34) and (6.19), using the triangle inequality, we obtain that
[TABLE]
By direct computations, we find that
[TABLE]
[TABLE]
From (6.41), (6.2) and (6.43), we deduce that
[TABLE]
Meanwhile, by (6.19) and (6.16), we see that . This, together with (6.44) and (6.16), yields that
[TABLE]
Since for each (which follows from (1.22)), we find from (6.45) and (6.25) that
[TABLE]
At the same time, since , it follows from (6.31) and (6.13) that
[TABLE]
The above two inequalities, along with the Poincaré inequality, yield (6.40).
Part 4.4. To show (6.33) and the continuity of
By (6.36) and (6.40), we can easily check that
[TABLE]
Meanwhile, by (6.15), we can use Theorem 5.1 (with , where is given by (6.10)), as well as (6.14), to get that
[TABLE]
where is given by (5.2). This, along with (6.46), leads to that
[TABLE]
where
[TABLE]
Notice that is continuous in , , and . This can be showed by the same way as that used to prove of the continuity of with respect to in Theorem 1.3.
Now it follows from (6.35) that
[TABLE]
This, along with (6.48) and (6.31), yields (6.33), with
[TABLE]
Finally, along with the continuity of and , the above leads to the desired continuity of . This ends the proof of Step 4.
Step 5. To show that
[TABLE]
where is continuous in , , and
Recall (6.16) for the definitions of and . In Step 5, we simply write and for and , respectively; simply write for . By (6.17) and (6.34), we see that
[TABLE]
Meanwhile, from (6.17) and (6.16), we find that
[TABLE]
This, along with (6.50), yields that
[TABLE]
By (6.51), (6.40) and the triangle inequality, then using (6.33), we see that
[TABLE]
From this, (6.47) and (6.31), we obtain (6.49), with
[TABLE]
where is given by (6.31), is given by (6.33) and is given by (6.40). Notice that and are continuous; the maps and are continuous (which were showed in the proof of the continuity of with respect to in Theorem 1.3); . From these, we can easily show that the above is continuous in , , and . This ends the proof of Step 5.
In summary, we end the proof of the conclusion (i) in Theorem 1.4.
(ii) Arbitrarily fix and . Let be given by Theorem 5.4. Then, by Theorem 5.4, we see that
[TABLE]
and that for each ,
[TABLE]
Arbitrarily fix . Let and be the optimal control to and the optimal control optimal with the minimal norm to , respectively. (see Theorem 3.1.) Three facts are given in order: (a) By Theorem 4.1, one can easily check
[TABLE]
(b) From (iii) of Theorem 3.1, we see that
[TABLE]
(c) Since , by (1.1) and (1.8), we find that . Combining the above facts (a)-(c) with (6.52), we find that
[TABLE]
which leads to (1.13). Thus, the conclusion (ii) in Theorem 1.4 is true.
In summary, we end the proof of Theorem 1.4. ∎
6.3 The proof of Theorem 1.5
This subsection devotes to the proof of Theorem 1.5. To show (1.15) in Theorem 1.5, we need the next lemma which gives a lower bound for the diameter of the subset (in ), which is defined by (1.23).
Lemma 6.1**.**
Let and . Then there is so that for each and (where is given by Theorem 5.4),
[TABLE]
Proof.
Arbitrarily fix and . Let be given by (i) of Theorem 1.3 with and . From (i) and (ii) of Theorem 4.1, we see that . Thus we can take a positive number in the following manner:
[TABLE]
Arbitrarily fix and . From now on and throughout the proof of Lemma 6.1, We simply write and for and respectively; simply write and for and respectively.
From (6.54) and Theorem 1.3, we see that
[TABLE]
Meanwhile, it follows from the second conclusion in (5.53) in Theorem 5.4 that
[TABLE]
To show (6.53), it suffices to find a subset so that for some , is a lower bound for the ”diam ”. To this end, we first introduce an affiliated subset in the following manner: Let be the optimal control with the minimal norm to (see (iii) of Theorem 3.1). Arbitrarily fix so that
[TABLE]
(The existence of such can be easily verified.) Define to be the set of all solutions to the following problem:
[TABLE]
From (6.58), we see that .
We next characterize elements in via studying the problem (6.58). To this end, we first claim
[TABLE]
where denotes the minimizer of . Indeed, the first equality in (6.59) follows from (iii) of Theorem 3.1; To show the second one, two facts are given in order. Fact one: From (iii) of Theorem 3.1, we see that the restriction of over , denoted in the same manner, is an optimal control to . Fact two: By (6.55) and (4.2), we find that . By these two facts, we can use (4.7) in Theorem 4.3 (with ) to obtain the second equality in (6.59); To show the third equality in (6.59), we recall the above two facts. Then we can apply (ii) in Theorem 4.3 (with ) to get that
[TABLE]
(The first equality on the last line of (6.60) is obtained by the same way as that used to show (4.17).) Then the third equality in (6.59) follows from (6.60) and the first equality in (6.59) at once; To show the last equality in (6.59), we still recall the above two facts (given in the proof of the second equality in (6.59)). Then we can apply (ii) in Theorem 4.3 (with ) to see that
[TABLE]
(The first equality on the last line in (6.61) is obtained by the same way as that used to show (4.17).) From (6.61) and (6.57), we are led to the last equality in (6.59). Hence, (6.59) has been proved.
With the aid of (6.59), we can characterize elements of as follows:
[TABLE]
where the pair is given by
[TABLE]
Indeed, for each , with , we have that
[TABLE]
Thus, from (6.59), (6.57) and (6.58), we can easily verify that is a solution to the problem (6.58) if and only if is a solution to the problem (6.65).
We now on the position to introduce the desired subset . Define a number by
[TABLE]
(Notice that since , it follows from (5.53) in Theorem 5.4 that .) Let be the set of solutions to the following problem:
[TABLE]
We claim that
[TABLE]
Since the second conclusion in (6.75) has been proved, we only need to show the first one. Arbitrarily fix . We will show that satisfies (6.65). Since and (see (6.70) and (6.56)), it follows from (6.74) that
[TABLE]
Meanwhile, since (see (6.69) and (6.57)), we find from (6.74) and (6.70) that
[TABLE]
From these, we see that verifies (6.65). Hence, (6.75) is true. By (6.75), (6.74) and (6.57), we find that
[TABLE]
when satisfies that
[TABLE]
(Here, we agree that .) Then by (6.76) and (6.70), we get that
[TABLE]
where is defined by
[TABLE]
To get a lower bound of w.r.t. , we first present the following inequalities (their proofs will be given at the end of the proof of this lemma):
[TABLE]
where and are given by Theorem 5.2 and (i) of Theorem 5.1, respectively. We next define
[TABLE]
where is given by (6.54). From (6.79) and (6.80), we have that
[TABLE]
This, along with (6.78) and (6.79), yields that for each ,
[TABLE]
By this and the last inequality in (6.79), we can find so that , when . (Hence, is a lower bound for w.r.t. .) This, along with (6.77), (6.56) and (6.80), yields that for each ,
[TABLE]
By the above and (6.80), we obtain (6.53), with .
Finally, we show (6.79). By the Hölder inequality, (6.69) and (6.57), we find that
[TABLE]
Similarly, from (6.69) and (6.59), we can obtain the estimate for in (6.79). We now show the third inequality in (6.79). By (6.55), we have that
[TABLE]
From the first two conclusions in (6.81), we can apply (ii) of Theorem 4.1 and the first inequality in (5.45) in Theorem 5.3 (with ), as well as (6.56), to get that
[TABLE]
From (6.82), the second inequality in (5.26) in Theorem 5.2, with and , (Notice that .) and the last inequality in (6.81), we can easily derive the last inequality in (6.79). Hence, (6.79) is true. This ends the proof of Lemma 6.1. ∎
We are now on the position to prove Theorem 1.5.
Proof of Theorem 1.5.
Arbitrarily fix . For each and , we let and be the optimal control and the optimal control with the minimal norm to and respectively (see Theorem 3.1). Throughout the proof of Theorem 1.5, we simply write respectively and for and ; simply write and for and respectively. We will prove the conclusions (i)-(ii) of Theorem 1.5 one by one.
(i) Arbitrarily fix and , with . Then arbitrarily fix . For each , there are only two possibilities: either (6.11) or (6.13) holds. In the case when verifies (6.11), we can obtain (1.14) by the similar way to that used to show (1.12). We next consider the case that satisfies (6.13). Recall (1.23) for the subset (which consists of all optimal controls to ). Then it follows from Definition 1.2 that
[TABLE]
Arbitrarily fix . One can directly check that
[TABLE]
From this and (6.83), we find that for each ,
[TABLE]
Dividing the above by and then sending , we obtain that
[TABLE]
From this, (6.83) and (6.19) (as well as (6.20)), one can directly check that
[TABLE]
(Here, we used the fact that , which follows from (iii) of Theorem 3.1.) Hence, from (6.49), (6.84) and (6.31), we find that
[TABLE]
where and are respectively given by (6.31) and (6.49). The continuity of follows from the continuity of and . This ends the proof of the conclusion (i) of Theorem 1.5.
(ii) We mainly use Lemma 6.1 to prove (1.15). Arbitrarily fix and . Let be given by Theorem 5.4. Let and be given by Lemma 6.1. Arbitrarily fix . We claim that there is so that
[TABLE]
By contradiction, we suppose that it were not true. Then we would find that
[TABLE]
This, along with the definition of (see (6.53)), implies that
[TABLE]
which contradicts Lemma 6.1. Thus, (6.85) is true.
Now, we arbitrarily fix satisfying (6.85). Then by (6.85) and by (i) of Theorem 1.4 (with and ), there is so that
[TABLE]
Write
[TABLE]
Then, one can easily check that
[TABLE]
From (6.86), and (6.87), one can easily verify that
[TABLE]
which leads to (1.15), with . This ends the proof of Theorem 1.5. ∎
6.4 Further discussions on the main results
From (ii) of Theorem 1.3, we see that when , has a lower bound . The next Theorem 6.2 tells us that when , will not be a lower bound for .
Theorem 6.2**.**
Let . Then for each , there is and , with , so that when ,
[TABLE]
Proof.
Arbitrarily fix and . Throughout the proof of Theorem 6.2, we simply write for . Let
[TABLE]
We define a sequence of in the following manner:
[TABLE]
One can easily check that
[TABLE]
We now claim that there exists so that
[TABLE]
In fact, by (6.90), we can choose large enough so that
[TABLE]
Arbitrarily fix . Since (see (iii) in Theorem 4.1), from (6.93) and (6.91), we can easily check that
[TABLE]
These, along with (4.2), yield that
[TABLE]
By (6.94), we can apply Theorem 5.3 (see the second inequality in (5.45), where is replaced by ) and Theorem 5.2 (see the first inequality in (5.26), with and ) to obtain that
[TABLE]
where is given by (5.45). Meanwhile, by (6.91) and (6.93), we find
[TABLE]
These, along with (6.95) and (ii) of Theorem 4.1, yield that
[TABLE]
This, together with (6.89), leads to (6.92), with .
Next, we arbitrarily fix . Let be an admissible control to . Let be the zero extension of over . Then by (6.92), one can easily check that is an admissible control (to ), which drives the solution to at time . This, along with the optimality of , yields that
[TABLE]
Meanwhile, Since , we find from (1.1) and (1.8) that . From this and (6.91), we get that
[TABLE]
Since is a multiple of (see (1.9)), from (6.96) and (6.97), we obtain that
[TABLE]
This, along with (6.91) and (6.89), yields (6.88), with and with given by (6.92). Thus, we end the proof of Theorem 6.2. ∎
Remark 6.3**.**
(i) Let . The above theorem implies that the following conclusion is not true: For each , there exists and so that
[TABLE]
(ii) We think of that the similar result to that in Theorem 1.3 can be obtained for optimal controls. But it seems for us that the corresponding proof will be more complicated.
7 Appendix
The next Lemma 7.1 is the copy of [36, Lemma 5.1].
Lemma 7.1**.**
Let be either or . Let , and be three Banach spaces over , with their dual spaces , and . Let and . Then the following two propositions are equivalent:
(i) There exists and so that for each ,
[TABLE]
(ii) There is and so that for each , there is satisfying that
[TABLE]
Furthermore, when one of the above two propositions holds, the pairs and can be chosen to be the same.
Proof of Lemma 7.1.
The proof is divided into the following several steps:
Step 1. To show that (ii)(i)
Suppose that (ii) is true. Then, for each , there is so that (7.2), with , is true. From this, one can easily check that for any and ,
[TABLE]
By this and the Cauchy-Schwarz inequality, we deduce that for each and ,
[TABLE]
Hence, (7.1), with (\widehat{C}_{0},\hat{\varepsilon}_{0})$$=(C_{0},\varepsilon_{0}), is true.
Step 2. To show that (i)(ii)
Suppose that (i) is true. Define a subspace of in the following manner:
[TABLE]
The norm of is inherited form the following usual norm of :
[TABLE]
Arbitrarily fix . Define an operator in the following manner:
[TABLE]
By (7.1) and (7.4), we can easily check that is well defined and linear. We now claim
[TABLE]
Indeed, by the definition of , we see that given , there is so that
[TABLE]
Then by (7.4), we find that |\mathcal{T}_{x^{*}}\big{(}(f,g)\big{)}|=|\langle x^{*},Rz\rangle_{X^{*},X}|\leq\|x^{*}\|_{X^{*}}\|Rz\|_{X}. This, along with (7.1), shows (7.5).
Since is a linear and bounded functional, we can apply the Hahn-Banach extension theorem to find in so that
[TABLE]
and so that
[TABLE]
These, together with (7.3) and (7.5), yield that for all and ,
[TABLE]
Thus, there exists so that for all ,
[TABLE]
from which, it follows that
[TABLE]
We now claim that
[TABLE]
When (7.9) is proved, the conclusion (ii) (with (C_{0},\varepsilon_{0})$$=(\widehat{C}_{0},\hat{\varepsilon}_{0})) follows at once.
To prove the first inequality in (7.9), we see from (7.8), (7.7) and (7.3) that
[TABLE]
Meanwhile, for each , we can choose so that
[TABLE]
where and are so that . From these, it follows that
[TABLE]
Sending in the above inequality leads to the first inequality in (7.9).
To prove the second equality in (7.9), we find from (7.4), (7.6) and (7.8) that
[TABLE]
which yields that for all ,
[TABLE]
This leads to the second equality in (7.9).
Step 3. On the pairs and
From the proofs in Step 1 and Step 2, we see that when one of the propositions (i) and (ii) holds, and can be chosen to be the same. This ends the proof of Lemma 7.1. ∎
The next Lemma 7.1 is a part copy of the proof of [29, Theorem 2.1].
Lemma 7.2**.**
There exists so that for each and ,
[TABLE]
Proof.
Write and for the eigenvalues and the normalized orthogonal eigenfunctions for with the zero Dirichlet boundary condition. Arbitrarily fix and . We have that
[TABLE]
Then it follows that
[TABLE]
Recall that the Lebeau-Robbiano inequality says that there exists so that for each ,
[TABLE]
We apply the above inequality (where ), as well as (7.11), to get that for each ,
[TABLE]
This, as well as the following facts
[TABLE]
indicates that for each ,
[TABLE]
Since the function , can take any value in , it follows by (7.12) that for each ,
[TABLE]
Meanwhile, one can easily check that
[TABLE]
From this and (7.13), we deduce that for each ,
[TABLE]
Take the infimum in (7.14) for over to get (7.10). This ends the proof.
∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Ackermann, Sampled-Data Control Systems: Analysis and Synthesis, Robust System Design, Spring-Verlag, 1985.
- 2[2] J. Apraiz, L. Escauriaza, G. Wang and C. Zhang, Observability inequalities and measurable sets, J. Eur. Math. Soc. 16 (2014) 2433–2475.
- 3[3] P. Astuti, M. Corless and D. Williamson, On the convergence of sampled data nonlinear systems, Differential Equations (1997) 201–210.
- 4[4] E. Bini and G. Buttazzo, The optimal sampling pattern for linear control systems, IEEE Trans. Automat. Control 59 (2014) 78–90.
- 5[5] L. Bourdin and E. Trélat, Pontryagin maximum principle for finite dimensional nonlinear optimal control problems on time scales, SIAM J. Control Optim. 51 (2013) 3781–3813.
- 6[6] L. Bourdin and E. Trélat, Optimal sampled-data control, and generalizations of time scales, Math. Cont. Related Fields 6 (2016) 53–94.
- 7[7] L. Bourdin and E. Trélat, Linear-quadratic optimal sampled-data control problems: convergence result and Riccati theory, Preprint Hal (2015).
- 8[8] T. Chen and B. Francis, Optimal Sampled-Data Control Systems, Springer-Verlag, 1995.
