[Paper Review] The inverse theorem for the nonlinear Roth configuration: an exposition

Sean Prendiville|arXiv (Cornell University)|Mar 9, 2020

Limits and Structures in Graph Theory9 references4 citations

TL;DR

This paper provides a detailed exposition of the inverse theorem for the cut norm associated with the nonlinear Roth configuration $x, x+y, x+y^2$ (for $y \neq 0$), establishing that if a set $A \subset \{1, \dots, N\}$ lacks this configuration, then its size is bounded by $|A| \ll N / (\log N)^c$ for some absolute $c > 0$. The argument relies on a novel combination of PET induction, Gowers uniformity norms, and degree-lowering techniques to derive a structured dual function that correlates with the original function, ultimately yielding a quantitative density increment.

ABSTRACT

We give an exposition of the inverse theorem for the cut-norm associated to the nonlinear Roth configuration, established previously by Peluse and the author.

Motivation & Objective

• To provide a self-contained exposition of the inverse theorem for the cut norm in the context of the nonlinear Roth configuration $x, x+y, x+y^2$.
• To clarify the structural decomposition of functions that correlate with the counting operator associated with this configuration.
• To demonstrate how degree-lowering techniques reduce high-degree Gowers uniformity norms to $U^1$-type control, enabling effective density bounds.
• To establish a quantitative inverse result that implies the improved density bound $|A| \ll N / (\log N)^c$ for sets avoiding the nonlinear Roth configuration.

Proposed method

• The proof uses PET (van der Corput) induction to reduce the complexity of the counting operator and analyze its multilinear structure.
• A concatenation theorem is developed to transfer control from the cut norm to Gowers uniformity norms, initially yielding a $U^5$-norm bound.
• The method applies a quantitative version of the inverse theorem for Gowers norms, linking large cut norm to large $U^5$-norm of the function in the nonlinear term.
• A degree-lowering argument is employed, exploiting the specific algebraic structure of the configuration $x, x+y, x+qy^2$, to reduce the required uniformity norm from $U^5$ to $U^1$.
• The argument uses local functions of controlled resolution and modulus to construct a dual function that correlates with the original function $f$, via the $L^1$-type inner product.
• The final step combines the cut norm inverse theorem with a pigeonhole principle and phase localization to extract a structured local function with significant correlation to $f$.

Experimental results

Research questions

• RQ1 What structural properties must a function possess if its associated nonlinear Roth counting operator is large in the cut norm?
• RQ2 How can one effectively reduce the degree of Gowers uniformity control from $U^5$ to $U^1$ in the context of the nonlinear Roth configuration?
• RQ3 Can a quantitative inverse theorem for the cut norm be established that yields effective density bounds for sets avoiding the configuration $x, x+y, x+y^2$?
• RQ4 What role do local functions of controlled resolution and modulus play in capturing the dual structure of the counting operator?
• RQ5 How does the interplay between PET induction, concatenation, and degree lowering enable a proof of the inverse theorem?

Key findings

• The inverse theorem establishes that if $\|f\|^{\flat}_{q,N} \geq \delta$, then either $N \ll (q/\delta)^{O(1)}$ or $f$ correlates significantly with a local function of resolution $\gg (\delta/q)^{O(1)} N^{1/2}$ and modulus $qq'$ for $q' \ll \delta^{-O(1)}$.
• The correlation strength is quantified as $\sum_x f(x)\phi(x) \gg \delta^{2^{66}} N$, providing a nontrivial density increment.
• The degree-lowering procedure reduces the required uniformity norm from $U^5$ to $U^1$, which is crucial for deriving effective bounds.
• The method yields a quantitative density bound: any subset $A \subset \{1, \dots, N\}$ avoiding the nonlinear Roth configuration satisfies $|A| \ll N / (\log N)^c$ for some absolute $c > 0$, improving upon earlier logarithmic losses.
• The proof is effective and self-contained, offering a second account of the key inverse theorem from Peluse and Prendiville [6], aiding accessibility and application.
• The framework demonstrates the utility of combining Gowers uniformity theory, concatenation techniques, and structured decomposition for nonlinear patterns in additive combinatorics.