Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Plancherel theorem

Statement

Assume countable choice and let n1. Fourier transformation on Schwartz space extends uniquely to a surjective complex-linear isometry F2:L2(Rn;C)L2(Rn;C). It preserves the first-variable-linear inner product, and hence is unitary.

Facts & Assumptions

Given: An integer n1, The Axiom of Countable Choice (ACω), and almost-everywhere classes as in The space Lp(μ) as the quotient by null functions.

[F1]

Schwartz Parseval preserves pairings and norms (Parseval pairing on Schwartz space).

[F2]

Schwartz classes are dense in complex L2 (Schwartz space is dense in L2).

[F4]

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

[F5]

Complex L2 is complete with the stated pairing and Cauchy–Schwarz (Complex completeness, density, and inner product: the consumer interface).

Proof

technique · direct
1.1

View Schwartz functions as a normed subspace of L2: 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 F2. For each fixed f, countable choice selects a sequence ukS with ukf2<1/(k+1) for kN; its Fourier images converge to F2f. The isometry on the subspace gives F2f2=limku^k2=limkuk2=f2. Independence of the sequence follows also from u^kv^k2=ukvk20.

F1F2F4F5given
2.1

For any gL2, [F2] and countable choice give vkS tending to g. By [F3], define the uniquely determined uk=F1vkS. By [F1], ukul2=vkvl2, so [F5] gives a limit uL2. Continuity of the extension in step 1.1 gives F2u=limkvk=g. Thus the extension is surjective.

step 1.1F1F2F3F5given
3.1

For approximants ukf, vkg, Cauchy–Schwarz in [F5] bounds uk,vkf,g by ukf2vk2+f2vkg20, 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.

step 1.1step 2.1F1F5

Depends on

Used by

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