Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Hardy–Littlewood maximal theorem

Proved
DbarRegularity.maximalFunction_bounds

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

calderon-zygmundcauchy-riemannelliptic-regularityharmonic-analysissingular-integrals

Let MfMfMf be the Hardy–Littlewood maximal function of f:Rd→Cf:\mathbb{R}^d\to\mathbb{C}f:Rd→C. Rd\mathbb{R}^dRd carries Lebesgue measure mmm, and ∥⋅∥p\|\cdot\|_p∥⋅∥p​ is the Lp(Rd)L^p(\mathbb{R}^d)Lp(Rd) norm. Then:

  1. if f∈Lp(Rd)f\in L^p(\mathbb{R}^d)f∈Lp(Rd) for some 1≤p≤∞1\le p\le\infty1≤p≤∞, then Mf(x)<∞Mf(x)<\inftyMf(x)<∞ for almost every xxx;
  2. there is a constant AAA depending only on ddd such that for every f∈L1(Rd)f\in L^1(\mathbb{R}^d)f∈L1(Rd) and every α>0\alpha>0α>0,
m{x:Mf(x)>α}≤Aα∫Rd∣f∣ dx;m\{x: Mf(x)>\alpha\}\le\frac{A}{\alpha}\int_{\mathbb{R}^d}|f|\,dx;m{x:Mf(x)>α}≤αA​∫Rd​∣f∣dx;
  1. for every 1<p≤∞1<p\le\infty1<p≤∞ there is a constant ApA_pAp​ depending only on ppp and ddd such that every f∈Lp(Rd)f\in L^p(\mathbb{R}^d)f∈Lp(Rd) has Mf∈Lp(Rd)Mf\in L^p(\mathbb{R}^d)Mf∈Lp(Rd) and ∥Mf∥p≤Ap∥f∥p\|Mf\|_p\le A_p\|f\|_p∥Mf∥p​≤Ap​∥f∥p​.

Formalization Note maximalFunction f is valued in ℝ≥0∞; part 3 asserts MemLp (maximalFunction f) p and bounds its eLpNorm. ppp is in ℝ≥0∞, so p=∞p=\inftyp=∞ is included in parts 1 and 3. The constants are in ℝ≥0 and are chosen before fff (and α\alphaα). Stein remarks that A=5dA=5^dA=5d will do in part 2; the statement asks only for some constant depending on ddd.

Preamble
import Definitions.Def_DbarRegularity_Setting
import Mathlib.Analysis.Calculus.ContDiff.Basic
Formal statement
namespace DbarRegularity

open MeasureTheory Metric Filter Topology
open scoped ENNReal NNReal ContDiff

/-- Stein, *Singular Integrals*, Chapter I, § 1.3, Theorem 1 (p. 5): the Hardy–Littlewood maximal
function `M f` of `f` on `ℝ^d`
(a) is finite almost everywhere when `f ∈ L^p`, `1 ≤ p ≤ ∞`;
(b) is of weak type `(1, 1)`: `|{M f > α}| ≤ (A / α) ‖f‖₁` with `A` depending only on `d`;
(c) is in `L^p` with `‖M f‖_p ≤ A_p ‖f‖_p` when `f ∈ L^p`, `1 < p ≤ ∞`, with `A_p` depending only
on `p` and `d`. -/
theorem maximalFunction_bounds (d : ℕ) :
    (∀ p : ℝ≥0∞, 1 ≤ p → ∀ f : EuclideanSpace ℝ (Fin d) → ℂ, MemLp f p →
      ∀ᵐ x, maximalFunction f x < ⊤) ∧
    (∃ A : ℝ≥0, ∀ f : EuclideanSpace ℝ (Fin d) → ℂ, Integrable f → ∀ α : ℝ≥0, 0 < α →
      volume {x | (α : ℝ≥0∞) < maximalFunction f x} ≤ (A : ℝ≥0∞) / α * ∫⁻ x, ‖f x‖ₑ) ∧
    (∀ p : ℝ≥0∞, 1 < p → ∃ A : ℝ≥0, ∀ f : EuclideanSpace ℝ (Fin d) → ℂ, MemLp f p →
      MemLp (maximalFunction f) p ∧
        eLpNorm (maximalFunction f) p volume ≤ A * eLpNorm f p volume) := by sorry

end DbarRegularity
Source
E. M. Stein, Singular Integrals and Differentiability Properties of Functions, Princeton Mathematical Series 30, Princeton University Press (1970), ISBN 0-691-08079-8, Chapter I, § 1.3, Theorem 1, p. 5
Read-back

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

Read-back: DbarRegularity.maximalFunction_bounds

Setting. Fixed d∈Nd\in\mathbb Nd∈N; functions f:Rd→Cf:\mathbb R^d\to\mathbb Cf:Rd→C, Lebesgue measure.

Hypotheses. Only ddd (any natural number, d=0d=0d=0 allowed).

Definitions used. maximalFunction (MfMfMf, [0,∞][0,\infty][0,∞]-valued Hardy–Littlewood maximal function over open balls); MemLp, eLpNorm, Integrable, lower integral ∫−∥f∥e\int^-\|f\|_e∫−∥f∥e​.

Conclusion. A conjunction of three statements:

(a) ∀p∈[1,∞] ∀f∈Lp(Rd): Mf(x)<∞\forall p\in[1,\infty]\ \forall f\in L^p(\mathbb R^d):\ Mf(x)<\infty∀p∈[1,∞] ∀f∈Lp(Rd): Mf(x)<∞ for a.e. xxx.

(b) ∃A∈[0,∞) ∀f∈L1(Rd) ∀α∈(0,∞): ∣{x:α<Mf(x)}∣≤Aα∫∣f∣\exists A\in[0,\infty)\ \forall f\in L^1(\mathbb R^d)\ \forall \alpha\in(0,\infty):\ \big|\{x:\alpha<Mf(x)\}\big|\le \dfrac{A}{\alpha}\displaystyle\int|f|∃A∈[0,∞) ∀f∈L1(Rd) ∀α∈(0,∞): ​{x:α<Mf(x)}​≤αA​∫∣f∣.

(c) ∀p∈(1,∞] ∃Ap∈[0,∞) ∀f∈Lp(Rd): Mf∈Lp\forall p\in(1,\infty]\ \exists A_p\in[0,\infty)\ \forall f\in L^p(\mathbb R^d):\ Mf\in L^p∀p∈(1,∞] ∃Ap​∈[0,∞) ∀f∈Lp(Rd): Mf∈Lp (as an [0,∞][0,\infty][0,∞]-valued function: a.e.-strongly measurable with finite eLpNorm) and ∥Mf∥p≤Ap∥f∥p\|Mf\|_p\le A_p\|f\|_p∥Mf∥p​≤Ap​∥f∥p​.

Quantifier order: ddd first; in (b) A=A(d)A=A(d)A=A(d) before f,αf,\alphaf,α; in (c) Ap=Ap(d,p)A_p=A_p(d,p)Ap​=Ap​(d,p) before fff.

Degenerate cases. p=∞p=\inftyp=∞ is included in (a) and (c) (true: Mf≤∥f∥∞Mf\le\|f\|_\inftyMf≤∥f∥∞​, A∞=1A_\infty=1A∞​=1). d=0d=0d=0: Mf=∣f∣Mf=|f|Mf=∣f∣ pointwise; all three hold trivially (A=1A=1A=1). α>0\alpha>0α>0 avoids ENNReal division by 000; A/α<∞A/\alpha<\inftyA/α<∞.

Remarks. MemLp for an ℝ≥0∞-valued function is valid here (ENorm ℝ≥0∞ with ∥x∥e=x\|x\|_e=x∥x∥e​=x). MfMfMf is lower semicontinuous, hence measurable. The weak bound uses the strict superlevel set {α<Mf}\{\alpha<Mf\}{α<Mf}, as in the standard statement.

Soundness checks.

  1. No Bochner integrals or toReal appear; ∫−∥f∥e\int^-\|f\|_e∫−∥f∥e​ is the true L1L^1L1 norm. Constants AAA are ℝ≥0, so they cannot be ⊤\top⊤. MemLp hypotheses include measurability, so no junk. Nothing is vacuous: LpL^pLp functions exist, and the conclusions are non-trivial for d≥1d\ge1d≥1.
  2. Constants depend only on ddd (and ppp in (c)), chosen before fff and α\alphaα: this is the standard Hardy–Littlewood maximal theorem (Stein Ch. I, Thm 1). Plausibly TRUE as written.

Verdict: no mis-formalization observed

Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Mazecto · Oct 13, 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