An Estimate of the Largest Characteristic Exponent under Small Perturbations
R. E. Vinograd
Submitted 1957-01-01 | SovietRxiv: ru-195701.17291 | Translated from Russian

Abstract Generated abstract

The paper studies how the largest characteristic exponent of a linear nonautonomous differential system can change under small nonlinear perturbations satisfying a Lipschitz bound. It defines a quantity Omega from bounds on the fundamental matrix of the unperturbed system and proves that, for sufficiently small perturbations, every solution grows no faster than an exponential with exponent arbitrarily close to Omega. This gives an upper estimate for the limiting possible jump of the largest characteristic exponent, and the estimate is shown to be exact for broad classes of triangular systems, including those with nonnegative off-diagonal entries. The result is also applied to extend Lyapunov’s first approximation stability criterion: if the perturbation is of higher than first order and Omega is negative, the trivial solution is asymptotically stable.

Full Text

Mathematics

R. E. Vinograd

ESTIMATE OF THE JUMP OF THE LARGEST CHARACTERISTIC EXPONENT UNDER SMALL PERTURBATIONS

(Presented by Academician I. G. Petrovskii, December 6, 1956)

Let two systems of differential equations of order \(n\) be given in matrix-vector form: the unperturbed one
\[ \frac{dx}{dt}=A(t)x \tag{1} \]
and the perturbed one
\[ \frac{dx}{dt}=A(t)x+f(t,x). \tag{2} \]

Here \(A(t)\) is a continuous or piecewise-continuous bounded matrix for \(0\leq t<\infty\); \(|A(t)|\leq M\); \(x\) and \(f\) are vectors, with \(f(t,0)\equiv 0\); \(f\) is continuous in \(t,x\) and satisfies, with respect to \(x\), a Lipschitz condition with small constant \(\delta\), independent of \(t\), or the condition
\[ |f(t,x)|\leq \delta |x|. \tag{3} \]

The class of vector-additions \(f(t,x)\) possessing Lipschitz constant \(\leq \delta\) will be denoted by \(L_\delta\).

Let \(\lambda_0\) and \(\lambda_f\) be the largest characteristic exponents of the solutions of systems (1) and (2), respectively* . It is known \((^{1,2})\) that \(\lambda_f\), while being \(\geq \lambda_0\), does not always tend to \(\lambda_0\) as the additions \(f\) decrease, i.e., if one sets
\[ \Lambda=\lim_{\delta\to 0}\sup_{f\in L_\delta}\lambda_f, \tag{4} \]
then the case \(\Lambda>\lambda_0\) is possible (for exceptions see \((^{3-5})\)).

Thus, in passing from (1) to (2), the largest exponent may undergo a finite jump \(\Lambda-\lambda_0>0\) (up to a quantity tending to zero together with \(\delta\)). In this paper an upper estimate for this jump—or, equivalently, for \(\Lambda\)—is constructed from system (1), and in a certain sense cannot be improved.

  1. Let \(X(t)\) be the matrix of a fundamental system of solutions of (1). Consider a bounded function \(F(t)\) such that, for all \(t\) and \(\tau<t\), the estimate
    \[ |X(t)X^{-1}(\tau)|\leq C\exp\left[\int_{\tau}^{t}F(\xi)\,d\xi\right] \tag{5} \]
    holds, where \(C\) depends on the choice of \(F(t)\), but not on \(t\) and \(\tau\). The class of functions \(F(t)\) is nonempty; it includes all sufficiently large constants \((\geq M\geq |A(t)|)\).

* The characteristic exponent of a vector \(x(t)\) is defined as
\[ \lambda=\overline{\lim}_{t\to\infty}t^{-1}\ln|x(t)|; \]
\(\lambda_f\) is understood as the supremum of \(\lambda\) over all solutions \(x(t)\) of system (2).

Set

\[ \omega_F=\overline{\lim_{t\to\infty}}\, t^{-1}\int_0^t F(\xi)\,d\xi,\qquad \Omega=\inf \omega_F, \tag{6} \]

where the infimum is taken over all functions of the indicated class. The number \(\Omega\) so defined does not depend on the choice of the fundamental matrix \(X(t)\) and is not changed under Lyapunov transformations \((x=S(t)y\) with bounded matrices \(S\) and \(S^{-1})\) of system (1). Therefore one may transform systems (1) and (2) by Perron’s method \((^6,^7)\), i.e., regard the matrix \(A(t)\) as triangular.

Lemma. The number \(\Omega\) is determined only by the elements of the main diagonal of the matrix \(A(t)\), if the latter is triangular.

Without dwelling on the proof, we note the following construction. Let \(a_{11}(t), a_{22}(t),\ldots,a_{nn}(t)\) be the elements of the main diagonal of \(A(t)\). Divide the semiaxis \(0\le t<\infty\) into equal intervals \(\Delta_i\) of length \(T\), and consider the function \(\alpha_T(t)\) which on each \(\Delta_i\) coincides with that one of the functions \(a_{kk}(t)\) which has the largest integral over \(\Delta_i\). Put

\[ \omega_T^*=\overline{\lim_{t\to\infty}}\, t^{-1}\int_0^t \alpha_T(\xi)\,d\xi,\qquad \Omega^*=\inf_{0<T<\infty}\omega_T^* . \]

Then one can prove that \(\Omega^*\) coincides with \(\Omega\).

Theorem 1. For any \(\varepsilon>0\) there exists a sufficiently small \(\delta>0\) such that every solution \(x(t)\) of system (2) with \(f\in L_\delta\) admits the estimate

\[ |x(t)|\le |x(0)|\,B_\varepsilon e^{(\Omega+\varepsilon)t}, \tag{7} \]

where \(B_\varepsilon\) depends only on \(\varepsilon\).

Proof. Take the matrix \(X(t)\) of solutions of (1) with the initial condition \(X(0)=E\), and choose the function \(F(t)=F_\varepsilon(t)\) from (5) so that \(\omega_F<\Omega+\sigma\), where \(\sigma=\varepsilon/3\); denote the corresponding constant by \(C=C_\varepsilon\). Replacing (2) by the integral equation

\[ x(t)=X(t)x_0+\int_0^t X(t)X^{-1}(\tau)f(\tau,x(\tau))\,d\tau,\qquad x_0=x(0), \]

we shall solve it by Picard’s method (whose convergence is known).

Let the first approximation be \(x_1(t)=X(t)x_0\). Then from (5) we obtain

\[ |x_1(t)|\le |x_0|\,C\exp\left[\int_0^t F\,d\xi\right]. \tag{8} \]

Suppose that, for \(r=1,2,\ldots,k\), the estimate

\[ |x_r(t)|\le |x_0|\,C\exp\left[\int_0^t (F+\sigma)\,d\xi\right] \tag{9} \]

has been established.

Then for the \((k+1)\)-st approximation, using (8), (5), (9), and the Lipschitz condition for \(f\), we find

\[ |x_{k+1}(t)|\le |X(t)x_0|+\int_0^t |X(t)X^{-1}(\tau)|\,\delta\,|x_k(\tau)|\,d\tau \le \]

\[ \le |x_0|\,C\exp\left[\int_0^t F\,d\xi\right] +\int_0^t C\exp\left[\int_\tau^t F\,d\xi\right]\delta\,|x_0|\,C\exp\left[\int_0^\tau (F+\sigma)\,d\xi\right]d\tau = \]

\[ =|x_0|\,C\exp\left[\int_0^t F\,d\xi\right]\left[1+C\delta\int_0^t e^{\sigma\tau}\,d\tau\right] =|x_0|\,C\exp\left[\int_0^t F\,d\xi\right]\left[1+\frac{C\delta}{\sigma}\left(e^{\sigma t}-1\right)\right]. \]

We see that if \(\delta\) is so small that \(C\delta/\sigma<1\), then \(x_{k+1}(t)\) also satisfies inequality (9). Therefore it is also valid for the desired solution \(x(t)=\lim\limits_{k\to\infty}x_k(t)\):

\[ |x(t)|\leq |x_0|C\exp\left[\int_0^t(F+\sigma)\,d\xi\right]. \tag{10} \]

Taking into account that \(\omega_F<\Omega+\sigma\), we have

\[ \int_0^t F\,d\xi<D_\sigma+(\Omega+2\sigma)t, \]

where \(D_\sigma\) depends only on \(\sigma=\varepsilon/3\), and then (10) turns into (7), where \(B=Ce^D\), and the theorem is proved.

From this theorem and definitions (4) and (6) it follows:

Corollary. \(\Omega\) serves as an upper estimate for \(\Lambda\), i.e. always

\[ \Lambda\leq\Omega. \tag{11} \]

  1. Let us pass to questions of the unimprovability of this estimate. Considering the matrix \(A(t)\) in (1), (2) triangular, we divide the set of such matrices, and thereby also the set of systems (1), into classes, assigning to one class matrices with the same main diagonal. (Such a division is ambiguous because of the nonuniqueness of the Perron transformation, which in the present case is immaterial.) According to the lemma, the number \(\Omega\) will be constant in each class.

Theorem 2. In each class there is an infinite set of systems (1) for which estimate (11) becomes an exact equality.

Omitting the proof, we point out that the desired set of matrices \(A(t)\) (systems (11)) contains, in particular, all those matrices for which the off-diagonal elements are \(\geq 0\). Thus, in each class this set contains domains, if one introduces the topology as uniform closeness of the off-diagonal elements on the half-axis \(0\leq t<\infty\).

The shortcomings of such a topologization are obvious; moreover, the possibility remains unclear of improving estimate (11) if system (1) does not belong to the mentioned set. However, in these cases there exists another point of view, clarifying the impossibility of improving estimate (11) in a different sense. As shown in \((^8)\), in the nonlinear case \(f(t,x)\) knowledge of the number \(\Lambda\) does not yet make it possible to write, for all solutions of system (2), an estimate of the form

\[ |x(t)|\leq |x(0)|B_\varepsilon e^{(\Lambda+\varepsilon)t}, \]

since the constant \(B_\varepsilon\) may here turn out to depend not only on \(\varepsilon\), but also on the solution \(x(t)\). In turn, this means \((^8)\) that by means of the number \(\Lambda\) one cannot investigate stability in the way this is done by Lyapunov’s first method. As for estimate (7), according to Theorem 1 it does not possess such a shortcoming.

Therefore, regardless of whether (11) is an exact equality, one has to use the number \(\Omega\), and not \(\Lambda\), and thereby the need to refine (11) disappears.

In conclusion, we indicate a generalization of Lyapunov’s theorem on stability by the first approximation.

Theorem 3. If the added terms \(f(t,x)\) have order higher than one in \(x\) and if \(\Omega<0\), then the trivial solution of system (2) is asymptotically stable.

Moscow Aviation Technological
Institute

Received
26 III 1956

CITED LITERATURE

  1. O. Perron, Math. Zs., No. 31 (1930).
  2. R. E. Vinograd, Prikl. matem. i mekh., 17, issue 6 (1953).
  3. K. P. Persidskii, Izv. AN Kaz.SSR, issue 1 (1947).
  4. L. M. Grobman, Matem. sborn., 30 (72), No. 1 (1952).
  5. B. F. Bylov, Dissertation, MSU, 1954.
  6. O. Perron, Math. Zs., No. 32 (1930).
  7. R. E. Vinograd, Usp. matem. nauk, 9, issue 2 (60) (1954).
  8. R. E. Vinograd, DAN, 114, No. 2 (1957).

Submission history

An Estimate of the Largest Characteristic Exponent under Small Perturbations