We begin by recalling our general algebraic perspective on the discrete Fourier transform (DFT). A Fourier basis of an algebra is a basis
of pairwise orthogonal selfadjoint idempotents. If such a basis exists, then
is necessarily commutative. Note also that since we have not mentioned a scalar product on the algebra
the orthogonality of the Fourier basis vectors can only refer to the fact that the vector product of two distinct Fourier basis vectors is the zero vector.
There is no guarantee that a given algebra admits a Fourier basis, but if it does then every element
can be expanded on the Fourier basis,
and the coefficients in this expansion define a function One of our most basic but important theorems from early on in the course is that the map
is an algebra isomorphism
This algebra isomorphism is called the Fourier transform on
The above construction cannot work for noncommutative algebras, in the sense that a noncommutative algebra cannot be isomorphic to a function algebra. We do however have an alternative path to pursue in this case. Instead of looking for a Fourier basis in , we look for a Frobenius scalar product on
. When such a scalar product exists, then
becomes a Hilbert space in a way which is compatible with its algebra structure. In this case, we have shown that
is isomorphic not to an algebra of functions on a finite set, but rather to an algebra of operators on a finite-dimensional Hilbert space. More precisely, we have an algebra homomorphism
which sends each
to the corresponding left multiplication operator
. A good name for the homomorphism
would be the Wedderburn transform; the pair
together is the left-regular representation of
The Wedderburn transform is an injective algebra homomorphism, and it replaces the Fourier transform in the sense that it sets up an isomorphism between the abstract algebra
and the subalgebra of
consisting of left multiplication operators
,
Although the above describes the Wedderburn transform as a replacement for the Fourier transform in the noncommutative setting, there is no reason that it cannot be applied in the commutative setting. Namely, the best case scenario is that we have a commutative algebra in which we have successfully identified a Fourier basis
, and we also are able to identify a Frobenius scalar product on the commutative algebra
. In this case, both the Fourier transform
and the Wedderburn transform
are in play. They are moreover related in a very useful way: the Fourier basis
is an eigenbasis for the Wedderburn transform
of every
, and the corresponding eigenvalues are given by the Fourier transform of
We have concretely implemented this compelling abstract picture in the case where is the convolution algebra of a finite abelian group,
In order to construct a Fourier basis of
we started from the observation that the set
of multiplicative characters of
, which is parameterized by an explicit set
corresponding to the decomposition of
as a product of cyclical groups, forms an orthogonal basis of
This allows us to define a Fourier basis in
consisting of the normalized multiplicative characters
In order to see how the Fourier transform and the Wedderburn transform work together in the setting of convolution algebras of finite abelian groups, I asked you to work out the case where is a cyclic group in detail, where the synchrony between the two transforms gives a method to diagonalize circulant matrices. I hope this was instructive, and it is definitely something worth reviewing more than once.
Now suppose is a nonabelian group. Then,
is a noncommutative algebra which cannot be isomorphic to a function algebra. However, the center
of
, which consists of functions on
which are constant on conjugacy classes of
is a commutative algebra associated to
. In this lecture we will see that the Fourier transform can indeed be concretely implemented for the class algebra of any finite group, which generalizes our prior implementation for convolution algebras of abelian groups. To achieve this extension, we will rely on our extension of multiplicative characters of finite abelian groups to irreducible characters of arbitrary finite groups. I hope that at this point you are close to internalizing the fact that, for abelian groups, multiplicative characters and irreducible characters are the same thing.
Let be a set parameterizing irreducible unitary representations of
(or equivalently irreducible linear representations of
) up to isomorphism. For each
let
be a representative of the corresponding isomorphism class, and let
We know that the set forms an orthogonal basis of
Let
be the set of conjugacy classes in
For each
let
be the indicator function of
Then, the set
is an orthogonal basis of
The connection coefficients of the class basis,
count solutions to certain equations in the underlying group, . Namely,
is the number of pairs
such that
where
Let
denote
for any
In Lecture 25, we posed the following problem which expresses the connection coefficients of
in terms of the irreducible characters of
You should reflect on what this says in the case where
is abelian.
Theorem 26.1. For any we have
Using this result, we construct a Fourier basis of Here is the basic claim: the central functions
form a Fourier basis of Let us first check that these candidate functions are nonzero.
Problem 26.1. Compute the -norm of
and show that
Now, on to the main event.
Theorem 26.1. The nonzero functions
are pairwise orthogonal selfadjoint idempotents in .
Proof: We have
By Theorem 26.1, the right hand side is
This quadruple sum over can be reorganized as
Character orthogonality (original, not dual) collapses the sums over and
leaving
This completes the orthogonal idempotent part of the proof. It remains to check that the proposed Fourier basis consists of selfadjoint elements, and we leave this as an exercise.