Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.44 — the trace operator W^{1,p}(ℝⁿ₊) → Lᵖ(∂ℝⁿ₊) and its kernel W^{1,p}_0(ℝⁿ₊)

Proved
HunterPDE.Compactness.halfSpace_trace

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

p2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1pdesobolev-spacestrace

For 1≤p<∞1 \le p < \infty1≤p<∞ there is a bounded linear operator T:W1,p(R+n)→Lp(∂R+n)T : W^{1,p}(\mathbb{R}^n_+) \to L^p(\partial\mathbb{R}^n_+)T:W1,p(R+n​)→Lp(∂R+n​) such that (Tf)(x′)=f(x′,0)(Tf)(x') = f(x', 0)(Tf)(x′)=f(x′,0) for every f∈Cc∞(R‾+n)f \in C_c^\infty(\overline{\mathbb{R}}^n_+)f∈Cc∞​(R+n​), and

∥Tf∥Lp(Rn−1)≤C ∥f∥W1,p(R+n)\|Tf\|_{L^p(\mathbb{R}^{n-1})} \le C \, \|f\|_{W^{1,p}(\mathbb{R}^n_+)}∥Tf∥Lp(Rn−1)​≤C∥f∥W1,p(R+n​)​

for some constant CCC depending only on ppp. Furthermore, f∈W01,p(R+n)f \in W^{1,p}_0(\mathbb{R}^n_+)f∈W01,p​(R+n​) if and only if Tf=0Tf = 0Tf=0.

The trace gives boundary values to Sobolev functions, which have no pointwise values on the null set ∂R+n\partial\mathbb{R}^n_+∂R+n​. It identifies W01,pW^{1,p}_0W01,p​ as the space of functions that vanish on the boundary, which is the setting of Dirichlet problems.

Formalization Note. n=m+1n = m + 1n=m+1, and ∂R+n\partial\mathbb{R}^n_+∂R+n​ is identified with Rm\mathbb{R}^mRm through x′↦(x′,0)x' \mapsto (x', 0)x′↦(x′,0) with Lebesgue measure. CCC is quantified before mmm, as the page says it depends only on ppp. The page's last sentence reads "f∈W0k,p(R+n)f \in W^{k,p}_0(\mathbb{R}^n_+)f∈W0k,p​(R+n​)"; it is formalized with k=1k = 1k=1, the space TTT acts on, since for k≥2k \ge 2k≥2 the converse fails (the notes observe on p. 73 that W2,p∩W01,pW^{2,p} \cap W^{1,p}_0W2,p∩W01,p​ is the Dirichlet condition). TTT is linear up to a.e. equality on W1,p(R+n)W^{1,p}(\mathbb{R}^n_+)W1,p(R+n​), and (Tf)(x′)=f(x′,0)(Tf)(x') = f(x',0)(Tf)(x′)=f(x′,0) holds for a.e. x′x'x′.

Preamble
import Mathlib
import Definitions.Def_HunterPDE_Compactness_Sobolev
import Definitions.Def_HunterPDE_Compactness_HalfSpace

open MeasureTheory
open scoped ENNReal NNReal
Formal statement
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
Source
Hunter, Notes on Partial Differential Equations (revised 6/18/2014), p. 72, Theorem 3.44
Read-back

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

Notation. Let p∈[1,∞)p \in [1,\infty)p∈[1,∞): the hypotheses say 1≤p1 \le p1≤p and p≠∞p \ne \inftyp=∞. For each m∈Nm \in \mathbb{N}m∈N:

  • Hm={x∈Rm+1:xm+1>0}H_m = \{x \in \mathbb{R}^{m+1} : x_{m+1} > 0\}Hm​={x∈Rm+1:xm+1​>0} is the open upper half-space and H‾m\overline{H}_mHm​ its closure {xm+1≥0}\{x_{m+1} \ge 0\}{xm+1​≥0}.
  • λm\lambda_mλm​ is Lebesgue measure on Rm\mathbb{R}^mRm.
  • For x′∈Rmx' \in \mathbb{R}^mx′∈Rm, (x′,0)∈Rm+1(x',0) \in \mathbb{R}^{m+1}(x′,0)∈Rm+1 is x′x'x′ with 000 appended as the last coordinate.

Sobolev membership. "f∈W1,p(Hm)f \in W^{1,p}(H_m)f∈W1,p(Hm​)" means: for the zero multi-index and each unit multi-index eie_iei​, there is a g∈Lp(Hm)g \in L^p(H_m)g∈Lp(Hm​) satisfying an imported predicate "weak derivative of fff on HmH_mHm​". That predicate's definition is not included.

Sobolev norm. ∥f∥1,p,Hm\|f\|_{1,p,H_m}∥f∥1,p,Hm​​ is built from imported chosen functions ∂αf\partial^\alpha f∂αf, whose definition is not included:

∥f∥1,p,Hm=(∫Hm∣∂0f∣p+∑i=1m+1∫Hm∣∂eif∣p)1/p.\|f\|_{1,p,H_m} = \Bigl(\int_{H_m} |\partial^0 f|^p + \sum_{i=1}^{m+1} \int_{H_m} |\partial^{e_i} f|^p\Bigr)^{1/p}.∥f∥1,p,Hm​​=(∫Hm​​∣∂0f∣p+i=1∑m+1​∫Hm​​∣∂ei​f∣p)1/p.

W01,pW^{1,p}_0W01,p​ membership. "f∈W01,p(Hm)f \in W^{1,p}_0(H_m)f∈W01,p​(Hm​)" means both of the following:

  • f∈W1,p(Hm)f \in W^{1,p}(H_m)f∈W1,p(Hm​);
  • for every ε∈(0,∞]\varepsilon \in (0,\infty]ε∈(0,∞] there is a φ\varphiφ satisfying an imported predicate "test function on HmH_mHm​" with ∥f−φ∥1,p,Hm<ε\|f - \varphi\|_{1,p,H_m} < \varepsilon∥f−φ∥1,p,Hm​​<ε. That predicate's definition is not included.

Claim. There is one constant C∈[0,∞)C \in [0,\infty)C∈[0,∞), the same for every dimension, such that for every m∈Nm \in \mathbb{N}m∈N there is a map TTT from functions Rm+1→R\mathbb{R}^{m+1} \to \mathbb{R}Rm+1→R to functions Rm→R\mathbb{R}^m \to \mathbb{R}Rm→R with the following four properties:

  1. Linearity up to null sets. For all f,g∈W1,p(Hm)f, g \in W^{1,p}(H_m)f,g∈W1,p(Hm​) and real a,ba, ba,b: T(af+bg)=a Tf+b TgT(af+bg) = a\,Tf + b\,TgT(af+bg)=aTf+bTg at λm\lambda_mλm​-a.e. point.
  2. Boundedness. For every f∈W1,p(Hm)f \in W^{1,p}(H_m)f∈W1,p(Hm​): Tf∈Lp(Rm)Tf \in L^p(\mathbb{R}^m)Tf∈Lp(Rm) and
(∫Rm∣Tf∣p dλm)1/p≤C ∥f∥1,p,Hm.\Bigl(\int_{\mathbb{R}^m} |Tf|^p\,d\lambda_m\Bigr)^{1/p} \le C\,\|f\|_{1,p,H_m}.(∫Rm​∣Tf∣pdλm​)1/p≤C∥f∥1,p,Hm​​.
  1. Agreement with boundary values. For every fff that is C∞C^\inftyC∞ within H‾m\overline{H}_mHm​ and vanishes on H‾m\overline{H}_mHm​ outside some compact set (with no membership in W1,p(Hm)W^{1,p}(H_m)W1,p(Hm​) assumed): (Tf)(x′)=f(x′,0)(Tf)(x') = f(x',0)(Tf)(x′)=f(x′,0) for λm\lambda_mλm​-a.e. x′x'x′.
  2. Characterisation of W01,pW^{1,p}_0W01,p​. For every f∈W1,p(Hm)f \in W^{1,p}(H_m)f∈W1,p(Hm​): f∈W01,p(Hm)f \in W^{1,p}_0(H_m)f∈W01,p​(Hm​) if and only if Tf=0Tf = 0Tf=0 λm\lambda_mλm​-a.e.

Unconstrained points.

  • Nothing is said about TTT on other inputs.
  • Inputs agreeing on HmH_mHm​ are not required to have the same image.

Degenerate cases.

  • m=0m = 0m=0. R0\mathbb{R}^0R0 is a single point carrying unit mass. "Almost everywhere" then means "at that point", and the LpL^pLp norm of TfTfTf is ∣Tf(pt)∣|Tf(\text{pt})|∣Tf(pt)∣. Property 3 reads Tf(pt)=f(0)Tf(\text{pt}) = f(0)Tf(pt)=f(0) for such fff on [0,∞)[0,\infty)[0,∞). Property 4 says f∈W01,p((0,∞))f \in W^{1,p}_0((0,\infty))f∈W01,p​((0,∞)) iff Tf(pt)=0Tf(\text{pt}) = 0Tf(pt)=0.
  • C=0C = 0C=0. The constant is allowed to be 000.
  • ε=∞\varepsilon = \inftyε=∞. In the W01,pW^{1,p}_0W01,p​ definition, ε=∞\varepsilon = \inftyε=∞ is permitted.
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