Chaplygin's theorem explained

In mathematical theory of differential equations the Chaplygin's theorem (Chaplygin's method) states about existence and uniqueness of the solution to an initial value problem for the first order explicit ordinary differential equation. This theorem was stated by Sergey Chaplygin.^[1] It is one of many comparison theorems.

Important definitions

Consider an initial value problem: differential equation

y'\left ( t \right ) = f\left ( t, y\left ( t \right ) \right ) in t \in \left [ t _{0;} \alpha \right ] , \alpha > t _{0}

with an initial condition

y\left ( t _{0} \right ) = y _{0} .

For the initial value problem described above the upper boundary solution and the lower boundary solution are the functions

\overline{z}\left ( t \right ) and \underline{z}\left ( t \right ) respectively, both of which are smooth in t \in \left ( t _{0;} \alpha \right ] and continuous in t \in \left [ t _{0;} \alpha \right ] , such as the following inequalities are true:\underline{z}\left ( t _{0} \right ) < y\left ( t _{0} \right ) < \overline{z}\left ( t _{0} \right ) ;\underline{z}'\left ( t \right ) < f(t, \underline{z}\left ( t \right )) and \overline{z} '\left ( t \right ) > f(t, \overline{z}\left ( t \right )) for t \in \left ( t _{0;} \alpha \right ] .

Statement

Source:^{[2] [3]}

Given the aforementioned initial value problem and respective upper boundary solution

\overline{z}\left ( t \right ) and lower boundary solution \underline{z}\left ( t \right ) for t \in \left [ t _{0;} \alpha \right ] . If the right part f\left ( t, y\left ( t \right ) \right )

1. is continuous in

t \in \left [ t _{0} ; \alpha \right ] , y\left ( t \right ) \in \left [ \underline{z} \left ( t \right ); \overline{z}\left ( t \right ) \right ] ;

1. satisfies the Lipschitz condition over variable

y between functions \overline{z}\left ( t \right ) and \underline{z}\left ( t \right ) : there exists constant K > 0 such as for every t \in \left [ t _{0} ; \alpha \right ] , y _{1} \left ( t \right ) \in \left [ \underline{z} \left ( t \right ); \overline{z}\left ( t \right ) \right ] , y _{2} \left ( t \right ) \in \left [ \underline{z} \left ( t \right ); \overline{z}\left ( t \right ) \right ] the inequality\left \vert f\left ( t, y _{1} \left ( t \right ) \right ) - f\left ( t, y _{2} \left ( t \right ) \right ) \right \vert \le K \left \vert y _{1} \left ( t \right ) - y _{2} \left ( t \right ) \right \vert holds,

then in

t \in \left [ t _{0;} \alpha \right ] there exists one and only one solution y\left ( t \right ) for the given initial value problem and moreover for all t \in \left [ t _{0;} \alpha \right ] \underline{z}\left ( t \right ) < y\left ( t \right ) < \overline{z}\left ( t \right ) .

Remarks

Source:

Weakning inequalities

Inside inequalities within both of definitions of the upper boundary solution and the lower boundary solution signs of inequalities (all at once) can be altered to unstrict. As a result, inequalities sings at Chaplygin's theorem concusion would change to unstrict by

\overline{z}\left ( t \right ) and \underline{z}\left ( t \right ) respectively. In particular, any of \overline{z}\left ( t \right ) = y\left( t \right) , \underline{z}\left ( t \right ) = y\left( t \right) could be chosen.

Proving inequality only

If

y\left ( t \right ) is already known to be an existent solution for the initial value problem in t \in \left [ t _{0;} \alpha \right ] , the Lipschitz condition requirement can be omitted entirely for proving the resulting inequality. There exists applications for this method while researching whether the solution is stable or not (pp. 7–9). This is often called "Differential inequality method" in literature^{[4] [5]} and, for example, Grönwall's inequality can be proven using this technique.

Continuation of the solution towards positive infinity

Chaplygin's theorem answers the question about existence and uniqueness of the solution in

t \in \left [ t _{0;} \alpha \right ] and the constant K from the Lipschitz condition is, generally speaking, dependent on \alpha : K = K\left ( \alpha \right ) . If for t \in \left [ t _{0;} +inf ty \right ) both functions \overline{z}\left ( t \right ) and \underline{z}\left ( t \right ) retain their smoothness and for \alpha \in \left ( t _{0;} +inf ty \right ) a set \left\{ K\left ( \alpha \right ) \right\} is bounded, the theorem holds for all t \in \left [ t _{0;} +inf ty \right ) .

Further reading

• Komlenko . Yuriy . 1967-09-01 . Chaplygin's theorem for a second-order linear differential equation with lagging argument . Mathematical Notes of the Academy of Sciences of the USSR . en . 2 . 3 . 666–669 . 10.1007/BF01094057 . 1573-8876.

Notes and References

1. Book: Bogolubov, Alexey . Математики. Механики. Биографический справочник. . Киев: Наукова думка . 1983 . 978-5-906923-56-1 . 1st . Kiev, Ukraine . 515–516 . ru . Mathematicians. Mechanics. Biographical handbook..
2. Web site: Vasilyeva . Adelaida . 2007 . Теоремы сравнения. Метод дифференциальных неравенств Чаплыгина. . Comparison theorems. Chaplygin's differential inequalities method. . 2024-08-28 . Кафедра математики физического факультета МГУ . 4–5 . ru.
3. Web site: Nefedov . Nikolay . 2019-06-09 . Дифференциальные уравнения -- Лекции . Differential equations -- Lections . 2024-08-28 . Teach-In . ru.
4. Web site: Nefedov . Nikolay . 2016 . Обыкновенные дифференциальные уравнения. Курс лекций. . Ordinary differential equations. Lection series. . 2024-08-30 . Кафедра математики физического факультета МГУ . 60 . ru.
5. Book: Hale, Jack . Ordinary differential equations . 1980 . Krieger . 978-0-89874-011-0 . 2nd . Pure and applied Mathematics . Malabar, Fla . 30–37 . en.