Theorem 3.28 — Gagliardo–Nirenberg–Sobolev inequality with an explicit constant
ProvedHunterPDE.Sobolev.gagliardo_nirenberg_sobolevLet , , and let be the Sobolev conjugate of (Definition 3.25). Then for every
where and is the Euclidean length of the gradient.
The inequality says that a compactly supported smooth function whose gradient is in is itself in , with : one derivative in buys integrability . It underlies every Sobolev embedding for , e.g. for (Theorem 3.31).
Formalization Note. The constant is times the constant printed in (3.11). With the Euclidean the printed constant is false: at it is , below the sharp constant the notes themselves quote on p. 65–66 ( the volume of the unit ball), and it is also below Talenti's sharp constant for some (e.g. , ). The error is in the last step of the proof, which replaces by . The proof's display with , which is correct, together with , gives the constant stated here. is EuclideanSpace ℝ (Fin n); is ‖gradient f x‖, which equals the operator norm of fderiv ℝ f x; norms are eLpNorm in with exponents ENNReal.ofReal p and ENNReal.ofReal p*; is ContDiff ℝ ((⊤ : ℕ∞) : WithTop ℕ∞) f ∧ HasCompactSupport f.
import Mathlib import Definitions.Def_HunterPDE_Sobolev_SobolevConjugate open MeasureTheory
namespace HunterPDE.Sobolev
/-- Theorem 3.28 of Hunter, *Notes on PDEs* (revised 6/18/2014), p. 63 (Gagliardo–Nirenberg–Sobolev
inequality), with the constant its proof establishes. Let `n ≥ 2`, `1 ≤ p < n` and
`p* = np/(n − p)` (Definition 3.25). Then for every `f ∈ C_c^∞(ℝⁿ)`
`‖f‖_{p*} ≤ C ‖Df‖_p` with `C = p(n − 1) / (2(n − p))`, where `|Df|` is the Euclidean norm of the
gradient. The printed constant (3.11), `p(n − 1)/(2n(n − p))`, is `1/n` times this and is false
with the Euclidean `|Df|` (it is below the book's own sharp constant `1/(n αₙ^{1/n})` at `p = 1`);
the proof's display `‖f‖_{p*} ≤ (s/2) (∏ᵢ ‖∂ᵢf‖_p)^{1/n}`, `s = p(n−1)/(n−p)`, together with
`|∂ᵢf| ≤ |Df|`, gives the constant stated here. -/
theorem gagliardo_nirenberg_sobolev {n : ℕ} (hn : 2 ≤ n) {p : ℝ} (hp : 1 ≤ p) (hpn : p < n)
(f : EuclideanSpace ℝ (Fin n) → ℝ) (hf : ContDiff ℝ ((⊤ : ℕ∞) : WithTop ℕ∞) f)
(hfc : HasCompactSupport f) :
eLpNorm f (ENNReal.ofReal (sobolevConjugate n p)) volume ≤
ENNReal.ofReal (p * ((n : ℝ) - 1) / (2 * ((n : ℝ) - p))) *
eLpNorm (fun x => ‖gradient f x‖) (ENNReal.ofReal p) volume := by sorry
end HunterPDE.Sobolev
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
The statement concerns a natural number , a real number and a function , where is the Euclidean space of real -tuples with the Euclidean () norm and inner product. The hypotheses are:
- ;
- and , with viewed as a real number;
- is infinitely differentiable () on all of ;
- has compact support, meaning the closure of is compact.
What it asserts. Write for the real number . The conclusion is
The pieces of this inequality are as follows.
- The norms. Both are extended-valued norms with respect to Lebesgue measure on . For this is , and it may equal .
- The exponents. Each exponent is passed through the map into before use.
- The gradient term. is the gradient of at , and is its Euclidean length. The right-hand norm is therefore that of the scalar function .
- The constant. is likewise passed through . Under the hypotheses it is strictly positive, so that map does not change it.
- The arithmetic. The product and the inequality are taken in the extended non-negative reals .
The exponent . Its definition lives in an imported module that was not provided to me, so I cannot unfold it. The statement says nothing more about than that it is the value of that imported function at . In particular, the conclusion is only as strong as that definition makes it.
Degenerate cases.
- Dimensions. and are excluded by . Since , the range is non-empty; for example always satisfies it. The hypotheses are therefore satisfiable.
- The zero function. is allowed. Both sides are then , and the claim holds trivially.
- Non-positive . If the imported definition gives for some admissible , the left-hand exponent becomes . By the library's convention an "norm" is , so the inequality would then hold trivially.
- Infinite exponent. The exponent cannot arise on either side, because each exponent is a real number mapped to .
- The right-hand exponent. Since , the right-hand exponent is exactly .
- The gradient's default value. The gradient's default value , used where is not differentiable, never applies, because is differentiable everywhere.
- Finiteness of the right side. Because is smooth and compactly supported, is continuous and compactly supported. Its norm is therefore finite, so the right side is a finite number.
- Infinite left side. The statement does not separately assert that the left side is finite. That follows from the inequality itself only because the right side is finite.
- The product . No convention is triggered, since the constant is strictly positive and the right-hand norm is finite.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.