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.
Plancherel theorem
Statement
Assume countable choice and let . Fourier transformation on Schwartz space extends uniquely to a surjective complex-linear isometry . It preserves the first-variable-linear inner product, and hence is unitary.
Facts & Assumptions
Given: An integer , The Axiom of Countable Choice (), and almost-everywhere classes as in The space as the quotient by null functions.
Schwartz Parseval preserves pairings and norms (Parseval pairing on Schwartz space).
Schwartz classes are dense in complex (Schwartz space is dense in L2).
Fourier is onto Schwartz space (Fourier transform is a topological automorphism of Schwartz space).
A bounded linear map on a dense subspace into a Banach space extends uniquely under countable choice (A bounded linear map from a dense normed subspace into a Banach space extends uniquely with the same norm).
Complex is complete with the stated pairing and Cauchy–Schwarz (Complex completeness, density, and inner product: the consumer interface).
Proof
View Schwartz functions as a normed subspace of : a continuous function vanishing a.e. vanishes everywhere, since any nonzero value persists on a positive-volume box. Thus the association with its class is injective. By [F1], Fourier is a bounded linear isometry on this dense subspace, and [F5] makes the target Banach. [F4] and [F2] give a unique bounded linear extension . For each fixed , countable choice selects a sequence with for ; its Fourier images converge to . The isometry on the subspace gives . Independence of the sequence follows also from .
For any , [F2] and countable choice give tending to . By [F3], define the uniquely determined . By [F1], , so [F5] gives a limit . Continuity of the extension in step 1.1 gives . Thus the extension is surjective.
For approximants , , Cauchy–Schwarz in [F5] bounds by , since a convergent sequence is norm bounded. Apply the same estimate to their transform images and pass to the limit in [F1]. This proves pairing preservation. Steps 1.1 and 2.1 give the remaining unitary properties. Countable choice was used only in the cited interfaces and to select countable approximation sequences for each fixed input; no simultaneous arbitrary-index selection or Hilbert basis is needed.
Depends on
- Parseval pairing on Schwartz space
- Schwartz space is dense in L2
- Fourier transform is a topological automorphism of Schwartz space
- A bounded linear map from a dense normed subspace into a Banach space extends uniquely with the same norm
- The space $L^p(\mu)$ as the quotient by null functions
- Complex completeness, density, and inner product: the consumer interface
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Momentum operator under the Fourier transform Example
- Normalized Hermite Fourier eigenfunctions Example
- Sinc-square integral from Plancherel Example
- Carleson signed tree weak one one estimate Lemma
- Carleson single tree estimate Lemma
- Carleson size selection Lemma
- Hausdorff–Young and interpolation orientation Remark
- Agreement of the integral and L2 transforms Theorem
- L2 Fourier inversion Theorem
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
- Gerald Teschl, Topics in Real and Functional Analysis (2017) (standard reference, not scraped)