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.

The L1 endpoint is excluded

Endpoint interpretation

Assume the Axiom of Choice (The Axiom of Choice). The local theorem Kolmogorov lone fourier series diverges almost everywhere supplies an integrable function with unbounded symmetric Fourier partial sums almost everywhere. Thus a convergence theorem for every L1(T) function would be false.

In particular there is no finite A≥0 such that m{Cg>λ}≤A∥g∥1/λ for all g∈L1 and λ>0. Such a weak (1,1) estimate would imply almost-everywhere convergence for every such g by A weak maximal bound implies almost-everywhere Fourier convergence at p=1. Applying that conclusion to the supplied witness contradicts its almost-everywhere unboundedness, because a convergent complex sequence is bounded and the union of the two exceptional null sets remains null.

A strong (1,1) estimate ∥Cg∥1≤B∥g∥1 with finite B would imply the forbidden weak estimate by Chebyshev-Markov inequality for the integral applied to Cg, so no such strong estimate exists either. All operators here use symmetric partial sums on the normalized period-one torus. AC supplies the witness and implies the countable choice needed by the maximal convergence principle. Failure at one prescribed point for a continuous function is a different assertion from this failure on a full-measure set for an integrable function.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

14 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