Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.28 — Hölder estimate [∂ᵢⱼu]_{0,α} ≤ C [f]_{0,α} for the Newtonian potential

Proved
HunterPDE.Newtonian.holder_estimate

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

holder-estimatesnewtonian-potentialp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1pdeschauder-estimates

Let n≥2n \ge 2n≥2 and 0<α<10 < \alpha < 10<α<1. There is a constant CCC, depending only on α\alphaα and nnn, such that for every f∈Cc∞(Rn)f \in C_c^\infty(\mathbb{R}^n)f∈Cc∞​(Rn), with Newtonian potential u=Γ∗fu = \Gamma * fu=Γ∗f, and all indices i,ji, ji,j,

[∂iju]0,α≤C [f]0,α,[\partial_{ij} u]_{0,\alpha} \le C\,[f]_{0,\alpha},[∂ij​u]0,α​≤C[f]0,α​,

where [⋅]0,α[\cdot]_{0,\alpha}[⋅]0,α​ is the Hölder seminorm (1.1) taken over all of Rn\mathbb{R}^nRn.

This is the model Schauder estimate: inverting the Laplacian gains exactly two derivatives when regularity is measured in Hölder norms, whereas no such estimate holds in the maximum norm; the endpoint α=1\alpha = 1α=1 is excluded. It is the basis of Schauder's existence theory for elliptic equations with Hölder continuous coefficients.

Formalization Note. The constant C∈[0,∞)C \in [0, \infty)C∈[0,∞) is quantified before fff, iii and jjj, and after nnn and α\alphaα. Seminorms take values in [0,∞][0, \infty][0,∞]; for f∈Cc∞f \in C_c^\inftyf∈Cc∞​ the right-hand side is finite, so the inequality asserts in particular that ∂iju\partial_{ij} u∂ij​u is uniformly α\alphaα-Hölder on Rn\mathbb{R}^nRn. Indices are 0-based and ∂ij=∂i∂j\partial_{ij} = \partial_i \partial_j∂ij​=∂i​∂j​.

Preamble
import Mathlib
import Definitions.Def_HunterPDE_Newtonian_FundamentalSolution
import Definitions.Def_HunterPDE_Newtonian_NewtonianPotential
import Definitions.Def_HunterPDE_Newtonian_PartialDeriv
import Definitions.Def_HunterPDE_Shared_HolderSeminorm
Formal statement
namespace HunterPDE.Newtonian

open scoped ContDiff ENNReal NNReal

/-- Hunter, *Notes on PDEs*, p. 40, Theorem 2.28 (Hölder estimate for the Newtonian potential):
for `n ≥ 2` and `0 < α < 1` there is a constant `C`, depending only on `α` and `n`, such that
for every `f ∈ C_c^∞(ℝⁿ)` and all `i, j`, the Newtonian potential `u = Γ ∗ f` satisfies
`[∂ᵢⱼu]_{0,α} ≤ C [f]_{0,α}`, the Hölder seminorms (1.1) being taken over all of `ℝⁿ`.
`C` is chosen before `f`, `i`, `j`; the seminorms are `ℝ≥0∞`-valued. -/
theorem holder_estimate (n : ℕ) (hn : 2 ≤ n) (α : ℝ) (hα₀ : 0 < α) (hα₁ : α < 1) :
    ∃ C : ℝ≥0, ∀ f : EuclideanSpace ℝ (Fin n) → ℝ, ContDiff ℝ ∞ f → HasCompactSupport f →
      ∀ i j : Fin n,
        Shared.holderSeminorm α Set.univ (secondPartial (newtonianPotential n f) i j) ≤
          (C : ℝ≥0∞) * Shared.holderSeminorm α Set.univ f := by sorry

end HunterPDE.Newtonian
Source
Hunter, Notes on Partial Differential Equations (revised 6/18/2014), p. 40, Theorem 2.28
Read-back

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

Fix a natural number nnn with n≥2n \ge 2n≥2, and a real number α\alphaα with 0<α<10 < \alpha < 10<α<1. Write Rn\mathbb{R}^nRn for the nnn-dimensional Euclidean space RFin n\mathbb{R}^{\mathrm{Fin}\,n}RFinn, with coordinates indexed by {0,1,…,n−1}\{0, 1, \dots, n-1\}{0,1,…,n−1}. The statement then asserts that there exists a single non-negative real constant C∈[0,∞)C \in [0, \infty)C∈[0,∞), chosen once and for all before any function or index is fixed, with the following property.

For every function f:Rn→Rf : \mathbb{R}^n \to \mathbb{R}f:Rn→R that satisfies both

  • fff is infinitely differentiable, i.e. CkC^kCk for every finite kkk (the smoothness class C∞C^\inftyC∞, not real-analyticity), and
  • fff has compact support, meaning the closure of {x:f(x)≠0}\{x : f(x) \ne 0\}{x:f(x)=0} is compact,

and for every pair of coordinate indices i,j∈{0,…,n−1}i, j \in \{0, \dots, n-1\}i,j∈{0,…,n−1}, the following inequality holds in the extended non-negative reals [0,∞][0, \infty][0,∞]:

[ ∂ijuf ]α; Rn  ≤  C⋅[ f ]α; Rn.[\,\partial_{ij} u_f\,]_{\alpha;\,\mathbb{R}^n} \;\le\; C \cdot [\,f\,]_{\alpha;\,\mathbb{R}^n}.[∂ij​uf​]α;Rn​≤C⋅[f]α;Rn​.

The symbols are all defined in the bundle's own definition files, and their bodies are not part of the code shown here:

  • ufu_fuf​ is newtonianPotential n f, the bundle's "Newtonian potential" of fff in dimension nnn. It is a function Rn→R\mathbb{R}^n \to \mathbb{R}Rn→R.
  • ∂ijuf\partial_{ij} u_f∂ij​uf​ is secondPartial (newtonianPotential n f) i j, the bundle's "second partial derivative" of ufu_fuf​ with respect to coordinates iii and jjj. It is again a real-valued function on Rn\mathbb{R}^nRn.
  • [g]α; S[g]_{\alpha;\,S}[g]α;S​ is Shared.holderSeminorm α S g, the bundle's "Hölder seminorm" of exponent α\alphaα for a function ggg over a set SSS. It takes values in [0,∞][0, \infty][0,∞], so it may equal +∞+\infty+∞. Here the set is always S=RnS = \mathbb{R}^nS=Rn, the whole space.
  • CCC is used as an element of [0,∞][0, \infty][0,∞] on the right-hand side. It is finite, but it is allowed to be 000.

The code itself does not fix what these three functions mean. Whether ufu_fuf​ is a convolution with a fundamental solution, what sign or normalisation it carries, and how ∂ij\partial_{ij}∂ij​ behaves at points where the function is not differentiable are all determined solely by the bundle definitions. The same goes for the exact supremum defining the seminorm, for example whether it is over pairs x≠yx \ne yx=y and whether it uses ∣g(x)−g(y)∣/∣x−y∣α|g(x) - g(y)| / |x - y|^\alpha∣g(x)−g(y)∣/∣x−y∣α.

The quantifier order is ∃C ∀f ∀i,j\exists C\ \forall f\ \forall i, j∃C ∀f ∀i,j. CCC may depend on nnn and α\alphaα only, not on fff, iii or jjj. No hypothesis ties iii to jjj, so the diagonal case i=ji = ji=j is included.

Degenerate cases.

  • Dimension. n=0n = 0n=0 and n=1n = 1n=1 are excluded by hypothesis. For n≥2n \ge 2n≥2 the index set is non-empty, so the claim over i,ji, ji,j is not vacuous.
  • Exponent. The endpoints α=0\alpha = 0α=0 and α=1\alpha = 1α=1 are excluded. The hypotheses on nnn and α\alphaα are jointly satisfiable, so the statement is not vacuous.
  • The zero function. f=0f = 0f=0 is smooth and compactly supported, since its support is empty. For it, the inequality requires [∂iju0]α≤C⋅[0]α[\partial_{ij} u_0]_{\alpha} \le C \cdot [0]_{\alpha}[∂ij​u0​]α​≤C⋅[0]α​, whatever value the bundle definitions assign to these quantities.
  • Infinite seminorm of fff. Arithmetic is in [0,∞][0, \infty][0,∞]. If [f]α=∞[f]_\alpha = \infty[f]α​=∞ and C>0C > 0C>0, the right-hand side is ∞\infty∞ and the inequality holds trivially. If C=0C = 0C=0, the convention 0⋅∞=00 \cdot \infty = 00⋅∞=0 applies, so the right-hand side is 000.
  • Zero seminorm of fff. If [f]α=0[f]_\alpha = 0[f]α​=0, the right-hand side is 000 for every CCC. The statement then forces [∂ijuf]α=0[\partial_{ij} u_f]_\alpha = 0[∂ij​uf​]α​=0.
  • Total-function defaults. Suppose the bundle defines ufu_fuf​ via an integral that could fail to be integrable, or defines ∂ij\partial_{ij}∂ij​ via a derivative that could fail to exist. Then the inequality concerns whatever default value those definitions produce there. For example, integrals of non-integrable functions and derivatives at non-differentiable points evaluate to 000 in Mathlib's conventions. Whether any such case arises for smooth compactly supported fff with n≥2n \ge 2n≥2 depends on definitions not shown here.
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