On Chaplygin’s theorem for an implicit differential equation of order n

We consider the Cauchy problem for the implicit differential equation of order n g t, x, x, …, x (n) =0, t ∈ 0; T , x 0 = A. It is assumed that A = A 0 ,…, A n -1 ∈ Rn , the function g :[0, T ] × Rn +1 → R is measurable with respect to the first argument t ∈[0, T ] , and for a fixed t , the function g t , ∙× Rn +1 → R is right continuous and monotone in each of the first n arguments, and is continuous in the last n +1 -th argument. It is also assumed that for some sufficiently smooth functions η , ν there hold the inequalities ν i 0 ≥ A i ≥ η i 0 , i= 0, n-1, ν n t ≥ η n t , t∈[0; T]; g t; νt , ν t , ..., ν n t ≥ 0, g t, ηt , η t ,…, η (n) (t) ≤ 0, t∈0; T . Sufficient conditions for the solvability of the Cauchy problem are derived as well as estimates of its solutions. Moreover, it is shown that under the listed conditions, the set of solutions satisfying the inequalities η n t ≤ x n t ≤ ν n t , is not empty and contains solutions with the largest and the smallest n -th derivative. This statement is similar to the classical Chaplygin theorem on differential inequality. The proof method uses results on the solvability of equations in partially ordered spaces. Examples of applying the results obtained to the study of second-order implicit differential equations are given.

implicit differential equation of order n, largest and smallest solutions, estimates of solutions, Chaplygin’s theorem on differential inequality