For strictly decreasing integer tuples , let on the diagonal maximal torus of the unitary group. Expanding both determinants, Fourier orthogonality makes the integral zero unless the exponent tuples have the same permutation orbit. Strict decreasing order makes that equivalent to ; the matching permutation terms then each contribute one. An alternating Laurent polynomial is a finite linear combination of these alternants. For an irreducible character , its highest monomial gives coefficient one for in , with . The Weyl integration formula and Schur orthogonality relations force the sum of squared coefficients to be one, so all other coefficients vanish. This proves the unitary Weyl character formula directly.
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.
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.
Write the diagonal maximal torus of as , , and let . Irreducible complex representations are indexed by dominant integer tuples , their highest weights. The Weyl character formula in integer-exponent form is
The ratio initially uses distinct , and extends to repeated eigenvalues by continuity. Every unitary matrix is conjugate to such a diagonal matrix, so this determines the character on the entire group. The shift differs from the usual Weyl vector by a multiple of ; the corresponding determinant factors cancel between numerator and denominator.
We first justify the highest-weight information needed in the proof. Restriction to the torus splits a representation into integer weight spaces. In an irreducible representation choose a lexicographically largest weight and a nonzero vector of that weight. A matrix unit with raises the weight by , so it annihilates . The character is invariant under permutations of diagonal coordinates, because permutation matrices conjugate the torus. Hence permutations of are also weights, and lexical maximality forces .
Irreducibility implies that generates the representation under the complexified Lie algebra. Indeed, a Lie-algebra invariant subspace is preserved by exponentials of skew-Hermitian matrices, which generate . Reorder any product of matrix units into lower-triangular units, diagonal units and upper-triangular units, using
Induction on length and on the number of out-of-order pairs gives the required spanning version of the Poincaré-Birkhoff-Witt theorem. Upper-triangular units kill , and diagonal units act by scalars. Every nonempty product of lower-triangular units lowers its weight by a nonzero sum of positive roots. Therefore the top weight space is exactly , and its multiplicity is one. This supplies the leading coefficient without assuming a character formula.
For completeness, every dominant integer tuple occurs. Put and form the representation
Its lexicographically highest weight is , with one-dimensional highest space, represented by the tensor products of . A negative determinant exponent is a legitimate one-dimensional unitary-group character. Averaging an inner product over normalized Haar measure gives invariant orthogonal complements, so the tensor representation splits into irreducible summands. One of them has highest weight . Uniqueness will also follow from the formula and Schur orthogonality relations.
Define the alternant for a strictly decreasing integer tuple . The denominator
is the Vandermonde determinant, and its modulus is the denominator modulus in the Weyl integration formula. The Laurent polynomial is alternating. Any alternating Laurent polynomial decomposes as a finite sum
monomials with repeated exponents have zero coefficient, and the remaining permutation orbits are indexed uniquely by strictly decreasing tuples.
The lexicographically highest monomial in the product is with coefficient one. Indeed, the highest monomial of the character is with coefficient one, and the unique lexical maximum among permutations of is itself. It follows that .
Fourier orthogonality on the torus, whose probability measure is , gives alternant orthogonality on a unitary torus:
Expand both determinants: an integral survives exactly when the two exponent tuples are identical up to permutation. Strict decreasing order then forces , and its matching terms each contribute one.
Finally, Schur orthogonality relations give . Applying the allowed Weyl integration formula to this class function gives
Since the coefficient already equals one, every other coefficient vanishes. Thus , proving the formula. If two irreducible representations had the same highest weight, their characters would now coincide; the Schur orthogonality relations imply that they are isomorphic. Apparent singularities at repeated diagonal eigenvalues are removable because the quotient equals the actual finite Laurent-polynomial character. No dimension formula has been assumed.
Use the following normalization for Fourier analysis on a finite group. Choose one unitary irreducible representation from each equivalence class, including the trivial representation. For a scalar function , put
This convention uses , rather than , in the Fourier transform on a finite group; it makes the normalized convolution on a finite group preserve multiplication order.
The needed representation theory consists of Maschke's theorem and unitarization of a finite-group representation, together with the Schur orthogonality relations:
The regular representation contains copies of each , so . Thus the scaled matrix coefficients , and also their complex conjugates, form an orthonormal basis of all scalar functions on . These facts imply Fourier inversion on a finite group and the Parseval identity on a finite group in the forms
and hence
In particular, the transform is an isomorphism onto the direct sum of the matrix algebras , with the displayed weighted Hilbert-Schmidt inner product.
Define the normalized convolution on a finite group by
Substituting and using the group representation identity yields the convolution theorem on a finite group
Unlike normalized convolution on a finite group on an abelian group, this product need not commute. If , then . For left translation of a group function and right translation of a group function and ,
For an abelian group, every irreducible representation is one-dimensional; this reduces to Fourier analysis on a finite abelian group with characters relabelled by their inverses. These formulas establish the basic scalar theory, with all normalizations and multiplication orders fixed.
Now suppose every nontrivial irreducible representation has . If is a mean-zero function, its component at the trivial representation is zero. The Parseval identity on a finite group gives, for each other ,
Using the convolution theorem on a finite group, the Hilbert-Schmidt norm inequality , and the Parseval identity on a finite group once more gives the product mixing in a quasirandom group estimate
Write for the subset density values of , respectively, and let , be balanced subset indicators. Since both are mean-zero functions, . Their squared norms are and . Also , so the Cauchy-Schwarz inequality yields
If , the final bound is strictly smaller than . Thus the normalized number of pairs with is positive. Equivalently,
This is the desired conclusion for a quasirandom group; the strict inequality ensures positivity rather than merely a nonnegative lower bound.
Use , the necessary parameter range for the bounds involving . The construction comes from the singular value decomposition of matrix Fourier blocks. For each inequivalent unitary irreducible representation of dimension , consider the Hilbert space with the Hilbert-Schmidt inner product and the operator
Its operator norm is at most one, since is a unitary matrix and . Thus all its singular values lie in .
Two identities control their weighted moments:
Here the expectation in is uniform on the solutions of the constraint, and the trace on used to compute each moment is the ordinary operator trace. We justify the identities explicitly to fix their normalizations and the noncommutative order.
The adjoint operator is , so
For rectangular matrices, the operator has trace , as is seen on the matrix-unit basis. Squaring the previous operator therefore gives
The required representation theory consists of unitarization of a finite-group representation, the Schur orthogonality relations, and the regular representation decomposition. The last gives the character expansion of the identity delta
Summing the two operator traces with weights selects in the first, and in the second. Multiplication by converts each independent-variable expectation to its conditional expectation. This proves . In particular is real and nonnegative, despite the apparently complex summands in its original formula. Since , the nonvacuous hypothesis has .
Select every singular value satisfying . Index the selected pairs by , set , , and choose unit right singular vectors and unit left singular vectors with . Define
Both are matrices, proving (i). Repeated group representations in this list are literally the same chosen representative, rather than different equivalent realizations.