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.
Endpoint targets: weak (1,1) here, L∞ to BMO later; strong endpoints fail in general
Statement
Assume Countable Choice (The Axiom of Countable Choice ()). For an -bounded Calderón–Zygmund operator the two endpoint-adjacent facts established on this page are the weak estimate of Calderón–Zygmund operators are of weak type (1,1) and the strong bounds for of Calderón–Zygmund operators are bounded on Lp. The following claims are deliberately not made here, and the reader should not read the page as asserting or refuting them.
First, no strong type bound and no bounded action on is claimed; the weak estimate is the endpoint substitute for the former, and the companion examples page exhibits the Hilbert transform of an interval indicator as a counterexample to compatible strong and conclusions, for the Hilbert transform and hence for the class of Calderón–Zygmund operators.
Second, the endpoint is the subject of the later BMO page of this track, where bounded mean oscillation is defined and the endpoint estimate is proved; neither the statement nor the proof of that estimate is used here, and no conclusion is available from it.
The strict-range bounds are stated with the exponent range only; the constants blow up as and as in the estimates recorded above, consistently with the two refuted endpoints.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
27 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, third edition (standard reference, not scraped)
- Terence Tao, Math 247A Lecture Notes 4 (standard reference, not scraped)