We survey some recent progress on rigorously establishing the universality of
various spectral statistics of Wigner random matrix ensembles, focusing in
particular on the Four Moment Theorem and its applications.
The four moment theorem asserts, roughly speaking, that the joint
distribution of a small number of eigenvalues of a Wigner random matrix (when
measured at the scale of the mean eigenvalue spacing) depends only on the first
four moments of the entries of the matrix. In this paper, we extend the four
moment theorem to also cover the coefficients of the \emph{eigenvectors} of a
Wigner random matrix. A similar result (with different hypotheses) has been
proved recently by Knowles and Yin, using a different method.
The \emph{Gowers uniformity norms} $\|f\|_{U^k(G)}$ of a function $f: G \to
\C$ on a finite additive group $G$, together with the slight variant
$\|f\|_{U^k([N])}$ defined for functions on a discrete interval $[N] :=
\{1,...,N\}$, are of importance in the modern theory of counting additive
patterns (such as arithmetic progressions) inside large sets. Closely related
to these norms are the \emph{Gowers-Host-Kra seminorms} $\|f\|_{U^k(X)}$ of a
measurable function $f: X \to \C$ on a measure-preserving system $X = (X,
{\mathcal X}, \mu, T)$.
We introduce a randomized iterative fragmentation procedure for finite metric
spaces, which is guaranteed to result in a polynomially large subset that is
$D$-equivalent to an ultrametric, where $D\in (2,\infty)$ is a prescribed
target distortion. Since this procedure works for $D$ arbitrarily close to the
nonlinear Dvoretzky phase transition at distortion 2, we thus obtain a much
simpler probabilistic proof of the main result of Bartel, Linial, Mendel, and
Naor, answering a question from Mendel and Naor, and yielding the best known
bounds in the nonlinear Dvoretzky theorem.
We give a new bound on the probability that the random sum $\xi_1 v_1 +...+
\xi_n v_n$ belongs to a ball of fixed radius, where the $\xi_i$ are iid
Bernoulli random variables and the $v_i$ are vectors in $\R^d$. As an
application, we prove a conjecture of Frankl and F\"uredi (raised in 1988),
which can be seen as the high dimensional version of the classical
Littlewood-Offord-Erd\H os theorem.
Using the density-increment strategy of Roth and Gowers, we derive
Szemeredi's theorem on arithmetic progressions from the inverse conjectures
GI(s) for the Gowers norms, recently established by the authors and Ziegler.
Szemer\'edi's regularity lemma can be viewed as a rough structure theorem for
arbitrary dense graphs, decomposing such graphs into a structured piece (a
partition into cells with edge densities), a small error (corresponding to
irregular cells), and a uniform piece (the pseudorandom deviations from the
edge densities).
The Furstenberg recurrence theorem (or equivalently, Szemer\'edi's theorem)
can be formulated in the language of von Neumann algebras as follows: given an
integer $k \geq 2$, an abelian finite von Neumann algebra $(\M,\tau)$ with an
automorphism $\alpha: \M \to \M$, and a non-negative $a \in \M$ with
$\tau(a)>0$, one has $\liminf_{N \to \infty} \frac{1}{N} \sum_{n=1}^N \Re
\tau(a \alpha^n (a) ... \alpha^{(k-1)n} (a)) > 0$; a subsequent result of Host
and Kra shows that this limit exists. In particular, $\Re \tau(a \alpha^n (a)
>...
We study the eigenvalues values of the covariance matrix $\frac{1}{n} M^\ast
M$ of a large rectangular matrix $M = M_{n,p} = (\zeta_{ij})_{1 \leq i \leq p;
1 \leq j \leq n}$ whose entries are iid random variables of mean zero, variance
one, and having finite $C_0^{th}$ moment for some sufficiently large $C_0$.
Let $(X,d,\mu)$ be a metric measure space. For $\emptyset\neq R\subseteq
(0,\infty)$ consider the Hardy-Littlewood maximal operator $$ M_R f(x)
\stackrel{\mathrm{def}}{=} \sup_{r \in R} \frac{1}{\mu(B(x,r))} \int_{B(x,r)}
|f| d\mu.$$ We show that if there is an $n>1$ such that one has the
"microdoubling condition" $ \mu(B(x,(1+\frac{1}{n})r))\lesssim \mu(B(x,r)) $
for all $x\in X$ and $r>0$, then the weak $(1,1)$ norm of $M_R$ has the
following localization property: $$ \|M_R\|_{L_1(X) \to L_{1,\infty}(X)}\asymp
\sup_{r>0} \|M_{R\cap [r,nr]}\|_{L_1(X) \to L_{1,\infty}(X)}.
We prove the so-called inverse conjecture for the Gowers U^{s+1}-norm in the
case s = 3 (the cases s < 3 being established in previous literature). That is,
we establish that if f : [N] -> C is a function with |f(n)| <= 1 for all n and
|| f ||_{U^4} >= \delta then there is a bounded complexity 3-step nilsequence
F(g(n)\Gamma) which correlates with f. The approach seems to generalise so as
to prove the inverse conjecture for s >= 4 as well, and a longer paper will
follow concerning this.
The inverse conjecture for the Gowers norms $U^d(V)$ for finite-dimensional
vector spaces $V$ over a finite field $\F$ asserts, roughly speaking, that a
bounded function $f$ has large Gowers norm $\|f\|_{U^d(V)}$ if and only if it
correlates with a phase polynomial $\phi = e_\F(P)$ of degree at most $d-1$,
thus $P: V \to \F$ is a polynomial of degree at most $d-1$.
We show that for some absolute (explicit) constant $C$, the following holds
for every finitely generated group $G$, and all $d >0$:
If there is some $ R_0 > \exp(\exp(Cd^C))$ for which the number of elements
in a ball of radius $R_0$ in a Cayley graph of $G$ is bounded by $R_0^d$, then
$G$ has a finite index subgroup which is nilpotent (of step $<C^d$). An
effective bound on the finite index is provided if "nilpotent" is replaced by
'polycyclic", thus yielding a non-trivial result for finite groups as well.
Let $G = (G,+)$ be an additive group. The sumset theory of Pl\"unnecke and
Ruzsa gives several relations between the size of sumsets $A+B$ of finite sets
$A, B$, and related objects such as iterated sumsets $kA$ and difference sets
$A-B$, while the inverse sumset theory of Freiman, Ruzsa, and others
characterises those finite sets $A$ for which $A+A$ is small. In this paper we
establish analogous results in which the finite set $A \subset G$ is replaced
by a discrete random variable $X$ taking values in $G$, and the cardinality
$|A|$ is replaced by the Shannon entropy $\Ent(X)$.
We show that the Maxwell-Klein-Gordon equations in three dimensions are
globally well-posed in $H^s_x$ in the Coulomb gauge for all $s > \sqrt{3}/2
\approx 0.866$. This extends previous work of Klainerman-Machedon
\cite{kl-mac:mkg} on finite energy data $s \geq 1$, and Eardley-Moncrief
\cite{eardley} for still smoother data. We use the method of almost
conservation laws, sometimes called the "I-method", to construct an almost
conserved quantity based on the Hamiltonian, but at the regularity of $H^s_x$
rather than $H^1_x$.
We strengthen the Carleson-Hunt theorem by proving $L^p$ estimates for the
$r$-variation of the partial sum operators for Fourier series and integrals,
for $p>\max\{r',2\}$. Four appendices are concerned with transference, a
variation norm Menshov-Paley-Zygmund theorem, and applications to nonlinear
Fourier transforms and ergodic theory.
We strengthen the Carleson-Hunt theorem by proving $L^p$ estimates for the
$r$-variation of the partial sum operators for Fourier series and integrals,
for $p>\max\{r',2\}$. Four appendices are concerned with transference, a
variation norm Menshov-Paley-Zygmund theorem, and applications to nonlinear
Fourier transforms and ergodic theory.
Let $<\P > \subset \N$ be a multiplicative subsemigroup of the natural
numbers $\N = \{1,2,3,...\}$ generated by an arbitrary set $\P$ of primes
(finite or infinite). We given an elementary proof that the partial sums
$\sum_{n \in < \P >: n \leq x} \frac{\mu(n)}{n}$ are bounded in magnitude by 1.
With the aid of the prime number theorem, we also show that these sums converge
to $\prod_{p \in \P} (1 - \frac{1}{p})$ (the case when $\P$ is all the primes
is a well-known observation of Landau).
This is a continuation of our earlier paper on the universality of the
eigenvalues of Wigner random matrices. The main new results of this paper are
an extension of the results in that paper from the bulk of the spectrum up to
the edge. In particular, we prove a variant of the universality results of
Soshnikov for the largest eigenvalues, assuming moment conditions rather than
symmetry conditions.