Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-09 (codex)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The centered Hardy-Littlewood maximal operator is weak type (1,1)

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)).

Let f∈L1(Rn) and let t>0. Then λ({x∈Rn:Mf(x)>t})≤5nt∥f∥1. In particular, the centered maximal operator is of weak type (1,1).

Facts & Assumptions

Given: The Axiom of Countable Choice, a function f∈L1(Rn), and a real number t>0.

[L1]

The centered maximal function is Mf(x)=sup⁡r>01λ(B(x,r))∫B(x,r)∣f(y)∣ dλ(y). (The centered and uncentered Hardy-Littlewood maximal functions)

[L2]

For a locally integrable function, the ball-average map (x,r)↦1λ(B(x,r))∫B(x,r)∣f(y)∣ dλ is continuous on Rn×(0,∞). (Ball averages vary continuously with the centre and radius)

[L4]

A finite family of balls admits a disjoint subfamily whose fivefold dilates cover the original union, with the measure estimate λ ⁣(⋃jBj)≤5n∑kλ(Bik). (Vitali covering lemma for Euclidean balls with fivefold dilates)

[L5]

The L1 norm is ∥f∥1=∫Rn∣f∣ dλ. (The class L1(μ) of integrable functions)

Proof

technique · direct
1.1L1L2givenconstruct

Put Et={x:Mf(x)>t}. For a fixed x∈Et, [L1] supplies a radius r>0 with ∫B(x,r)∣f∣>tλ(B(x,r)). Continuity [L2] with this fixed radius makes the inequality persist in a neighbourhood of x, so Et is open. Let K⊆Et be compact. If K=∅, the required bound for λ(K) is immediate. Otherwise take the family of ALL balls B(x,r) with x∈K, r>0 and the strict witness inequality. This family covers K, so it has a finite subcover B(x1,r1),…,B(xm,rm). No simultaneous choice of a radius for every point of K is made.

2.1step 1.1L4L5algebra

Apply [L4] to that finite subcover. There are pairwise disjoint balls [step 1.1, L4, L5, algebra] Bi1,…,Biℓ among B(x1,r1),…,B(xm,rm) such that K⊆⋃j=1mB(xj,rj)⊆⋃k=1ℓ5Bik and therefore λ(K)≤5n∑k=1ℓλ(Bik). Each chosen ball still satisfies the witness inequality from step 1.1, so t∑k=1ℓλ(Bik)<∑k=1ℓ∫Bik∣f∣ dλ≤∫Rn∣f∣ dλ=∥f∥1, because the chosen balls are pairwise disjoint. Hence λ(K)≤5nt∥f∥1.

3.1step 1.1step 2.1L3L4algebra

By [L3], λ(Et) is the supremum of λ(K) over compact K⊆Et. Step 2.1 gives the required upper bound for nonempty K, and step 1.1 handles the empty set. Hence λ(Et)≤(5n/t)∥f∥1. The stated countable choice covers [L3] and the measure clause of [L4]; the finite-subcover argument introduces no stronger selection assumption.

4.1step 3.1∎

This is exactly the weak type (1,1) estimate for the centered maximal [step 3.1] operator.

Depends on

Used by

Dependency tree · two levels

35 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources