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

Gelfand transform of ell one of Z

Example

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Fix explicit bijections N→Z and N→Z2 and let ℓ1(Z) be the complex Banach space of absolutely summable families a=(an)n∈Z with ∥a∥1=∑n∣an∣, convolution

(a∗b)n:=∑j∈Zaj bn−j,

and the elements δm with (δm)n=1 if n=m and 0 otherwise. Then ℓ1(Z) is a commutative unital complex Banach algebra with unit δ0, its characters are exactly the maps

χz(a)  =  ∑n∈Zanzn(z∈T:={z∈C:∣z∣=1}),

the assignment z↦χz is a homeomorphism T→Δ(ℓ1(Z)) whose inverse is χ↦χ(δ1), and the Gelfand transform of a is the absolutely convergent Laurent series a^(χz)=∑nanzn.

Facts & Assumptions

Given: Countable Choice, the bijections above, the space ℓ1(Z) with convolution, and the unit circle T.

[L1]

Characters of a nonzero unital complex Banach algebra are unital and continuous, with ∣χ(a)∣≤∥a∥, and the character space carries the pointwise-evaluation topology, so every map χ↦χ(a) is continuous (Characters on a unital Banach algebra are continuous, Character and maximal ideal space).

[L2]

For sequences indexed by N, the truncation PN retaining coordinates 0,…,N converges in ℓ1 norm (Finite truncations approximate null and summable sequences).

[L5]

Under Countable Choice, T is homeomorphic to R/Z and is compact Hausdorff (The one-dimensional torus and its normalized Haar integral, The Axiom of Countable Choice (ACω)).

Verification

technique · direct
1.1L3algebra

All integer-index sums are transported by the fixed bijection b:N→Z; double-index sums use b×b. For nonnegative families the sum is the supremum of finite subsums, so a bijective reindexing preserves it. For absolutely summable complex families apply [L3] to real and imaginary parts. Thus the N-indexed Tonelli and Fubini statements apply to the displayed integer-index sums. Convolution is well defined and ∥a∗b∥1≤∥a∥1∥b∥1: for each n the family (∣ajbn−j∣)j has finite sum at most ∥a∥1∥b∥1 whenever ∑j∣aj∣<∞ and ∣bn−j∣ is bounded along j; summing over n and interchanging the order of summation by Tonelli's theorem [L3] gives ∑n∑j∣ajbn−j∣=∥a∥1∥b∥1, so every convolution coordinate is absolutely convergent and the estimate follows.

1.21.1L3algebra

Convolution is commutative and associative and δ0 is the identity: commutativity is the change of variable j↦n−j; associativity is the regrouping of the absolutely summable triple family (aibjcn−i−j)i,j along the two possible bracketing orders, licensed by Tonelli and Fubini for the real and imaginary parts [L3]; and (a∗δ0)n=an=(δ0∗a)n.

1.31.1L4algebra

ℓ1(Z) is complete: if (a(k)) is Cauchy in ∥⋅∥1, then each coordinate sequence (an(k))k is Cauchy in C and converges by [L4] to some an; for every finite set F⊆Z one has ∑n∈F∣an∣=lim⁡k∑n∈F∣an(k)∣≤sup⁡k∥a(k)∥1<∞, so a∈ℓ1(Z) with ∥a∥1≤sup⁡k∥a(k)∥1, and the same finite-subset estimate applied to a−a(k) gives ∥a−a(k)∥1≤sup⁡l≥k∥a(l)−a(k)∥1→0.

1.41.2L1algebra

δ1 is invertible with inverse δ−1, since δ1∗δ−1=δ0; if χ is a character and z:=χ(δ1), then 1=χ(δ0)=χ(δ1)χ(δ−1) so ∣z∣≥1 by [L1], while ∣z∣≤∥δ1∥1=1; hence ∣z∣=1, and multiplicativity gives χ(δn)=zn for all n∈Z.

1.5L1L3L5algebra

For a∈ℓ1(Z) define ha(z)=∑nanzn on T. This series converges absolutely by [L3]. Given ϵ>0, choose a finite initial segment of the fixed enumeration with tail sum less than ϵ/4, and choose N so that [−N,N] contains that segment. Then ∑∣n∣>N∣an∣<ϵ/4. Put M=∑∣n∣≤N∣n∣∣an∣. For z,w∈T, telescoping positive powers and the identity ∣z−1−w−1∣=∣z−w∣ give ∣zn−wn∣≤∣n∣∣z−w∣ for every integer n. Thus ∣ha(z)−ha(w)∣≤M∣z−w∣+ϵ/2. Taking ∣z−w∣<ϵ/(2(M+1)) proves continuity, including M=0. Once these maps are shown to be characters, this proves continuity into the evaluation topology [L1]; evaluation at δ1 is continuous in the reverse direction.

1.61.1L3algebra

For ∣z∣=1 the map χz(a):=∑nanzn is a character: it is complex-linear, nonzero (χz(δ0)=1) and multiplicative, because expanding χz(a)χz(b)=∑j∑kajbkzj+k and regrouping along n=j+k (Tonelli and Fubini on the absolutely summable family (ajbkzj+k), [L3]) gives ∑n(a∗b)nzn=χz(a∗b).

2.1step 1.4L1L2algebra

For every a∈ℓ1(Z) and every character χ with z=χ(δ1) one has χ(a)=∑nanzn: let U(a)k=ab(k). The definition of the norm gives ∥Ua∥1=∥a∥1, and U has inverse (U−1v)n=vb−1(n). Define QN=U−1PNU using precisely the N-indexed PN of [L2]. Then ∥a−QNa∥1=∥Ua−PNUa∥1→0; QNa is the finite sum ∑k=0Nab(k)δb(k). Approximate a by these QNa, apply linearity and [step 1.4] to each truncation, and pass to the limit using continuity of χ from [L1]; the series converges absolutely because ∣anzn∣=∣an∣.

3.1step 1.4step 2.1step 1.6algebra

The map z↦χz is a bijection T→Δ(ℓ1(Z)): it is injective because χz=χz′ forces z=χz(δ1)=χz′(δ1)=z′, and it is surjective by [step 2.1] applied to the character χ and its value z=χ(δ1)∈T from [step 1.4].

4.1step 2.1step 1.5step 3.1L4L5∎

By [step 1.5] and [step 3.1] the assignment is a continuous bijection with continuous inverse between the compact Hausdorff space T and the Hausdorff character space Δ(ℓ1(Z)), hence a homeomorphism; and by [step 2.1] the Gelfand transform of a is the Laurent series a^(χz)=∑nanzn.

Remarks

  • The example is the model case of the transform being injective but not surjective. The image of ℓ1(Z) under its Gelfand transform is the Wiener algebra inside C(T); that refinement belongs to the Fourier-analysis track and is only pointed at in Wiener lemma is developed on the Fourier analysis track.
  • Fubini is used to justify the regrouping, not to prove convergence: absolute summability of the relevant two- and three-index families is established by Tonelli before any rearrangement.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

107 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