An arithmetic algebraic regularity lemma

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>0, any finite field F, and any definable group (G,·) in F and definable subset D⊂eq G, each of complexity at most M, there is a normal definable subgroup H≤slant G, of index and complexity OM(1), such that the following holds: for any cosets V,W of H, the bipartite graph (V,W,xy-1∈ D) is OM(|F|-1/2)-quasirandom. Various analogous regularity conditions follow; for example, for any g∈ G, the Fourier coefficient ||1H Dg(π)||op is OM(|F|-1/8) for every non-trivial irreducible representation π of H.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…