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.

Weighted average comparison and the density-to-mass estimate for A_p weights

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)).

Let 1≤p<∞ and w∈Ap (Muckenhoupt A_p and A_1 weights). For every axis-parallel cube Q and every nonnegative measurable f on Q, ⟨f⟩Q≤[w]Ap1/p(1w(Q)∫Qfpw dλ)1/p(1<p<∞), and for p=1 the same inequality holds with [w]Ap1/p replaced by cn[w]A1, where cn is the dimensional constant of The two defining forms of A_1 agree (with the cube-average normalization of the A1 characteristic the factor is exactly [w]A1). In particular every f∈Lp(w) is locally integrable. Consequently, for every measurable E⊆Q with 1<p<∞, (∣E∣∣Q∣)p≤[w]Apw(E)w(Q); equivalently, if S⊆Q is measurable and ∣S∣≤α∣Q∣ for some 0<α<1, then w(S)≤(1−(1−α)p[w]Ap)w(Q).

Facts & Assumptions

Given: Countable Choice; 1≤p<∞, w∈Ap, a cube Q, a nonnegative measurable f on Q, and a measurable E⊆Q.

[F1]

For 1<p<∞ the Ap characteristic is [w]Ap=sup⁡Q⟨w⟩Q⟨w−1/(p−1)⟩Qp−1<∞, and w−1/(p−1)∈Lloc1 with 0<w(Q)<∞ for every cube; for p=1 the equivalent cube-average/essential-infimum form gives ⟨w⟩Q≤cn[w]A1ess inf⁡Qw (Muckenhoupt A_p and A_1 weights, The two defining forms of A_1 agree).

[F2]

Hölder's inequality: for finite-valued nonnegative measurable g,h on Q with ∫Qgr<∞ and ∫Qhr′<∞, and conjugate finite exponents r,r′>1, ⟨gh⟩Q≤⟨gr⟩Q1/r⟨hr′⟩Q1/r′ (Holder's inequality for integrals, including the endpoint cases).

[F3]

f∈Lp(w) means ∫∣f∣pw dλ<∞, with ∣f∣ measurable when f is; the integral over a set is additive and monotone (Weights, their associated measures, and the spaces L^p(w), The function space Lp(μ) for 0<p<∞).

Proof

technique · direct
1.1F1F2givenalgebra

Let 1<p<∞ and use the positive finite representative of w. If ∫Qfpw=+∞, the claimed inequality is immediate in the extended order because its right-hand side is +∞. Otherwise f is finite a.e.; replace its infinite values on a null set by zero if needed. The functions fw1/p and w−1/p have finite p- and p′-integrals respectively, the latter by [F1]. Hölder's inequality with exponents p and p′ applied to ∣f∣w1/p and w−1/p=w−1/(p−1)⋅(p−1)/p gives ⟨f⟩Q≤⟨fpw⟩Q1/p⟨w−1/(p−1)⟩Q(p−1)/p. Since ⟨w⟩Q⟨w−1/(p−1)⟩Qp−1≤[w]Ap, one has ⟨w−1/(p−1)⟩Q(p−1)/p≤[w]Ap1/p⟨w⟩Q−1/p=[w]Ap1/p(∣Q∣/w(Q))1/p. Substituting and using ⟨fpw⟩Q=∣Q∣−1∫Qfpw yields ⟨f⟩Q≤[w]Ap1/p(w(Q)−1∫Qfpw)1/p.

1.2F1givenalgebra

Let p=1. Since 0<w(Q)<∞ and [F1] imply ess inf⁡Qw>0, and w≥ess inf⁡Qw a.e. on Q, one has ∫Qf=∫Q(fw)/w≤(ess inf⁡Qw)−1∫Qfw, and [F1] gives (ess inf⁡Qw)−1≤cn[w]A1⟨w⟩Q−1=cn[w]A1∣Q∣/w(Q); dividing by ∣Q∣ gives ⟨f⟩Q≤cn[w]A1w(Q)−1∫Qfw.

2.1F1step 1.1givenalgebra

Density-to-mass. Apply step 1.1 with f=1E (for 1<p<∞): ⟨1E⟩Q=∣E∣/∣Q∣ and ∫Q1Ew=w(E), so (∣E∣/∣Q∣)p≤[w]Apw(E)/w(Q), which is the first display. Applying it to E=Q∖S when ∣S∣≤α∣Q∣ gives ∣Q∖S∣≥(1−α)∣Q∣, hence (1−α)p≤[w]Apw(Q∖S)/w(Q) and therefore w(S)=w(Q)−w(Q∖S)≤(1−(1−α)p/[w]Ap)w(Q), the equivalent form.

3.1F1F3step 1.1step 1.2givenalgebra∎

Local integrability. If f∈Lp(w) and Q is a cube, then steps 1.1 and 1.2 applied to ∣f∣ give ⟨∣f∣⟩Q≤[w]Ap1/p(w(Q)−1∫Q∣f∣pw)1/p≤[w]Ap1/pw(Q)−1/p∥f∥Lp(w)<∞ for 1<p<∞, and the p=1 analogue holds with cn[w]A1; hence f is integrable over every cube, i.e. locally integrable. This uses that 0<w(Q)<∞ for every cube from [F1].

Depends on

Used by

Dependency tree · two levels

41 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