Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
will refer to as the derivative map. Since 0 .x/ D f 00 .x/ > 0 for all x, is an increasing
function on I , and maps I one-to-one and onto another interval I D .˛; ˇ/. The function
has an inverse, which we will denote by . Since f 2 C k .I /, D f 0 2 C k 1 .I /, and
2 C k 1 .I /:
Next we introduce a change of variables by setting D .x/ D f 0 .x/. Define
(7.1.1) f ./ D x f .x/; where x D ./.
Definition 7.1. The function f ./ defined in (7.1.1) is called the Legendre transform of
f.
If we set x D ./, then
f ./ D ./ f . .//:
If we compute the differential of f in (7.1.1) we get
df D x d C dx f 0 .x/ dx D x d ;
since D f 0 .x/: Therefore,
df
(7.1.2) DxD ./:
d
Since f 0 D 2 Ck 1
.I / we see that f 2 C k .I /.
Remark 7.2. Computing the Legendre transform of a function f is a two step process.
(1) Solve the equation D f 0 .x/ for x D ./.
(2) Set f ./ D x f .x/:
1 ˛
Example 7.3. f .x/ D x on I D .0; 1/, where ˛ > 1.
˛
First solve D f 0 .x/ D x ˛ 1
to get x D 1=.˛ 1/
: Then
˛
x 1 ˛=.˛ 1
f ./ D x D 1=.˛ 1/
1/
D 1 .˛ 1/=˛
:
˛ ˛ ˛
81
82 7. THE HAMILTONIAN APPROACH TO THE CALCULUS OF VARIATIONS
Proposition 7.4. f D f:
Remark 7.5. We sum up this proposition by saying that the Legendre transform is an
involution.
General assumption: The gradient mapping .x/ D rf .x/ maps one-to-one and onto
an open set , and 1 2 C k 1 . ; /.
Unlike in one variable, where we needed only to assume that f 00 .x/ > 0, there is not
one condition that is easy to verify, meets all of our needs, and ensures that the general
assumption is satisfied. However, let’s pursue the issue a little. The Hessian of f is the
N N matrix 2
@ f
Hf .x/ D .x/ :
@xi @xj
Since D rf , we see that
@j
Hf .x/ D .x/ D D.x/:
@xi
In order that be one-to-one, it is necessary that D.x/ D Hf .x/ be invertible for all
x. On the other hand, if D.x0 / is invertible, then the inverse function theorem (see
Theorem A.17) tells us that there is an open set U with x0 2 U such that maps U one-
to-one and onto an open set U , with 1 2 C k 1 .U ; U /. Thus the general assumption
is satisfied locally if the Hessian is invertible. In addition there is the following global
result.
Theorem 7.12. Suppose that RN is a convex open set, and f 2 C k ./, where
k 2. If the Hessian matrix Hf .x/ is positive definite for all x 2 , then the gradient
map .x/ D rf .x/ satisfies the general assumption.
This result prompts a definition.
Definition 7.13. The function f is uniformly convex if , the domain of f , is convex
and the Hessian matrix Hf .x/ is positive definite for all x 2 . (A matrix A is positive
definite if .Ax/ x > 0 for all x ¤ 0:)
Consequently, if f is uniformly convex, the general assumption is satisfied. However,
there are other situations where we want to use the Legendre transformation and f is not
uniformly convex, so we will simply assume that f satisfies the general assumption.
1
Definition 7.14. Suppose that f satisfies the general assumption and set D . The
Legendre transform of f is defined by
(1) solving D .x/ for x D ./, and then
(2) setting f ./ D x f .x/:
We will refer to the coordinates x D .x1 ; x2 ; : : : ; xN / as the original coordinates,
while D .1 ; 2 ; : : : ; N / will be the conjugate coordinates. The symbol x is the
standard dot product, so
f ./ D x f .x/ D x1 1 C x2 2 C C xN N f .x/:
Proposition 7.15. f 2 C k . / and rf ./ D ./ D x:
84 7. THE HAMILTONIAN APPROACH TO THE CALCULUS OF VARIATIONS
This means that if D .x/ then the matrix product Hf ./Hf .x/ D I . Thus Hf ./
is the matrix inverse of Hf .x/. Since Hf .x/ is positive definite, so is its inverse Hf ./.
To see this, suppose the matrix A is positive definite, and y ¤ 0. Since A is invertible,
there is an x such that Ax D y. Then .A 1 y/ y D .A 1 Ax/ .Ax/ D x .Ax/ > 0.
Now we have,
Corollary 7.17. If f is uniformly convex, and D ./ is convex, then f is uniformly
convex.
Remark 7.18. The additional assumption that is convex is necessary. We will present
an example in the exercises.
We will leave the next result as an exercise.
Proposition 7.19. The Legendre transform is an involution.
Because of this fact, it is good to write
(7.2.1) f .x/ C f ./ D x; where rf .x/ D and rf ./ D x,
to illustrate the involutive nature of the Legendre transform.
We will also leave the next two results as exercises.
Proposition 7.20. Suppose that f 2 C 2 ./ satisfies Hf .x/ > 0 for all x 2 , and that
is convex. Then f ./ D maxy2 . y f .y// for all 2 .
7.3. THE HAMILTONIAN APPROACH 85
Corollary 7.21. Suppose that both f and f are uniformly convex. Then x f .x/ C
f ./ for all x 2 and 2 .
Again, this is called Young’s inequality.
Set .x; u; p/ D rp F .x; u; p/ D . The new variables are the variables conjugate
to p. They are sometimes referred to as the canonical momenta. Then we have the map
.x; u; p/ ! .x; u; .x; u; p// D .x; u; /;
86 7. THE HAMILTONIAN APPROACH TO THE CALCULUS OF VARIATIONS
We conclude that
(7.3.3) Hx D Fx ; Huj D Fuj ; and Hj D pj :
These equations are referred to as the Hamiltonian partials.
Next we look at the Euler-Lagrange equations in the Hamiltonian formulation. Com-
bining (7.3.1) and (7.3.3) we see that u0j D pj D Hj . Next, since by definition
Fpj D j , j0 D Fuj D Huj : To sum up, the Euler-Lagrange equations become
duj
D Hj
(7.3.4) dx for j D 1; 2; : : : ; N .
d j
D Huj
dx
The equations in (7.3.4) are called the Hamiltonian form of the Euler-Lagrange equations,
or simply the Hamiltonian equations. The Hamiltonian equations in vector form are
du
D r H
(7.3.5) dt
d
D ru H:
dt
Remark 7.22. Suppose we have a broken extremal for the Lagrangian F . In the Hamil-
tonian formulation, we see that the Erdmann corner conditions require that the generalized
momentum D rp F and the Hamiltonian H D p rp F F must be continuous.
p
Example 7.23. F .x; u; p/ D !.x; u/ 1 C p 2 , N D 1:
7.3. THE HAMILTONIAN APPROACH 87
x D .x1 ; x2 ; : : : ; xN / D .x1 ; y1 ; z1 ; x2 ; y2 ; z2 ; : : : ; xN ; yN ; zN /:
The particles are under the control of a conservative force, so there is a potential function
U.t; x/, such that the force on the j th particle is
@U @U @U
Fj D rxj U D ; ; :
@xj @yj @zj
The Lagrangian for the system is
N
X 1
L.t; x; v/ D T U D mj jvj j2 U.t; x/:
2
j D1
Hamilton’s principle tells us that allowable motions are extrema for the Lagrangian L.
Let’s see what the Hamiltonian formulation looks like. First we introduce the canonical
momenta D rv F . If we look at the j th particle we get
j D m j vj :
Thus the canonical momenta are simply the ordinary momenta. Consequently, in physical
situations we will use p to denote the momenta, and we have pj D mj vj : The inverse is
vj D m1j pj :
88 7. THE HAMILTONIAN APPROACH TO THE CALCULUS OF VARIATIONS
The Hamiltonian is
H Dpv L
0 1
N N
@1
X X
D pj vj mj jvj j2 U.t; x/A
2
j D1 j D1
N N
(7.3.6) X 1 1X jpj j2
D jpj j2 mj 2 C U.t; x/
mj 2 mj
j D1 j D1
N
1 X 1
D jpj j2 C U.t; x/:
2 mj
j D1
only on the distances between the particles jxj xk j for 1 j < k N . A computation
shows that the total force on the system satisfies
N
X N
X
Fj D rxj U D 0:
j D1 j D1
PN
Then if p D j D1 pj is the total momentum, the Hamiltonian equations imply that
N N
dp X d pj X
D D Fj D 0:
dt dt
j D1 j D1
to a Hamiltonian which does not depend explicitly on . We will look for more conserved
quantities by changing variables.
D Gx C ru G u0 dx:
We now apply Propositions 7.5.6 and 7.32 to the Poincaré-Cartan integral defined
in (7.5.7). Notice that
N
X
(7.5.8) FH .x; u; ; p; q/ dx D j duj H dx:
j D1
We will call this the Poincaré-Cartan form associated with H . We will be interested in
functions G such that the modified form
N
X
(7.5.9) FH dx D FH dx C dG D j duj H dx C dG
j D1
is the Poincaré-Cartan form for another Hamiltonian H in a new coordinate system re-
lated to the old by a transformation of phase space of the form in (7.5.1) . If this is so,
then by Proposition 7.32 FH and FH have the same extremals. Since the Euler-Lagrange
equations for FH and FH are the Hamiltonian systems associated with H and H re-
spectively, we see that these two systems have the same solutions.
In symbols we want
N
X
(7.5.10) FH D FH D j duj H dx:
j D1
We can use (7.5.11) to generate the transformation in (7.5.1), and therefore we will
call G a generating function for the canonical transformation. G is only required to be a
function in C 3 .I RN RN /. It can be expressed in terms of any combination of the
original variables and the starred variables. We will examine each case individually.
Case 1. G D G.x; u; u /
We have
N
X N
X
(7.5.12) dG D Gx dx C Guj duj C Guj duj :
j D1 j D1
Example 7.34. Our first example shows that the separation between the variables u and
is largely superficial when we allow transformations of phase space. let
N
X
G.u; u / D uj uj :
j D1
To find the canonical transformation we first solve (7.5.22) for u , and then substitute
into (7.5.23) to find .
Example 7.37. This is similar to Example 7.36, but now we assume that we have a trans-
formation of configuration space in the form
xDx u D u.x; u /:
We set GQ D
PN
kD1 uk .x; u /k : To find the canonical transformation, we solve u D
r GQ D u.x; u / for u , and then set D ru GQ D Du :
Example 7.38. Let’s illustrate the preceding example by looking at polar coordinates.
In that case the independent variable is t, u D .x; y/, and u D .r; /. Then u D
.r cos ; r sin /. We will denote the momenta by corresponding subscripts. Then accord-
ing to the preceding example, we have
Q ; x ; y / D r cos x C r sin y :
G.r;
From (7.5.22) we get x D r cos and y D r sin , as expected. we solve for
p y
r D x 2 C y 2 and tan D :
x
Then from (7.5.23) we get
xx C yy
r D and D xy yx :
r
7.5.4. Case 4. G D G.x; ; /
We use GQ D G C N
P PN
j D1 j uj j D1 j uj , and proceed as before.
into one with Hamiltonian H which is easier to solve. The simplest such system is when
the Hamiltonian is H .x; u ; / D 0; in which case the system is
duj
D0 for 1 j N
dx
d j
D 0 for 1 j N
dx
for which the solutions are uj D ˛j and j D ˇj for 1 j N , where ˛j and ˇj are
constants. This is a complete solution to the problem.
(7.6.5) becomes r˛ S.x; u; ˛/ D ˇ. Assuming that we can solve this system, we have the
solutions to our original Hamiltonian system.
Let’s restate this as a theorem.
Theorem 7.39. Suppose that S.x; u; ˛/ is a complete solution to the Hamilton-Jacobi
equation
(7.6.7) Sx C H.x; u; ru S / D 0:
Then if ˇ D .ˇ1 ; ˇ2 ; : : : ; ˇN / is a constant vector, we get a complete solution to the
Hamiltonian system in (7.6.1) by solving the equation
(7.6.8) r˛ S.x; u; ˛/ D ˇ
for u D u.x; ˛; ˇ/; and then setting
(7.6.9) D .x; ˛; ˇ/ D ru S.x; u.x; ˛; ˇ/; ˛/:
Thus we have a three step method of solving a Hamiltonian system. First we solve
the Hamilton-Jacobi equation (7.6.7). Next we solve equation (7.6.8), and finally we use
equation (7.6.9).
It may seem that we have substituting the hard problem of solving a Hamiltonian sys-
tem with the problem of solving the Hamilton-Jacobi equation, which is at least equally
hard. However, there are many cases where solving the Hamilton-Jacobi equation is possi-
ble and leads to solutions of Hamiltonian systems where other methods are not applicable.
We will illustrate this in the following sections.
This sum of a function of t and a function of x can be constant only if each is constant.
Hence there is a constant ˛ such that
1 0 2 1 2
(7.6.10) f 0 .t/ D ˛ and g .x/ C kx D ˛:
2m 2
The first of these equations has solution f .t/ D ˛t. On the other hand, b the
Hamilton-Jacobi equation
˛ D f 0 .t/ D St D H.t; x.t// D E:
Thus ˛ D E, which we know is constant by conservation of energy, and f .t/ D Et.
If we solve the second equation in (7.6.10) for g 0 we get
p
r
0 2˛
g .x/ D mk x2 :
k
Hence Z p r
2˛
g.x/ D mk x 2 dx;
k
and our solution to the Hamilton-Jacobi equation is2
p Z r
2˛
S.t; x/ D mk x 2 dx ˛t:
k
The next step in the process is to introduce a new parameter ˇ and to solve the equation
ˇ D S˛ .t; x/ for u. We get
ˇ
r
m dx
ˇ D S˛ D q t
k 2˛
x 2
k