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.
Unitary Fourier transform for a two-component lattice sequence
Statement
Assume Countable Choice. Let and let be its normalized Borel probability measure, so in the angle coordinate its integral is , obtained from the normalized one-dimensional torus by . On use and , linear in the first argument. Define Define to be the vector space of pairs of Borel-measurable functions with , modulo equality -almost everywhere, with inner product These pairings are linear in the first argument. The square-summable-family supplier gives the scalar norm and pairing used coordinatewise. The space is the pair of scalar quotient spaces with the displayed sum inner product and completeness convention. Let . Define the linear map componentwise, from to . Its values are continuous finite sums and therefore belong to this space. Then preserves inner products on finitely supported sequences and has a unique extension to a surjective linear isometry (a unitary map) .
Statement references
Facts & Assumptions
Given: Countable Choice, the normalized one-dimensional torus, and two-component square-summable sequences.
The Axiom of Countable Choice (): assume Countable Choice, with its exact family-of-nonempty-sets formulation.
The one-dimensional torus and its normalized Haar integral defines the quotient torus , its normalized Borel measure, and its integral; under these give and . Square-summable families on an arbitrary index set and the space defines the scalar norm and pairing used for the two coordinates, while the vector-valued space and pairing are defined locally in the Statement.
The Fourier basis and Parseval's identity on the finite torus: under Countable Choice the one-dimensional coordinate characters form an orthonormal basis of , and the Fourier-coefficient map is a surjective linear isometry onto ; its inverse is the finite-subset-net Fourier series.
with the integral pairing is a Hilbert space: scalar functions are equivalence classes modulo equality almost everywhere, their pairing is , and this quotient space is complete.
Proof
For finitely supported , expanding the finite sums and using gives Thus is an isometry on its finite-support domain.
By [F2] under the explicit Countable Choice hypothesis [A1], the scalar Fourier-coefficient map is a surjective linear isometry from the complete space of [F3] onto scalar , with inverse given by the finite-subset-net Fourier series. This proves scalar completeness: a Cauchy sequence pulls back by that inverse to a Cauchy sequence in , whose limit maps to its limit. Applying this to each of the two coordinates proves completeness of with [F1]'s norm. The inverse Fourier map applied coordinatewise is a unitary and agrees with on finitely supported sequences by its finite polynomial formula. Those sequences are dense: for any , the finite-subset tail property in [F1] gives a finite with ; choosing with makes the squared truncation error at most that tail, hence below . Thus is dense and the continuous extension is unique.