Direct method in the calculus of variations
ID: direct-method-in-the-calculus-of-variations
The direct method in the calculus of variations proves existence by passing to a limit of a minimizing sequence. A useful abstract version takes a nonempty weakly sequentially closed admissible subset of a reflexive Banach space and a functional . Assume is finite at some admissible point, bounded below, coercive on , and has weak lower semicontinuity.
Choose with . Coercivity bounds . Reflexivity supplies a weakly convergent subsequence, and closure puts its limit in . Finally,so attains the infimum. Each hypothesis has a distinct role: compactness must preserve the constraints, and lower semicontinuity must hold for the convergence actually obtained.
For the Dirichlet energy with linear forcing on over a bounded domain, the Poincaré inequality controls the forcing and gives coercivity, while the squared gradient norm is weakly lower semicontinuous. The resulting minimizer solves the weak Poisson equation by its first variation.[ref]
Partial Differential Equations by John K. Hunter. Chapter 4, §4.2, variational formulation and the minimizing-sequence approach
Strict convexity gives uniqueness when the admissible class is convex. The oscillating minimizing sequence with no minimizer shows what can fail without suitable lower semicontinuity.The Direct Method in the calculus of variations is a powerful approach used to find the extrema (minima or maxima) of functionals, which are mappings from a space of functions to the real numbers. This method primarily involves establishing the existence of a solution to a variational problem and typically uses concepts from analysis, compactness, and weak convergence.
New to topics? Read the docs here!