Introduction to the Calculus of Variations

by Peter J. Olver
University of Minnesota

1. Introduction.
Minimization principles form one of the most wide-ranging means of formulating math-
ematical models governing the equilibrium configurations of physical systems. Moreover,
many popular numerical integration schemes such as the powerful finite element method
are also founded upon a minimization paradigm. In these notes, we will develop the basic
mathematical analysis of nonlinear minimization principles on infinite-dimensional function
spaces — a subject known as the “calculus of variations”, for reasons that will be explained
as soon as we present the basic ideas. Classical solutions to minimization problems in the
calculus of variations are prescribed by boundary value problems involving certain types
of differential equations, known as the associated Euler–Lagrange equations. The math-
ematical techniques that have been developed to handle such optimization problems are
fundamental in many areas of mathematics, physics, engineering, and other applications.
In this chapter, we will only have room to scratch the surface of this wide ranging and
lively area of both classical and contemporary research.
The history of the calculus of variations is tightly interwoven with the history of
mathematics. The field has drawn the attention of a remarkable range of mathematical
luminaries, beginning with Newton, then initiated as a subject in its own right by the
Bernoulli family. The first major developments appeared in the work of Euler, Lagrange
and Laplace. In the nineteenth century, Hamilton, Dirichlet and Hilbert are but a few of
the outstanding contributors. In modern times, the calculus of variations has continued
to occupy center stage, witnessing major theoretical advances, along with wide-ranging
applications in physics, engineering and all branches of mathematics.
Minimization problems that can be analyzed by the calculus of variations serve to char-
acterize the equilibrium configurations of almost all continuous physical systems, ranging
through elasticity, solid and fluid mechanics, electro-magnetism, gravitation, quantum me-
chanics, string theory, and many, many others. Many geometrical configurations, such as
minimal surfaces, can be conveniently formulated as optimization problems. Moreover,
numerical approximations to the equilibrium solutions of such boundary value problems
are based on a nonlinear finite element approach that reduces the infinite-dimensional min-
imization problem to a finite-dimensional problem. See [13; Chapter 11] for full details.
Just as the vanishing of the gradient of a function of several variables singles out the
critical points, among which are the minima, both local and global, so a similar “func-
tional gradient” will distinguish the candidate functions that might be minimizers of the
functional. The finite-dimensional calculus leads to a system of algebraic equations for the
critical points; the infinite-dimensional functional analog results a boundary value prob-
lem for a nonlinear ordinary or partial differential equation whose solutions are the critical

6/8/15 1 c 2015 Peter J. Olver

 Figure 1. The Shortest Path is a Straight Line.

functions for the variational problem. So, the passage from finite to infinite dimensional
nonlinear systems mirrors the transition from linear algebraic systems to boundary value
problems.

2. Examples of Variational Problems.

The best way to appreciate the calculus of variations is by introducing a few concrete
examples of both mathematical and practical importance. Some of these minimization
problems played a key role in the historical development of the subject. And they still
serve as an excellent means of learning its basic constructions.

Minimal Curves, Optics, and Geodesics

The minimal curve problem is to find the shortest path between two specified locations.
In its simplest manifestation, we are given two distinct points

a = (a, α) and b = (b, β) in the plane R2, (2.1)

and our task is to find the curve of shortest length connecting them. “Obviously”, as you
learn in childhood, the shortest route between two points is a straight line; see Figure 1.
Mathematically, then, the minimizing curve should be the graph of the particular affine
function†
β−α
y = cx + d = (x − a) + α (2.2)
b−a
that passes through or interpolates the two points. However, this commonly accepted
“fact” — that (2.2) is the solution to the minimization problem — is, upon closer inspec-
tion, perhaps not so immediately obvious from a rigorous mathematical standpoint.
Let us see how we might formulate the minimal curve problem in a mathematically
precise way. For simplicity, we assume that the minimal curve is given as the graph of

†
We assume that a 6= b, i.e., the points a, b do not lie on a common vertical line.

6/8/15 2 c 2015 Peter J. Olver

a smooth function y = u(x). Then, the length of the curve is given by the standard arc
length integral
Z bp
J[ u ] = 1 + u′ (x)2 dx, (2.3)
a
′
where we abbreviate u = du/dx. The function u(x) is required to satisfy the boundary
conditions
u(a) = α, u(b) = β, (2.4)
in order that its graph pass through the two prescribed points (2.1). The minimal curve
problem asks us to find the function y = u(x) that minimizes the arc length functional
(2.3) among all “reasonable” functions satisfying the prescribed boundary conditions. The
reader might pause to meditate on whether it is analytically obvious that the affine function
(2.2) is the one that minimizes the arc length integral (2.3) subject to the given boundary
conditions. One of the motivating tasks of the calculus of variations, then, is to rigorously
prove that our everyday intuition is indeed correct.
Indeed, the word “reasonable” is important. For the arc length functional (2.3) to
be defined, the function u(x) should be at least piecewise C1 , i.e., continuous with a
piecewise continuous derivative. Indeed, if we were to allow discontinuous functions, then
the straight line (2.2) does not, in most cases, give the minimizer. Moreover, continuous
functions which are not piecewise C1 need not have a well-defined arc length. The more
seriously one thinks about these issues, the less evident the “obvious” solution becomes.
But before you get too worried, rest assured that the straight line (2.2) is indeed the true
minimizer. However, a fully rigorous proof of this fact requires a careful development of
the mathematical machinery of the calculus of variations.
A closely related problem arises in geometrical optics. The underlying physical prin-
ciple, first formulated by the seventeenth century French mathematician Pierre de Fermat,
is that, when a light ray moves through an optical medium, it travels along a path that
minimizes the travel time. As always, Nature seeks the most economical† solution. In
an inhomogeneous planar optical medium, the speed of light, c(x, y), varies from point to
point, depending on the optical properties. Speed equals the time derivative of distance
traveled, namely, the arc length of the curve y = u(x) traced by the light ray. Thus,
ds p dx
c(x, u(x)) = = 1 + u′ (x)2 .
dt dt
Integrating from start to finish, we conclude that the total travel time along the curve is
equal to
Z T Z b Z bp
dt 1 + u′ (x)2
T[u] = dt = dx = dx. (2.5)
0 a dx a c(x, u(x))
Fermat’s Principle states that, to get from point a = (a.α) to point b = (b, β), the light
ray follows the curve y = u(x) that minimizes this functional subject to the boundary
conditions
u(a) = α, u(b) = β,

†
Assuming time = money!

6/8/15 3 c 2015 Peter J. Olver

 a

Figure 2. Geodesics on a Cylinder.

If the medium is homogeneous, e.g., a vacuum‡ , then c(x, y) ≡ c is constant, and T [ u ] is

a multiple of the arc length functional (2.3), whose minimizers are the “obvious” straight
lines traced by the light rays. In an inhomogeneous medium, the path taken by the
light ray is no longer evident, and we are in need of a systematic method for solving the
minimization problem. Indeed, all of the known laws of geometric optics, lens design,
focusing, refraction, aberrations, etc., will be consequences of the geometric and analytic
properties of solutions to Fermat’s minimization principle, [3].
Another minimization problem of a similar ilk is to construct the geodesics on a curved
surface, meaning the curves of minimal length. Given two points a, b lying on a surface
S ⊂ R 3 , we seek the curve C ⊂ S that joins them and has the minimal possible length.
For example, if S is a circular cylinder, then there are three possible types of geodesic
curves: straight line segments parallel to the center line; arcs of circles orthogonal to the
center line; and spiral helices, the latter illustrated in Figure 2. Similarly, the geodesics
on a sphere are arcs of great circles. In aeronautics, to minimize distance flown, airplanes
follow geodesic circumpolar paths around the globe. However, both of these claims are in
need of mathematical justification.
In order to mathematically formulate the geodesic minimization problem, we suppose,
for simplicity, that our surface S ⊂ R 3 is realized as the graph† of a function z = F (x, y).
We seek the geodesic curve C ⊂ S that joins the given points

a = (a, α, F (a, α)), and b = (b, β, F (b, β)), lying on the surface S.

Let us assume that C can be parametrized by the x coordinate, in the form

y = u(x), z = v(x) = F (x, u(x)),

‡
In the absence of gravitational effects due to general relativity.
†
Cylinders are not graphs, but can be placed within this framework by passing to cylindrical
coordinates. Similarly, spherical surfaces are best treated in spherical coordinates. In differential
geometry, [ 6 ], one extends these constructions to arbitrary parametrized surfaces and higher
dimensional manifolds.

6/8/15 4 c 2015 Peter J. Olver

where the last equation ensures that it lies in the surface S. In particular, this requires
a 6= b. The length of the curve is supplied by the standard three-dimensional arc length
integral. Thus, to find the geodesics, we must minimize the functional
Z bs  2  2
dy dz
J[ u ] = 1+ + dx
a dx dx
Z bs  2   (2.6)
du ∂F ∂F du 2
= 1+ + (x, u(x)) + (x, u(x)) dx,
a dx ∂x ∂u dx
subject to the boundary conditions u(a) = α, u(b) = β. For example, geodesics on the
paraboloid
z = 21 x2 + 12 y 2 (2.7)
can be found by minimizing the functional
Z bp
J[ u ] = 1 + (u′ )2 + (x + u u′ )2 dx. (2.8)
a

Minimal Surfaces
The minimal surface problem is a natural generalization of the minimal curve or
geodesic problem. In its simplest manifestation, we are given a simple closed curve C ⊂ R 3 .
The problem is to find the surface of least total area among all those whose boundary is
the curve C. Thus, we seek to minimize the surface area integral
ZZ
area S = dS
S

over all possible surfaces S ⊂ R 3 with the prescribed boundary curve ∂S = C. Such an
area–minimizing surface is known as a minimal surface for short. For example, if C is a
closed plane curve, e.g., a circle, then the minimal surface will just be the planar region
it encloses. But, if the curve C twists into the third dimension, then the shape of the
minimizing surface is by no means evident.
Physically, if we bend a wire in the shape of the curve C and then dip it into soapy
water, the surface tension forces in the resulting soap film will cause it to minimize surface
area, and hence be a minimal surface† . Soap films and bubbles have been the source of
much fascination, physical, æsthetical and mathematical, over the centuries. The minimal
surface problem is also known as Plateau’s Problem, named after the nineteenth century
French physicist Joseph Plateau who conducted systematic experiments on such soap films.
A satisfactory mathematical solution to even the simplest version of the minimal surface
problem was only achieved in the mid twentieth century, [10, 11]. Minimal surfaces and

†
More accurately, the soap film will realize a local but not necessarily global minimum for
the surface area functional. Nonuniqueness of local minimizers can be realized in the physical
experiment — the same wire may support more than one stable soap film.

6/8/15 5 c 2015 Peter J. Olver

 C

∂Ω

Figure 3. Minimal Surface.

related variational problems remain an active area of contemporary research, and are of
importance in engineering design, architecture, and biology, including foams, domes, cell
membranes, and so on.
Let us mathematically formulate the search for a minimal surface as a problem in
the calculus of variations. For simplicity, we shall assume that the bounding curve C
projects down to a simple closed curve Γ = ∂Ω that bounds an open domain Ω ⊂ R 2 in
the (x, y) plane, as in Figure 3. The space curve C ⊂ R 3 is then given by z = g(x, y) for
(x, y) ∈ Γ = ∂Ω. For “reasonable” boundary curves C, we expect that the minimal surface
S will be described as the graph of a function z = u(x, y) parametrized by (x, y) ∈ Ω.
According to the basic calculus, the surface area of such a graph is given by the double
integral
ZZ s  2  2
∂u ∂u
J[ u ] = 1+ + dx dy. (2.9)
Ω ∂x ∂y

To find the minimal surface, then, we seek the function z = u(x, y) that minimizes the
surface area integral (2.9) when subject to the Dirichlet boundary conditions

u(x, y) = g(x, y) for (x, y) ∈ ∂Ω. (2.10)

As we will see, (5.10), the solutions to this minimization problem satisfy a complicated
nonlinear second order partial differential equation.
A simple version of the minimal surface problem, that still contains some interesting
features, is to find minimal surfaces with rotational symmetry. A surface of revolution is
obtained by revolving a plane curve about an axis, which, for definiteness, we take to be
the x axis. Thus, given two points a = (a, α), b = (b, β) ∈ R 2 , the goal is to find the curve
y = u(x) joining them such that the surface of revolution obtained by revolving the curve
around the x-axis has the least surface area. Each cross-section of the resulting surface is
a circle centered on the x axis. The area of such a surface of revolution is given by
Z b p
J[ u ] = 2π | u | 1 + (u′ )2 dx. (2.11)
a

6/8/15 6 c 2015 Peter J. Olver

We seek a minimizer of this integral among all functions u(x) that satisfy the fixed bound-
ary conditions u(a) = α, u(b) = β. The minimal surface of revolution can be physically
realized by stretching a soap film between two circular wires, of respective radius α and β,
that are held a distance b − a apart. Symmetry considerations will require the minimizing
surface to be rotationally symmetric. Interestingly, the revolutionary surface area func-
tional (2.11) is exactly the same as the optical functional (2.5) when the light speed at a
point is inversely proportional to its distance from the horizontal axis: c(x, y) = 1/(2 π | y |).
Isoperimetric Problems and Constraints
The simplest isoperimetric problem is to construct the simple closed plane curve of a
fixed length ℓ that encloses the domain of largest area. In other words, we seek to maximize
ZZ I
area Ω = subject to the constraint length ∂Ω = = ℓ,
Ω ∂Ω

over all possible domains Ω ⊂ R 2 . Of course, the “obvious” solution to this problem is that
the curve must be a circle whose perimeter is ℓ, whence the name “isoperimetric”. Note
that the problem, as stated, does not have a unique solution, since if Ω is a maximizing
domain, any translated or rotated version of Ω will also maximize area subject to the
length constraint.
To make progress on the isoperimetric problem, let us assume that the boundary curve
T
is parametrized by its arc length, so x(s) = ( x(s), y(s) ) with 0 ≤ s ≤ ℓ, subject to the
requirement that
 2  2
dx dy
+ = 1. (2.12)
ds ds
We can compute the area of the domain by a line integral around its boundary,
I Z ℓ
dy
area Ω = x dy = x ds, (2.13)
∂Ω 0 ds
and thus we seek to maximize the latter integral subject to the arc length constraint (2.12).
We also impose periodic boundary conditions

x(0) = x(ℓ), y(0) = y(ℓ), (2.14)

that guarantee that the curve x(s) closes up. (Technically, we should also make sure that
x(s) 6= x(s′ ) for any 0 ≤ s < s′ < ℓ, ensuring that the curve does not cross itself.)
A simpler isoperimetric problem, but one with a less evident solution, is the following.
Among all curves of length ℓ in the upper half plane that connect two points (−a, 0) and
(a, 0), find the one that, along with the interval [ − a, a ], encloses the region having the
largest area. Of course, we must take ℓ ≥ 2 a, as otherwise the curve will be too short
to connect the points. In this case, we assume the curve is represented by the graph of a
non-negative function y = u(x), and we seek to maximize the functional
Z a Z ap
u dx subject to the constraint 1 + u′2 dx = ℓ. (2.15)
−a −a

6/8/15 7 c 2015 Peter J. Olver

In the previous formulation (2.12), the arc length constraint was imposed at every point,
whereas here it is manifested as an integral constraint. Both types of constraints, pointwise
and integral, appear in a wide range of applied and geometrical problems. Such constrained
variational problems can profitably be viewed as function space versions of constrained
optimization problems. Thus, not surprisingly, their analytical solution will require the
introduction of suitable Lagrange multipliers.

3. The Euler–Lagrange Equation.

Even the preceding limited collection of examples of variational problems should al-
ready convince the reader of the tremendous practical utility of the calculus of variations.
Let us now discuss the most basic analytical techniques for solving such minimization
problems. We will exclusively deal with classical techniques, leaving more modern direct
methods — the function space equivalent of gradient descent and related methods — to a
more in–depth treatment of the subject, [5].
Let us concentrate on the simplest class of variational problems, in which the unknown
is a continuously differentiable scalar function, and the functional to be minimized depends
upon at most its first derivative. The basic minimization problem, then, is to determine a
suitable function y = u(x) ∈ C1 [ a, b ] that minimizes the objective functional
Z b
J[ u ] = L(x, u, u′ ) dx. (3.1)
a

The integrand is known as the Lagrangian for the variational problem, in honor of La-
grange, one of the main founders of the subject. We usually assume that the Lagrangian
L(x, u, p) is a reasonably smooth function of all three of its (scalar) arguments x, u, and
p, which represents the derivativepu′ . For example, the arc length functional (2.3) has
Lagrangian function L(x, u, p) = p 1 + p2 , whereas in the surface of revolution problem
(2.11), we have L(x, u, p) = 2 π | u | 1 + p2 . (In the latter case, the points where u = 0
are slightly problematic, since L is not continuously differentiable there.)
In order to uniquely specify a minimizing function, we must impose suitable boundary
conditions. All of the usual suspects — Dirichlet (fixed), Neumann (free), as well as mixed
and periodic boundary conditions — are also relevant here. In the interests of brevity, we
shall concentrate on the Dirichlet boundary conditions

u(a) = α, u(b) = β, (3.2)

although some of the exercises will investigate other types of boundary conditions.
The First Variation
The (local) minimizers of a (sufficiently nice) objective function defined on a finite-
dimensional vector space are initially characterized as critical points, where the objective
function’s gradient vanishes. An analogous construction applies in the infinite-dimensional
context treated by the calculus of variations. Every sufficiently nice minimizer of a suffi-
ciently nice functional J[ u ] is a “critical function”, Of course, not every critical point turns
out to be a minimum — maxima, saddles, and many degenerate points are also critical.

6/8/15 8 c 2015 Peter J. Olver

The characterization of nondegenerate critical points as local minima or maxima relies on
the second derivative test, whose functional version, known as the second variation, will
be is the topic of the following Section 4.
But we are getting ahead of ourselves. The first order of business is to learn how
to compute the gradient of a functional defined on an infinite-dimensional function space.
The general definition of the gradient requires that we first impose an inner product h u ; v i
on the underlying function space. The gradient ∇J[ u ] of the functional (3.1) will then be
defined by the same basic directional derivative formula:

d
h ∇J[ u ] ; v i = J[ u + t v ] . (3.3)
dt t=0

Here v(x) is a function that prescribes the “direction” in which the derivative is computed.
Classically, v is known as a variation in the function u, sometimes written v = δu, whence
the term “calculus of variations”. Similarly, the gradient operator on functionals is often
referred to as the variational derivative, and often written δJ. The inner product used in
(3.3) is usually taken (again for simplicity) to be the standard L2 inner product
Z b
hf ;gi = f (x) g(x) dx (3.4)
a

on function space. Indeed, while the formula for the gradient will depend upon the under-
lying inner product, the characterization of critical points does not, and so the choice of
inner product is not significant here.
Now, starting with (3.1), for each fixed u and v, we must compute the derivative of
the function Z b
h(t) = J[ u + t v ] = L(x, u + t v, u′ + t v ′ ) dx. (3.5)
a

Assuming sufficient smoothness of the integrand allows us to bring the derivative inside
the integral and so, by the chain rule,
Z b
′ d d
h (t) = J[ u + t v ] = L(x, u + t v, u′ + t v ′ ) dx
dt a dt
Z b 
∂L ′ ′ ′ ∂L ′ ′
= v (x, u + t v, u + t v ) + v (x, u + t v, u + t v ) dx.
a ∂u ∂p
Therefore, setting t = 0 in order to evaluate (3.3), we find
Z b 
∂L ′ ′ ∂L ′
h ∇J[ u ] ; v i = v (x, u, u ) + v (x, u, u ) dx. (3.6)
a ∂u ∂p
The resulting integral often referred to as the first variation of the functional J[ u ]. The
condition
h ∇J[ u ] ; v i = 0
for a minimizer is known as the weak form of the variational principle.

6/8/15 9 c 2015 Peter J. Olver

 To obtain an explicit formula for ∇J[ u ], the right hand side of (3.6) needs to be
written as an inner product,
Z b Z b
h ∇J[ u ] ; v i = ∇J[ u ] v dx = h v dx
a a

between some function h(x) = ∇J[ u ] and the variation v. The first summand has this
form, but the derivative v ′ appearing in the second summand is problematic. However,
one can easily move derivatives around inside an integral through integration by parts. If
we set
∂L
r(x) ≡ (x, u(x), u′ (x)),
∂p
we can rewrite the offending term as
Z b Z b
′
 
r(x) v (x) dx = r(b) v(b) − r(a) v(a) − r ′ (x) v(x) dx, (3.7)
a a

where, again by the chain rule,

 
′ d ∂L ′ ∂ 2L ∂ 2L ∂ 2L
r (x) = (x, u, u ) = (x, u, u′ ) + u′ (x, u, u′ ) + u′′ (x, u, u′ ) .
dx ∂p ∂x ∂p ∂u ∂p ∂p2
(3.8)
So far we have not imposed any conditions on our variation v(x). We are only com-
paring the values of J[ u ] among functions that satisfy the prescribed boundary conditions,
namely
u(a) = α, u(b) = β.
Therefore, we must make sure that the varied function u
b(x) = u(x) + t v(x) remains within
this set of functions, and so

u
b(a) = u(a) + t v(a) = α, u
b(b) = u(b) + t v(b) = β.
For this to hold, the variation v(x) must satisfy the corresponding homogeneous boundary
conditions
v(a) = 0, v(b) = 0. (3.9)
As a result, both boundary terms in our integration by parts formula (3.7) vanish, and we
can write (3.6) as
Z b Z b   
∂L ′ d ∂L ′
h ∇J[ u ] ; v i = ∇J[ u ] v dx = v (x, u, u ) − (x, u, u ) dx.
a a ∂u dx ∂p
Since this holds for all variations v(x), we conclude that
 
∂L ′ d ∂L ′
∇J[ u ] = (x, u, u ) − (x, u, u ) . (3.10)
∂u dx ∂p
This is our explicit formula for the functional gradient or variational derivative of the func-
tional (3.1) with Lagrangian L(x, u, p). Observe that the gradient ∇J[ u ] of a functional
is a function.

6/8/15 10 c 2015 Peter J. Olver

 The critical functions u(x) are, by definition, those for which the functional gradient
vanishes: satisfy
∂L d ∂L
∇J[ u ] = (x, u, u′ ) − (x, u, u′ ) = 0. (3.11)
∂u dx ∂p
In view of (3.8), the critical equation (3.11) is, in fact, a second order ordinary differential
equation,

∂L ∂ 2L ∂ 2L ∂ 2L
E(x, u, u′ , u′′ ) = (x, u, u′ ) − (x, u, u′ ) − u′ (x, u, u′ ) − u′′ (x, u, u′ ) = 0,
∂u ∂x ∂p ∂u ∂p ∂p2
(3.12)
known as the Euler–Lagrange equation associated with the variational problem (3.1), in
honor of two of the most important contributors to the subject. Any solution to the Euler–
Lagrange equation that is subject to the assumed boundary conditions forms a critical point
for the functional, and hence is a potential candidate for the desired minimizing function.
And, in many cases, the Euler–Lagrange equation suffices to characterize the minimizer
without further ado.

Theorem 3.1. Suppose the Lagrangian function is at least twice continuously dif-
ferentiable: L(x, u, p) ∈ C2 . Then any C2 minimizer u(x) to the corresponding functional
Z b
J[ u ] = L(x, u, u′ ) dx, subject to the selected boundary conditions, must satisfy the
a
associated Euler–Lagrange equation (3.11).

Let us now investigate what the Euler–Lagrange equation tells us about the examples
of variational problems presented at the beginning of this section. One word of caution:
there do exist seemingly reasonable functionals whose minimizers are not, in fact, C2 ,
and hence do not solve the Euler–Lagrange equation in the classical sense; see [2] for
examples. Fortunately, in most variational problems that arise in real-world applications,
such pathologies do not appear.

Curves of Shortest Length — Planar Geodesics

Let us return to the most elementary problem in the calculus of variations: finding
the curve of shortest length connecting two points a = (a, α), b = (b, β) ∈ R 2 in the
plane. As we noted in Section 3, such planar geodesics minimize the arc length integral
Z b p p
J[ u ] = 1 + (u′ )2 dx with Lagrangian L(x, u, p) = 1 + p2 ,
a

subject to the boundary conditions

u(a) = α, u(b) = β.

Since
∂L ∂L p
= 0, =p ,
∂u ∂p 1 + p2

6/8/15 11 c 2015 Peter J. Olver

the Euler–Lagrange equation (3.11) in this case takes the form
d u′ u′′
0 = − p = − .
dx 1 + (u′ )2 (1 + (u′ )2 )3/2
Since the denominator does not vanish, this is the same as the simplest second order
ordinary differential equation
u′′ = 0. (3.13)
Therefore, the solutions to the Euler–Lagrange equation are all affine functions, u = c x +
d, whose graphs are straight lines. Since our solution must also satisfy the boundary
conditions, the only critical function — and hence the sole candidate for a minimizer — is
the straight line
β−α
y= (x − a) + α (3.14)
b−a
passing through the two points. Thus, the Euler–Lagrange equation helps to reconfirm
our intuition that straight lines minimize distance.
Be that as it may, the fact that a function satisfies the Euler–Lagrange equation
and the boundary conditions merely confirms its status as a critical function, and does
not guarantee that it is the minimizer. Indeed, any critical function is also a candidate
for maximizing the variational problem, too. The nature of a critical function will be
elucidated by the second derivative test, and requires some further work. Of course, for
the minimum distance problem, we “know” that a straight line cannot maximize distance,
and must be the minimizer. Nevertheless, the reader should have a small nagging doubt
that we may not have completely solved the problem at hand . . .
Minimal Surface of Revolution
Consider next the problem of finding the curve connecting two points that generates
a surface of revolution of minimal surface area. For simplicity, we assume that the curve
is given by the graph of a non-negative function y = u(x) ≥ 0. According to (2.11), the
required curve will minimize the functional
Z b p p
J[ u ] = u 1 + (u′ )2 dx, with Lagrangian L(x, u, p) = u 1 + p2 , (3.15)
a

where we have omitted an irrelevant factor of 2 π and used positivity to delete the absolute
value on u in the integrand. Since
∂L p ∂L up
= 1 + p2 , =p ,
∂u ∂p 1 + p2
the Euler–Lagrange equation (3.11) is
p d u u′ 1 + (u′ )2 − u u′′
1+ (u′ )2 − p = = 0. (3.16)
dx 1 + (u′ )2 (1 + (u′ )2 )3/2
Therefore, to find the critical functions, we need to solve a nonlinear second order ordinary
differential equation — and not one in a familiar form.

6/8/15 12 c 2015 Peter J. Olver

 Fortunately, there is a little trick† we can use to find the solution. If we multiply the
equation by u′ , we can then rewrite the result as an exact derivative
 
′ 1 + (u′ )2 − u u′′ d u
u ′ 2 3/2
= p = 0.
(1 + (u ) ) dx 1 + (u′ )2
We conclude that the quantity
u
p = c, (3.17)
1 + (u′ )2
is constant, and so the left hand side is a first integral for the differential equation. Solving
for‡ √
du ′ u2 − c2
=u =
dx c
results in an autonomous first order ordinary differential equation, which we can immedi-
ately solve: Z
c du
√ = x + δ,
u2 − c2
where δ is a constant of integration. The most useful form of the left hand integral is in
terms of the inverse to the hyperbolic cosine function cosh z = 21 (ez + e−z ), whereby
 
−1 u x+δ
cosh = x + δ, and hence u = c cosh . (3.18)
c c
In this manner, we have produced the general solution to the Euler–Lagrange equation
(3.16). Any solution that also satisfies the boundary conditions provides a critical function
for the surface area functional (3.15), and hence is a candidate for the minimizer.
The curve prescribed by the graph of a hyperbolic cosine function (3.18) is known as
a catenary. It is not a parabola, even though to the untrained eye it looks similar. Owing
to their minimizing properties, catenaries are quite common in engineering design — for
instance a hanging chain has the shape of a catenary, while the arch in St. Louis is an
inverted catenary.
So far, we have not taken into account the boundary conditions It turns out that there
are three distinct possibilities, depending upon the configuration of the boundary points:
(a) There is precisely one value of the two integration constants c, δ that satisfies the two
boundary conditions. In this case, it can be proved that this catenary is the unique
curve that minimizes the area of its associated surface of revolution.
(b) There are two different possible values of c, δ that satisfy the boundary conditions. In
this case, one of these is the minimizer, and the other is a spurious solution — one
that corresponds to a saddle point for the surface area functional.

†
Actually, as with many tricks, this is really an indication that something profound is going on.
Noether’s Theorem, a result of fundamental importance in modern physics that relates symmetries
and conservation laws, [ 7, 12 ], underlies the integration method.
‡
The square root is real since, by (3.17), | u | ≤ | c |.

6/8/15 13 c 2015 Peter J. Olver

 (c) There are no values of c, δ that allow (3.18) to satisfy the two boundary conditions.
This occurs when the two boundary points a, b are relatively far apart. In this
configuration, the physical soap film spanning the two circular wires breaks apart
into two circular disks, and this defines the minimizer for the problem, i.e., unlike
cases (a) and (b), there is no surface of revolution that has a smaller surface area
than the two disks. However, the “function”§ that minimizes this configuration
consists of two vertical lines from the boundary points to the x axis, along with
that segment on the axis lying between them. More precisely, we can approximate
this function by a sequence of genuine functions that give progressively smaller
and smaller values to the surface area functional (2.11), but the actual minimum
is not attained among the class of (smooth) functions.
Thus, even in such a reasonably simple example, a number of the subtle complications
can already be seen. Lack of space precludes a more detailed development of the subject,
and we refer the interested reader to more specialized books on the calculus of variations,
including [4, 7, 9].
The Brachistochrone Problem
The most famous classical variational principle is the so-called brachistochrone prob-
lem. The compound Greek word “brachistochrone” means “minimal time”. An experi-
menter lets a bead slide down a wire that connects two fixed points. The goal is to shape
the wire in such a way that, starting from rest, the bead slides from one end to the other
in minimal time. Naı̈ve guesses for the wire’s optimal shape, including a straight line,
a parabola, a circular arc, or even a catenary are wrong. One can do better through a
careful analysis of the associated variational problem. The brachistochrone problem was
originally posed by the Swiss mathematician Johann Bernoulli in 1696, and served as an
inspiration for much of the subsequent development of the subject.
We take, without loss of generality, the starting point of the bead to be at the origin:
a = (0, 0). The wire will bend downwards, and so, to avoid distracting minus signs in the
subsequent formulae, we take the vertical y axis to point downwards. The shape of the
wire will be given by the graph of a function y = u(x) ≥ 0. The end point b = (b, β) is
assumed to lie below and to the right, and so b > 0 and β > 0. The set-up is sketched in
Figure 4.
To mathematically formulate the problem, the first step is to find the formula for the
transit time of the bead sliding along the wire. Arguing as in our derivation of the optics
functional (2.5), if v(x) denotes the instantaneous speed of descent of the bead when it
reaches position (x, u(x)), then the total travel time is
Z ℓ Z bp
ds 1 + (u′ )2
T[u] = = dx, (3.19)
0 v 0 v
where ℓ is the overall length of the wire.

§
Here “function” must be taken in a very broad sense, as this one does not even correspond
to a generalized function!

6/8/15 14 c 2015 Peter J. Olver

 Figure 4. The Brachistochrone Problem.

We shall use conservation of energy to determine a formula for the speed v as a

function of the position along the wire. The kinetic energy of the bead is 12 m v 2 , where
m is its mass. On the other hand, due to our sign convention, the potential energy of the
bead when it is at height y = u(x) is − m g u(x), where g the gravitational constant, and
we take the initial height as the zero potential energy level. The bead is initially at rest,
with 0 kinetic energy and 0 potential energy. Assuming that frictional forces are negligible,
conservation of energy implies that the total energy must remain equal to 0, and hence

0= 1
2 m v 2 − m g u.

We can solve this equation to determine the bead’s speed as a function of its height:
p
v = 2g u . (3.20)

Substituting this expression into (3.19), we conclude that the shape y = u(x) of the wire
is obtained by minimizing the functional
Z bs
1 + (u′ )2
T[u] = dx, (3.21)
0 2g u

subjet to the boundary conditions

u(0) = 0, u(b) = β. (3.22)

The associated Lagrangian is

r
1 + p2
L(x, u, p) = ,
u
√ 1
where we omit an irrelevant factor of 2 g (or adopt physical units in which g = 2 ). We
compute
p
∂L 1 + p2 ∂L p
= − , = p .
∂u 2 u3/2 ∂p u (1 + p2 )

6/8/15 15 c 2015 Peter J. Olver

Therefore, the Euler–Lagrange equation for the brachistochrone functional is
p
1 + (u′ )2 d u′ 2 u u′′ + (u′ )2 + 1
− − p = − p = 0. (3.23)
2 u3/2 dx u (1 + (u′ )2 ) 2 u (1 + (u′ )2 )
Thus, the minimizing functions solve the nonlinear second order ordinary differential equa-
tion
2 u u′′ + (u′ )2 + 1 = 0.
Rather than try to solve this differential equation directly, we note that the Lagrangian
does not depend upon x, and therefore we can use the following result.
Theorem 3.2. Suppose the Lagrangian L(x, u, p) = L(u, p) does not depend on x.
Then the Hamiltonian function
∂L
H(u, u′ ) = L(u, u′ ) − u′ (u, u′ ) (3.24)
∂p
is a first integral for the Euler–Lagrange equation, meaning that it is constant on each
solution.
Proof : Differentiating (3.24), we find
   
d ′ d ′ ′ ∂L ′ ′ ∂L ′ d ∂L ′
H(u, u ) = L(u, u ) − u (u, u ) = u (u, u ) − (u, u ) = 0 ,
dx dx ∂p ∂u dx ∂p
which vanishes as a consequence of the Euler–Lagrange equation (3.11). This implies that
the Hamiltonian function is constant, i.e.,
H(u, u′ ) = k, (3.25)
where k is a constant, whose value can depend upon the solution u(x). Equation (3.25)
has the form of an implicitly defined first order ordinary differential equation which can,
in fact, be integrated. Indeed, solving for
u′ = h(u, k)
produces an autonomous first order differential equation, whose general solution can be
obtained by integration. Q.E.D.
Remark : This result is a special case of Noether’s powerful Theorem, [12;Chapter
4], that relates symmetries of variational problems — in this case translations in the x
coordinate — with first integrals, a.k.a. conservation laws.
In our case, the Hamiltonian function (3.24) is
∂L 1
H(x, u, p) = L − p = p
∂p u(1 + p2 )
defines a first integral. Thus,
1
H(x, u, u′ ) = p = k, which we rewrite as u(1 + (u′ )2 ) = c,
u(1 + (u′ )2 )

6/8/15 16 c 2015 Peter J. Olver

 Figure 5. A Cycloid.

where c = 1/k 2 is a constant. (This can be checked by directly calculating dH/dx ≡ 0.)
Solving for the derivative u′ results in the first order autonomous ordinary differential
equation r
du c−u
= .
dx u
This equation can be explicitly solved by separation of variables, and so
Z r
u
du = x + k.
c−u
The left hand integration relies on the trigonometric substitution
1
u= 2 c (1 − cos θ),
whereby
Z r Z
1 1 − cos θ 1 1
x+k = 2
c sin θ dθ = 2
c (1 − cos θ) dθ = 2
c(θ − sin θ).
1 + cos θ
The left hand boundary condition implies k = 0, and so the solution to the Euler–Lagrange
equation are curves parametrized by

x = r(θ − sin θ), u = r(1 − cos θ). (3.26)

With a little more work, it can be proved that the parameter r = 21 c is uniquely prescribed
by the right hand boundary condition, and moreover, the resulting curve supplies the
global minimizer of the brachistochrone functional, [7]. The miniming curve is known as
a cycloid , which can be visualized as the curve traced by a point sitting on the edge of a
rolling wheel of radius r, as plotted in Figure 5. Interestingly, in certain configurations,
namely if β < 2 b/π, the cycloid that solves the brachistochrone problem dips below the
right hand endpoint b = (b, β), and so the bead is moving upwards when it reaches the
end of the wire.

4. The Second Variation.

The solutions to the Euler–Lagrange boundary value problem are the critical functions
for the variational principle, meaning that they cause the functional gradient to vanish.
For finite-dimensional optimization problems, being a critical point is only a necessary
condition for minimality. One must impose additional conditions, based on the second
derivative of the objective function at the critical point, in order to guarantee that it is
a minimum and not a maximum or saddle point. Similarly, in the calculus of variations,

6/8/15 17 c 2015 Peter J. Olver

the solutions to the Euler–Lagrange equation may also include (local) maxima, as well as
other non-extremal critical functions. To distinguish between the possibilities, we need to
formulate a second derivative test for the objective functional. In the calculus of variations,
the second derivative of a functional is known as its second variation, and the goal of this
section is to construct and analyze it in its simplest manifestation.
For a finite-dimensional objective function F (u1 , . . . , un ), the second derivative test
was based on the positive definiteness of its Hessian matrix. The justification was based
on the second order Taylor expansion of the objective function at the critical point. In
an analogous fashion, we expand an objective functional J[ u ] near the critical function.
Consider the scalar function
h(t) = J[ u + t v ],
where the function v(x) represents a variation. The second order Taylor expansion of h(t)
takes the form
1 2
h(t) = J[ u + t v ] = J[ u ] + t K[ u; v ] + 2
t Q[ u; v ] + · · · .
The first order terms are linear in the variation v, and, according to our earlier calculation,
given by an inner product
h′ (0) = K[ u; v ] = h ∇J[ u ] ; v i
between the variation and the functional gradient. In particular, if u is a critical function,
then the first order terms vanish,
K[ u; v ] = h ∇J[ u ] ; v i = 0
for all allowable variations v, meaning those that satisfy the homogeneous boundary con-
ditions. Therefore, the nature of the critical function u — minimum, maximum, or neither
— will, in most cases, be determined by the second derivative terms
h′′ (0) = Q[ u; v ].
Now, if u is a minimizer, then Q[ u; v ] ≥ 0. Conversely, if Q[ u; v ] > 0 for all v 6≡ 0, i.e.,
the second variation is positive definite, then the critical function u will be a strict local
minimizer. This forms the crux of the second derivative test.
Let us explicitly evaluate the second variational for the simplest functional (3.1).
Consider the scalar function
Z b
h(t) = J[ u + t v ] = L(x, u + t v, u′ + t v ′ ) dx,
a
′
whose first derivative h (0) was already determined in (3.6); here we require the second
variation Z b
′′
 
Q[ u; v ] = h (0) = A v 2 + 2 B v v ′ + C (v ′ )2 dx, (4.1)
a
where the coefficient functions
∂ 2L ∂ 2L ∂ 2L
A(x) = (x, u, u′ ) , B(x) = (x, u, u′ ) , C(x) = (x, u, u′ ) , (4.2)
∂u2 ∂u ∂p ∂p2

6/8/15 18 c 2015 Peter J. Olver

are found by evaluating certain second order derivatives of the Lagrangian at the critical
function u(x). In contrast to the first variation, integration by parts will not eliminate all of
the derivatives on v in the quadratic functional (4.1), which causes significant complications
in the ensuing analysis.
The second derivative test for a minimizer relies on the positivity of the second vari-
ation. So, in order to formulate conditions that the critical function be a minimizer for
the functional, we need to establish criteria guaranteeing the positive definiteness of such
a quadratic functional, meaning that Q[ u; v ] > 0 for all non-zero allowable variations
v(x) 6≡ 0. Clearly, if the integrand is positive definite at each point, so

A(x) v 2 + 2 B(x) v v ′ + C(x) (v ′ )2 > 0 whenever a < x < b, and v(x) 6≡ 0, (4.3)
then Q[ u; v ] > 0 is also positive definite.
Example p 4.1. For the arc length minimization functional (2.3), the Lagrangian is
L(x, u, p) = 1 + p2 . To analyze the second variation, we first compute

∂ 2L ∂2L ∂ 2L 1
= 0, = 0, = .
∂u2 ∂u ∂p ∂p 2 (1 + p2 )3/2
For the critical straight line function
β−α β−α
u(x) = (x − a) + α, with p = u′ (x) = ,
b−a b−a
we find
∂ 2L ∂2L ∂2L (b − a)3
A(x) = = 0, B(x) = = 0, C(x) = =  3/2 ≡ k.
∂u2 ∂u ∂p ∂p2 (b − a)2 + (β − α)2
Therefore, the second variation functional (4.1) is
Z b
Q[ u; v ] = k (v ′ )2 dx,
a

where k > 0 is a positive constant. Thus, Q[ u; v ] = 0 vanishes if and only if v(x) is a

constant function. But the variation v(x) is required to satisfy the homogeneous boundary
conditions v(a) = v(b) = 0, and hence Q[ u; v ] > 0 for all allowable nonzero variations.
Therefore, we conclude that the straight line is, indeed, a (local) minimizer for the arc
length functional. We have at last justified our intuition that the shortest distance between
two points is a straight line!
However, as the following example demonstrates, the pointwise positivity condition
(4.3) is overly restrictive.
Example 4.2. Consider the quadratic functional
Z 1
 ′ 2 
Q[ v ] = (v ) − v 2 dx. (4.4)
0

6/8/15 19 c 2015 Peter J. Olver

We claim that Q[ v ] > 0 for all nonzero v 6≡ 0 subject to homogeneous Dirichlet boundary
conditions v(0) = 0 = v(1). This result is not trivial! Indeed, the boundary conditions
play an essential role, since choosing v(x) ≡ c 6= 0 to be any constant function will produce
a negative value for the functional: Q[ v ] = − c2 .
To prove the claim, consider the quadratic functional
Z 1
e v] =
Q[ (v ′ + v tan x)2 dx ≥ 0,
0

which is clearly non-negative, since the integrand is everywhere ≥ 0. Moreover, by continu-

ity, the integral vanishes if and only if v satisfies the first order linear ordinary differential
equation
v ′ + v tan x = 0, for all 0 ≤ x ≤ 1.
The only solution that also satisfies boundary condition v(0) = 0 is the trivial one v ≡ 0.
We conclude that Q[ e v ] = 0 if and only if v ≡ 0, and hence Q[
e v ] is a positive definite
quadratic functional on the space of allowable variations.
Let us expand the latter functional,
Z 1
 ′ 2 
e
Q[ v ] = (v ) + 2 v v ′ tan x + v 2 tan2 x dx
0
Z 1 Z 1
 ′ 2 2 ′ 2 2
  
= (v ) − v (tan x) + v tan x dx = (v ′ )2 − v 2 dx = Q[ v ].
0 0

In the second equality, we integrated the middle term by parts, using (v 2 )′ = 2 v v ′ , and
noting that the boundary terms vanish owing to our imposed boundary conditions. Since
e v ] is positive definite, so is Q[ v ], justifying the previous claim.
Q[
To appreciate how subtle this result is, consider the almost identical quadratic func-
tional Z 4
 ′ 2 
b
Q[ v ] = (v ) − v 2 dx, (4.5)
0

the only difference being the upper limit of the integral. A quick computation shows that
the function v(x) = x(4 − x) satisfies the boundary conditions v(0) = 0 = v(4), but
Z 4
  64
b
Q[ v ] = (4 − 2 x)2 − x2 (4 − x)2 dx = − < 0.
0 5

Therefore, Q[ b v ] is not positive definite. Our preceding analysis does not apply be-
cause the function tan x becomes singular at x = 12 π, and so the auxiliary integral
Z 4
(v ′ + v tan x)2 dx does not converge.
0

The complete analysis of positive definiteness of quadratic functionals is quite subtle.

Indeed, the strange appearance of tan x in the preceding example turns out to be an
important clue! In the interests of brevity, let us just state without proof a fundamental
theorem, and refer the interested reader to [7] for full details.

6/8/15 20 c 2015 Peter J. Olver

 Theorem 4.3. Let A(x), B(x), C(x) ∈ C0 [ a, b ] be continuous functions. The quad-
ratic functional Z b
 
Q[ v ] = A v 2 + 2 B v v ′ + C (v ′ )2 dx
a

is positive definite, so Q[ v ] > 0 for all v 6≡ 0 satisfying the homogeneous Dirichlet boundary
conditions v(a) = v(b) = 0, provided
(a) C(x) > 0 for all a ≤ x ≤ b, and
(b) For any a < c ≤ b, the only solution to its linear Euler–Lagrange boundary value
problem
− (C v ′ )′ + (A − B ′ ) v = 0, v(a) = 0 = v(c), (4.6)
is the trivial function v(x) ≡ 0.
Remark : A value c for which (4.6) has a nontrivial solution is known as a conjugate
point to a. Thus, condition (b) can be restated that the variational problem has no
conjugate points in the interval ( a, b ].
Example 4.4. The quadratic functional
Z b
 ′ 2 
Q[ v ] = (v ) − v 2 dx (4.7)
0

has Euler–Lagrange equation

− v ′′ − v = 0.
The solutions v(x) = k sin x satisfy the boundary condition v(0) = 0. The first conjugate
point occurs at c = π where v(π) = 0. Therefore, Theorem 4.3 implies that the quadratic
functional (4.7) is positive definite provided the upper integration limit b < π. This
explains why the original quadratic functional (4.4) is positive definite, since there are no
conjugate points on the interval [ 0, 1 ], while the modified version (4.5) is not, because the
first conjugate point π lies on the interval ( 0, 4 ].
In the case when the quadratic functional arises as the second variation of a functional
(3.1), the coefficient functions A, B, C are given in terms of the Lagrangian L(x, u, p) by
formulae (4.2). In this case, the first condition in Theorem 4.3 requires

∂2L
(x, u, u′ ) > 0 (4.8)
∂p2
for the minimizer u(x). This is known as the Legendre condition. The second, conjugate
point condition requires that the so-called linear variational equation
 2   2 
d ∂ L ′ dv ∂ L ′ d ∂ 2L ′
− (x, u, u ) + (x, u, u ) − (x, u, u ) v = 0 (4.9)
dx ∂p2 dx ∂u2 dx ∂u ∂p
has no nontrivial solutions v(x) 6≡ 0 that satisfy v(a) = 0 and v(c) = 0 for a < c ≤ b. In
this way, we have arrived at a rigorous form of the second derivative test for the simplest
functional in the calculus of variations.

6/8/15 21 c 2015 Peter J. Olver

 Theorem 4.5. If the function u(x) satisfies the Euler–Lagrange equation (3.11),
and, in addition, the Legendre condition (4.8) and there are no conjugate points on the
interval, then u(x) is a strict local minimum for the functional.

5. Multi-dimensional Variational Problems.

The calculus of variations encompasses a very broad range of mathematical applica-
tions. The methods of variational analysis can be applied to an enormous variety of phys-
ical systems, whose equilibrium configurations inevitably minimize a suitable functional,
which, typically, represents the potential energy of the system. Minimizing configurations
appear as critical functions at which the functional gradient vanishes. Following similar
computational procedures as in the one-dimensional calculus of variations, we find that the
critical functions are characterized as solutions to a system of partial differential equations,
known as the Euler–Lagrange equations associated with the variational principle. Each
solution to the boundary value problem specified by the Euler–Lagrange equations sub-
ject to appropriate boundary conditions is, thus, a candidate minimizer for the variational
problem. In many applications, the Euler–Lagrange boundary value problem suffices to
single out the physically relevant solutions, and one need not press on to the considerably
more difficult second variation.
Implementation of the variational calculus for functionals in higher dimensions will be
illustrated by looking at a specific example — a first order variational problem involving a
single scalar function of two variables. Once this is fully understood, generalizations and
extensions to higher dimensions and higher order Lagrangians are readily apparent. Thus,
we consider an objective functional
ZZ
J[ u ] = L(x, y, u, ux, uy ) dx dy, (5.1)
Ω

having the form of a double integral over a prescribed domain Ω ⊂ R 2 . The Lagrangian
L(x, y, u, p, q) is assumed to be a sufficiently smooth function of its five arguments. Our
goal is to find the function(s) u = f (x, y) that minimize the value of J[ u ] when subject
to a set of prescribed boundary conditions on ∂Ω, the most important being our usual
Dirichlet, Neumann, or mixed boundary conditions. For simplicity, we concentrate on the
Dirichlet boundary value problem, and require that the minimizer satisfy

u(x, y) = g(x, y) for (x, y) ∈ ∂Ω. (5.2)

The First Variation

The basic necessary condition for an extremum (minimum or maximum) is obtained

in precisely the same manner as in the one-dimensional framework. Consider the scalar
function
ZZ
h(t) ≡ J[ u + t v ] = L(x, y, u + t v, ux + t vx , uy + t vy ) dx dy
Ω

6/8/15 22 c 2015 Peter J. Olver

depending on t ∈ R. The variation v(x, y) is assumed to satisfy homogeneous Dirichlet
boundary conditions
v(x, y) = 0 for (x, y) ∈ ∂Ω, (5.3)
to ensure that u + t v satisfies the same boundary conditions (5.2) as u itself. Under these
conditions, if u is a minimizer, then the scalar function h(t) will have a minimum at t = 0,
and hence
h′ (0) = 0.
When computing h′ (t), we assume that the functions involved are sufficiently smooth so
as to allow us to bring the derivative inside the integral, and then apply the chain rule. At
t = 0, the result is
ZZ  
′ d ∂L ∂L ∂L
h (0) = J[ u + t v ] = v + vx + vy dx dy, (5.4)
dt t=0 Ω ∂u ∂p ∂q
where the derivatives of L are all evaluated at x, y, u, ux, uy . To identify the functional
gradient, we need to rewrite this integral in the form of an inner product:
ZZ
′
h (0) = h ∇J[ u ] ; v i = h(x, y) v(x, y) dx dy, where h = ∇J[ u ].
Ω

To convert (5.4) into this form, we need to remove the offending derivatives from v. In
two dimensions, the requisite integration by parts formula is based on Green’s Theorem:
ZZ I ZZ  
∂v ∂v ∂w1 ∂w2
w1 + w dx dy = v (− w2 dx + w1 dy) − v + dx dy,
Ω ∂x ∂y 2 ∂Ω Ω ∂x ∂y
(5.5)
∂L ∂L
in which w1 , w2 are arbitrary smooth functions. Setting w1 = , w2 = , we find
∂p ∂q
ZZ   ZZ     
∂L ∂L ∂ ∂L ∂ ∂L
vx + vy dx dy = − v + dx dy,
Ω ∂p ∂q Ω ∂x ∂p ∂y ∂q
where the boundary integral vanishes owing to the boundary conditions (5.3) that we
impose on the allowed variations. Substituting this result back into (5.4), we conclude
that ZZ     
′ ∂L ∂ ∂L ∂ ∂L
h (0) = v − − dx dy = h ∇J[ u ] ; v i, (5.6)
Ω ∂u ∂x ∂p ∂y ∂q
where    
∂L ∂ ∂L ∂ ∂L
∇J[ u ] = − −
∂u ∂x ∂p ∂y ∂q
is the desired first variation or functional gradient. Since the gradient vanishes at a critical
function, we conclude that the minimizer u(x, y) must satisfy the Euler–Lagrange equation
   
∂L ∂ ∂L ∂ ∂L
(x, y, u, ux, uy ) − (x, y, u, ux, uy ) − (x, y, u, ux, uy ) = 0. (5.7)
∂u ∂x ∂p ∂y ∂q

6/8/15 23 c 2015 Peter J. Olver

Once we explicitly evaluate the derivatives, the net result is a second order partial differ-
ential equation
Lu − Lxp − Lyq − ux Lup − uy Luq − uxx Lpp − 2 uxy Lpq − uyy Lqq , (5.8)
where we use subscripts to indicate derivatives of both u and L, the latter being evaluated
at x, y, u, ux, uy .
Example 5.1. As a first elementary example, consider the Dirichlet minimization
problem ZZ
1 2 2


J[ u ] = 2 u x + u y dx dy. (5.9)
Ω
In this case, the associated Lagrangian is
∂L ∂L ∂L
L = 12 (p2 + q 2 ), with = 0, = p = ux , = q = uy .
∂u ∂p ∂q
Therefore, the Euler–Lagrange equation (5.7) becomes
∂ ∂
− (ux ) − (u ) = − uxx − uyy = − ∆u = 0,
∂x ∂y y
which is the two-dimensional Laplace equation. Subject to the selected boundary condi-
tions, the solutions, i.e., the harmonic functions, are critical functions for the Dirichlet
variational principle.
However, the calculus of variations approach, as developed so far, leads to a much
weaker result since it only singles out the harmonic functions as candidates for minimizing
the Dirichlet integral; they could just as easily be maximizing functions or saddle points.
When dealing with a quadratic variational problem, the direct algebraic approach is, when
applicable, the more powerful, since it assures us that the solutions to the Laplace equation
really do minimize the integral among the space of functions satisfying the appropriate
boundary conditions. However, the direct method is restricted to quadratic variational
problems, whose Euler–Lagrange equations are linear partial differential equations. In
nonlinear cases, one really does need to utilize the full power of the variational machinery.
Example 5.2. Let us derive the Euler–Lagrange equation for the minimal surface
problem. From (2.9), the surface area integral
ZZ p p
J[ u ] = 1 + u2x + u2y dx dy has Lagrangian L = 1 + p2 + q 2 .
Ω
Note that
∂L ∂L p ∂L q
= 0, =p , =p .
∂u ∂p 1 + p2 + q 2 ∂q 1 + p2 + q 2
Therefore, replacing p → ux and q → uy and then evaluating the derivatives, the Euler–
Lagrange equation (5.7) becomes

∂ ux ∂ uy − (1 + u2y )uxx + 2ux uy uxy − (1 + u2x )uyy

− p − p = = 0.
∂x 1 + u2 + u2 ∂y 1 + u2 + u2
x y x y
(1 + u2x + u2y )3/2

6/8/15 24 c 2015 Peter J. Olver

Thus, a surface described by the graph of a function u = f (x, y) is a critical function, and
hence a candidate for minimizing surface area, provided it satisfies the minimal surface
equation
(1 + u2y ) uxx − 2 ux uy uxy + (1 + u2x ) uyy = 0. (5.10)
We are confronted with a complicated, nonlinear, second order partial differential equation,
which has been the focus of some of the most sophisticated and deep analysis over the past
two centuries, with significant progress on understanding its solution only within the past
70 years. In this book, we have not developed the sophisticated analytical, geometrical,
and numerical techniques that are required to have anything of substance to say about
its solutions. We refer the interested reader to the advanced texts [10, 11] for further
developments in this fascinating problem.
Example 5.3. The deformations of an elastic body Ω ⊂ R n are described by the
displacement field, u: Ω → R n . Each material point x ∈ Ω in the undeformed body will
move to a new position y = x + u(x) in the deformed body
e = { y = x + u(x) | x ∈ Ω } .
Ω
The one-dimensional case governs bars, beams and rods, two-dimensional bodies include
thin plates and shells, while n = 3 for fully three-dimensional solid bodies. See [1, 8] for
details and physical derivations.
For small deformations, we can use a linear theory to approximate the much more
complicated equations of nonlinear elasticity. The simplest case is that of a homogeneous
and isotropic planar body Ω ⊂ R 2 . The equilibrium mechanics are described by the defor-
T
mation function u(x) = ( u(x, y), v(x, y) ) . A detailed physical analysis of the constitutive
assumptions leads to a minimization principle based on the following functional:
ZZ
1 
J[ u, v ] = 2
µ k ∇u k2 + 12 (λ + µ)(∇ · u)2 dx dy
Z ZΩ (5.11)
 1
2 2 1 2 2

= 2
λ + µ (ux + vy ) + 2 µ (uy + vx ) + (λ + µ) ux vy dx dy.
Ω

The parameters λ, µ are known as the Lamé moduli of the material, and govern its intrinsic
elastic properties. They are measured by performing suitable experiments on a sample of
the material. Physically, (5.11) represents the stored (or potential) energy in the body
under the prescribed displacement. Nature, as always, seeks the displacement that will
minimize the total energy.
To compute the Euler–Lagrange equations, we consider the functional variation

h(t) = J[ u + t f, v + t g ],
in which the individual variations f, g are arbitrary functions subject only to the given
homogeneous boundary conditions. If u, v minimize J, then h(t) has a minimum at t = 0,
and so we are led to compute
ZZ
′
h (0) = h ∇J ; f i = (f ∇u J + g ∇v J) dx dy,
Ω

6/8/15 25 c 2015 Peter J. Olver

which we write as an inner product (using the standard L2 inner product between vector
T
fields) between the variation f and the functional gradient ∇J = ( ∇u J, ∇v J ) . For the
particular functional (5.11), we find
ZZ
′


h (0) = λ + 2 µ (ux fx + vy gy ) + µ (uy fy + vx gx ) + (λ + µ) (ux gy + vy fx ) dx dy.
Ω

We use the integration by parts formula (5.5) to remove the derivatives from the variations
f, g. Discarding the boundary integrals, which are used to prescribe the allowable boundary
conditions, we find
ZZ   !
(λ + 2 µ) u + µ u + (λ + µ) v f +
h′ (0) = − xx yy xy
 dx dy.
Ω + (λ + µ) uxy + µ vxx + (λ + 2 µ) vyy g
The two terms in brackets give the two components of the functional gradient. Setting
them equal to zero, we derive the second order linear system of Euler–Lagrange equations
(λ + 2 µ) uxx + µ uyy + (λ + µ) vxy = 0,
(5.12)
(λ + µ) uxy + µ vxx + (λ + 2 µ) vyy = 0,
known as Navier’s equations, which can be compactly written as

µ ∆u + (µ + λ) ∇(∇ · u) = 0 (5.13)
T
for the displacement vector u = ( u, v ) . The solutions to are the critical displacements
that, under appropriate boundary conditions, minimize the potential energy functional.
Since we are dealing with a quadratic functional, a more detailed algebraic analy-
sis will demonstrate that the solutions to Navier’s equations are the minimizers for the
variational principle (5.11). Although only valid in a limited range of physical and kine-
matical conditions, the solutions to the planar Navier’s equations and its three-dimensional
counterpart are successfully used to model a wide class of elastic materials.
In general, the solutions to the Euler–Lagrange boundary value problem are critical
functions for the variational problem, and hence include all (smooth) local and global min-
imizers. Determination of which solutions are genuine minima requires a further analysis
of the positivity properties of the second variation, which is beyond the scope of our intro-
ductory treatment. Indeed, a complete analysis of the positive definiteness of the second
variation of multi-dimensional variational problems is quite complicated, and still awaits
a completely satisfactory resolution!

6/8/15 26 c 2015 Peter J. Olver

 References

[1] Antman, S.S., Nonlinear Problems of Elasticity, Appl. Math. Sci., vol. 107,
Springer–Verlag, New York, 1995.
[2] Ball, J.M., and Mizel, V.J., One-dimensional variational problem whose minimizers
do not satisfy the Euler-Lagrange equation, Arch. Rat. Mech. Anal. 90 (1985),
325–388.
[3] Born, M., and Wolf, E., Principles of Optics, Fourth Edition, Pergamon Press, New
York, 1970.
[4] Courant, R., and Hilbert, D., Methods of Mathematical Physics, vol. I, Interscience
Publ., New York, 1953.
[5] Dacorogna, B., Introduction to the Calculus of Variations, Imperial College Press,
London, 2004.
[6] do Carmo, M.P., Differential Geometry of Curves and Surfaces, Prentice-Hall,
Englewood Cliffs, N.J., 1976.
[7] Gel’fand, I.M., and Fomin, S.V., Calculus of Variations, Prentice–Hall, Inc.,
Englewood Cliffs, N.J., 1963.
[8] Gurtin, M.E., An Introduction to Continuum Mechanics, Academic Press, New
York, 1981.
[9] Kot, M., A First Course in the Calculus of Variations, American Mathematical
Society, Providence, R.I., 2014.
[10] Morgan, F., Geometric Measure Theory: a Beginner’s Guide, Academic Press, New
York, 2000.
[11] Nitsche, J.C.C., Lectures on Minimal Surfaces, Cambridge University Press,
Cambridge, 1988.
[12] Olver, P.J., Applications of Lie Groups to Differential Equations, 2nd ed., Graduate
Texts in Mathematics, vol. 107, Springer–Verlag, New York, 1993.
[13] Olver, P.J., Introduction to Partial Differential Equations, Undergraduate Texts in
Mathematics, Springer–Verlag, New York, to appear.

6/8/15 27 c 2015 Peter J. Olver