Jump to ContentJump to Main Navigation
The Lazy UniverseAn Introduction to the Principle of Least Action$
Users without a subscription are not able to see the full content.

Jennifer Coopersmith

Print publication date: 2017

Print ISBN-13: 9780198743040

Published to Oxford Scholarship Online: June 2017

DOI: 10.1093/oso/9780198743040.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 20 February 2019



(p.1) 1 Introduction
The Lazy Universe

Jennifer Coopersmith

Oxford University Press

The chapter explains how the Principle of Least Action yields a unique answer to a physical problem irrespective of the frame of reference. The motivation arises from d’Alembert’s rousing words: “To someone who could grasp the Universe from a unified standpoint the entire creation would appear as a unique truth and necessity.” The requirement is that one “algorithm” can cope with all the specificity, variety, and complexity across the whole of physics. That one algorithm could ever be up to the task is made plausible by use of an allegory involving a King, the princess, and some suitors. Finally, the link with Least Action is made. Note that the terms extremal, objectivity, observer, and viewpoint are explained.

Keywords:   extremal, algorithm, objectivity, reference frame, observer, d’Alembert, necessity, unique truth, viewpoint, standpoint

Oxford 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 .