Papers
Topics
Authors
Recent
Search
2000 character limit reached

Higher-Order Fourier Analysis

Updated 12 July 2026
  • Higher-order Fourier analysis is a framework that extends classical Fourier methods to reveal complex correlations using Gowers norms and algebraic objects like nilsequences.
  • It integrates concepts from additive combinatorics, ergodic theory, and number theory, applying inverse theorems and regularity lemmas to decompose and understand function behavior.
  • Recent developments extend these methods to quantum information and algorithmic testing, showcasing the framework’s broad interdisciplinary applications.

Higher-order Fourier analysis is the study of structured-versus-random dichotomies for functions on finite abelian groups and compact abelian groups beyond the classical first-order dichotomy captured by the usual Fourier transform. Initiated by Gowers and developed through inverse theorems, regularity lemmas, nilspace theory, and polynomial phase methods, it uses the Gowers norms UkU^k to detect higher-order correlations and explains why a large Uk+1U^{k+1}-norm is governed by algebraic objects such as polynomial phases of degree kk, nilsequences, or nilspace polynomials (Szegedy, 2012, Candela et al., 21 Jan 2025). The subject grew out of Gowers’s Fourier-analytic proof of Szemerédi’s theorem and now interfaces with additive combinatorics, ergodic theory, number theory, theoretical computer science, and quantum information (Labib, 2021).

1. Classical Fourier analysis and the higher-order shift

Classical Fourier analysis decomposes a bounded function on an abelian group into characters, and in this regime the U2U^2-norm is already Fourier-theoretic: for finite abelian groups one has fU24=χG^f^(χ)4\|f\|_{U^2}^4=\sum_{\chi\in\widehat G}|\widehat f(\chi)|^4 (Candela et al., 21 Jan 2025). Higher-order Fourier analysis begins where this description ceases to be adequate, namely when one seeks to control configurations and correlations invisible to linear characters but still encoded by iterated multiplicative differences and cube averages (Szegedy, 2012).

The central qualitative principle is that higher-order structure is not exhausted by periodicity or linear bias. In the formulations developed over finite fields, compact abelian groups, and nilspaces, the relevant structured objects include additive or non-classical polynomial phases, nilsequences, and nilspace polynomials (Bhattacharyya et al., 2015, Szegedy, 2012). In the quadratic case this shift is already substantial: the inverse problem for U3U^3 leads to quadratic phases and, in one algebraic formulation, to quadratic nil-morphisms into 2-step nil-manifolds (Szegedy, 2010).

This change of viewpoint was driven by additive-combinatorial problems. The framework is described as lying at the heart of modern additive combinatorics and underpinning Szemerédi’s theorem, while later work extended it to list decoding, algorithmic decomposition, testing, multiplicative functions, spherical configuration problems, and quantum-information questions (Candela et al., 21 Jan 2025, Bhattacharyya et al., 2015).

2. Uniformity norms, inverse theorems, and regularity

For a bounded function f:KnCf:\mathbb K^n\to\mathbb C on a finite field K\mathbb K, the Gowers norm is defined by

Ud(f)2d=Ex,h1,,hdKnε{0,1}dCεf(x+εh),U^d(f)^{2^d} = \mathbb E_{x,h_1,\dots,h_d\in\mathbb K^n} \prod_{\varepsilon\in\{0,1\}^d} C^{|\varepsilon|} f(x+\varepsilon\cdot h),

where CC denotes complex conjugation and Uk+1U^{k+1}0 (Bhattacharyya et al., 2015). On compact abelian groups the same norm is expressed via iterated differences,

Uk+1U^{k+1}1

with Uk+1U^{k+1}2 (Szegedy, 2012).

The inverse problem asks what large Uk+1U^{k+1}3 means structurally. Over finite fields, Tao–Ziegler’s inverse theorem states that if Uk+1U^{k+1}4 and Uk+1U^{k+1}5, then Uk+1U^{k+1}6 correlates with an additive polynomial Uk+1U^{k+1}7 of degree at most Uk+1U^{k+1}8, in the sense that Uk+1U^{k+1}9 (Bhattacharyya et al., 2015). In the prime-field setting, when kk0 the correlating object may be taken to be a classical polynomial of degree at most kk1, but in low characteristic kk2 one must allow non-classical phase-polynomials taking values in kk3 (Candela et al., 2021). A recurrent technical misconception is therefore that classical polynomial phases always suffice; the low-characteristic theory explicitly requires non-classical phases (Candela et al., 2021).

Regularity theory provides the complementary decomposition statement. In one finite-field formulation, every bounded kk4 can be decomposed as

kk5

where kk6 is measurable with respect to a polynomial factor of bounded complexity and degree, kk7 has small kk8-norm, and kk9 has small U2U^20-norm (Bhattacharyya et al., 2015). In the compact-group and ultraproduct setting, one obtains a nilspace-polynomial regularity lemma and an exact decomposition in which the uniform component has vanishing U2U^21-norm on the limiting object (Szegedy, 2012). The subject’s basic analytic architecture is thus the pairing of an inverse theorem with a regularity or structure theorem.

3. Structured objects: additive polynomials, nilspaces, and nilsequences

One finite-field language for higher-order structure is the language of additive polynomials. A function U2U^22 has additive degree at most U2U^23 if

U2U^24

where U2U^25 (Bhattacharyya et al., 2015). Classical polynomial phases are special cases: U2U^26 for a U2U^27-polynomial U2U^28 of total degree at most U2U^29 (Bhattacharyya et al., 2015). In low characteristic these sit inside the broader class of additive, or non-classical, polynomials (Bhattacharyya et al., 2015).

A more geometric and global language is that of nilspaces. A compact fU24=χG^f^(χ)4\|f\|_{U^2}^4=\sum_{\chi\in\widehat G}|\widehat f(\chi)|^40-step nilspace is a compact space endowed with cube sets fU24=χG^f^(χ)4\|f\|_{U^2}^4=\sum_{\chi\in\widehat G}|\widehat f(\chi)|^41 satisfying composition, ergodicity, and fU24=χG^f^(χ)4\|f\|_{U^2}^4=\sum_{\chi\in\widehat G}|\widehat f(\chi)|^42-uniqueness, and every compact fU24=χG^f^(χ)4\|f\|_{U^2}^4=\sum_{\chi\in\widehat G}|\widehat f(\chi)|^43-step nilspace is an inverse limit of finite-dimensional ones built as iterated abelian bundles over lower-step factors (Szegedy, 2012). In this formulation, structured functions are nilspace-polynomials: compositions fU24=χG^f^(χ)4\|f\|_{U^2}^4=\sum_{\chi\in\widehat G}|\widehat f(\chi)|^44 where fU24=χG^f^(χ)4\|f\|_{U^2}^4=\sum_{\chi\in\widehat G}|\widehat f(\chi)|^45 is a continuous morphism into a compact fU24=χG^f^(χ)4\|f\|_{U^2}^4=\sum_{\chi\in\widehat G}|\widehat f(\chi)|^46-step nilspace and fU24=χG^f^(χ)4\|f\|_{U^2}^4=\sum_{\chi\in\widehat G}|\widehat f(\chi)|^47 is bounded and Lipschitz (Szegedy, 2012). This gives an algebraic interpretation of higher-order Fourier analysis in terms of continuous morphisms between compact fU24=χG^f^(χ)4\|f\|_{U^2}^4=\sum_{\chi\in\widehat G}|\widehat f(\chi)|^48-step nilspaces (Szegedy, 2012).

In the characteristic-fU24=χG^f^(χ)4\|f\|_{U^2}^4=\sum_{\chi\in\widehat G}|\widehat f(\chi)|^49 setting, Candela, González-Sánchez, and Szegedy introduced U3U^30-homogeneous nilspaces as the nilspace class adapted to vector spaces over U3U^31 (Candela et al., 2021). For a filtered group U3U^32, the associated group nilspace is U3U^33-homogeneous if and only if for all U3U^34 and all U3U^35, one has U3U^36 (Candela et al., 2021). Every finite U3U^37-homogeneous nilspace is the image, under a nilspace fibration, of a member of a simple family of filtered finite abelian U3U^38-groups, and this structure theorem yields a new proof of the Tao–Ziegler inverse theorem for Gowers norms on U3U^39 (Candela et al., 2021).

At the quadratic level, Szegedy’s algebraic theory describes structure through quadratic nil-morphisms into 2-step nil-manifolds. In that setting, a bounded function on a finite abelian group decomposes as

f:KnCf:\mathbb K^n\to\mathbb C0

where f:KnCf:\mathbb K^n\to\mathbb C1 is a quadratic nil-morphism, f:KnCf:\mathbb K^n\to\mathbb C2 is a bounded-complexity continuous function on a 2-step nil-manifold, f:KnCf:\mathbb K^n\to\mathbb C3 is small, and f:KnCf:\mathbb K^n\to\mathbb C4 is small in f:KnCf:\mathbb K^n\to\mathbb C5 (Szegedy, 2010). This provides a quadratic inverse theorem for f:KnCf:\mathbb K^n\to\mathbb C6 in which correlation is with a nil-manifold model rather than merely with an explicit phase function (Szegedy, 2010).

4. Extensions of the ambient domain

Although much of the early development was over prime fields, the framework extends to arbitrary finite fields. For f:KnCf:\mathbb K^n\to\mathbb C7 one fixes an f:KnCf:\mathbb K^n\to\mathbb C8-basis and uses the trace map f:KnCf:\mathbb K^n\to\mathbb C9 to pass between K\mathbb K0-valued functions and torus-valued phases (Bhattacharyya et al., 2015). Bhattacharyya and Bhowmick showed that the inverse theorem, polynomial regularity lemma, counting and equidistribution machinery, and applications to affine-invariant properties can be transported to general finite fields, with new ingredients including equidistribution on K\mathbb K1-affine subspaces and preservation of locally characterized properties (Bhattacharyya et al., 2015). A key obstruction in nonprime fields is that the naive derivative argument fails: for example, K\mathbb K2 has trivial second derivatives but degree K\mathbb K3 (Bhattacharyya et al., 2015).

The theory also has a compact-group and ultraproduct form. In this setting one defines higher-order K\mathbb K4-algebras K\mathbb K5 on an ultraproduct group, proves that K\mathbb K6 is a norm on K\mathbb K7, and shows that separable sub-K\mathbb K8-algebras of K\mathbb K9 are generated by continuous nilspace factors (Szegedy, 2012). This exact limit theory supplies inverse theorems, regularity lemmas, and a limit theory for bounded functions on abelian groups analogous in spirit to graph limit theory (Szegedy, 2012).

A geometric extension replaces cubes in the ambient vector space by cubes constrained to lie on a quadratic variety. In the spherical finite-field setting, for Ud(f)2d=Ex,h1,,hdKnε{0,1}dCεf(x+εh),U^d(f)^{2^d} = \mathbb E_{x,h_1,\dots,h_d\in\mathbb K^n} \prod_{\varepsilon\in\{0,1\}^d} C^{|\varepsilon|} f(x+\varepsilon\cdot h),0 one defines local Gowers norms by averaging only over Gowers cubes contained in Ud(f)2d=Ex,h1,,hdKnε{0,1}dCεf(x+εh),U^d(f)^{2^d} = \mathbb E_{x,h_1,\dots,h_d\in\mathbb K^n} \prod_{\varepsilon\in\{0,1\}^d} C^{|\varepsilon|} f(x+\varepsilon\cdot h),1 (Sun, 2023). Sun proved a quantitative equidistribution theorem for polynomial sequences on nilmanifolds averaged along spheres: if Ud(f)2d=Ex,h1,,hdKnε{0,1}dCεf(x+εh),U^d(f)^{2^d} = \mathbb E_{x,h_1,\dots,h_d\in\mathbb K^n} \prod_{\varepsilon\in\{0,1\}^d} C^{|\varepsilon|} f(x+\varepsilon\cdot h),2 is not Ud(f)2d=Ex,h1,,hdKnε{0,1}dCεf(x+εh),U^d(f)^{2^d} = \mathbb E_{x,h_1,\dots,h_d\in\mathbb K^n} \prod_{\varepsilon\in\{0,1\}^d} C^{|\varepsilon|} f(x+\varepsilon\cdot h),3-equidistributed on the lifted sphere, then there exists a nontrivial horizontal character Ud(f)2d=Ex,h1,,hdKnε{0,1}dCεf(x+εh),U^d(f)^{2^d} = \mathbb E_{x,h_1,\dots,h_d\in\mathbb K^n} \prod_{\varepsilon\in\{0,1\}^d} C^{|\varepsilon|} f(x+\varepsilon\cdot h),4 such that Ud(f)2d=Ex,h1,,hdKnε{0,1}dCεf(x+εh),U^d(f)^{2^d} = \mathbb E_{x,h_1,\dots,h_d\in\mathbb K^n} \prod_{\varepsilon\in\{0,1\}^d} C^{|\varepsilon|} f(x+\varepsilon\cdot h),5 is constant modulo Ud(f)2d=Ex,h1,,hdKnε{0,1}dCεf(x+εh),U^d(f)^{2^d} = \mathbb E_{x,h_1,\dots,h_d\in\mathbb K^n} \prod_{\varepsilon\in\{0,1\}^d} C^{|\varepsilon|} f(x+\varepsilon\cdot h),6 on that sphere (Sun, 2023). The corresponding spherical inverse theorem asserts that if the Ud(f)2d=Ex,h1,,hdKnε{0,1}dCεf(x+εh),U^d(f)^{2^d} = \mathbb E_{x,h_1,\dots,h_d\in\mathbb K^n} \prod_{\varepsilon\in\{0,1\}^d} C^{|\varepsilon|} f(x+\varepsilon\cdot h),7-th spherical Gowers norm is at least Ud(f)2d=Ex,h1,,hdKnε{0,1}dCεf(x+εh),U^d(f)^{2^d} = \mathbb E_{x,h_1,\dots,h_d\in\mathbb K^n} \prod_{\varepsilon\in\{0,1\}^d} C^{|\varepsilon|} f(x+\varepsilon\cdot h),8 and Ud(f)2d=Ex,h1,,hdKnε{0,1}dCεf(x+εh),U^d(f)^{2^d} = \mathbb E_{x,h_1,\dots,h_d\in\mathbb K^n} \prod_{\varepsilon\in\{0,1\}^d} C^{|\varepsilon|} f(x+\varepsilon\cdot h),9, then the function correlates on the sphere with a CC0-periodic CC1-step nilsequence of bounded complexity (Sun, 2023).

Higher-order notions also extend beyond functions to singular measures on CC2 or CC3. Carnovale introduced a measure CC4 and a uniformity norm CC5 for measures, together with the CC6th-order Fourier dimension, defined through decay of the Fourier transform of the higher-order difference measure (Carnovale, 2013). The main result is that sufficiently strong CC7th-order Fourier decay controls the rate at which CC8, where CC9 is an approximation to Uk+1U^{k+1}00 (Carnovale, 2013). This shows that higher-order Fourier analysis can register interactions among frequency components not visible from ordinary Fourier decay or Uk+1U^{k+1}01 information alone (Carnovale, 2013).

5. Applications across combinatorics, computer science, number theory, and quantum information

In theoretical computer science, the general-field extension of higher-order Fourier analysis yields three applications stated in uniform finite-field form. For any fixed finite field Uk+1U^{k+1}02, the list decoding radius of the generalized Reed–Muller code equals the minimum distance of the code; for any fixed finite field Uk+1U^{k+1}03, there is a deterministic polynomial-time algorithm, running in time Uk+1U^{k+1}04 up to factors depending only on Uk+1U^{k+1}05, that decides whether a degree-Uk+1U^{k+1}06 polynomial is Uk+1U^{k+1}07-structured and finds such a decomposition if it exists; and every Uk+1U^{k+1}08-lightly locally characterized affine-invariant property admits a proximity-oblivious one-sided tester making Uk+1U^{k+1}09 queries (Bhattacharyya et al., 2015). These results are all derived from the same package of inverse theorems, regularity, equidistribution, and degree-preservation (Bhattacharyya et al., 2015).

In number theory, Frantzikinakis and Host proved a structure theorem for bounded multiplicative functions: every such function decomposes into an approximately periodic term and another with small Gowers uniformity norm of arbitrary degree, with an additional small Uk+1U^{k+1}10 error after refinement (Frantzikinakis et al., 2014). They used this to characterize when the Gowers norms of a bounded multiplicative function are zero, to prove asymptotic orthogonality to irrational nilsequences, to establish Chowla-type zero-mean results for certain quadratic forms in two variables, and to obtain partition-regularity results for homogeneous quadratic equations in three variables, including Uk+1U^{k+1}11 and Uk+1U^{k+1}12 (Frantzikinakis et al., 2014).

In quantum information, stabilizer states over prime-dimensional qudits can be written exactly as quadratic phase functions on affine subspaces. Concretely, if Uk+1U^{k+1}13 is an Uk+1U^{k+1}14-qudit stabilizer state over Uk+1U^{k+1}15, then there exist an affine subspace Uk+1U^{k+1}16 and a quadratic polynomial Uk+1U^{k+1}17 such that

Uk+1U^{k+1}18

and in the qubit case one similarly obtains a Uk+1U^{k+1}19-valued quadratic form on an affine subspace (Labib, 2021). This identifies stabilizer states with nonclassical quadratic phase functions on affine subspaces and permits explicit use of higher-order Fourier-analytic tools. One consequence is that for any prime Uk+1U^{k+1}20, the Uk+1U^{k+1}21-qudit magic state Uk+1U^{k+1}22 has stabilizer rank Uk+1U^{k+1}23 (Labib, 2021).

The spherical program applies higher-order Fourier analysis to geometric Ramsey theory over finite fields. For a spherical configuration Uk+1U^{k+1}24 of complexity at most Uk+1U^{k+1}25, with Uk+1U^{k+1}26 and Uk+1U^{k+1}27 sufficiently large with respect to Uk+1U^{k+1}28 and Uk+1U^{k+1}29, Sun proved that every set Uk+1U^{k+1}30 with Uk+1U^{k+1}31 contains at least Uk+1U^{k+1}32 congruent copies of Uk+1U^{k+1}33 (Sun, 2023). The novelty stated for this argument is that it avoids the use of harmonic analysis and replaces it by the theory of spherical higher-order Fourier analysis developed in the preceding parts of the series (Sun, 2023).

Algorithmic and spectral developments have also appeared inside the subject itself. A recent spectral framework turns quadratic higher-order Fourier analysis into an eigenvalue problem by applying invariant operators to the matrix Uk+1U^{k+1}34 and studying the spectrum of the resulting Hermitian operator (Candela et al., 21 Jan 2025). In the quadratic case this yields a spectral inverse theorem, a spectral regularity theorem, and an explicit Uk+1U^{k+1}35-regularization algorithm with total time Uk+1U^{k+1}36 (Candela et al., 21 Jan 2025).

6. Quantum higher-order Fourier analysis and current directions

A noncommutative extension, termed quantum higher-order Fourier analysis, replaces functions on a finite abelian group by linear operators on an Uk+1U^{k+1}37-qudit Hilbert space, ordinary translations by conjugation with Weyl operators, and Gowers norms by quantum uniformity measures Uk+1U^{k+1}38 (Bu et al., 21 Aug 2025). If Uk+1U^{k+1}39 is diagonal in the computational basis with diagonal entries Uk+1U^{k+1}40, then Uk+1U^{k+1}41, so the classical theory is recovered on diagonal operators (Bu et al., 21 Aug 2025). The principal analytic theorem is a characterization of the Clifford hierarchy:

Uk+1U^{k+1}42

giving a necessary and sufficient analytic condition for membership in the Uk+1U^{k+1}43th level (Bu et al., 21 Aug 2025). The same framework yields overlap bounds with lower hierarchy levels and a property-testing interpretation based on sampling phase-space derivatives (Bu et al., 21 Aug 2025).

Several present directions follow directly from the current literature. The stabilizer-rank work suggests studying more refined measures of non-stabilizerness via higher Gowers Uk+1U^{k+1}44 norms and inverse theorems for cubic or quartic phases, and it raises the possibility of super-linear or even exponential lower bounds on decompositions into full-space stabilizer states through stronger inverse theorems for Uk+1U^{k+1}45 with Uk+1U^{k+1}46 (Labib, 2021). The quantum higher-order Fourier-analysis framework, in turn, formulates a quantum analogue of the classical inverse theorem: if Uk+1U^{k+1}47, then one conjectures that Uk+1U^{k+1}48 overlaps with some element of Uk+1U^{k+1}49 by an amount bounded below by Uk+1U^{k+1}50 (Bu et al., 21 Aug 2025).

The cumulative picture is that higher-order Fourier analysis is not a single formalism but a family of tightly related ones: additive-polynomial over finite fields, nilspace and nilmanifold on compact or ergodic systems, local and spherical on quadratic varieties, spectral in algorithmic quadratic analysis, and noncommutative in the quantum setting (Szegedy, 2012, Candela et al., 2021, Sun, 2023, Bu et al., 21 Aug 2025). A plausible implication is that the subject’s central invariant is less the ambient domain than the existence of an appropriate notion of higher-order derivative, cube, and structured phase against which uniformity can be tested.

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Higher-Order Fourier Analysis.