Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Componentwise Lp estimate for the weak derivatives of even reflection

Proved
HunterPDE.Compactness.eLpNorm_weakDeriv_evenReflection_le

by Mazecto · Oct 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

extension-operatorreflectionsobolev-spacesweak-derivative

Let 1≤p≤∞1\le p\le\infty1≤p≤∞, f∈W1,p(H)f\in W^{1,p}(H)f∈W1,p(H), where HHH is the upper half-space in Rm+1\mathbb R^{m+1}Rm+1, and let Ef(x′,t)=f(x′,∣t∣)Ef(x',t)=f(x',|t|)Ef(x′,t)=f(x′,∣t∣). For every multi-index α\alphaα with ∣α∣≤1|\alpha|\le1∣α∣≤1,

∥∂αEf∥Lp(Rm+1)≤2∥∂αf∥Lp(H).\|\partial^\alpha Ef\|_{L^p(\mathbb R^{m+1})}\le2\|\partial^\alpha f\|_{L^p(H)}.∥∂αEf∥Lp(Rm+1)​≤2∥∂αf∥Lp(H)​.

Here the derivatives are the chosen representatives of the distributional derivatives, and the assertion includes the zero-order term. This is the componentwise estimate in the reflection construction for Hunter's Theorem 3.41. Reflection preserves Lebesgue measure, so the sharper factor is 21/p2^{1/p}21/p for finite ppp, and 111 at infinity; the stated factor 222 is a convenient uniform bound. Identifying the chosen derivatives requires weak derivative uniqueness and the even tangential/odd normal reflection identities, not just a change of variables applied to an arbitrary function.

Preamble
import Definitions.Def_HunterPDE_Compactness_Sobolev
import Definitions.Def_HunterPDE_Compactness_HalfSpace
open MeasureTheory
open scoped ENNReal NNReal
set_option autoImplicit false
Formal statement
theorem HunterPDE.Compactness.eLpNorm_weakDeriv_evenReflection_le (m : ℕ) (p : ℝ≥0∞) (hp : 1 ≤ p)
    (f : EuclideanSpace ℝ (Fin (m + 1)) → ℝ)
    (hf : HunterPDE.Compactness.MemW 1 p (HunterPDE.Compactness.upperHalfSpace m) f)
    (α : Fin (m + 1) → ℕ)
    (hα : α ∈ HunterPDE.Compactness.multiIndicesLe (m + 1) 1) :
    eLpNorm (HunterPDE.Shared.weakDeriv Set.univ α (fun x : EuclideanSpace ℝ (Fin (m + 1)) =>
      f (WithLp.toLp 2 (fun i => if i = Fin.last m then |x i| else x i)))) p (volume.restrict Set.univ) ≤
      2 * eLpNorm (HunterPDE.Shared.weakDeriv (HunterPDE.Compactness.upperHalfSpace m) α f)
        p (volume.restrict (HunterPDE.Compactness.upperHalfSpace m)) := by sorry
Source
Hunter, Notes on Partial Differential Equations (revised 6/18/2014), §3.9, pp. 71–72, reflection construction preceding Theorem 3.41. https://www.math.ucdavis.edu/~hunter/pdes/pde_notes.pdf . This is an auxiliary lemma for the indicated construction, not a separately numbered assertion in the source.

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