Fourier Transform On Finite Groups - Fourier Transform On Finite Abelian Groups

Fourier Transform On Finite Abelian Groups

Since the irreducible representations of finite abelian groups are all of degree 1 and hence equal to the irreducible characters of the group, Fourier analysis on finite abelian groups is significantly simplified. For instance, the Fourier transform yields a scalar- and not matrix-valued function.

Furthermore, the irreducible characters of a group may be put in one-to-one correspondence with the elements of the group.

Therefore, we may define the Fourier transform for finite abelian groups as

$\widehat{f}(s) = \sum_{a \in G} f(a) \bar{\chi_s}(a).$

Note that the right-hand side is simply for the inner product on the vector space of functions from to defined by

$\langle f, g \rangle = \sum_{a \in G} f(a) \bar{g}(a).$

The inverse Fourier transform is then given by

$f(a) = \frac{1}{|G|} \sum_{s \in G} \widehat{f}(s) \chi_s(a).$

A property that is often useful in probability is that the Fourier transform of the uniform distribution is simply where 0 is the group identity and is the Kronecker delta.

Read more about this topic: Fourier Transform On Finite Groups

Famous quotes containing the words transform, finite and/or groups:

“Bees plunder the flowers here and there, but afterward they make of them honey, which is all theirs; it is no longer thyme or marjoram. Even so with the pieces borrowed from others; one will transform and blend them to make a work that is all one’s own, that is, one’s judgement. Education, work, and study aim only at forming this.”
—Michel de Montaigne (1533–1592)

“For it is only the finite that has wrought and suffered; the infinite lies stretched in smiling repose.”
—Ralph Waldo Emerson (1803–1882)

“In properly organized groups no faith is required; what is required is simply a little trust and even that only for a little while, for the sooner a man begins to verify all he hears the better it is for him.”
—George Gurdjieff (c. 1877–1949)