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.
Hausdorff–Young for periodic Fourier coefficients
Statement
Assume Countable Choice and let carry its normalized Haar measure , so that . Let and let be the conjugate exponent, . Every complex class has a Fourier coefficient sequence in and with the supremum reading at , and at the Parseval equality The Fourier coefficients are those of Fourier coefficients and trigonometric polynomials on the torus. No reverse inequality for and no endpoint statement beyond is claimed.
Facts & Assumptions
Given: Countable Choice, the probability space , an exponent , and .
Countable Choice is the hypothesis carried by the Parseval and interpolation interfaces below (The Axiom of Countable Choice ()).
The Fourier coefficient is with ; the characters satisfy , each coefficient functional is complex-linear and depends only on the almost-everywhere class of (Fourier coefficients and trigonometric polynomials on the torus).
For the Fourier coefficients satisfy the Parseval identities and (The Parseval identity for Fourier series).
On sigma-finite measure spaces a complex-linear finite-simple-core operator with and satisfies, for , the interpolation bound ; at and the endpoint estimates are retained, and under countable choice the core operator has the unique compatible bounded extensions to the full spaces (Interpolate L1 to Linfinity and L2 to L2 bounds).
Under countable choice, every two extensions of the same finite-simple core operator agree as measurable almost-everywhere classes on the intersection of their domains (Compatible extensions from the finite simple core).
for integrable (The modulus of an integral is bounded by the integral of the modulus).
On a finite measure space, for with (Finite-measure includes into for ).
On every measure space, complex finite simple functions with finite-measure nonzero sets are dense in for (Complex finite-simple and smooth compact-support density for finite p).
Complex of a measure space is the set quotient of measurable classes of Complex Lp classes and Euclidean test-function conventions; the counting-measure space on is written .
Proof
Let assign to the almost-everywhere class of a complex finite simple function on with finite-measure nonzero set its coefficient sequence . This is well defined on classes and complex-linear by [F1]; its target is a space of measurable classes on with counting measure, which is sigma-finite, and its source space is the probability space .
For such a class and every , by [F1] and [F5], so : the L^1-to-L-infinity endpoint bound holds with .
A finite simple function on a probability space is bounded, hence lies in , and [F2] gives ; the L^2-to-L^2 endpoint bound holds with .
Applying [F3] to the core operator of step 1.1 with endpoints , and , yields, for every , a unique compatible bounded extension with , while at and the endpoint estimates of steps 2.1 and 2.2 hold; both measure spaces are sigma-finite.
The -extension of is the coefficient map: the coefficient map is a bounded linear map agreeing with on the finite simple classes, which are dense in by [F7], and extensions from a dense core into a Banach space are unique; the same argument identifies the -extension with the coefficient map on .
Fix . Since , [F6] gives with , so the domain intersection of the -extension and the -extension contains all of ; by [F4] the two extensions agree as measurable classes there.
By steps 4.1 and 3.2, for the sequence is the coefficient sequence , and since with , step 3.1 gives ; the case is the Parseval equality of [F2].
The case is the endpoint estimate of step 2.1 applied to classes, and Countable Choice is used only through the cited Parseval and interpolation interfaces [A1]; the finite-measure convention enters only through [F6] and the probability-space identification of the core.
Depends on
- Fourier coefficients and trigonometric polynomials on the torus
- The Parseval identity for Fourier series
- Interpolate L1 to Linfinity and L2 to L2 bounds
- Compatible extensions from the finite simple core
- The modulus of an integral is bounded by the integral of the modulus
- Finite-measure $L^r$ includes into $L^p$ for $p < r$
- Complex finite-simple and smooth compact-support density for finite p
- Complex Lp classes and Euclidean test-function conventions
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
61 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
- Richard S. Laugesen, Harmonic Analysis Lecture Notes (standard reference, not scraped)
- Loukas Grafakos, Classical Fourier Analysis, 3rd ed. (standard reference, not scraped)