Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.7 — first-derivative estimate |∂ᵢu(x)| ≤ (n/r) max |u| for harmonic u

Proved
HunterPDE.Harmonic.harmonic_derivative_estimate

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

derivative-estimatesharmonic-functionsp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1pde

Let Ω⊆Rn\Omega \subseteq \mathbb{R}^nΩ⊆Rn be open, let u∈C2(Ω)u \in C^2(\Omega)u∈C2(Ω) be harmonic in Ω\OmegaΩ, and let Br(x)⋐ΩB_r(x) \Subset \OmegaBr​(x)⋐Ω. Then for every 1≤i≤n1 \le i \le n1≤i≤n

∣∂iu(x)∣≤nrmax⁡B‾r(x)∣u∣.|\partial_i u(x)| \le \frac{n}{r} \max_{\overline{B}_r(x)} |u|.∣∂i​u(x)∣≤rn​Br​(x)max​∣u∣.

The estimate bounds a derivative of a harmonic function at a point by the size of the function on a surrounding ball; it gives Liouville's theorem (Corollary 2.8) and is the base case of the higher-order estimate (Theorem 2.9).

Formalization Note. The maximum over the closed ball is expressed through an arbitrary bound: for every real MMM with ∣u∣≤M|u| \le M∣u∣≤M on B‾r(x)\overline{B}_r(x)Br​(x), ∣∂iu(x)∣≤(n/r)M|\partial_i u(x)| \le (n/r) M∣∂i​u(x)∣≤(n/r)M. Since uuu is continuous on the compact ball the maximum is attained, so taking M=max⁡B‾r(x)∣u∣M = \max_{\overline{B}_r(x)} |u|M=maxBr​(x)​∣u∣ recovers the book's form, and the two are equivalent. Coordinates are 0-based (i : Fin n); ∂iu\partial_i u∂i​u is HunterPDE.Shared.partialDeriv u i from the shared definition HunterPDE.Shared.PartialDeriv. Harmonic on Ω\OmegaΩ is InnerProductSpace.HarmonicOnNhd u Ω.

Preamble
import Mathlib
import Definitions.Def_HunterPDE_Shared_PartialDeriv
Formal statement
namespace HunterPDE.Harmonic

/-- Theorem 2.7 of Hunter, *Notes on PDEs* (revised 6/18/2014), p. 23: if `u ∈ C²(Ω)` is harmonic
in the open set `Ω ⊆ ℝⁿ` and `B_r(x) ⋐ Ω`, then for every coordinate `i`,
`|∂ᵢu(x)| ≤ (n / r) max_{B̄_r(x)} |u|`. The maximum is expressed through an arbitrary bound `M`
of `|u|` on the closed ball `B̄_r(x)` (taking `M` to be the maximum gives the book's form). -/
theorem harmonic_derivative_estimate {n : ℕ} {Ω : Set (EuclideanSpace ℝ (Fin n))}
    {u : EuclideanSpace ℝ (Fin n) → ℝ} (hΩ : IsOpen Ω) (hu : InnerProductSpace.HarmonicOnNhd u Ω)
    {x : EuclideanSpace ℝ (Fin n)} {r : ℝ} (hr : 0 < r) (hball : Metric.closedBall x r ⊆ Ω)
    (i : Fin n) {M : ℝ} (hM : ∀ y ∈ Metric.closedBall x r, |u y| ≤ M) :
    |Shared.partialDeriv u i x| ≤ (n / r) * M := by sorry

end HunterPDE.Harmonic
Source
Hunter, Notes on Partial Differential Equations (revised 6/18/2014), p. 23, Theorem 2.7
Read-back

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

Hypotheses.

  • n∈Nn \in \mathbb{N}n∈N is arbitrary.
  • Ω⊆Rn\Omega \subseteq \mathbb{R}^nΩ⊆Rn is open.
  • u:Rn→Ru : \mathbb{R}^n \to \mathbb{R}u:Rn→R is harmonic near every point of Ω\OmegaΩ. For each p∈Ωp \in \Omegap∈Ω:
    • uuu is C2C^2C2 on a neighbourhood of ppp;
    • Δu=∑iD2u(⋅)(ei,ei)\Delta u = \sum_i D^2u(\cdot)(e_i,e_i)Δu=∑i​D2u(⋅)(ei​,ei​) vanishes on a neighbourhood of ppp.
  • x∈Rnx \in \mathbb{R}^nx∈Rn and r>0r > 0r>0 satisfy B‾r(x)⊆Ω\overline{B}_r(x) \subseteq \OmegaBr​(x)⊆Ω.
  • iii is a coordinate index in {1,…,n}\{1,\dots,n\}{1,…,n}.
  • MMM is a real number with ∣u(y)∣≤M|u(y)| \le M∣u(y)∣≤M for all y∈B‾r(x)y \in \overline{B}_r(x)y∈Br​(x).

Conclusion.

∣partialDeriv⁡(u,i,x)∣≤nr M.\big|\operatorname{partialDeriv}(u, i, x)\big| \le \frac{n}{r}\, M.​partialDeriv(u,i,x)​≤rn​M.

Here partialDeriv⁡(u,i,x)\operatorname{partialDeriv}(u,i,x)partialDeriv(u,i,x) is a notion defined elsewhere in the bundle, whose definition is not part of the code shown. By its name it is the iii-th partial derivative ∂iu(x)\partial_i u(x)∂i​u(x), but its precise meaning, including any convention at points where the derivative does not exist, cannot be read off from this text.

Degenerate cases.

  • n=0n = 0n=0. There is no index iii, so the statement is vacuous. For n≥1n \ge 1n≥1 the factor nnn is the real number nnn.
  • Sign of MMM. Since r>0r > 0r>0, the closed ball contains xxx, so any admissible MMM satisfies M≥∣u(x)∣≥0M \ge |u(x)| \ge 0M≥∣u(x)∣≥0.
  • Choice of MMM. MMM may be any upper bound for ∣u∣|u|∣u∣ on the closed ball, not necessarily the maximum. The bound weakens as MMM grows.
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