Ben Green and I have updated our paper “An arithmetic regularity lemma, an associated counting lemma, and applications” to account for a somewhat serious issue with the paper that was pointed out to us recently by Daniel Altman. This paper contains two core theorems:

• An “arithmetic regularity lemma” that, roughly speaking, decomposes an arbitrary bounded sequence ${f(n)}$ on an interval ${\{1,\dots,N\}}$ as an “irrational nilsequence” ${F(g(n) \Gamma)}$ of controlled complexity, plus some “negligible” errors (where one uses the Gowers uniformity norm as the main norm to control the neglibility of the error); and
• An “arithmetic counting lemma” that gives an asymptotic formula for counting various averages ${{\mathbb E}_{{\bf n} \in {\bf Z}^d \cap P} f(\psi_1({\bf n})) \dots f(\psi_t({\bf n}))}$ for various affine-linear forms ${\psi_1,\dots,\psi_t}$ when the functions ${f}$ are given by irrational nilsequences.

The combination of the two theorems is then used to address various questions in additive combinatorics.

There are no direct issues with the arithmetic regularity lemma. However, it turns out that the arithmetic counting lemma is only true if one imposes an additional property (which we call the “flag property”) on the affine-linear forms ${\psi_1,\dots,\psi_t}$. Without this property, there does not appear to be a clean asymptotic formula for these averages if the only hypothesis one places on the underlying nilsequences is irrationality. Thus when trying to understand the asymptotics of averages involving linear forms that do not obey the flag property, the paradigm of understanding these averages via a combination of the regularity lemma and a counting lemma seems to require some significant revision (in particular, one would probably have to replace the existing regularity lemma with some variant, despite the fact that the lemma is still technically true in this setting). Fortunately, for most applications studied to date (including the important subclass of translation-invariant affine forms), the flag property holds; however our claim in the paper to have resolved a conjecture of Gowers and Wolf on the true complexity of systems of affine forms must now be narrowed, as our methods only verify this conjecture under the assumption of the flag property.

In a bit more detail: the asymptotic formula for our counting lemma involved some finite-dimensional vector spaces ${\Psi^{[i]}}$ for various natural numbers ${i}$, defined as the linear span of the vectors ${(\psi^i_1({\bf n}), \dots, \psi^i_t({\bf n}))}$ as ${{\bf n}}$ ranges over the parameter space ${{\bf Z}^d}$. Roughly speaking, these spaces encode some constraints one would expect to see amongst the forms ${\psi^i_1({\bf n}), \dots, \psi^i_t({\bf n})}$. For instance, in the case of length four arithmetic progressions when ${d=2}$, ${{\bf n} = (n,r)}$, and $\displaystyle \psi_i({\bf n}) = n + (i-1)r$

for ${i=1,2,3,4}$, then ${\Psi^{}}$ is spanned by the vectors ${(1,1,1,1)}$ and ${(1,2,3,4)}$ and can thus be described as the two-dimensional linear space $\displaystyle \Psi^{} = \{ (a,b,c,d): a-2b+c = b-2c+d = 0\} \ \ \ \ \ (1)$

while ${\Psi^{}}$ is spanned by the vectors ${(1,1,1,1)}$, ${(1,2,3,4)}$, ${(1^2,2^2,3^2,4^2)}$ and can be described as the hyperplane $\displaystyle \Psi^{} = \{ (a,b,c,d): a-3b+3c-d = 0 \}. \ \ \ \ \ (2)$

As a special case of the counting lemma, we can check that if ${f}$ takes the form ${f(n) = F( \alpha n, \beta n^2 + \gamma n)}$ for some irrational ${\alpha,\beta \in {\bf R}/{\bf Z}}$, some arbitrary ${\gamma \in {\bf R}/{\bf Z}}$, and some smooth ${F: {\bf R}/{\bf Z} \times {\bf R}/{\bf Z} \rightarrow {\bf C}}$, then the limiting value of the average $\displaystyle {\bf E}_{n, r \in [N]} f(n) f(n+r) f(n+2r) f(n+3r)$

as ${N \rightarrow \infty}$ is equal to $\displaystyle \int_{a_1,b_1,c_1,d_1 \in {\bf R}/{\bf Z}: a_1-2b_1+c_1=b_1-2c_1+d_1=0} \int_{a_2,b_2,c_2,d_2 \in {\bf R}/{\bf Z}: a_2-3b_2+3c_2-d_2=0}$ $\displaystyle F(a_1,a_2) F(b_1,b_2) F(c_1,c_2) F(d_1,d_2)$

which reflects the constraints $\displaystyle \alpha n - 2 \alpha(n+r) + \alpha(n+2r) = \alpha(n+r) - 2\alpha(n+2r)+\alpha(n+3r)=0$

and $\displaystyle (\beta n^2 + \gamma n) - 3 (\beta(n+r)^2+\gamma(n+r))$ $\displaystyle + 3 (\beta(n+2r)^2 +\gamma(n+2r)) - (\beta(n+3r)^2+\gamma(n+3r))=0.$

These constraints follow from the descriptions (1), (2), using the containment ${\Psi^{} \subset \Psi^{}}$ to dispense with the lower order term ${\gamma n}$ (which then plays no further role in the analysis).

The arguments in our paper turn out to be perfectly correct under the assumption of the “flag property” that ${\Psi^{[i]} \subset \Psi^{[i+1]}}$ for all ${i}$. The problem is that the flag property turns out to not always hold. A counterexample, provided by Daniel Altman, involves the four linear forms $\displaystyle \psi_1(n,r) = r; \psi_2(n,r) = 2n+2r; \psi_3(n,r) = n+3r; \psi_4(n,r) = n.$

Here it turns out that $\displaystyle \Psi^{} = \{ (a,b,c,d): d-c=3a; b-2a=2d\}$

and $\displaystyle \Psi^{} = \{ (a,b,c,d): 24a+3b-4c-8d=0 \}$

and ${\Psi^{}}$ is no longer contained in ${\Psi^{}}$. The analogue of the asymptotic formula given previously for ${f(n) = F( \alpha n, \beta n^2 + \gamma n)}$ is then valid when ${\gamma}$ vanishes, but not when ${\gamma}$ is non-zero, because the identity $\displaystyle 24 (\beta \psi_1(n,r)^2 + \gamma \psi_1(n,r)) + 3 (\beta \psi_2(n,r)^2 + \gamma \psi_2(n,r))$ $\displaystyle - 4 (\beta \psi_3(n,r)^2 + \gamma \psi_3(n,r)) - 8 (\beta \psi_4(n,r)^2 + \gamma \psi_4(n,r)) = 0$

holds in the former case but not the latter. Thus the output of any purported arithmetic regularity lemma in this case is now sensitive to the lower order terms of the nilsequence and cannot be described in a uniform fashion for all “irrational” sequences. There should still be some sort of formula for the asymptotics from the general equidistribution theory of nilsequences, but it could be considerably more complicated than what is presented in this paper.

Fortunately, the flag property does hold in several key cases, most notably the translation invariant case when ${\Psi^{}}$ contains ${(1,\dots,1)}$, as well as “complexity one” cases. Nevertheless non-flag property systems of affine forms do exist, thus limiting the range of applicability of the techniques in this paper. In particular, the conjecture of Gowers and Wolf (Theorem 1.13 in the paper) is now open again in the non-flag property case.