Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.48 — for p > n, uniform Lᵖ gradient bounds with support in Ω give precompactness in C₀(ℝⁿ)

Proved
HunterPDE.Compactness.compact_embedding_C0

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

arzela-ascolicompact-embeddingp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1pdesobolev-spaces

Let Ω\OmegaΩ be a bounded open set in Rn\mathbb{R}^nRn, and n<p<∞n < p < \inftyn<p<∞. Suppose that F\mathcal{F}F is a set of functions whose weak derivative belongs to Lp(Rn)L^p(\mathbb{R}^n)Lp(Rn) such that: (a) supp⁡f⋐Ω\operatorname{supp} f \Subset \Omegasuppf⋐Ω; (b) there exists a constant CCC such that

∥Df∥Lp≤Cfor all f∈F.\|Df\|_{L^p} \le C \qquad \text{for all } f \in \mathcal{F}.∥Df∥Lp​≤Cfor all f∈F.

Then F\mathcal{F}F is precompact in C0(Rn)C_0(\mathbb{R}^n)C0​(Rn).

This is the supercritical companion of the Rellich–Kondrachov theorem. Above the dimension, gradient bounds give uniform bounds and equicontinuity, so the compactness is in the uniform norm.

Formalization Note. Each f:Rn→Rf : \mathbb{R}^n \to \mathbb{R}f:Rn→R is locally integrable, with weak first partials ∂if∈Lp(Rn)\partial_i f \in L^p(\mathbb{R}^n)∂i​f∈Lp(Rn). supp⁡f⋐Ω\operatorname{supp} f \Subset \Omegasuppf⋐Ω means that fff vanishes a.e. outside some compact K⊆ΩK \subseteq \OmegaK⊆Ω. ∥Df∥Lp\|Df\|_{L^p}∥Df∥Lp​ is the LpL^pLp norm of the Euclidean length of the weak gradient, and CCC is uniform over F\mathcal{F}F. The conclusion states that every fff has a representative in Mathlib's C₀(ℝⁿ, ℝ) (a continuous representative is unique), and that the set of these representatives has compact closure in the sup norm. n≥1n \ge 1n≥1 is assumed, as the book's Rn\mathbb{R}^nRn always has it; the statement is false on R0\mathbb{R}^0R0.

Preamble
import Mathlib
import Definitions.Def_HunterPDE_Shared_WeakDeriv

open MeasureTheory
open scoped ENNReal NNReal ZeroAtInfty
Formal statement
namespace HunterPDE.Compactness

/-- Theorem 3.48 of Hunter, *Notes on PDEs* (revised 6/18/2014), p. 75: let `Ω` be a bounded open
set in `ℝⁿ` and `n < p < ∞`. Suppose that `F` is a set of functions whose weak derivative belongs
to `Lᵖ(ℝⁿ)` such that (a) `supp f ⋐ Ω`; (b) there is a constant `C` with `‖Df‖_{Lᵖ} ≤ C` for all
`f ∈ F`. Then `F` is precompact in `C₀(ℝⁿ)`.
Each `f` is locally integrable on `ℝⁿ` with weak first partials `∂ᵢf ∈ Lᵖ(ℝⁿ)`; `supp f ⋐ Ω`
is: `f` vanishes a.e. outside a compact `K ⊆ Ω`; `‖Df‖_{Lᵖ}` is the `Lᵖ` norm of the Euclidean
length of the weak gradient. The conclusion says every `f` has a representative in `C₀(ℝⁿ)`
(continuous, vanishing at infinity; unique since continuous functions equal a.e. are equal), and
the set of these representatives has compact closure in the sup norm. `1 ≤ n` is the book's
standing `ℝⁿ` (the statement is false on `ℝ⁰`). -/
theorem compact_embedding_C0 {n : ℕ} (hn : 1 ≤ n) (Ω : Set (EuclideanSpace ℝ (Fin n)))
    (hΩ : IsOpen Ω) (hΩb : Bornology.IsBounded Ω) (p : ℝ) (hnp : (n : ℝ) < p)
    (F : Set (EuclideanSpace ℝ (Fin n) → ℝ))
    (hFD : ∀ f ∈ F, ∀ i : Fin n, ∃ g : EuclideanSpace ℝ (Fin n) → ℝ,
      Shared.HasWeakDeriv Set.univ (Pi.single i 1) f g ∧ MemLp g (ENNReal.ofReal p) volume)
    (hFsupp : ∀ f ∈ F, ∃ K : Set (EuclideanSpace ℝ (Fin n)), IsCompact K ∧ K ⊆ Ω ∧
      ∀ᵐ x ∂volume, x ∉ K → f x = 0)
    (hFb : ∃ C : ℝ≥0, ∀ f ∈ F,
      eLpNorm (Shared.weakGradNorm Set.univ f) (ENNReal.ofReal p) volume ≤ (C : ℝ≥0∞)) :
    (∀ f ∈ F, ∃ u : C₀(EuclideanSpace ℝ (Fin n), ℝ), (u : EuclideanSpace ℝ (Fin n) → ℝ) =ᵐ[volume] f) ∧
      IsCompact (closure {u : C₀(EuclideanSpace ℝ (Fin n), ℝ) |
        ∃ f ∈ F, (u : EuclideanSpace ℝ (Fin n) → ℝ) =ᵐ[volume] f}) := by sorry

end HunterPDE.Compactness
Source
Hunter, Notes on Partial Differential Equations (revised 6/18/2014), p. 75, Theorem 3.48
Read-back

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

Setting. Let n≥1n \ge 1n≥1 and let λ\lambdaλ be Lebesgue measure on Rn\mathbb{R}^nRn (Euclidean norm).

  • Ω⊆Rn\Omega \subseteq \mathbb{R}^nΩ⊆Rn is open and bounded.
  • ppp is a real number with p>np > np>n, so 1<p<∞1 < p < \infty1<p<∞ and the exponent used is exactly ppp.
  • FFF is a set of functions f:Rn→Rf : \mathbb{R}^n \to \mathbb{R}f:Rn→R.

Hypotheses on FFF.

  1. Weak derivatives in LpL^pLp. For every f∈Ff \in Ff∈F and every coordinate i∈{1,…,n}i \in \{1,\dots,n\}i∈{1,…,n} there is a g∈Lp(Rn)g \in L^p(\mathbb{R}^n)g∈Lp(Rn) satisfying an imported predicate "ggg is a weak derivative of fff on Rn\mathbb{R}^nRn for the unit multi-index eie_iei​". That predicate's definition is not included. fff itself is not assumed to lie in LpL^pLp.
  2. Support inside Ω\OmegaΩ. For every f∈Ff \in Ff∈F there is a compact K⊆ΩK \subseteq \OmegaK⊆Ω such that, for λ\lambdaλ-a.e. xxx, x∉Kx \notin Kx∈/K implies f(x)=0f(x) = 0f(x)=0.
  3. Uniform gradient bound. There is a C∈[0,∞)C \in [0,\infty)C∈[0,∞) such that for every f∈Ff \in Ff∈F
(∫Rn∣Gf(x)∣p dx)1/p≤C,\Bigl(\int_{\mathbb{R}^n} |G_f(x)|^p\,dx\Bigr)^{1/p} \le C,(∫Rn​∣Gf​(x)∣pdx)1/p≤C,

where GfG_fGf​ is the imported function weakGradNorm evaluated at fff on Rn\mathbb{R}^nRn. Its definition is not included; its name indicates the pointwise Euclidean length of the weak gradient.

Conclusion. Let C0(Rn)C_0(\mathbb{R}^n)C0​(Rn) be the space of continuous real functions on Rn\mathbb{R}^nRn tending to 000 at infinity, with the supremum norm.

  • (a) Every f∈Ff \in Ff∈F agrees λ\lambdaλ-a.e. with some u∈C0(Rn)u \in C_0(\mathbb{R}^n)u∈C0​(Rn).
  • (b) Let S={u∈C0(Rn):u=f a.e. for some f∈F}S = \{u \in C_0(\mathbb{R}^n) : u = f \text{ a.e. for some } f \in F\}S={u∈C0​(Rn):u=f a.e. for some f∈F}. The closure of SSS in C0(Rn)C_0(\mathbb{R}^n)C0​(Rn), in the sup-norm topology, is compact.

Degenerate cases.

  • FFF empty. SSS is empty and both conclusions hold trivially.
  • Ω\OmegaΩ empty. The only compact subset of Ω\OmegaΩ is ∅\emptyset∅, so hypothesis 2 forces f=0f = 0f=0 a.e. Then u=0u = 0u=0 and S⊆{0}S \subseteq \{0\}S⊆{0}.
  • n=0n = 0n=0. Excluded by the hypothesis n≥1n \ge 1n≥1.
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