Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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 T=R/(2πZ) and let mT be its normalized Borel probability measure, so in the angle coordinate its integral is ∫TF dmT=∫02πF(k) dk/(2π), obtained from the normalized one-dimensional torus by k=2πx. On C2 use ⟨u,v⟩C2=u1v1‾+u2v2‾ and ∥u∥C22=∣u1∣2+∣u2∣2, linear in the first argument. Define ℓ2(Z;C2):={x=(xj)j∈Z:xj∈C2, ∑j∈Z∥xj∥C22<∞},⟨x,y⟩ℓ2:=∑j∈Z⟨xj,yj⟩C2. Define L2(T;C2) to be the vector space of pairs of Borel-measurable functions f=(f1,f2):T→C2 with ∫T(∣f1∣2+∣f2∣2) dmT<∞, modulo equality mT-almost everywhere, with inner product ⟨f,g⟩L2:=∫T(f1g1‾+f2g2‾) dmT. These pairings are linear in the first argument. The square-summable-family supplier gives the scalar ℓ2 norm and pairing used coordinatewise. The L2 space is the pair of scalar L2 quotient spaces with the displayed sum inner product and completeness convention. Let c00(Z;C2):={x∈ℓ2(Z;C2):{j:xj≠0} is finite}. Define the linear map F0x(k)=∑j∈Zxjeijk,k∈T, componentwise, from c00(Z;C2) to L2(T;C2). Its values are continuous finite sums and therefore belong to this L2 space. Then F0 preserves inner products on finitely supported sequences and has a unique extension to a surjective linear isometry (a unitary map) F:ℓ2(Z;C2)→L2(T;C2).

Facts & Assumptions

Given: Countable Choice, the normalized one-dimensional torus, and two-component square-summable sequences.

[A1]

The Axiom of Countable Choice (ACω): assume Countable Choice, with its exact family-of-nonempty-sets formulation.

[F1]

The one-dimensional torus and its normalized Haar integral defines the quotient torus R/Z, its normalized Borel measure, and its integral; under k=2πx these give mT and dk/(2π). Square-summable families on an arbitrary index set and the space ℓ2(I) defines the scalar ℓ2 norm and pairing used for the two coordinates, while the vector-valued space and pairing are defined locally in the Statement.

[F2]

The Fourier basis and Parseval's identity on the finite torus: under Countable Choice the one-dimensional coordinate characters form an orthonormal basis of L2(T), and the Fourier-coefficient map is a surjective linear isometry onto ℓ2(Z;C); its inverse is the finite-subset-net Fourier series.

[F3]

L2 with the integral pairing is a Hilbert space: scalar L2 functions are equivalence classes modulo equality almost everywhere, their pairing is ∫fg‾ dmT, and this quotient space is complete.

Proof

1.1givenF1algebra

For finitely supported x,y, expanding the finite sums and using ∫Tei(j−ℓ)k dk/(2π)=δjℓ gives ⟨F0x,F0y⟩L2=∑j,ℓ⟨xj,yℓ⟩C2∫Tei(j−ℓ)k dk2π=∑j⟨xj,yj⟩C2=⟨x,y⟩ℓ2. Thus F0 is an isometry on its finite-support domain.

2.1givenA1F1F2F3step 1.1algebra∎

By [F2] under the explicit Countable Choice hypothesis [A1], the scalar Fourier-coefficient map is a surjective linear isometry from the complete space L2(T) of [F3] onto scalar ℓ2(Z;C), with inverse given by the finite-subset-net Fourier series. This proves scalar ℓ2 completeness: a Cauchy sequence pulls back by that inverse to a Cauchy sequence in L2, whose limit maps to its ℓ2 limit. Applying this to each of the two coordinates proves completeness of ℓ2(Z;C2) with [F1]'s norm. The inverse Fourier map applied coordinatewise is a unitary and agrees with F0 on finitely supported sequences by its finite polynomial formula. Those sequences are dense: for any ε>0, the finite-subset tail property in [F1] gives a finite F⊂Z with ∑j∉F∥xj∥2<ε2; choosing M with F⊆[−M,M] makes the squared truncation error at most that tail, hence below ε2. Thus c00 is dense and the continuous extension is unique.

Depends on

Dependency tree · 2 levels

Sources