An improved non-linear Roth-type theorem in finite fields
Pith reviewed 2026-05-07 08:26 UTC · model grok-4.3
The pith
Any set of size at least C |F|^{5/6} in a finite field of odd characteristic contains a nontrivial quadratic progression x, x+y, x+y².
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Any subset A of a finite field F of odd characteristic with |A| ≥ C |F|^{5/6} contains a nontrivial quadratic progression (x, x+y, x+y²) for some y ≠ 0. For prime fields this improves the previous best exponent of 7/8. The proof proceeds via density increment or Fourier analysis that reduces the detection of the progression to bounding associated exponential sums, which are estimated using only one-variable Weil-type bounds. Over certain non-prime finite fields the paper constructs quadratic-progression-free sets of size c |F|^{2/3}.
What carries the argument
Density increment argument that reduces quadratic-progression detection to exponential sums controlled by one-variable Weil-type estimates.
If this is right
- The quantitative threshold guaranteeing a quadratic progression improves from 7/8 to 5/6 when the field is prime.
- Only one-variable Weil estimates are required, avoiding the need for Katz's multivariate exponential-sum bounds.
- In some non-prime fields the largest sets without quadratic progressions have size at least c |F|^{2/3}, so the true threshold lies between 2/3 and 5/6.
- The same density-increment-plus-Weil-estimates approach may apply to other nonlinear configurations in finite fields.
Where Pith is reading between the lines
- The gap between the |F|^{2/3} construction and the 5/6 theorem indicates that the exponent can likely be improved further with more refined analysis.
- Analogous statements for higher-degree polynomial progressions or in higher-dimensional finite vector spaces may follow from similar exponential-sum control.
- The result connects to questions about the maximal size of sets avoiding polynomial configurations, with possible implications for pseudorandomness and coding theory over finite fields.
Load-bearing premise
One-variable Weil-type estimates suffice to bound the exponential sums that arise when density increment or Fourier analysis is used to detect the quadratic progression, and the field has odd characteristic.
What would settle it
An explicit subset A of a large prime field F with |A| > C |F|^{5/6} containing no nontrivial (x, x+y, x+y²) with y ≠ 0 would disprove the main claim.
read the original abstract
Let $F$ be a finite field of odd characteristic. We prove that any set $A\subset F$ with $|A|\geq C|F|^{5/6}$ contains a nontrivial quadratic progression $(x, x+y, x+y^2), y\neq 0.$ For prime fields, this improves the previous best-known exponent of $7/8$, due to Kavrut and Wu. Unlike some of the previous papers, which rely on Katz's deep multivariate exponential-sum estimates, our argument uses only one-variable Weil-type estimates. We also construct, over certain non-prime finite fields, progression-free sets of size $c|F|^{2/3}$. A key idea in the proof was suggested to the author by ChatGPT 5.5.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proves that any subset A of a finite field F of odd characteristic with |A| ≥ C |F|^{5/6} contains a nontrivial quadratic progression (x, x+y, x+y²) with y ≠ 0. For prime fields this improves the prior exponent 7/8 due to Kavrut and Wu. The argument relies exclusively on one-variable Weil-type estimates rather than Katz's multivariate exponential-sum bounds. The paper also constructs quadratic-progression-free sets of size c |F|^{2/3} over certain non-prime finite fields.
Significance. If correct, the result improves the quantitative threshold for a non-linear Roth theorem in finite fields while simplifying the analytic tools required. The restriction to one-variable Weil bounds makes the proof more elementary and potentially easier to generalize. The matching lower-bound construction in selected non-prime fields shows that 5/6 cannot be improved uniformly across all odd-characteristic fields and clarifies the distinction between prime and composite cases. The work therefore refines the landscape of additive-combinatorial results over finite fields.
major comments (2)
- [§4] §4, the exponential-sum estimate (around Eq. (4.5)): the reduction from the quadratic-progression count to a one-variable character sum must be verified explicitly; the paper should confirm that the relevant polynomial remains of degree 2 after the change of variables and that the Weil bound applies directly without invoking any auxiliary multivariate estimates.
- [§5] §5, the progression-free construction: the size c |F|^{2/3} is stated for certain non-prime fields; the precise algebraic condition on F (e.g., existence of a subfield of index 3) and the verification that the constructed set indeed avoids all solutions to x + y² = x + y with y ≠ 0 should be written out in full detail.
minor comments (3)
- [Abstract] Abstract: the sentence crediting ChatGPT 5.5 for a key idea is atypical in a mathematical abstract and would be more appropriately placed in the acknowledgments.
- [Introduction] Introduction: a brief one-sentence recall of the precise statement of the Kavrut–Wu 7/8 result would help readers compare the new exponent directly.
- [Notation] Notation section: the term 'nontrivial' quadratic progression is defined by y ≠ 0, but it should be stated explicitly whether any further degeneracy (e.g., y = 0 or x in a subfield) is excluded.
Simulated Author's Rebuttal
We thank the referee for the careful reading, positive assessment, and recommendation of minor revision. The comments identify places where greater explicitness will improve the manuscript. We address each major comment below.
read point-by-point responses
-
Referee: [§4] §4, the exponential-sum estimate (around Eq. (4.5)): the reduction from the quadratic-progression count to a one-variable character sum must be verified explicitly; the paper should confirm that the relevant polynomial remains of degree 2 after the change of variables and that the Weil bound applies directly without invoking any auxiliary multivariate estimates.
Authors: We agree that the reduction step merits an explicit verification. Although the manuscript indicates that only one-variable Weil estimates are used, the change-of-variables computation and the confirmation that the resulting polynomial has degree exactly 2 (with nonzero leading coefficient in odd characteristic) are only sketched. In the revised version we will insert, immediately after Equation (4.5), a self-contained paragraph that carries out the substitution, verifies the degree, and invokes the standard one-variable Weil bound directly. No multivariate estimates are required or used. revision: yes
-
Referee: [§5] §5, the progression-free construction: the size c |F|^{2/3} is stated for certain non-prime fields; the precise algebraic condition on F (e.g., existence of a subfield of index 3) and the verification that the constructed set indeed avoids all solutions to x + y² = x + y with y ≠ 0 should be written out in full detail.
Authors: We accept that the construction section is insufficiently detailed. The sets of size c |F|^{2/3} are built when F admits a subfield of index 3. In the revision we will state this condition explicitly (F is a cubic extension of a subfield K with |F| = |K|^3 and char F odd) and give the precise definition of the set A. We will then supply a complete, self-contained argument showing that A contains no x and y ≠ 0 such that x, x + y, x + y² all lie in A, using the norm or trace properties of the cubic extension to reach a contradiction. revision: yes
Circularity Check
No circularity; proof relies on external standard Weil bounds
full rationale
The derivation proceeds via a density-increment or Fourier-analytic argument that invokes one-variable Weil-type estimates on exponential sums; these bounds are standard results from algebraic geometry and are not derived, fitted, or redefined inside the paper. No self-definitional steps, fitted inputs renamed as predictions, or load-bearing self-citations appear in the central argument. The claimed exponent improvement follows directly from applying these external bounds to the relevant sums, and the separate construction of progression-free sets over non-prime fields is independent. The paper is therefore self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Finite fields of odd characteristic admit the one-variable Weil estimates needed to control the exponential sums in the argument.
Reference graph
Works this paper leans on
-
[1]
J. Bourgain and M. Chang,Nonlinear Roth type theorems in finite fields, Israel Journal of Mathematics 221(2) (2017): 853-867
work page 2017
-
[2]
T. Cochrane and C. Pinner,Using Stepanov’s method for exponential sums involving rational functions, J. Number Theory116(2006), no. 2, 270–292
work page 2006
-
[3]
D. Dong, X. Li, and W. Sawin,Improved estimates for polynomial Roth type theorems in finite fields, Journal d’Analyse Math´ ematique, 141(2), 689-705
-
[4]
R. Han, M. Lacey, and F. Yang,A polynomial Roth theorem for corners in finite fields, Mathematika 67, no. 4 (2021): 885-896
work page 2021
-
[5]
R. Lidl and H. Niederreiter,Finite fields, No. 20. Cambridge University Press, 1997
work page 1997
-
[6]
N. Kavrut and S. Wu,A bilinear estimate inF p, arXiv preprint arXiv:2401.07925
-
[7]
B. Kuca,True complexity of polynomial progressions in finite fields, Proceedings of the Edinburgh Mathematical Society 64, no. 3 (2021): 448-500
work page 2021
-
[8]
Perel’muter,Estimate of a sum along an algebraic curve, Mat
G. Perel’muter,Estimate of a sum along an algebraic curve, Mat. Zametki 5 (1969) 373–380
work page 1969
-
[9]
Peluse,On the polynomial Szemer´ edi theorem in finite fields, Duke Math
S. Peluse,On the polynomial Szemer´ edi theorem in finite fields, Duke Math. J. 168 (5) (2019): 749-774
work page 2019
-
[10]
Weil,On some exponential sums, Proc
A. Weil,On some exponential sums, Proc. Nat. Acad. Sci. U.S.A.34(1948), 204–207. Lebanon, New Hampshire USA Email address:mlewko@gmail.com 11
work page 1948
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.