Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Fourier transform is a topological automorphism of tempered distributions

Statement

Assume Countable Choice. Fourier transformation is a topological automorphism of S′(Rn) for both the weak and strong dual topologies. If

⟨Ru,φ⟩=⟨u,φ(− ⋅)⟩,

then F2u=Ru and F−1=RF=FR.

Facts & Assumptions

Given: Countable Choice and u∈S′(Rn).

[F1]

Fourier transformation on S′ is weakly and strongly continuous (Fourier transform on tempered distributions is well defined and continuous).

[F2]

On Schwartz space, F2=R, R2=I, and F−1=RF (Fourier transform is a topological automorphism of Schwartz space).

Proof

technique · transpose the Schwartz identities
1.1F2

Evaluate the second transform on an arbitrary Schwartz test φ.

⟨F2u,φ⟩=⟨u,F2φ⟩=⟨u,Rφ⟩=⟨Ru,φ⟩.

Thus F2u=Ru. This is a direct test calculation and uses no density assertion about S inside its dual. [F2]

2.1step 1.1algebra

Reflection on the dual satisfies R2=I. Since step 1.1 gives R=F2 as operators on S′, associativity gives the following two-sided inverse calculation.

(RF)F=R2=I,F(RF)=F4=R2=I.

Hence F−1=RF; also RF=F3=FR. [step 1.1, algebra]

3.1F1step 2.1∎

The inverse RF=F3 is a composition of weakly continuous maps and also of strongly continuous maps. Therefore F is a topological automorphism for both topologies. Countable Choice is used only through [F1]–[F2].

Depends on

Dependency tree · 2 levels

Sources