Gowers norm

From HandWiki
Short description: Class of norms in additive combinatorics

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.[1] 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.[2]

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

‖f‖Ud(G)2d=∑x,h1,…,hd∈G∏ω1,…,ωd∈{0,1}Jω1+⋯+ωdf(x+h1ω1+⋯+hdωd) .

Gowers norms are also defined for complex-valued functions f on a segment [N]=0,1,2,...,N−1, where N is a positive integer. In this context, the uniformity norm is given as ‖f‖Ud[N]=‖f~‖Ud(ℤ/N~ℤ)/‖1[N]‖Ud(ℤ/N~ℤ), where N~ is a large integer, 1[N] denotes the indicator function of [N], and f~(x) is equal to f(x) for x∈[N] and 0 for all other x. This definition does not depend on N~, as long as N~>2dN.

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 𝔽 asserts that for any δ>0 there exists a constant c>0 such that for any finite-dimensional vector space V over 𝔽 and any complex-valued function f on V, bounded by 1, such that ‖f‖Ud[V]≥δ, there exists a polynomial sequence P:V→ℝ/ℤ such that

|1|V|∑x∈Vf(x)e(−P(x))|≥c,

where e(x):=e2πix. This conjecture was proved to be true by Bergelson, Tao, and Ziegler.[3][4][5]

The Inverse Conjecture for Gowers Ud[N] norm asserts that for any δ>0, a finite collection of (d − 1)-step nilmanifolds ℳδ and constants c,C can be found, so that the following is true. If N is a positive integer and f:[N]→ℂ is bounded in absolute value by 1 and ‖f‖Ud[N]≥δ, then there exists a nilmanifold G/Γ∈ℳδ and a nilsequence F(gnx) where g∈G, x∈G/Γ and F:G/Γ→ℂ bounded by 1 in absolute value and with Lipschitz constant bounded by C such that:

|1N∑n=0N−1f(n)F(gnx‾)|≥c.

This conjecture was proved to be true by Green, Tao, and Ziegler.[6][7] 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

  1. ↑ Hartnett, Kevin (25 November 2019). "Mathematicians Catch a Pattern by Figuring Out How to Avoid It". https://www.quantamagazine.org/mathematicians-catch-a-pattern-by-figuring-out-how-to-avoid-it-20191125/. 
  2. ↑ Gowers, Timothy (2001). "A new proof of Szemerédi's theorem". Geometric & Functional Analysis 11 (3): 465–588. doi:10.1007/s00039-001-0332-9. http://www.dpmms.cam.ac.uk/~wtg10/sz898.dvi. 
  3. ↑ Bergelson, Vitaly; Tao, Terence; Ziegler, Tamar (2010). "An inverse theorem for the uniformity seminorms associated with the action of 𝔽p∞". Geometric & Functional Analysis 19 (6): 1539–1596. doi:10.1007/s00039-010-0051-1. 
  4. ↑ Tao, Terence; Ziegler, Tamar (2010). "The inverse conjecture for the Gowers norm over finite fields via the correspondence principle". Analysis & PDE 3 (1): 1–20. doi:10.2140/apde.2010.3.1. 
  5. ↑ "The Inverse Conjecture for the Gowers Norm over Finite Fields in Low Characteristic". Annals of Combinatorics 16: 121–188. 2011. doi:10.1007/s00026-011-0124-3. 
  6. ↑ Green, Ben (2011). "An inverse theorem for the Gowers Us+1[N]-norm". Electron. Res. Announc. Math. Sci. 18: 69–90. doi:10.3934/era.2011.18.69. 
  7. ↑ "An inverse theorem for the Gowers Us+1[N]-norm". Annals of Mathematics 176 (2): 1231–1372. 2012. doi:10.4007/annals.2012.176.2.11.