Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-14T23:17:40.157Z Has data issue: false hasContentIssue false

AN INVERSE THEOREM FOR THE GOWERS U4-NORM

Published online by Cambridge University Press:  25 August 2010

BEN GREEN
Affiliation:
Centre for Mathematical Sciences, Wilberforce Road, Cambridge CB3 0WA, UK e-mail: b.j.green@dpmms.cam.ac.uk
TERENCE TAO
Affiliation:
UCLA Department of Mathematics, Los Angeles, CA 90095-1555, USA e-mail: tao@math.ucla.edu
TAMAR ZIEGLER
Affiliation:
Department of Mathematics, Technion - Israel Institute of Technology, Haifa 32000, Israel e-mail: tamarzr@tx.technion.ac.il
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We prove the so-called inverse conjecture for the Gowers Us+1-norm in the case s = 3 (the cases s < 3 being established in previous literature). That is, we show that if f : [N] → ℂ is a function with |f(n)| ≤ 1 for all n and ‖f‖U4 ≥ δ then there is a bounded complexity 3-step nilsequence F(g(n)Γ) 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.

By combining the main result of the present paper with several previous results of the first two authors one obtains the generalised Hardy–Littlewood prime-tuples conjecture for any linear system of complexity at most 3. In particular, we have an asymptotic for the number of 5-term arithmetic progressions p1 < p2 < p3 < p4 < p5 ≤ N of primes.

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 2010