English

An arithmetic algebraic regularity lemma

Logic 2026-02-06 v2 Combinatorics Group Theory

Abstract

We give an 'arithmetic regularity lemma' for groups definable in finite fields, analogous to Tao's 'algebraic regularity lemma' for graphs definable in finite fields. More specifically, we show that, for any M>0M>0, any finite field F\mathbf{F}, and any definable group (G,)(G,\cdot) in F\mathbf{F} and definable subset DGD\subseteq G, each of complexity at most MM, there is a normal definable subgroup HGH\leqslant G, of index and complexity OM(1)O_M(1), such that the following holds: for any cosets V,WV,W of HH, the bipartite graph (V,W,xy1D)(V,W,xy^{-1}\in D) is OM(F1/2)O_M(|\mathbf{F}|^{-1/2})-quasirandom. Various analogous regularity conditions follow; for example, for any gGg\in G, the Fourier coefficient 1^HDg(π)op||\widehat{1}_{H\cap Dg}(\pi)||_{\mathrm{op}} is OM(F1/8)O_M(|\mathbf{F}|^{-1/8}) for every non-trivial irreducible representation π\pi of HH.

Keywords

Cite

@article{arxiv.2412.11206,
  title  = {An arithmetic algebraic regularity lemma},
  author = {Anand Pillay and Atticus Stonestrom},
  journal= {arXiv preprint arXiv:2412.11206},
  year   = {2026}
}
R2 v1 2026-06-28T20:35:51.154Z