Theorem 3.48 — for p > n, uniform Lᵖ gradient bounds with support in Ω give precompactness in C₀(ℝⁿ)
ProvedHunterPDE.Compactness.compact_embedding_C0Let be a bounded open set in , and . Suppose that is a set of functions whose weak derivative belongs to such that: (a) ; (b) there exists a constant such that
Then is precompact in .
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 is locally integrable, with weak first partials . means that vanishes a.e. outside some compact . is the norm of the Euclidean length of the weak gradient, and is uniform over . The conclusion states that every 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. is assumed, as the book's always has it; the statement is false on .
import Mathlib import Definitions.Def_HunterPDE_Shared_WeakDeriv open MeasureTheory open scoped ENNReal NNReal ZeroAtInfty
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
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. Let and let be Lebesgue measure on (Euclidean norm).
- is open and bounded.
- is a real number with , so and the exponent used is exactly .
- is a set of functions .
Hypotheses on .
- Weak derivatives in . For every and every coordinate there is a satisfying an imported predicate " is a weak derivative of on for the unit multi-index ". That predicate's definition is not included. itself is not assumed to lie in .
- Support inside . For every there is a compact such that, for -a.e. , implies .
- Uniform gradient bound. There is a such that for every
where is the imported function weakGradNorm evaluated at on . Its definition is not included; its name indicates the pointwise Euclidean length of the weak gradient.
Conclusion. Let be the space of continuous real functions on tending to at infinity, with the supremum norm.
- (a) Every agrees -a.e. with some .
- (b) Let . The closure of in , in the sup-norm topology, is compact.
Degenerate cases.
- empty. is empty and both conclusions hold trivially.
- empty. The only compact subset of is , so hypothesis 2 forces a.e. Then and .
- . Excluded by the hypothesis .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.