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 Muckenhoupt A_infinity class
Definition
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()).
The Muckenhoupt class is the union of the finite-exponent classes: where and are the classes of Muckenhoupt A_p and A_1 weights. Thus a weight belongs to exactly when for some finite , and by the nesting property of Duality and nesting of the A_p classes the witnessing exponent may be replaced by any larger one: if then for every . The class is not defined by a single limit formula in ; its equivalence with the power-decay condition and with the reverse Hölder property is a theorem proved separately on this page.
Every weight is doubling: choose a witnessing exponent using the nesting lemma. Then then A_p weights are doubling gives for every cube and , and the corresponding ball bound with a constant depending only on the indicated data. No new choice principle is used in the definition itself.
Depends on
Used by
- Aᵢnfinity weights satisfy power decay Lemma
- Kernel tail integrals of weighted L-p functions are finite Lemma
- Power decay implies membership in some Aₚ Lemma
- Weighted good-lambda inequality for maximal truncations Lemma
- The Aᵢnfinity power-decay characterisation Theorem
- Weighted L-p bounds for standard Calderon-Zygmund maximal truncations Theorem
Dependency tree · two levels
21 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
- Loukas Grafakos, Classical Fourier Analysis, 3rd ed. (Springer GTM 249, 2014) (standard reference, not scraped)
- Juha Kinnunen, Harmonic Analysis (Aalto University lecture notes) (standard reference, not scraped)