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.

The two defining forms of A_1 agree

Statement

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

Let w be a weight on Rn (Weights, their associated measures, and the spaces L^p(w)). Then the following are equivalent:

  1. Mw≤Cw almost everywhere for some constant C<∞, where M is the centred ball maximal function (The centered and uncentered Hardy-Littlewood maximal functions);
  2. sup⁡Q⟨w⟩Q(ess inf⁡Qw)−1=:C′<∞, the supremum over axis-parallel cubes, where the essential infimum is defined in Muckenhoupt A_p and A_1 weights.

Moreover the least constants satisfy C′≤CnC and C≤CnC′ for a dimensional constant Cn, and the same equivalence holds with the uncentred maximal function M∗ in place of M. In particular the cube-average/ essential-infimum condition may be used as an equivalent definition of A1 with a characteristic changed only by a dimensional factor; a positive average divided by a zero essential infimum is interpreted as +∞; the class A1 itself is the one of Muckenhoupt A_p and A_1 weights.

Facts & Assumptions

Given: Countable Choice; A weight w, the centred and uncentred ball maximal functions M and M∗, and the cube averages ⟨w⟩Q.

[F1]

w>0 and w<∞ Lebesgue-a.e., and for every cube Q one has 0<w(Q)<∞ (Weights, their associated measures, and the spaces L^p(w)).

[F2]

For every ball B=B(x,r) there is an axis-parallel cube Q⊇B with ∣Q∣≤Cn∣B∣, and for every cube Q there is a ball B⊇Q with ∣B∣≤Cn∣Q∣; consequently, if E⊆F and ∣F∣≤Cn∣E∣, then ⟨w⟩E≤Cn⟨w⟩F by nonnegativity (Ball and cube maximal functions are pointwise comparable).

[F3]

For a nonnegative function g the set where g does not satisfy a pointwise inequality of the form g≤c a.e. is contained in a null set, and countable unions of null sets are null (Measure-null sets and almost-everywhere statements relative to a measure).

[F4]

Qn is countable and dense in Rn, so cubes with rational centre and rational side length approximate any given cube from outside with volume comparable by a fixed factor (Qn is a countable dense subset of Rn, and rational open boxes form a countable basis).

Proof

technique · direct
1.1F1F2givenalgebra

Assume (1), with constant C. For each cube Q of side ℓ and each x∈Q, the centred ball B(x,nℓ) contains Q and has volume at most a dimensional multiple of ∣Q∣. Thus ⟨w⟩Q≤CnMw(x)≤CnCw(x) for almost every x∈Q. Taking the essential infimum and then the supremum in Q gives C′≤CnC. If the hypothesis instead uses M∗, the same estimate holds since M≤M∗.

1.2F1F2F3F4givenchoose

Assume (2). For each rational-centred, rational-sided cube Q, the set N(Q)={x∈Q:⟨w⟩Q>C′w(x)} is null. Their union N is null by [F3, F4]. For x∉N and any ball B∋x, choose a rational cube Q⊇B with ∣Q∣≤Cn∣B∣. Then ⟨w⟩B≤Cn⟨w⟩Q≤CnC′w(x). Taking the supremum over these balls gives M∗w(x)≤CnC′w(x), hence also Mw(x)≤CnC′w(x).

2.1step 1.1step 1.2algebra∎

Steps 1.1 and 1.2 prove the equivalence together with the comparable bounds C′≤CnC and C≤CnC′ for one and the same dimensional constant Cn (renaming constants if necessary), and each direction was proved both for M and for M∗, so the centred and uncentred forms of condition (1) are equivalent to (2). Therefore the cube-average/essential-infimum condition defines the same class as Mw≤Cw a.e., with characteristic changed only by dimensional factors.

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