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.

18 results · all verified · 6 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 12 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:RnC 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-generatedprecheck passaudited 2026-09-04Open item page →

Euclidean balls have positive finite Lebesgue measure

Statement

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

Let xRn 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, a point xRn, and a real radius r>0.

[L1]

The Euclidean ball is B(x,r)={yRn:yx2<r}. (Open ball, closed ball and sphere in a metric space)

Proof

technique · direct
1.1

If yx<r/n, then [L1, algebra] yx2nyx<r, so the open cube x+(r/n,r/n)n is contained in B(x,r). On the other hand, yx2<r implies yixi<r for every coordinate, so B(x,r)x+(r,r)n.

L1algebra
2.1

The two cubes from step 1.1 are measurable by [L2], with measures [step 1.1, L2, algebra] (2r/n)n>0and(2r)n<. Since B(x,r) lies between them, monotonicity gives 0<(2r/n)nλ(B(x,r))(2r)n<.

step 1.1L2algebra
3.1

Therefore B(x,r) is Lebesgue measurable of positive finite measure. [step 2.1]

step 2.1
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 fLloc1(Rn) (A locally integrable function on Rn), let xRn, 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 fLloc1(Rn). The centered Hardy-Littlewood maximal function of f is Mf(x):=supr>0Arf(x)=supr>01λ(B(x,r))B(x,r)f(y)dλ(y).

The uncentered Hardy-Littlewood maximal function of f is Mf(x):=supxB(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)aTf+bTg.

For 1p and 1q, we say that T is of strong type (p,q) if there is a constant C0 such that TfLq(ν)CfLp(μ) for every fLp(μ) (The space Lp(μ) as the quotient by null functions, The space L(μ) of essentially bounded measurable functions).

For 1p< and 1q<, we say that T is of weak type (p,q) if there is a constant C0 such that for every fLp(μ) and every t>0, ν({Tf>t})(CfLp(μ)t)q. Equivalently, the distribution function of Tf (The distribution function of absolute value) obeys ATf(t)(CfLp(μ)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 xRn is a Lebesgue point of f if limr0+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]):={xRn: 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 ERn be Lebesgue measurable (Lebesgue measurable sets, the family L(Rn), and the restricted set function λn), and let xRn. If the limit exists, the density of E at x is Θ(E,x):=limr0+λ(EB(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 xRn. 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, ErB(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-generatedprecheck passaudited 2026-09-04Open 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=1mBjk=15Bik. Consequently, λ ⁣(j=1mBj)5nk=1λ(Bik).

  2. Let (Bj)j1 be a countable family of Euclidean balls whose radii are bounded above. Then there is a finite or countably infinite index set IN1 such that (Bi)iI is pairwise disjoint and j1BjiI5Bi.

Facts & Assumptions

Given: A family of Euclidean balls in Rn.

[L1]

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

[L2]

Lebesgue measure scales by cn under dilation by c>0. In particular, for every ball B, λ(5B)=5nλ(B). (For a nonzero real c, dilation by c multiplies Lebesgue outer measure by cn, and reflection in the origin preserves it)

Proof

technique · direct
1.1

For the finite family, choose Bi1 with maximal radius among [given, choose] B1,,Bm. Having chosen disjoint balls Bi1,,Bis1, choose Bis with maximal radius among the remaining balls disjoint from all earlier choices, and stop when none remain. The chosen subfamily is pairwise disjoint by construction.

givenchoose
1.2

Now let (Bj)j1 be countable with radii bounded above, and put R:=supj1rj. For each integer m0, let Im:={j1:2m1R<rj2mR}. Process the classes I0,I1, in this order, and within each class inspect the indices in increasing order. Retain Bj exactly when it is disjoint from every ball already retained. The retained subfamily is pairwise disjoint by construction.

givenconstructalgebra
2.1

Let Bj be one of the original balls. If it was chosen, then [step 1.1, L1, choose, algebra] Bj5Bj. If it was not chosen, let Bis be the first chosen ball that meets it. Since the choice at stage s had maximal radius among the remaining disjoint balls, the radius of Bj is at most that of Bis. Pick zBj and choose wBjBis. Then zcis2zw2+wcj2+cjcis2<rj+rj+ris5ris, so z5Bis. Therefore every original ball lies in the union of the fivefold dilates of the chosen balls.

step 1.1L1choosealgebra
2.2

Let Bj be any original ball that was not chosen in the countable construction, and let jIm. When the algorithm inspected j, some previously chosen ball Bis already met Bj; otherwise Bj would have been retained. If isI with <m, then rj2mR21R<ris. If instead =m, then both balls lie in the same dyadic class, so rj2mR<2ris. In either case, rj<2ris. Choose zBj and wBjBis. Then zcis2<rj+rj+ris<2(2ris)+ris=5ris, so again Bj5Bis. Let IN1 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 j1BjiI5Bi.

step 1.2L1choosealgebra
3.1

Since the chosen balls are pairwise disjoint, [step 2.1, L2, algebra] λ ⁣(j=1mBj)λ ⁣(k=15Bik)k=1λ(5Bik)=5nk=1λ(Bik). This proves part 1.

step 2.1L2algebra
4.1

Steps 3.1 and 2.2 prove the finite and countable forms.

step 3.1step 2.2
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 fLloc1(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.1

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

givenchoosealgebra
1.2

Put χk:=1B(xk,rk) and χ:=1B(x,r). [algebra] If yB(x,r), then yx2r, 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 yB(x,r).

algebra
1.3

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

L2L3algebra
1.4

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

L2L3algebra
2.1

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)fdλB(x,r)fdλ.

step 1.1step 1.2step 1.3L4
3.1

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.

L1step 2.1step 1.4algebra
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 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
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 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
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open 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 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
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 fL(Rn). Then Mf(x)f(xRn). In particular, M is of strong type (,) with operator norm at most 1.

Facts & Assumptions

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

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

The L norm is the essential supremum. In particular, ff almost everywhere. (The space L(μ) of essentially bounded measurable functions)

Proof

technique · direct
1.1

Fix xRn 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 Arf(x)f.

L1L2givenalgebra
2.1

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.

step 1.1L1algebra
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open 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 fLp(μ), Tfp2(App1)1/pB11/pfp. 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,B0, an exponent 1<p<, and a function fLp(μ).

[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<, gpdμ=p0tp1μ({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)

Proof

technique · direct
1.1

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>:=f1{f>t/(2C)},ft:=f1{ft/(2C)}. Sublinearity gives TfTft>+Tft. Since ftt/(2C), the strong (,) bound with constant C yields TftCftt/2. Therefore {Tf>t}{Tft>>t/2}.

L1givenconstructalgebra
2.1

Apply the weak (1,1) bound to ft>: [L1, step 1.1, algebra] μ({Tf>t})μ({Tft>>t/2})2Atft>1=2At{f>t/(2C)}fdμ.

L1step 1.1algebra
3.1

Using [L3] with g=Tf and then step 2.1, [L2, L3, step 2.1, algebra] Tfpp=p0tp1μ({Tf>t})dt2Ap0tp2({f>t/(2C)}fdμ)dt.

L2L3step 2.1algebra
4.1

The integrand in step 3.1 is nonnegative, so Tonelli's theorem for [step 3.1, algebra] nonnegative integrals lets us swap the order: Tfpp2ApXf(x)(02Cf(x)tp2dt)dμ(x). Because p>1, 02Cf(x)tp2dt=(2Cf(x))p1p1, so Tfpp2pApp1Cp1Xfpdμ.

step 3.1algebra
5.1

Taking pth roots in step 4.1 gives [step 4.1, algebra] Tfp2(App1)1/pC11/pfp. Because η>0 was arbitrary, letting η0 yields Tfp2(App1)1/pB11/pfp. Thus T is of strong type (p,p) for every 1<p<.

step 4.1algebra
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 fLp(Rn) satisfies MfpCn,pfp. 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 fLp(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 MfMf2nMf pointwise. (The centered and uncentered maximal functions are pointwise comparable)

Proof

technique · direct
1.1

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 MfpCn,pfp.

L1L2L3givenalgebra
2.1

Step 1.1 proves the centered estimate. Then [L4] gives [step 1.1, L4, algebra] Mfp2nMfp2nCn,pfp, so the uncentered estimate follows as well.

step 1.1L4algebra
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

Riesz-Thorin interpolation theorem

Statement

Let (X,A,μ) and (Y,B,ν) be measure spaces. Let 1p0,p1<, let 1<q0,q1<, let 0<θ<1, and define 1pθ:=1θp0+θp1,1qθ:=1θq0+θq1, with the convention 1/:=0.

Suppose T is a linear operator on the finite simple functions of finite measure support on X, and suppose Tfq0M0fp0,Tfq1M1fp1 for every such f. Then T extends uniquely to a bounded linear operator T~:Lpθ(μ)Lqθ(ν) satisfying T~fqθM01θM1θfpθ(fLpθ(μ)).

Facts & Assumptions

Given: The operator T on finite simple functions of finite measure support, endpoint bounds with constants M0,M1, and a parameter 0<θ<1.

[L1]

For finite p, simple functions with finite-measure support are dense in Lp. (Simple functions with finite-measure support are dense in Lp(μ) for 1p<)

[L2]

For 1q<, the Lq norm is the supremum of pairings against unit Lq functions. (The Lp norm is the supremum of pairings against unit Lq functions)

[L3]

Each Lq with 1q is complete. (Riesz-Fischer completeness of Lp for 1p)

Proof

technique · direct
1.1

First assume that f and g are finite simple functions of finite support [L1, L2, given, choose] on X and Y, respectively, with g chosen from Lqθ(ν) and gqθ=1. Write f=j=1maj1Ej,g=k=1bk1Fk, with the sets Ej,Fk pairwise disjoint and of finite measure.

L1L2givenchoose
2.1

Define the analytic families [step 1.1, construct, algebra] fz:=j=1mαjajpθ((1z)/p0+z/p1)1Ej, gz:=k=1βkbkqθ((1z)/q0+z/q1)1Fk, where αj=aj/aj and βk=bk/bk when the coefficient is nonzero and 0 otherwise. Then fθ=f and gθ=g. For real t, direct calculation on each simple coefficient gives fitp0=fpθpθ/p0,f1+itp1=fpθpθ/p1, and likewise gitq0=gqθqθ/q0=1,g1+itq1=gqθqθ/q1=1.

step 1.1constructalgebra
3.1

Put [step 2.1, given, algebra] Φ(z):=Y(Tfz)(y)gz(y)dν(y). Because fz and gz are finite linear combinations of exponentials in z, Φ is continuous on the closed strip S={zC:0Rez1} and holomorphic on its interior. For real t, the endpoint bounds and Holder give Φ(it)M0fitp0gitq0M0fpθ, Φ(1+it)M1f1+itp1g1+itq1M1fpθ.

step 2.1givenalgebra
4.1

Fix δ>0 and define [step 3.1, construct, algebra] Ψδ(z):=Φ(z)(M0+δ)z1(M1+δ)z. By step 3.1, Ψδ is at most 1 on the two boundary lines of the strip. Multiplying once more by exp(ε(z21)) and applying the maximum-modulus principle on large rectangles inside the strip shows that Ψδ(z)1 throughout S. Evaluating at z=θ and letting first ε0 and then δ0 yields Φ(θ)M01θM1θfpθ.

step 3.1constructalgebra
5.1

Since Φ(θ)=(Tf)gdν, step 4.1 gives [L1, L2, step 4.1, algebra] (Tf)gdνM01θM1θfpθ for every unit gLqθ(ν) that is finite simple with finite support. By density [L1] and norm recovery [L2], it follows that TfqθM01θM1θfpθ for every finite simple f of finite support.

L1L2step 4.1algebra
6.1

Now let fLpθ(μ). By [L1], choose finite simple functions [L1, L3, step 5.1, algebra] fn of finite support with fnf in Lpθ(μ). Step 5.1 makes (Tfn) Cauchy in Lqθ(ν), so [L3] gives a limit hLqθ(ν) with hTfnqθ0. If (gn) is another such approximating sequence for f, then step 5.1 applied to fngn shows TfnTgnqθM01θM1θfngnpθ0, so the limit h is independent of the chosen approximation. Define T~f:=h. Passing to the limit in step 5.1 yields T~fqθM01θM1θfpθ.

L1L3step 5.1algebra
7.1

The definition in step 6.1 extends T, because a constant approximating [step 6.1, algebra] sequence may be used when f is already finite simple of finite support. Applying step 6.1 to f+g and to cf shows that T~ is linear, since linearity holds termwise on every approximating sequence. If S is any other bounded linear extension of T to Lpθ(μ), then for every fLpθ(μ) and every approximating sequence (fn) from step 6.1, SfT~fqθS(ffn)qθ+T~(fnf)qθ0, so S=T~.

step 6.1algebra
8.1

Steps 5.1, 6.1, and 7.1 prove the interpolated bounded extension theorem.

step 5.1step 6.1step 7.1
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 gCc(Rn) and let xRn. Then limr0+Arg(x)=g(x).

Facts & Assumptions

Given: The Axiom of Countable Choice, a function gCc(Rn), and a point xRn.

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

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

L1given
2.1

For 0<r<δ, every yB(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)ε.

step 1.1L2algebra
3.1

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

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

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
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open 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 fLloc1(Rn). Then the Lebesgue set of the Lloc1 class of f has full Lebesgue measure.

Equivalently, for almost every xRn, limr0+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)

[L6]

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

Proof

technique · direct
1.1

Let [L3, L5, L6, given, construct] D:={a+ib:a,bQ}. By [L3], D is countable. For each cD, the function uc:=fc is locally integrable, so [L6] gives a null set Nc such that limr0+Aruc(x)=uc(x)=f(x)c for every xNc. Put N:=cDNc. By [L5], N is null.

L3L5L6givenconstruct
2.1

Fix xN and let ε>0. By density [L4], choose [step 1.1, L4, algebra] cD with f(x)c<ε. Then for every r>0, 1λ(B(x,r))B(x,r)f(y)f(x)dλ(y)Arfc(x)+cf(x). Taking r0+ and using step 1.1 gives lim supr0+1λ(B(x,r))B(x,r)f(y)f(x)dλ(y)2ε. Since ε is arbitrary, the limit is 0.

step 1.1L4algebra
3.1

Step 2.1 holds for every xN, 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.

L1L2step 1.1step 2.1
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 ERn be Lebesgue measurable. Then

  1. Θ(E,x)=1 for almost every xE;
  2. Θ(E,x)=0 for almost every xEc.

Facts & Assumptions

Given: The Axiom of Countable Choice and a Lebesgue measurable set ERn.

[L1]

The density of E at x is Θ(E,x)=limr0+λ(EB(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.1

Because 01E1 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 xN is a Lebesgue point of 1E.

L2L3givenalgebra
2.1

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

L1step 1.1algebra
2.2

Let xEcN. Then 1E(x)=0, and for every r>0, [L1, step 1.1, algebra] 1λ(B(x,r))B(x,r)1E(y)0dλ(y)=λ(EB(x,r))λ(B(x,r)). Again the left-hand side tends to 0, so [L1] gives Θ(E,x)=0.

L1step 1.1algebra
3.1

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.

step 1.1step 2.1step 2.2
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 fLloc1(Rn), let ARn, and suppose that for each xA there is a family (Er(x))r>0 shrinking nicely to x with constant αx>0. Then for almost every xA, limr0+1λ(Er(x))Er(x)f(y)f(x)dλ(y)=0, hence limr0+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 ARn, and for each xA a family (Er(x))r>0 shrinking nicely to x.

[L1]

Shrinking nicely means that for each xA 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.1

Let xA 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).

L1L2givenalgebra
2.1

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

step 1.1
3.1

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.

step 2.1algebra
4.1

Step 3.1 holds at every Lebesgue point of f, hence for almost every xA.

L2step 3.1
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

Differentiation of sigma-finite Borel measures finite on compact sets

Statement

Assume the Axiom of 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 relative to Lebesgue measure, and choose a measurable representative f of the Radon-Nikodym class dνa/dλ. Then for Lebesgue-almost every xRn, limr0+ν(B(x,r))λ(B(x,r))=f(x). More generally, let ARn, and suppose that for each xA a family (Er(x))r>0 of Borel sets shrinking nicely to x is specified. Then for Lebesgue-almost every xA, limr0+ν(Er(x))λ(Er(x))=f(x).

Facts & Assumptions

Given: The Axiom of Countable Choice and a sigma-finite Borel measure ν on Rn that is finite on compact sets.

[L2]

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

[L3]

A finite family of balls admits a disjoint subfamily whose fivefold dilates cover the union. (Vitali covering lemma for Euclidean balls with fivefold dilates)

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

[F1]

Every Borel measure on Rn that is finite on compact sets is regular on its Borel sets: for each Borel set E, ν(E)=inf{ν(U):EU and U is open}. (Rudin, Theorem 2.18)

Proof

technique · direct
1.1

By [L1], write ν=νa+νs with νa=fdλ, νaλ, and νsλ. Choose a Borel set N with λ(N)=0 on which νs is concentrated. For every Borel set E, absolute continuity and concentration give νs(E)=νs(EN)=ν(EN)0,νa(E)=νa(EN)=ν(EN)0. Thus both components are positive and νsν. Changing f on a null set does not affect the claim, so take f0. Since every closed Euclidean ball is compact, for every x and R>0, B(x,R)fdλ=νa(B(x,R))ν(B(x,R))<. Hence fLloc1(Rn).

L1givenchoosealgebra
2.1

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)fdλ+ν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.

L1L2step 1.1givenalgebra
2.2

Put G:=RnN, so G is Borel, λ(RnG)=0, and νs(G)=0. For each m1, define Dm(x):=sup0<r<1/mνs(B(x,r))λ(B(x,r)). For fixed r>0, if 0<δ<r and xy2<δ, 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 {xRn:Dm(x)>1k} is open. For k1, put Fk:=Gm1{xRn:Dm(x)>1k}. Then Fk is Borel. If xG and L(x):=lim supr0+ν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 xFk. Thus {xG:L(x)>0}k1Fk, and it is enough to prove λ(Fk)=0 for every k.

step 1.1L5givenconstructalgebra
3.1

Fix k1 and ε>0. Because νs(G)=0 and νs is a Borel measure finite on compact sets, [F1] gives an open set UεG with νs(Uε)<ε. Let KFk be compact, and let B be the family of all balls B(x,r) such that xK,B(x,r)Uε,νs(B(x,r))>1kλ(B(x,r)). This family covers K: for any xK, openness gives an m1 with B(x,1/m)Uε, and xFk gives an r<1/m satisfying the displayed strict inequality. Compactness supplies a finite subcover of K from B. Apply [L3] to that finite family. There are pairwise disjoint chosen balls B1,,Bq among it such that Kj=1q5Bj. Hence λ(K)5nj=1qλ(Bj)<5nkj=1qνs(Bj)5nkνs(Uε)<5nkε.

F1L3step 2.2givenconstructalgebra
4.1

Since ε>0 was arbitrary, step 3.1 gives λ(K)=0 for every compact KFk. Because Fk is Borel by step 2.2, [L4] implies λ(Fk)=sup{λ(K):KFk, K compact}=0. Step 2.2 now shows that the set where L(x)>0 is contained in the null set (RnG)k1Fk. The ratios defining L are nonnegative, so limr0+νs(B(x,r))λ(B(x,r))=0 for almost every x.

step 2.2step 3.1L4algebra
5.1

Combine step 4.1 with the comparison in step 2.1 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 xA. Taking A=Rn and Er(x)=B(x,r) gives the ball conclusion.

L2step 1.1step 2.1step 4.1
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 fL1([a,b]). Define F(x):=axf(t)dt(axb). 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 fL1([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.1

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, Rg(t)dt=abf(t)dt<, so gLloc1(R). For x(a,b) and every r>0, define Er+(x):=[x,x+r),Er(x):=(xr,x]. Each family shrinks nicely to x with constant α=12, because Er±(x)B(x,r) and λ(Er±(x))=r=12λ(B(x,r)).

L1givenconstructalgebra
2.1

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 limr0+1rxx+rg(t)dt=g(x)(xA+). Applying [L2] again to the family Er(x) gives another full-measure subset A(a,b) such that limr0+1rxrxg(t)dt=g(x)(xA). Hence both one-sided limits hold for every xA+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=1hxx+hf(t)dt=1hxx+hg(t)dt, while for h<0, F(x+h)F(x)h=1hx+hxg(t)dt. Both one-sided limits therefore equal g(x)=f(x).

L2step 1.1algebra
3.1

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

step 2.1
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 fL1(Rn) satisfies f1>0, then MfL1(Rn).

Facts & Assumptions

Given: The Axiom of Countable Choice and a function fL1(Rn) with f1>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]

The L1 norm is f1=Rnfdλ. (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.1

Since f1>0, the integral in [L2] is positive. Hence there is [L2, L3, given, choose, algebra] ε>0 such that the measurable set E:={yRn:f(y)>ε} has positive measure. Because Rn=m1B(0,m) and measure is countably subadditive, some R1 satisfies 0<λ(F)<,F:=EB(0,R), the finiteness coming from [L3].

L2L3givenchoosealgebra
2.1

Let xRn with x22R. If yF, then [step 1.1, L1, L4, algebra] yx2y2+x2R+x232x2, so FB(x,32x2). Since fε on F, [L1] gives Mf(x)1λ(B(x,32x2))Ff(y)dλ(y)ελ(F)λ(B(0,1))(32x2)n=Cx2n for a positive constant C.

step 1.1L1L4algebra
3.1

For each integer k1, set [step 2.1, L4, algebra] Ak:=B(0,2k+1R)B(0,2kR). On Ak one has x22k+1R, so step 2.1 yields Mf(x)C(2k+1R)n(xAk). Therefore AkMfdλ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 k1Ak diverges.

step 2.1L4algebra
4.1

Thus MfL1(Rn) whenever f1>0, so the [step 3.1] strong type (1,1) claim is false.

step 3.1

5 · Examples, counterexamples and false statements

None yet.

Sources