Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-30
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 T=R/Z carry its normalized Haar measure mT, so that mT(T)=1. Let 1≤p≤2 and let p′ be the conjugate exponent, 1/p+1/p′=1. Every complex class f∈Lp(T;C) has a Fourier coefficient sequence (f^(k))k∈Z in ℓp′(Z;C) and (∑k∈Z∣f^(k)∣p′)1/p′≤∥f∥Lp(T),1≤p<2, with the supremum reading at p=1, sup⁡k∈Z∣f^(k)∣≤∥f∥L1(T), and at p=2 the Parseval equality (∑k∈Z∣f^(k)∣2)1/2=∥f∥L2(T). The Fourier coefficients are those of Fourier coefficients and trigonometric polynomials on the torus. No reverse inequality for p>2 and no endpoint statement beyond p=1,2 is claimed.

Facts & Assumptions

Given: Countable Choice, the probability space (T,mT), an exponent 1≤p≤2, and f∈Lp(T;C).

[A1]

Countable Choice is the hypothesis carried by the Parseval and interpolation interfaces below (The Axiom of Countable Choice (ACω)).

[F1]

The Fourier coefficient is f^(k)=∫Tf e−k dmT with e−k(x)=e−2πikx; the characters satisfy ∣ek∣=1, each coefficient functional is complex-linear and depends only on the almost-everywhere class of f (Fourier coefficients and trigonometric polynomials on the torus).

[F2]

For f,g∈L2(T;C) the Fourier coefficients satisfy the Parseval identities ∥f∥22=∑k∣f^(k)∣2 and ⟨f,g⟩=∑kf^(k)g^(k)‾ (The Parseval identity for Fourier series).

[F3]

On sigma-finite measure spaces a complex-linear finite-simple-core operator with ∥Tg∥∞≤A∥g∥1 and ∥Tg∥2≤B∥g∥2 satisfies, for 1<p<2, the interpolation bound ∥Tg∥p′≤A2/p−1B2−2/p∥g∥p; at p=1 and p=2 the endpoint estimates are retained, and under countable choice the core operator has the unique compatible bounded extensions to the full Lp spaces (Interpolate L1 to Linfinity and L2 to L2 bounds).

[F4]

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).

[F5]

∣∫g dμ∣≤∫∣g∣ dμ for integrable g (The modulus of an integral is bounded by the integral of the modulus).

[F6]

On a finite measure space, Lr⊆Lp for 1≤p<r<∞ with ∥g∥p≤μ(X)1/p−1/r∥g∥r (Finite-measure Lr includes into Lp for p<r).

[F7]

On every measure space, complex finite simple functions with finite-measure nonzero sets are dense in Lq(μ;C) for 1≤q<∞ (Complex finite-simple and smooth compact-support density for finite p).

[F8]

Complex Lq of a measure space is the set quotient Lq/ ⁣∼ of measurable classes of Complex Lp classes and Euclidean test-function conventions; the counting-measure space on Z is written ℓq(Z;C).

Proof

technique · prove the two endpoint bounds on the finite-simple core, interpolate, and identify the interpolated extension with the coefficient map
1.1F1F8given

Let C assign to the almost-everywhere class of a complex finite simple function s on T with finite-measure nonzero set its coefficient sequence Cs=(s^(k))k∈Z. This is well defined on classes and complex-linear by [F1]; its target is a space of measurable classes on Z with counting measure, which is sigma-finite, and its source space is the probability space T.

2.1F1F5step 1.1

For such a class s and every k, ∣s^(k)∣≤∫T∣s∣ ∣e−k∣ dmT=∥s∥1 by [F1] and [F5], so ∥Cs∥∞≤∥s∥1: the L^1-to-L-infinity endpoint bound holds with A=1.

2.2F2step 1.1

A finite simple function on a probability space is bounded, hence lies in L2(T;C), and [F2] gives ∥Cs∥2=∥s∥2; the L^2-to-L^2 endpoint bound holds with B=1.

3.1F3step 2.1step 2.2

Applying [F3] to the core operator C of step 1.1 with endpoints (p0,q0)=(1,∞), A=1 and (p1,q1)=(2,2), B=1 yields, for every 1<p<2, a unique compatible bounded extension Tp:Lp(T)→ℓp′(Z) with ∥Tpf∥p′≤∥f∥p, while at p=1 and p=2 the endpoint estimates of steps 2.1 and 2.2 hold; both measure spaces are sigma-finite.

3.2F1F2F7step 2.1

The L1-extension of C is the coefficient map: the coefficient map is a bounded linear map L1(T)→ℓ∞(Z) agreeing with C on the finite simple classes, which are dense in L1(T) by [F7], and extensions from a dense core into a Banach space are unique; the same argument identifies the L2-extension with the coefficient map on L2(T).

4.1F4F6step 3.1

Fix 1<p<2. Since mT(T)=1, [F6] gives Lp(T)⊆L1(T) with ∥f∥1≤∥f∥p, so the domain intersection of the Lp-extension Tp and the L1-extension contains all of Lp(T); by [F4] the two extensions agree as measurable classes there.

5.1F2step 3.1step 4.1step 3.2

By steps 4.1 and 3.2, for 1<p<2 the sequence Tpf is the coefficient sequence (f^(k)), and since ℓp′(Z)⊆ℓ∞(Z) with ∣f^(k)∣≤∥Tpf∥p′, step 3.1 gives ∥f^∥p′≤∥f∥p; the case p=2 is the Parseval equality of [F2].

6.1A1F6step 2.1∎

The case p=1 is the endpoint estimate of step 2.1 applied to L1 classes, and Countable Choice is used only through the cited Parseval and interpolation interfaces [A1]; the finite-measure convention mT(T)=1 enters only through [F6] and the probability-space identification of the core.

Depends on

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