Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04
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 fL1(Rn) and let t>0. Then λ({xRn:Mf(x)>t})5ntf1. In particular, the centered maximal operator is of weak type (1,1).

Facts & Assumptions

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

[L1]

The centered maximal function is Mf(x)=supr>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)5nkλ(Bik). (Vitali covering lemma for Euclidean balls with fivefold dilates)

[L5]

The L1 norm is f1=Rnfdλ. (The class L1(μ) of integrable functions)

Proof

technique · direct
1.1

Put Et:={xRn:Mf(x)>t}. If xEt, then [L1] gives a radius rx>0 such that B(x,rx)f(y)dλ(y)>tλ(B(x,rx)). By [L2] applied to f at (x,rx), there is δx>0 such that the same strict inequality holds with x replaced by every yB(x,δx) and the radius kept equal to rx. Hence B(x,δx)Et, so Et is open. Now let [L1, L2, given, choose] KEt be compact. The balls B(x,rx) with xK cover K, so compactness yields a finite subcover B(x1,r1),,B(xm,rm).

L1L2givenchoose
2.1

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 Kj=1mB(xj,rj)k=15Bik and therefore λ(K)5nk=1λ(Bik). Each chosen ball still satisfies the witness inequality from step 1.1, so tk=1λ(Bik)<k=1BikfdλRnfdλ=f1, because the chosen balls are pairwise disjoint. Hence λ(K)5ntf1.

step 1.1L4L5algebra
3.1

By [L3], the open set Et is the supremum of the measures of its compact [step 2.1, L3, algebra] subsets. Step 2.1 gives the same upper bound for every compact KEt, so λ(Et)5ntf1.

step 2.1L3algebra
4.1

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

step 3.1

Depends on

Used by

Dependency tree · two levels

33 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