Math 2.0

Calculus of variations and optimal control; optimization Direct methods and existence of minimizers Theorem

Tonelli's existence theorem

Builds on Integral functional with a Lagrangian densitySobolev spaceConvex integrandCoercive functionalWeak lower semicontinuityDirect method in the calculus of variations

Statement

Let Ω⊆ℝn\Omega \subseteq \R^n be a bounded open set with Lipschitz boundary, and let 1<p<∞1 < p < \infty. Let L ⁣:Ω‾×ℝ×ℝn→ℝL \colon \overline{\Omega} \times \R \times \R^n \to \R, written L(x,u,ξ)L(x, u, \xi), be continuous. Assume:

  1. LL is a convex integrand: ξ↦L(x,u,ξ)\xi \mapsto L(x, u, \xi) is convex for all (x,u)(x, u);
  2. there are constants a>0a > 0 and b∈ℝb \in \R with L(x,u,ξ)≥a∣ξ∣p+bL(x, u, \xi) \ge a \abs{\xi}^p + b for all (x,u,ξ)(x, u, \xi).

Let u0u_0 be in the Sobolev space W1,p(Ω)W^{1,p}(\Omega) and let J(u)=∫ΩL(x,u,∇u) dxJ(u) = \int_\Omega L(x, u, \nabla u) \, dx, an integral functional. If J(u0)<+∞J(u_0) < +\infty, then JJ attains its minimum on u0+W01,p(Ω)u_0 + W^{1,p}_0(\Omega).

Remarks

The proof is the direct method. The growth bound and the Poincaré inequality make JJ coercive on u0+W01,p(Ω)u_0 + W^{1,p}_0(\Omega), so a minimising sequence is bounded in W1,p(Ω)W^{1,p}(\Omega). Since 1<p<∞1 < p < \infty, a subsequence converges weakly in W1,p(Ω)W^{1,p}(\Omega), and strongly in Lp(Ω)L^p(\Omega) by the Rellich–Kondrachov theorem. Convexity in ξ\xi makes JJ weakly lower semicontinuous, so the weak limit is a minimiser.

Example: for L=12∣ξ∣2+14u4L = \frac{1}{2} \abs{\xi}^2 + \frac{1}{4} u^4 and p=2p = 2, the theorem gives a minimiser with boundary values u0u_0 whenever J(u0)<+∞J(u_0) < +\infty; it is a weak solution of −Δu+u3=0-\Delta u + u^3 = 0.

Each hypothesis matters. For L=(ξ2−1)2+u2L = (\xi^2 - 1)^2 + u^2 with n=1n = 1 and u0=0u_0 = 0, convexity fails and there is no minimiser. For L=1+∣ξ∣2L = \sqrt{1 + \abs{\xi}^2}, which has growth p=1p = 1, minimisers of the area of a graph need not exist in W1,1W^{1,1} for some boundary data.

Going deeper

For a student

This is the model existence theorem of the calculus of variations, and it is the template for the direct method. The minimiser is a priori only a Sobolev function; whether it is smooth is the separate question of regularity, raised in Hilbert's nineteenth problem. For vector-valued uu, convexity can be weakened to Morrey quasiconvexity, and in nonlinear elasticity to polyconvexity, as in Ball's existence theorem. Without convexity one replaces the integrand by its convex envelope; this is relaxation, and it computes the limits of minimising sequences.

Reading path

To understand this page from the ground up, read these 7 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Coercive functional concept
  2. Convex integrand concept
  3. Direct method in the calculus of variations concept
  4. Integral functional with a Lagrangian density concept
  5. Sobolev space concept
  6. Weak lower semicontinuity concept
  7. Tonelli's existence theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Direct_method_in_the_calculus_of_variations
About this page
TagNJQRG3DVPP
URIm2://NJQRG3DVPP
Kindstatement, theorem
WritingW0 stub
MSC49J10, 49J45
StatusThis copy of the site has no build data. Run m2 status NJQRG3DVPP.
AboutDirect method in the calculus of variations
UsesIntegral functional with a Lagrangian density, Sobolev space, Convex integrand, Coercive functional, Weak lower semicontinuity, Direct method in the calculus of variations

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.