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.

Lebesgue differentiation theorem on Rn

Statement

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

Let fLloc1(Rn). Then limr0+Arf(x)=f(x) for Lebesgue-almost every xRn.

Facts & Assumptions

Given: The Axiom of Countable Choice and a function fLloc1(Rn).

[L1]

Continuous compactly supported functions are recovered by small ball averages at every point. (Continuous compactly supported functions are recovered by small ball averages)

[L2]

For 1p<, Cc(Rn) is dense in Lp(Rn). (Cc(Rn) is dense in Lp(Rn) for 1p<)

[L3]

Chebyshev-Markov controls superlevel sets by the integral. (Chebyshev-Markov inequality for the integral)

[L4]

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

Proof

technique · direct
1.1

For each integer m1 and each integer j1, apply [L2] to the [L2, given, choose, construct] L1 function f1B(0,m+1) and choose gm,jCc(Rn) such that B(0,m+1)fgm,jdλ<22j5n. Set hm,j:=(fgm,j)1B(0,m+1).

L2givenchooseconstruct
2.1

Let [L3, L4, step 1.1, algebra] Em,j:={xB(0,m):Mhm,j(x)>2j}{xB(0,m):hm,j(x)>2j}. By [L4] and [L3], λ(Em,j)5n2jhm,j1+12jhm,j1<2j+5n2j21j.

L3L4step 1.1algebra
3.1

For fixed m, put [step 2.1, algebra] Nm:=N=1jNEm,j. The sets jNEm,j decrease with N, and by step 2.1 λ ⁣(jNEm,j)jNλ(Em,j)jN21j=22N. Hence λ(Nm)=0.

step 2.1algebra
4.1

Let xB(0,m)Nm. Then there is Nx such that [L1, step 1.1, step 3.1, algebra] xEm,j for every jNx. Fix such a j and take 0<r<1. Since xB(0,m), one has B(x,r)B(0,m+1), so Arf(x)f(x)=(Argm,j(x)gm,j(x))+Arhm,j(x)hm,j(x). Therefore Arf(x)f(x)Argm,j(x)gm,j(x)+Mhm,j(x)+hm,j(x)Argm,j(x)gm,j(x)+21j. Now [L1] gives Argm,j(x)gm,j(x), so lim supr0+Arf(x)f(x)21j for every jNx. Letting j yields Arf(x)f(x).

L1step 1.1step 3.1algebra
5.1

The bad set for radius differentiation is contained in [step 3.1, step 4.1, L5] m1Nm, which is null by [L5]. Thus the convergence holds for almost every xRn.

step 3.1step 4.1L5

Depends on

Used by

Dependency tree · two levels

47 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