Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 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 function is Borel measurable

Statement

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

Let fLloc1(Rn). Then the centered maximal function Mf:Rn[0,] is Borel measurable.

Facts & Assumptions

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

[L1]

The centered maximal function is Mf(x)=supr>0Arf(x). (The centered and uncentered Hardy-Littlewood maximal functions)

[L2]

For every locally integrable function g, the map (x,r)Arg(x) on Rn×(0,) is continuous. (Ball averages vary continuously with the centre and radius)

Proof

technique · direct
1.1

Fix a real t. If t<0, then {Mf>t}=Rn, which is open. [given] Assume from now on that t0.

given
1.2

Let x{Mf>t}. By [L1], there is r>0 with Arf(x)>t. Apply [L1, L2, given, choose] to the locally integrable function f: continuity of yArf(y) at x gives δ>0 such that yx2<δ    Arf(y)>t. Hence B(x,δ){Mf>t}.

L1L2givenchoose
2.1

Step 1.2 shows that every point of {Mf>t} is interior, so this [step 1.2] superlevel set is open.

step 1.2
3.1

Every strict superlevel set of Mf is open, so Mf is Borel measurable. [step 1.1, step 2.1]

step 1.1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

12 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