Gowers Norm

In mathematics, in the field of additive combinatorics, a Gowers norm or uniformity norm is a class of norms on functions on a finite group or group-like object which quantify the amount of structure present, or conversely, the amount of randomness. They are used in the study of arithmetic progressions in the group. They are named after Timothy Gowers, who introduced it in his work on Szemerédi's theorem.

Definition

Let $f$ be a complex-valued function on a finite abelian group $G$ and let $J$ denote complex conjugation. The Gowers $d$-norm is

:$\Vert f \Vert_^ = \sum_ \prod_ J^ f\left(\right) \ .$

Gowers norms are also defined for complex-valued functions ''f'' on a segment = , where ''N'' is a positive integer. In this context, the uniformity norm is given as $\Vert f \Vert_ = \Vert \tilde \Vert_/\Vert 1_ \Vert_$, where $\tilde N$ is a large integer, $1_$ denotes the indicator function of 'N'' and $\tilde f(x)$ is equal to $f(x)$ for x \in /math> and $0$ for all other $x$. This definition does not depend on $\tilde N$, as long as $\tilde N > 2^d N$.

Inverse conjectures

An ''inverse conjecture'' for these norms is a statement asserting that if a bounded function ''f'' has a large Gowers ''d''-norm then ''f'' correlates with a polynomial phase of degree ''d'' − 1 or other object with polynomial behaviour (e.g. a (''d'' − 1)-step nilsequence). The precise statement depends on the Gowers norm under consideration.

The Inverse Conjecture for vector spaces over a finite field $\mathbb F$ asserts that for any $\delta > 0$ there exists a constant $c > 0$ such that for any finite-dimensional vector space ''V'' over $\mathbb F$ and any complex-valued function $f$ on $V$, bounded by 1, such that $\Vert f \Vert_ \geq \delta$, there exists a polynomial sequence $P \colon V \to \mathbb/\mathbb$ such that

:$\left, \frac \sum_ f(x) e \left( -P(x) \right) \ \geq c ,$

where $e(x) := e^$. This conjecture was proved to be true by Bergelson, Tao, and Ziegler.

The Inverse Conjecture for Gowers U^ /math> norm asserts that for any $\delta > 0$, a finite collection of (''d'' − 1)-step ''nilmanifolds'' $\mathcal_\delta$ and constants $c, C$ can be found, so that the following is true. If $N$ is a positive integer and f\colon to \mathbb is bounded in absolute value by 1 and $\Vert f \Vert_ \geq \delta$, then there exists a nilmanifold $G/\Gamma \in \mathcal_\delta$ and a nilsequence $F(g^nx)$ where $g \in G,\ x \in G/\Gamma$ and $F\colon G/\Gamma \to \mathbb$ bounded by 1 in absolute value and with Lipschitz constant bounded by $C$ such that:

:$\left, \frac \sum_^ f(n) \overline) \ \geq c .$

This conjecture was proved to be true by Green, Tao, and Ziegler.
It should be stressed that the appearance of nilsequences in the above statement is necessary. The statement is no longer true if we only consider polynomial phases.

References

* {{cite book , zbl=1277.11010 , last=Tao , first=Terence , authorlink=Terence Tao , title=Higher order Fourier analysis , series=Graduate Studies in Mathematics , volume=142 , location=Providence, RI , publisher=American Mathematical Society , year=2012 , isbn=978-0-8218-8986-2 , url=http://terrytao.wordpress.com/books/higher-order-fourier-analysis/ , mr=2931680

Additive combinatorics