V.I. Arnold's "pointwise" KAM Theorem
Luigi Chierchia, Comlan Edmond Koudjinan

TL;DR
This paper reviews Arnold's 1963 KAM theorem proof, optimizing the scheme to derive sharp asymptotic conditions with explicit constants as perturbation strength approaches zero.
Contribution
It provides an optimized version of Arnold's scheme with explicit constants, leading to sharper asymptotic conditions in KAM theory.
Findings
Explicit constants are computed for the theorem.
Optimized scheme yields sharper asymptotic conditions.
Results improve understanding of small perturbations in Hamiltonian systems.
Abstract
We review V.I. Arnold's 1963 celebrated paper \cite{ARV63} {\sl Proof of A.N. Kolmogorov's theorem on the conservation of conditionally periodic motions with a small variation in the Hamiltonian}, and prove that, optimizing Arnold's scheme, one can get "sharp" asymptotic quantitative conditions (as , being the strength of the perturbation). All constants involved are explicitly computed.
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.
V.I. Arnold’s “pointwise” KAM Theorem
L. Chierchia & C. E. Koudjinan
Dipartimento di Matematica , Università “Roma Tre”
Largo S. L. Murialdo 1, I-00146 Roma (Italy)
[email protected], [email protected]
Abstract
We review V.I. Arnold’s 1963 celebrated paper [3] Proof of A.N. Kolmogorov’s theorem on the conservation of conditionally periodic motions with a small variation in the Hamiltonian, and prove that, optimising Arnold’s scheme, one can get “sharp” asymptotic quantitative conditions (as , being the strength of the perturbation). All constants involved are explicitly computed.
Contents
1 Introduction
- a.
“One of the most remarkable of A.N. Kolmogorov’s mathematical achievements is his work on classical mechanics of 1954”: this is the beginning of V.I. Arnold’s celebrated paper Proof of A.N. Kolmogorov’s theorem on the conservation of conditionally periodic motions with a small variation in the Hamiltonian [3], published in 1963, on the occasion of A.N. Kolmogorov’s 60th birthday. Few lines after, Arnold adds: “Its deficiency has been that complete proofs have never been published.
Even though one could argue whether Kolmogorov’s proof in [13] is “complete” or not (see, e.g., [7]), Arnold’s paper is certainly a milestone of modern dynamical systems, which not only contains a complete and detailed proof of Kolmogorov’s Theorem, but, also, introduces new original, technical ideas, of enormous impact in finite and infinite dimensional systems (for reviews, see, e.g., [4] or [11]).
- b.
Kolmogorov’s 1954 theorem in classical mechanics [13] (see, also, [7]), deals, as is well known, with the persistence, for small , of Lagrangian invariant tori of analytic integrable systems governed by a nearly integrable Hamiltonian
[TABLE]
where are standard symplectic action–angle variables. In short, the theorem says that:
for small , non–degenerate Diophantine unperturbed Lagrangian tori persist
Let us recall that “Diophantine” means that the unperturbed torus , which is invariant for the flow governed by the integrable Hamiltonian , is such that the frequency is Diophantine, i.e., it satisfies, for some ,
[TABLE]
“non–degenerate” means that the Hessian of at is invertible; finally, “persists” means that deforms, for positive small enough , into a a Lagrangian111A Lagrangian manifold is a submanifold of dimension on which the restriction of the two form vanishes. torus invariant for .
The scheme on which Arnold’s proof of Kolmogorov’s theorem is based, while sharing two basic ideas of Kolmogorov’s approach – namely, the use of a quadratic symplectic iterative method and the idea of keeping fixed the Diophantine frequency of the motion – is quite different from Kolmogorov’s scheme in the following respects.
First, for a fixed frequency, Arnold constructs an embedded, Lagrangian invariant torus obtained as a limit of symplectic transformations on action domains shrinking to a single point; in contrast, Kolmogorov conjugates the given Hamiltonian to a complete normal form admitting a Lagrangian invariant torus with the prescribed frequency.
A key difference between these two approaches is that, Arnold, at each step of the iteration, needs to control only a finite number of small divisors222To work with a finite number of divisors, Arnold introduces a Fourier cut–off (depending, in view of analyticity, logarithmically on the size of the perturbation), an idea which has been widely followed also in infinite dimensional Hamiltonian perturbation theory., which however depend on actions (this being the reason for the shrinking to one point of the action domains), while in the denominators appearing in Kolmogorov’s scheme there enters only the prefixed Diophantine frequency, allowing one to control at once all small divisors, and also to work with smaller and smaller domains, which contain a fixed open set, allowing one, in the end, to get a genuine symplectic transformation.
A clever quantitative revisitation of Kolmogorov’s scheme ([18]) shows that such a scheme leads to optimal asymptotic estimates (as ). We shall show below that this is true also for Arnold’s original “pointwise” scheme.
- c.
Kolmogorov’s and Arnold’s schemes are “‘pointwise” in the sense that they deal with the continuation of a single prefixed unperturbed Lagrangian torus with Diophantine frequency. This is in contrast with versions of the KAM theorem333Striclty speaking, there does not exists a KAM Theorem (“KAM” standing for the initials of A.N. Kolmogorv, V.I. Arnold and J.K. Moser), however, normally, it refers to (variations of) Kolmogorov’s theorem. Here, we follow this tradition. dealing with the persistence of sets of simultaneously persistent invariant tori, see [3], [16], [15], [9]. We point out that, actually, Arnold’s original formulation of the KAM theorem in [3] belongs to this second kind of theorem as it states the existence of a set of simultaneously invariant tori, however, the proof is pointwise in nature and its scheme is exactly the scheme we follow closely here. Typically, especially when one is concerned with lower dimensional invariant tori, it is not possible to construct a single torus with some pre–assigned property, but, rather, one obtains “Cantor” families of persistent tori (compare, e.g., [11]).
- d.
The smallness condition, i.e., how small the perturbation has to be in order for the perturbed invariant torus to exist, depends on local analytic properties of (and on the analytic norm of ). In particular, the main quantitative “competition” is between and the size of the small divisors appearing in the iterative scheme, the size of which may be measured by the “homogeneous Diophantine constant” (compare Eq. (2)) of the prefixed frequency .
The most important quantitative relations may be easily understood by looking at explicitly solvable examples, i.e., at integrable systems.
To illustrate this point, let us consider, for example, a simple pendulum with gravity ,
[TABLE]
viewed as an –perturbation of the non–degenerate Hamiltonian , (here, ). The energy zero level corresponds to the separatrix, i.e.,
[TABLE]
which shows immediately that in the region there are no homotopically trivial invariant tori (curves) or, equivalently, no Lagrangian invariant curves, which are graphs over the angle variable (“primary tori”). In other words, the region of action space where unperturbed curves may be continued into invariant Lagrangian invariant curves, which stay out of the “singular region” are such that:
[TABLE]
Now, the resonant relations become, in this one–dimensional example, simply and the Diophantine condition is, therefore, equivalent to requiring that (recall (2)), and the necessary condition (4) becomes:
[TABLE]
Another fact that can be easily extracted from this example concerns the oscillations of (primary) invariant tori444A primary Lagrangian torus is a graph over the angles and its oscillation is given by ..
For the invariant (primary) curves are given by
[TABLE]
with
[TABLE]
Thus, one has that
[TABLE]
which, in view of (5), yields the relation
[TABLE]
Below, we shall prove that the enhanced Arnold’s scheme leads to a smallness condition of the type (compare (14) below)
[TABLE]
(for an and independent constant ), which is in agreement with (5).
Furthermore, we shall also show that Arnold’s scheme leads to a bound on the oscillations of persistent tori given as graphs of the form (compare (16) below)
[TABLE]
(for an and independent constant ), which, in view of (6), is seen to be optimal (as far as the dependence upon and is concerned), showing the “quantitative sharpness” of Arnold’s scheme, on which the proof presented below is based.
Condition (7) is also the fundamental quantitative relation needed to evaluate the measure of the Kolmogorov’s set, i.e., the union (in a prefixed bounded domain) of all primary tori. Indeed, (7) leads to a bound on the Lebesgue measure of the complement of the Kolmogorov’s set by a constant times (compare [16], [15]), which again, comparing with the simple pendulum (3) – that has a region (the area enclosed by the separatrix) of measure free of primary tori – is seen to be asymptotically optimal. It has to be remarked, however, that obtaining such an estimate is quite delicate and far from trivial (for a more detailed discussion on this point, see [5], [14], [10]).
- e.
As is well known, Arnold’s scheme is an iterative Newton scheme yielding a sequence of “renormalised Hamiltonians”
[TABLE]
so that is the given nearly integrable Hamiltonian (1) and, for any , is integrable (i.e., depends only on the action variable ), real–analytic in a –ball around a point close to and satisfies:
[TABLE]
which means that at each step the frequency is kept fixed and that the integrable Hamiltonian is non–degenerate. The sequence of Hamiltonians are conjugated, i.e., , with symplectic, closer and closer to the identity. The persistent torus is then obtained as the limit
[TABLE]
The symplectic transformations ’s are obtained by solving the classical Hamilton–Jacobi equation so as to remove quadratically the order of the perturbation. In doing this one cannot take into account all small divisors (which are dense) and therefore Arnold introduces a Fourier cut–off , which allows him to deal with a finite number of small divisors. In view of the exponential decay of Fourier coefficients, can be taken \sim\big{|}\log\big{(}e^{2^{j}\|P_{j}\|}\big{)}\big{|}, which introduces a logarithmic correction555For full details, see § 3.1 below, and in particular “Step 1: Construction of Arnold’s transformation”., that does not affect the convergence of the scheme. All this is well known.
The problem is to equip the scheme with “optimal” quantitative estimates, which may lead, at the end, to the above sharp asymptotic bounds. This involves careful choices of various parameters entering the scheme (see § 3.2) and, in particular, it is crucial to treat the first step in a different way with respect to the remaining steps: this technical, but important, aspect is explained in Remark 4 below.
- f.
V.I. Arnold pointed out that his proof extended with little changes to the iso–energetically non–degenerate case, i.e., when the energy is prescribed and the unperturbed Hamiltonian satisfies the condition666The matrix in (10) is a matrix, where the upper right corner has to be interpreted as a column vector, while the lower left corner is a raw vector and the zero is a scalar. The condition expresses the fact the map is locally invertible.
[TABLE]
Indeed, it would not be difficult to adapt our improved Arnold’s scheme also to the iso–energetically non–degenerate case, proving the sharpness of the asymptotic smallness conditions also in this case.
- g.
Finally, we mention that the quantitative estimates provided in this paper could be used to improve the (exponentially long) stability time of “nearly–invariant tori”, introduced in [12].
2 Notation and quantitative statement of Arnold’s Theorem
For and , we let be the standard inner product; be the –norm, and be the sup–norm.
is the standard –dimensional (flat) torus.
and are the projections on the first and second component respectively.
For , ,
[TABLE]
is the set of –Diophantine numbers in d.
For , , we denote:
[TABLE]
If is the unit matrix, we denote the standard symplectic matrix by
[TABLE]
For , denotes the Banach space of real–analytic functions with bounded holomorphic extensions to , with norm
[TABLE]
We also denote:
[TABLE]
We equip with the canonical symplectic form
[TABLE]
and denote by the associated Hamiltonian flow governed by the Hamiltonian , , i.e., is the solution of the Cauchy problem , .
Given a linear operator from the normed space into the normed space , its “operator–norm” is given by
[TABLE]
Given , the directional derivative of a function with respect to is given by
[TABLE]
If is a (smooth or analytic) function on , its Fourier expansion is given by
[TABLE]
(where, as usual, denotes the Neper number and the imaginary unit). We also set:
[TABLE]
being the Fourier projection onto the Fourier modes with ; notice that .
We are ready to formulate a quantitative version of Arnold’s Theorem777To avoid to introduce too many symbols, we use capital straight style for positive constants (), while, usually, capital normal style is used for functions or matrices (). :
Theorem A Let ; ; ; ; ; ; . Assume that
[TABLE]
Define:
[TABLE]
and denote by the rescaled smallness parameter:
[TABLE]
There exist constants depending only on and , such that, if and
[TABLE]
then, there exists a real–analytic embedding
[TABLE]
where is the trivial embedding
[TABLE]
such that the –torus
[TABLE]
is a Lagrangian torus satisfying
[TABLE]
Furthermore,
[TABLE]
Remarks and addenda
- (i)
is a measure of the local “torsion” and is a number greater than or equal to one:
[TABLE]
- (ii)
Notice that the estimate on in (16) implies that the maximal action oscillation of the torus is bounded by a constant times , which in view of (13), is as advertised in (8).
- (iii)
All numerical constants are explicitly “computed” during the proof. A complete list of them, including the definitions of and , is given in Appendix A.
- (iv)
The torus is Kolmogorov non–degenerate. More precisely, can be put in Kolmogorov’s normal form with non–degenerate quadratic part: there exists a symplectic transformation close to , for which
[TABLE]
for details, see Appendix B.
- (v)
The value of in (14) is not optimal. In Remark 5 a better (still not optimal) value is given.
- (vi)
The dependence of the invariant torus on is analytic. More generally, if is real–analytic also in , being some open set in , and all the above norms are uniform in , then the invariant torus is real analytic in . This is an obvious corollary of Weierstrass’s theorem on uniform limits of holomorphic functions, in view of the uniformity of the limits in the proof.
3 Proof
3.1 Arnold’s scheme: the basic step
The next Lemma describes Arnold’s basic KAM step, on which Arnold’s scheme is based. Its quantitative formulation involves a few constants, which are defined as follows:
[TABLE]
Lemma 1
Let888 and stand, here, for generic real analytic Hamiltonians which, later on, will respectively play the roles of and , and , the roles of in the iterative step. , , and consider the Hamiltonian parametrised by
[TABLE]
Assume that
[TABLE]
and let , and be positive numbers such that
[TABLE]
*where .
Now, let be positive number such that:*
[TABLE]
where
[TABLE]
Finally, define
[TABLE]
Then, if
[TABLE]
there exist and a symplectic change of coordinates
[TABLE]
*such that *
[TABLE]
where
[TABLE]
Moreover, letting
[TABLE]
the following estimates hold:
[TABLE]
where
[TABLE]
Observe that
[TABLE]
so that (20) implies
[TABLE]
which, in particular, implies that and .
Proof
**Step 1: Construction of Arnold’s transformation **
We seek a near–identity symplectic transformation
[TABLE]
with , generated by a generating function999Following the classical approach of Arnold, we use generating functions to construct symplectic transformations. Of course one could also use the equivalent method of time–one Hamiltonian flows (or Lie series). of the form , so that
[TABLE]
such that
[TABLE]
By Taylor’s formula, we get101010Recall (§2) that stands for the average over and that is the Fourier projection onto modes with .
[TABLE]
with , which will be chosen large enough so that and
[TABLE]
By the non–degeneracy condition , for small enough (to be made precised below), and, therefore, by the standard Inverse Function Theorem (see, e.g., Lemma A.2), there exists a unique such that the second part of (26) holds. In view of (27), in order to get the first part of (26), we need to find such that vanishes; such a is indeed given by
[TABLE]
provided that
[TABLE]
But, in fact, since is rationally independent, then, given any , there exists such that
[TABLE]
The last step is to invert the function in order to define . By the Inverse Function Theorem, for small enough, the map admits a real–analytic inverse of the form
[TABLE]
so that the Arnold’s symplectic transformation is given by
[TABLE]
Hence, (26) holds with
[TABLE]
**Step 2: Quantitative estimates
**First of all, notice that from the definitions of and it follows that
[TABLE]
We begin by extending the “Diophantine condition w.r.t. ” uniformly to up to the order . Indeed, by the Mean Value Inequality and , we get, for any and any ,
[TABLE]
so that, by Fourier estimates (Lemma A.1–(ii)), we have
[TABLE]
[TABLE]
where
[TABLE]
Analogously,
[TABLE]
and, by Cauchy’s estimate (Lemma A.1–(i)) we get
[TABLE]
where
[TABLE]
Also,
[TABLE]
[TABLE]
Next, we prove the existence and uniqueness of in (26). Let and consider the map:
[TABLE]
Then
- •
.
- •
For any ,
[TABLE]
- •
Recalling , we have
[TABLE]
Therefore, we can apply the Inverse Function Theorem (Lemma A.2). Hence, there exists a function such that its graph coincides with . In particular, is the unique satisfying , i.e., the second part of (26). Moreover,
[TABLE]
so that
[TABLE]
Next, we prove that is invertible. Indeed, by Taylor’ formula, we have
[TABLE]
and, by Cauchy’s estimate,
[TABLE]
Hence is invertible with
[TABLE]
and
[TABLE]
Next, we prove estimate on . We have,
[TABLE]
so that, for any ,
[TABLE]
and thus
[TABLE]
[TABLE]
and by Fourier estimates (Lemma A.1–(ii)), we have,
[TABLE]
Hence,
[TABLE]
Finally, we prove that, given , the function has an analytic inverse111111Observe that is equivalent to , i.e., is a fixed–point of the map .. Consider the Banach’s space
[TABLE]
For any and any , we have Hence, the functional is well–defined and smooth. Moreover, for any
[TABLE]
Thus, . Furthermore, for any ,
[TABLE]
Hence, is a contraction. Therefore, by the Banach–Caccioppoli fixed–point Theorem, has a unique fixed–point ; is obtained as the uniform limit (as ). Thus, as is real–analytic on , by Weierstrass’s Theorem on the uniform convergence of analytic functions, is real–analytic on . The rest of the claims on and are then obvious.
3.2 Arnold’s scheme: Iteration
Let , , , , , , , , , , , , , , , be as in Theorem A. Set . Then, starting from , we shall iterate infinitely many times Lemma 1.
The very first step being quite different from all the others, it shall be done separately.
Before starting, let us give some definitions121212Recall the definitions of and given at the beginning of § 3.1..
[TABLE]
We also set, for :
[TABLE]
Observe that
[TABLE]
Note, also, that, since is proportional to , is independent of .
3.2.1 First step
Lemma 2
Assume
[TABLE]
Then, there exist and a real–analytic symplectic transformation
[TABLE]
such that, for , we have
[TABLE]
and
[TABLE]
**Proof **Since
[TABLE]
and
[TABLE]
we get
[TABLE]
Thus,
[TABLE]
Therefore, Lemma 1 implies Lemma 2.
3.2.2 Subsequent steps, iteration and convergence
For , define
[TABLE]
Thus, for any , one has
[TABLE]
i.e.,
[TABLE]
Once the first step is completed, all the following steps do not need any other condition. Actually, the first condition in (41) is no longer necessary and the second condition needs to be strengthen merely a little bit more. To be precise, the following holds.
Lemma 3
Assume and
[TABLE]
Then, one can construct a sequence of symplectic transformations
[TABLE]
so that
[TABLE]
*converges uniformly.
More precisely, , , , converge uniformly on to, respectively, [math], , , and with real–analytic for and . Finally, the following estimates hold for any :*
[TABLE]
Remark 4
Notice that is actually independent of (and, in particular, of ), while for does depend on through . This is a crucial point, which allows, at the end, to get optimal bounds on the displacement of the persistent invariant torus from the unperturbed one.
**Proof **First of all, notice that, for any ,
[TABLE]
where
[TABLE]
For a given , let be the following assertion:
there exist symplectic transformations131313Compare (21).
[TABLE]
and Hamiltonians real–analytic on such that, for any ,
[TABLE]
and
[TABLE]
Assume , for some and let us check . Fix . Then,
[TABLE]
and, similarly,
[TABLE]
which prove the two first relations in (59) for . Also
[TABLE]
so that
[TABLE]
Moreover,
[TABLE]
Thus, by last relation in (60), for any ,
[TABLE]
which proves the fourth relation in (59) for . Furthermore, by exactly the same computation as above, one gets
[TABLE]
which proves the last relation in (59) for . It remains only to check that the fifth relation in (59) holds as well for in order to apply Lemma 1 to , and get (60) and, consequently, . In fact, we have141414Notice that so that , which in turn proves the r.h.s. inequality in (62).
[TABLE]
so that
[TABLE]
To finish the proof of the induction, i.e., to construct an infinite sequence of Arnold’s transformations satisfying (59) and (60) for all , one needs only to check . Thanks to151515Observe that for , . , we just need to check the two last inequalities in . But, in fact, this is contained in the above computation. Then, we apply Lemma 1 to to get and , which achieves the proof of .
Next, we prove that is convergent by proving that it is a Cauchy sequence. For any , we have, using again Cauchy’s estimate (and noting that ),
[TABLE]
Therefore, for any ,
[TABLE]
Hence, by (51), converges uniformly on to some , which is then real–analytic map in .
To estimate on , observe that , for ,
[TABLE]
and therefore
[TABLE]
Moreover, for any ,
[TABLE]
which iterated yields
[TABLE]
Therefore, taking the limit over completes the proof of (56) and hence of Lemma 3.
3.3 Conclusion
We can now complete the proof of Theorem A. Let
[TABLE]
Observe that
[TABLE]
Then,
[TABLE]
and
[TABLE]
Hence, (14) implies the smallness conditions (41) and (51). Therefore, Lemma 2 and 3 hold. Now, set and observe that, uniformly on ,
[TABLE]
Moreover, for any ,
[TABLE]
and then passing to the limit, we get
[TABLE]
Thus, the triangle inequality gives
[TABLE]
which proves the bounds on and in (16). Let us now prove the bound on in (16). Set
[TABLE]
Then, for any , we have
[TABLE]
so that
[TABLE]
which implies
[TABLE]
and then letting , we get the estimate on .
Remark 5
As it is easy to check, Theorem A holds under the milder condition where
[TABLE]
Notice that .
Indeed, condition
[TABLE]
guaranties the convergence of Arnold’s scheme, while condition
[TABLE]
ensures that the Torus is a Lagrangian graph (over the “angle” variables).
Acknowledgements L.C. has been supported by the ERC grant HamPDEs under FP7 n. 306414 and the PRIN national grant “Variational Methods in Analysis, Geometry and Physics”. The authors are indebted with an anonymous referee for valuable suggestions and corrections.
Appendix
Appendix A Constants
For convenience, we collect here the list of constants appearing in the proof of Theorem A.
Recall that and notice that all ’s are greater than and depend only upon and .
[TABLE]
Appendix B Kolmogorov’s non–degeneracy
Let
[TABLE]
Since , then is a diffeomorphism of . Letting
[TABLE]
we have
[TABLE]
In [17] it is proven that the map
[TABLE]
is symplectic. Then,
[TABLE]
with:
[TABLE]
which show that is invertible.
Appendix C Reminders
C.1 Classical estimates (Cauchy, Fourier)
Lemma A.1
[6]* Let and a real–analytic function with*
[TABLE]
*Then,
(i) For any multi–index with and for any ,161616As usual, .*
[TABLE]
(ii)* For any and any *
[TABLE]
C.2 Implicit function theorem
Lemma A.2
[8]* Let and171717Here, denotes the ball in centered at and with radius .*
[TABLE]
be continuous with continuous Jacobian matrix . Assume that is invertible with inverse such that
[TABLE]
Then, there exists a unique continuous function such that the following are equivalent
* and ;*
* and .*
Moreover, satisfies
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] 9
- 2[2]
- 3[3] V. I. Arnold, Proof of A. N. Kolmogorov’s theorem on the conservation of conditionally periodic motions with a small variation in the Hamiltonian , Russian Math. Surv, 1963, vol. 18, no 5, pp. 9–36.
- 4[4] V. I. Arnold, V.V. Kozlov, and A.I. Neishtadt (editor), Mathematical Aspects of Classical and Celestial Mechanics , Dynamical Systems III, Series: Encyclopaedia of Mathematical Sciences , Vol. 3, Springer-Verlag 3rd ed., 2006.
- 5[5] L. Biasco and L. Chierchia, Explicit estimates on the measure of primary KAM tori . Annali di Matematica Pura ed Applicata (1923-), 197(1):261–281, 2018
- 6[6] A. Celletti and L. Chierchia, A constructive theory of Lagrangian tori and computer-assisted applications , In : Dynamics reported. Springer Berlin Heidelberg, 1995. p. 60-129.
- 7[7] L. Chierchia, Kolmogorov’s 1954 paper on nearly integrable Hamiltonian systems , Regular and Chaotic Dynamics, 2008, vol. 13, no. 2, pp. 130–139.
- 8[8] L. Chierchia, Kolmogorov–Arnold–Moser (KAM) Theory , In : Mathematics of Complexity and Dynamical Systems, Springer New York, 2012. pp. 810–836.
