Alphabeta Math
PropositionStatement: 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 and uncentered maximal functions are pointwise comparable

Statement

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

Let fLloc1(Rn). Then for every xRn, Mf(x)Mf(x)2nMf(x).

Facts & Assumptions

Given: The Axiom of Countable Choice, a locally integrable function f on Rn, and a point xRn.

[L1]

The centered maximal function takes the supremum over balls centered at x, while the uncentered maximal function takes the supremum over all balls that contain x. (The centered and uncentered Hardy-Littlewood maximal functions)

Proof

technique · direct
1.1

Every ball centered at x is in particular a ball containing x, so the [L1] supremum defining Mf(x) is taken over a smaller family than the one defining Mf(x). Therefore Mf(x)Mf(x).

L1
1.2

Let B(y,r) be any ball containing x. If zB(y,r), then [L1, algebra] zx2zy2+yx2<r+r=2r, so B(y,r)B(x,2r). Hence B(y,r)fB(x,2r)fdλ.

L1algebra
2.1

Step 1.2 and [L2] give [step 1.2, L1, L2, algebra] 1λ(B(y,r))B(y,r)fλ(B(x,2r))λ(B(y,r))1λ(B(x,2r))B(x,2r)f=2nA2rf(x)2nMf(x). Taking the supremum over all balls B(y,r) containing x yields Mf(x)2nMf(x).

step 1.2L1L2algebra
3.1

Combining steps 1.1 and 2.1 gives the claimed comparison. [step 1.1, step 2.1]

step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

26 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