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
- Riesz transforms are L2 contractions and square to minus the identity in sum Corollary
- The Hilbert transform is an L2 isometry and squares to minus the identity Corollary
- The n-dimensional Heisenberg uncertainty inequality Corollary
- The Nyquist no-aliasing condition Corollary
- The Riesz transforms are bounded on Lp Corollary
- The Euclidean Dirac operator has nonclosed range at zero Counterexample
- The regular representation of R is not a Hilbert direct sum of irreducibles Counterexample
- Restriction Bessel-potential spaces on polyhedral domains Definition
- Riesz transforms on Euclidean space Definition
- Spatial and frequency centres and variances of an L² function with finite second moments Definition
- A Poisson-type extension and its local and global Sobolev traces Example
- A smooth Bessel-blur truth with an explicit TV source certificate Example
- Finite sum of Riesz squares in L2 Example
- Heat and Poisson semigroups as Fourier multipliers Example
- Momentum operator under the Fourier transform Example
- Normalized Hermite Fourier eigenfunctions Example
- Sinc-square integral from Plancherel Example
- The Gaussian attains equality in the Heisenberg inequality Example
- The Hilbert transform of an H¹ atom is integrable Example
- The regular translation system on L²(ℝⁿ): position, momentum and trivial stabilizer Example
- The Riesz kernel is a standard Calderón–Zygmund kernel Example
- The Riesz-transform formula for second derivatives of the Laplacian Example
- The Sobolev weight on a single dyadic annulus Example
- The zero-order Bessel completion is exactly L² Example
- Translation and differentiation symbols Example
- Two separated dyadic frequency packets add in Euclidean square Example
- A whole-space Fourier splitting for compactly supported H(curl) fields Lemma
- Band-limited samples are the Fourier coefficients of the rescaled spectrum Lemma
- Beltrami Caccioppoli translation and Fourier-tail estimates Lemma
- Besov smoothness gives the exact collared Sobolev penalty a cutoff source bound Lemma
- Carleson signed tree weak one one estimate Lemma
- Carleson single tree estimate Lemma
- Carleson size selection Lemma
- Centered NtD data control the exact CGO identity with its modulation factor Lemma
- Centring by translation and modulation preserves the variance product Lemma
- Circle-averaged negative Bourgain estimate for rough vector fields Lemma
- Collared Sobolev conductivities have regular Liouville potentials and H1 recovery Lemma
- Conductivity L2 recovery from fixed-parameter Beltrami solution stability Lemma
- Distributional derivatives are polynomial Fourier multipliers Lemma
- Dyadic Mihlin pieces: uniform L1 and first-difference bounds Lemma
…and 31 more results.
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)