Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The weighted maximal function of a doubling weight is weak (1,1)

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let v be a weight on Rn whose measure v dλ is doubling with constant cv, and let Mv be the weighted maximal function of The weighted maximal function of a doubling weight. Then there is C(n,cv)<∞ such that for every f∈L1(v) and every λ>0, v({Mvf>λ})≤C(n,cv) λ−1∫Rn∣f∣ v dλ. Consequently Mv is of strong type (q,q) with respect to v dλ for every 1<q<∞ (Sublinear operators and weak or strong type (p,q) bounds), with norm depending only on n, q and the doubling constant cv.

Facts & Assumptions

Given: Countable Choice, a weight v with v dλ doubling of constant cv, the weighted maximal function Mv, f∈L1(v) and λ>0.

[F1]

Mvf(x)=sup⁡r>0v(B(x,r))−1∫B(x,r)∣f∣v dλ; for each fixed r the function x↦v(B(x,r))−1∫B(x,r)∣f∣v dλ is continuous, and v dλ is a locally finite regular Borel measure whose level sets are Borel (The weighted maximal function of a doubling weight, Weights, their associated measures, and the spaces L^p(w), Sigma-compact open sets make locally finite Borel measures regular).

[F2]

Doubling: v(B(x,2r))≤cvv(B(x,r)), so iterating gives v(5B)≤cv3v(B) for every ball B, since 5r≤8r.

[F3]

Fivefold Vitali covering: a finite family of balls B1,…,Bm has a pairwise disjoint subfamily Bi1,…,Biℓ with ⋃jBj⊆⋃k5Bik (Vitali covering lemma for Euclidean balls with fivefold dilates).

[F4]

Inner regularity: for the regular Borel measure v dλ and a Borel set E, v(E)=sup⁡{v(K):K⊆E compact} (Sigma-compact open sets make locally finite Borel measures regular).

[F5]

Marcinkiewicz interpolation: a sublinear operator that is weak (1,1) with constant A and strong (∞,∞) with constant B is strong (p,p) for every 1<p<∞ with norm at most 2(Ap/(p−1))1/pB1−1/p (Marcinkiewicz interpolation from weak (1,1) and strong (∞,∞), Sublinear operators and weak or strong type (p,q) bounds).

Proof

technique · direct
1.1F1F4given

The level set Eλ:={Mvf>λ} is open, being the union over r>0 of the open sets {x:v(B(x,r))−1∫B(x,r)∣f∣v dλ>λ}, which are open because the displayed functions are continuous by [F1]. By [F4] its v-measure is the supremum of v(K) over compact K⊆Eλ.

1.2F1F3givenchoose

Let K⊆Eλ be compact. Each x∈K admits rx>0 with ∫B(x,rx)∣f∣v dλ>λv(B(x,rx)); finitely many of these open balls cover K, and [F3] selects pairwise disjoint balls B1,…,Bℓ among them with K⊆⋃j5Bj and ∫Bj∣f∣v>λv(Bj) for every j.

2.1F2step 1.2givenalgebra

By [F2] and the selection of step 1.2, v(K)≤∑jv(5Bj)≤cv3∑jv(Bj)≤cv3λ−1∑j∫Bj∣f∣v dλ≤cv3λ−1∫Rn∣f∣v dλ, where the last inequality uses the pairwise disjointness of the Bj.

3.1step 1.1step 2.1givenalgebra

Taking the supremum over compact K⊆Eλ in step 2.1 and using the inner regularity of step 1.1 gives v({Mvf>λ})≤cv3λ−1∫∣f∣v dλ, which is the asserted weak (1,1) bound with C(n,cv)=cv3.

4.1F5step 3.1givenalgebra∎

Mv is sublinear and homogeneous; besides the weak (1,1) bound of step 3.1 with constant A=cv3, it satisfies the trivial strong (∞,∞) bound with constant B=1 with respect to the measure v dλ. Hence [F5] applies and gives, for every 1<q<∞, ∥Mvf∥Lq(v)≤2(Aq/(q−1))1/q∥f∥Lq(v) for all f∈Lq(v), a constant depending only on n, q and cv.

Depends on

Used by

Dependency tree · two levels

44 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