Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)
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 and interpolation orientation

Remark

Assume countable choice. In the fixed negative-sign, 2π normalization, the Fourier operator has norm one at both endpoints L1L and L2L2.

For the first endpoint, The L1 transform is bounded and uniformly continuous gives the upper bound one. The nonnegative Gaussian g(x)=eπx2 has g1=1 and g^(0)=1 by Euclidean Gaussian transform with the 2π normalization. Continuity means its essential supremum is also one: every smaller positive bound is exceeded on a neighbourhood of zero of positive measure. Thus the operator norm is at least one. Plancherel theorem supplies the second norm-one endpoint, and Agreement of the integral and L2 transforms verifies agreement on their common domain.

These are the inputs to the Hausdorff–Young interpolation route. Teschl's endpoint-capable interpolation theorem, Theorem 15.2 and its extension Corollary 15.3, permits infinite endpoint exponents. A theorem restricting both target endpoint exponents to finite values cannot supply the L1L endpoint. The published page complex-riesz-thorin-endpoint-interpolation develops this separate subject outside this pair's authorized prerequisite closure. It is orientation here, not an input to any proof on this pair; no intermediate-exponent Hausdorff–Young theorem is asserted by this remark. Countable choice (The Axiom of Countable Choice (ACω)) is inherited from the Gaussian and Plancherel suppliers.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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