Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-generated
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 endpoints are not obtained by setting p equal to one

Remark

The strong weighted estimates of this page, which are stated for 1<p<∞, are not the instance p=1 of an Ap theory, in three distinct senses.

First, the Ap condition itself degenerates at p=1: the factor w−1/(p−1) in [w]Ap is undefined, and the class A1 is defined instead by the pointwise bound M∗w≤Cw almost everywhere (Muckenhoupt A_p and A_1 weights). The correct replacement for the maximal function is a weak-type estimate, w({Mf>λ})≤5n[w]A1λ−1∫∣f∣w dλ (Weighted weak (1,1) bound for the maximal function under A_1), and the maximal characterisation of Ap is likewise a statement about the strict range 1<p<∞ (The Hardy-Littlewood maximal operator characterises A_p).

Second, the weighted Calderón–Zygmund theorem attaches the weak (1,1) bound to the endpoint w∈A1, not a strong L1(w) bound (Weighted L-p bounds for standard Calderon-Zygmund maximal truncations); its constant depends on the A1 characteristic and is not universal, exactly as in the maximal case.

Third, the obstruction is not an artefact of the weights: already for the Lebesgue weight w=1, which lies in A1, the Hardy–Littlewood maximal operator is not of strong type (1,1) (The Hardy-Littlewood maximal operator is not strong type (1,1)). Hence no strong L1(w) endpoint can be expected for all w∈A1, and the strict range 1<p<∞ in the strong weighted theorems is essential.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

51 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