Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.41 — bounded linear extension W^{1,p}(ℝⁿ₊) → W^{1,p}(ℝⁿ)

Proved
HunterPDE.Compactness.halfSpace_extension

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

extension-operatorp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1pdesobolev-spaces

There is a bounded linear map E:W1,p(R+n)→W1,p(Rn)E : W^{1,p}(\mathbb{R}^n_+) \to W^{1,p}(\mathbb{R}^n)E:W1,p(R+n​)→W1,p(Rn) such that Ef=fEf = fEf=f pointwise a.e. in R+n\mathbb{R}^n_+R+n​ and, for some constant C=C(n,p)C = C(n, p)C=C(n,p),

∥Ef∥W1,p(Rn)≤C ∥f∥W1,p(R+n).\|Ef\|_{W^{1,p}(\mathbb{R}^n)} \le C \, \|f\|_{W^{1,p}(\mathbb{R}^n_+)}.∥Ef∥W1,p(Rn)​≤C∥f∥W1,p(R+n​)​.

Extension operators let results proved on all of Rn\mathbb{R}^nRn (density, embeddings, compactness) be transferred to the half-space, and through local flattening to smooth domains.

Formalization Note. The dimension is n=m+1n = m + 1n=m+1, and ppp ranges over 1≤p≤∞1 \le p \le \infty1≤p≤∞ (Definition 3.23's range; the page states no restriction). EEE acts on functions Rn→R\mathbb{R}^n \to \mathbb{R}Rn→R. It is required to be linear up to a.e. equality on W1,p(R+n)W^{1,p}(\mathbb{R}^n_+)W1,p(R+n​), to map it into W1,p(Rn)W^{1,p}(\mathbb{R}^n)W1,p(Rn), to agree with fff a.e. on R+n\mathbb{R}^n_+R+n​, and to obey the norm bound. CCC and EEE depend only on mmm and ppp.

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.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
Source
Hunter, Notes on Partial Differential Equations (revised 6/18/2014), pp. 71–72, Theorem 3.41
Read-back

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

Notation. Let m∈Nm \in \mathbb{N}m∈N, let n=m+1n = m+1n=m+1, and let p∈[1,∞]p \in [1,\infty]p∈[1,∞]; the hypothesis is 1≤p1 \le p1≤p, and p=∞p = \inftyp=∞ is allowed.

  • H={x∈Rm+1:xm+1>0}H = \{x \in \mathbb{R}^{m+1} : x_{m+1} > 0\}H={x∈Rm+1:xm+1​>0} is the open upper half-space (last coordinate positive).
  • λ\lambdaλ is Lebesgue measure on Rm+1\mathbb{R}^{m+1}Rm+1.

Sobolev membership. For f:Rm+1→Rf : \mathbb{R}^{m+1} \to \mathbb{R}f:Rm+1→R and Ω⊆Rm+1\Omega \subseteq \mathbb{R}^{m+1}Ω⊆Rm+1, "f∈W1,p(Ω)f \in W^{1,p}(\Omega)f∈W1,p(Ω)" means the following. For each multi-index α\alphaα of order ≤1\le 1≤1, there is a ggg with g∈Lp(Ω,λ∣Ω)g \in L^p(\Omega,\lambda|_\Omega)g∈Lp(Ω,λ∣Ω​) satisfying an imported predicate "weak α\alphaα-derivative of fff on Ω\OmegaΩ". The multi-indices of order ≤1\le 1≤1 are the zero multi-index and the unit multi-indices e1,…,em+1e_1,\dots,e_{m+1}e1​,…,em+1​. The imported predicate's definition is not included.

Sobolev norm. ∥f∥1,p,Ω∈[0,∞]\|f\|_{1,p,\Omega} \in [0,\infty]∥f∥1,p,Ω​∈[0,∞] is built from imported chosen functions ∂Ωαf\partial^\alpha_\Omega f∂Ωα​f, whose definition is not included:

∥f∥1,p,Ω=(∥∂Ω0f∥Lp(Ω)p+∑i=1m+1∥∂Ωeif∥Lp(Ω)p)1/p(p<∞),\|f\|_{1,p,\Omega} = \Bigl(\|\partial^0_\Omega f\|_{L^p(\Omega)}^p + \sum_{i=1}^{m+1} \|\partial^{e_i}_\Omega f\|_{L^p(\Omega)}^p\Bigr)^{1/p} \quad (p<\infty),∥f∥1,p,Ω​=(∥∂Ω0​f∥Lp(Ω)p​+i=1∑m+1​∥∂Ωei​​f∥Lp(Ω)p​)1/p(p<∞), ∥f∥1,∞,Ω=max⁡(ess sup⁡Ω∣∂Ω0f∣, max⁡iess sup⁡Ω∣∂Ωeif∣)(p=∞).\|f\|_{1,\infty,\Omega} = \max\Bigl(\operatorname*{ess\,sup}_\Omega |\partial^0_\Omega f|,\ \max_i \operatorname*{ess\,sup}_\Omega |\partial^{e_i}_\Omega f|\Bigr) \quad (p = \infty).∥f∥1,∞,Ω​=max(Ωesssup​∣∂Ω0​f∣, imax​Ωesssup​∣∂Ωei​​f∣)(p=∞).

Claim. There exist a constant C∈[0,∞)C \in [0,\infty)C∈[0,∞) and a map EEE from functions Rm+1→R\mathbb{R}^{m+1} \to \mathbb{R}Rm+1→R to functions Rm+1→R\mathbb{R}^{m+1} \to \mathbb{R}Rm+1→R, both depending only on mmm and ppp, such that:

  1. Linearity up to null sets. For all f,g∈W1,p(H)f, g \in W^{1,p}(H)f,g∈W1,p(H) and all real a,ba, ba,b: E(af+bg)=a Ef+b EgE(af + bg) = a\,Ef + b\,EgE(af+bg)=aEf+bEg for λ\lambdaλ-a.e. point of Rm+1\mathbb{R}^{m+1}Rm+1.
  2. The extension property. For every f∈W1,p(H)f \in W^{1,p}(H)f∈W1,p(H):
    • Ef∈W1,p(Rm+1)Ef \in W^{1,p}(\mathbb{R}^{m+1})Ef∈W1,p(Rm+1) (membership with Ω\OmegaΩ the whole space);
    • Ef=fEf = fEf=f at λ\lambdaλ-a.e. point of HHH;
    • the norm bound holds:
∥Ef∥1,p,Rm+1≤C ∥f∥1,p,H.\|Ef\|_{1,p,\mathbb{R}^{m+1}} \le C\,\|f\|_{1,p,H}.∥Ef∥1,p,Rm+1​≤C∥f∥1,p,H​.

Unconstrained points.

  • Nothing is said about EEE on functions outside W1,p(H)W^{1,p}(H)W1,p(H).
  • Two inputs that agree on HHH are not required to have the same image.
  • The norm bound is an inequality in [0,∞][0,\infty][0,∞], where 0⋅∞=00 \cdot \infty = 00⋅∞=0.

Degenerate cases. For m=0m = 0m=0 the space is R\mathbb{R}R and H=(0,∞)H = (0,\infty)H=(0,∞). The constant CCC is allowed to be 000. Whether ∥f∥1,p,H\|f\|_{1,p,H}∥f∥1,p,H​ is finite for f∈W1,p(H)f \in W^{1,p}(H)f∈W1,p(H) depends on the imported chosen derivatives, which are not shown.

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