Alphabeta Math
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.

✓ 15 results · all verified · 5 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 10 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

The Maximal Function and Lebesgue Differentiation

1 · Prerequisites

2 · Summary

This page builds the Euclidean maximal-function and differentiation package in the route fixed by the MT-17 design. Ball averages and the centered and uncentered maximal functions are defined separately, measurability of the centered maximal function is proved as a theorem rather than treated as obvious, and the weak (1,1) estimate keeps the honest 5^n constant from the Vitali selection argument.

The second half of the page turns the maximal inequality into differentiation: continuous compactly supported functions differentiate first, then the full Lebesgue differentiation theorem follows by density and error-set control, and the page closes with Lebesgue points, density points, nicely shrinking families, differentiation of measures, and the L^1 first fundamental theorem of calculus. In the current library route, the measure-theoretic parts of this package inherit the Axiom of Countable Choice from the published Lebesgue measure regularity and density inputs they cite.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-04Open item page →

A locally integrable function on Rn

Definition

Let f:Rn→C be a measurable function (Borel measurable and Lebesgue measurable functions on Rn). We say that f is locally integrable on Rn if for every Euclidean ball B(x,r) with r>0 (Open ball, closed ball and sphere in a metric space) one has ∫B(x,r)∣f(y)∣ dλ(y)<∞, so the restriction of f to each ball is integrable in the sense of Integrable real and complex functions, and their integrals.

The set of such functions is denoted by Lloc1(Rn). When convenient, the same notation is also used for the corresponding almost-everywhere equivalence classes.

LemmaStatement: Literature-sourcedProof: AI-generatedOpen item page →

Euclidean balls have positive finite Lebesgue measure

Statement

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

Let n≥1, let x∈Rn, and let r>0. Then the Euclidean ball B(x,r) is Lebesgue measurable and satisfies 0<λ(B(x,r))<∞.

Facts & Assumptions

Given: The Axiom of Countable Choice, an integer n≥1, a point x∈Rn, and a real radius r>0.

[L4]

Under Countable Choice, every Borel subset of Rn, in particular every open subset, is Lebesgue measurable. (Assuming countable choice, every Borel subset of Rn is Lebesgue measurable)

[L5]

Under Countable Choice, λn is a measure on the Lebesgue sigma-algebra, and measures are monotone on measurable inclusions. (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume, clause 1; Measures are monotone)

Proof

technique · direct
1.1L1algebra

If ∥y−x∥∞<r/n, then [L1, algebra] ∥y−x∥2≤n ∥y−x∥∞<r, so the open cube x+(−r/n,r/n)n is contained in B(x,r). On the other hand, ∥y−x∥2<r implies ∣yi−xi∣<r for every coordinate, so B(x,r)⊆x+(−r,r)n.

2.1step 1.1L2L3L4L5algebra

The ball B(x,r) is open in the Euclidean metric by [L3], hence Borel and Lebesgue measurable by [L4] under the stated Countable Choice. The two cubes from step 1.1 are measurable by [L2], with measures [step 1.1, L2, L3, L4, algebra] (2r/n)n>0and(2r)n<∞. Since B(x,r) lies between them, monotonicity [L5] gives 0<(2r/n)n≤λ(B(x,r))≤(2r)n<∞.

3.1step 2.1∎

Therefore B(x,r) is Lebesgue measurable of positive finite measure.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The average of a locally integrable function over a Euclidean ball

Definition

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

Let f∈Lloc1(Rn) (A locally integrable function on Rn), let x∈Rn, and let r>0. The ball average of f over B(x,r) is Arf(x):=1λ(B(x,r))∫B(x,r)f(y) dλ(y).

The denominator is well defined because Euclidean balls have positive finite Lebesgue measure shows that every Euclidean ball has positive finite Lebesgue measure.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The centered and uncentered Hardy-Littlewood maximal functions

Definition

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

Let f∈Lloc1(Rn). The centered Hardy-Littlewood maximal function of f is Mf(x):=sup⁡r>0Ar∣f∣(x)=sup⁡r>01λ(B(x,r))∫B(x,r)∣f(y)∣ dλ(y).

The uncentered Hardy-Littlewood maximal function of f is M∗f(x):=sup⁡x∈B(y,r)1λ(B(y,r))∫B(y,r)∣f(z)∣ dλ(z), where the supremum is over all Euclidean balls containing x.

Both functions take values in [0,∞].

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-04Open item page →

Sublinear operators and weak or strong type (p,q) bounds

Definition

Let (X,A,μ) and (Y,B,ν) be measure spaces, and let T assign to each measurable function on X a measurable function on Y.

The operator T is sublinear if for all scalars a,b and measurable functions f,g one has ∣T(af+bg)∣≤∣a∣ ∣Tf∣+∣b∣ ∣Tg∣.

For 1≤p≤∞ and 1≤q≤∞, we say that T is of strong type (p,q) if there is a constant C≥0 such that ∥Tf∥Lq(ν)≤C∥f∥Lp(μ) for every f∈Lp(μ) (The space Lp(μ) as the quotient by null functions, The space L∞(μ) of essentially bounded measurable functions).

For 1≤p<∞ and 1≤q<∞, we say that T is of weak type (p,q) if there is a constant C≥0 such that for every f∈Lp(μ) and every t>0, ν({∣Tf∣>t})≤(C∥f∥Lp(μ)t)q. Equivalently, the distribution function of Tf (The distribution function of absolute value) obeys ATf(t)≤(C∥f∥Lp(μ)t)q(t>0).

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Lebesgue points and the Lebesgue set of an Lloc1 class

Definition

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

Let [f]∈Lloc1(Rn) (A locally integrable function on Rn).

For a representative f of that class, a point x∈Rn is a Lebesgue point of f if lim⁡r→0+1λ(B(x,r))∫B(x,r)∣f(y)−f(x)∣ dλ(y)=0.

The Lebesgue set of the class [f] is the set Leb⁡([f]):={x∈Rn: some representative of [f] has x as a Lebesgue point}.

The later theorem on Lebesgue points shows that different representatives of the same Lloc1 class change this set only by a null set.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-04Open item page →

Density of a measurable set at a point

Definition

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

Let E⊆Rn be Lebesgue measurable (Lebesgue measurable sets, the family L(Rn), and the restricted set function λn), and let x∈Rn. If the limit exists, the density of E at x is Θ(E,x):=lim⁡r→0+λ(E∩B(x,r))λ(B(x,r)), where the denominator is positive and finite by Euclidean balls have positive finite Lebesgue measure.

When Θ(E,x)=1, we call x a density-one point of E; when Θ(E,x)=0, we call x a density-zero point of E.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-04Open item page →

A family shrinking nicely to a point

Definition

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

Let x∈Rn. A family (Er)r>0 of Lebesgue measurable subsets of Rn shrinks nicely to x if there is a constant α>0 such that for every r>0, Er⊆B(x,r)andλ(Er)≥α λ(B(x,r)).

The constant α is part of the data: later comparison estimates depend on it explicitly.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-09 (codex)Open item page →

Vitali covering lemma for Euclidean balls with fivefold dilates

Statement

For a ball B(x,r), write 5B(x,r):=B(x,5r).

  1. Let {B1,…,Bm} be a finite family of Euclidean balls in Rn. Then there is a pairwise disjoint subfamily {Bi1,…,Biℓ} such that ⋃j=1mBj⊆⋃k=1ℓ5Bik. Consequently, under the Axiom of Countable Choice, λ ⁣(⋃j=1mBj)≤5n∑k=1ℓλ(Bik).

  2. Let (Bj)j≥1 be a countable family of Euclidean balls whose radii are bounded above. Then there is a finite or countably infinite index set I⊆N≥1 such that (Bi)i∈I is pairwise disjoint and ⋃j≥1Bj⊆⋃i∈I5Bi.

The two geometric covering assertions require no choice principle. Countable choice is used only for the displayed Lebesgue-measure consequence.

Facts & Assumptions

Given: A family of Euclidean balls in Rn.

[L1]

The Euclidean balls are the sets B(x,r)={y:∥y−x∥2<r}. (Open ball, closed ball and sphere in a metric space)

[L2]

Under countable choice, Lebesgue measure scales by cn under dilation by c>0 and is translation invariant. Since 5B(x,r)=x+5(B(x,r)−x), this gives λ(5B)=5nλ(B). (The Axiom of Countable Choice (ACω), For a nonzero real c, dilation by c multiplies Lebesgue outer measure by ∣c∣n, and reflection in the origin preserves it, Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation)

[L3]

Ordinary recursion defines a unique sequence from a fixed successor rule; stage-dependent rules are obtained by carrying the stage as part of the state. (The recursion theorem)

Proof

technique · direct
1.1givenconstruct

If the finite family is empty, use the empty subfamily. Otherwise retain a ball of maximal radius, breaking ties by least index. Repeat among the remaining balls disjoint from every retained ball, and stop when none remain. There are at most m selections. The retained balls are pairwise disjoint by construction, and the tie rule makes every selection determined.

1.2givenL3constructalgebra

For the countable family, fix a positive upper bound R for its radii. Let Im={j≥1:2−m−1R<rj≤2−mR} for m≥0; these partition the positive radii. Given the retained indices in earlier classes, inspect j=1,2,… and retain j exactly when j∈Im and its ball is disjoint from every earlier retained ball. Inner recursion on j and outer recursion on m define this rule by [L3], taking the union of each inner sequence before the next class. Every decision is determined, so there is no countable choice of balls. The retained subfamily is pairwise disjoint.

2.1step 1.1L1choosealgebra

In the finite family, a chosen ball lies in its own fivefold dilate. For an unchosen Bj, take the first chosen ball Bis meeting it. At that stage Bj was eligible, so rj≤ris. For z∈Bj and w∈Bj∩Bis, the centre distance satisfies ∥cj−cis∥2≤∥cj−w∥2+∥w−cis∥2<rj+ris. Hence ∥z−cis∥2≤∥z−cj∥2+∥cj−cis∥2<2rj+ris≤3ris<5ris. Thus every original ball lies in a chosen fivefold dilate.

2.2step 1.2L1choosealgebra

Let Bj be any original ball that was not chosen in the countable construction, and let j∈Im. When the algorithm inspected j, some previously chosen ball Bis already met Bj; otherwise Bj would have been retained. If is∈Iℓ with ℓ<m, then rj≤2−mR≤2−ℓ−1R<ris. If instead ℓ=m, then both balls lie in the same dyadic class, so rj≤2−mR<2ris. In either case, rj<2ris. Choose z∈Bj and w∈Bj∩Bis. Then ∥z−cis∥2<rj+rj+ris<2(2ris)+ris=5ris, so again Bj⊆5Bis. Let I⊆N≥1 be the set of retained indices. This set is finite or countably infinite, and chosen balls are also contained in their own fivefold dilates; hence ⋃j≥1Bj⊆⋃i∈I5Bi.

3.1step 2.1L2algebra

For the measure consequence, assume countable choice as required by [L2]. Finite subadditivity and the established inclusion give λ(⋃j=1mBj)≤λ(⋃k=1ℓ5Bik)≤∑k=1ℓλ(5Bik)=5n∑k=1ℓλ(Bik). This is the only use of countable choice in this proof.

4.1step 3.1step 2.2∎

Steps 3.1 and 2.2 prove the finite and countable forms.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

Ball averages vary continuously with the centre and radius

Statement

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

Let f∈Lloc1(Rn). The map Φ:Rn×(0,∞)→C,Φ(x,r):=Arf(x), is continuous.

Facts & Assumptions

Given: The Axiom of Countable Choice, a locally integrable function f, a point (x,r)∈Rn×(0,∞), and a sequence (xk,rk)→(x,r) with rk>0.

[L1]

The ball average is Arf(x)=1λ(B(x,r))∫B(x,r)f(y) dλ(y). (The average of a locally integrable function over a Euclidean ball)

[L2]

Euclidean balls have positive finite Lebesgue measure. (Euclidean balls have positive finite Lebesgue measure)

[L4]

Dominated convergence passes pointwise almost-everywhere limits through an integrable majorant. (Dominated convergence)

Proof

technique · direct
1.1givenchoosealgebra

Choose ρ>0 with 0<ρ<r/2. For all sufficiently large k, [given, choose, algebra] ∣rk−r∣<ρ and ∥xk−x∥2<ρ. Then B(xk,rk)⊆B(x,r+2ρ). Since f is locally integrable, the function g:=∣f∣ 1B(x,r+2ρ) is integrable.

1.2algebra

Put χk:=1B(xk,rk) and χ:=1B(x,r). [algebra] If y∉∂B(x,r), then ∥y−x∥2≠r, so for all sufficiently large k the membership of y in B(xk,rk) agrees with its membership in B(x,r). Thus χk(y)→χ(y) for every y∉∂B(x,r).

1.3L2L3algebra

The boundary sphere satisfies [L2, L3, algebra] ∂B(x,r)⊆B(x,r+1m)∖B(x,r−1m)(m>1/r). By [L2] and [L3], λ ⁣(B(x,r+1m)∖B(x,r−1m))=λ(B(0,1))((r+1m)n−(r−1m)n)→0, so λ(∂B(x,r))=0.

1.4L2L3algebra

By [L2] and [L3], [L2, L3, algebra] λ(B(xk,rk))=λ(B(0,1)) rkn→λ(B(0,1)) rn=λ(B(x,r)). The limit denominator is positive by [L2].

2.1step 1.1step 1.2step 1.3L4

Steps 1.1, 1.2, and 1.3 let us apply [L4] to [step 1.1, step 1.2, step 1.3, L4] fχk, dominated by g, and obtain ∫f(y)χk(y) dλ(y)→∫f(y)χ(y) dλ(y). In other words, ∫B(xk,rk)f dλ→∫B(x,r)f dλ.

3.1L1step 2.1step 1.4algebra∎

Combining steps 2.1 and 1.4 yields [L1, step 2.1, step 1.4, algebra] Arkf(xk)→Arf(x). Since the approximating sequence was arbitrary, Φ is continuous.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The centered Hardy-Littlewood maximal function is Borel measurable

Statement

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

Let f∈Lloc1(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)=sup⁡r>0Ar∣f∣(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.1given

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

1.2L1L2givenchoose

Let x∈{Mf>t}. By [L1], there is r>0 with Ar∣f∣(x)>t. Apply [L1, L2, given, choose] to the locally integrable function ∣f∣: continuity of y↦Ar∣f∣(y) at x gives δ>0 such that ∥y−x∥2<δ  ⟹  Ar∣f∣(y)>t. Hence B(x,δ)⊆{Mf>t}.

2.1step 1.2

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

3.1step 1.1step 2.1∎

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

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

The centered and uncentered maximal functions are pointwise comparable

Statement

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

Let f∈Lloc1(Rn). Then for every x∈Rn, Mf(x)≤M∗f(x)≤2nMf(x).

Facts & Assumptions

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

[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.1L1

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 M∗f(x). Therefore Mf(x)≤M∗f(x).

1.2L1algebra

Let B(y,r) be any ball containing x. If z∈B(y,r), then [L1, algebra] ∥z−x∥2≤∥z−y∥2+∥y−x∥2<r+r=2r, so B(y,r)⊆B(x,2r). Hence ∫B(y,r)∣f∣≤∫B(x,2r)∣f∣ dλ.

2.1step 1.2L1L2algebra

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∣=2nA2r∣f∣(x)≤2nMf(x). Taking the supremum over all balls B(y,r) containing x yields M∗f(x)≤2nMf(x).

3.1step 1.1step 2.1∎

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

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-09 (codex)Open item page →

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.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

The centered maximal operator is bounded on L∞

Statement

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

Let f∈L∞(Rn). Then Mf(x)≤∥f∥∞(x∈Rn). In particular, M is of strong type (∞,∞) with operator norm at most 1.

Facts & Assumptions

Given: The Axiom of Countable Choice and a function f∈L∞(Rn).

[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]

The L∞ norm is the essential supremum. In particular, ∣f∣≤∥f∥∞ almost everywhere. (The space L∞(μ) of essentially bounded measurable functions)

Proof

technique · direct
1.1L1L2givenalgebra

Fix x∈Rn and r>0. By [L2], [L1, L2, given, algebra] ∫B(x,r)∣f(y)∣ dλ(y)≤∥f∥∞ λ(B(x,r)). Dividing by λ(B(x,r)) gives Ar∣f∣(x)≤∥f∥∞.

2.1step 1.1L1algebra∎

Taking the supremum of the inequality from step 1.1 over all r>0 yields [step 1.1, L1, algebra] Mf(x)≤∥f∥∞. Since x was arbitrary, the centered maximal operator is bounded on L∞ with norm at most 1.

TheoremStatement: Literature-sourcedProof: AI-generatedverified 2026-09-23 (gpt-6-sol)Open item page →

Marcinkiewicz interpolation from weak (1,1) and strong (∞,∞)

Statement

Let (X,A,μ) be a measure space, let T be a sublinear operator on measurable functions, and suppose:

  1. T is of weak type (1,1) with constant A;
  2. T is of strong type (∞,∞) with constant B.

Then for every 1<p<∞ and every f∈Lp(μ), ∥Tf∥p≤2(App−1)1/pB1−1/p∥f∥p. In particular, T is of strong type (p,p) for every 1<p<∞.

Facts & Assumptions

Given: A measure space (X,A,μ), a sublinear operator T, constants A,B≥0, an exponent 1<p<∞, and a function f∈Lp(μ).

[L1]

Sublinearity, weak type (1,1), and strong type (∞,∞) are as defined in Sublinear operators and weak or strong type (p,q) bounds.

[L2]

The distribution function of a measurable function g is Ag(t)=μ({∣g∣>t}). (The distribution function of absolute value)

[L3]

For 0<p<∞, ∫∣g∣p dμ=p∫0∞tp−1μ({∣g∣>t}) dt for every measurable g. (For 0 < p < infinity, the layer-cake formula computes the integral of |f|^p from the distribution function)

[L4]

For nonnegative measurable v, the set function λ(E)=∫Ev dμ is a measure, and ∫h dλ=∫hv dμ for nonnegative measurable h. (The indefinite integral of a nonnegative measurable function is a measure, Integrating against a density agrees with integrating the product)

Proof

technique · direct
1.1L1givenconstructalgebra

Fix t>0 and η>0, and put C:=B+η>0. Since the strong [L1, given, construct, algebra] (∞,∞) bound with constant B also holds with the larger constant C, split f=ft>+ft≤,ft>:=f 1{∣f∣>t/(2C)},ft≤:=f 1{∣f∣≤t/(2C)}. Sublinearity gives ∣Tf∣≤∣Tft>∣+∣Tft≤∣. Since ∥ft≤∥∞≤t/(2C), the strong (∞,∞) bound with constant C yields ∣Tft≤∣≤C∥ft≤∥∞≤t/2. Therefore {∣Tf∣>t}⊆{∣Tft>∣>t/2}.

2.1L1step 1.1algebra

On {∣f∣>t/(2C)} one has ∣f∣≤(2C/t)p−1∣f∣p, so ft>∈L1 because f∈Lp. Apply the weak (1,1) bound: [L1, step 1.1, algebra] μ({∣Tf∣>t})≤μ({∣Tft>∣>t/2})≤2At∥ft>∥1=2At∫{∣f∣>t/(2C)}∣f∣ dμ.

3.1L2L3step 2.1algebra

Using [L3] with g=Tf and then step 2.1, [L2, L3, step 2.1, algebra] ∥Tf∥pp=p∫0∞tp−1μ({∣Tf∣>t}) dt≤2Ap∫0∞tp−2(∫{∣f∣>t/(2C)}∣f∣ dμ)dt.

4.1L3L4step 3.1algebra

Define the positive measure λ(E)=∫E∣f∣ dμ by [L4]. Apply [L3] with exponent p−1>0, function ∣f∣, and measure λ; then substitute t=2Cu in the one-dimensional nonnegative integral from step 3.1. This gives ∫0∞tp−2λ({∣f∣>t/(2C)}) dt=(2C)p−1p−1∫X∣f∣p−1 dλ. By [L4], the last integral is ∫X∣f∣p dμ. Hence ∥Tf∥pp≤2pApp−1Cp−1∫X∣f∣p dμ. This uses no sigma-finiteness assumption on μ.

5.1step 4.1algebra∎

Taking pth roots in step 4.1 gives [step 4.1, algebra] ∥Tf∥p≤2(App−1)1/pC1−1/p∥f∥p. Because η>0 was arbitrary, letting η↓0 yields ∥Tf∥p≤2(App−1)1/pB1−1/p∥f∥p. Thus T is of strong type (p,p) for every 1<p<∞.

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The centered maximal operator is bounded on Lp(Rn) for 1<p<∞

Statement

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

Let 1<p<∞. Then there is a constant Cn,p such that every f∈Lp(Rn) satisfies ∥Mf∥p≤Cn,p∥f∥p. By comparison, the same is true for the uncentered maximal function.

Facts & Assumptions

Given: The Axiom of Countable Choice, an exponent 1<p<∞, and a function f∈Lp(Rn).

[L1]

The centered maximal operator is of weak type (1,1) with constant 5n. (The centered Hardy-Littlewood maximal operator is weak type (1,1))

[L2]

The centered maximal operator is of strong type (∞,∞) with operator norm at most 1. (The centered maximal operator is bounded on L∞)

[L3]

A sublinear operator of weak type (1,1) and strong type (∞,∞) is of strong type (p,p) for every 1<p<∞. (Marcinkiewicz interpolation from weak (1,1) and strong (∞,∞))

[L4]

One has Mf≤M∗f≤2nMf pointwise. (The centered and uncentered maximal functions are pointwise comparable)

Proof

technique · direct
1.1L1L2L3givenalgebra

The maximal operator is sublinear by definition of supremum and absolute [L1, L2, L3, given, algebra] values. Apply [L3] with the constants from [L1] and [L2]. This yields a constant Cn,p such that ∥Mf∥p≤Cn,p∥f∥p.

2.1step 1.1L4algebra∎

Step 1.1 proves the centered estimate. Then [L4] gives [step 1.1, L4, algebra] ∥M∗f∥p≤2n∥Mf∥p≤2nCn,p∥f∥p, so the uncentered estimate follows as well.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

Continuous compactly supported functions are recovered by small ball averages

Statement

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

Let g∈Cc(Rn) and let x∈Rn. Then lim⁡r→0+Arg(x)=g(x).

Facts & Assumptions

Given: The Axiom of Countable Choice, a function g∈Cc(Rn), and a point x∈Rn.

[L1]

The class Cc(Rn) consists of continuous functions on Rn with compact support. (The spaces Cc(Rn) and Cc∞(Rn))

[L2]

The ball average is Arg(x)=1λ(B(x,r))∫B(x,r)g(y) dλ(y). (The average of a locally integrable function over a Euclidean ball)

Proof

technique · direct
1.1L1given

Let ε>0. Since g is continuous at x by [L1], there is [L1, given] δ>0 such that ∥y−x∥2<δ  ⟹  ∣g(y)−g(x)∣<ε.

2.1step 1.1L2algebra

For 0<r<δ, every y∈B(x,r) satisfies the hypothesis of step 1.1, [step 1.1, L2, algebra] so ∣Arg(x)−g(x)∣≤1λ(B(x,r))∫B(x,r)∣g(y)−g(x)∣ dλ(y)≤ε.

3.1step 2.1∎

Because step 2.1 holds for every ε>0, one has [step 2.1] Arg(x)→g(x) as r→0+.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

Lebesgue differentiation theorem on Rn

Statement

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

Let f∈Lloc1(Rn). Then lim⁡r→0+Arf(x)=f(x) for Lebesgue-almost every x∈Rn.

Facts & Assumptions

Given: The Axiom of Countable Choice and a function f∈Lloc1(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 1≤p<∞, Cc(Rn) is dense in Lp(Rn). (Cc(Rn) is dense in Lp(Rn) for 1≤p<∞)

[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))

[L5]

Under Countable Choice, λn is a complete measure on the Lebesgue sigma-algebra of Rn (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume). For measurable sets, finite and countable unions have measure at most the corresponding sum, and inclusion implies monotonicity (Finite and countable subadditivity of measures, Measures are monotone). In particular a countable union of measurable λn-zero sets has measure zero.

Proof

technique · direct
1.1L2givenchooseconstruct

For each integer m≥1 and each integer j≥1, apply [L2] to the [L2, given, choose, construct] L1 function f1B(0,m+1) and choose gm,j∈Cc(Rn) such that ∫B(0,m+1)∣f−gm,j∣ dλ<2−2j5n. Set hm,j:=(f−gm,j)1B(0,m+1).

2.1L3L4L5step 1.1algebra

Let [L3, L4, L5, step 1.1, algebra] Em,j:={x∈B(0,m):Mhm,j(x)>2−j}∪{x∈B(0,m):∣hm,j(x)∣>2−j}. Both sets are Lebesgue measurable: the maximal superlevel set is open by the ball-average continuity argument in [L4], and hm,j is measurable. Finite subadditivity [L5], [L4] and [L3] give λ(Em,j)≤5n2−j∥hm,j∥1+12−j∥hm,j∥1<2−j+5−n2−j≤21−j.

3.1L5step 2.1algebra

For fixed m, put [step 2.1, algebra] Nm:=⋂N=1∞⋃j≥NEm,j. The sets Em,j, their countable unions, and Nm are measurable by [L5]. By countable subadditivity [L5] and step 2.1 λ ⁣(⋃j≥NEm,j)≤∑j≥Nλ(Em,j)≤∑j≥N21−j=22−N. For every N, inclusion and monotonicity [L5] give 0≤λ(Nm)≤22−N. Given ϵ>0, choose N with 22−N<ϵ; thus λ(Nm)=0. This uses small positive tail measures, without asserting that any Em,j is null.

4.1L1step 1.1step 3.1algebra

Let x∈B(0,m)∖Nm. Then there is Nx such that [L1, step 1.1, step 3.1, algebra] x∉Em,j for every j≥Nx. Fix such a j and take 0<r<1. Since x∈B(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)∣+21−j. Now [L1] gives Argm,j(x)→gm,j(x), so lim sup⁡r→0+∣Arf(x)−f(x)∣≤21−j for every j≥Nx. Letting j→∞ yields Arf(x)→f(x).

5.1step 3.1step 4.1L5∎

The bad set for radius differentiation is contained in [step 3.1, step 4.1, L5] ⋃m≥1Nm, which is null by [L5]. Thus the convergence holds for almost every x∈Rn.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

Almost every point is a Lebesgue point of a locally integrable function

Statement

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

Let f∈Lloc1(Rn). Then the Lebesgue set of the Lloc1 class of f has full Lebesgue measure.

Equivalently, for almost every x∈Rn, lim⁡r→0+1λ(B(x,r))∫B(x,r)∣f(y)−f(x)∣ dλ(y)=0.

Facts & Assumptions

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

[L1]

A point belongs to the Lebesgue set exactly when the averaged oscillation above tends to 0. (Lebesgue points and the Lebesgue set of an Lloc1 class)

[L2]

A property holds almost everywhere when its exceptional set is contained in a measurable null set. (Measure-null sets and almost-everywhere statements relative to a measure)

[L3]

The rationals are countably infinite, and the product of two at most countable sets is at most countable. (Q is countably infinite, A product of two at most countable sets is at most countable)

[L4]

Rationals are dense in the reals. (The rationals embed densely in the reals)

[L5]

Under Countable Choice, λn is a complete measure on the Lebesgue sigma-algebra of Rn (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume). Countable subadditivity gives λn(⋃kNk)≤∑kλn(Nk)=0 for every sequence of measurable λn-null sets (Finite and countable subadditivity of measures).

[L6]

If u∈Lloc1(Rn), then Aru(x)→u(x) for almost every x. (Lebesgue differentiation theorem on Rn)

Proof

technique · direct
1.1L3L5L6givenconstruct

Let [L3, L5, L6, given, construct] D:={a+ib:a,b∈Q}. By [L3], D is countable. For each c∈D, the function uc:=∣f−c∣ is locally integrable, so [L6] and [L2] give a measurable λn-null set Nc containing all exceptions such that lim⁡r→0+Aruc(x)=uc(x)=∣f(x)−c∣ for every x∉Nc. Put N:=⋃c∈DNc. By [L5], N is null.

2.1step 1.1L4algebra

Fix x∉N and let ε>0. By density [L4], choose [step 1.1, L4, algebra] c∈D with ∣f(x)−c∣<ε. Then for every r>0, 1λ(B(x,r))∫B(x,r)∣f(y)−f(x)∣ dλ(y)≤Ar∣f−c∣(x)+∣c−f(x)∣. Taking r→0+ and using step 1.1 gives lim sup⁡r→0+1λ(B(x,r))∫B(x,r)∣f(y)−f(x)∣ dλ(y)≤2ε. Since ε is arbitrary, the limit is 0.

3.1L1L2step 1.1step 2.1∎

Step 2.1 holds for every x∉N, and N is null. By [L1] and [L2], [L1, L2, step 1.1, step 2.1] the Lebesgue set of the class of f has full measure.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Lebesgue density theorem

Statement

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

Let E⊆Rn be Lebesgue measurable. Then

  1. Θ(E,x)=1 for almost every x∈E;
  2. Θ(E,x)=0 for almost every x∈Ec.

Facts & Assumptions

Given: The Axiom of Countable Choice and a Lebesgue measurable set E⊆Rn.

[L1]

The density of E at x is Θ(E,x)=lim⁡r→0+λ(E∩B(x,r))λ(B(x,r)) when the limit exists. (Density of a measurable set at a point)

[L2]

Almost every point of a locally integrable function is a Lebesgue point. (Almost every point is a Lebesgue point of a locally integrable function)

[L3]

Every Euclidean ball has positive finite measure. (Euclidean balls have positive finite Lebesgue measure)

Proof

technique · direct
1.1L2L3givenalgebra

Because 0≤1E≤1 and balls have finite measure by [L3], the [L2, L3, given, algebra] indicator 1E is locally integrable. Apply [L2] to 1E. There is a null set N such that every x∉N is a Lebesgue point of 1E.

2.1L1step 1.1algebra

Let x∈E∖N. Then 1E(x)=1, and for every r>0, [L1, step 1.1, algebra] 1λ(B(x,r))∫B(x,r)∣1E(y)−1∣ dλ(y)=1−λ(E∩B(x,r))λ(B(x,r)). Since the left-hand side tends to 0, [L1] gives Θ(E,x)=1.

2.2L1step 1.1algebra

Let x∈Ec∖N. Then 1E(x)=0, and for every r>0, [L1, step 1.1, algebra] 1λ(B(x,r))∫B(x,r)∣1E(y)−0∣ dλ(y)=λ(E∩B(x,r))λ(B(x,r)). Again the left-hand side tends to 0, so [L1] gives Θ(E,x)=0.

3.1step 1.1step 2.1step 2.2∎

Steps 2.1 and 2.2 hold outside the null set N, so they prove the two [step 1.1, step 2.1, step 2.2] density conclusions.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Differentiation holds along families shrinking nicely

Statement

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

Let f∈Lloc1(Rn), let A⊆Rn, and suppose that for each x∈A there is a family (Er(x))r>0 shrinking nicely to x with constant αx>0. Then for almost every x∈A, lim⁡r→0+1λ(Er(x))∫Er(x)∣f(y)−f(x)∣ dλ(y)=0, hence lim⁡r→0+1λ(Er(x))∫Er(x)f(y) dλ(y)=f(x).

Facts & Assumptions

Given: The Axiom of Countable Choice, a locally integrable function f, a set A⊆Rn, and for each x∈A a family (Er(x))r>0 shrinking nicely to x.

[L1]

Shrinking nicely means that for each x∈A there is a constant αx>0 such that Er(x)⊆B(x,r)andλ(Er(x))≥αx λ(B(x,r)) for every r>0. (A family shrinking nicely to a point)

[L2]

Almost every point of f is a Lebesgue point. (Almost every point is a Lebesgue point of a locally integrable function)

Proof

technique · direct
1.1L1L2givenalgebra

Let x∈A be a Lebesgue point of f, as supplied by [L2]. For every [L1, L2, given, algebra] r>0, [L1] gives 1λ(Er(x))∫Er(x)∣f(y)−f(x)∣ dλ(y)≤1αx λ(B(x,r))∫B(x,r)∣f(y)−f(x)∣ dλ(y).

2.1step 1.1

Because x is a Lebesgue point, the right-hand side of step 1.1 tends to [step 1.1] 0 as r→0+. Therefore the left-hand side also tends to 0.

3.1step 2.1algebra

Using [step 2.1, algebra] ∣1λ(Er(x))∫Er(x)f(y) dλ(y)−f(x)∣≤1λ(Er(x))∫Er(x)∣f(y)−f(x)∣ dλ(y), step 2.1 immediately gives the second limit as well.

4.1L2step 3.1∎

Step 3.1 holds at every Lebesgue point of f, hence for almost every x∈A.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-09-09Open item page →

Differentiation of sigma-finite Borel measures finite on compact sets

Statement

Assume the Axiom of Choice (The Axiom of Choice), hence also countable choice (The Axiom of Countable Choice (ACω)).

Let ν be a sigma-finite Borel measure on Rn that is finite on compact sets. Write ν=νa+νs,νa≪λ,νs⊥λ, for its Lebesgue decomposition on the Borel sigma-algebra relative to the restriction of Lebesgue measure, and choose a Borel measurable representative f of the Radon-Nikodym class dνa/dλ. Then for Lebesgue-almost every x∈Rn, lim⁡r→0+ν(B(x,r))λ(B(x,r))=f(x). More generally, let A⊆Rn, and suppose that for each x∈A a family (Er(x))r>0 of Borel sets shrinking nicely to x is specified. Then for Lebesgue-almost every x∈A, lim⁡r→0+ν(Er(x))λ(Er(x))=f(x).

Facts & Assumptions

Given: The Axiom of Choice and a sigma-finite Borel measure ν on Rn that is finite on compact sets. All measure decompositions are on the common Borel sigma-algebra; the resulting Borel density is also Lebesgue measurable.

[L2]

If (Er) shrinks nicely to x, then 1λ(Er)∫Erf dλ→f(x) for almost every x. (Differentiation holds along families shrinking nicely)

[L4]

Assuming the Axiom of Countable Choice, Lebesgue measure is inner regular by compact subsets on measurable sets in Rn. (Assuming countable choice, the Lebesgue measure of a measurable set is the supremum of the measures of its compact subsets)

[L5]

Increasing measurable unions pass through positive measures. (Continuity from below for measures)

[L7]

Borel sets form the sigma-algebra generated by open sets. (The Borel sigma-algebra of a topological space)

Proof

technique · direct
1.1L1L3givenchoosealgebra

The closed balls Xj=B(0,j)‾, j≥1, give a common finite-measure Borel exhaustion for ν and λ by [L3]. Under the given AC, [L1] therefore gives ν=νa+νs and a finite real Borel density f of νa. Choose a Borel null set N carrying νs. For every Borel E, absolute continuity and concentration give νs(E)=ν(E∩N)≥0,νa(E)=ν(E∖N)≥0. Both components are positive and dominated by ν. On each finite exhaustion piece, the set where f≤−1/k has measure zero: its density integral is at most −λ(E)/k but equals νa(E)≥0. Taking the countable union over j,k and replacing negative values by zero yields f≥0 without changing its class. For every ball, ∫B(x,R)∣f∣ dλ=νa(B(x,R))≤ν(B(x,R)‾)<∞. Thus f∈Lloc1.

1.2L3L5L7givenconstructalgebra

We prove locally the outer approximation needed below. Let η be any Borel measure finite on compact sets and V=B(0,j) for j≥1; then η(V)<∞. Every open W⊆V is an increasing union of compact sets: use the sets of points of W with norm at most m and distance at least 1/m from its complement, m≥1. These are closed and bounded, so [L3] and [L5] approximate W from inside by compact sets in η-measure. Let C be the Borel E⊆V such that for every δ>0 there are relatively closed F and relatively open O with F⊆E⊆O⊆V and η(O∖F)<δ. All relatively open sets are in C by the compact approximation just proved. Relative complements preserve C by interchanging F and O. Countable unions preserve outer approximation by choosing open supersets with summable errors; they preserve inner approximation by first taking a finite partial union with small remaining measure (using η(V)<∞ and [L5]) and then taking a finite union of relatively closed approximants. Thus C is a sigma-algebra, and [L7] implies that it contains every Borel subset of V. In particular each such set has arbitrarily accurate relatively open outer approximations. The countable selections are covered by AC.

2.1step 1.2givenchoosealgebra

If H is a Borel η-null set, put V0=∅, Vj=B(0,j) and Hj=H∩(Vj∖Vj−1) for j≥1. Step 1.2 gives relatively open Oj⊆Vj containing Hj with η(Oj)<ε2−j. As Vj is open, each Oj is open in Rn. Their union is an open set containing H with measure less than ε. This proves the required null-set outer approximation without importing a later regularity theorem.

2.2L1L2step 1.1givenalgebra

Let (Er(x))r>0 be a family of Borel sets shrinking nicely to x with constant αx>0. Then ν(Er(x))λ(Er(x))=1λ(Er(x))∫Er(x)f dλ+νs(Er(x))λ(Er(x)), while positivity and the defining comparison give 0≤νs(Er(x))λ(Er(x))≤1αxνs(B(x,r))λ(B(x,r)). Consequently [L2] and step 1.1 reduce both conclusions to proving νs(B(x,r))λ(B(x,r))⟶0 for almost every x.

2.3step 1.1L5givenconstructalgebra

Put G:=Rn∖N, so G is Borel, λ(Rn∖G)=0, and νs(G)=0. For each m≥1, define Dm(x):=sup⁡0<r<1/mνs(B(x,r))λ(B(x,r)). For fixed r>0, if 0<δ<r and ∥x−y∥2<δ, then B(x,r−δ)⊆B(y,r). By [L5], νs(B(x,r−δ))↑νs(B(x,r)) as δ↓0, so x↦νs(B(x,r)) is lower semicontinuous. Translation invariance gives the fixed positive denominator λ(B(x,r))=λ(B(0,r)), so each Dm is lower semicontinuous and each set {x∈Rn:Dm(x)>1k} is open. For k≥1, put Fk:=G∩⋂m≥1{x∈Rn:Dm(x)>1k}. Then Fk is Borel. If x∈G and L(x):=lim sup⁡r→0+νs(B(x,r))λ(B(x,r))>0, choose k with 1/k<L(x). Since Dm(x)≥L(x)>1/k for every m, one has x∈Fk. Thus {x∈G:L(x)>0}⊆⋃k≥1Fk, and it is enough to prove λ(Fk)=0 for every k.

3.1step 1.1step 2.1step 2.3L6givenconstructalgebra

Fix k≥1 and ε>0. By steps 1.1 and 2.1, there is an open Uε⊇G with νs(Uε)<ε. Let K⊆Fk be nonempty and compact (the empty case has measure zero). Consider all balls B(x,r)⊆Uε with x∈K and νs(B(x,r))>λ(B(x,r))/k. They cover K: for each x, choose m with B(x,1/m)⊆Uε, and use Dm(x)>1/k. Compactness gives a finite subcover. Greedily retain a largest-radius ball and discard all balls meeting it, repeating on the remaining finite family. The retained balls B1,…,Bq are disjoint. Any discarded ball of radius r meets a retained one of radius R≥r; their centres are less than r+R apart, so every point of the discarded ball is less than 2r+R≤3R<5R from the retained centre. Hence K⊆⋃j5Bj. By [L6] and disjointness, λ(K)≤5n∑jλ(Bj)<5nk∑jνs(Bj)≤5nkνs(Uε)<5nkε.

4.1step 2.3step 3.1L4algebra

Since ε>0 was arbitrary, step 3.1 gives λ(K)=0 for every compact K⊆Fk. Because Fk is Borel by step 2.3, [L4] implies λ(Fk)=sup⁡{λ(K):K⊆Fk, K compact}=0. Step 2.3 now shows that the set where L(x)>0 is contained in the null set (Rn∖G)∪⋃k≥1Fk. The ratios defining L are nonnegative, so lim⁡r→0+νs(B(x,r))λ(B(x,r))=0 for almost every x.

5.1L2step 1.1step 2.2step 4.1∎

Combine step 4.1 with the comparison in step 2.2 and the differentiation theorem [L2] for the locally integrable representative f. For any specified Borel families (Er(x))r>0 shrinking nicely to the points of A, this gives ν(Er(x))λ(Er(x))→f(x) for almost every x∈A. Taking A=Rn and Er(x)=B(x,r) gives the ball conclusion.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The indefinite integral of an L1 function is differentiable almost everywhere

Statement

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

Let a<b and let f∈L1([a,b]). Define F(x):=∫axf(t) dt(a≤x≤b). Then F is differentiable for almost every x∈(a,b) and F′(x)=f(x) at every such point.

Facts & Assumptions

Given: The Axiom of Countable Choice, reals a<b, and a function f∈L1([a,b]).

[L1]

The L1 norm is the integral of the absolute value. (The class L1(μ) of integrable functions)

[L2]

Differentiation along families shrinking nicely recovers the point value at almost every point. (Differentiation holds along families shrinking nicely)

Proof

technique · direct
1.1L1givenconstructalgebra

Extend f by 0 outside [a,b], obtaining a function g on [L1, given, construct, algebra] R. Because g is bounded by ∣f∣ on [a,b] and vanishes elsewhere, ∫R∣g(t)∣ dt=∫ab∣f(t)∣ dt<∞, so g∈Lloc1(R). For x∈(a,b) and every r>0, define Er+(x):=[x,x+r),Er−(x):=(x−r,x]. Each family shrinks nicely to x with constant α=12, because Er±(x)⊆B(x,r) and λ(Er±(x))=r=12λ(B(x,r)).

2.1L2step 1.1algebra

Apply [L2] to the set A:=(a,b) and the family Er+(x) from step [L2, step 1.1, algebra] 1.1. This gives a full-measure subset A+⊆(a,b) such that lim⁡r→0+1r∫xx+rg(t) dt=g(x)(x∈A+). Applying [L2] again to the family Er−(x) gives another full-measure subset A−⊆(a,b) such that lim⁡r→0+1r∫x−rxg(t) dt=g(x)(x∈A−). Hence both one-sided limits hold for every x∈A+∩A−, which still has full measure in (a,b). At such an x, if h>0 is small then F(x+h)−F(x)h=1h∫xx+hf(t) dt=1h∫xx+hg(t) dt, while for h<0, F(x+h)−F(x)h=1∣h∣∫x+hxg(t) dt. Both one-sided limits therefore equal g(x)=f(x).

3.1step 2.1∎

Hence F′(x)=f(x) for almost every x∈(a,b).

CounterexampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-09-04Open item page →

The Hardy-Littlewood maximal operator is not strong type (1,1)

Statement refuted

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

The centered Hardy-Littlewood maximal operator maps L1(Rn) to L1(Rn).

More strongly, if f∈L1(Rn) satisfies ∥f∥1>0, then Mf∉L1(Rn).

Facts & Assumptions

Given: The Axiom of Countable Choice and a function f∈L1(Rn) with ∥f∥1>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]

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

[L3]

Lebesgue measure is sigma-finite, and every bounded measurable set has finite measure. (Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure)

Counterexample

technique · direct
1.1L2L3givenchoosealgebra

Since ∥f∥1>0, the integral in [L2] is positive. Hence there is [L2, L3, given, choose, algebra] ε>0 such that the measurable set E:={y∈Rn:∣f(y)∣>ε} has positive measure. Because Rn=⋃m≥1B(0,m) and measure is countably subadditive, some R≥1 satisfies 0<λ(F)<∞,F:=E∩B(0,R), the finiteness coming from [L3].

2.1step 1.1L1L4algebra

Let x∈Rn with ∥x∥2≥2R. If y∈F, then [step 1.1, L1, L4, algebra] ∥y−x∥2≤∥y∥2+∥x∥2≤R+∥x∥2≤32∥x∥2, so F⊆B(x,32∥x∥2). Since ∣f∣≥ε on F, [L1] gives Mf(x)≥1λ(B(x,32∥x∥2))∫F∣f(y)∣ dλ(y)≥ε λ(F)λ(B(0,1))(32∥x∥2)n=C∥x∥2n for a positive constant C.

3.1step 2.1L4algebra

For each integer k≥1, set [step 2.1, L4, algebra] Ak:=B(0,2k+1R)∖B(0,2kR). On Ak one has ∥x∥2≤2k+1R, so step 2.1 yields Mf(x)≥C(2k+1R)n(x∈Ak). Therefore ∫AkMf dλ≥C(2k+1R)nλ(Ak). Using [L4] again, λ(Ak)=λ(B(0,1))((2k+1R)n−(2kR)n), so the right-hand side is a positive constant independent of k. Since the annuli Ak are pairwise disjoint, the integral of Mf over ⋃k≥1Ak diverges.

4.1step 3.1∎

Thus Mf∉L1(Rn) whenever ∥f∥1>0, so the [step 3.1] strong type (1,1) claim is false.

5 · Examples, counterexamples and false statements

None yet.

Sources