Direct method under a subcritical constraint #
Minimising the H₀¹ norm over the functions of unit L^q(Ω) norm has a solution when
q < 2⋆. This is the direct method of the calculus of variations, and it is where the two
halves of the compactness chapter meet: EllipticPdes.Analysis.exists_weakLimit supplies a
weak limit of a minimising sequence, and
EllipticPdes.Embedding.rellichEmbL_isCompact_of_lt supplies the strong L^q convergence
that takes the constraint to that limit.
At q = 2⋆ the second half fails, which EllipticPdes.Embedding.not_isCompactOperator_critEmb
records, and the minimum need not be attained. That is the exponent restriction Guo writes as
p + 1 < 2⋆ for the semilinear problem -Δu = u^p, whose Euler-Lagrange equation this
minimiser solves once the constraint is differentiated.
Main declarations #
EllipticPdes.Embedding.exists_minimiser_of_lt: the minimiser exists.EllipticPdes.Embedding.exists_weakSolution_semilinear_of_lt: it solves the equation.
References #
James Guo, Partial Differential Equations, Section IX.1; L. C. Evans, Partial Differential Equations (2nd ed.), §8.2.
Direct method. Below the critical exponent the H₀¹ norm attains its minimum on the
functions of unit L^q norm.
The constraint set is inhabited: a renormalised bump sits on it.
Minimiser as a weak solution. Differentiating the constraint through
EllipticPdes.Analysis.euler_lagrange_of_norm_min turns the subcritical minimiser into a weak
solution of -Δu + u = λ|u|^{q-2}u on the unit ball, with λ = ‖u‖²_{H₀¹}: the graph inner
product ⟪U, V⟫ is ∫ uv + ∫ ∇u · ∇v, so the identity below is the weak form of that equation.
The multiplier is the square of the minimum, so no unknown constant survives.