Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.31 — W^{1,p}(ℝⁿ) ↪ L^q(ℝⁿ) for p ≤ q ≤ p*

Proved
HunterPDE.Sobolev.sobolev_embedding_Lq

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1pdesobolev-embeddingsobolev-spaces

Let 1≤p<n1 \le p < n1≤p<n and p≤q≤p∗p \le q \le p^*p≤q≤p∗, where p∗=np/(n−p)p^* = np/(n-p)p∗=np/(n−p) is the Sobolev conjugate of ppp. Then W1,p(Rn)↪Lq(Rn)W^{1,p}(\mathbb{R}^n) \hookrightarrow L^q(\mathbb{R}^n)W1,p(Rn)↪Lq(Rn): there is a constant C=C(n,p,q)C = C(n, p, q)C=C(n,p,q) such that every f∈W1,p(Rn)f \in W^{1,p}(\mathbb{R}^n)f∈W1,p(Rn) belongs to Lq(Rn)L^q(\mathbb{R}^n)Lq(Rn) and

∥f∥q≤C ∥f∥W1,p.\|f\|_q \le C\, \|f\|_{W^{1,p}} .∥f∥q​≤C∥f∥W1,p​.

This is the Sobolev embedding theorem for p<np < np<n on the whole space, obtained from Theorem 3.28 at q=p∗q = p^*q=p∗ by density (Theorem 3.24), and from interpolation between LpL^pLp and Lp∗L^{p^*}Lp∗ for intermediate qqq.

Formalization Note. W1,p(Rn)W^{1,p}(\mathbb{R}^n)W1,p(Rn) and its norm are those of Definition 3.23 (MemW 1 p univ, sobolevNorm 1 p univ). The constant is a nonnegative real chosen after n,p,qn, p, qn,p,q and before fff. The standing assumption n≥2n \ge 2n≥2 of §3.7 is implied by 1≤p<n1 \le p < n1≤p<n.

Preamble
import Mathlib
import Definitions.Def_HunterPDE_Sobolev_SobolevSpace
import Definitions.Def_HunterPDE_Sobolev_SobolevConjugate

open MeasureTheory
Formal statement
namespace HunterPDE.Sobolev

/-- Theorem 3.31 of Hunter, *Notes on PDEs* (revised 6/18/2014), p. 66: if `1 ≤ p < n` and
`p ≤ q ≤ p*`, then `W^{1,p}(ℝⁿ) ↪ L^q(ℝⁿ)`: there is a constant `C = C(n, p, q)` such that every
`f ∈ W^{1,p}(ℝⁿ)` lies in `L^q(ℝⁿ)` with `‖f‖_q ≤ C ‖f‖_{W^{1,p}}`. The constant is chosen after
`n, p, q` and before `f`. -/
theorem sobolev_embedding_Lq {n : ℕ} {p q : ℝ} (hp : 1 ≤ p) (hpn : p < n) (hpq : p ≤ q)
    (hq : q ≤ sobolevConjugate n p) :
    ∃ C : NNReal, ∀ f : EuclideanSpace ℝ (Fin n) → ℝ,
      MemW 1 (ENNReal.ofReal p) Set.univ f →
        MemLp f (ENNReal.ofReal q) volume ∧
          eLpNorm f (ENNReal.ofReal q) volume ≤
            (C : ENNReal) * sobolevNorm 1 (ENNReal.ofReal p) Set.univ f := by sorry

end HunterPDE.Sobolev
Source
Hunter, Notes on Partial Differential Equations (revised 6/18/2014), p. 66, Theorem 3.31
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

The names sobolevConjugate, MemW and sobolevNorm come from imported definition files whose text is not part of this declaration.

Let nnn be a natural number and p,qp, qp,q real numbers satisfying:

  • 1≤p1 \le p1≤p;
  • p<np < np<n;
  • p≤qp \le qp≤q;
  • q≤sobolevConjugate(n,p)q \le \texttt{sobolevConjugate}(n, p)q≤sobolevConjugate(n,p).

Then there exists a single constant C≥0C \ge 0C≥0, depending only on n,p,qn, p, qn,p,q and chosen before fff, with the following property. For every f:Rn→Rf : \mathbb{R}^n \to \mathbb{R}f:Rn→R such that MemW holds for order 111, exponent ppp and the whole space Rn\mathbb{R}^nRn, two conclusions hold.

First, f∈Lq(Rn)f \in L^q(\mathbb{R}^n)f∈Lq(Rn) with respect to Lebesgue measure. This means fff is a.e. strongly measurable and (∫∣f∣q)1/q<∞\left(\int |f|^q\right)^{1/q} < \infty(∫∣f∣q)1/q<∞.

Second,

(∫Rn∣f∣q dx)1/q  ≤  C⋅sobolevNorm(1, p, Rn, f),\Big(\int_{\mathbb{R}^n} |f|^q\,dx\Big)^{1/q} \;\le\; C \cdot \texttt{sobolevNorm}(1,\,p,\,\mathbb{R}^n,\,f),(∫Rn​∣f∣qdx)1/q≤C⋅sobolevNorm(1,p,Rn,f),

compared in [0,∞][0,\infty][0,∞].

The exponents ppp and qqq are passed as extended reals via the map sending negative reals to 000. Since q≥p≥1q \ge p \ge 1q≥p≥1, they are passed unchanged.

Degenerate cases. The conditions 1≤p<n1 \le p < n1≤p<n with nnn a natural number force n≥2n \ge 2n≥2, so n=0n = 0n=0 and n=1n = 1n=1 make the statement vacuous. Whether any qqq exists depends on the value of sobolevConjugate, which is not shown here. If sobolevConjugate(n,p)<p\texttt{sobolevConjugate}(n,p) < psobolevConjugate(n,p)<p, no qqq satisfies the hypotheses and the statement is vacuous for that ppp.

Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 2, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me