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.A Lavrentiev gap is a strict change in an infimum when the admissible regularity class is restricted, despite retaining the same endpoint values. For example with has value zero at the absolutely continuous function . Every Lipschitz competitor has a uniform positive lower energy bound. Indeed its ratio to starts at zero, so let be its first crossing of . Before that point, . Holder inequality givesThus . This proves a gap directly. The example's integrand lacks a uniform superlinear lower bound along its zero set; it illustrates the admissible-class issue rather than by itself furnishing a counterexample under stronger coercivity assumptions.
For with endpoint values zero and one, the zero-penalty minimizer has infinite derivative penalty. Use instead. The mismatch is at most , while the derivative penalty is . Balancing and by gives an upper energy bound of order . Nonnegativity then proves convergence of minimum energies to zero. This is a recovery construction; no claim of a matching lower asymptotic constant is needed.
For a scalar fixed-endpoint problem on a bounded interval, suppose the continuous integrand is convex in and satisfies , where is nonnegative convex and . If there is one admissible absolutely continuous function of finite energy, a global minimizer exists in .
The lower bound gives uniform integrability of derivatives in a minimizing sequence. Fixed endpoint values then give boundedness and equicontinuity of the functions. Extract uniform convergence of the functions and weak convergence of their derivatives; the limit retains the endpoint values. Convexity in the derivative gives weak lower semicontinuity of convex gradient energies, so the limit attains the infimum. Strict convexity of the full integrand on a convex admissible class additionally gives uniqueness.
Suppose the domain has finite measure and is convex, with and . The supporting inequality , integrated with , gives . The last term tends to zero by weak convergence of the gradients and the fixed test field . This proves weak lower semicontinuity without requiring pointwise convergence of gradients.
For a bounded domain, bounded symmetric uniformly elliptic , bounded real , and a boundary lift , minimizing on solves . The nonnegative quadratic terms are weakly lower semicontinuous, and Poincaré inequality makes the gradient norm coercive on the zero-boundary part. The first variation gives the weak equation with the forcing sign displayed above. If is positive, coercivity may fail at a Dirichlet eigenvalue; orthogonality to the homogeneous kernel is then needed for solvability.
For real , this energy functional on is coercive and attains its minimum by the direct method in the calculus of variations. The nonnegative potential term is weakly lower semicontinuous by local Sobolev compactness gives lower semicontinuity of a nonnegative integral. Its Euler-Lagrange equation is in the weak solution sense. The extra linear restoring term screens the Sine-Gordon equation nonlinearity. The scalar potential is convex because ; hence any weak critical point is a minimizer. The elliptic regularity estimate for , together with , gives . The Sobolev inequality then puts in , so Morrey's inequality and uniformly continuous integrable functions vanish at infinity give a continuous representative tending to zero.
Take , and on . Set . Both functions are smooth and belong to L2 space, and . The strictly increasing reaction has , whileConsequently . This is a minimizer of the screened sine-Gordon energy: it solves the Euler-Lagrange equation and that energy is convex. Thus even the minimizing and smooth hypotheses do not justify the stronger source-size bound. The appropriate general estimate is maximum bound for a monotone reaction term.
A minimizing sequence satisfies . Coercivity bounds an appropriate sublevel set, Compactness supplies a convergent subsequence, and sequential lower semicontinuity turns its limit into a global minimizer.
A minimizing sequence can converge uniformly while its derivatives keep oscillating between distinct energy wells. For the functional , with zero endpoint values and Lipschitz admissible functions, the triangular waves displayed above have slopes almost everywhere and height . Direct integration gives . Nonnegativity therefore makes the infimum zero. Attainment would require both and almost everywhere, an impossibility. The uniform limit is zero but its energy is ; thus the energy fails to be lower semicontinuous for this convergence. The example explains why control of function values alone cannot replace suitable convexity in the derivative variable in the direct method in the calculus of variations.
Boundary data satisfy the bounded slope condition with constant if, at every boundary point , there are affine functions and such thatand . Both the touching condition and the common slope bound matter; arbitrary affine upper/lower bounds would be much weaker.
An affine datum satisfies the condition with , using that same affine function for both supports. For a suitable convex variational problem on a convex domain, these supports serve as barriers through the comparison principle for convex variational integrals. Translation comparisons then produce a global Lipschitz continuity bound. This consequence requires the structural and boundary hypotheses of the variational problem, rather than following from the boundary inequalities alone.
One precise comparison principle for convex variational integrals concerns minimizers of on a bounded Lipschitz domain. Let , take differentiable strictly convex with , and let be weak stationary solutions whose boundary traces satisfy . Then almost everywhere in the domain.
Use , the positive part of the difference. Its zero trace makes it an admissible test in the two weak Euler-Lagrange equations. Subtracting givesStrict convexity makes the integrand positive unless the two gradients agree. Hence almost everywhere, and the zero-trace Poincaré inequality forces . The growth bound makes these test pairings integrable.
This proves why ordered affine solutions can bound a minimizer in the bounded slope condition argument. Convexity without further strictness or uniqueness is insufficient to order every pair of minimizers: if , every admissible function minimizes the energy and two equal-boundary competitors can cross.
Articles by others on the same topic
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.