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 ()). Let be a weight on whose measure is doubling with constant , and let be the weighted maximal function of The weighted maximal function of a doubling weight. Then there is such that for every and every , Consequently is of strong type with respect to for every (Sublinear operators and weak or strong type bounds), with norm depending only on , and the doubling constant .
Facts & Assumptions
Given: Countable Choice, a weight with doubling of constant , the weighted maximal function , and .
; for each fixed the function is continuous, and 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).
Doubling: , so iterating gives for every ball , since .
Fivefold Vitali covering: a finite family of balls has a pairwise disjoint subfamily with (Vitali covering lemma for Euclidean balls with fivefold dilates).
Inner regularity: for the regular Borel measure and a Borel set , (Sigma-compact open sets make locally finite Borel measures regular).
Marcinkiewicz interpolation: a sublinear operator that is weak with constant and strong with constant is strong for every with norm at most (Marcinkiewicz interpolation from weak and strong , Sublinear operators and weak or strong type bounds).
Proof
The level set is open, being the union over of the open sets , which are open because the displayed functions are continuous by [F1]. By [F4] its -measure is the supremum of over compact .
Let be compact. Each admits with ; finitely many of these open balls cover , and [F3] selects pairwise disjoint balls among them with and for every .
By [F2] and the selection of step 1.2, , where the last inequality uses the pairwise disjointness of the .
Taking the supremum over compact in step 2.1 and using the inner regularity of step 1.1 gives , which is the asserted weak bound with .
is sublinear and homogeneous; besides the weak bound of step 3.1 with constant , it satisfies the trivial strong bound with constant with respect to the measure . Hence [F5] applies and gives, for every , for all , a constant depending only on , and .
Depends on
- The weighted maximal function of a doubling weight
- Vitali covering lemma for Euclidean balls with fivefold dilates
- Marcinkiewicz interpolation from weak $(1,1)$ and strong $(\infty,\infty)$
- Sublinear operators and weak or strong type $(p,q)$ bounds
- Sigma-compact open sets make locally finite Borel measures regular
- Ball averages vary continuously with the centre and radius
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Weights, their associated measures, and the spaces L^p(w)
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
- Loukas Grafakos, Classical Fourier Analysis, 3rd ed. (Springer GTM 249, 2014) (standard reference, not scraped)
- Juha Kinnunen, Harmonic Analysis (Aalto University lecture notes) (standard reference, not scraped)