Alphabeta Math
TheoremStatement: 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 Hardy-Littlewood maximal operator characterises A_p

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let 1<p<∞ and let w be a weight (Weights, their associated measures, and the spaces L^p(w)). Then the centred maximal operator M is bounded on Lp(w) if and only if w∈Ap (Muckenhoupt A_p and A_1 weights); equivalently the uncentred and the cube maximal operators are bounded on Lp(w) exactly for w∈Ap. If w∈Ap then ∥Mf∥Lp(w)≤Cn,p[w]Ap1/(p−1)∥f∥Lp(w)(f∈Lp(w)), and conversely if M is of strong type (p,p) with respect to w dλ then w∈Ap.

Facts & Assumptions

Given: Countable Choice, 1<p<∞, a weight w, and the exponent p′=p/(p−1); for the sufficiency direction also w∈Ap and the dual weight σ:=w−1/(p−1).

[F1]

Ap weights are doubling, σ∈Ap′ with [σ]Ap′=[w]Ap1/(p−1), and for every cube Q ⟨w⟩Q⟨σ⟩Qp−1≤[w]Ap (Duality and nesting of the A_p classes, A_p weights are doubling, Muckenhoupt A_p and A_1 weights).

[F2]

Marcinkiewicz interpolation gives ∥Su∥Lq(μ)≤aq∥u∥Lq(μ) for q>1 whenever S is sublinear, weak (1,1) with constant one and bounded on L∞ with constant one; here aq=2(q/(q−1))1/q (Marcinkiewicz interpolation from weak (1,1) and strong (∞,∞)).

[F3]

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 Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included). The shifted grids used below have the same properties by the explicit boundary calculation in Proof 1.1.

[F4]

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

technique · direct
1.1F3givenconstructalgebra

Finite dyadic covering. For a∈{0,1/3,2/3}n use the grid Da of half-open cubes 2−k(m+(−1)ka+(0,1]n), k∈Z, m∈Zn. The boundary offset of a parent, in child units, differs from the child offset by −3(−1)ka∈Zn, so the grids are nested and partition each generation. Given an open cube Q of side ℓ, choose a scale L=2−k with 3ℓ<L≤6ℓ. In each coordinate the boundary sets of the three offsets are separated by L/3, so an interval of length ℓ meets boundaries from at most one offset. Choose an offset avoiding its closure, coordinate by coordinate; then Q is contained in one R∈Da of side L, with ∣R∣≤6n∣Q∣. Consequently Mc∗f≤6nmax⁡aMDaf, where MDf=sup⁡R∈D, x∈R∣R∣−1∫R∣f∣.

1.2F2F3givenalgebra

Uniform weighted dyadic bounds. For any locally finite measure μ=v dλ with v a weight, set MDμu(x)=sup⁡R∈D, x∈Rμ(R)−1∫R∣u∣ dμ. Restrict first to generations −N≤k≤N. The maximal bad cubes at height t>0 exist because ancestor chains are finite; they are countable and disjoint, and cover the restricted superlevel set, so its μ-measure is at most t−1∫∣u∣ dμ. Letting N→∞ gives weak (1,1) with constant one. The operator is sublinear and bounded on L∞(μ) with constant one, so [F2] gives ∥MDμu∥Lq(μ)≤aq∥u∥Lq(μ), independently of v and its doubling constant. Measurability follows from the countable grid.

1.3F1F3givenalgebra

Sufficiency, pointwise estimate. Suppose w∈Ap, let σ=w−1/(p−1), and fix one grid. Set u=∣f∣σ−1, F=MDσu and h=Fp−1w−1, with powers assigned arbitrarily on the common null set where w or σ is not positive finite. For every grid cube R and almost every y∈R, F(y)≥σ(R)−1∫R∣f∣. Thus ⟨∣f∣⟩R≤(σ(R)/∣R∣)F(y). Raise to p−1 and integrate with respect to Lebesgue measure over R to get (⟨∣f∣⟩R)p−1≤(σ(R)/∣R∣)p−1∣R∣−1∫RFp−1≤[w]Apw(R)−1∫Rh w. The Ap bound holds also for half-open cubes because their boundaries are null. Taking suprema at x yields MDf(x)≤[w]Ap1/(p−1)(MDwh(x))1/(p−1).

2.1F4step 1.1step 1.2step 1.3givenalgebra

Sufficiency, norm estimate. We have ∥u∥Lp(σ)=∥f∥Lp(w) and hp′w=Fpσ. Step 1.2 therefore ensures F∈Lp(σ) and h∈Lp′(w), and step 1.3 gives ∥MDf∥Lp(w)≤[w]Ap1/(p−1)ap′1/(p−1)∥h∥Lp′(w)1/(p−1)≤[w]Ap1/(p−1)ap′1/(p−1)ap∥f∥Lp(w). By step 1.1, the maximum over the 3n grids has norm at most 3n/p times this bound. The ball/cube comparisons [F4] give the displayed estimate for all the stated maximal functions, with a constant depending only on n,p.

3.1F4step 2.1givenalgebra∎

Necessity. Suppose ∥Mf∥Lp(w)≤C∥f∥Lp(w) for locally integrable inputs in Lp(w). By [F4], Mc∗ has bound C0=CnC. For a cube Q put fε=1Q(w+ε)−1/(p−1), setting it to zero on the null set of exceptional weight values. It is bounded, compactly supported, and belongs to Lp(w). On Q, Mc∗fε≥⟨fε⟩Q. Since fεpw≤fε, the norm bound implies w(Q)⟨fε⟩Qp≤C0p∫Qfε, hence ⟨w⟩Q⟨fε⟩Qp−1≤C0p. Let ε=1/j↓0 and use monotone convergence [F4] to obtain ⟨w⟩Q⟨w−1/(p−1)⟩Qp−1≤C0p for every cube. Thus w∈Ap, completing both directions.

Depends on

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