Theorem 3.45 — Rellich–Kondrachov: bounded sets in W^{1,p}_0(Ω) are precompact in L^q
ProvedHunterPDE.Compactness.rellich_kondrachovLet be a bounded open set in , , and . If is a bounded set in , that is, for all , then is precompact in :
Equivalently, every bounded sequence in has a subsequence converging in . This compact embedding underlies the Fredholm theory and spectral theory of elliptic operators on bounded domains. Both boundedness of and are necessary.
Formalization Note. is real with , and with (so is finite). Elements of are functions in MemW0 1 p Ω with a common bound on sobolevNorm 1 p Ω. They are placed in by extension by zero, Ω.indicator f. The conclusion states that every extension is in , and that the set of their classes in Mathlib's Lp ℝ q volume has compact closure.
import Mathlib import Definitions.Def_HunterPDE_Compactness_Sobolev open MeasureTheory open scoped ENNReal NNReal
namespace HunterPDE.Compactness
/-- Theorem 3.45 of Hunter, *Notes on PDEs* (revised 6/18/2014), p. 73 (Rellich–Kondrachov): let
`Ω` be a bounded open set in `ℝⁿ`, `1 ≤ p < n` and `1 ≤ q < p* = np/(n − p)`. If `F` is a bounded
set in `W^{1,p}_0(Ω)`, then `F` is precompact in `L^q(ℝⁿ)`.
Elements of `F` are functions `ℝⁿ → ℝ` in `W^{1,p}_0(Ω)` (closure of `C_c^∞(Ω)` in the
`W^{1,p}(Ω)` norm) with a common bound on `‖f‖_{W^{1,p}(Ω)}`; they are placed in `L^q(ℝⁿ)` by
extension by zero outside `Ω` (`Ω.indicator f`). The conclusion says every extension lies in
`L^q(ℝⁿ)` and the set of their classes has compact closure in `L^q(ℝⁿ)`. -/
theorem rellich_kondrachov {n : ℕ} (Ω : Set (EuclideanSpace ℝ (Fin n))) (hΩ : IsOpen Ω)
(hΩb : Bornology.IsBounded Ω) (p : ℝ) (hp : 1 ≤ p) (hpn : p < n)
(q : ℝ≥0∞) [Fact (1 ≤ q)] (hq : q < ENNReal.ofReal (sobolevConjugate n p))
(F : Set (EuclideanSpace ℝ (Fin n) → ℝ))
(hF : ∀ f ∈ F, MemW0 1 (ENNReal.ofReal p) Ω f)
(hFb : ∃ M : ℝ≥0, ∀ f ∈ F, sobolevNorm 1 (ENNReal.ofReal p) Ω f ≤ (M : ℝ≥0∞)) :
(∀ f ∈ F, MemLp (Ω.indicator f) q volume) ∧
IsCompact (closure {u : Lp ℝ q (volume : Measure (EuclideanSpace ℝ (Fin n))) |
∃ f ∈ F, (u : EuclideanSpace ℝ (Fin n) → ℝ) =ᵐ[volume] Ω.indicator f}) := by sorry
end HunterPDE.Compactness
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be a natural number and let be -dimensional Euclidean space, with coordinates indexed by . It carries its Euclidean norm and Lebesgue measure . The statement takes the following data and hypotheses:
- a set that is open and bounded (bounded in the metric sense);
- a real number with and , where is regarded as a real number;
- an extended nonnegative real exponent with (a standing typeclass assumption) and
Here is a real-valued function defined in the imported module Definitions.Def_HunterPDE_Compactness_Sobolev. Its formula is not shown in this code and is not unfolded here. converts a real number to an extended nonnegative real: it sends negative numbers to and is always finite.
- a set of functions , each defined on all of , such that:
- every satisfies , a predicate from the same imported module. By its name it is membership in a space "", but its actual definition is not visible here and is not unfolded.
- there is a single constant such that for every
Here $\mathrm{sobolevNorm}$ is another imported definition, whose value lies in $[0,\infty]$. Because of this bound, it is finite on $F$.
Under these hypotheses, the statement concludes both of the following:
- For every , the zero extension (equal to on and off ) is in . That is, it is almost-everywhere strongly measurable and has finite seminorm; when , this means it is essentially bounded.
- Let be the set of elements of the Banach space (functions identified when equal -almost everywhere) for which some satisfies -almost everywhere. Then the closure of in the -norm topology is compact.
Only the values of each on enter the conclusion. How the hypotheses constrain depends entirely on the imported definitions and . The exponent is tied to only through . Nothing requires or . The Sobolev exponent is fixed at order , and enters those definitions only as .
Degenerate cases:
- or : the hypotheses and cannot both hold, so the statement is vacuously true. It says something only when .
- : excluded, because is finite and must be strictly smaller.
- : if (for example, if the imported formula produced a non-positive value, which turns into ), no satisfies both and , and the statement is vacuous. Whether this can happen for depends on the unseen definition of .
- empty: both conclusions hold trivially. The first is vacuous, and is empty, so its closure is empty and therefore compact.
- empty: every is the zero function. So whenever is nonempty, and the conclusion is automatic. Whether any satisfies on the empty set depends on the imported definition.
- Hidden conventions: any default or conventional values inside , or (for example, division by zero in , or how weak derivatives are handled for non-integrable ) cannot be seen from this code. The statement inherits whatever those definitions assign.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.