We first show that under a suitable balanced repartition of the mixed controls within the system, Kalman’s rank condition is still necessary and sufficient for the uniqueness of solution to the adjoint system associated with incomplete internal and boundary observations, therefore for the approximate controllability of the primary system by means of mixed controls. Then we study the stability of the approximately synchronizable state by groups with respect to applied controls.
Let be a bounded domain with smooth boundary Γ and be a neighbourhood of Γ. Let A be a matrix of order N, and be full column-rank matrices of order and respectively, all the matrices are of constant elements. Consider the following system for the state variable , controlled by the internal control and the boundary control :
associated with the initial condition:
where denotes the characteristic function of ω. We will show that when the controls are well distributed within the system, Kalman’s rank condition
is not only necessary but also sufficient for the approximate controllability of system (1.1).
By duality approach as in [10], the approximate controllability of system (1.1) is equivalent to the uniqueness of solution to the following adjoint system for the variable :
associated with the initial data
the locally distributed internal observation
and the Neumann boundary observation
As , it was shown in [8] that the following Kalman’s rank condition:
is sufficient for the approximate controllability of system (1.1). Similarly, as , Kalman’s rank condition
is still sufficient for the approximate controllability for nilpotent matrix A and star-shaped domain Ω [10], these conditions are not necessary, but technically indispensable in the proof.
In the case of mixed controls, we will project problem onto suitable subspaces and split it into two subsystems, among which one is subjected to the internal observation, while another to the boundary observation. Since Kalman’s rank condition (1.3) only announces that there are enough observations, some additional algebraic conditions have to be required to ensure a balanced repartition of observations according to the decomposition of the system. In this way, we will guarantee the uniqueness of solution for each subsystem, therefore for the whole system.
The study generalizes the consideration in [8] for the internal control and the results given by [10] for the boundary control. However, it is not a simple collection of the known results on internal controllability and boundary controllability, but rather than the coordination of several compositions in a complex system! The work raises many interesting questions and opens up a new direction on this topic.
Letbe an integer. The Kalman’s rank conditionholds with the control matrix D if and only if d is the dimension of the largest subspace which is invariant forand contained in. Moreover, the largest subspace invariant forand contained inis given by
Let,and V denote the largest subspaces invariant forand contained in,and, respectively. We have
The non trivial subspacesandare bi-orthonormal in, namely,whereis the Kronecker symbol, if and only ifor equivalently if and only if V is a supplement of.
Assume that the Kalman’s rank conditionholds with the control mnatrix. Then for any given initial data, system (
1.4
) associated with the internal observation (
1.6
) has only the trivial solution, provided that, wheredenotes the geodesic diameter of Ω.
Letbe a bounded domain with smooth boundary Γ satisfying the usual multiplier control condition. Assume that A is a nilpotent matrix. Assume furthermore thatThen, for any given initial data, system (
1.4
) associated with the boundary observation (
1.7
) has only the trivial solution, provided that the timeis large enough.
For any given initial data, if system (
1.4
) associated with (
1.6
) and (
1.7
) has only the trivial solution, then we have Kalman’s rank condition (
1.3
).
If Kalman’s rank condition (1.3) fails, by Lemma 2.1, the largest subspace V invariant for and contained in is not reduced to . The subspace
is invariant for the operator and system (1.4) admits non trivial solutions which lie in , therefore satisfy the conditions of observations (1.6) and (1.7). □
Letbe a bounded domain with smooth boundary Γ satisfying the usual multiplier control condition and ω be a subdomain of Ω. Assume that
Kalman’s rank condition (
1.3
) holds with the control matrix;
the largest subspaceinvariant forand contained inadmits a supplementwhich is also invariant for;
the restriction ofonis a nilpotent matrix.
Then, for any given initial data, system (
1.4
) associated with (
1.6
) and (
1.7
) has only the trivial solution, provided that the timeis large enough.
Let
for some p with . The case corresponds to Theorem 2.1, while the case implies , therefore corresponds to Theorem 2.2. We then need only to consider the case p with .
Firstly, let be the p-dimensional subspace. By Lemma 2.1, we have
Define a matrix of order by . By the first condition in (2.14), is invariant for A. By Lemma 2.5 with replaced by , there exists a matrix of order p, such that
Similarly, define a matrix of order by . Since is invariant for , is invariant for A. Still by Lemma 2.5 with replaced by , there exists a matrix of order , such that
Since and are mutually supplementary, for any given , we can write
Projecting system (1.4) on the subspaces and , we get, respectively,
and
Secondly, noting the second condition in (2.14), we have , then and the -observation (1.6) becomes
Using (2.10) in Lemma 2.5, we get
Since
by Lemma 2.4, we have
So the pair satisfies the corresponding Kalman’s rank condition (2.11). By Theorem 2.1, subsystem (2.18) associated with the internal -observation (2.20) has only the trivial solution , provided that .
Finally, noting , the boundary -observation (1.7) becomes
Let denote the largest subspace invariant for and contained in , and V denote the largest subspace invariant for and contained in . By Lemma 2.1, condition (1.3) implies . Then it follows from Lemma 2.2 that
By Lemma 2.4, it follows that
Using (2.10) in Lemma 2.5, we get
It follows from (2.26) and (2.27) that
So the pair satisfies the corresponding Kalman’s rank condition (2.12). Moreover, since is nilpotent and Ω satisfies the usual multiplier control condition, by Theorem 2.2, the subsystem (2.19) associated with the boundary -observation (2.24) has only the trivial solution , provided that is large enough. Then, noting , it follows from (2.17) that , provided that the time is large enough. □
The usual multiplier control condition is technically required for the uniqueness of solution to subsystem (2.19) by boundary observation (2.24). Moreover, the observation time T depends on the number p of equations in (2.19) and on the rank of matrix . It might be large enough and indeterminable explicitly in general ([5,10,15]).
Letbe a bounded domain with smooth boundary Γ satisfying the multiplier control condition and ω be a subdomain of Ω. Assume that
Kalman’s rank condition (
1.3
) holds with the control matrix;
we have the following condition
the restriction ofonis a nilpotent matrix, whereis the largest subspace invariant forand contained in.
Then, for any given initial data, system (
1.4
) associated with (
1.6
) and (
1.7
) has only the trivial solution forlarge enough.
For , let denote the largest subspace invariant for and contained in , and V denote the largest subspace invariant for and contained in . We have . Moreover, condition (2.29) implies . Therefore, is a supplement of , and both and are invariant for . We can thus apply Theorem 2.3 for getting the uniqueness of solution to system (1.4) with the internal observation (1.6) and the boundary observation (1.7). □
The subspace is contained in , therefore unobservable by the -observation, hence, it should be naturally observed by the -observation. Accordingly, the supplement should be observed by the -observation. So the balanced distribution of observations is implemented by a coordination of the subspace and its supplement .
Letbe a bounded domain with smooth boundary Γ and ω be a subdomain of Ω. Assume that
Kalman’s rank condition (
1.3
) holds with the control matrix;
the largest subspaceinvariant forand contained inadmits a supplementwhich is also invariant for;
the boundary control matrixsatisfies the following condition
Then, for any given initial data, system (
1.4
) associated with (
1.6
) and (
1.7
) has only the trivial solution, provided that.
By the same procedure as in Theorem 2.3, we project system (1.4) on the subspaces and into two subsystems (2.18) and (2.19). Since the subsystem (2.18) is observed by internal -observation (2.20), under the corresponding Kalman’s rank condition (2.23) for the pair , we can still deduce .
We next show that . Since , the boundary -observation (1.7) becomes
Noting , condition (2.30) implies
Then, by Lemma 2.4, we get
Since the matrix is of order , so is a full column-rank matrix, then it follows from (2.31) that
By Holmgren’s uniqueness Theorem, the subsystem (2.19) associated with the full boundary observation (2.33) has only the trivial solution , provided that . □
Letbe a bounded domain with smooth boundary Γ and ω be a subdomain of Ω. Assume that conditions (
1.3
), (
2.29
) and (
2.30
) hold with. Then, for any given initial data, system (
1.4
) associated with (
1.6
) and (
1.7
) has only the trivial solution, provided that.
Under condition (1.3), Lemma 2.2 implies . Moreover, condition (2.29) implies , then is a supplement of , and both and are invariant for . We can then apply Theorem 2.4 for getting the uniqueness of solution. □
Under condition (2.30), the uniqueness of solution to subsystem (2.19) with boundary observation (2.31) directly follows from Holmgren’s unique continuation theorem. So the multiplier control condition on Ω is no longer needed for Theorem 2.4 and Corollary 2.2, moreover, the observation time can be explicitly given by . This should be interesting for the engineering application.
Approximate mixed controllability
The following result can be easily shown by transposition (see [1,2,12,13]).
Letbe a bounded domain with smooth boundary Γ. For any given initial dataand any given mixed controls, system (
1.1
) admits a unique solutionwith continuous dependence.
System (1.1) is approximately controllable at the time if for any given initial data , there exists a sequence of controls in with compact support in , such that the sequence of the corresponding solutions to system (1.1) satisfies
in the space
By the duality approach, the approximate controllability of system (1.1) is equivalent to the uniqueness of solution to system (1.4) associated with the mixed observations (1.6) and (1.7). As a direct consequence of Theorem 2.3, we have
Letbe a bounded domain with smooth boundary Γ satisfying the multiplier control condition and ω be a subdomain of Ω. Assume that
Kalman’s rank condition (
1.3
) holds with the control matrix;
the largest subspaceinvariant forand contained inadmits a supplementwhich is also invariant for;
the restriction ofonis a nilpotent matrix.
Then system (
1.1
) is approximately controllable by mixed controls, provided thatis large enough.
Letbe a bounded domain with smooth boundary Γ satisfying the multiplier control condition and ω be a subdomain of Ω. Assume that
the conditions (
1.3
) and (
2.29
) hold with the control matrix;
the restriction ofonis a nilpotent matrix, wheredenotes the largest subspace invariant forand contained in.
Then system (
1.1
) is approximately controllable by mixed controls, provided thatis large enough.
As what has been explained in Remark 2.1, the controllability time is not explicitly determinable in these cases.
When or , we find again the previous results on the approximate boundary controllability in [7,10] or the approximate internal controllability in [8].
As a direct consequence of Theorem 2.4, we have the following result which is more practically useful for applications.
Letbe a bounded domain with smooth boundary Γ and ω be a subdomain of Ω. Assume that
Then system (
1.1
) is approximately controllable by mixed controlsat the time.
Letbe a bounded domain with smooth boundary Γ and ω be a subdomain of Ω. Assume that conditions (
1.3
), (
2.29
) and (
2.30
) hold with the control matrix. Then system (
1.1
) is approximately controllable by mixed controlsat the time.
As what has been explained in Remark 2.3, under the stronger condition (2.30), the multiplier control condition is no longer necessary in Theorem 3.2 and Corollary 3.2, and the controllability time can be specified by .
In order to better fit with the exact controllability and the exact synchronization, we have chosen as working space for system (1.4), accordingly, as working space for the primary system (1.1). Of course, the choice of working spaces is abundant.
Approximate mixed synchronization by groups
Let be an integer and
be a partition with for . We rearrange the components of the state variable U into p groups
System (1.1) is approximately synchronizable by p-groups at if for any given initial data , there exists a sequence of controls in with compact support in , such that the sequence of the corresponding solutions to system (1.1) satisfies
as for all and . Furthermore, if there exists a vector-valued function , called the approximately synchronizable state by p-groups, such that
as for all and , Then system (1.1) will be called approximately synchronizable by p-groups in the pinning sense with the approximately synchronizable state by p-groups .
Let be a full row-rank matrix of order :
Define the matrix of synchronization by p-groups as
Let
where
(4.3) can be written as
in the space
respectively, (4.4) can be written as
in the space
Assume that A satisfies the condition of -compatibility:
By Lemma 2.5, there exists a unique matrix of order , such that
Applying to system (1.1) and setting , we get the following reduced system:
where
Obviously, the approximate synchronization by p-groups of system (1.1) is equivalent to the approximate controllability of the reduced system (4.13).
Letbe a bounded domain with smooth boundary Γ satisfying the multiplier control condition and ω be a subdomain of Ω. Assume that A satisfies the condition of-compatibility (
4.11
). Assume furthermore that
the rank conditionholds with;
the largest subspaceinvariant forand contained inadmits a supplementwhich is also invariant for;
the restriction ofon the subspaceis a nilpotent matrix.
Then system (
1.1
) is approximately synchronizable by p-groups at the timelarge enough.
Letbe a bounded domain with smooth boundary Γ and ω be a subdomain of Ω. Assume that A satisfies the condition of-compatibility (
4.11
). Assume furthermore that
the largest subspaceinvariant forand contained inadmits a supplementwhich is also invariant for;
the boundary control matrixsatisfies the condition
Then system (
1.1
) is approximately synchronizable by p-groups at the time.
For the convenience of applications, we will reformulate Theorem 4.1 in terms of original matrices A, and . For a better presentation, we first make some elementary preparation.
Let,and. The preimage of B under f is defined byThe following properties hold:
Letbe given by (
4.12
) andbe given by (
4.14
), respectively.
We have
For any given subspace V invariant for, the subspaceis invariant for.
Let V be the largest subspace invariant forand contained in.is the largest subspace invariant forand contained in.
The restriction ofonis the same as the restriction ofon V.
Let V be the largest subspace invariant forand contained inandbe a supplement of V. Bothand V are invariant for.
Thenis a supplement of, moreover, bothandare invariant for.
(a) Let , namely, , or equivalently, . This gives (4.23).
(b) Using Lemma 4.1, we easily get
So is invariant for .
(c) Still by (4.19) in Lemma 4.1, we have
So is invariant for and contained in . Therefore,
where is the largest subspace invariant for and contained in .
On the other hand, noting (4.12), we get
and
So is invariant for and contained in , therefore . Since is injective, by (4.18) in Lemma 4.1, we have
which together with (4.25) implies (4.24).
(d) Noting (4.12), we have
Since is invariant for , there exists a matrix of order , such that
Then it follows from (4.26) and (4.27) that
So the matrix is also the restriction of on V.
(e) Using (4.21) and (4.22) in Lemma 4.1, we get
and
□
The following theorem is a version of Theorem 4.1 in terms of original matrices.
Letbe a bounded domain with smooth boundary Γ satisfying the multiplier control condition and ω be a subdomain of Ω. Assume that A satisfies the condition of-compatibility (
4.11
). Assume furthermore that
the rank conditionholds with control matrix;
the largest subspaceinvariant forand contained inadmits a supplementwhich is also invariant for;
the restriction ofon the subspaceis a nilpotent matrix.
Then system (
1.1
) is approximately synchronizable by p-groups forlarge enough.
It is not difficult to check all the assumptions in Theorem 4.1. □
Similarly, the following theorem is a version of Theorem 4.2 in terms of the original matrices.
Letbe a bounded domain with smooth boundary Γ and ω be a subdomain of Ω. Assume that A satisfies the condition of-compatibility (
4.11
). Assume furthermore that
the rank condition (
4.29
) holds with the control matrix;
the largest subspaceinvariant forand contained inadmits a supplementwhich is also invariant for;
the boundary control matrixsatisfies the following condition
Then system (
1.1
) is approximately synchronizable by p-groups at the time.
Under the stronger condition (4.30), the multiplier control condition is no longer necessary for Theorem 4.4, and the controllability time is specified by .
Condition of -compatibility
Let denote the largest subspace invariant for and contained in . We define the projection of system (1.1) on V by
The projectionis independent of applied controls.
Let () be some coefficients such that
For , applying to system , we get
which is independent of applied controls. □
Let V denote the largest subspace invariant forand contained in. Assume that system (
1.1
) is approximately synchronizable by p-groups. Then we have
For any given , there exists a sequence in with compact support in , such that the sequence of the corresponding solutions to system (1.1) satisfies (4.7).
Let and , such that
We have
By (4.7), the right-hand side of (5.5) goes to zero as , but the left-hand side is independent of applied controls because of Proposition 5.1. We get thus . Then . □
Assume that system (
1.1
) is approximately synchronizable by p-groups. Then the rank conditionholds with control matrix, or equivalentely,whereis given by (
4.14
). Assume furthermore that we haveThen A satisfies the condition of-compatibility (
4.11
).
By Lemma 2.1, is the largest subspace invariant for and contained in . By Proposition 5.2,
Then by Lemma 2.4, we get (5.6).
Noting (4.7) and applying successively to system (1.1) with and , we get
namely,
where is the extension matrix of order with defined by
By Cayley-Hamilton’s Theorem, is invariant for , namely, A satisfies the condition of -compatibility. By Proposition 5.2 with replaced by , we get
By Lemma 2.4, we get
It follows that , namely, , therefore, A satisfies the condition of -compatibility (4.11). □
Induced mixed synchronization
Let be a matrix of order . System (1.1) is approximately -synchronizable at the time if for any given initial data , there exists a sequence of controls in with compact support in , such that the sequence of corresponding solutions to system (1.1) satisfies
in the space
Moreover, if there exist a vector-valued function , called the approximately -synchronizable state, such that
as in the space
system (1.1) will be approximately -synchronizable in the pinning sense.
When with , and system (1.1) is already approximately synchronizable by p-groups, the approximate -synchronization will be called the induced synchronization. In particular, the matrix will be defined by the following external extension.
For , let be the eigenvalue of and denote by (see [3,14])
the corresponding Jordan chain. Let I denote the set of indices i such that
Let be the extension matrix of order given by
and
Define the control matrix of order by
where denotes the supplement of I.
Let A satisfy the condition of-compatibility (
2.19
). Assume thatThen we havewhereis defined by (
6.7
).
We will develop the approximate -synchronization with given by (6.7).
Letbe a bounded domain with smooth boundary Γ and ω be a subdomain of Ω. Assume that A satisfies the condition of-compatibility (
4.11
). Assume furthermore that
Kalman’s rank condition (
4.29
) holds with the control matrix;
the largest subspaceinvariant forand contained inadmits a supplementwhich is also invariant for;
the control matrixsatisfies condition (
4.30
) andis invariant for.
Then system (
1.1
) is approximately-synchronizable at the time.
First, by Lemma 6.2, condition (4.29) implies
where and is given by (6.7). By Lemma 2.4 with replaced by , it follows from (6.16) that
where by Lemma 2.1, is the largest subspace invariant for and contained in . Noting that is invariant for , so is the largest subspace invariant for and contained in . By Lemma 2.2, . Then it follows from (6.17) that
Finally, since A satisfies the condition of -compatibility (6.10) in Lemma 6.1, applying Theorem 4.4 with replaced by , we get the approximate -synchronization for system (1.1). □
Under the stronger condition (c), the multiplier control condition is no longer necessary for Theorem 6.1, and the controllability time is specified by .
In order to guarantee
for getting the approximate -synchronization, we require to be invariant for in Theorem 6.1.
We denote by
Letbe a bounded domain with smooth boundary Γ and ω be a subdomain of Ω. Assume that A satisfies the condition of-compatibility (
4.11
). Then we have
First, by Theorem 6.1, for any given , system (1.1) is approximately -synchronizable. By Proposition 5.3 with replaced by , we have
In particular, we have
We next show that the control matrix , where is defined by (6.9). Then, combining (6.11) and (6.22), we get (6.20).
(a) Noting (6.12), the rank condition (4.29) holds for .
(b) Noting
and are mutually supplementary, moreover, both and are invariant for .
(c) Noting and , we have
Moreover, is obviously invariant for . Then the control matrix . The proof is complete. □
The approximate -synchronization (6.1) provides more convergences than the approximate synchronization by p-groups (4.7). We recover then the controls lost in the reduced system (4.13). This is the best thing that we can expect.
Stability of approximate mixed synchronization by groups
We first characterize Kalman’s rank condition (5.8) from an algebraic point of view.
Letbe a bounded domain with smooth boundary Γ satisfying the multiplier control condition and ω be a subdomain of Ω. Assume that system (
1.1
) is approximately synchronizable by p-groups. The following assertions are equivalent:
Kalman’s rank condition (
5.8
) holds with the control matrix;
is invariant forand admits a supplement V, on which the projection of system (
1.1
) is independent of applied controls;
is invariant forand admits a supplement V, which is invariant forand contained in.
By Proposition 5.2, , where V is the largest subspace invariant for and contained in . By Lemma 2.1, condition (5.8) implies . Noting , Lemma 2.3 implies that V is a supplement of . Then, applying Proposition 5.1 with , the projection of system (1.1) is independent of applied controls.
(b) ⟹ (c). Let . By Proposition 3.1, the linear mapping
is continuous from the space to the space . The Fréchet derivative satisfies
Noting , for any given , let
Applying to (7.2), we get
Since the projections and on V are independent of applied controls, their Fréchet derivatives and . It follows from (7.4) that
From (7.5), we get for all , then .
Let and in (7.2). By Proposition 3.1, the mapping
is continuous from to , therefore compact from to by [11, Theorem 4.1]. On the other hand, by (7.6), there exists a positive constant c such that
We get thus , namely, , which together with implies with .
Now, writing , it follows from (7.6) that
Since A satisfies the condition of -compatibility (4.11), by Lemma 2.5, there exists a matrix of order satisfying (4.12). Applying to system (7.2) and setting , we get the following reduced system:
which is approximately controllable. Then the state variable is dense in at the time as the control runs through the space . Then it follows from (7.9) that , namely, . It follows from (7.3) that V is invariant for .
(c) ⟹ (a). Noting , by Lemma 2.1, we get
By Proposition 5.3, we have
We get thus (5.8). □
In order to realize the approximate synchronization by p-groups under Kalman’s rank condition (5.8), should be diagonalizable by blocks following the decomposition . This is an important algebraic condition on the matrix A.
Let the matrixbe defined by (
6.7
), such that. We haveFurthermore, the matrixis a full row-rank matrix of order, such that
Assume thatThen there exists a matrixof order, such that for any given, we havewhereis the largest subspace invariant forand contained in, andfor.
By Lemma 2.4, conditions (7.16) and (7.17) imply that . Noting , by Lemma 2.3, V and , and and are bi-orthonormal. Then we can choose
and an matrix by , such that
Moreover, is a supplement of , then, for any given , there exist and , such that
Noting (7.20) and applying to (7.21), we get . Similarly, noting (7.19) and applying to (7.21), we get for . □
The following result reveals the consequence of Kalman’s rank condition (5.8) from the point of view of control.
Letbe a bounded domain with smooth boundary Γ satisfying the multiplier control condition and ω be a subdomain of Ω. Assume that the coupling matrix A satisfies the condition of-compatibility (
4.11
), and the control matrix. Then the following assertions are equivalent:
system (
1.1
) is approximately synchronizable by p-groups and the Kalman’s rank condition (
5.8
) holds with the control matrix;
system (
1.1
) is approximately pinning synchronizable by p-groups and the approximately synchronizable state by p-groupsis independent of applied controls;
system (
1.1
) is approximately pinning synchronizable by p-groups and the componentsof the approximately synchronizable state by p-groups are linearly independent;
system (
1.1
) possesses the approximate pinning synchronization by p-groups and it cannot be extended to another approximate synchronization by groups.
(a) ⟹ (b). By Proposition 5.2, , where V is the largest subspace invariant for and contained in . Noting (5.8), by Lemma 7.2, there exists a matrix of order , such that
Noting (4.7) and passing to the limit in (7.22) as , we get (4.9) with , which are determined by (5.3) and independent of applied controls.
(b) ⟹ (c). Assume that are linearly dependent, then there exist some coefficients not all zero, such that
for all the initial data . Define the extended matrix
where the row vector is given by
Since , the extended matrix has the full row-rank . Noting (4.7) and (7.23), system (1.1) is approximately synchronizable by -groups. By Theorem 6.2, system (1.1) is approximately -synchronizable at the time with .
Since satisfies the condition of compatibility (6.1), by Lemma 2.5, there exists a matrix of order , such that . Setting , the following reduced system:
is approximate controllable.
Let . By Lemma 7.1, is an full row-rank matrix with . We easily get
then we have
By Lemma 2.5 with replaced by , there exists a matrix of order , such that
Applying to system (7.26), we get
It follows that
provided that
By the approximate -synchronization, for any given initial data , there exists a sequence of mixed controls in with compact support in , such that the sequence of solutions to system (1.1) associated with the initial data satisfies
or, by Lemma 7.1, we get
Noting (7.30), we have
Since the approximately synchronizable state by p-groups is independent of applied controls, so is the unique approximately synchronizable state by p-groups for system (1.1) with the initial data , then we get
Passing to the limit as in (7.32), we get
It follows from (7.31) that . By (7.15), we get a contradiction with .
. Assume that system (1.1) can be extended to another approximate -synchronization. Applying to (4.9), we get
for all the initial data . Since , there exists an integer r with , such that . This contradicts the linear independence of .
(d) ⟹ (a). First, for , we denote by the eigenvalue of associated with the corresponding Jordan chain:
The non-extensibility of approximate synchronization by p-groups implies . Noting in (6.7), we can write
Assume that
By Lemma 2.1, the -dimensional subspace
is the largest subspace invariant for and contained in . By Proposition 5.2, we have
Then, for each (the complement of I), there exists an integer with , such that
and
Noting that the cardinal of is equal to p, if , there exists at least an integer , such that
For , applying to system (1.1) and setting , we get
Applying to system (1.1) and setting , we get
Since system (7.43) is independent of controls, we can define by
Then, inserting the new variable
into system (7.44), we get
Thus, setting
and
we can combine the two systems (4.13) and (7.47) to get an extended system:
Using Proposition 7.1 below, we can apply Theorem 3.2 to get the approximate controllability of system (7.50). Then, for any given initial data , there exists a sequence of controls such that the sequence of the corresponding solutions to system (7.50) satisfies
namely,
Noting (4.13) with and the support of is contained in , we get
By the definition of approximate pinning synchronization by p-groups, there exist such that
in the space
Then, passing to the limit as in the second relation (7.52), we get
Since the approximately synchronizable state by p-groups fulfils the subspace , it follows from (7.56) that
namely, . Noting that , this contradicts (7.37) which shows that . □
In order to complete the proof of Theorem 7.2, we give the following
Let the matrixof order, respectively, the matrixof orderbe defined by (
7.49
). Then,
we have Kalman’s rank condition:
the largest subspaceinvariant forand contained inadmits a supplementwhich is also invariant for;
we have
(a) Let and , such that
Then, noting (7.49), we have
We will show that . Otherwise, without loss of generality, we may take . Using (4.12) and (7.36), we have
Then the subspace
is invariant for and contained in .
Next we show that
In fact, let such that
namely,
Noting (7.40) and , we get
Noting (7.37), we get . Then, by Lemma 2.1, we get
which contradicts (7.38).
Setting in (7.61), we get that is an eigenvector of contained in . On the other hand, by Proposition 5.3, condition (5.7) holds. By Lemma 2.1, the largest subspace invariant for and contained in is reduced to , therefore . Consequently, we get , therefore the largest subspace invariant for and contained in is reduced to . Still by Lemma 2.1, we get the corresponding Kalman’s rank condition (7.58).
In order to verify the conditions (b) and (c), we have to distinguish the following two cases.
I. We first consider the case .
(I-b) Define
where is the largest subspace invariant for and contained in , and is a supplement of and invariant for .
By Proposition 4.1, is the largest subspace invariant for and contained in , and is a supplement of and invariant for . Obviously, is a supplement of . Moreover, noting (7.49), we easily check that both and are invariant for :
Since , we have
Noting that , we have
So, the subspace is contained in .
Let be the dimension of . Noting that is of order , by Lemma 2.1, we have
Noting (7.66), we have
It follows from (7.67) that
Noting that is of order , by Lemma 2.1, the largest subspace invariant for and contained in has the dimension .
On the other hand, using (7.65), we have
So, is indeed the largest subspace invariant for and contained in .
(I-c) Noting (7.42) and , the sub-chain lies in , therefore, belongs to . For any given , we have , therefore, , namely, , then, . It follows then that
Noting (7.37), (7.40) and (7.42), we have . We get thus (7.59).
II. We next consider the case .
(II-b) Define and by
Similarly to the previous case, we easily check that is invariant for and contained in , and is a supplement of and invariant for .
Let be the dimension of , the largest subspace invariant for and contained in . Noting that is of order , by Lemma 2.1, we have
Noting (7.49), we have
We claim that the last row of (7.70) is not a linear combination of the first rows. Otherwise, there exists a non-zero vector , such that
Noting that in (4.14), it follows that
Then, we get
Noting (7.40) and (7.42), we have
Noting , it follows from (6.9) that
On the other hand, noting (7.37), we have
Then, taking (7.73)–(7.75) into account, it follows from (7.72) that
We get thus a contradiction from (7.71): .
It follows then from (7.69) and (7.70) that
Noting that is of order , by Lemma 2.1, the largest subspace invariant for and contained in has the dimension d. On the other hand, by (7.68), we have . Then, is indeed the largest subspace invariant for and contained in .
(II-c) For any given , we have , namely, , therefore, , namely, . Consequently, we get . It follows that
Noting (7.37), (7.40) and (7.42), we have . We get again (7.59). □
Mixed pinning synchronization
Theorem 7.2 describes the situation when is diagonalizable by blocks on the basis . If this is not the case, we can extend the matrix to the matrix by the procedure described by (6.7), so that can be diagonalized by blocks on the basis . In this case, by Theorem 7.2, the rank of Kalman’s matrix attaints the minimum and system (1.1) is approximately -synchronizable.
The following result fits Theorem 7.2 to the general case, and answer the third question on what will be happened in the general situation.
Letbe a bounded domain with smooth boundary Γ satisfying the multiplier control condition and ω be a subdomain of Ω. Assume that. The following assertions are equivalent.
system (
1.1
) is approximately-synchronizable under the minimal rank conditionwhere the symboldenotes the argument of the minimum in;
system (
1.1
) is approximately pinning-synchronizable and the approximately-synchronizable stateis independent of applied controls;
system (
1.1
) is approximately pinning-synchronizable and the componentsof the approximately-synchronizable state are linearly independent;
system (
1.1
) is approximately pinning-synchronizable and the approximate pinning-synchronization cannot be extended to another approximate synchronization.
By Theorem 6.2, the minimal rank condition (8.1) is equivalent to
where q is given by (6.8). Then we meet again the same situation in Theorem 7.2. □
Letbe a bounded domain with smooth boundary Γ satisfying the multiplier control condition and ω be a subdomain of Ω. Assume that system (
1.1
) is approximately synchronizable by p-groups under the minimum rank condition (
8.1
). Then system (
1.1
) is approximately synchronizable by p-groups in the pinning sense.
By Theorem 8.1, system (1.1) is approximately -synchronizable in the pinning sense. Since , there exist some coefficients such that
then, by (6.3) we have
where are given by (4.6). We then get the approximate synchronization by p-groups in the pinning sense with the approximately synchronizable state by p-groups given by
We identify thus the approximate synchronization by p-groups in the consensus sense with that in the pinning sense, however, when , the components of the approximately synchronizable state by p-groups given by (8.5) are not linearly independent! □
References
1.
A.V.Balakrishnan, Applied Functional Analysis, Applications of Mathematics, Vol. 3, Springer, New York, 1977.
2.
Th.Cazenave and A.Haraux, An Introduction to Semilinear Evolution Equations, Clarendon Press, Oxford, 1998.
3.
W.Hirsch and S.Smale, Differential Equations, Dynamic Systems and Linear Algebra, Academic Press, New York, 1974.
4.
J.L.Kelley, General Topology, Graduate Texts in Mathematics, Springer Verlag, New York, 1975.
5.
T.-T.Li and B.-P.Rao, Exact synchronization for a coupled system of wave equation with Dirichlet boundary controls, Chin. Ann. Math. Ser. B34 (2013), 139–160. doi:10.1007/s11401-012-0754-8.
6.
T.-T.Li and B.-P.Rao, Criteria of Kalman’s type to the approximate controllability and the approximate synchronization for a coupled system of wave equations with Dirichlet boundary controls, SIAM J. Control Optim.54 (2016), 49–72. doi:10.1137/140989807.
7.
T.-T.Li and B.-P.Rao, On the approximate boundary synchronization for a coupled system of wave equations: Direct and indirect boundary controls, ESAIM Control Optim. Calc. Var.24 (2019), 1675–1704. doi:10.1051/cocv/2017043.
8.
T.-T.Li and B.-P.Rao, Uniqueness theorem for a coupled system of wave equations with incomplete internal observation, Comptes Rendus Math.360 (2022), 729–737. doi:10.5802/crmath.341.
9.
T.-T.Li and B.-P.Rao, Stability of the exactly synchronizable state by groups for a coupled system of wave equations with respect to applied controls, to appear.
10.
T.-T.Li and B.P.Rao, Boundary Synchronization for Hyperbolic Systems, Progress in Non Linear Differential Equations, Subseries in Control, Vol. 94, Birkhaüser, 2019.
11.
J.-L.Lions, Quelques Méthodes de Résolution des Problèmes aux Limites Non Linéaires, Dunod, Gauthier-Villars, Paris, 1969.
12.
J.-L.Lions and E.Magenes, Problèmes aux Limites non Homogènes et Applications, Vol. 1, Dunod, Paris, 1968.
13.
A.Pazy, Semi-Groups of Linear Operators and Applications to Partial Differential Equations, Applied Mathematical Sciences, Springer-Verlag, 1982.
14.
R.A.Smale and C.R.Johnson, Matrix Analysis, Cambridge University Press, 2013.
15.
C.X.Zu, T.-T.Li and B.P.Rao, Exact internal controllability and synchronization for a coupled system of wave equations, Chin. Ann. Math., Series B (2023), to appear.