Theorem 3.44 — the trace operator W^{1,p}(ℝⁿ₊) → Lᵖ(∂ℝⁿ₊) and its kernel W^{1,p}_0(ℝⁿ₊)
ProvedHunterPDE.Compactness.halfSpace_traceFor there is a bounded linear operator such that for every , and
for some constant depending only on . Furthermore, if and only if .
The trace gives boundary values to Sobolev functions, which have no pointwise values on the null set . It identifies as the space of functions that vanish on the boundary, which is the setting of Dirichlet problems.
Formalization Note. , and is identified with through with Lebesgue measure. is quantified before , as the page says it depends only on . The page's last sentence reads ""; it is formalized with , the space acts on, since for the converse fails (the notes observe on p. 73 that is the Dirichlet condition). is linear up to a.e. equality on , and holds for a.e. .
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.44 of Hunter, *Notes on PDEs* (revised 6/18/2014), p. 72: for `1 ≤ p < ∞` there is a
bounded linear operator `T : W^{1,p}(ℝⁿ₊) → Lᵖ(∂ℝⁿ₊)` such that `(Tf)(x′) = f(x′, 0)` for every
`f ∈ C_c^∞(ℝ̄ⁿ₊)` and `‖Tf‖_{Lᵖ(ℝⁿ⁻¹)} ≤ C ‖f‖_{W^{1,p}(ℝⁿ₊)}` for some constant `C` depending
only on `p`. Furthermore, `f ∈ W^{1,p}_0(ℝⁿ₊)` if and only if `Tf = 0`.
The dimension is `n = m + 1`, and `∂ℝⁿ₊` is identified with `ℝⁿ⁻¹ = ℝᵐ` through
`x′ ↦ (x′, 0)`; `C` is chosen before `m`, as the page says it depends only on `p`. The page's
"`f ∈ W^{k,p}_0(ℝⁿ₊)`" is read with `k = 1`, the space `T` acts on (for `k ≥ 2` the converse fails,
as the notes observe on p. 73). `T` is linear up to a.e. equality on `W^{1,p}(ℝⁿ₊)`. -/
theorem halfSpace_trace (p : ℝ≥0∞) (hp : 1 ≤ p) (hp' : p ≠ ∞) :
∃ C : ℝ≥0, ∀ m : ℕ, ∃ T : (EuclideanSpace ℝ (Fin (m + 1)) → ℝ) → EuclideanSpace ℝ (Fin m) → ℝ,
(∀ f g : EuclideanSpace ℝ (Fin (m + 1)) → ℝ,
MemW 1 p (upperHalfSpace m) f → MemW 1 p (upperHalfSpace m) g → ∀ a b : ℝ,
T (a • f + b • g) =ᵐ[volume] a • T f + b • T g) ∧
(∀ f : EuclideanSpace ℝ (Fin (m + 1)) → ℝ, MemW 1 p (upperHalfSpace m) f →
MemLp (T f) p volume ∧
eLpNorm (T f) p volume ≤ (C : ℝ≥0∞) * sobolevNorm 1 p (upperHalfSpace m) f) ∧
(∀ f : EuclideanSpace ℝ (Fin (m + 1)) → ℝ, IsSmoothCompactClosedHalfSpace f →
T f =ᵐ[volume] fun x' => f (boundaryPoint x')) ∧
(∀ f : EuclideanSpace ℝ (Fin (m + 1)) → ℝ, MemW 1 p (upperHalfSpace m) f →
(MemW0 1 p (upperHalfSpace m) f ↔ T f =ᵐ[volume] 0)) := by sorry
end HunterPDE.Compactness
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Notation. Let : the hypotheses say and . For each :
- is the open upper half-space and its closure .
- is Lebesgue measure on .
- For , is with appended as the last coordinate.
Sobolev membership. "" means: for the zero multi-index and each unit multi-index , there is a satisfying an imported predicate "weak derivative of on ". That predicate's definition is not included.
Sobolev norm. is built from imported chosen functions , whose definition is not included:
membership. "" means both of the following:
- ;
- for every there is a satisfying an imported predicate "test function on " with . That predicate's definition is not included.
Claim. There is one constant , the same for every dimension, such that for every there is a map from functions to functions with the following four properties:
- Linearity up to null sets. For all and real : at -a.e. point.
- Boundedness. For every : and
- Agreement with boundary values. For every that is within and vanishes on outside some compact set (with no membership in assumed): for -a.e. .
- Characterisation of . For every : if and only if -a.e.
Unconstrained points.
- Nothing is said about on other inputs.
- Inputs agreeing on are not required to have the same image.
Degenerate cases.
- . is a single point carrying unit mass. "Almost everywhere" then means "at that point", and the norm of is . Property 3 reads for such on . Property 4 says iff .
- . The constant is allowed to be .
- . In the definition, is permitted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.