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.
A_infinity weights satisfy power decay
Statement
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()). Let (The Muckenhoupt A_infinity class). Then there are , depending only on , on a witnessing exponent and on , such that for every axis-parallel cube and every measurable . Explicitly one may take and , where and are the reverse Hölder exponent and constant supplied for a witnessing weight.
Facts & Assumptions
Given: Countable Choice, , a witnessing exponent with , a reverse Hölder pair , a cube and a measurable .
means for some , and then for every cube (The Muckenhoupt A_infinity class).
The reverse Hölder theorem applied to a fixed gives and , depending only on and , with for every cube (Reverse Holder self-improvement for A_p weights).
Hölder's inequality: for a measurable set , (the exponents and are conjugate) (Holder's inequality for integrals, including the endpoint cases, Real powers for positive bases, with the zero-base positive-exponent convention).
Proof
Since , there is a witnessing exponent with by [F1]; applying [F2] produces and with the normalized reverse Hölder inequality.
For the cube and measurable , Hölder's inequality [F3] gives ; the reverse Hölder inequality bounds the first factor by , so .
Dividing by gives with and , and both constants depend only on , the witnessing exponent and (and on the auxiliary , which is fixed in the construction).
Depends on
Used by
Dependency tree · two levels
32 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)