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 Hardy-Littlewood maximal operator characterises A_p
Statement
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()). Let and let be a weight (Weights, their associated measures, and the spaces L^p(w)). Then the centred maximal operator is bounded on if and only if (Muckenhoupt A_p and A_1 weights); equivalently the uncentred and the cube maximal operators are bounded on exactly for . If then and conversely if is of strong type with respect to then .
Facts & Assumptions
Given: Countable Choice, , a weight , and the exponent ; for the sufficiency direction also and the dual weight .
weights are doubling, with , and for every cube (Duality and nesting of the A_p classes, A_p weights are doubling, Muckenhoupt A_p and A_1 weights).
Marcinkiewicz interpolation gives for whenever is sublinear, weak with constant one and bounded on with constant one; here (Marcinkiewicz interpolation from weak and strong ).
Dyadic cubes partition each generation and are nested or disjoint; all face conventions have the same volume and null boundaries (All-generation dyadic cubes: partition, volume and nesting, A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included). The shifted grids used below have the same properties by the explicit boundary calculation in Proof 1.1.
Chebyshev's inequality and monotone convergence (Chebyshev-Markov inequality for the integral, Monotone convergence for the integral); the ball and cube maximal operators are pointwise comparable by a dimensional constant, as are their centred and uncentred versions (Ball and cube maximal functions are pointwise comparable).
Proof
Finite dyadic covering. For use the grid of half-open cubes , , . The boundary offset of a parent, in child units, differs from the child offset by , so the grids are nested and partition each generation. Given an open cube of side , choose a scale with . In each coordinate the boundary sets of the three offsets are separated by , so an interval of length meets boundaries from at most one offset. Choose an offset avoiding its closure, coordinate by coordinate; then is contained in one of side , with . Consequently , where .
Uniform weighted dyadic bounds. For any locally finite measure with a weight, set . Restrict first to generations . The maximal bad cubes at height exist because ancestor chains are finite; they are countable and disjoint, and cover the restricted superlevel set, so its -measure is at most . Letting gives weak with constant one. The operator is sublinear and bounded on with constant one, so [F2] gives , independently of and its doubling constant. Measurability follows from the countable grid.
Sufficiency, pointwise estimate. Suppose , let , and fix one grid. Set , and , with powers assigned arbitrarily on the common null set where or is not positive finite. For every grid cube and almost every , . Thus . Raise to and integrate with respect to Lebesgue measure over to get . The bound holds also for half-open cubes because their boundaries are null. Taking suprema at yields .
Sufficiency, norm estimate. We have and . Step 1.2 therefore ensures and , and step 1.3 gives . By step 1.1, the maximum over the grids has norm at most times this bound. The ball/cube comparisons [F4] give the displayed estimate for all the stated maximal functions, with a constant depending only on .
Necessity. Suppose for locally integrable inputs in . By [F4], has bound . For a cube put , setting it to zero on the null set of exceptional weight values. It is bounded, compactly supported, and belongs to . On , . Since , the norm bound implies , hence . Let and use monotone convergence [F4] to obtain for every cube. Thus , completing both directions.
Depends on
- Muckenhoupt A_p and A_1 weights
- Duality and nesting of the A_p classes
- Weighted average comparison and the density-to-mass estimate for A_p weights
- A_p weights are doubling
- The weighted maximal function of a doubling weight
- The weighted maximal function of a doubling weight is weak (1,1)
- Marcinkiewicz interpolation from weak $(1,1)$ and strong $(\infty,\infty)$
- Chebyshev-Markov inequality for the integral
- Monotone convergence for the integral
- Holder's inequality for integrals, including the endpoint cases
- Sublinear operators and weak or strong type $(p,q)$ bounds
- Ball and cube maximal functions are pointwise comparable
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Weights, their associated measures, and the spaces L^p(w)
- Axis-parallel cubes, their averages, and cube maximal functions
- All-generation dyadic cubes: partition, volume and nesting
- A box in $\mathbb{R}^n$ with parameters $a_i\le b_i$ is Lebesgue measurable of measure $\prod_{i<n}(b_i-a_i)$, whichever of its faces are included
Used by
Dependency tree · two levels
88 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)