Product growth and mixing in finite groups.

We prove the following inequality on the convolution of distributions over a finite group G: (0.1) ∥ X *Y-U∥≤ √n/m∥ X - U ∥∥y - U ∥, where X, Y are probability distributions over G, the * denotes convolution, U the uniform distribution over G, and ∥. ∥ the l 2-norm; n is the order of G, and m denote...

Full description

Bibliographic Details
Main Authors: Babai, L, Nikolov, N, Pyber, L
Other Authors: Teng, S
Format: Conference item
Published: SIAM 2008
Description
Summary:We prove the following inequality on the convolution of distributions over a finite group G: (0.1) ∥ X *Y-U∥≤ √n/m∥ X - U ∥∥y - U ∥, where X, Y are probability distributions over G, the * denotes convolution, U the uniform distribution over G, and ∥. ∥ the l 2-norm; n is the order of G, and m denotes the minimum dimension of nontrivial real representations of G. This inequality can be viewed as a new expansion property of a large class of groups, including all Lie-type simple groups of bounded rank, all of which satisfy m > cnβ (where c > 0 is an absolute constant and β > 0 depends on the rank bound only). Best among them are the groups G = SL 2(q) (2×2 matrices with determinant 1 over and q) where m ∼ n 1/3/2. We derive applications of the convolution inequality (0.1) to a variety of areas, ranging from stochastic processes to additive combinatorics to group theory. An immediate consequence is a product growth inequality for subsets of G: if A,B C G then \AB\ > n/(l + Δ) where Δ = n 2/(m|A||B|). On the one hand, this corollary strengthens a recent result of Gowers which served as the inspiration to the present work; on the other hand, it gives a strong (and best possible) affirmative answer to a problem regarding the product growth of subsets of SL 2(q) recently posed by Venkatesh and Green at a conference in the newly flourishing area of "additive combinatorics." Another corollary to the main inequality shows that for groups with large m, mixing in the strongest sense (l∞-norm) occurs more rapidly than expected; we prove that if X, Y, Z are distributions over G then (0.2) ∥ X * Y * Z - U ∥∞ < √n/m∥ X ∥∥Y ∥∥Z ∥. This generalizes a result of Gowers. By easy induction, our main inequality generalizes to the convolution of multiple terms and thereby results in rapid mixing estimates for time-inhomogeneous Cayley walks on G. It also gives estimates for the size of the product of several subsets, resulting in diameter estimates for Cayley graphs and tying in with the broad subject of "bounded generation" in group theory. An illustration of the connection to diameters: for G = SL 2(q) it follows that if A ⊆' G and |A| ≥n 2/3+∈ then A t = G where t = 0(l/∈); we also show that the elements of G are represented nearly uniformly as words of length t over A. The connection to "bounded generation" is illustrated by one of the main applications of our results: every finite simple group of Lie type of characteristic p is the product of 5 Sylow p-subgroups. - Results of this type are among the ingredients of the recent breakthrough result that all finite simple groups have bounded degree expander Cayley graphs [KLN]; our results improve and greatly simplify these ingredients. The results and techniques used in this paper were inspired by a link between quasirandomness and group representation theory recently found by Gowers [Go].