Math 2.0

Dynamical systems and ergodic theory Hamiltonian dynamics Theorem

Kolmogorov–Arnold–Moser theorem

Builds on Hamiltonian systemTorusIntegrable systemAction-angle coordinates

Statement

Let n≥2n \ge 2, let D⊆ℝnD \subseteq \R^n be a bounded open set and let 𝕋n=ℝn/2πℤn\mathbb{T}^n = \R^n / 2\pi \Z^n. Use action-angle coordinates (I,θ)(I, \theta) on D×𝕋nD \times \mathbb{T}^n, with symplectic form ∑kdIk∧dθk\sum_k dI_k \wedge d\theta_k. Consider the Hamiltonian system with Hamiltonian Hε(I,θ)=H0(I)+εH1(I,θ),H_\varepsilon(I, \theta) = H_0(I) + \varepsilon H_1(I, \theta), where H0H_0 and H1H_1 are real-analytic on a neighbourhood of D‾×𝕋n\overline{D} \times \mathbb{T}^n. Assume that H0H_0 is nondegenerate: det⁡(∂2H0/∂I2)≠0\det \left( \partial^2 H_0 / \partial I^2 \right) \ne 0 on D‾\overline{D}. Then there is ε0>0\varepsilon_0 > 0 such that for 0≤ε<ε00 \le \varepsilon < \varepsilon_0:

  1. the phase space contains a family of invariant nn-tori of HεH_\varepsilon. Each is close to an invariant torus {I=I0}\set{I = I_0} of H0H_0 with Diophantine frequency vector ω=∇H0(I0)\omega = \nabla H_0(I_0). This means that ∣⟨k,ω⟩∣≥γ∣k∣−τ\abs{\langle k, \omega \rangle} \ge \gamma \abs{k}^{-\tau} for all k∈ℤn∖{0}k \in \Z^n \setminus \set{0}, for some constants γ>0\gamma > 0 and τ>n−1\tau > n - 1;
  2. on each of these tori the flow of HεH_\varepsilon is conjugate to the linear flow θ↦θ+tω\theta \mapsto \theta + t \omega;
  3. the Lebesgue measure of the complement of the union of these tori in D×𝕋nD \times \mathbb{T}^n tends to 00 as ε→0\varepsilon \to 0.

Remarks

The proof is a Newton-type iteration. At each step a canonical change of coordinates removes the angle dependence of the perturbation to a higher order. Each step needs to divide by ⟨k,ω⟩\langle k, \omega \rangle, the small divisors, and the Diophantine condition controls them. The quadratic convergence of the Newton scheme beats the loss caused by the small divisors.

Kolmogorov announced the result in 1954, Arnold proved it for analytic Hamiltonians, and Moser proved a version for twist maps of finite smoothness.

Tori with resonant frequencies, where ⟨k,ω⟩=0\langle k, \omega \rangle = 0 for some k≠0k \ne 0, are in general destroyed by the perturbation. Some nondegeneracy condition on H0H_0 is needed, because the proof uses the map I↦∇H0(I)I \mapsto \nabla H_0(I) to choose tori with Diophantine frequencies; other versions use the isoenergetic nondegeneracy condition instead.

Going deeper

For a student

KAM theory answers a question of Poincaré on the persistence of quasi-periodic motion in nearly integrable systems. Its key ingredients are the Diophantine condition on frequencies and a rapidly converging iteration. For two degrees of freedom the surviving 22-tori separate each 33-dimensional energy level, which gives stability of the actions for all time. In three or more degrees of freedom the tori do not separate the energy levels, and Arnold diffusion becomes possible; the Nekhoroshev estimates bound its speed. The same ideas apply to area-preserving twist maps such as the standard map.

Reading path

To understand this page from the ground up, read these 67 pages in order. The foundations come first.

  1. Action-angle coordinates concept
  2. Element definition
  3. Hamiltonian system concept
  4. Integrable system concept
  5. Proposition concept
  6. Real numbers object
  7. Set definition
  8. Conjunction definition
  9. Disjunction definition
  10. Implication definition
  11. Predicate definition
  12. Empty set object
  13. Family of sets definition
  14. Ordered pair definition
  15. Intersection definition
  16. Union definition
  17. Set-builder notation concept
  18. Existential quantifier definition
  19. Universal quantifier definition
  20. Cartesian product definition
  21. Subset definition
  22. Union of a family of sets definition
  23. Uniqueness quantifier definition
  24. Binary relation definition
  25. Universal set definition
  26. Topological space definition
  27. Reflexive relation definition
  28. Symmetric relation definition
  29. Transitive relation definition
  30. Complement definition
  31. Function definition
  32. Basis of a topology definition
  33. Subspace topology definition
  34. Equivalence relation definition
  35. Product topology definition
  36. Preimage of a set definition
  37. Metric space definition
  38. Codomain definition
  39. Function composition definition
  40. Injective function definition
  41. Equivalence class definition
  42. Open ball definition
  43. Surjective function definition
  44. Metric topology definition
  45. Quotient set definition
  46. Bijective function definition
  47. Open set definition
  48. Quotient topology definition
  49. Inverse function definition
  50. Hausdorff space definition
  51. Open cover definition
  52. Continuous map of topological spaces definition
  53. Closed set definition
  54. Compact space definition
  55. Complement of an open set is closed statement
  56. Homeomorphism definition
  57. Universal property of the quotient topology statement
  58. Continuity via closed sets statement
  59. Compact set definition
  60. Compactness via open covers statement
  61. Compact subsets of a Hausdorff space are closed statement
  62. Continuous image of a compact set is compact statement
  63. Closed subsets of compact sets are compact statement
  64. Continuous bijection from a compact space to a Hausdorff space is a homeomorphism statement
  65. Circle as a quotient of the real line example
  66. Torus example
  67. Kolmogorov–Arnold–Moser theorem statement

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Kolmogorov–Arnold–Moser_theorem
About this page
Tag3ZZSXKM16Z
URIm2://3ZZSXKM16Z
Kindstatement, theorem
WritingW0 stub
MSC37J40, 70H08
StatusThis copy of the site has no build data. Run m2 status 3ZZSXKM16Z.
AboutIntegrable system
UsesHamiltonian system, Torus, Integrable system, Action-angle coordinates
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by