Calculus of Variations

Calculus of Variations is the branch of mathematics that finds functions which minimize or maximize integral quantities (functionals). Key result: a function extremizing must satisfy the Euler–Lagrange equation . Applies to: mechanics, optics, geometry (geodesics), economics, control theory. Origins: Bernoulli's brachistochrone (1696), formalized by Euler (1744) and Lagrange (1755).

The calculus of variations seeks to optimize functionals — rules that assign a real number to an entire function, typically through an integral. Where ordinary calculus minimizes over points , here we minimize over whole curves . It matters because an astonishing range of physical laws can be stated as principles of least (or stationary) action: light bends to minimize travel time, soap films minimize area, and particles trace paths that extremize action. The surprising fact is that requiring stationarity of a single integral collapses into a differential equation — the Euler–Lagrange equation — so an infinite-dimensional optimization becomes an ODE or PDE problem solvable by familiar techniques.

The Core Insight

To find the function that extremizes a functional, perturb it slightly and demand that the first-order change vanishes — exactly as at an ordinary extremum. The perturbation is an arbitrary function , and demanding zero first variation for all forces a local condition at every point: the Euler–Lagrange equation. The whole subject is the differential calculus of lifted to infinite dimensions.

Formal Statement

Functional and the Basic Problem

A functional maps functions to real numbers. The classical (fixed-endpoint) problem is to extremize

1
⟳ is the
Lagrangian (integrand); is the unknown curve with prescribed endpoints , ; .

The admissible class is satisfying the boundary conditions. The symbols are:

  • — independent variable;
  • — the function to be determined;
  • — its derivative;
  • — a given smooth function of three arguments.

First Variation

Replace by where and . The first variation is

2
⟳differentiate under the integral sign and set ; this is the directional derivative of in the "direction" .

A function is a stationary point (extremal) of if for every admissible .

Euler–Lagrange Equation

If extremizes among functions with fixed endpoints, then satisfies

3
⟳set the first variation to zero, integrate the term by parts, then invoke the fundamental lemma since is arbitrary.

Beltrami Identity — Autonomous Case

If does not depend explicitly on (i.e. ), then any extremal satisfies the first integral

4
⟳compute , substitute the Euler–Lagrange equation, and observe the result is , so the bracket is constant .

Why It Holds / Derivation

Deriving the Euler–Lagrange Equation

Step 1 — Embed in a family. Suppose is an extremal. Form with , . Define . Since is stationary, has an extremum at , so . Step 2 — Differentiate under the integral. By the chain rule,
5
⟳ and ; evaluate partials of at .
Step 3 — Integrate by parts. For the second term,
6
⟳standard integration by parts with , .
Step 4 — Kill the boundary term. Because , the bracket vanishes. Combining,
7
⟳substitute [6] into [5] and factor out .
Step 5 — Apply the fundamental lemma. Since is arbitrary (subject only to vanishing endpoints), the bracketed quantity must vanish identically; otherwise choose matching its sign to make the integral positive. Hence
8
⟳this is the
fundamental lemma of the calculus of variations — a continuous function whose weighted integral against all such is zero must be identically zero.

Leonhard Euler | 1707–1783

Euler systematized the subject in his 1744 treatise Methodus inveniendi lineas curvas maximi minimive proprietate gaudentes, deriving the central equation by a discretization argument (replacing the curve with a polygon and taking a limit). The elegant variational derivation came from the young Joseph-Louis Lagrange, whose 1755 letter to Euler introduced the -operator and the perturbation method used today. Euler graciously named the field after Lagrange's method, and the resulting equation bears both names.

Building Intuition

Think of the functional as a landscape sitting over an infinite-dimensional space whose "points" are entire curves. At a minimizing curve the landscape is flat in every direction — and the directions are precisely the perturbations . Demanding flatness in all directions at once is far stronger than in finite dimensions, and that overdetermination is what crushes the problem down to a pointwise differential equation. The boundary term in the integration by parts is "the gradient leaking out the ends"; fixing the endpoints with plugs the leak. When the endpoints are free, that leaked term cannot be dropped and instead yields natural boundary conditions at the ends.

A curve y(x) and a perturbed competitor y+εη, both pinned at the endpoints

x y a b y(x) extremal y + εη εη(x)

Worked Examples

Shortest Path Between Two Points

Given: Minimize arc length between and . Step 1 — Identify the Lagrangian. . Note and has no explicit . Step 2 — Euler–Lagrange. Since , equation [3] gives , so const:
9
⟳differentiate with respect to and set it equal to a constant from the conserved-momentum form of E–L.
Step 3 — Solve. This forces const , hence (a straight line). Apply endpoints: , . Step 4 — Compute length. .

The Brachistochrone

Given: A bead slides without friction from to under gravity . Find the curve minimizing descent time. Measuring downward, speed , so
10
⟳time with and energy conservation .
Step 1 — Autonomous in . has no explicit , so use the Beltrami identity [4]:
11
⟳substitute into [4]; the terms combine over a common denominator .
Step 2 — Rearrange. This gives where is constant. Step 3 — Parametrize. Substituting yields the cycloid
For a drop to m, one finds m, , giving descent time s (with m/s², s).

Common Misconceptions

Stationary ≠ minimum. The Euler–Lagrange equation is a necessary condition for an extremum, not sufficient. Its solutions are stationary points; they may be minima, maxima, or saddle points (or none of these). To confirm a minimum you need second-order tests — the second variation , the Legendre condition , and the Jacobi condition (no conjugate points in ). A solution of E–L can fail to be a minimizer if a conjugate point appears. Existence is not guaranteed. Writing down the Euler–Lagrange equation presumes a smooth minimizer exists. Many functionals have no minimizer in the smooth class, or the infimum is not attained. The modern direct method addresses existence separately, requiring coercivity and (sequential weak lower) semicontinuity — properties tied to convexity of in .

Weierstrass's Non-Existence Example

Consider with , . The infimum is (approached by curves that rise steeply near where the weight vanishes), but no admissible function attains , since that would require wherever , contradicting the boundary conditions. The Euler–Lagrange equation has solutions, yet the minimization problem has no smooth solution — a famous demonstration that E–L alone settles nothing about existence.

Connections

The calculus of variations is the mathematical engine of Lagrangian mechanics: with (kinetic minus potential energy), Hamilton's Principle states that physical trajectories extremize the action , and [3] becomes Newton's laws in disguise. A Legendre transform of produces the Hamiltonian and connects to Hamiltonian Mechanics and symplectic geometry. The role of symmetries is captured by Noether's Theorem, which links continuous symmetries of to conserved quantities (the Beltrami identity [4] is the special case of time-translation symmetry). When constraints are present, Lagrange Multipliers generalize to isoperimetric and holonomic constraint problems. Replacing one independent variable by several upgrades [3] to a partial differential equation, linking to Partial Differential Equations and the Dirichlet Principle for harmonic functions.

Real-World Applications

  1. Optics (Fermat's Principle): Light follows the path of stationary optical length ; refraction (Snell's law) and lens design follow directly.
  2. Classical mechanics: Every equation of motion in robotics, orbital dynamics, and molecular simulation can be generated from a Lagrangian via [3].
  3. Minimal surfaces & soap films: Architecture (tensile roofs, the Munich Olympic Stadium) and the physics of bubbles are governed by area-minimizing functionals.
  4. Optimal control & aerospace: Pontryagin's Maximum Principle, the control-theoretic descendant of variational methods, computes fuel-minimal rocket trajectories and spacecraft transfers.
  5. General relativity: Geodesics — the paths of free-falling bodies and light — extremize the spacetime interval ; the Einstein equations themselves derive from the Einstein–Hilbert action.
  6. Economics & finance: Ramsey's optimal-growth model and continuous-time consumption problems maximize discounted utility functionals over time.
  7. Image processing: Total-variation denoising and the Mumford–Shah model restore images by minimizing energy functionals balancing fidelity and smoothness.

Historical Development

  • 1696 — Johann Bernoulli poses the brachistochrone problem as a public challenge; solutions arrive from Newton, Leibniz, l'Hôpital, and both Bernoullis.
  • 1697 — Newton solves it overnight (anonymously), prompting Bernoulli's remark, "I recognize the lion by his claw."
  • 1744 — Euler publishes Methodus inveniendi…, the first systematic treatment, deriving the central equation via polygonal approximation.
  • 1755 — Lagrange (age 19) writes to Euler introducing the -calculus and the perturbation method; the field is named calculus of variations.
  • 1786 — Legendre proposes the second-variation sign condition () for distinguishing minima.
  • 1837 — Jacobi develops the theory of conjugate points, completing the second-order sufficiency analysis.
  • 1879 — Weierstrass introduces strong variations, the excess function, and rigorous sufficiency conditions; exposes flaws in the naive Dirichlet Principle.
  • 1900 — Hilbert's 19th, 20th, and 23rd problems revitalize the field; Hilbert rehabilitates the direct method and the Dirichlet Principle.
  • 1915 — Emmy Noether proves her theorem linking variational symmetries to conservation laws.

Subtleties & Limits

The leap from finite to infinite dimensions introduces genuine hazards. Regularity: does a minimizer obtained by the direct method possess enough derivatives to satisfy the Euler–Lagrange equation classically? Hilbert's 19th problem (analyticity of minimizers for analytic, convex ) was settled for scalar problems by De Giorgi and Nash (1957), but partial regularity is the best possible for vector-valued problems — singular sets genuinely occur, and their structure remains an active research frontier. Lavrentiev's phenomenon: the infimum over Lipschitz functions can strictly exceed the infimum over smooth ones, so the choice of admissible class is not innocent. Non-convex functionals may fail to attain their infimum, forcing the machinery of relaxation, Young measures, and quasiconvexity (Morrey) — and deciding whether a given function is quasiconvex is, in general, undecidable in known terms. These issues mean the clean undergraduate story (write E–L, solve) is the surface of a deep and still-developing theory.

See Also

Hamilton's Principle · Euler–Lagrange Equation · Geodesics · Minimal Surfaces · Noether's Theorem · Pontryagin's Maximum Principle · Direct Method in the Calculus of Variations · Brachistochrone Problem

Before this

Where this leads