Stability of diffusively coupled linear systems with an invariant cone
Patrick De Leenheer

TL;DR
This paper investigates conditions under which diffusive coupling preserves stability in linear systems, identifying specific classes where stability is maintained despite general counterexamples.
Contribution
It characterizes a class of linear systems for which diffusive coupling guarantees stability, extending understanding beyond known counterexamples.
Findings
Identifies classes of systems with stability-preserving diffusive coupling
Provides theoretical conditions for stability preservation
Highlights limitations of diffusive coupling in general
Abstract
This paper concerns a question that frequently occurs in various applications: Is any diffusive coupling of stable linear systems, also stable? Although it has been known for a long time that this is not the case, we shall identify a reasonably diverse class of systems for which it is true.
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
TopicsMatrix Theory and Algorithms · Stability and Control of Uncertain Systems · Numerical methods for differential equations
Stability of diffusively coupled linear systems with an invariant cone
Patrick De Leenheer111Department of Mathematics and Department of Integrative Biology, Oregon State University, Supported in part by NSF-DMS-1411853, [email protected]
Abstract
This paper concerns a question that frequently occurs in various applications: Is any diffusive coupling of stable linear systems, also stable? Although it has been known for a long time that this is not the case, we shall identify a reasonably diverse class of systems for which it is true.
Keywords: linear systems, monotone systems, diffusive coupling, asymptotic stability.
MSC2010: 15B48, 93D05, 93D30.
1 Introduction
The main motivation for this paper comes from the following question. Consider a coupled linear system:
[TABLE]
where and are in , and are real matrices, while is an arbitrary diagonal matrix with non-negative diagonal entries. In mathematical biology, these systems frequently occur when linearizing diffusively coupled patched nonlinear systems at their steady states. The coupling terms and are referred to as diffusive coupling terms. This stems from their analogy to Fick’s law for diffusion which posits that the spatial flux of a species is proportional to the gradient of the density of the species, and oriented from regions of higher density to regions of lower density.
The aforementioned question is this: If the zero steady state of the uncoupled system (i.e. when ) is asymptotically stable, does the steady state remain asymptotically stable for all possible matrices ? It has long been known that the answer to this question is negative. For instance, assume that . If we define two new variables and in :
[TABLE]
then the dynamics in these new variables is given by:
[TABLE]
Suppose that
[TABLE]
with . Then the eigenvalues of have negative real part (because the trace of is negative, and its determinant is positive), but
[TABLE]
whose determinant is negative when . Thus, although the zero steady state of the uncoupled system is asymptotically stable, it is unstable for the coupled system when lies in this range.
Despite yielding a negative answer to the original question, this potential destabilization phenomenon has spurred a lot of interesting subsequent work. It features in synchronization theory [6], and also underlies mechanisms that induce pattern formation, as noted by Turing in 1952 in [8]. At the time this was seen as a revolutionary idea, especially in biology, because diffusion was believed to always have a stabilizing effect on biological systems. The example above shows that this is not always the case.
Instead of further exploring the consequences when destabilization occurs, one can try to restrict the classes of matrices to which and belong to guarantee that the question can be answered affirmatively. We shall identify particular classes of matrices for which this is indeed the case.
2 Preliminaries
Throughout this paper, will represent a proper cone, i.e. a non-empty, closed, convex, solid and pointed cone. More precisely, is a cone ( for all when ) which is solid (i.e. its interior, , is not empty) and pointed (i.e. if both and , then ), and it is a closed and convex subset of .
Let be a non-empty convex cone. We say that is finitely generated if there exists vectors in (called the generators of ) such that
[TABLE]
It is known, see e.g. [2], that a finitely generated cone in is a polyhedral set, i.e. the intersection of finitely many closed half-spaces in (A closed half-space in is a set of the form for some nonzero vector and real number , where denotes the standard inner product on ). Therefore, every finitely generated cone is necessarily closed, a statement which is not immediately clear from its definition.
Examples: The non-negative orthant cone is a proper, finitely generated cone in with the standard basis vectors of serving as its generators. An example of a proper cone in with that is not finitely generated is the Lorenz cone:
[TABLE]
also known as the ice cream cone. This terminology is obviously motivated by its appearance when . As a final example, first consider , the set of real, symmetric matrices, which can be identified with . Then the subset of consisting of all positive semi-definite matrices is a proper cone in see e.g. [3]. The interior of consists of the positive definite matrices, and is not finitely generated.
To every convex cone in -finitely generated or not- is associated the dual cone , defined as the set of linear functionals on which are non-negative on . Linear functionals on are elements of the dual space of , which is denoted as , and assuming that is equipped with the standard inner product , the Riesz Representation Theorem implies that every linear functional can be identified with a unique vector in in the sense that , for all . It follows that is a non-empty closed convex cone.
Examples: The three cones mentioned in the examples above, namely the orthant cone, the ice cream cone, and the cone of positive semi-definite matrices are self-dual, i.e. each coincides with its dual cone, see [3].
We collect further well-known facts concerning cones [1, 7, 3]:
Lemma 1**.**
Let be a closed convex cone. Then:
* is pointed if and only if is solid.* 2. 2.
. 3. 3.
.
We shall need a few more properties about cones. Let and be convex cones. The set is a convex cone, containing both and . For any , its reflection with respect to the origin is defined as , and will be denoted as .
Lemma 2**.**
Let and be convex cones in . Then
* is pointed if and only if and are pointed, and .* 2. 2.
.
Proof.
Assume that is pointed. Then so are and since they are subsets of . Let . Then and , and thus . But is pointed, and thus .
Assume that and are pointed, and . Let , such that as well. Then there exist in , and in such that:
[TABLE]
and thus that
[TABLE]
But , and thus . Then and belong to , and and belong to . As and are pointed, this implies that , and then also , establishing that is pointed. 2. 2.
If , then for all . Then for all in , and for all in , and therefore . Conversely, assume that , hence for all and for all . This implies that for all in , and thus .
∎
For vector spaces and we denote the set of linear maps from V to as ; but when we denote as . For any subset , and , we denote the image of under as .
The image of a nonempty closed convex cone under a linear map is easily seen to be a nonempty convex cone, but it need not be closed:
Example: Let be the ice cream cone in , , and be the finitely generated cone in with a single generator . Then is a closed convex cone in . Let be defined by for all . Note that for all :
[TABLE]
but
[TABLE]
and thus is not closed. This example therefore also shows that the sum of two closed convex cones in need not be closed. Notice that because it contains the vector .
Below is a sufficient condition guaranteeing that the image of a closed convex cone under a linear map is closed. This condition is clearly violated in the example above. Further results about this problem can be found in [2].
Lemma 3**.**
Let be a non-empty closed convex cone in , and . If
[TABLE]
then is a non-empty closed convex cone in .
Proof.
That is a non-empty convex cone is obvious. To see that it is closed, consider a sequence in such that for some . We need to show that . If the result is clear because then belongs to . So we assume that , and therefore, for all sufficiently large , holds that . Moreover, there exists a sequence in such that for all . Then for all sufficiently large holds:
[TABLE]
As belongs to for all large , where denotes the unit sphere in , and is compact, we can extract a converging subsequence also denoted by , with limit in . By follows that , and by passing through the limit in , that
[TABLE]
∎
The image of a finitely generated cone in under a continuous linear map is also finitely generated, hence a polyhedral set, and thus closed:
Lemma 4**.**
[2]** Let be a finitely generated nonempty convex cone in , and . Then is a non-empty closed convex cone in .
Proof.
is obviously a non-empty convex cone. If are the generators of , then every element in is a linear combination of the vectors with non-negative coefficients. Hence are generators for . Thus, is a finitely generated cone and therefore it is closed. ∎
3 Linear Lyapunov functions
Consider the linear system
[TABLE]
where and . Suppose that is a proper cone in . A natural question is under what conditions on , the cone is a forward invariant set for , i.e. when is for all , whenever . The answer to this question is known, see for instance [1, 7] and references therein. We say that is quasi-monotone for (QM for short) if
[TABLE]
Here, denotes the boundary of . There holds that
Theorem 1**.**
[1, 7]** Let be a proper cone in , and . Then is a forward invariant set for if and only if is QM for .
Examples: It is well-known, see [7], that when , an matrix is QM on if and only if for all .
It was shown in [9] that when is the ice cream cone in , then is QM on if and only if there exists such that:
[TABLE]
is a negative semi-definite matrix. Here, is the diagonal matrix with for all , and .
Suppose that , and let be the ice cream cone in . Suppose that and are parameters, and let:
[TABLE]
Then is QM on if and only if
[TABLE]
To see this, note that:
[TABLE]
which is negative semi-definite for some , provided that , for some . But this is equivalent to , as claimed.
Definition: Let be a proper cone in , and suppose that is QM for . Then is said to be a linear Lyapunov function for on if:
for all . 2. 2.
for all .
It follows readily from Lyapunov’s stability Theorem, that if is a linear Lyapunov function on , then the zero steady state of is asymptotically stable with respect to initial conditions in . In fact, below we will show that a stronger conclusion holds. We say that is Hurwitz if all the eigenvalues of have negative real part. It is well-known that is Hurwitz if and only if the zero steady state of system is asymptotically stable with respect to initial conditions in .
Theorem 2**.**
Let be a proper cone in , and suppose that is QM for . There exists a linear Lyapunov function for on if and only if the zero steady state of is asymptotically stable with respect to all initial conditions in .
Proof.
Necessity: Suppose that there exists a linear Lyapunov function for on . We need to prove that every solution of in converges to [math] as .
Since is solid, we can pick . Set . Pick a basis for , say , and note that is a basis for because . Since , we can pick sufficiently small, such that for all . We claim that is a basis of which is clearly contained in . To prove the claim, let be real scalars such that:
[TABLE]
or equivalently:
[TABLE]
Then as , because is a basis for . This proves the claim. We can now define a fundamental matrix solution for (i.e. an matrix whose columns are solutions of that are linearly independent for all ), namely:
[TABLE]
Here, the columns are the unique solutions of with respective initial conditions , . By Theorem 1, every solution belongs to for all . And since there is a linear Lyapunov function for on , it follows that for all . But every solution of on is a linear combination of the columns of , and therefore every solution of converges to [math] as well. This concludes the proof of this part of the Theorem.
Sufficiency: If is Hurwitz, it follows upon integration from to of the identity: for all , that
[TABLE]
and thus that
[TABLE]
Since is QM on , Theorem 1 implies that satisfies:
[TABLE]
Then the dual of , denoted by , and equal to , satisfies:
[TABLE]
We claim that:
[TABLE]
From follows that there exist and such that . Therefore, using Theorem 1, there holds that:
for all . 2. 2.
for all .
Thus, is a linear Lyapunov function for on .
To prove , first note that is solid by Lemma 1 (because is a proper cone, hence pointed). Pick , and let be an open set such that . By the Open Mapping Theorem, is open in , and it is contained in because . If , then is immediate because belongs to the intersection. If , then , and follows as well. This establishes , and concludes the proof. ∎
Example: Suppose that , and let be the ice cream cone in . We have seen in an example above that if
[TABLE]
where and are real parameters, then is QM on if and only if
[TABLE]
Note that is QM on and Hurwitz if and only if :
[TABLE]
and that in this case, choosing
[TABLE]
yields that . Thus, is a linear Lyapunov function for on .
4 Common linear Lyapunov functions
Consider a linear time-varying system
[TABLE]
where and is a piecewise continuous map. We shall denote the unique solution at any time , starting in at time by .
Suppose that is a proper cone in . We say that is quasi-monotone for (QM for short) if:
[TABLE]
There holds that:
Theorem 3**.**
[7]** Let be a proper cone in , and a piecewise continuous map. Then for all , the solution of belongs to for all , and for all , if and only if is QM for .
We shall be mainly interested in the behavior of solutions of the system in the case where is an arbitrary piecewise constant map, and is a fixed, finite collection of linear operators on . In the engineering literature, a system of this form is referred to as a switched system [5, 4], although strictly speaking we are dealing with a collection of systems, one for each choice of .
Theorem 3 then implies:
Corollary 1**.**
Let be a proper cone in , and let be a finite collection of linear operators on . Then every solution of every system , where is an arbitrary piecewise constant map, remains in for all , for all , and for all , if and only if is QM for for all .
Definition: Let . Let be a proper cone in , and suppose that is QM for for all . Then is said to be a common linear Lyapunov function for on , if:
for all . 2. 2.
for all , and all .
It follows from Lyapunov’s stability Theorem that if have a common linear Lyapunov function on , then the zero steady state of system where is an arbitrary piecewise constant map, is uniformly asymptotically stable with respect to initial conditions in . A stronger conclusion is as follows:
Theorem 4**.**
Let , let be a proper cone in , and suppose that is QM for for all . If there exists a common linear Lyapunov function for on , then the zero steady state of system where is an arbitrary piecewise constant map, is uniformly asymptotically stable with respect to all initial conditions in .
Proof.
The proof is similar to the Necessity part of the proof of Theorem 2. ∎
The converse statement in Theorem 4 does not hold, as the following example shows:
Example: Let , and
[TABLE]
Note that and are QM on , and both are Hurwitz. Therefore, Theorem 3.2 in [5] establishes that the zero steady state of system where is an arbitrary piecewise constant map, is uniformly asymptotically stable with respect to all initial conditions in if and only if has no negative eigenvalues. Here,
[TABLE]
and this matrix has no negative eigenvalues (in fact, it has no real eigenvalues). But there is no common linear Lyapunov function for on . Indeed, suppose that (recall that is self-dual), is such that
[TABLE]
In particular, and must hold simultaneously, which is impossible.
5 When does a common Lyapunov function exist?
Theorems 2 and 4 motivate the search for conditions that characterize when a finite collection of linear operators that are QM on a cone, share a common Lyapunov function.
We shall consider the -fold Cartesian product of with itself, , and denote it as . For any subset of , the notation is defined similarly. For a given collection of linear operators in , we consider the map defined by
[TABLE]
for each . Then we have that:
Theorem 5**.**
Let be a proper cone in , and be QM on . If
[TABLE]
then have a common linear Lyapunov function on .
Proof.
If holds then we claim that:
is a closed convex cone. 2. 2.
. 3. 3.
is pointed.
- follows from Lemma 3 because is a nonempty closed convex cone in . To prove 2., pick . Then for all , there exist such that , and thus , which implies that . To prove 3., it suffices to prove that is pointed. Suppose that , such that . Then for all there exist and such that:
[TABLE]
and therefore
[TABLE]
Since is a convex cone, this implies that , and thus both and for all . Since is pointed, it follows that for all , and therefore that .
From 1.,2, and 3. and Lemma 2 follows that
[TABLE]
is a closed, pointed convex cone, hence its dual cone, which by Lemma 2 equals
[TABLE]
is solid, or equivalently that
[TABLE]
Notice that implies that
[TABLE]
and thus is a closed convex cone for all by Lemma 3. Then from Lemma 1 follows that for all :
[TABLE]
which together with implies that have a common Lyapunov function on . ∎
When is a finitely generated proper cone in , we have a necessary and sufficient condition for the existence of a linear common Lyapunov function on :
Theorem 6**.**
Let be a finitely generated proper cone in , and be QM on .
Then have a common linear Lyapunov function on if and only if the following conditions hold:
* for all .* 2. 2.
* is pointed.* 3. 3.
.
Proof.
Sufficiency: We will verify that holds. Let . Then
[TABLE]
Then by 3., and thus:
[TABLE]
If for some , then by 1. Moreover, by :
[TABLE]
Thus, and are non-zero and belong to , contradicting 2. Thus for all , and then this part of the proof is concluded by applying Theorem 5.
Necessity: Suppose that is a common linear Lyapunov function for on . Then
[TABLE]
Then 1. must hold, for if it did not, there would exist some and some such that , whence , a contradiction. Note that since holds, is equivalent to the statement that:
[TABLE]
Since is a non-empty closed (by Lemma 4) convex cone for all , Lemma 1 implies that the latter is equivalent to:
[TABLE]
and thus (by Lemma 2) is a closed solid cone. Note that it is the dual of the closed cone (closedness follows from Lemma 4), which in turn must be pointed (by Lemma 1). Lemma 2 then implies that 2. and 3. hold, concluding this part of the proof. ∎
In the special case where , and are QM on , different characterizations for the existence of a common linear Lyapunov function for on can be found in [4].
Examples: We shall first provide some examples that show that no pair of the three conditions in Theorem 6 implies the third, indicating that these conditions are sharp for the existence of a common linear Lyapunov function when the cone is finitely generated.
When , the matrices
[TABLE]
are QM for and invertible. Thus, 1. holds. Since
[TABLE]
it is a pointed cone, so 2. holds as well. However, 3. fails because is contained in the intersection of and . Thus and do not share a common linear Lyapunov function on .
The matrices
[TABLE]
are QM for . Here 1., fails because is contained in and in , although
[TABLE]
is a pointed cone which intersects only in [math], hence 2. and 3. hold. and do not share a common linear Lyapunov function on .
When , the matrices
[TABLE]
are QM for , and they are invertible. Thus 1. holds. Note that
[TABLE]
Although only intersects in [math] (so that 3. holds), this cone is not pointed, so 2. fails.
To end on a positive note, we give an example where a common linear Lyapunov function does exist on . Let
[TABLE]
which are QM for , and invertible. Thus 1. holds. Moreover,
[TABLE]
and it is a pointed cone, which only intersects in 0. Thus, 2. and 3. hold as well, and therefore and share a common linear Lyapunov function. For instance, is easily seen to be a common linear Lyapunov function on .
6 Diffusively coupled systems
Here we return to the motivating question raised in the Introduction.
Let be a proper cone in , and be QM for . For all in with , assume that and .
We now define the coupled system on :
[TABLE]
Note that is a proper cone in , and that its dual can be identified with thanks to the Riesz Representation Theorem. It is natural to ask when the proper cone in is a forward invariant set for . To answer this question, we introduce the following concept:
Definition Let be a proper cone in , and suppose that for all in with , and . We say that the collection acts diffusively on , provided that for all :
. 2. 2.
Whenever is such that , then .
Note that for a given cone , and fixed , there always exist nontrivial families that act diffusively on . Indeed, if for some arbitrary , then the family acts diffusively on . When , any family consisting of diagonal matrices with non-negative entries, also acts diffusively on . In fact, it is not difficult to see that in this case, diagonal matrices with only non-negative entries are the only matrices that can belong to any family that acts diffusively on .
Notation: For future reference, we let be the (nonempty) set whose elements are all possible families of linear operators on with in and such that , that act diffusively on a given proper cone in .
For example, when , the set is the set of diagonal matrices having only non-negative entries.
The following result remains valid even when the symmetry assumption is dropped, as it is never used in the proof.
Theorem 7**.**
Let be a proper cone in , be QM for , and . Then is a forward invariant set for .
Proof.
We need to verify that the following linear operator on :
[TABLE]
is QM for . Let and be such that . We are left with showing that .
Since , it follows that for all . Thus, for all , but since , there follows that:
[TABLE]
and then Lemma 1 implies that:
[TABLE]
But is QM for for all , hence:
[TABLE]
Then, as acts diffusively on , and using , and :
[TABLE]
which concludes the proof. ∎
Theorem 8**.**
Let be a proper cone in , be QM for . If have a common linear Lyapunov function on , then for all the zero steady state of is asymptotically stable with respect to all initial conditions in .
Proof.
Fix . Let be a common linear Lyapunov function for on , and define as follows:
[TABLE]
We claim that is a linear Lyapunov function for system on . Indeed,
[TABLE]
because when , there exists at least one and for which . Moreover, using the notation in , we have that:
[TABLE]
where we used the symmetry , and the fact that is a common linear Lyapunov function on for . This establishes the claim, and the conclusion now follows from Theorem 2. ∎
Example: Let be the ice cream cone in . Pick two distinct matrices and from the following family:
[TABLE]
We have seen that and are QM on , and that they share a common Lyapunov function on . Let , where is arbitrary. We have seen that the family acts diffusively on . Thus, by Theorem 8, every solution of the system:
[TABLE]
in converges to the zero steady state.
Physically, we can think of two ice cream cones filled with water which are being emptied by gravity via their vertex in the origin. When there is no water exchange between the cones (), the exponential rates at which the height of the water columns decrease is given by the two respective parameters of the matrices and . The two parameters control the rate at which water particles spiral towards the symmetry axes of the cones. This happens with the same frequency in both cones. When a coupling term is present, () water is exchanged between the two cones at rate , making them communicating vessels. The stability result above confirms among other things the intuition that the two cones will still be emptied eventually, independently of the rate of exchange of water between the cones. In fact, the total height of the two water columns is decreasing, and serves as a Lyapunov function for the coupled system.
Example: We show that the converse of Theorem 8 is not true.
Let , and
[TABLE]
We have seen that and are QM on , but that they don’t share a common linear Lyapunov function on . We will show that the zero solution of
[TABLE]
is asymptotically stable in for all matrices .
Note first that for every , the matrix:
[TABLE]
is QM on by Theorem 7. By the Perron-Frobenius Theorem [1] follows that has a real, principal eigenvalue (i.e. for every eigenvalue of ). Since and are Hurwitz it is clear that . Moreover, is continuous in . We claim that for all . To see this, it suffices to show that the determinant of is positive for all , and by using the fact that is invertible, we observe that:
[TABLE]
Here we used the well-known identity that
[TABLE]
for all matrices and with invertible , which is easily proved by observing that the following factorization always holds:
[TABLE]
Therefore,
[TABLE]
Now if the zero solution of would not be asymptotically stable on for all , then would not be Hurwitz for some matrix . Then there would exist some matrix such that . But then , contradicting .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Berman, M. Neumann, and R.J. Stern, Nonnegative matrices in dynamics systems, John Wiley & Sons, New York, 1989.
- 2[2] J.M. Borwein, and W.B. Moors, Stability of closedness of convex cones under linear mappings, Journal of Convex Analysis 16(3), p.699-705, 2009.
- 3[3] S. Boyd, and L. Vandenberghe, Convex optimization, Cambridge University Press, 2004.
- 4[4] E. Fornasini, and M.E. Valcher, Linear copositive Lyapunov functions for continuous-time positive switched systems, IEEE Transactions on Automatic Control 55 (8), p. 1933-1937, vol. 55, 2010.
- 5[5] L. Gurvits, R. Shorten, and O. Mason, On the Stability of Switched Positive Linear Systems, IEEE Transactions on Automatic Control 52 (6), p.1099-1103, 2007.
- 6[6] J.K. Hale, Diffusive Coupling, Dissipation, and Synchronization, Journal of Dynamics and Differential Equations 9 (1), p. 1-52, 1999.
- 7[7] M.W. Hirsch, and H.L. Smith, Competitive and Cooperative Systems: a mini-review, Proceedings of the First Multidisciplinary Symposium on Positive Systems (POSTA 2003). Luca Benvenuti, Alberto De Santis and Lorenzo Farina (Eds.) Lecture Notes on Control and Information Sciences vol. 294, Springer Verlag, Heidelberg, 2003.
- 8[8] A.M. Turing, The Chemical Basis of Morphogenesis, Philosophical Transactions of the Royal Society of London B. 237 (641), p. 37-72, 1952.
