Minimum energy for linear systems with finite horizon: a non-standard Riccati equation
Paolo Acquistapace, Fausto Gozzi

TL;DR
This paper investigates a non-standard Riccati equation in infinite-dimensional linear-quadratic control, establishing existence, partial uniqueness, and solutions in special cases for minimum energy control over finite horizons.
Contribution
It introduces a novel Riccati equation with an opposite sign linear part, proves its connection to the value function, and analyzes solution uniqueness and special cases.
Findings
The operator P(t) solves the non-standard Riccati equation.
Partial uniqueness of solutions is established for invertible operators.
Special case analysis when involved operators commute.
Abstract
This paper deals with a non-standard infinite dimensional linear-quadratic control problem arising in the physics of non-stationary states (see e.g. [6]): finding the minimum energy to drive a fixed stationary state x = 0 into an arbitrary non-stationary state x. The Riccati Equation (RE) associated to this problem is not standard since the sign of the linear part is opposite to the usual one, thus preventing the use of the known theory. Here we consider the finite horizon case. We prove that the linear selfadjoint operator P(t), associated to the value function, solves the above mentioned RE (Theorem 4.12). Uniqueness does not hold in general but we are able to prove a partial uniqueness result in the class of invertible operators (Theorem 4.13). In the special case where the involved operators commute, a more detailed analysis of the set of solutions is given (Theorems 4.14, 4.15 and…
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 · Control and Stability of Dynamical Systems · Model Reduction and Neural Networks
Minimum energy for linear systems with finite horizon:
a non-standard Riccati equation
P. Acquistapace111Dipartimento di Matematica, Universitá di Pisa, Italy, e-mail: [email protected], F.Gozzi222Dipartimento di Economia e Finanza, Università LUISS - Guido Carli Roma; e-mail: [email protected]
Abstract
This paper deals with a non-standard infinite dimensional linear-quadratic control problem arising in the physics of non-stationary states (see e.g. [6]): finding the minimum energy to drive a fixed stationary state into an arbitrary non-stationary state . The Riccati Equation (RE) associated to this problem is not standard since the sign of the linear part is opposite to the usual one, thus preventing the use of the known theory.
Here we consider the finite horizon case. We prove that the linear selfadjoint operator , associated to the value function, solves the above mentioned RE (Theorem 4.12). Uniqueness does not hold in general but we are able to prove a partial uniqueness result in the class of invertible operators (Theorem 4.13). In the special case where the involved operators commute, a more detailed analysis of the set of solutions is given (Theorems 4.14, 4.15 and 4.16). Examples of applications are given.
Key words: Minimum energy, Riccati equation, infinite dimension, value function, Lyapunov equation, null controllability,
AMS classification: 34G20, 47D06, 49J20, 49N10, 93B05, 93C05, 93C20.
Contents
1 Introduction
This paper is devoted to the study of a family of non-standard linear quadratic finite horizon minimum energy problems in Hilbert spaces: finding the minimum energy to drive a dynamical system from a fixed equilibrium state [math] (at time ) into an arbitrary non-equilibrium state (at time ). These problems arise (in particular when and ) in the control representation of the rate function for a class of large deviation problems (see e.g. [12] and the references quoted therein; see also [18, Chapter 8] for an introduction to the subject); it is motivated by applications in the physics of non-equilibrium states and in this context it has been studied in various papers, see e.g. [3, 4, 5, 6, 7].
In such papers the state equation is possibly nonlinear and the energy function can be state dependent. One of the main goals, formulated e.g. in [6] in the infinite horizon case, is then to show that the value function is the unique (or maximal/minimal) solution of the associated Hamilton-Jacobi-Bellman (HJB) equation. Our goal is exactly this one. Due to the difficulty of the problem we restrict ourselves to study the linear quadratic case: hence solving the HJB equation reduces to solve a Riccati Equation (RE). In this paper, as a first step, we consider the finite horizon problem which we describe in the next subsection together with our main results.
1.1 The problem and the main results
To better clarify our results we state, roughly and informally, the mathematical problem (see Subsection 2.2 for a precise description). The state space and the control space are both real separable Hilbert spaces. We take the linear controlled system in
[TABLE]
where generates a strongly continuous semigroup and is a linear bounded operator. Given a point we consider the set of all control strategies that drive the system from the equilibrium state [math] (at time ) into an arbitrary non-equilibrium state (at time ). It is well known (see Subsection 2.2) that the set is nonempty if and only if , where is a suitable subspace of that can be endowed with its own Hilbert structure (see Subsection 4.1).
We want to minimize the “energy-like” cost functional
[TABLE]
The value function is defined as
[TABLE]
and it is finite only when . As the problem is linear quadratic, is a quadratic form in the variable , i.e. for some symmetric operator-valued function . Hence we can consider the associated Riccati Equation (RE) in (with unknown ) which is, formally,
[TABLE]
for every , with the initial condition . Since for each the operator is unbounded (because is defined only in ), it is convenient to rewrite (4) in so that the unknown becomes a bounded operator, see Subsection 4.3 for explanations.
Note that the sign of the linear part of (4) (the first two terms of the right hand side) is opposite to the usual one (see, e.g., for minimum energy problem in Hilbert spaces, [12], [15, 16], [19], [24], [27]). This does not allow us to approach (4) using the standard method (described e.g. in [2, pp. 390-394 and 479-486], see also [24, p.1018]), which consists in solving the RE using a fixed point theorem and a suitable a priori estimate. For forward RE like ours this is possible when the sign of the linear part is positive (in order to get a suitable semigroup generation property333More precisely in such case the linear part generates a semigroup (namely ) which is not a group: such semigroup property is then lost when the sign changes.) and the quadratic term is negative (in order to get the a priori estimate).
On the other hand the opposite sign of the linear part comes from the nature of the motivating problem: to look at the minimum energy path from equilibrium to non-equilibrium states (see [6]), which is the opposite direction of the standard one considered e.g. in [8, 9, 24, 26], (see also the books [2, 10, 11]). This means that the value function depends on the final point, while in the above quoted problems it depends on the initial one (see also Remark 4.1 on this). Therefore we are driven to use a different approach, that exploits the structure of the problem; we partially borrow some ideas from [24] and from444We thank prof. R. Vinter for providing us these references. [21] and [25]. The main idea comes from the fact that the candidate solution of the RE (associated to the value function is the pseudoinverse of the unique solution of a Lyapunov (linear) equation (which is easier and is studied in Section 3 providing an existence and uniqueness result in Proposition 3.3).
We list now our main results. We show, under a null controllability assumption, that the value function solves the associated Riccati Equation (RE) (Theorem 4.12) and that a partial uniqueness holds (Theorem 4.13). When is selfadjoint and and commute we can go deeper, finding more insights on the structure of the family of solutions (Theorems 4.14, 4.15 and 4.16).
1.2 Plan of the paper
Section 2 is devoted to the presentation of our finite horizon minimum energy problem: after the description of our assumptions (Subsection 2.1) we provide the general formulation of the problem is in Subsection 2.2.
Section 3 is devoted to the study of the associated Lyapunov equation, a key tool for the analysis of our RE. The main result of this section (Proposition 3.3) is more general than what we found in the literature and is then completely proved.
Section 4 is devoted to the analysis of the RE and to the presentation of the main results. It is divided in 5 subsections.
- •
In the first (Subsection 4.1), we study the properties of the space which seems the good one where to study the RE.
- •
Subsection 4.2 concerns the study the regularity properties of .
- •
In Subsection 4.3 we prove that solves the RE (Theorem 4.12).
- •
In Subsection 4.4 we present our partial uniqueness result (Theorem 4.13).
- •
In Subsection 4.5 we refine our results in the special case of selfadjoint commuting operators.
Finally, Section 5 contains two significant examples. At the end there is an Appendix divided in 4 parts. In the first three where we collect some preliminary results on pseudoinverses (A) on commuting operators (B), and controllability operators (C). In the last one we collect the proofs of several lemmas and propositions (D).
2 Minimum energy problems
2.1 Assumptions
Let . Consider the abstract linear equation
[TABLE]
under the following assumption.
Assumption 2.1**.**
(i)
, the state space, and , the control space, are real separable Hilbert spaces;
(ii)
* is the generator of a -semigroup of negative type in (), i.e. there exists such that*
[TABLE]
(iii)
, where is the space of bounded linear operators from to ;
(iv)
, the control strategy, belongs to .
We recall the following well known result (see e.g. [23, p. 106, Corollary 2.2 and Definition 2.3]).
Proposition 2.2**.**
For , and , the mild solution of (5), defined by
[TABLE]
is in .
In the sequel we will always assume that Assumption 2.1 holds. Moreover, to prove most of the results of the paper we will also need the assumption below. We state it now and we will say explicitly when we will use it. Before all we need to define the so-called controllability operator.
Definition 2.3**.**
For set
[TABLE]
and, for ,
[TABLE]
Note that is well defined by Assumption 2.1-(ii).
Assumption 2.4**.**
There exists such that555From now on we will denote by the image of the operator .
[TABLE]
It is well known (see e.g. [14, Appendix D]) that this assumption is equivalent to assume null controllability at time for the system (5) below: this means that for each there exists a control such that the solution of (5) with vanishes at time .
Remark 2.5**.**
We have supposed in Assumption 2.1 that the semigroup has negative type: this allows us to obtain more accurate results, also in view of a future study of the infinite horizon case. Anyway, if we only assume that with , most results of this paper are still true with suitable modifications. More specifically, since the operator is not well defined, one has the following:
- •
the space changes from to , for suitable large .
- •
Proposition 4.8 modifies as follows:
- –
(i) and (ii) hold in ;
- –
(iii)(a) holds in ;
- –
(iii)(b) holds in ;
- –
(iii)(c) does not hold.
- •
The differential Riccati equation (37) holds in with replaced by .
Note that, in the commuting case, the proof of most results does not work as it is. This is the case for Proposition C.2(iii), Theorem 4.14 and Theorem 4.15.
2.2 General formulation
Suppose that Assumption 2.1 holds. Given a time interval , an initial state and a control we consider the state equation (5) and its mild solution , given by (7). We define the class of controls bringing the state from a fixed at time to a given target at time :
[TABLE]
We recall our cost functional, namely the energy:
[TABLE]
The minimum energy problem at is the problem of minimizing the functional over all . The value function of this control problem (the minimum energy) is
[TABLE]
with the agreement that the infimum over the empty set is . The following easy proposition, straightforward consequence of (7), allows to reduce the number of variables.
Proposition 2.6**.**
Under Assumption 2.1 we have
[TABLE]
*and then
. *
From now on we will set, for simplicity of notation,
[TABLE]
Now we look at the set where is finite: this is the reachable set in the interval , starting from [math], defined as
[TABLE]
Defining the operator
[TABLE]
it is clear that
[TABLE]
hence the set where is finite is .
We now recall a fundamental, and well known, result, which establishes the relationship between the family of operators and our minimum energy problem (see e.g. [27, Theorem 2.3, p.210]).
Theorem 2.7**.**
Suppose that Assumption 2.1 holds and let .
- (i)
The set is nonempty if and only if . In particular we have
[TABLE]
- (ii)
If , there is exactly one minimizing strategy for the functional over , and moreover
[TABLE]
where, for , is the pseudoinverse of .
- (iii)
If then , where is the pseudoinverse of .
Since is quadratic the HJB equation associated to our problem becomes a differential Riccati Equation, namely (4). Our main aim is then to prove that the linear symmetric operator associated to is a solution of such Riccati Equation and prove a kind of uniqueness result. We will do this in Section 4.
Remark 2.8**.**
It is possible to extend the above minimum energy problem to the case when or when . The energy functional becomes then an integral over a half line. In the first case we have to take the initial datum and, properly defining the mild solutions in the left half-line (requiring that (7) is satisfied for all ), we have to define the set of control strategies as follows:
[TABLE]
In the second case the problem is trivial. Indeed formally one should define
[TABLE]
However it is easy to show that for every we have , so that the class is empty unless ; in this case the optimal control strategy is clearly .
In a subsequent paper we will study the infinite horizon problem when the starting time is and the arrival time is [math]: the value function of this problem is formally . Some results about it will be also given in the present paper. For simplicity we will use the notation
[TABLE]
In Proposition 4.8 we will prove that, under Assumption 2.1, we have
[TABLE]
3 The Lyapunov equation
We want now to show that the function , from to , solves a suitable Lyapunov equation. To this purpose we prove first the following lemma.
Lemma 3.1**.**
- (i)
If , then for every we have and
[TABLE]
[TABLE]
- (ii)
For every we have , they all are dense in , and
[TABLE]
[TABLE]
- (iii)
For every , if , then .
- (iv)
For every , is dense in . Hence if , then .
Proof.
(i) Let . Then we can write, integrating by parts:
[TABLE]
and (i) follows.
(ii) The first inclusion follows from the very definition of the adjoint.
Next, if we can write for each , by (20),
[TABLE]
so that , i.e. , and (22) holds. This proves the claim for . For the case we argue in a similar way: let ; then for each , by (21) we have,
[TABLE]
so that , i.e. , and (23) holds.
(iii) By assumption we have with . Let . By Proposition C.1 and its proof we get for all . Moreover belongs obviously to (with ). Hence we have by (22), when
[TABLE]
As a consequence, . Similarly, if , we have for every , by (23),
[TABLE]
and the claim follows.
(iv) We just consider the case , since the case is quite similar. Fix . As there is a sequence of elements such that . Hence there exists such that in . Since is dense in , for each we can find such that , so that in , too.
For the last statement, observe first that, since , then , so the latter is dense in , too. Hence, for , let be a sequence such that in as . Thus we can write for
[TABLE]
∎
Definition 3.2**.**
A map is a solution of the differential Lyapunov equation
[TABLE]
if:
- •
for each the operator is positive and selfadjoint and ;
- •
for each and we have ;
- •
for each the map is differentiable and
[TABLE]
Similarly an operator is a solution of the algebraic Lyapunov equation
[TABLE]
if:
- •
* is positive and selfadjoint;*
- •
for each we have ;
- •
for each
[TABLE]
Proposition 3.3**.**
The operator defined by (8) is a solution of the differential Lyapunov equation (24). Similarly the operator solves the algebraic Lyapunov equation (25).
Moreover, for all , let be positive and selfadjoint, and such that it solves the Lyapunov equation (24) in weak sense, i.e. , the map is differentiable for every and
[TABLE]
Then for all .
Similarly let be positive and selfadjoint, and such that it solves the Lyapunov equation (25) in weak sense, i.e. for all
[TABLE]
Then .
Proof.
We give the proof for the reader’s convenience since we did not find it in the literature. Indeed, in [11, Theorem 5.1.3], in [2, part II, Chapter 1, Theorem 2.4] and in [14, Appendix D] only the algebraic Riccati equation is considered, and it is shown that it has a positive operator-valued solution if and only if the semigroup generated by is exponentially stable.
Consider first the differential Lyapunov equation (24). By the definition of we obviously have
[TABLE]
Then the existence result follows from Lemma 3.1-(i).
Concerning uniqueness, we observe that, if and are two functions with values in the space of bounded, selfadjoint, positive operators, and they both solve (24) in weak sense, then the difference satisfies the homogeneous equation
[TABLE]
with . Now take any and and observe that, by simple computations,
[TABLE]
so that it must be
[TABLE]
Since is selfadjoint, we can use polarization to get for every and so the claim.
Now we look at the algebraic Lyapunov equation (25). From (21) it follows that solves (25). To show uniqueness, similarly for the case of the differential Lyapunov equation, we observe that, if and are two bounded, selfadjoint, positive operators which solve (25) in weak sense, then the difference satisfies the homogeneous equation
[TABLE]
Hence, for any as before we deduce
[TABLE]
so that it must be, since is of negative type,
[TABLE]
As above, since is selfadjoint, we use polarization getting and so . ∎
Remark 3.4**.**
If is selfadjoint and commutes with , then, by Proposition C.1-(v), it also commutes with , . Moreover, by the Lyapunov equation (24) we have, for all ,
[TABLE]
and, by (25), we have, for all ,
[TABLE]
Indeed, this last equality holds for all , as it follows from (58). Finally, from the last one we easily get, for all , taking ,
[TABLE]
* *
4 The Riccati equation
From Theorem 2.7 above we know that the value function is finite only in the set and is given by . Moreover for points we can write . So is a quadratic form on , defined however only for ; thus we expect that the associated operator solves666See Definition 4.10 for the formal definition of solution. our Riccati equation (4), which we rewrite here for the reader’s convenience:
[TABLE]
for every , with the initial condition . This is indeed the case, as we will prove later (see Theorem 4.12 below). Note that the initial condition has to be properly interpreted and that we cannot expect uniqueness of the RE without any initial condition as, obviously, is a solution.
Equation (26) is hard for several reasons: the infinite initial condition (arising also in [24]), the negative sign of the linear part (which does not arise in [24]) and the unboundedness of the expected solution (which is also not present in [24]). Indeed the difference due to the negative sign is substantial: even in the simplest diagonal case (see Subsection 5.2) there is no semigroup associated to the linear part of (26) on the whole space , so that the equation cannot be rewritten in mild form as usual (see e.g [27, Theorem 4.1, p. 234]).
Note that, if we change the sign of the linear part, then we are exactly in the case treated by [24], and the solution, when the null controllability Assumption 2.4 holds, just coincides with the operator-valued function on given, formally, by .
Remark 4.1**.**
We observe that performing a time inversion in the state equation, or in the RE, does not change the difficulty of the problem, which lies in the fact that the equation is forward and the linear part is negative. Of course this is not true if generates not just a -semigroup but a -group (this includes the case of bounded ). We do not want to assume this, since our examples, in particular the diagonal one (which arises in our motivating application to physics, see [6] and Subsection 5.2) does not possess such property. **
4.1 The space and its properties
In order to study equation (26) it will be useful to rewrite it in a different form and in a different space, which we call : under the null controllability assumption (Assumption 2.4) it is the reachable set of the control system (5), hence the set where the value function of (15) is well defined. Then we define
[TABLE]
Of course it holds
[TABLE]
The inclusion is in general proper. Define in the inner product
[TABLE]
We provide now some useful results on the space which will form the ground for our main results. We divide them in six Lemmas, whose proofs are collected in Appendix D. The first three concern the structure of the space and the behaviour in of the operators .
Lemma 4.2**.**
- (i)
The space introduced in (27), endowed with the inner product (28), is a Hilbert space continuously embedded into .
- (ii)
The space is dense in .
- (iii)
The operator is an isometric isomorphism from to , and in particular
[TABLE]
- (iv)
We have
[TABLE]
- (v)
For every such that we have , so that .
Lemma 4.3**.**
For let be the operator defined by (8). Then, if the space is dense in . In particular is dense in . Finally, if then .
Lemma 4.4**.**
For let be the operator defined by (8). Then
(i)
* for all ;*
(ii)
* for all ;*
(iii)
* for all .*
Suppose now that Assumption 2.4 holds. The next two lemmas deal with the operators and . By Proposition C.2, we have
[TABLE]
so that is well defined from into .
Lemma 4.5**.**
Under Assumption 2.4, for fixed the operator is an isomorphism, with inverse . Similarly for fixed the operator is an isomorphism, with inverse .
Similarly, we have:
Lemma 4.6**.**
Under Assumption 2.4, for fixed the operator is an isomorphism on the closed subspace , with
[TABLE]
The last lemma describes the adjoint in of an operator .
Lemma 4.7**.**
Let . Then
[TABLE]
where is the adjoint of the operator in .
To avoid confusion, for any we will denote by the adjoint of in , i.e. . Moreover, for a subspace of we will write for the topological dual of when is identified with its dual.
We remark that, under Assumption 2.4, if we have and, by Lemma 4.5, . Thus . Consequently, under Assumption 2.4 we may write, by Lemma 4.7,
[TABLE]
4.2 Properties of the value function
We now state the main properties of the value function defined by (15). The proofs are in Appendix D.
Proposition 4.8**.**
The value function given by (15) has the following properties:
- (i)
For every and , the function is decreasing in .
- (ii)
For every the function is quadratic with respect to , i.e. there exists a linear positive selfadjoint operator
[TABLE]
such that
[TABLE]
moreover we have
[TABLE]
- (iii)
Assume now that Assumption 2.4 holds. Then:
- (a)
the operator belongs to and
[TABLE]
in particular,
[TABLE]
In addition
[TABLE]
- (b)
The map from to is continuous, uniformly on for every ; moreover the map from to is continuous.
- (c)
Finally, we have
[TABLE]
Remark 4.9**.**
The equations (32) and (34) show that the operator , defined on , has in fact an extension to all of , given by , i.e. .* *
4.3 The value function solves the Riccati equation
We want now to show that the operator , given by (32) or (34), satisfies for the Riccati equation (26). To do this we first rewrite it in the space . The unknown is now, for all , an operator which is, formally, where is the unknown of (26), while the equation is
[TABLE]
Note that the term in the left-hand side is written using the inner product of the space while the first two in the right-hand side are written with the inner product in : they could be written in , too, but at the price of requiring more regularity on the points (since in this case should belong to ).
Definition 4.10**.**
Let .
- (i)
An operator-valued function is a solution of the Riccati equation (37) if it is strongly continuous and for all there is a set , dense in , such that for every there exists , all terms of (37) make sense and the equation holds.
- (ii)
A function , defined on with values in the set of closed, densely defined, unbounded, positive operators in , is a solution of the Riccati equation (26) if for all there is a set , dense in , such that for every there exists , all terms of (26) make sense and the equation holds.
Remark 4.11**.**
(i)* In the above definition the domain varies with time, since its natural choice (see the next theorem) is which may change with time. Similarly for the domain . Moreover is assumed to be dense in and not in , since its natural choice (see the next theorem) is which is indeed dense in and not in , in general.
*(ii) Note that we wrote equation (37) without the initial condition: the reason is that we are interested to study all solutions of such equation, also in view of the study of the infinite horizon case, where the initial condition disappears. Clearly, looking at our original minimum energy problem (see Theorem 2.7-(iii)), the natural condition for (37) (respectively (26)) is (respectively ); this condition, more precisely, reads as
[TABLE]
for seme (and similarly for ). * *
We present now the following existence result.
Theorem 4.12**.**
Suppose that Assumptions 2.1 and 2.4 hold. Then the operator given by (32) is a solution of (37) on , with the set given by for all .
Moreover the operator is a solution of (26) on , with the set given by for all .
Proof.
Fix and ; then since, using (34), for all . Moreover from the definition of and Assumption 2.4 it follows that is constant in for , so that reduces to the identity on for and greater than . Hence for sufficiently small we can write for
[TABLE]
Now we easily deduce, since by Assumption 2.4,
[TABLE]
so that, since is continuous by Proposition 4.8 (iii)(b), we readily obtain
[TABLE]
This shows that
[TABLE]
Finally, using Proposition 3.3, for all we can compute for every :
[TABLE]
This completes the proof of the first statement. The proof of the second one is completely similar and we omit it. ∎
4.4 A partial uniqueness result
We are not able to prove a satisfactory uniqueness result; here is our statement which establishes uniqueness in a restricted class of solutions.
Theorem 4.13**.**
Suppose that Assumptions 2.1 and 2.4 hold. Let be defined by (32). Let be an operator defined in , with the following properties:
(i)
, , and the maps , are strongly continuous;
(ii)
* for every ;*
(iii)
for every and the map
[TABLE]
is bounded in a neighborhood of [math];
(iv)
for every the following equation holds:
[TABLE]
(v)
there exists such that .
Then in .
Proof.
For fixed , the above equation holds in particular for every . Set now , : then we have and, replacing and into (iii) above, we get
[TABLE]
Now we want to compute, whenever possible, . We have
[TABLE]
The second term clearly converges to
[TABLE]
whereas the first term goes to [math]: indeed its first factor is bounded by assumption (iii), while the second one goes to [math] in view of the strong continuity of assumption (i). Hence we have
[TABLE]
Now set , : by definition of pseudoinverses, we have and, since there exist such that , belong to and, of course, and . The above equation then becomes
[TABLE]
Observe now that, by Proposition C.1-(ii), we have . In addition, using assumption (ii) and the fact that , we get , so that, by Lemma 3.1-(iv), . Hence we may write, for all ,
[TABLE]
i.e.
[TABLE]
This proves that solves the Lyapunov differential equation (24) in weak sense. Note that , since, using also Lemma 4.2-(iv),
[TABLE]
and it is selfadjoint, too, in view of
[TABLE]
Now we recall that by (34) it follows that for every ; then from the assumption we deduce
[TABLE]
Hence the operators and solve the Lyapunov equation and coincide for : thus they must coincide in :
[TABLE]
Thus for , i.e. with , we may write
[TABLE]
By density, we get for every , and finally for every . ∎
4.5 The selfadjoint commuting case
We consider now the case where is selfadjoint and commutes with . As a consequence, commutes with and is selfadjoint in , too. More specifically, from Proposition C.1-(v) we know that ; hence in (37) the term
[TABLE]
can be simply rewritten as ; if in addition , it just becomes . Similarly, if , in (37) the terms and can be rewritten as and . Hence, in this case, we can rewrite (37) as
[TABLE]
which makes sense for , where
[TABLE]
We give now some statements about the solutions to this equation. The first one (Theorem 4.14) is an existence result under the null controllability assumption. The subsequent ones (Theorems 4.15 and 4.16) are uniqueness-type results and do not need null controllability.
Theorem 4.14**.**
Suppose that Assumptions 2.1 and 2.4 hold. Assume that is selfadjoint in and commutes with ; let be selfadjoint in , non-negative, such that . Let moreover be such that is invertible for each . Then solves (39) in .
Proof.
It is clear that exists, since is of negative type. Consider the set
[TABLE]
it is dense in , since it contains , which is dense in by Lemma 4.3: indeed, if , then with , so that . Then, setting , we can write for and
[TABLE]
This shows that solves (39) with for every . Note that
[TABLE]
∎
The second statement is a uniqueness result.
Theorem 4.15**.**
*Suppose that Assumption 2.1 holds. Assume that is selfadjoint in and commutes with . Let moreover be a strongly continuous, selfadjoint, non-negative operator, such that:
(i) is invertible for and ;
(ii) solves (39) in .
Then for every , where .*
Proof.
Set again and define
[TABLE]
Obviously, . Moreover, for every and in the set , which is dense in , we have by (ii)
[TABLE]
This is a linear equation, governed by the semigroup : by the variation of constants formula we have for each
[TABLE]
By density this shows that
[TABLE]
which is our claim. ∎
In the next result we look at non-invertible solutions obtained through projections.
Theorem 4.16**.**
*Suppose that Assumption 2.1 holds. Assume that is selfadjoint in and commutes with ; let be a strongly continuous, selfadjoint, non-negative operator, which solves (39) in . Let moreover be an orthogonal projection, such that and for every .
Then solves (39) in if and only if for every .*
Proof.
We start by observing that the existence of a projection in such that implies that maps into : indeed if we have and both the terms of the last member belong to .
Suppose that
[TABLE]
As solves (39), we have for
[TABLE]
where, as we know,
[TABLE]
Now, if (i.e and ) then, by (40), with , and in addition , so that . Thus for each and . Hence, setting
[TABLE]
and replacing in (41) by , we have for every and
[TABLE]
i.e.
[TABLE]
Now we remark that and ; hence we obtain, for every and ,
[TABLE]
This shows that solves (39) in .
Suppose conversely that is an orthogonal projection, such that , for every and solves (39) in . Assume by contradiction that for some there exists : we can write with . Then belongs to , and . As is dense in , there exists such that in ; then in and consequently for sufficiently large .
Now by assumption we have for every
[TABLE]
whereas for every it holds
[TABLE]
We may choose in the first equation and in the second one: indeed, as , we have and ; hence and consequently, as remarked at the beginning of the proof, : this shows that . Thus we get
[TABLE]
and
[TABLE]
The second equation can be rewritten as
[TABLE]
Subtracting the second equation from the first one, we get
[TABLE]
On the other hand
[TABLE]
Now we recall that is of negative type and selfadjoint in : thus, since ,
[TABLE]
this is a contradiction. ∎
5 Examples
5.1 Delay state equation
Consider the following linear controlled delay equation
[TABLE]
where the initial datum is in , the control belongs to and the coefficients , , are real numbers with and to avoid degeneracy. We call the unique solution which always exists (see e.g. [2, Chapter 4]). Using a standard approach (see e.g. again [2, Chapter 4]), we reformulate equation (42) as an abstract differential equation in the Hilbert space . To this end we introduce the operator as follows:
[TABLE]
We denote by the -semigroup generated by : for ,
[TABLE]
The control operator is bounded and defined as
[TABLE]
In this setup, equation (42) is equivalent (in the sense that the first component of is the solution of (42)) to the equation in :
[TABLE]
For this system the null controllability Assumption 2.4 holds for any , see e.g. [13, Theorem 10.2.3] or [22]. Hence Theorems 4.12 and 4.13 hold in this case.
Now we compute the adjoints and the controllability operator. We denote by the adjoint operator of :
[TABLE]
Similarly, denoting by the -semigroup generated by , we have for
[TABLE]
where
[TABLE]
The adjoint of the control operator is
[TABLE]
It follows that
[TABLE]
where is as in (48). Hence, by linearity of (42) we can write
[TABLE]
where again is as in (48) and (which is a given piecewise polynomial function that may be computed recursively). We can then finally write, for ,
[TABLE]
where is as in (48). It is not obvious to compute and . However we can at least say that : indeed the boundary condition is obviously satisfied for all elements of by continuity of translations in ; on the other hand the second element of belongs to by direct verification simply using the continuity of .
Hence the sets and in Theorem 4.12 are equal to in this case.
5.2 Diagonal cases
Let be a complete orthonormal system in the Hilbert space , and let be a strictly increasing sequence of strictly positive numbers such that as . We define on the space the semigroup
[TABLE]
It is easily verified that is an analytic semigroup of negative type , where , with norm . Its generator is the self-adjoint, dissipative, densely defined operator , given by
[TABLE]
(see [27, pp. 178 and 198]). Note that and that is selfadjoint and compact.
As is dissipative, the fractional powers of are well defined (see [2, Proposition 6.1, page 113]).
Concerning the operator , we assume that is such that is diagonal in :
[TABLE]
with for all . By Assumption 2.1 is bounded, hence the sequence must be bounded, too. However here we generalize a bit the setting, allowing to be unbounded. Since commutes with we have, see (58),
[TABLE]
in particular, for ,
[TABLE]
Thus, if is possibly unbounded, we need to assume
[TABLE]
in order that for all . The null controllability holds for a given if and only if there exists such that
[TABLE]
This is equivalent to
[TABLE]
Hence Assumption 2.4 holds for every if and only if for every and
[TABLE]
Now, we look at and (observe that, by Proposition C.2-(iii), these are equal to and for all ). By (52) is clear that and .
- •
If only for a finite number of then, clearly, . In this case the RE is substantially finite dimensional: the function is a solution on and, by Theorem 4.16, is a solution for every projection generated by some elements of the basis .
- •
If for every , where is an infinite subset of , then, clearly,
[TABLE]
In this case the RE is infinite dimensional. Again the function is a solution on and, by Theorem 4.16, is a solution for every projection generated by some elements of the basis .
We now look closely at the second case above, when . First, if is bounded, i.e. , we have and, similarly . On the other hand, if, for some , we have for all , then and .
Thus, if both and are bounded we have and .
Finally, if for every , with , then and .
Now we consider a special case which fits into the application studied e.g. in [6] in the case of the Landau-Ginzburg model. We take and the Laplacian in with Dirichlet boundary conditions. We also take and . Using what said just above we see that and .
Appendix
Appendix A Pseudoinverses
We recall here two well known results of functional analysis that will be very useful in the sequel.
Given a linear operator , where and are Hilbert spaces, we define, as in [27, p. 209] (see also [14, p. 429]), the pseudoinverse of as the linear operator
[TABLE]
with domain , where is the element of with minimal norm. Note that .
We have the following result, taken from [14, Proposition B.1, p.429].
Proposition A.1**.**
Let be three Hilbert spaces, let , be linear operators, let and be their adjoints and finally let , be the respective pseudoinverses. Then we have:
- (i)
* if and only if there exists a constant such that*
[TABLE]
- (ii)
If
[TABLE]
then =, and
[TABLE]
Appendix B Some properties of commuting operators
Given a real separable Hilbert space , let be a generator of a strongly continuous semigroup and, for any , denote by the resolvent operator .
Definition B.1**.**
Consider an operator . We say that commutes with if, for all we have and . In particular this means that maps into itself 777In this context the operator may be defined on a set strictly larger than and in this case, in addition, the operator can be extended to all of . An obvious example of this situation occurs when is a resolvent of ..
The following result is known but, for the reader’s convenience, we provide the complete proof as we could not find it in the literature.
Lemma B.2**.**
Let be a Hilbert space, , and be the generator of a strongly continuous semigroup . The following statements are equivalent:
- (i)
There exists such that .
- (ii)
For every it holds .
- (iii)
* commutes with .*
- (iv)
* commutes with .*
- (v)
For all we have .
Proof.
(i) (ii).
We only prove (i) (ii), as the other direction is obvious. Let . Then
[TABLE]
and so, using the so-called resolvent identity, and the fact that commutes with ,
[TABLE]
Then it follows that
[TABLE]
Since we can apply to both sides of the above equality which, thanks to the injectivity of is equivalent to
[TABLE]
this, using the injectivity of , gives the claim.
(ii) (iii).
For sufficiently large , consider , the Yosida approximants of . By (iii) we immediately have for all . Let now . By the properties of Yosida approximants [23] we have and as .
Now as . Since is closed, we have and , which is the claim.
(iii) (ii).
Let . We have, for ,
[TABLE]
and, since commutes with ,
[TABLE]
By the injectivity of this implies that .
(iii) (iv).
We only prove (iii) (iv), as the other direction follows simply by taking the adjoints and using the relations and .
Let and . Then
[TABLE]
and also, since commutes with ,
[TABLE]
From the two above it follows that
[TABLE]
for some . This means that and that
[TABLE]
which is the claim.
(ii) (v).
We know that, for all , and ; hence we get
[TABLE]
We now let and use the fact that, by the properties of Yosida approximants [23], for all , as . This implies the claim.
(v) (ii).
We know [23] that, for all sufficiently large and for all ,
[TABLE]
Then
[TABLE]
and the claim follows. ∎
We will need also the following result on pseudoinverses.
Lemma B.3**.**
Let be a Hilbert space and let be such that , is selfadjoint and . Then, denoting by the pseudoinverse of , the two operators
[TABLE]
coincide on ; hence, in particular, can be extended to all of .
Proof.
Take and set
[TABLE]
Applying we get
[TABLE]
where in the first equality we have used the commuting assumption. This means that , i.e. . Now by the definition of pseudoinverse we have , while , since is selfadjoint. Hence it must be and the result follows. ∎
Appendix C Controllability operators and minimum energy
Following [27, p. 209], we collect some basic properties of the controllability operators defined in (8):
Proposition C.1**.**
Let be defined by (8).
- (i)
The operator is linear, bounded, selfadjoint and non-negative.
- (ii)
For it holds
[TABLE]
and each inclusion becomes an equality when and commute.
- (iii)
For ,
[TABLE]
so that
[TABLE]
and each inclusion becomes an equality when and commute.
- (iv)
For we have
[TABLE]
- (v)
Finally, if is selfadjoint, and and commute, we have for all
[TABLE]
This, in particular, implies that for every the operator commutes with and that
[TABLE]
Proof.
The statement (i) is immediate by definition of .
We prove now (ii). Indeed, for every , since is selfadjoint we have
[TABLE]
The above immediately gives when . Moreover, since is continuous, this function is identically [math], so the last implies . Finally since is selfadjoint then is equivalent to .
If and commute then, by Lemma B.2 also and commute and so also and . It follows that, if then, for all ,
[TABLE]
which gives the claim.
Concerning (iii), (55), as well as (56), easily follow from (54).
The statement (iv) follows by writing
[TABLE]
and then changing variable in the second integral.
The statement (v) follows since in this case, by Lemma B.2, commutes with . Hence
[TABLE]
and (58) follows by standard integration of semigroups. Concerning the commutativity of and we first observe that, by (58) we have for . Moreover, still by (58), we have, by direct computations
[TABLE]
for all . Finally, for any given we set and we write, using the last formula
[TABLE]
which, by the properties of the pseudoinverses, gives (59). ∎
Finally we provide the following, partly well known result, concerning the images of the controllability operators.
Proposition C.2**.**
Assume that Assumption 2.1 holds.
- (i)
If then .
- (ii)
If, in addition, the system (5) is null-controllable at time , i.e. Assumption 2.4 holds, then for all .
- (iii)
If is selfadjoint and commutes with then, without assuming null controllability, for all , the equalities and hold.
Proof.
The results (i) and (ii) concerning the images of the operators , are well known: see e.g., for point (i) the proof of Theorem 2.2 in Part IV, Chapter 2 of [27]; for point (ii) the proof of Theorem 2.2 in [12].
We now prove (iii). For all we have, using (57), the selfadjointness of and the commutativity,
[TABLE]
hence, if we get, for all and ,
[TABLE]
Thus we immediately get for all . On the other hand we have, for and ,
[TABLE]
which implies, for all and ,
[TABLE]
Let be such that . Then for all the above implies
[TABLE]
Using Proposition A.1-(i) this implies that for all . If the claim is proved. If take . We have, taking in (60),
[TABLE]
This implies that . Iterating this argument we see that it must be for all . Taking such that we then get . This proves the claim.
Concerning the last statement we observe that, by (61) and since commutes with , too, we may write
[TABLE]
Hence, taking such that (i.e. ), for we get
[TABLE]
which gives , and hence , for . If the claim follows. Otherwise, using (62), we have
[TABLE]
Hence, arguing as above we get for . ∎
We have the following result about the optimal pairs when .
Proposition C.3**.**
Let . Let be the optimal pair in . Then we have
[TABLE]
with defined as in Theorem 2.7 (iii). Moreover the corresponding optimal state satisfies
[TABLE]
hence the optimal pair satisfies the feedback formula
[TABLE]
and, formally, is a solution of the backward closed loop equation (BCLE)
[TABLE]
*with final condition . *
Proof.
Formula (63) follows from [27, Theorem 2.3-(iii), page 210].
Formula (64) follows by inserting (63) into the state equation:
[TABLE]
moreover formula (65) follows by simply observing that for every , and using (63)-(64).
Inserting (65) into the state equation (5) we see that, formally, is a solution of the BCLE (66).
∎
Remark C.4**.**
It is not hard to show that the above result holds true also in the case when . So we have for the optimal pair the representations
[TABLE]
[TABLE]
and the feedback formula
[TABLE]
Thus, formally, is a solution of the backward closed loop equation (BCLE)
[TABLE]
with final condition . Using the Lyapunov equation (25) proved in Proposition 3.3, the above (70) can be simplified as
[TABLE]
Hence, if commutes with (e.g. when is selfadjoint, and and commute), then the BCLE (70) becomes
[TABLE]
which is well posed and is solved by the optimal trajectory. The same argument can be used in the finite horizon case of Proposition C.3 to rewrite (66) but, due to the presence of in the Lyapunov equation (24), the result is not so useful.* *
We now give a counterexample888We are indebted to Giorgio Fabbri for this example. in the case where the null controllability Assumption 2.4 does not hold.
Example C.5**.**
Let us consider the Hilbert spaces and . The operator
[TABLE]
is the infinitesimal generator in of the -semigroup (see e.g. [17, Chapter I, Section 4.c], or [1]):
[TABLE]
or, in other words,
[TABLE]
Next, let be defined by
[TABLE]
Consider the state equation
[TABLE]
For any fixed , we have if and only if there exists such that
[TABLE]
By the definition of and the explicit form of we easily get
[TABLE]
Now fix : then if it holds
[TABLE]
so that necessarily for all . On the other hand, take and ; then if we have in particular and
[TABLE]
This shows that cannot belong to , i.e.
[TABLE]
and in particular, the system cannot be null controllable at any . * *
Appendix D Proofs
Proof of Lemma 4.2.
We start proving (i). Let be a Cauchy sequence in : then for each we have , where is uniquely determined, and by (28) is a Cauchy sequence in , so that it converges to some . As , is a Cauchy sequence in , too, and it converges to some . It follows that , so that and in . This shows that is complete. To prove that is continuously embedded into , take : then for a unique . Thus
[TABLE]
Concerning (ii), let . Then there exists a unique such that . So there exists a sequence such that in as . Setting we have as
[TABLE]
and the claim follows.
The statement (iii) follows from (28) by just taking .
To prove the statement (iv) we observe first that, for all with , ,
[TABLE]
which implies . On the other hand, if is such that
[TABLE]
then, setting , we have
[TABLE]
which gives the claim.
Finally, (v) follows by observing that is a well defined closed linear operator from to and applying the closed graph theorem. ∎
**Proof of Lemma 4.3
** We just consider the case , since the case is quite similar. Fix . Then there is a unique such that . As , there exists such that in . Since is dense in , for each we can find such that , so that in , too. Hence
[TABLE]
i.e. belongs to the closure of in . The density of follows since, by Lemma 3.1-(i), we have . Finally, the last statement follows by Lemma 3.1-(iv). ∎
**Proof of Lemma 4.4
** We recall that for we have
[TABLE]
By (72), using also the fact that is selfadjoint in , we get (i):
[TABLE]
About (ii), we have by (72), (28) and (i):
[TABLE]
Finally, (iii) follows immediately by applying (ii) twice. ∎
**Proof of Lemma 4.5
** For fixed , let be such that : then, by (72),
[TABLE]
which implies . On the other hand, by definition we also have , so that and consequently . This proves that is one-to-one. Moreover, for each the equation is equivalent to ; but since , we deduce and hence . This shows that is surjective.
We now claim that has closed graph in . Indeed, let be a sequence in such that in . This means, by definition,
[TABLE]
and
[TABLE]
if we apply to (73) we obtain
[TABLE]
whereas if we apply to (74) we get
[TABLE]
so that and our claim is proved. By Lemma 4.2 it follows that . Finally, the inverse is also in by the same argument, or by the open mapping theorem.
The proof of the second statement is quite analogous. ∎
**Proof of Lemma 4.6
** It is clear that maps into and vanishes on . Moreover if then is in and satisfies , so that is one-to-one from onto itself.
Now we prove that has closed graph. Let in : then in and in , so that . It follows that
[TABLE]
and also
[TABLE]
so that ; but since , we deduce . Thus and the result follows. ∎
**Proof of Lemma 4.7
** Indeed, by (28) and Lemma 4.4 (ii)-(iii),
[TABLE]
∎
**Proof of Proposition 4.8
** (i) Fix and with . For any , define
[TABLE]
We have , since obviously
[TABLE]
and moreover
[TABLE]
Now, for a fixed we may select such that
[TABLE]
so that for the corresponding we get
[TABLE]
and finally .
(ii) Formula (19) shows that is quadratic with respect to . Moreover (19), rewritten in , becomes
[TABLE]
and the claim is proved.
(iii)-(a) Under Assumption 2.4 formula (33) immediately follows from the fact that for every . To prove (34) we take . Then, by (19),
[TABLE]
where in the last step we used Lemma 4.4 (i). Now passing to the inner product in and using Lemma 4.4 (ii) we get
[TABLE]
which is the claim. Finally the estimate (35) is an immediate consequence of the monotonicity of .
(iii)-(b) First we show that if , then for each and there is such that
[TABLE]
To this purpose, fix and , take such that
[TABLE]
and define
[TABLE]
Since
[TABLE]
we have . Hence
[TABLE]
On the other hand, by (33) we have, for
[TABLE]
then, by (35), for every and there is such that
[TABLE]
Hence we get
[TABLE]
provided we are able to find such that
[TABLE]
In order to check (76), we fix with . We can write, by Assumption 2.4, Proposition A.1 and Lemma 4.5,
[TABLE]
Hence, using the density of in (see Lemma 4.2),
[TABLE]
so that
[TABLE]
Thus, to achieve (76) it suffices to take such that . Hence we have proved (75), too.
Now fix , and take such that (75) holds. For with we have
[TABLE]
and the first part of the claim easily follows. To prove the continuity of the map we observe that, for
[TABLE]
so the claim follows by (75).
(iii)-(c) The limit in (36) clearly exists and is finite by monotonicity and positivity of . To find this limit we consider first the case when . Then we have, by (34),
[TABLE]
Since, for suitable ,
[TABLE]
we obtain
[TABLE]
But
[TABLE]
so that by Lemma 4.5 we get
[TABLE]
By selfadjointness of and polarization, we also have
[TABLE]
Since, by (35), is uniformly bounded, by density (Lemma 4.2) we deduce that
[TABLE]
and using again that is selfadjoint we get
[TABLE]
With the same argument we then obtain
[TABLE]
and the result follows. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] E. Barucci and F. Gozzi, Technology adoption and accumulation in a vintage capital model, J. of Economics, 74 , 1-38 (2001).
- 2[2] A. Bensoussan, G. Da Prato, M.C. Delfour and S. K. Mitter, Representation and control of infinite dimensional systems, Second edition, Birkhäuser, Boston, 2007.
- 3[3] L. Bertini, A. De Sole, D. Gabrielli, G. Jona–Lasinio and C. Landim, Fluctuations in stationary nonequilibrium states of irreversible processes, Phys. Rev. Lett. 87 , 040601 (2001).
- 4[4] L. Bertini, A. De Sole, D. Gabrielli, G. Jona–Lasinio and C. Landim, Macroscopic fluctuation theory for stationary non equilibrium state, J. Statist. Phys. 107 , 635–675 (2002).
- 5[5] L. Bertini, A. De Sole, D. Gabrielli, G. Jona–Lasinio and C. Landim, Large deviations for the boundary driven simple exclusion process, Math. Phys. Anal. Geom. 6 , 231–267 (2003).
- 6[6] L. Bertini, A. De Sole, D. Gabrielli, G. Jona–Lasinio and C. Landim, Minimum dissipation principle in stationary non-equilibrium states, J. Statist. Phys. 116 , 831–841 (2004).
- 7[7] L. Bertini, A. De Sole, D. Gabrielli, G. Jona–Lasinio and C. Landim, Action functional and quasi-potential for the Burgers equation in a bounded interval, Comm. Pure. Appl. Math. 64 , 649–696 (2011).
- 8[8] R.F. Curtain, Linear-quadratic control problem with fixed endpoints in infinite dimensions. J. Optimiz. Theor. Applies. 44, 55-74 (1984).
