The main result of this section is as follows.
Proof. The proof of theorem is divided into the two stages.
Stage 1. In this stage, we prove that . In the beginning, suppose that Hypothesis (H3) is valid. Under (H1) and (H3), it is convenient to assume that , and are constant with respect to , and t, outside of some sufficiently large ball. This can be obtained due to a simple problem reduction. In what follows, it will not also be restrictive to consider that , and, for the simplicity of exposition, to consider that all the constraints are scalar-valued, i.e., , while .
Let
be non-negative numbers. Consider the mapping
This function is lower semi-continuous. It will serve as a penalty function in the applied method below.
Take a pair
, and consider the unique solution to the Cauchy problem
,
, which exists on the entire time interval
due to the above assumptions. Set
, where
. Note that
p depends on
. Let
be an arbitrary sequence of positive numbers converging to zero. Consider the mapping
, where
for
. Thus, the following functional over the space
is well-defined:
Functional is lower semi-continuous which is a straightforward exercise to verify due to the assumptions made above regarding the mappings f and r. At the same time, this functional is positive everywhere: .
Consider the following problem
Note that
. By applying the smooth variational principle, see, e.g., in [
17], for each
i, there exists an element
and a sequence of elements
,
, converging to
such that
and the pair
is the unique solution to the following problem:
Suppose that
. Then,
and, in view of optimality, taking into account that
, it follows that some of constraints in (
1):
, or
, or
r, are violated. Therefore, by definition of
, one has
. However, this contradicts (
19) for
. Thus,
. Consider a number
such that
:
. Then, by virtue of, again, the definition of
, the pair
is the unique global minimum to the following control problem:
Denote by
the solution to (
21), that is, the trajectory corresponding to the pair
. Note that function
is constant, and thus it can be treated simply as number
.
Problem (
21) is, as a matter of fact, unconstrained. Consider the first and second-order necessary optimality conditions for this problem.
The first-order conditions are stated as follows. There exist a number
, and absolutely continuous conjugate functions
and
which correspond to
, and
, respectively, such that, for a.a.
,
Here,
is the multiplier corresponding to the constraint
,
Conditions (
22)–(
24) are the first-order optimality conditions in the form of the maximum principle. Consider the second-order optimality conditions for Problem (
21).
Take an element
. Consider the variational differential equation related to (
21), that is,
for a.a.
, where
Here, .
The solution to (
25) exists, and it is unique on the entire time interval
due to the assumptions made above. The function
is obviously constant, thus, it is treated just as number
in what follows.
On the space
, consider the quadratic form
Consider the closed subspace of pairs such that
- (a)
;
- (b)
.
Here, .
Then, the second-order necessary optimality condition is given by the inequality
(Note that functional
is not twice continuously differentiable. At the same time, the scalar function
of
possesses the second derivative w.r.t.
at
, provided that
. Using this fact, and the fact that Problem (
21) is unconstrained, it is simple to derive (
26) by applying direct variations arguments.)
The next step is to pass to the limit as
in the obtained optimality conditions. Firstly, it follows from (
20) that
, and
strongly in
, and, thereby,
uniformly on
. Then,
. Define
and consider the following normalization for the multipliers
where
.
Let us show that
. Indeed, one has
However, due to (
19), one has
. This, together with (
27), implies that
. Then, the transversality condition and, again, (
19) and (
27) simply yield that
.
By passing to a subsequence, in view of the compactness argument, one may assume from (
27) that
,
and
weakly in
as
for some multipliers
,
and
. Then,
. It is also clear that by passing to a subsequence, one can assert that
. Indeed, otherwise all the multipliers converge to zero, contradicting (
27). By virtue of the regularity of the optimal control process with respect to mixed constraints, for each
i, there exists a control function
such that
a.e., and
in
. Thus, from the maximum condition (
24), it follows that
uniformly. Since the set
is uniformly bounded, this implies, again due to regularity, that the control function
is essentially bounded uniformly with respect to
i, that is
.
From (
24), one derives that
Whence, using regularity and the above obtained facts, one has
Using the facts and estimates obtained above, one can simply pass to the limit in (
22)–(
24) and prove that the set of multipliers
satisfies the maximum principle. At the same time, the fact that
follows from (
28).
Now, let us pass to the limit in (
26). Take numbers
and
. Restricting to a subsequence, one can state that
for a.a.
. Due to Egorov’s theorem, there is a subset
, the measure of which equals
, such that
uniformly on
. Denote
,
.
Consider the bounded linear operator
such that
where
is defined as
, but
for a.a.
. It is a simple matter to show that, due to the uniform convergence, one has
strongly, where
Then, as is known, . It is clear that as by virtue of its definition and the regularity condition. One needs to use the solution to a corresponding Volterra equation to prove this simple fact. Then, Lemma 1 yields that as if we consider . Here, when treating the convergence of spaces, the symbol ‘→’ stands for .
Let
denote the kernel of the endpoint operator
. It is clear that
. Then, this is a simple exercise to ensure the existence of a subspace
such that
and
where
is total: firstly as
, then, as
and finally, as
. At the same time, note that
for all large
i. Therefore, one has the embedding
, and then, the passage to the limit in (
26) gives the condition
. In the latter deduction, Proposition 1 of [
14] has been used and also the fact that the terms with
in
converge to zero in view of (
19) and (
27).
Now, it is necessary to remove the extra assumptions imposed in (H3) regarding the boundedness and global regularity. However, this can be done following precisely the same method as presented in [
4]. Take
, and consider the additional control constraint
. For each
, there will be
N specifically constructed regular selectors of
which are surrounded with
N-tubes as in the above-cited source. Then, the passage to the limit, firstly as
, then, as
, and, at the end, as
will complete the proof for Stage 1.
The full proof for the next stage is rather lengthy. Therefore, let us present it schematically, in a sketch-form, exposing the main idea.
Stage 2. Here, under (H2) and (H3), we prove Estimate (
18). For this purpose, the notion of
-problem is used. Take any
and
. It is not restrictive to assume that the minimum in (
1) is absolute.
Here, is the trajectory corresponding to the perturbed pair , whereas is the corresponding endpoint vector.
Note that the infimum in Problem (
29) is finite due to the imposed assumptions. Moreover, it is not greater than zero, since the process
,
is feasible, whereas the value of the cost equals zero. At the same time, when
, the infimum over
is positive due to the absolute optimality in (
1) and since
. This suggests the application of the smooth variational principle, albeit in the version from Ref. [
18], so the finite-dimensional variable
is not subject to perturbation. That is, the adding to the cost due to the variational principle is within the space
only. Then, for any sufficiently small
, one can assert the solution
,
to the perturbed problem such that
. Indeed, otherwise there is a contradiction with the range of the infimum.
The remaining arguments are somewhat standard: the results of Stage 1 are applied to the
-solutions which are regular due to (H3). By taking
appropriately small according to the given
, one can prove the convergence of this solution to the optimal solution
as
. (In this enterprise, Hypothesis (H2) is essentially used together with the weak sequential compactness of controls
implemented by virtue of a standard technique. It is also needed to use the form of the minimizing functional in (
29) and the above obtained fact that the infimum is not greater than zero, in order to prove the strong convergence of these controls.) Then, it is necessary to pass to the limit in the obtained conditions, firstly as
, then, as
and finally, as
. At the same time, the transversality condition with respect to the
-variable will yield the desired Estimate (
18) by virtue of the expansion in Taylor series.
The proof is complete. □