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.
Carleson hunt does not include the lone endpoint
Statement
Assume AC as in the Kolmogorov construction. Its witness excludes a bound for the Fourier partial-sum maximal operator on all of . The proposed Carleson–Hunt theorem concerns only ; this endpoint observation does not establish any of those positive bounds.
Facts & Assumptions
Given: Normalized Haar measure on the circle and the Kolmogorov witness f.
The locally authored conclusion of Kolmogorov lone fourier series diverges almost everywhere gives with unbounded symmetric partial sums almost everywhere. The unavailable original backing was separately resolved by the owner using the complete local proof; no original-source retrieval is claimed.
The Axiom of Choice is inherited from the countable construction of that witness.
Proof
Put . Each finite partial sum is measurable, hence this countable supremum is measurable. By F1 it equals infinity outside a null set on a space of measure one. For every positive integer k, the nonnegative simple function k on that conull set is bounded above by Mf, so the definition of the nonnegative integral gives . Consequently .
Since by F1, step 1.1 contradicts every proposed finite-constant inequality for all . It also contradicts every finite weak-(1,1) constant: for all t, whereas for sufficiently large t. Thus neither assertion follows by adjoining the endpoint to the proposed positive-p range.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 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
- Lacey, Carleson’s Theorem: Proof, Complements, Variations (standard reference, not scraped)