Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Nested-ball propagation of coordinate derivative estimates

Proved
HunterPDE.Shared.iteratedPartial_estimate_of_first_estimates

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

derivative-estimatesharmonic-functionspde

Let Ω⊆Rn\Omega\subseteq\mathbb R^nΩ⊆Rn, and let u:Rn→Ru:\mathbb R^n\to\mathbb Ru:Rn→R. Write DluD_luDl​u for the iterated coordinate derivative along a finite list lll, with D[]u=uD_{[]}u=uD[]​u=u and Di::lu=∂iDluD_{i::l}u=\partial_i D_luDi::l​u=∂i​Dl​u. Suppose every DluD_luDl​u satisfies the following interior estimate: on every closed ball B‾s(y)⊆Ω\overline B_s(y)\subseteq\OmegaBs​(y)⊆Ω with s>0s>0s>0, a bound ∣Dlu∣≤A|D_lu|\le A∣Dl​u∣≤A implies ∣∂iDlu(y)∣≤nA/s|\partial_iD_lu(y)|\le nA/s∣∂i​Dl​u(y)∣≤nA/s for every coordinate iii. Then, for every list lll of length k≥1k\ge1k≥1, r>0r>0r>0, and B‾r(x)⊆Ω\overline B_r(x)\subseteq\OmegaBr​(x)⊆Ω with ∣u∣≤M|u|\le M∣u∣≤M on that ball,

∣Dlu(x)∣≤nkek−1k!rkM.|D_lu(x)|\le\frac{n^ke^{k-1}k!}{r^k}M.∣Dl​u(x)∣≤rknkek−1k!​M.

This abstracts the nested-ball induction behind harmonic interior estimates. It separates the geometric and numerical argument from the property that makes the first-derivative estimate available.

Preamble
import Definitions.Def_HunterPDE_Shared_PartialDeriv
import Mathlib.Analysis.Complex.Exponential
import Mathlib.Data.Nat.Factorial.Basic
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum

open HunterPDE.Shared Metric
set_option autoImplicit false

Formal statement
theorem HunterPDE.Shared.iteratedPartial_estimate_of_first_estimates {n : ℕ} {Ω : Set (EuclideanSpace ℝ (Fin n))}
    {u : EuclideanSpace ℝ (Fin n) → ℝ}
    (hfirst : ∀ (l : List (Fin n)) (x : EuclideanSpace ℝ (Fin n)) (r : ℝ),
      0 < r → closedBall x r ⊆ Ω → ∀ (i : Fin n) (M : ℝ),
      (∀ y ∈ closedBall x r, |iteratedPartial u l y| ≤ M) →
      |partialDeriv (iteratedPartial u l) i x| ≤ (n / r) * M)
    (l : List (Fin n)) (hl : 1 ≤ l.length)
    {x : EuclideanSpace ℝ (Fin n)} {r : ℝ} (hr : 0 < r)
    (hball : closedBall x r ⊆ Ω) {M : ℝ}
    (hM : ∀ y ∈ closedBall x r, |u y| ≤ M) :
    |iteratedPartial u l x| ≤
      ((n : ℝ) ^ l.length * Real.exp 1 ^ (l.length - 1) *
        (l.length.factorial : ℝ) / r ^ l.length) * M := by sorry
Source
Hunter, Notes on Partial Differential Equations (revised 6/18/2014), https://www.math.ucdavis.edu/~hunter/pdes/ch2.pdf, pp. 21 and 23–24, Theorems 2.1–2.2 and proof of Theorem 2.9; generalized to constant directions / families satisfying first-derivative estimates.

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