Jump to ContentJump to Main Navigation
Action-minimizing Methods in Hamiltonian Dynamics (MN-50)An Introduction to Aubry-Mather Theory$
Users without a subscription are not able to see the full content.
Action-minimizing Methods in Hamiltonian Dynamics (MN-50): An Introduction to Aubry-Mather Theory

Alfonso Sorrentino

Print publication date: 2015

Print ISBN-13: 9780691164502

Published to Princeton Scholarship Online: October 2017

DOI: 10.23943/princeton/9780691164502.001.0001

Show Summary Details
Page of

PRINTED FROM PRINCETON SCHOLARSHIP ONLINE (www.princeton.universitypressscholarship.com). (c) Copyright Princeton University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in PRSO for personal use.date: 07 December 2021

From KAM Theory to Aubry-Mather Theory

From KAM Theory to Aubry-Mather Theory

Chapter:
(p.8) Chapter Two From KAM Theory to Aubry-Mather Theory
Source:
Action-minimizing Methods in Hamiltonian Dynamics (MN-50)
Author(s):

Alfonso Sorrentino

Publisher:
Princeton University Press
DOI:10.23943/princeton/9780691164502.003.0002

This chapter discusses an illustrative example, namely the properties of invariant probability measures and orbits on KAM tori (or more generally, on invariant Lagrangian graphs). This will prepare the ground for understanding the main ideas and techniques that will be developed in the following chapters, without several technicalities that might be confusing to a neophyte.

Keywords:   KAM tori, invariant Lagrangian graphs, orbits, invariant probability measures

Princeton Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us.