Strong inverse conjecture for the Gowers norm

Let pp be prime, k1k\geq1, G=FpnG=\mathbb{F}_p^n, and D={zC:z1}\mathbb D=\{z\in\mathbb C:|z|\leq1\}. Let ε:NR+\varepsilon:\mathbb N\to\mathbb R^+ be decreasing, and let Polyk(G)\mathrm{Poly}^k(G) be the degree-at-most-kk polynomial phases on GG. Strong inverse conjecture for the Gowers norm. For every η>0\eta>0, there exists M=M(k,p,η,ε)M=M(k,p,\eta,\varepsilon) such that, if f:GDf:G\to\mathbb D satisfies fUk+1(G)η\|f\|_{U^{k+1}(G)}\geq\eta, then for a uniformly random tuple h=(h1,,hM)GM\vec h=(h_1,\dots,h_M)\in G^M, with probability at least 1/21/2 there exist 1mM1\leq m\leq M, PPolyk(G)P\in\mathrm{Poly}^k(G), and a function F:DFpMCF:{\mathbb D}^{\mathbb F_p^M}\to\mathbb C of Lipschitz constant at most MM such that

ExGf(x)e(P(x))1m\left|\mathbb E_{x\in G}f(x)e(-P(x))\right|\geq\frac1m

and

ExGe(P(x))F((f(x+ah))aFpM)ε(m).\left|\mathbb E_{x\in G}e(P(x))-F\left(\left(f(x+a\cdot\vec h)\right)_{a\in\mathbb F_p^M}\right)\right|\leq\varepsilon(m).

This is presented as a strengthening of the inverse conjecture, motivated by the claim that the correlating polynomial is approximately measurable from the function and random shifts. The source explains that the Bergelson–Tao–Ziegler conjecture would imply this stronger statement, but does not state that the strong version has been proved.

Sources & referencesView supporting material

Primary source

Asgar Jamneshan, Or Shalom and Terence Tao, “A Host–Kra F_2^ω-system of order 5 that is not Abramov of order 5, and non-measurability of the inverse theorem for the U^6(F_2^n) norm”, arXiv:2303.04853 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.