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.

Distribution decay from maximal cubes for A_p weights

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let 1≤p<∞, let w∈Ap (Muckenhoupt A_p and A_1 weights), let Q0 be an axis-parallel cube with α0:=⟨w⟩Q0>0, and fix 0<α<1. Put αk:=(2nα−1)kα0 and let Uk be the union of the maximal dyadic subcubes R⊆Q0 (in the sense of Maximal dyadic subcubes of a cube at a height) with ⟨w⟩R>αk, with Uk=∅ when there is none. Then Uk+1⊆Uk, ∣Uk+1∣≤α∣Uk∣ and ∣Uk∣≤αk∣Q0∣, and with β:=1−(1−α)pKp one has w(Uk+1)≤βw(Uk) and w(Uk)≤βkw(Q0); moreover w≤αk almost everywhere on Q0∖Uk.

Here Kp=[w]Ap for p>1, and K1=sup⁡Q⟨w⟩Q/(ess inf⁡Qw); by The two defining forms of A_1 agree, 1≤K1≤cn[w]A1. Thus the constants remain controlled by the stated Ap data, including the ball-normalized endpoint characteristic.

Facts & Assumptions

Given: Countable Choice, 1≤p<∞, w∈Ap, the cube Q0 with α0=⟨w⟩Q0>0, 0<α<1, the levels αk and the sets Uk.

[F1]

For every k≥0 one has αk≥α0 because 2nα−1>1, so the subcube lemma applies at the height αk: the maximal dyadic subcubes R⊆Q0 with ⟨w⟩R>αk are pairwise disjoint, at most countable, their union equals {Md,Q0w>αk} up to a null set, and each of them satisfies ⟨w⟩R≤2nαk (Maximal dyadic subcubes of a cube at a height).

[F2]

Since w>0 a.e. and w(Q0)>0, all the sets Uk and their intersections with the maximal cubes are measurable, and w is finite on Q0 (Muckenhoupt A_p and A_1 weights).

[F3]

Density-to-mass: for 1≤p<∞, w∈Ap, a cube Q and a measurable S⊆Q with ∣S∣≤α∣Q∣ one has w(S)≤βw(Q) with β=1−(1−α)p/Kp for p>1; for p=1 use w≥⟨w⟩Q/K1 a.e. to get w(Q∖S)≥(1−α)w(Q)/K1. (Weighted average comparison and the density-to-mass estimate for A_p weights, The two defining forms of A_1 agree).

[F4]

For a locally integrable function and almost every point, the averages over a family of sets shrinking nicely to the point converge to the value of the function (Lebesgue differentiation theorem on Rn, Differentiation holds along families shrinking nicely); the dyadic subcubes of Q0 containing a point of Q0 contain cubes of arbitrarily small side length, and such a cube R satisfies R⊆B(x,n ℓ(R)), so the family shrinks nicely.

Proof

technique · direct
1.1F1F2givenalgebra

Since αk+1>αk, every dyadic subcube counted in step [F1] at level αk+1 has average exceeding αk as well, so it is contained in a maximal subcube at level αk; hence Uk+1⊆Uk. For a maximal level-αk cube R, the set S:=R∩Uk+1 is contained in R and measurable, and αk+1∣S∣≤∫Sw dλ≤∫Rw dλ≤2nαk∣R∣ by [F1]; since αk+1=2nα−1αk, this gives ∣S∣≤α∣R∣. Summing over the pairwise disjoint maximal level-αk cubes gives ∣Uk+1∣≤α∣Uk∣, and iterating with U0⊆Q0 gives ∣Uk∣≤αk∣Q0∣.

2.1F2F3step 1.1givenalgebra

With the same set S=R∩Uk+1 of step 1.1 we have ∣S∣≤α∣R∣, so the density-to-mass estimate [F3] applies: w(S)≤βw(R) with β=1−(1−α)p/Kp. Summing over the pairwise disjoint maximal level-αk cubes, whose union is Uk, gives w(Uk+1)≤βw(Uk); iterating with U0⊆Q0 gives w(Uk)≤βkw(Q0).

2.2F1F4step 1.1givenalgebra

Almost everywhere bound. Fix x∈Q0∖Uk outside the null sets of [F4] and outside the null set on which the union of the maximal subcubes differs from {Md,Q0w>αk}. Then no dyadic subcube R⊆Q0 containing x has ⟨w⟩R>αk, for such an R would lie in a maximal subcube counted at level αk and hence in Uk. The dyadic subcubes of Q0 containing x shrink nicely to x by [F4], so their averages of w converge to w(x); since every such average is at most αk, the limit satisfies w(x)≤αk. Thus w≤αk almost everywhere on Q0∖Uk.

3.1step 1.1step 2.1step 2.2∎

Steps 1.1, 2.1 and 2.2 are exactly the assertions of the Statement, namely nesting and the two chains of measure bounds together with the almost everywhere bound.

Depends on

Used by

Dependency tree · two levels

40 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