Nearly-polynomial inverse theorem for the U^d norm in degree d+1
Pith reviewed 2026-05-15 09:38 UTC · model grok-4.3
The pith
Functions with large Gowers U^d norm correlate with degree d+1 polynomials at nearly polynomial rates over finite fields.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Over a finite field F of characteristic larger than some function of d, any function f whose Gowers U^d norm is bounded below by delta correlates with a polynomial P of degree d+1 to within delta raised to a nearly polynomial power in 1/delta. The same conclusion holds, with the same type of bound, for homogeneous polynomials of degree less than 2d.
What carries the argument
Refined polynomial decomposition that records correlation with lower-degree polynomials more precisely than classical decompositions, paired with a new correlation lemma stronger than earlier versions in the literature.
If this is right
- Quantitative inverse theorems for U^d norms become available up to degree d+1 with dependence only nearly polynomial in 1/delta.
- The new correlation lemma supplies an alternative proof of the fully polynomial inverse theorem for the degree-d case.
- Nearly polynomial bounds now hold for the inverse problem restricted to homogeneous polynomials of every degree less than 2d.
Where Pith is reading between the lines
- The refined decomposition may allow similar inverse results to be proved for norms of still higher order.
- Applications that invoke inverse theorems for Gowers norms, such as quantitative versions of Szemeredi-type theorems over finite fields, could inherit the improved dependence.
- One could search for examples showing that the nearly polynomial exponent is sharp for degree d+1.
Load-bearing premise
The finite field must have characteristic bounded below by a function of the degree d.
What would settle it
An explicit function over a small-characteristic field, such as characteristic 2 or 3, whose U^d norm is bounded away from zero yet whose correlation with any degree-d+1 polynomial decays faster than any nearly polynomial function of the norm size.
read the original abstract
We prove a nearly polynomial inverse theorem for the Gowers $U^d$ norm, over finite fields of non-small characteristic, for polynomials of degree $d+1$. The case of degree $d$ was very recently settled by Mili\'{c}evi\'{c} and Randelovi\'{c} with a fully polynomial bound. We moreover provide a nearly polynomial inverse theorem for homogeneous polynomials of any degree smaller than $2d$. Our methods may be of independent interest, and include a refined notion of polynomial decomposition that captures correlation with polynomials of lower degree than classical notions do, and a new correlation lemma that improves upon similar lemmas in the literature. Additionally, we illustrate the usefulness of the new correlation lemma by using it to give an alternative proof for the aforementioned result of Mili\'{c}evi\'{c} and Randelovi\'{c}.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript proves a nearly-polynomial inverse theorem for the Gowers U^d norm over finite fields of non-small characteristic: a function with large U^d norm correlates with a degree-(d+1) polynomial, with the correlation bound nearly polynomial in the inverse of the norm. It also establishes a nearly-polynomial inverse theorem for homogeneous polynomials of any degree strictly less than 2d. The argument relies on a refined polynomial decomposition that tracks lower-degree correlations more precisely than classical versions, together with a new correlation lemma; the same tools yield an alternative proof of the fully-polynomial inverse theorem for the degree-d case recently obtained by Milićević and Randelović.
Significance. If the quantitative estimates hold, the result advances the program of obtaining polynomial-type bounds in higher-order Fourier analysis over finite fields. The nearly-polynomial dependence improves on earlier exponential-type bounds, the refined decomposition and correlation lemma appear reusable, and the alternative proof of the degree-d result illustrates the methods' strength. The restriction to non-small characteristic is stated explicitly and is consistent with known limitations of the inverse theorem.
minor comments (3)
- The introduction should state the precise lower bound on the field characteristic (as a function of d) that is required for the main theorems; the phrase 'non-small' is used in the abstract and §1 but the explicit threshold appears only later.
- In the statement of the main inverse theorem (presumably Theorem 1.1 or 1.2), the dependence of the 'nearly-polynomial' bound on d should be written explicitly rather than left implicit in the O-notation.
- The paper would benefit from a short comparison table or paragraph contrasting the new nearly-polynomial bound with the fully-polynomial bound of Milićević–Randelović and with earlier exponential bounds.
Simulated Author's Rebuttal
We thank the referee for their positive and accurate summary of our manuscript, as well as for recommending minor revision. We are pleased that the significance of the nearly-polynomial inverse theorems, the refined polynomial decomposition, and the alternative proof of the Milićević–Randelović result have been recognized.
Circularity Check
No significant circularity
full rationale
The paper's central claims rest on new technical contributions: a refined polynomial decomposition that captures lower-degree correlations more precisely than prior notions, and a new correlation lemma that strengthens existing results in the literature. These are used to establish the nearly-polynomial inverse theorem for the U^d norm in degree d+1 (and for homogeneous polynomials of degree <2d) over finite fields of non-small characteristic. The work also supplies an alternative proof of the fully-polynomial degree-d result of Milićević–Randelović, but this is presented as an illustration of the new lemma rather than a load-bearing step. No equation reduces a claimed bound to a fitted parameter by construction, no uniqueness theorem is imported from the authors' own prior work, and the cited prior result is by independent authors. The derivation chain therefore remains self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Gowers U^d norms are well-defined and satisfy the usual monotonicity and inverse properties over finite fields of non-small characteristic
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.