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.

Reverse Holder from a distribution estimate for a doubling weight

Statement

Assume the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain). Let v be a weight on Rn whose measure v dλ is doubling (The weighted maximal function of a doubling weight), and let h≥0 be measurable with hv∈Lloc1(λ). Suppose there are 0<α,β<1 such that for every cube Q and every measurable S⊆Q, v(S)≤αv(Q)⟹∫Shv dλ≤β∫Qhv dλ. Then there are q>1 and c<∞, depending only on n, the doubling constant of v, α and β, such that (1v(Q)∫Qhqv dλ)1/q≤cv(Q)∫Qhv dλ for every cube Q.

Facts & Assumptions

Given: Dependent Choice, a weight v with μ:=v dλ doubling, a nonnegative measurable h with h∈Lloc1(μ), constants 0<α,β<1, a cube Q0, and the levels αk:=(Cnα−1)kα0 with α0:=μ(Q0)−1∫Q0h dμ>0.

[F1]

μ is a locally finite measure with 0<μ(Q)<∞ for every cube; cubes and balls of comparable size have comparable μ-measure, with a constant depending only on n and the doubling constant of v (The weighted maximal function of a doubling weight, Weights, their associated measures, and the spaces L^p(w)).

[F2]

Inside Q0 the dyadic subcubes form a family with a top element Q0 in which every proper descendant has a parent inside Q0 and two cubes are nested or disjoint (Maximal dyadic subcubes of a cube at a height).

[F3]

Differentiation for the doubling weight v: for μ-almost every point, the μ-averages of an Lloc1(μ) function over the dyadic subcubes shrinking nicely to the point converge to the value of the function (Differentiation of L-one functions for a doubling weight).

Proof

technique · direct
1.1F1F2givenalgebra

Since αk≥α0 for every k≥0 and the top cube Q0 has μ-average α0, the cube Q0 is not bad at any level k. For every bad subcube R the ancestors of R inside Q0 form a finite chain ending at Q0; hence there is a topmost bad ancestor, and the family of maximal bad subcubes (those with no bad proper ancestor inside Q0) is well defined, pairwise disjoint and at most countable. Let Uk be their union.

2.1F1F2F3step 1.1givenalgebra

Let R be a maximal bad subcube at level k with parent P: then ⟨h⟩Pμ≤αk by maximality, and μ(P)≤Cnμ(R) by [F1] since P is a cube of twice the side length containing R; hence ∫Rh dμ≤∫Ph dμ≤Cnαkμ(R), that is, ⟨h⟩Rμ≤Cnαk. Moreover Uk+1⊆Uk by the same parent argument, and h≤αk μ-almost everywhere on Q0∖Uk: for a point x outside Uk and outside the μ-null exceptional set of the differentiation lemma, no dyadic subcube R∋x has ⟨h⟩Rμ>αk, since such an R would lie in a maximal bad cube containing x; the subcubes containing x shrink nicely to x, so their μ-averages converge to h(x) by that lemma, and the limit satisfies h(x)≤αk.

3.1F1F4step 1.1step 2.1givenalgebra

Decay of the integrals. For a maximal bad subcube R at level k, the set S:=R∩Uk+1 is measurable and contained in R; since Uk+1 is the disjoint union of its maximal bad subcubes, on each of which the μ-average of h exceeds αk+1, αk+1μ(S)≤∫Sh dμ≤∫Rh dμ≤Cnαkμ(R), so μ(S)≤αμ(R) because Cnαk=ααk+1. The hypothesis applied to S⊆R therefore gives ∫Sh dμ≤β∫Rh dμ; summing over the pairwise disjoint maximal cubes at level k yields ∫Uk+1h dμ≤β∫Ukh dμ, hence ∫Ukh dμ≤βk∫Q0h dμ by iteration.

4.1F4step 2.1step 3.1givenalgebra

Integral bound. If ∫Q0h dμ=0, then h=0 μ-a.e. on Q0 and the conclusion is immediate. Otherwise α0>0 as above. Summing the bounds μ(R∩Uk+1)≤αμ(R) from step 3.1 shows μ(Uk+1)≤αμ(Uk); hence μ(⋂kUk)=0. The sets Q0∖U0 and Uk∖Uk+1 are disjoint measurable pieces covering Q0 up to a μ-null set; by step 2.1, h≤α0 on Q0∖U0 and h≤αk+1 on Uk∖Uk+1, all μ-a.e. Hence, for every γ>0, ∫Q0h1+γdμ≤α0γ∫Q0∖U0h dμ+∑k≥0αk+1γ∫Ukh dμ≤α0γ(∫Q0h dμ)[1+(Cnα−1)γ∑k≥0((Cnα−1)γβ)k]. Choose γ>0 so small that r:=(Cnα−1)γβ<1; then the geometric series converges.

5.1step 3.1step 4.1givenalgebra∎

Dividing the display of step 4.1 by μ(Q0) and using α0=μ(Q0)−1∫Q0h dμ gives (μ(Q0)−1∫Q0h1+γdμ)1/(1+γ)≤c μ(Q0)−1∫Q0h dμ with c=(1+(Cnα−1)γ/(1−r))1/(1+γ)<∞; since Q0 was arbitrary, the reverse Hölder inequality holds with q=1+γ>1 and this c, both depending only on n, the doubling constant of v, α and β.

Depends on

Used by

Dependency tree · two levels

80 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