NIP Arithmetic Regularity Lemma

• NIP arithmetic regularity lemma is a collection of results that provide tame, structured approximations for subsets in groups whose translate families have bounded VC-dimension.
• It uses tools like Bohr neighborhoods, subspaces, and definable partitions to ensure that almost all cells are nearly full or nearly empty, bypassing tower-type growth issues.
• These approaches improve upon classical Fourier-analytic methods by leveraging strong tameness assumptions such as NIP and stability to achieve better quantitative bounds.

Searching arXiv for recent and foundational papers on NIP arithmetic regularity, stable arithmetic regularity, and classical arithmetic regularity lower bounds. In the literature summarized here, the phrase NIP arithmetic regularity lemma is best understood as naming a family of tame arithmetic regularity results for subsets of groups whose translate families have bounded VC-dimension, together with closely related definable regularity theorems in NIP theories. Their common objective is to replace the unrestricted Fourier-analytic regularity paradigm by bounded-complexity structured approximations—typically via subgroups, Bohr neighborhoods, or definable partitions—while forcing almost all relevant cells to be nearly empty or nearly full. The subject is usually read against Green’s classical arithmetic regularity lemma, whose unrestricted form is intrinsically tower-complex, whereas bounded VC-dimension, stability, and distality yield much stronger structure and markedly better quantitative behavior (Hosseini et al., 2014, Conant et al., 4 Sep 2025, Terry et al., 2017).

1. Classical arithmetic regularity and the motivation for tame variants

Green’s arithmetic regularity lemma, in the finite-field model $G=\mathbb{Z}_2^n$, concerns bounded functions $f:G\to[0,1]$ and asks for a subspace $H\leq G$ such that on most cosets $H+g$, the restriction $f|_{H+g}$ has no large nontrivial Fourier coefficient. In the formulation used in the lower-bound literature, a coset $H+g$ is $\epsilon$-regular when

$$\max_{\eta\notin H^\perp} |\widehat{f|_{H+g}}(\eta)|\le \epsilon,$$

and $H$ is $\epsilon$-regular for $f:G\to[0,1]$0 if this holds on at least a $f:G\to[0,1]$1-fraction of cosets. Green’s upper bound, in the version cited in the finite-field lower-bound paper, is

$f:G\to[0,1]$2

where $f:G\to[0,1]$3 is a tower of twos of height $f:G\to[0,1]$4 (Hosseini et al., 2014).

The decisive point for later NIP regularity is quantitative: unrestricted arithmetic regularity is genuinely expensive. The lower bound of Hosseini, Lovett, Moshkovitz, and Shapira shows

$f:G\to[0,1]$5

improving Green’s earlier $f:G\to[0,1]$6 tower-height lower bound to $f:G\to[0,1]$7. In other words, even in $f:G\to[0,1]$8, tower-type dependence is essentially unavoidable in the unrestricted Fourier-analytic setting (Hosseini et al., 2014).

Subsequent lower-bound work sharpened this contrast. For strong arithmetic regularity partitions, wowzer-type growth is forced; for higher-order arithmetic regularity, tower-type growth remains necessary at least for the linear layer of a quadratic partition (Gladkova, 17 Oct 2025). This quantitative barrier is the main background against which NIP and stable arithmetic regularity are interpreted: the tame hypotheses are not cosmetic, but are the mechanism by which one escapes the worst-case tower and wowzer phenomena.

2. The finite-group NIP arithmetic regularity lemma

In the finite-group setting, “NIP” is treated combinatorially via VC-dimension. A subset $f:G\to[0,1]$9 is called $H\leq G$0-NIP when the collection of left translates of $H\leq G$1 has VC-dimension less than $H\leq G$2. The new proof of the finite-group NIP arithmetic regularity lemma works with the local parameter

$H\leq G$3

where $H\leq G$4 and $H\leq G$5 measure the VC-dimension of the families $H\leq G$6 and $H\leq G$7, respectively (Conant et al., 4 Sep 2025).

The theorem proved there applies to arbitrary finite groups. If $H\leq G$8 is finite, $H\leq G$9 is nonempty, $H+g$0, and $H+g$1, then there exists a Bohr neighborhood

$H+g$2

of complexity $H+g$3 such that two conclusions hold. First, there is a set $H+g$4 with $H+g$5 for which

$H+g$6

Second, if

$H+g$7

then

$H+g$8

Thus $H+g$9 is approximated, up to relative error $f|_{H+g}$0, by a bounded union of left translates of a bounded-complexity Bohr neighborhood, and all but at most $f|_{H+g}$1 left translates $f|_{H+g}$2 are almost homogeneous for $f|_{H+g}$3 (Conant et al., 4 Sep 2025).

The theorem is phrased in terms of stabilizers: $f|_{H+g}$4 with $f|_{H+g}$5. The inclusion $f|_{H+g}$6 is conceptually important: the structured object controlling $f|_{H+g}$7 lies inside an approximate symmetry set of $f|_{H+g}$8, not merely inside an unrelated ambient subgroup or progression (Conant et al., 4 Sep 2025).

This theorem recovers the earlier Conant–Pillay–Terry finite-group NIP regularity lemma, but with a different proof architecture. The new argument avoids Borel definability and generic compact domination, replacing them with VC-dimension estimates, stabilizer technology, and additive-combinatorial structure theorems (Conant et al., 4 Sep 2025).

3. Stable arithmetic regularity as the strongest tame regime

Stability is a strictly stronger hypothesis than NIP, and in arithmetic regularity it produces correspondingly stronger conclusions. For $f|_{H+g}$9, $H+g$0-stability means that $H+g$1 does not contain the additive half-graph pattern

$H+g$2

Under this hypothesis, Terry and Wolf proved a stable arithmetic regularity lemma that eliminates both of the main pathologies of Green’s theorem: tower-type codimension and exceptional cosets (Terry et al., 2017).

Precisely, for all $H+g$3, $H+g$4, and primes $H+g$5, there exists $H+g$6 such that if $H+g$7, $H+g$8, and $H+g$9 is $\epsilon$0-stable, then there is a subspace $\epsilon$1 of codimension

$\epsilon$2

such that for every $\epsilon$3, either

$\epsilon$4

Equivalently, every coset $\epsilon$5 has density in $\epsilon$6. There are no exceptional cosets, and the codimension bound is polynomial in the uniformity parameter for fixed $\epsilon$7 (Terry et al., 2017).

This is much stronger than classical Fourier-uniformity on most cosets. It implies that stable sets are approximable by unions of cosets of a bounded-codimension subspace, and the paper also gives robustness under small perturbation. The result is explicitly presented as an arithmetic analogue of the Malliaris–Shelah stable graph regularity lemma (Terry et al., 2017).

The stable side also admits an analytic extension beyond indicator sets. For amenable groups, a $\epsilon$8-stable function $\epsilon$9 is shown to be almost constant on all translates of a bounded-complexity $$\max_{\eta\notin H^\perp} |\widehat{f|_{H+g}}(\eta)|\le \epsilon,$$0-Bohr neighborhood: there exists $$\max_{\eta\notin H^\perp} |\widehat{f|_{H+g}}(\eta)|\le \epsilon,$$1 with

$$\max_{\eta\notin H^\perp} |\widehat{f|_{H+g}}(\eta)|\le \epsilon,$$2

such that $$\max_{\eta\notin H^\perp} |\widehat{f|_{H+g}}(\eta)|\le \epsilon,$$3 is $$\max_{\eta\notin H^\perp} |\widehat{f|_{H+g}}(\eta)|\le \epsilon,$$4-almost $$\max_{\eta\notin H^\perp} |\widehat{f|_{H+g}}(\eta)|\le \epsilon,$$5-constant on all translates of $$\max_{\eta\notin H^\perp} |\widehat{f|_{H+g}}(\eta)|\le \epsilon,$$6. In this formulation the structured object is no longer a subgroup factor but a unitary Bohr neighborhood, and the result is interpreted as approximate uniform Bohr-continuity for stable functions (Conant et al., 2024).

4. Definable NIP, distal, and hypergraph formulations

A second major line of development treats regularity in definable, measure-theoretic terms. For definable $$\max_{\eta\notin H^\perp} |\widehat{f|_{H+g}}(\eta)|\le \epsilon,$$7-ary hypergraph relations $$\max_{\eta\notin H^\perp} |\widehat{f|_{H+g}}(\eta)|\le \epsilon,$$8 in NIP structures, the regularity statement is not Fourier-analytic but partition-based: one seeks finite definable partitions of the ambient sorts so that outside a small exceptional family of cells, each product cell has density approximately $$\max_{\eta\notin H^\perp} |\widehat{f|_{H+g}}(\eta)|\le \epsilon,$$9 or approximately $H$0. In the general NIP case, if $H$1 is definable and the $H$2 are generically stable Keisler measures, there are partitions

$H$3

with

$H$4

such that the union of exceptional cells has product measure at most $H$5, and on every nonexceptional cell the $H$6-density is within $H$7 of either $H$8 or $H$9 (Chernikov et al., 2016).

This result sits between the stable and distal extremes. In the stable case, the exceptional set disappears: $\epsilon$0, so every cell is regular. In the distal case, the conclusion strengthens in a different direction: outside the exceptional set, cells are exactly homogeneous,

$\epsilon$1

and the formulas defining the cells depend only on the original relation, not on $\epsilon$2 (Chernikov et al., 2016).

A recent higher-arity extension makes this distal picture explicit for strongly $\epsilon$3-distal NIP theories. For a definable $\epsilon$4-ary relation $\epsilon$5, one obtains partitions in the co-directions $\epsilon$6 such that the total product measure of the cylinder-intersection cells that are not $\epsilon$7-homogeneous is less than $\epsilon$8. Under additional hypotheses such as definable Skolem functions, the same conclusion holds for all generically stable measures with uniformly definable partitions (Chernikov et al., 6 May 2026).

This strongly $\epsilon$9-distal theory also has a group-theoretic consequence of direct arithmetic relevance. If $f:G\to[0,1]$00 is a definable group and $f:G\to[0,1]$01 is a $f:G\to[0,1]$02-invariant generically stable measure, then $f:G\to[0,1]$03 is smooth. By the compact-domination criterion for smooth invariant measures, compact domination holds for definable fsg groups in strongly $f:G\to[0,1]$04-distal NIP theories, and hence an arithmetic version of the distal regularity lemma holds for definable groups exactly as in the earlier distal literature (Chernikov et al., 6 May 2026).

A common source of confusion is terminological. Definable NIP hypergraph regularity is a genuine regularity theory within the NIP world, but it is not the same theorem as the additive-combinatorial arithmetic regularity lemma of Green; its ambient objects, norms, and partition classes are different, even when the philosophical goal—structured approximation plus a small exceptional set—is closely related (Chernikov et al., 2016).

5. Proof mechanisms and structural ideas

The new finite-group proof organizes NIP arithmetic regularity around a single principle: bounded VC-dimension forces many approximate symmetries. The basic input is Haussler’s packing lemma. Applied to the translate family of $f:G\to[0,1]$05, it yields covering bounds by stabilizers, for example

$f:G\to[0,1]$06

and the analogous right-handed estimate. Thus, bounded VC-dimension implies that many group elements translate $f:G\to[0,1]$07 only slightly in symmetric difference (Conant et al., 4 Sep 2025).

The central technical advance is that one no longer needs an actual subgroup inside the stabilizer. Two lemmas show that arbitrary subsets of a stabilizer already suffice. If $f:G\to[0,1]$08, then

$f:G\to[0,1]$09

so most left translates of $f:G\to[0,1]$10 are nearly monochromatic for $f:G\to[0,1]$11. A second lemma, modeled on work of Sisask, shows that if one constructs a large subset $f:G\to[0,1]$12 and a right stabilizer set $f:G\to[0,1]$13 with

$f:G\to[0,1]$14

then $f:G\to[0,1]$15 already approximates $f:G\to[0,1]$16 in symmetric difference. This is the key step that allows Bohr neighborhoods and nilprogressions—rather than only subgroups—to act as regularity objects (Conant et al., 4 Sep 2025).

Once stabilizers are known to be large, additive-combinatorial structure theorems enter. In the finite-group dense setting, a noncommutative Bogolyubov theorem places a bounded-complexity Bohr neighborhood inside a bounded product of a large symmetric set. In the bounded-tripling setting, the Alon–Fox–Zhao trick first extracts a set of controlled tripling from the stabilizer, and then the Breuillard–Green–Tao approximate-group theorem supplies a coset nilprogression (Conant et al., 4 Sep 2025).

At a more abstract level, the common logic of these arguments is still the regularity logic of test families and refinement. The unified abstract regularity lemma of 2026 isolates this mechanism as follows: one chooses structured partitions, assigns local test-function families $f:G\to[0,1]$17, defines local irregularity by correlation against $f:G\to[0,1]$18, and refines whenever the average irregularity exceeds $f:G\to[0,1]$19. The energy increment

$f:G\to[0,1]$20

controls termination after at most $f:G\to[0,1]$21 steps. In Green’s arithmetic regularity lemma, the local tests are nontrivial characters on cosets, the structured partitions are coset partitions of subspaces, and refinement is Fourier refinement (Carenini et al., 4 Jun 2026). This suggests that later NIP variants differ less in global architecture than in the choice of admissible tests and structured factors.

6. Quantitative landscape, higher-order directions, and conceptual boundaries

The quantitative contrast among the main regimes can be summarized concisely.

Regime	Structured object	Typical conclusion
Classical Green regularity	Subspace $f:G\to[0,1]$22	Fourier-uniform on most cosets; tower bounds
Finite-group NIP	Bohr neighborhood $f:G\to[0,1]$23	$f:G\to[0,1]$24; most translates nearly homogeneous
Stable finite-field regularity	Bounded-codimension subspace $f:G\to[0,1]$25	Every coset almost empty or almost full
Definable NIP hypergraph regularity	Definable partitions	Nonexceptional cells have density near $f:G\to[0,1]$26 or $f:G\to[0,1]$27

The unrestricted lower bounds are now very sharp. For Green’s classical arithmetic regularity lemma, tower-type complexity of height linear in $f:G\to[0,1]$28 is necessary (Hosseini et al., 2014). For strong arithmetic regularity, wowzer-type growth is necessary, and in higher-order arithmetic regularity the linear layer of a quadratic partition still requires tower-type codimension (Gladkova, 17 Oct 2025). Against that background, the polynomial-size bounds for definable NIP hypergraph regularity and the polynomial-codimension/no-exceptional-coset theorem in the stable finite-field model are mathematically substantive rather than cosmetic improvements (Chernikov et al., 2016, Terry et al., 2017).

Higher-order analogues indicate that ordinary NIP is not the end of the story. Terry and Wolf define higher-arity tameness notions such as $f:G\to[0,1]$29-dimension and $f:G\to[0,1]$30, and show that if $f:G\to[0,1]$31 has bounded $f:G\to[0,1]$32-dimension then $f:G\to[0,1]$33 is approximable by a union of atoms of a bounded-complexity high-rank quadratic factor, up to a small proportion of exceptional atoms. If $f:G\to[0,1]$34 omits $f:G\to[0,1]$35-$f:G\to[0,1]$36, the exceptional region can be confined to a small number of linear atoms, yielding what the paper calls linear error (Terry et al., 2021). This suggests that genuinely quadratic regularity is naturally governed by higher-arity tameness rather than by ordinary binary NIP alone.

Several distinctions are therefore essential. The NIP arithmetic regularity lemma is not a single theorem but a cluster of results across finite groups, finite-field models, and definable settings. Stable arithmetic regularity is a special case inside NIP, with stronger conclusions than are presently known in general. Definable NIP hypergraph regularity is adjacent to, but not identical with, additive-combinatorial arithmetic regularity. And the persistent tower and wowzer lower bounds in the unrestricted setting explain why model-theoretic tameness assumptions are central: they are precisely what allows arithmetic regularity to become structurally informative and quantitatively manageable (Conant et al., 4 Sep 2025, Chernikov et al., 6 May 2026).