MATH-F-204 Analytical mechanics: Lagrangian and Hamiltonian formalism
Glenn Barnich Physique Théorique et Mathématique Université libre de Bruxelles and International Solvay Institutes Campus Plaine C.P. 231, B-1050 Bruxelles, Belgique Bureau 2.O6. 217, E-mail: [email protected], Tel: 02 650 58 01.
The aim of the course is an introduction to Lagrangian and Hamiltonian mechanics. The fundamental equations as well as standard applications of Newtonian mechanics are derived from variational principles. From a mathematical perspective, the course and exercises (i) constitute an application of differential and integral calculus (primitives, inverse and implicit function theorem, graphs and functions); (ii) provide examples and explicit solutions of first and second order systems of differential equations; (iii) give an implicit introduction to differential manifolds and to realiza- tions of Lie groups and algebras (change of coordinates, parametrization of a rotation, Galilean group, canonical transformations, one-parameter subgroups, infinitesimal transformations). From a physical viewpoint, a good grasp of the material of the course is indispensable for a thorough understanding of the structure of quantum mechanics, both in its operatorial and path integral formulations. Furthermore, the discussion of Noether’s theorem and Galilean invariance is done in a way that allows for a direct generalization to field theories with Poincaré or conformal invariance. 2 Contents
1 Extremisation, constraints and Lagrange multipliers 5 1.1 Unconstrained extremisation ...... 5 1.2 Constraints and regularity conditions ...... 5 1.3 Constrained extremisation ...... 7
2 Constrained systems and d’Alembert principle 9 2.1 Holonomic constraints ...... 9 2.2 d’Alembert’s theorem ...... 10 2.3 Non-holonomic constraints ...... 10 2.4 d’Alembert’s principle ...... 13
3 Hamilton and least action principles 15
4 Lagrangian mechanics 17
5 Applications of the Lagrangian formalism 19
6 Covariance of the Lagrangian formalism 21 6.1 Change of dependent variables ...... 21 6.2 Change of the independent variable ...... 22 6.3 Combined change of variables ...... 23
7 Noether’s theorem and Galilean invariance 25 7.1 Noether’s first theorem ...... 25 7.2 Applications ...... 26 7.2.1 Explicit time independence and conservation of energy ...... 26 7.2.2 Cyclic variables and conservation of canonical momentum ...... 26 7.2.3 One-parameter groups of transformations ...... 26 7.2.4 One-parameter groups of transformations involving time ...... 28 7.2.5 Galilean boosts ...... 30
8 Hamiltonian formalism 31
9 Canonical transformations 33
10 Dynamics in non-inertial frames 35
11 Charged particle in electromagnetic field 37
References 37
3 4 CONTENTS Chapter 1
Extremisation, constraints and Lagrange multipliers
The purpose of this chapter is to re-derive in the finite-dimensional case standard results on constrained extremisation so as to motivate and clarify analogous results needed in the functional case. It is based on chapters II.1, II.2, II.5 of [8]. The discussion on constraints and regularity conditions is taken from chapter 1 of [11].
1.1 Unconstrained extremisation
The problem consists of finding the extrema (=stationary points) of a function F (x1, . . . , xn) of n variables xa, a = 1, . . . , n in the interior of a domain. We write the variation of such a function under variations δxa of the variables xa as ∂F δF = δxa . (1.1) ∂xa ∂F ∂F Here and throughout, we use the summation convention over repeated indices, δxa = Pn δxa . ∂xa a=1 ∂xa b Since for a collection of functions fa(x ),
a a faδx = 0, ∀δx =⇒ fa = 0, (1.2) it follows that the extrema x¯a are determined by the vanishing of the gradient of F ,
∂F δF = 0 ⇐⇒ | a a = 0 . (1.3) ∂xa x =¯x
Recall further that the nature (maximum, minimum, saddle point) of each extremum is determined by the eigenvalues of the matrix ∂2F | . (1.4) ∂xa∂xb x¯
1.2 Constraints and regularity conditions
Very often, one is interested in a problem of extremisation, where the variables xa are subjected to con- straints, that is to say where r independent relations
Gm(x) = 0, m = 1, . . . r, (1.5)
5 6 CHAPTER 1. EXTREMISATION, CONSTRAINTS AND LAGRANGE MULTIPLIERS
∂G are supposed to hold. Standard regularity on the functions G are that the rank of the matrix m is m ∂xa r (locally, in a neighborhood of Gm = 0). This means that one may choose locally a new system of a α coordinates such that Gm are r of the new coordinates, x ←→ q ,Gm, with α = 1, . . . n − r. Lemma 1. A function f that vanishes when the constraints hold can be written as a combination of the functions defining the constraints:
m f|Gm=0 = 0 ⇐⇒ f = g Gm , (1.6) for some coefficients gm(x). That the condition is sufficient (⇐=) is obvious. That it is necessary (=⇒) is shown in the new α coordinate system, where f(q ,Gm = 0) = 0 and thus
1 1 Z d Z ∂f f(qα,G ) = dτ f(qα, τG ) = G dτ (qα, τG ), (1.7) m dτ m m ∂G m 0 0 m
m R 1 ∂f α so that g = dτ (q , τGm). 0 ∂Gm In the following, we will use the notation f ≈ 0 for a function that vanishes when the constraints hold, m so that the lemma becomes f ≈ 0 ⇐⇒ f = g Gm. Lemma 2. Suppose that the constraints hold and that one restricts oneself to variations δxa tangent to the constraint surface, ∂G G = 0, m δxa ≈ 0. (1.8) m ∂xa It follows that ∂G f δxa ≈ 0, ∀δxa satisfying (1.8) ⇐⇒ f ≈ µm m , (1.9) a a ∂xa for some µm. NB: In this lemma, the use of ≈ means that these equalities in (1.8) and (1.9) are understood as holding when Gm = 0. That the condition is sufficient (⇐=) is again direct when contracting the expression for fa in the RHS of (1.9) with δxa and using the second of (1.8). That the condition is necessary (=⇒) follows by first substracting from the LHS of (1.9) the combi- nation ∂G −λm m δxa ≈ 0, with arbitrary λm, which gives ∂xa ∂G (f − λm m )δxa ≈ 0. (1.10) a ∂xa Without loss of generality (by renaming if necessary some of the variables), we can assume that
∂G | m |= 6 0, for a = n − r + 1, . . . , n. (1.11) ∂xa This implies that one may locally solve the constraints in terms of the r last coordinates,
∆ ∆ α Gm = 0 ⇐⇒ x = X (x ), ∆ = n − r + 1, . . . , n, α = 1, . . . , n − r. (1.12)
In this case, one refers to the x∆ as dependent and to the xα as independent variables. This also implies that, locally, there exists an invertible matrix M m∆ such that
m∆ ∂Gm0 m ∂Gm mΓ Γ M = δ 0 , M = δ . (1.13) ∂x∆ m ∂x∆ ∆ 1.3. CONSTRAINED EXTREMISATION 7
In terms of the various types of variables, (1.10) may be decomposed as
∂G ∂G (f − λm m )δx∆ + (f − λm m )δxα ≈ 0. (1.14) ∆ ∂x∆ α ∂xα Since the λm are arbitrary, we are free to fix
∂G λm = M mΓf := µm ⇐⇒ f = µm m , (1.15) Γ ∆ ∂x∆ so that the first term (1.14) vanishes. We then remain with
∂G (f − µm m )δxα ≈ 0. (1.16) α ∂xα Since the variables xα are unconstrained and the variations δxα independent, this implies as in (1.2) that
∂G f ≈ µm m . (1.17) α ∂xα
1.3 Constrained extremisation
a Extremisation of a function F (x ) under r constraints Gm = 0 can then be done in two equivalent ways:
Method 1: The first is to solve the constraints as in (1.12) and to extremise the function
F G(xα) = F (xα,X∆(xβ)) . (1.18)
In terms of the unconstrained variables xα, we are back to an unconstrained extremisation problem, whose extrema are determined by ∂F G = 0 . (1.19) ∂xα In order to relate to the previous discussion and the second method to be explained below, note that, ∆ ∆ α by using Lemma 1, Gm = 0 ⇐⇒ x − X (x ) = 0 implies
∆ ∆ α ∆m x − X (x ) = g Gm, (1.20) for g∆m(xa) invertible. Differentiation with respect to xΓ yields
∂g∆m ∂G δ∆ = G + g∆m m . (1.21) Γ ∂xΓ m ∂xΓ ∂G Hence, if the constraints are satisfied, i.e., if G = 0, g∆m is the inverse matrix to m , g∆m ≈ M ∆m. m ∂x∆ On the one hand, ∂F G ∂F ∂F ∂XΓ = | ∆ ∆ + | ∆ ∆ . (1.22) ∂xα ∂xα x =X ∂xΓ x =X ∂xα On the other hand, ∂XΓ ∂(XΓ − xΓ) ∂gΓm ∂G = = − G − gΓm m , (1.23) ∂xα ∂xα ∂xα m ∂xα ∆ ∆ so that, if Gm = 0, or equivalently, if one substitutes x by X , (1.19) may be written as ∂F ∂G ∂F ≈ µm m , µm ≈ g∆m. (1.24) ∂xα ∂xα ∂x∆ 8 CHAPTER 1. EXTREMISATION, CONSTRAINTS AND LAGRANGE MULTIPLIERS
Furthermore, if Gm = 0, one may also write
∂F ∂F ∂F ∂G ∂G = δΓ ≈ gΓm m ≈ µm m . (1.25) ∂x∆ ∂xΓ ∆ ∂xΓ ∂x∆ ∂x∆ by using (1.21) and the definition of µm in (1.24).
Method 2: Instead of restricting oneself to the space of independent variables xa, one extends the space of variables xa by additional variables λm, called Lagrange multipliers, and one considers the unconstrained extremisation of the function,
λ a m a m λ F (x , λ ) = F (x ) − λ Gm, δF = 0 . (1.26)
By unconstrained extremisation, we understand that the variables xa, λm are considered as unconstrained at the outset, with independent variations δxa, δλm. That this gives the same extrema can be seen as follows: ∂F ∂G 0 = δF λ = ( − λm m )δxa − δλmG , (1.27) ∂xa ∂xa m implies ∂F ∂G = λm m ,G = 0. (1.28) ∂xa ∂xa m ∂G A variation of the second equation then implies that m δxa = 0, while contraction of the first equation ∂xa with δxa gives us (1.10) of the proof of lemma 2. We can then continue as in the proof of this lemma to ∂F ∂G conclude that ≈ µm m for some µm, and thus that both methods define the same extrema. ∂xa ∂xa Chapter 2
Constrained systems and d’Alembert principle
2.1 Holonomic constraints
3 α Consider N particles moving in space R , with coordinates are denoted by xi , i = 1,..., N , α = 1, 2, 3. Alternatively, we can label them by xa, with a = 1,..., 3N . We assume that they are submitted to r constraints of the form a Gm(x , t) = 0. (2.1) Such constraints that only involve the positions but not the velocitites of the particles are called holonomic. ∂G As before, we assume regularity conditions: the rank of matrix m is maximal for all values of t. When ∂xa the constraints do not depend explicitly on time, they are called scleronomic, if they do, they are called rheonomic. During a motion, the particles are assumed to remain on the surface defined by the constraints. If this motion dxα takes place during an infinitesimally small time interval dt, this means that
∂G ∂G dG = dxa m + dt m = 0. (2.2) m ∂xa ∂t In other words, the constraints are constraints on the trajectories of the particles and gives rise by differ- entiation with respect to time to constraints on the velocities,
∂G ∂G x˙ a m + m = 0, (2.3) ∂xa ∂t
dxa d2xa where, for a trajectory xa(t), the notation x˙ a = and x¨a = is used. dt dt2 a a Consider two trajectories x (t) and xe (t). What we will be interested in below is (instantaneous) a a a virtual displacements i.e., the difference of these trajectories ∆x (t) = xe (t) − x (t) at fixed times t. It follows that
dxa(t) xa(t + ) + xa(t) xa(t + ) − xa(t + ) − (xa(t) − xa(t)) ∆ = ∆ lim = lim e e dt →0 →0 dxa(t) dxa(t) d = e − = ∆xa(t). (2.4) dt dt dt More specifically we will be interested in infinitesimal displacements δxa of this type that are compatible with the constraints, ∂G δxa m ≈ 0. (2.5) ∂xa
9 10 CHAPTER 2. CONSTRAINED SYSTEMS AND D’ALEMBERT PRINCIPLE
Lemma 3. The elementary work δ/W of the reaction forces due to the constraints vanishes for all in- finitesimal virtual displacements that are compatible with the constraints if and only if the reaction forces are perpendicular to the constraints,
∂G δ/W = R δxa ≈ 0 ⇐⇒ R ≈ µm m , (2.6) a a ∂xa for some µm(xa, t).
Indeed, except for the interpretation in terms of work and forces as well as the geometric meaning of a linear combination of the gradient of constraints, this follows directly from the previous lemma. The notation δ/W means that this elementary work is not necessarily the variation of a function. In what follows, we limit ourselves (almost) exclusively to such constraints, i.e., to constraints whose reaction forces do not do any work during a virtual displacement. In particular this means that there can be no friction due to these constraints. Such constraints are called ideal.
2.2 d’Alembert’s theorem
The dynamics of the N particles is governed by Newton’s equations,
α α α m(i)x¨i = Fi + Ri , (2.7)
α where the parenthesis around the index i means that there is no summation, and where Fi are the com- α ponents of the applied forces acting on the ith particles, while Ri are the reaction forces due to the constraints, assumed to be ideal. The latter keep the particles confined to the constraint surface.
Theorem 1 (d’Alembert). Newton’s equation for a system of point particles subjected to ideal constraints are equivalent to the condition that the elementary work of the sum of the applied forces and of the forces α of inertia (−m(i)x¨i ) vanishes for all infinitesimal virtual displacements compatible with the constraints,
α α α (Fi − m(i)x¨i )δxi ≈ 0 . (2.8)
The theorem states that the Newton’s equations (2.7), together with the fact that the reaction forces i m ∂Gm associated to ideal constraints are of the form Rα ≈ µ α on account of equation (2.6) of Lemma 3 are ∂xi equivalent to (2.8) when the constraints (2.1) hold, and when limiting oneself to compatible infinitesimal α virtual displacements, (2.5). That the condition is suffisant (=⇒) follows by contracting (2.7) with δxi and using (2.6) together with (2.5) to conclude that (2.8) holds. That the condition is necessary (⇐=) α α m ∂Gm follows because (2.1), (2.5) together with (2.8) imply, as in lemma 3, that Fi − m(i)x¨i ≈ −µ α , for ∂xi some µm, which are Newton’s equation (2.7), together with (2.6).
2.3 Non-holonomic constraints
Non-holonomic constraints are constraints on the velocities of point particles as in (2.3), but that do not originate from holonomic constraints, i.e., from constraints on positions, through differentiation with respect to time. 2.3. NON-HOLONOMIC CONSTRAINTS 11
Figure 2.1: Source: Goldstein [5], chapter 1.3
As an example, consider a vertical disk or coin rolling without sliding on a horizontal plane, z = 0 in standard Cartesian coordinates. Let (xC , yC , zC ) the coodinates of the center of the disk. Only xC , yC are relevant since zC = a, with a the radius of the disk. Let φ be the angle of rotation of the disk starting from a fixed initial direction and θ the angle made by ~1x and the axes of rotation of the disk. Since the velocity ~v of the center of the disk is normal to this axes, and lies in a plane of constant z, it follows that the angle ~ π between 1x and ~v is θ − 2 , so that π π x = v cos(θ − ) = v sin θ, y = v sin(θ − ) = −v cos θ. (2.9) C 2 C 2
Futhermore, the velocity of a point on the edge of the disk is aφ˙. This is the module of the velocity of the point of contact of the disk with the plane, and since there is no sliding this is also the velocity of the center of the disk, v = aφ˙. By injecting into the previous relations, we thus get the following relations between velocitites for this motion ˙ x˙ C − a sin θφ = 0, ˙ (2.10) y˙C + a cos θφ = 0, and the question is whether these constraints on velocities come from constraints on positions by differ- entiation with respect to time. More generally, consider r constraints that are at most linear in velocities x˙ a,
m a m Ka x˙ + K0 = 0, (2.11)
m b m b a where Ka (x , t),K0 (x , t) are functions that depend on the coordinates x , a = 1, . . . , n (which may α or may not simply be the positions xi in Cartesian space of the N particles), and possibly an explicit dependence on time t. The question then is whether the relation on the velocities (2.11), or any equivalent relation on the velocities m m0 a m0 Λ m0 (Ka x˙ + K0 ) = 0, (2.12)
m b with Λ m0 (x , t) an invertible matrix, can be written as
m m m m0 a m0 ∂G a ∂G Λ 0 (K x˙ + K ) = x˙ + . (2.13) m a 0 ∂xa ∂t 12 CHAPTER 2. CONSTRAINED SYSTEMS AND D’ALEMBERT PRINCIPLE for r functions Gm(xa, t). Since the velocities are arbitrary, this relation can be decomposed as
m ∂G m m0 0 a = Λ m Ka , ∂xm (2.14) ∂G m m0 = Λ 0 K , ∂t m 0 In order to answer this question, it is useful to introduce xA = (t, xa), A = 0, . . . , n, so that the above n + 1 equations can be written in a unified way as
m ∂G m m0 = Λ 0 K . (2.15) ∂xA m A Necessary conditions1 for the existence of such functions Gm is that mixed second derivatives of the right hand sides vanish,
2 2 ∂ Gm ∂ Gm ∂ m m0 ∂ m m0 = =⇒ (Λ 0 K ) = (Λ 0 K ). (2.16) ∂xA∂xB ∂xB∂xA ∂xA m B ∂xB m A m This is however not the condition that we need because it still contains the unknown functions Λ m0 . m What we need is a condition on the functions KA alone. A standard technical assumption on these functions, that we aasume to hold is that they are linearly independet in the following sense: if there exist B m some functions λm(x ) such that λmKA = 0 then necessarily λm = 0. The condition we need is then a consequence of the following theorem.
m Theorem 2 (Frobenius). For linearly independent functions KA , the set of conditions
∂ m 1 r ( KA )KA ...KA ] = 0, (2.17) ∂x[A1 2 3 r+2
m B m B is necessary and sufficient for the existence of functions Λ m0 (x ) (invertible) and G (x ) such that
m ∂G m m = Λ 0 K . (2.18) ∂xA m A
In equation (2.17), the square bracket denotes complete antisymmetrization of the indices A1,...Ar+2, divided by (r + 2)!, the number of permutations of r + 2 objects. More explicitly,
∂ m 1 r 1 X |σ| ∂ m 1 r ( KA )KA ...KA ] = (1) ( KA )KA ...KA , (2.19) ∂x[A1 2 3 r+2 (r + 2)! ∂xAσ(1) σ(2) σ(3) σr+2 σ∈Pr+2 where Pr+2 denotes a permutations of r +2 elements and |σ| = 0 if the permutation is even, while |σ| = 1 if the permutation is odd. Let us prove that these conditions are indeed necessary (⇐=). We start from
m ∂ ∂G 1 r 0 = ( )KA ...KA ], (2.20) ∂x[A1 ∂xA2 3 r+2 ∂2Gm which holds because the second order derivatives are symmetric in A1,A2, so that, when com- ∂xA1 ∂xA2 pletely antisymmetrizing in the right hand side of equation (2.20), one finds always 0. Since we assume that (2.18) is true, we find by substitution
∂ m m0 1 r 0 = ( (Λ m0 KA ))KA ...KA ] = ∂x[A1 2 3 r+2 ∂ m m0 1 r m ∂ m0 1 r ( Λ m0 )KA KA ...KA ] + Λ m0 ( KA )KA ...KA ] (2.21) ∂x[A1 2 3 r+2 ∂x[A1 2 3 r+2 1It can in fact be shown, as done later in the course, that these conditions are also locally sufficient. 2.4. D’ALEMBERT’S PRINCIPLE 13
The first term on the last line vanishes because the antisymmetry in A2,...Ar+2 implies the antisymmetry in m0, 1, . . . , r, but m0 takes a value between 1 and r so that one of the values arises twice and a completely m antisymmetric expression then vanishes. Equation (2.17) then follows because Λ m0 is invertible. The proof that the condition is sufficient (=⇒) can be found in [3] or [10]. In the particular case of the disk, we have
A x = (t, xC , yC , φ, θ), (2.22) and we have two constraints, r = 2. More explicitly,
1 1 1 1 4 1 K0 = 0,K1 = 1,K2 = 0,K3 = −a sin θ = −a sin x ,K4 = 0, 2 2 2 1 4 2 (2.23) K0 = 0,K1 = 0,K2 = 1,K3 = a cos θ = a cos x ,K4 = 0. Let us show that the constraints are non-holonomic, i.e., that there is at least one of the conditions in (2.17) that is not satisfied. If we take m = 1, they become
∂ 1 1 2 ( KA )KA KA ] = 0. (2.24) ∂x[A1 2 3 4
Choosing A1 = 4,A2 = 3,A3 = 1,A4 = 2, one can check that only the first term in the complete 1 4 antisymmetrization is non-vanishing, so that the result of the left hand side is given by 4! (−a cos x ) which does not vanish.
2.4 d’Alembert’s principle
In the proof of d’Alembert theorem, nothing crucially depended on the fact that the constraints were ∂Gm holonomic. It can thus be extended to non-holonomic ones (by the replacement → Km in the ∂xa a proof). Suppose then that there are r non holonomic constraints
m a m Ka x˙ + K0 = 0, (2.25) and consider infinitesimal virtual displacements δxa that are compatible,
m a Ka δx = 0. (2.26) d’Alembert’s principle then states that Newton’s equation
a a a m(a)x¨ = F + R , (2.27) together with the condition that the forces of reaction are of the form
m Ra ≈ λmKa , (2.28) are equivalent to the condition that the sum of the applied forces and of the forces of inertia produce no work during any compatible infinitesimal virtual displacement δxa,
a a a (F − m(a)x¨ )δx ≈ 0. (2.29)
Systems covered by d’Alembert’s theorem and principle are
• systems of point particles that move on polished surfaces that are fixed or moving (holonomic constraints), 14 CHAPTER 2. CONSTRAINED SYSTEMS AND D’ALEMBERT PRINCIPLE
• motions of solids with one point having a prescribed trajectory
• sliding of solids on polished surfaces
• rolling without sliding of solids on rough surfaces
• fixed links between solids
What is not covered by the theorem and principle are constraints that involve friction or constraints that are expressed by inequalities. Chapter 3
Hamilton and least action principles
a a Consider trajectories x = x (t) that pass through a fixed point at some initial time ti and another fixed a a a a point at a final time tf , x (ti) = xi , x (tf ) = xf .A natural trajectory is a trajectory that satisfies Newton’s equations together with the constraints. Virtual trajectories
15 16 CHAPTER 3. HAMILTON AND LEAST ACTION PRINCIPLES Chapter 4
Lagrangian mechanics
17 18 CHAPTER 4. LAGRANGIAN MECHANICS Chapter 5
Applications of the Lagrangian formalism
19 20 CHAPTER 5. APPLICATIONS OF THE LAGRANGIAN FORMALISM Chapter 6
Covariance of the Lagrangian formalism
6.1 Change of dependent variables
Consider a non-singular change of variables of the generalized Lagrange coordinates, α 0 ∂q qα = qα(qβ , t), det ( ) 6= 0, (6.1) ∂qβ0 with inverse transformation denoted by qβ0 = qβ0 (qα, t). The Lagrangian in the new coordinates is d L0(q0, q˙0, t) = L(q(q0, t), q(q0, t), t) := L| (6.2) dt d α β0 where the bar means that one has done the change of variables inside the function, with dt q (q , t) = ∂qα γ0 ∂qα 0 q˙ + . ∂qγ ∂t By direct computation one finds
0 0 0 α 2 α 2 α α δL ∂L d ∂L ∂L ∂q ∂L ∂ q 0 ∂ q d ∂L ∂q = − = | + | q˙γ + − | δqβ0 ∂qβ0 dt ∂q˙β0 ∂qα ∂qβ0 ∂q˙α ∂qβ0 ∂qγ0 ∂qβ0 ∂t dt ∂q˙α ∂qβ0 ∂qα h ∂L d ∂L i = 0 | − | . (6.3) ∂qβ ∂qα dt ∂q˙α ∂qα Indeed, when d in the last term of the first line hits the previous term in the first line is cancelled. As a consequence, dt ∂qβ0 ∂L out of the second and third term of the first line, one only remains with d that hits |. dt ∂q˙α Furthermore,
2 2 2 2 d ∂L ∂ L d 0 ∂ L d 0 ∂ L d ∂L | = | qβ(qγ , t) + | qβ(qγ , t) + | = |, (6.4) dt ∂q˙α ∂qβ∂q˙α dt ∂q˙β∂q˙α dt2 ∂t∂q˙α dt ∂q˙α