For a finite group, choose one unitary irreducible representation of degree from each equivalence class. One consistent normalized Fourier transform on a finite group convention is . The Schur orthogonality relations give
The normalized convolution on a finite group satisfies in this convention. Using in the transform instead reverses that product order for scalar functions with the same normalized convolution on a finite group convention. The Fourier transform on a finite group has matrix-valued components even when the original function is scalar-valued.
For a scalar function on a group, use as the right-translation convention. For Fourier analysis on a finite group this gives . Specifying whether or appears in the definition avoids sign and multiplication-order ambiguity.
For a scalar function on a group, left translation by is . With the positive-representation convention for Fourier analysis on a finite group, .
For a scalar function on a finite group, one normalized transform convention assigns the matrix to each chosen unitary irreducible representation. This map is a weighted Hilbert space isomorphism by the Parseval identity on a finite group. Another common convention uses ; the corresponding convolution theorem on a finite group then reverses the matrix product order for .
For the Fourier transform on a finite group, the displayed identity uses uniform expectation in the original function space and a weighted Hilbert-Schmidt inner product in the matrix components. In particular . For an abelian group, all , and the identity becomes a sum of squared scalar coefficients.
The Fourier transform on a finite group convention has the displayed inversion formula. The sum is over one representative from each equivalence class of unitary irreducible representations. It follows from the Schur orthogonality relations and the regular representation decomposition, and holds at every group element without a limiting argument.
For scalar functions on a finite group, normalized convolution on a finite group is . It is associative and need not commute. Its identity is , rather than the unscaled indicator function of the identity element. The Fourier analysis on a finite group convention turns it into matrix multiplication in the same order.
The normalized convolution on a finite group and the Fourier transform on a finite group convention with satisfy the displayed identity. Substitute in the defining expectation and use . With the convention using instead, the scalar convolution has transform ; multiplication order matters for noncommutative groups.

Articles by others on the same topic (0)

There are currently no matching articles.