Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (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.

Haar normalisations on a finite abelian group and its dual

Statement

Let G be a finite abelian group with its probability Haar measure mG(E)=∣E∣/∣G∣ and let G^ be its dual group. The compatible dual Haar measure is counting measure on G^, so for f:G→C the inversion formula is f(x)=∑γ∈G^f^(γ) γ(x),f^(γ)=1∣G∣∑x∈Gf(x)γ(x)‾,i.e.f=1∣G∣∑γ∈G^(∑x∈Gf(x)γ(x)‾)γ. Writing N:=∣G∣, the unitary discrete Fourier transform on the counting-measure spaces is Uf(γ):=N−1/2∑x∈Gf(x)γ(x)‾=N1/2f^(γ),f(x)=N−1/2∑γ∈G^Uf(γ)γ(x). Thus, for the same input f, passage from the probability-Haar transform to the unitary DFT multiplies the output by N1/2. The factor N−1/2 is the coefficient in the unitary forward and inverse sums.

Facts & Assumptions

Given: A finite abelian group G written additively, its dual G^ equipped with the compact-open topology, and the LCA Fourier transform normalized by the probability Haar measure mG(E)=∣E∣/∣G∣.

[F1]

A finite group is compact and discrete. The measure mG(E)=∣E∣/∣G∣ is a left-invariant probability measure by finite counting, so ∫f dmG=∣G∣−1∑x∈Gf(x) (Left Haar integral and left Haar measure).

[F2]

Counting measure #(E)=∣E∣ on a finite discrete group is a nonzero Radon measure invariant under every translation, and hence is Haar (Radon measure on an LCH space, Left Haar integral and left Haar measure).

[F3]

A nontrivial finite abelian group is an internal direct product of indecomposable subgroups, and each indecomposable factor is cyclic of prime-power order; the trivial group is the empty product (Every nontrivial finite abelian group is an internal direct product of indecomposable subgroups, The indecomposable finite abelian groups are exactly the nontrivial cyclic groups of prime-power order). The dual of a finite product is the product of the duals (the finite-product clause of Duals of finite products and of discrete direct sums, The Pontryagin dual with the compact-open topology). The character group of Z/NZ is Z/NZ: a character is determined by the N-th root of unity z=χ([1]), and the kernel theorem for the complex exponential gives z=exp⁡(2πik/N) for a unique k∈Z/NZ (The complex exponential by its power series, ker⁡(exp⁡)=2πiZ, and exp⁡z=exp⁡w exactly when z−w∈2πiZ, Additive characters are exactly one-dimensional complex representation characters).

[F4]

The dual group is an abelian group under pointwise multiplication (The Pontryagin dual with the compact-open topology), so translation γ↦γ0γ is a bijection of G^; moreover the local cyclic characters of [F3] separate the points of G: under the product decomposition every nonzero z∈G has a nonzero coordinate in some cyclic factor, and the character of that factor with frequency k=1, extended to G through the product duality of [F3], takes a value different from 1 at z.

[F5]

The transform on the finite group is f^(γ)=∣G∣−1∑x∈Gf(x)γ(x)‾ (The Fourier transform on an LCA group). A Haar measure on the finite dual is compatible when this inversion formula holds with that measure.

Proof

technique · direct
1.1F1F2F3

(Order and topology of the dual.) If G is trivial, take the empty product; otherwise [F3] writes G≅Z1⊕⋯⊕Zk with Zj=Z/NjZ. The local computation in [F3] shows Zj^≅Z/NjZ, so by the finite-product duality G^≅∏jZ/NjZ and ∣G^∣=∏jNj=∣G∣. The same statement holds for the trivial group, whose dual is trivial. Thus G^ is finite and discrete, and by [F2] counting measure is a Haar measure of total mass ∣G^∣=∣G∣.

2.1F4step 1.1

(Orthogonality.) For z∈G, if z=0 then γ(z)=1 for every γ and ∑γ∈G^γ(z)=∣G^∣=∣G∣. If z≠0, step 1.1 and [F4] provide γ0 with γ0(z)≠1; since γ↦γ0γ is a bijection of G^, ∑γγ(z)=∑γ(γ0γ)(z)=γ0(z)∑γγ(z), hence ∑γ∈G^γ(z)=0. Therefore ∑γ∈G^γ(x−y)=∣G∣δx,y for all x,y∈G, which is the displayed orthogonality relation.

3.1F5step 2.1

(Inversion.) For f:G→C and γ∈G^, the transform is f^(γ)=∣G∣−1∑x∈Gf(x)γ(x)‾ by [F5]. Hence, using the orthogonality of step 2.1, ∑γ∈G^f^(γ)γ(x)=1∣G∣∑y∈Gf(y)∑γ∈G^γ(x−y)=1∣G∣∑y∈Gf(y)∣G∣δx,y=f(x), which is the displayed inversion formula.

4.1F2step 1.1step 3.1algebra

(The compatible measure is counting measure.) Counting measure on the finite group G^ is Haar. Any Haar measure ν on this finite group assigns the same mass c to every point by translation invariance, so ν=c#. If ν is compatible with the transform, applying inversion to δ0 gives 1=∫G^δ0^(γ) dν(γ)=c∣G^∣/∣G∣=c, using ∣G^∣=∣G∣ from step 1.1. Thus counting measure is the unique compatible dual Haar measure.

4.2step 1.1step 2.1step 3.1algebra

(Unitary normalisation.) Set N:=∣G∣ and Uf(γ):=N−1/2∑xf(x)γ(x)‾=N1/2f^(γ). By step 3.1, N−1/2∑γ∈G^Uf(γ)γ(x)=∑γ∈G^f^(γ)γ(x)=f(x). Expanding the finite sum and using step 2.1 gives ∑γ∈G^∣Uf(γ)∣2=N−1∑x,y∈Gf(x)f(y)‾∑γ∈G^γ(y−x)=∑x∈G∣f(x)∣2. Hence U is a linear isometry for the counting-measure norms; the displayed inversion and ∣G^∣=∣G∣ make it bijective, so it is unitary. Its relation to the probability-Haar transform is Uf=N1/2f^.

5.1step 2.1step 3.1step 4.1step 4.2∎

Step 2.1 gives the orthogonality relation, step 3.1 gives the nonunitary inversion formula, step 4.1 identifies counting measure as the compatible dual Haar measure, and step 4.2 gives the unitary DFT, its inverse coefficient ∣G∣−1/2 and the output conversion Uf=∣G∣1/2f^.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

83 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