
obtained by means of the procedures of elimination
of fast variables in the higher approximations,
together with the corresponding transformations of
variables.
Justification of the Averaging Method
To justify the averaging method, one should estab-
lish conditions under which the deviation of the
slow variables along the solutions of the exact
system from the solutions of the averaged system
with appropriate initial data on time intervals of
order 1=" or longer tends to 0 as " ! 0. It is
desirable to have estimates from the above for these
deviations. The estimates of deviations of the
solutions of the exact syst em from the solutions of
the truncated systems obtained by means of the
procedure of elimination of fast phases are impor-
tant as well. It can happen that there are ‘‘bad’’
initial data for which the slow component of the
solution of the exact system deviates from the
solution of the averaged system by a value of order
1 over time of order 1=". In this case, one should
have estimates from above for the measure of the set
of such ‘‘bad’’ initial data; on the complementary set
of initial data, one should have estimates from
above for the deviation of slow variables along the
solutions of the exact system from the solution of
the averaged system. These problems are currently
far from being completely solved. Some general
results are described in the follow ing.
Let functions !, f , g on the right-hand side of
system [1] be defined and bounded together with a
sufficient number of derivatives in the domain D{I}
T
m
{’} [0, "
0
]. Let J(t) be the solution of the
averaged system [2] with initial condition I
0
2 D.
Let (I(t), ’(t)) be the solution of the exact system [1]
with initial conditions (I
0
, ’
0
). So, I(0) = J(0). It is
assumed that the solution J(t) is defined and stays at
a positive distance from the boundary of D on the
time interval 0 t K=" , K = const > 0.
If system [1] is a one-frequency system (m = 1),
and the frequency ! does not vanish in D, then for
0 t K=" the solution (I(t ), ’(t)) is well defined,
and jI(t) J(t)j < C ", C = const. > 0. For ! = 1, this
assertion was proved by P Fatou (1928) and, by a
different method, by L I Mandel’shtam and L D
Papaleksi (1934). This was historically the
first result on the justification of the averaging
method (Mintropol’skii 1971). There is a proof
based on the elimination of fast variables (see , e.g.,
Arnol’d (1983)). For a one-frequency system, higher
approximations of the procedure of elimination of
fast variables allow the description of the dynamics
with an accuracy of the order of any power in " on
time intervals of order 1=" (Bogolyubov and
Mitropol’skii 1961).
If system [1] is a multifrequency system (m 2), but
the vector of frequencies is constant and nonresonant,
then for any >
0 and small enough "<"
0
()itholds
that jI(t) J(t)j < for 0 t K=" (Bogolyubov
1945, Bogolyubov and Mitropol’skii 1961). If, in
addition, the frequencies satisfy the Diophantine
condition j(k, !)j > const jkj
for all k 2 Z
m
n{0}
and some >0, then one can choose = O("). In
this case, higher approximations of the procedure of
elimination of fast variables allow one to describe
the dynamics with an accuracy of the order of any
power in " on time intervals of order 1=" (see, e.g.,
Arnol’d et al. (1988)).
If the system is a multifrequency system, and
frequencies are not constant (but depend on the slow
variables I), then due to the evolution of slow
variables the frequencies themselves are evolving
slowly. At certain time moments, they can satisfy
certain resonant relations. One of the phenomena
that can take place here is a capture into a
resonance; this capture leads to a large deviation of
the solutions of the exact and averaged systems.
However, the general Anosov averag ing theorem
(Anosov 1960) implies that if the frequencies ! are
nonresonant for almost all I, then for any >0, the
inequality jI(t) J( t)j <is satisfied for 0 t K="
for all initial data outside a set E(, ") whose
measure tends to 0 as " ! 0. In many cases, it
turns out that mes E(, ") = O(
ffiffiffi
"
p
=) (in particular,
the sufficient condition for the last estimate is that
rank(@!=@I) = m)(Arnol ’d et al. (1988)).
The knowledge about averaging in two-
frequency systems (m = 2) on time intervals, of order
of 1="
, is relatively more complete (see Arnol’d
(1983), Arnol’d et al. (1988),andLochak and
Meunier (1988)). For Hamiltonian and reversible
systems, the justification of the averaging method is
a by-product of Kolmogorov–Arnold–Moser (KAM)
theory. The KAM theory provides estimates of the
difference between the solutions of the exact and
averaged systems for majority of initial data on
infinite time interval 1 < t < þ1. For remaining
data this difference can grow because of Arnol’d
diffusion, but, in general, very slowly. According to
the Nekhoroshev theorem, this difference is small on
time intervals whose length grows exponentially when
the perturbation decays linearly (for an analytic
Hamiltonian if the unperturbed Hamiltonian is a
generic function, the so-called steep function).
Another aspect of justification of the averaging
method is establishing relations between invariant
manifolds of the exact and averaged systems.
Consider, in particular, the case of a one-frequency
Averaging Methods 229