Theorem 3.41 — bounded linear extension W^{1,p}(ℝⁿ₊) → W^{1,p}(ℝⁿ)
ProvedHunterPDE.Compactness.halfSpace_extensionThere is a bounded linear map such that pointwise a.e. in and, for some constant ,
Extension operators let results proved on all of (density, embeddings, compactness) be transferred to the half-space, and through local flattening to smooth domains.
Formalization Note. The dimension is , and ranges over (Definition 3.23's range; the page states no restriction). acts on functions . It is required to be linear up to a.e. equality on , to map it into , to agree with a.e. on , and to obey the norm bound. and depend only on and .
import Mathlib import Definitions.Def_HunterPDE_Compactness_Sobolev import Definitions.Def_HunterPDE_Compactness_HalfSpace open MeasureTheory open scoped ENNReal NNReal
namespace HunterPDE.Compactness
/-- Theorem 3.41 of Hunter, *Notes on PDEs* (revised 6/18/2014), pp. 71–72: there is a bounded
linear map `E : W^{1,p}(ℝⁿ₊) → W^{1,p}(ℝⁿ)` such that `Ef = f` pointwise a.e. in `ℝⁿ₊` and, for
some constant `C = C(n, p)`, `‖Ef‖_{W^{1,p}(ℝⁿ)} ≤ C ‖f‖_{W^{1,p}(ℝⁿ₊)}`.
The dimension is `n = m + 1` and `1 ≤ p ≤ ∞` (the range of Definition 3.23). Functions are
`ℝⁿ → ℝ`, of which only the values on `ℝⁿ₊` matter for the input; `E` is linear up to a.e.
equality on `W^{1,p}(ℝⁿ₊)` (elements of Sobolev spaces are a.e.-classes), and `C` and `E` are
chosen after `m` and `p` only. -/
theorem halfSpace_extension (m : ℕ) (p : ℝ≥0∞) (hp : 1 ≤ p) :
∃ (C : ℝ≥0) (E : (EuclideanSpace ℝ (Fin (m + 1)) → ℝ) → EuclideanSpace ℝ (Fin (m + 1)) → ℝ),
(∀ f g : EuclideanSpace ℝ (Fin (m + 1)) → ℝ,
MemW 1 p (upperHalfSpace m) f → MemW 1 p (upperHalfSpace m) g → ∀ a b : ℝ,
E (a • f + b • g) =ᵐ[volume] a • E f + b • E g) ∧
∀ f : EuclideanSpace ℝ (Fin (m + 1)) → ℝ, MemW 1 p (upperHalfSpace m) f →
MemW 1 p Set.univ (E f) ∧
E f =ᵐ[volume.restrict (upperHalfSpace m)] f ∧
sobolevNorm 1 p Set.univ (E f) ≤ (C : ℝ≥0∞) * sobolevNorm 1 p (upperHalfSpace m) f := by sorry
end HunterPDE.Compactness
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Notation. Let , let , and let ; the hypothesis is , and is allowed.
- is the open upper half-space (last coordinate positive).
- is Lebesgue measure on .
Sobolev membership. For and , "" means the following. For each multi-index of order , there is a with satisfying an imported predicate "weak -derivative of on ". The multi-indices of order are the zero multi-index and the unit multi-indices . The imported predicate's definition is not included.
Sobolev norm. is built from imported chosen functions , whose definition is not included:
Claim. There exist a constant and a map from functions to functions , both depending only on and , such that:
- Linearity up to null sets. For all and all real : for -a.e. point of .
- The extension property. For every :
- (membership with the whole space);
- at -a.e. point of ;
- the norm bound holds:
Unconstrained points.
- Nothing is said about on functions outside .
- Two inputs that agree on are not required to have the same image.
- The norm bound is an inequality in , where .
Degenerate cases. For the space is and . The constant is allowed to be . Whether is finite for depends on the imported chosen derivatives, which are not shown.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.