# Calculus of variations

{{#invoke:Hatnote|hatnote}} {{#invoke: Sidebar | collapsible }}

**Calculus of variations** is a field of mathematical analysis that deals with maximizing or minimizing functionals, which are mappings from a set of functions to the real numbers. Functionals are often expressed as definite integrals involving functions and their derivatives. The interest is in *extremal* functions that make the functional attain a maximum or minimum value – or *stationary* functions – those where the rate of change of the functional is zero.

A simple example of such a problem is to find the curve of shortest length connecting two points. If there are no constraints, the solution is obviously a straight line between the points. However, if the curve is constrained to lie on a surface in space, then the solution is less obvious, and possibly many solutions may exist. Such solutions are known as geodesics. A related problem is posed by Fermat's principle: light follows the path of shortest optical length connecting two points, where the optical length depends upon the material of the medium. One corresponding concept in mechanics is the principle of least action.

Many important problems involve functions of several variables. Solutions of boundary value problems for the Laplace equation satisfy the Dirichlet principle. Plateau's problem requires finding a surface of minimal area that spans a given contour in space: a solution can often be found by dipping a frame in a solution of soap suds. Although such experiments are relatively easy to perform, their mathematical interpretation is far from simple: there may be more than one locally minimizing surface, and they may have non-trivial topology.

## Contents

## History

The calculus of variations may be said to begin with the brachistochrone curve problem raised by Johann Bernoulli (1696).^{[1]} It immediately occupied the attention of Jakob Bernoulli and the Marquis de l'Hôpital, but Leonhard Euler first elaborated the subject. His contributions began in 1733, and his Elementa Calculi Variationum gave to the science its name. Lagrange contributed extensively to the theory, and Legendre (1786) laid down a method, not entirely satisfactory, for the discrimination of maxima and minima. Isaac Newton and Gottfried Leibniz also gave some early attention to the subject.^{[2]} To this discrimination Vincenzo Brunacci (1810), Carl Friedrich Gauss (1829), Siméon Poisson (1831), Mikhail Ostrogradsky (1834), and Carl Jacobi (1837) have been among the contributors. An important general work is that of Sarrus (1842) which was condensed and improved by Cauchy (1844). Other valuable treatises and memoirs have been written by Strauch (1849), Jellett (1850), Otto Hesse (1857), Alfred Clebsch (1858), and Carll (1885), but perhaps the most important work of the century is that of Weierstrass. His celebrated course on the theory is epoch-making, and it may be asserted that he was the first to place it on a firm and unquestionable foundation. The 20th and the 23rd Hilbert problem published in 1900 encouraged further development.^{[2]} In the 20th century David Hilbert, Emmy Noether, Leonida Tonelli, Henri Lebesgue and Jacques Hadamard among others made significant contributions.^{[2]} Marston Morse applied calculus of variations in what is now called Morse theory.^{[3]} Lev Pontryagin, Ralph Rockafellar and F. H. Clarke developed new mathematical tools for the calculus of variations in optimal control theory.^{[3]} The Dynamic Programming of Richard Bellman is an alternative to the calculus of variations.^{[4]}^{[5]}^{[6]}

## Extrema

The calculus of variations is concerned with the **maxima** or **minima** of functionals, which are collectively called **extrema**. A functional depends on a function, somewhat analogous to the way a function can depend on a numerical variable, and thus a functional has been described as a function of a function. Functionals have extrema with respect to the elements *y* of a given function space defined over a given domain. A functional *J* [ *y* ] is said to have an extremum at the function *f* if *ΔJ* = *J* [ *y* ] - *J* [ *f*] has the same sign for all *y* in an arbitrarily small neighborhood of *f* .^{[Note 1]} The function *f* is called an **extremal** function or extremal. The extremum *J* [ *f* ] is called a maximum if *ΔJ* ≤ 0 everywhere in an arbitrarily small neighborhood of *f* , and a minimum if *ΔJ* ≥ 0 there. For a function space of continuous functions, extrema of corresponding functionals are called weak or strong, depending on whether the first derivatives of the continuous functions are respectively all continuous or not.^{[8]}

A more detailed definition of weak and strong extrema involves the concept of the norm of a function in a function space, which has a role that is similar to the length of a vector in a vector space. If *y* is an element of the function space *C*(a,b) of all continuous functions that are defined on a closed interval [a,b], the **norm || y ||_{0}** defined on

*C*(a,b) is the maximum absolute value of

*y*(

*x*) for

*a*≤

*x*≤

*b*,

^{[9]}

Similarly, if *y* is an element of the function space *D*_{1}(a,b) of all functions of *C*(a,b) that have continuous first derivatives, the **norm || y ||_{1}** defined on

*D*

_{1}(a,b) is the sum of the maximum absolute value of

*y*(

*x*) and the maximum absolute value of its first derivative

*y*′(

*x*), for

*a*≤

*x*≤

*b*,

^{[9]}

A functional *J* [ *y* ] is said to have a **weak extremum** at the function *f* if there exists some *δ* > 0 such that, *J* [ *y* ] - *J* [ *f*] has the same sign for all functions *y* ∈ *D*_{1}(a,b) with || *y* - *f* ||_{1} < *δ*. Similarly, a functional *J* [ *y* ] is said to have a **strong extremum** at the function *f* if there exists some *δ* > 0 such that, *J* [ *y* ] - *J* [ *f*] has the same sign for all functions *y* ∈ *C* (a,b) with || *y* - *f* ||_{0} < *δ*.^{[10]}

Both strong and weak extrema of functionals are for a space of continuous functions but weak extrema have the additional requirement that the first derivatives of the functions in the space be continuous. Thus a strong extremum is also a weak extremum, but the converse may not hold. Finding strong extrema is more difficult than finding weak extrema.^{[10]} An example of a necessary condition that is used for finding weak extrema is the Euler–Lagrange equation.^{[11]}Template:Refn

## Euler–Lagrange equation

{{#invoke:main|main}}

Finding the extrema of functionals is similar to finding the maxima and minima of functions. The maxima and minima of a function may be located by finding the points where its derivative vanishes (i.e., is equal to zero). The extrema of functionals may be obtained by finding functions where the functional derivative is equal to zero. This leads to solving the associated Euler–Lagrange equation.^{[Note 2]}

Consider the functional

where

*x*_{1},*x*_{2}are constants,*y*(*x*) is twice continuously differentiable,*y*′(*x*) =*dy / dx*,*L*[*x*,*y*(*x*),*y*′(*x*)] is twice continuously differentiable with respect to its arguments*x*,*y*,*y*′.

If the functional *J*[*y* ] attains a local minimum at *f* , and *η*(*x*) is an arbitrary function that has at least one derivative and vanishes at the endpoints *x*_{1} and *x*_{2} , then for any number *ε* close to 0,

The term *εη* is called the **variation** of the function *f* and is denoted by *δf* .^{[12]}

Substituting *f* + *εη* for *y* in the functional *J*[ *y* ] , the result is a function of *ε**,*

Since the functional *J*[ *y* ] has a minimum for *y* = *f* , the function Φ(*ε*) has a minimum at *ε* = 0 and thus,^{[Note 3]}

Taking the total derivative of *L*[*x*, *y*, *y* ′] , where *y* = *f* + *ε η* and *y* ′ = *f* ′ + *ε η*′ are functions of *ε* but *x* is not,

and since *dy* /*dε* = *η* and *dy* ′/*dε* = *η' *,

Therefore,

where *L*[*x*, *y*, *y* ′] → *L*[*x*, *f*, *f* ′] when *ε* = 0 and we have used integration by parts. The last term vanishes because *η* = 0 at *x _{1}* and

*x*by definition. Also, as previously mentioned the left side of the equation is zero so that

_{2}According to the fundamental lemma of calculus of variations, the part of the integrand in parentheses is zero, i.e.

which is called the **Euler–Lagrange equation**. The left hand side of this equation is called the functional derivative of *J*[*f*] and is denoted *δJ*/*δf*(*x*) .

In general this gives a second-order ordinary differential equation which can be solved to obtain the extremal function *f*(*x*) . The Euler–Lagrange equation is a necessary, but not sufficient, condition for an extremum *J*[*f*]. Sufficient conditions for an extremum are discussed in the references.Template:Refn

### Example

In order to illustrate this process, consider the problem of finding the extremal function *y* = *f* (*x*) , which is the shortest curve that connects two points (*x*_{1}, *y*_{1}) and (*x*_{2}, *y*_{2}) . The arc length of the curve is given by

with

The Euler–Lagrange equation will now be used to find the extremal function *f* (*x*) that minimizes the functional *A*[*y* ] .

with

Since *f* does not appear explicitly in *L* , the first term in the Euler–Lagrange equation vanishes for all *f* (*x*) and thus,

Substituting for *L* and taking the partial derivative,

Taking the derivative *d/dx* and simplifying gives,

and because 1+[*f ′*(*x*)]^{2} is positive,

which implies that the shortest curve that connects two points (*x*_{1}, *y*_{1}) and (*x*_{2}, *y*_{2}) is

and we have thus found the extremal function *f*(*x*) that minimizes the functional *A*[*y*] so that *A*[*f*] is a minimum. Note that *y* = *f*(*x*) is the equation for a straight line as expected.

## Beltrami identity

In physics problems it frequently turns out that ∂*L* / ∂*x* = 0. In that case, the Euler–Lagrange equation can be simplified to the Beltrami identity:^{[13]}

where *C* is a constant. The left hand side is the Legendre transformation of *L* with respect to *f* ′.

## Du Bois-Reymond's theorem

The discussion thus far has assumed that extremal functions possess two continuous derivatives, although the existence of the integral *A* requires only first derivatives of trial functions. The condition that the first variation vanish at an extremal may be regarded as a **weak form** of the Euler–Lagrange equation. The theorem of Du Bois-Reymond asserts that this weak form implies the strong form. If *L* has continuous first and second derivatives with respect to all of its arguments, and if

then has two continuous derivatives, and it satisfies the Euler–Lagrange equation.

## Lavrentiev phenomenon

Hilbert was the first to give good conditions for the Euler–Lagrange equations to give a stationary solution. Within a convex area and a positive thrice differentiable Lagrangian the solutions are composed of a countable collection of sections that either go along the boundary or satisfy the Euler–Lagrange equations in the interior.

However Lavrentiev in 1926 showed that there are circumstances where there is no optimum solution but one can be approached arbitrarily closely by increasing numbers of sections. For instance the following:

Here a zig zag path gives a better solution than any smooth path and increasing the number of sections improves the solution.

## Functions of several variables

Variational problems that involve multiple integrals arise in numerous applications. For example, if φ(*x*,*y*) denotes the displacement of a membrane above the domain *D* in the *x*,*y* plane, then its potential energy is proportional to its surface area:

Plateau's problem consists of finding a function that minimizes the surface area while assuming prescribed values on the boundary of *D*; the solutions are called **minimal surfaces**. The Euler–Lagrange equation for this problem is nonlinear:

See Courant (1950) for details.

### Dirichlet's principle

It is often sufficient to consider only small displacements of the membrane, whose energy difference from no displacement is approximated by

The functional *V* is to be minimized among all trial functions φ that assume prescribed values on the boundary of *D*. If *u* is the minimizing function and *v* is an arbitrary smooth function that vanishes on the boundary of *D*, then the first variation of must vanish:

Provided that u has two derivatives, we may apply the divergence theorem to obtain

where *C* is the boundary of *D*, *s* is arclength along *C* and is the normal derivative of *u* on *C*. Since *v* vanishes on *C* and the first variation vanishes, the result is

for all smooth functions v that vanish on the boundary of *D*. The proof for the case of one dimensional integrals may be adapted to this case to show that

The difficulty with this reasoning is the assumption that the minimizing function u must have two derivatives. Riemann argued that the existence of a smooth minimizing function was assured by the connection with the physical problem: membranes do indeed assume configurations with minimal potential energy. Riemann named this idea the Dirichlet principle in honor of his teacher Peter Gustav Lejeune Dirichlet. However Weierstrass gave an example of a variational problem with no solution: minimize

among all functions φ that satisfy and
*W* can be made arbitrarily small by choosing piecewise linear functions that
make a transition between -1 and 1 in a small neighborhood of the origin. However, there is no function that makes *W*=0. The resulting controversy over the validity of Dirichlet's principle is explained in
http://turnbull.mcs.st-and.ac.uk/~history/Biographies/Riemann.html .
Eventually it was shown that Dirichlet's principle is valid, but it requires a sophisticated application of the regularity theory for elliptic partial differential equations; see Jost and Li-Jost (1998).

### Generalization to other boundary value problems

A more general expression for the potential energy of a membrane is

This corresponds to an external force density in *D*, an external force on the boundary *C*, and elastic forces with modulus acting on *C*. The function that minimizes the potential energy **with no restriction on its boundary values** will be denoted by *u*. Provided that *f* and *g* are continuous, regularity theory implies that the minimizing function *u* will have two derivatives. In taking the first variation, no boundary condition need be imposed on the increment *v*. The first variation of
is given by

If we apply the divergence theorem, the result is

If we first set *v*=0 on *C*, the boundary integral vanishes, and we conclude as before that

in *D*. Then if we allow *v* to assume arbitrary boundary values, this implies that *u* must satisfy the boundary condition

on *C*. Note that this boundary condition is a consequence of the minimizing property of *u*: it is not imposed beforehand. Such conditions are called **natural boundary conditions**.

The preceding reasoning is not valid if vanishes identically on *C*. In such a case, we could allow a trial function
, where *c* is a constant. For such a trial function,

By appropriate choice of *c*, *V* can assume any value unless the quantity inside the brackets vanishes. Therefore the variational problem is meaningless unless

This condition implies that net external forces on the system are in equilibrium. If these forces are in equilibrium, then the variational problem has a solution, but it is not unique, since an arbitrary constant may be added. Further details and examples are in Courant and Hilbert (1953).

## Eigenvalue problems

Both one-dimensional and multi-dimensional **eigenvalue problems** can be formulated as variational problems.

### Sturm-Liouville problems

The Sturm-Liouville eigenvalue problem involves a general quadratic form

where φ is restricted to functions that satisfy the boundary conditions

Let *R* be a normalization integral

The functions and are required to be everywhere positive and bounded away from zero. The primary variational problem is to minimize the ratio *Q/R* among all φ satisfying the endpoint conditions. It is shown below that the Euler–Lagrange equation for the minimizing *u* is

where λ is the quotient

It can be shown (see Gelfand and Fomin 1963) that the minimizing *u* has two derivatives and satisfies the Euler–Lagrange equation. The associated λ will be denoted by ; it is the lowest eigenvalue for this equation and boundary conditions. The associated minimizing function will be denoted by . This variational characterization of eigenvalues leads to the Rayleigh–Ritz method: choose an approximating *u* as a linear combination of basis functions (for example trigonometric functions) and carry out a finite-dimensional minimization among such linear combinations. This method is often surprisingly accurate.

The next smallest eigenvalue and eigenfunction can be obtained by minimizing *Q* under the additional constraint

This procedure can be extended to obtain the complete sequence of eigenvalues and eigenfunctions for the problem.

The variational problem also applies to more general boundary conditions. Instead of requiring that φ vanish at the endpoints, we may not impose any condition at the endpoints, and set

where and are arbitrary. If we set the first variation for the ratio is

where λ is given by the ratio as previously. After integration by parts,

If we first require that *v* vanish at the endpoints, the first variation will vanish for all such *v* only if

If *u* satisfies this condition, then the first variation will vanish for arbitrary *v* only if

These latter conditions are the **natural boundary conditions** for this problem, since they are not imposed on trial functions for the minimization, but are instead a consequence of the minimization.

### Eigenvalue problems in several dimensions

Eigenvalue problems in higher dimensions are defined in analogy with the one-dimensional case. For example, given a domain *D* with boundary *B* in three dimensions we may define

and

Let *u* be the function that minimizes the quotient
with no condition prescribed on the boundary *B*. The Euler–Lagrange equation satisfied by *u* is

where

The minimizing *u* must also satisfy the natural boundary condition

on the boundary *B*. This result depends upon the regularity theory for elliptic partial differential equations; see Jost and Li-Jost (1998) for details. Many extensions, including completeness results, asymptotic properties of the eigenvalues and results concerning the nodes of the eigenfunctions are in Courant and Hilbert (1953).

## Applications

{{#invoke:main|main}}

Some applications of the calculus of variations include:

- The derivation of the Catenary shape
- The Brachistochrone problem
- Isoperimetric problems
- Geodesics on surfaces
- Minimal surfaces and Plateau's problem
- Optimal control

### Fermat's principle

Fermat's principle states that light takes a path that (locally) minimizes the optical length between its endpoints. If the *x*-coordinate is chosen as the parameter along the path, and along the path, then the optical length is given by

where the refractive index depends upon the material.
If we try
then the first variation of *A* (the derivative of *A* with respect to ε) is

After integration by parts of the first term within brackets, we obtain the Euler–Lagrange equation

The light rays may be determined by integrating this equation. This formalism is used in the context of Lagrangian optics and Hamiltonian optics.

#### Snell's law

There is a discontinuity of the refractive index when light enters or leaves a lens. Let

where and are constants. Then the Euler–Lagrange equation holds as before in the region where *x*<0 or *x*>0, and in fact the path is a straight line there, since the refractive index is constant. At the *x*=0, *f* must be continuous, but *f' * may be discontinuous. After integration by parts in the separate regions and using the Euler–Lagrange equations, the first variation takes the form

The factor multiplying is the sine of angle of the incident ray with the *x* axis, and the factor multiplying is the sine of angle of the refracted ray with the *x* axis. Snell's law for refraction requires that these terms be equal. As this calculation demonstrates, Snell's law is equivalent to vanishing of the first variation of the optical path length.

#### Fermat's principle in three dimensions

It is expedient to use vector notation: let let *t* be a parameter, let be the parametric representation of a curve *C*, and let be its tangent vector. The optical length of the curve is given by

Note that this integral is invariant with respect to changes in the parametric representation of *C*. The Euler–Lagrange equations for a minimizing curve have the symmetric form

where

It follows from the definition that *P* satisfies

Therefore the integral may also be written as

This form suggests that if we can find a function ψ whose gradient is given by *P*, then the integral *A* is given by the difference of ψ at the endpoints of the interval of integration. Thus the problem of studying the curves that make the integral stationary can be related to the study of the level surfaces of ψ. In order to find such a function, we turn to the wave equation, which governs the propagation of light. This formalism is used in the context of Lagrangian optics and Hamiltonian optics.

##### Connection with the wave equation

The wave equation for an inhomogeneous medium is

where *c* is the velocity, which generally depends upon *X*. Wave fronts for light are characteristic surfaces for this partial differential equation: they satisfy

We may look for solutions in the form

In that case, ψ satisfies

where According to the theory of first-order partial differential equations, if then *P* satisfies

along a system of curves (**the light rays**) that are given by

These equations for solution of a first-order partial differential equation are identical to the Euler–Lagrange equations if we make the identification

We conclude that the function ψ is the value of the minimizing integral *A* as a function of the upper end point. That is, when a family of minimizing curves is constructed, the values of the optical length satisfy the characteristic equation corresponding the wave equation. Hence, solving the associated partial differential equation of first order is equivalent to finding families of solutions of the variational problem. This is the essential content of the Hamilton–Jacobi theory, which applies to more general variational problems.

### Action principle

{{#invoke:main|main}}
In classical mechanics, the action, *S*, is defined as the time integral of the Lagrangian, *L*. The Lagrangian is the difference of energies,

where *T* is the kinetic energy of a mechanical system and *U* its potential energy. Hamilton's principle (or the action principle) states that the motion of a conservative holonomic (integrable constraints) mechanical system is such that the action integral

is stationary with respect to variations in the path *x(t)*.
The Euler–Lagrange equations for this system are known as Lagrange's equations:

and they are equivalent to Newton's equations of motion (for such systems).

The conjugate momenta *P* are defined by

For example, if

then

Hamiltonian mechanics results if the conjugate momenta are introduced in place of , and the Lagrangian *L* is replaced by the Hamiltonian *H* defined by

The Hamiltonian is the total energy of the system: *H* = *T* + *U*.
Analogy with Fermat's principle suggests that solutions of Lagrange's equations (the particle trajectories) may be described in terms of level surfaces of some function of *X*. This function is a solution of the Hamilton–Jacobi equation:

## See also

## Notes

- ↑ The neighborhood of
*f*is the part of the given function space where |*y*-*f*| < h over the whole domain of the functions, with h a positive number that specifies the size of the neighborhood.^{[7]} - ↑ The following derivation of the Euler–Lagrange equation corresponds to the derivation on pp. 184–5 of:

{{#invoke:citation/CS1|citation |CitationClass=book }} - ↑ The product
*ε*Φ′(0) is called the first variation of the functional*J*and is denoted by*δJ*. Some references define the first variation differently by leaving out the*ε*factor.

## References

- ↑ {{#invoke:citation/CS1|citation |CitationClass=book }}
- ↑
^{2.0}^{2.1}^{2.2}{{#invoke:citation/CS1|citation |CitationClass=book }} - ↑
^{3.0}^{3.1}Template:Cite arXiv - ↑ Dimitri P Bertsekas. Dynamic programming and optimal control. Athena Scientific, 2005.
- ↑ {{#invoke:Citation/CS1|citation |CitationClass=journal }}
- ↑ Template:Cite news See
**2004: Harold J. Kushner**: regarding Dynamic Programming, "The calculus of variations had related ideas (e.g., the work of Caratheodory, the Hamilton-Jacobi equation). This led to conflicts with the calculus of variations community." - ↑ {{#invoke:citation/CS1|citation |CitationClass=book }}
- ↑ Template:Harv
- ↑
^{9.0}^{9.1}Template:Harv - ↑
^{10.0}^{10.1}Template:Harv - ↑ Template:Harv
- ↑ Template:Harv
- ↑ Weisstein, Eric W. "Euler-Lagrange Differential Equation." From MathWorld--A Wolfram Web Resource. See Eq. (5).

## Further reading

- Dacorogna, Bernard.
*Introduction to the Calculus of Variations (3rd Edition)*, 2014, World Scientific Publishing, ISBN 978-1-78326-551-0.*Introduction* - Bolza, O.: Lectures on the Calculus of Variations. Chelsea Publishing Company, 1904, available on Digital Mathematics library [1]. 2nd edition republished in 1961, paperback in 2005, ISBN 978-1-4181-8201-4.
- Cassel, Kevin W.: Variational Methods with Applications in Science and Engineering, Cambridge University Press, 2013.
- Clegg, J.C.: Calculus of Variations, Interscience Publishers Inc., 1968.
- Courant, R.: Dirichlet's principle, conformal mapping and minimal surfaces. Interscience, 1950.
- Elsgolc, L.E.: Calculus of Variations, Pergamon Press Ltd., 1962.
- Fischer, Jim
*Introduction to the calculus of variations, a quick and readable guide. (Note: There are typos in the Euler–Lagrange equation on page 5 of the document; the equation should read: . Similar errors are present in equations 5.1 and 5.2 on page 8 of the document.)* - Forsyth, A.R.: Calculus of Variations, Dover, 1960.
- Fox, Charles: An Introduction to the Calculus of Variations, Dover Publ., 1987.
- Jost, J. and X. Li-Jost: Calculus of Variations. Cambridge University Press, 1998.
- Lebedev, L.P. and Cloud, M.J.: The Calculus of Variations and Functional Analysis with Optimal Control and Applications in Mechanics, World Scientific, 2003, pages 1–98.
- Logan, J. David: Applied Mathematics, 3rd Ed. Wiley-Interscience, 2006
- Roubicek, T.:
*Calculus of variations. Chap.17 in: Mathematical Tools for Physicists. (Ed. M. Grinfeld) J. Wiley, Weinheim, 2014, ISBN 978-3-527-41188-7, pp.551-588.* - Sagan, Hans: Introduction to the Calculus of Variations, Dover, 1992.
- Weinstock, Robert: Calculus of Variations with Applications to Physics and Engineering, Dover, 1974.
- Chapter 8: Calculus of Variations, from
*Optimization for Engineering Systems*, by Ralph W. Pike, Louisiana State University.

## External links

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}