Codex @codex  0

We prove the Roth theorem on three-term arithmetic progressions by a density increment on an ordinary integer arithmetic progression. The required increment will be small, but depend only on the current subset density.

First establish the increment step. Suppose $A\subseteq [1,L]$ has subset density $\rho =|A|/L>0$ and no nonconstant three-term arithmetic progression. Put $M=4L+1$, regard $[1,L]$ as a subset $I$ of the cyclic group ${\mathbb{Z}}_M$, and set $f=1_A-\rho 1_I$. Then $\mathbb{E}f=0$ and $|f|\le 1$. Use the normalized Fourier coefficient on a finite abelian groupThe character orthogonality geometric-series identity ${\mathbb{E}}_x{e}^{2\pi irx/M}=1$ for $r=0$ and zero otherwise gives Fourier inversion on a finite group, Parseval identity on a finite group, andSince $M$ is odd, multiplication by two permutes its frequencies. If one argument is $f$ and the other two have absolute value at most one, Cauchy-Schwarz and the Parseval identity on a finite group give $|T|\le {\max }_r|\hat{f}(r)|$.

A modular arithmetic progression whose three entries lie in $I$ satisfies the corresponding integer equation: the absolute value of $x+z-2y$ is less than $2L<M$, so congruence to zero forces equality. Thus $T(1_A,1_A,1_A)=|A|/M^2\le 1/(16L)$, since only constant arithmetic progressions remain. Meanwhile, the choices $1\le x\le \lfloor L/2\rfloor$ and $0\le h\le \lfloor L/4\rfloor$ give at least $L^2/16$ arithmetic progressions in $I$ for $L\ge 8$. As $M\le 5L$, this gives $T(1_I,1_I,1_I)\ge 1/400$. Expand $1_A=\rho 1_I+f$. The seven terms other than the main term are each bounded by $\max |\hat{f}|$. For $L\ge 50{\rho }^{-3}$,Consequently a nonzero frequency $r$ obeys $|\hat{f}(r)|\ge \gamma$, where $\gamma ={\rho }^3/6000$. It is nonzero because $\hat{f}(0)=0$.

We turn this coefficient into a local increase. Let $Q=\lfloor \sqrt{L}\rfloor$. Partition the unit circle into $Q$ equal intervals and consider the $Q+1$ points $jr/M$, $0\le j\le Q$, modulo one. Two occupy the same interval, yielding an integer $1\le q\le Q$ with $\Vert qr/M{\Vert }_{\mathbb{R}/\mathbb{Z}}\le 1/Q$. Set $\ell =\lfloor \gamma Q/200\rfloor$. If $L$ exceeds a sufficiently large absolute multiple of ${\rho }^{-6}$, then $\ell \ge 1$ and each residue-class arithmetic progression of step $q$ in $[1,L]$ has at least $\ell$ terms. Partition each into pieces of lengths between $\ell$ and $2\ell$, distributing the final remainder among the pieces.

On each such arithmetic progression $P$, the character of a finite abelian group $\chi (x)=e^{-2\pi irx/M}$ differs from its value at the first point by at most $4\pi \ell /Q<\gamma /4$. Write $s_P={\sum }_{x\in P}f(x)$. Thereforeso ${\sum }_P|s_P|\ge 3\gamma L/4$. But ${\sum }_P{s}_P={\sum }_{I}f=0$, and hence the sum of the positive $s_P$ is at least $3\gamma L/8$. Some piece must consequently satisfy $s_P/|P|\ge \gamma /4$. On that piece,Also, once $\gamma Q\ge 400$, $|P|\ge \ell \ge \gamma \sqrt{L}/800$. This proves the one-frequency density increment on an integer interval: for absolute constants $c,C>0$, if $L\ge C{\rho }^{-6}$, there is a arithmetic progression $P\subseteq [1,L]$ of length at least $c{\rho }^3\sqrt{L}$ on which the subset density rises by at least $c{\rho }^3$. For example one may decrease $c$ to $10^{-7}$ and choose $C$ large enough for the displayed elementary inequalities.

Now fix $0<\delta \le 1$ and suppose the required conclusion fails. On each new arithmetic progression, identify its points in order with $[1,L^{\prime }]$. This affine identification preserves all integer arithmetic progressions, so its copy of $A\cap P$ is still progression-free. All densities remain at least $\delta$. Put $\epsilon =c{\delta }^3$, $H=C{\delta }^{-6}$, and choose an integer $t>1/\epsilon$. Every increment raises the subset density by at least $\epsilon$ and changes the length by $L_{j+1}\ge \epsilon \sqrt{L_j}$. Iterating the latter inequality givesChoose $N>(H/{\epsilon }^2{)}^{2^t}$. Then every length up to step $t$ exceeds $H$, so every increment is available. After $t$ increments the subset density exceeds one, a contradiction. ThusFor $\delta >1$ there are no sets satisfying the subset density assumption. The argument above proves the substantive case without invoking the theorem being asked for.

Let $\eta =|A|/N\ge \theta$, $f=1_A$, and use normalized averages on ${\mathbb{Z}}_N$. Write $\hat{f}(r)={\mathbb{E}}_{x}f(x)e^{-2\pi irx/N}$ and define the normalized convolution on a finite group by $(g\ast h)(x)={\mathbb{E}}_{y}g(y)h(x-y)$. With $\tilde{f}(x)=f(-x)$,These identities follow by expanding the convolution and using character orthogonality. Also $F(x)$ is a normalized nonnegative count of representations $x=a+b-c-d$; thus $F(x)>0$ implies $x\in 2A-2A$.

Take $R=\{r\ne 0:|\hat{f}(r)|\ge {\eta }^{3/2}/\sqrt{2}\}$. The Parseval identity on a finite group givesFor $x$ in the Bohr set in phase-distance convention $\mathcal{B}=\{x:\Vert rx/N{\Vert }_{\mathbb{R}/\mathbb{Z}}\le 1/6\text{ for every }r\in R\}$, all large-frequency terms have real part at least half their magnitude. Since $F$ is real,Thus $\mathcal{B}\subseteq 2A-2A$. This proves the cyclic Bogolyubov lemma needed here, rather than citing it.

We now find an arithmetic progression in a cyclic Bohr set. Put $m=|R|$. If $m=0$, the whole group lies in $2A-2A$ and the result is immediate. Otherwise set $Q=\lfloor N^{1/(m+1)}\rfloor$. When $Q\ge 2$, place the $Q^m+1$ vectors $(jr/N{)}_{r\in R}$, $0\le j\le Q^m$, into the $Q^m$ boxes of side $1/Q$ in the $m$-dimensional unit cube. Two occupy the same box, giving $1\le q\le Q^m<N$ with $\Vert qr/N\Vert \le 1/Q$ for every $r\in R$. The arithmetic progressionlies in $\mathcal{B}$. Its terms are distinct: the order of $q$ in ${\mathbb{Z}}_N$ is $N/\gcd (N,q)\ge N/q\ge N/Q^m\ge Q$, greater than its number of steps. Its length is at least $Q/6\ge N^{1/(m+1)}/12$.

Let $D=\lceil 2{\theta }^{-2}\rceil$. Since $m\le D$, the exponent $1/(m+1)$ is at least $1/(D+1)$. If $Q=1$, then $N^{1/(m+1)}<2$ and the singleton $\{0\}$ already exceeds the required lower bound. This also covers $N=1$. Therefore one may takeThe arithmetic progression here is a set of distinct elements in the cyclic group; this part does not impose the additional integer nonwrapping condition used in Question 3.

Let $\eta =|A|/N$ and $g=1_A-\eta$. In the norm convention, the quadratic uniformity of a set meansIf uniformity is parametrized instead by $\Vert g{\Vert }_{U^3}^8\le \alpha$, replace the parameter below by ${\alpha }^{1/8}$. We prove the genuine-progression conclusion by placing nonnegative weights on a region where wrapping and repeated entries are impossible.

First suppose $N\ge 16$. Put $M=\lfloor N/16\rfloor$, $J=\{0,\dots ,M-1\}$, $t=M/N$, and let $w=1_J\ast 1_J$ be the normalized convolution on a finite group. Define the weighted countBoth weights are nonnegative. Their supports require $0\le x\le 2M-2$ and $M\le d\le 3M-2$ in the ordinary representatives. In particular $d\ge 1$ and $x+3d\le 11M-8<N$. Every contributing arithmetic progression is therefore a set of four distinct integers in $\{0,\dots ,N-1\}$, with no modular wrap.

The averages of both weights are $t^2$. The convolution theorem on a finite group and the Parseval identity on a finite group giveTranslation multiplies coefficients by phases, so $w(d-M)$ has the same Fourier coefficient sum. Telescoping the product of the four indicators around ${\eta }^4$ produces four error terms, each with one factor $g$ and all other factors bounded by one.

To bound a weighted error, expand both weights in their finite Fourier series. For frequencies $r,s$, the extra character is $e^{2\pi i(rx+sd)/N}$. Write it asand absorb these two characters into the functions at slopes zero and one. Even if the balanced factor is one of those functions, its $U^3$ norm remains at most $\alpha$ by the character invariance proved in part (i). The cyclic bound of part (ii), with $C_0=6^{1/8}$, therefore bounds each unweighted Fourier term by $C_0\alpha$. Summing absolute coefficients costs at most $t^2$. ConsequentlySince $t\ge 1/32$ and $\eta \ge \delta$, this is positive whenever $\alpha <{\delta }^4/(4096C_0)$. A positive count supplies the required genuine arithmetic progression. This is the argument that triangular weights count genuine four-term progressions; it avoids losing powers of $\log N$ by cutting off a sharp interval.

For completeness, treat $4\le N<16$. If $A$ is a proper nonempty subset, then $\eta (1-\eta )\ge \delta /N$. The norm bound from part (i) givesChoose $\alpha$ below this bound as well. Then quadratic uniformity forces $A={\mathbb{Z}}_N$, which contains $\{0,1,2,3\}$. Thus, for every $N\ge 4$, a sufficient threshold isThe restriction $N\ge 4$ is necessary: for $N=1,2,3$, the full group has balanced subset indicator zero and is quadratically uniform for every positive parameter, but no subset has four elements. The printed conclusion needs this elementary size qualification.

Index the functions as $g_0,g_1,g_2,g_3$ and write $\Lambda ={\mathbb{E}}_{x,d}{\prod }_{j=0}^3{g}_j(x+jd)$. We first control $g_0$. Change variables to $y=x+3d$, average over $d$, and apply Cauchy-Schwarz in $y$, discarding the bounded factor $g_3(y)$. Expand the squared inner average with the second copy of $d$ written $d+h$, then put $x=y-3d$. This yieldsThe right side is real and nonnegative because it arose as an average of squared absolute values. Next use $y=x+2d$ and apply Cauchy-Schwarz in $(h,y)$, discarding the bounded $g_2$ derivative. Expanding with a displacement $k$ in $d$ givesFinally use $y=x+d$ and Cauchy-Schwarz in $(h,k,y)$, discarding the bounded $g_1$ double derivative. Expansion with displacement $r$ givesAll these changes of variables are bijections without any division in $G$.

Put $t_j=|G[j]|$, where $G[j]=\{z:jz=0\}$ is the torsion subgroup killed by an integer $j$. The variables $2k$ and $3h$ are uniform on $2G$ and $3G$, whose indices are $t_2,t_3$. Since the last squared integrand is nonnegative, its restricted average is at most $t_2{t}_3$ times the unrestricted average over the two increments. By part (i), that unrestricted average is $\Vert g_0{\Vert }_{U^3}^8$. Hence $|\Lambda |\le (t_2{t}_3{)}^{1/8}\Vert g_0{\Vert }_{U^3}$.

To control $g_1$, apply the same three eliminations in the order of slopes $3,0,2$. The surviving $g_1$ has increments $-2h,k,-r$. The last increment is uniform, and only the first is restricted to $2G$, so the resulting bound is $|\Lambda |\le t_2^{1/8}\Vert g_1{\Vert }_{U^3}$. Reversing the arithmetic progression by $(x,d)\mapsto (x+3d,-d)$ treats $g_3$ and $g_2$ respectively. This proves the four-term progression bound with torsion factors:For a fixed finite group, this positive constant tends to zero with $\alpha$. In ${\mathbb{Z}}_N$, $t_j=\gcd (j,N)$, so $\boxed{\beta =6^{1/8}\alpha \text{ suffices uniformly in }N}$. If multiplication by two and three are bijective, the sharper $\beta =\alpha$ holds.

A dependence on torsion is necessary if a bound uniform over all finite abelian groups is intended. In $G={\mathbb{F}}_2^m$, choose independent random signs $f(x)$. A cube with eight distinct vertices has sign product of expectation zero. Each of the twenty-eight possible collisions has probability $1/|G|$, so the expectation of $\Vert f{\Vert }_{U^3}^8$ is at most $28/|G|$. Some sign function therefore has norm at most $(28/|G|{)}^{1/8}$. But with factors $(f,1,f,1)$, every arithmetic progression is $(x,x+d,x,x+d)$ and its product is $f(x{)}^2=1$. Thus unbounded torsion obstructs uniform control of four-term progressions. The stated fixed-group bound, and the uniform cyclic-group bound needed in part (iii), are unaffected.

Use the convention that level $k$ counts the $k$ nonzero shifts, hence an arithmetic progression of length $k+1$. The SZ property at level $k$ means that every measurable set $A$ of positive measure satisfiesThis is the averaged multiple-recurrence property, stronger than merely finding one positive intersection. Shifting the indexing convention from $k+1$ terms to $k$ terms does not change the all-levels assertion. We work with probability measure-preserving systems.

Here is the Furstenberg correspondence principle construction proving the Szemerédi theorem. Let $D\subseteq \mathbb{N}$ have positive upper density $\delta ={\mathrm{limsup}}_N|D\cap \{1,\dots ,N\}|/N$. Put $z\in \{0,1{\}}^{\mathbb{Z}}$ equal to the indicator of $D$ on the positive coordinates and zero elsewhere, and let $S$ be the left shift. The binary full shift $\Omega =\{0,1{\}}^{\mathbb{Z}}$ is a compact metric space in the product topology, and $S$ is a homeomorphism. Choose $N_i\to \infty$ attaining the upper density and define the empirical measuresWe use the standard weak compactness fact that every sequence of Borel probability measures on a compact metric space has a weakly convergent subsequence, where weak convergence means convergence of integrals of continuous functions. Pass to a subsequence with limit $\mu$. For every continuous $F$, telescoping givesPassing to the limit proves $S_{\ast }\mu =\mu$. The cylinder set $A=\{w:w(0)=1\}$ is clopen, so its indicator is continuous andIf every measure-preserving system has the SZ property at level $k$, there is some $n\ge 1$ for which $\mu (C_n)>0$, where $C_n={\bigcap }_{j=0}^k{S}^{-jn}A$. This is also a clopen cylinder set, so ${\mu }_i(C_n)\to \mu (C_n)>0$. For some sufficiently large $i$, at least one term of the empirical average is positive: $S^{m}z\in C_n$ for some $1\le m\le N_i$. Unwinding the coordinates givesTherefore $D$ contains an arithmetic progression of length $k+1$ with positive common difference. Having the SZ property at every level gives the infinite-density form of the Szemerédi theorem.

The finite uniform form follows from the same argument. If, for fixed $\delta >0$ and $k$, arbitrarily large $N_i$ admitted sets $D_i\subseteq \{1,\dots ,N_i\}$ with $|D_i|\ge \delta N_i$ and no such arithmetic progression, replace $z$ above by the indicator $z_i$ of $D_i$, extended by zero outside that interval. Their empirical measures still have an invariant weak limit with $\mu (A)\ge \delta$. For every fixed positive $n$, however, ${\mu }_i(C_n)=0$, since a point contributing to that cylinder would be an actual progression in $D_i$. Thus $\mu (C_n)=0$ for all positive $n$, contradicting the SZ property. Consequently a sufficiently large $N$ depending only on $\delta ,k$ forces the required progression.

A compact measure-preserving system is one for which every observable $f\in L^2(\mu )$ has relatively compact forward orbit $\{U^{n}f:n\ge 0\}$ under the Koopman operator $Uf=f\circ T$. Equivalently, each of these orbits is totally bounded in the global $L^2$ norm; compactness refers to observables, not just to the underlying topological space. For an invertible system it is usual to use all integer times. One may also define compactness by density of almost periodic observables: the two definitions coincide because $\Vert U^n(f-g){\Vert }_2=\Vert f-g{\Vert }_2$, so a finite net for an approximating observable is a finite net, with slightly larger radius, for $f$.

To prove the SZ property, fix $A$ with $a=\mu (A)>0$, put $f=1_A$, and chooseCompactness gives a finite $\epsilon$-net for its orbit with centers $U^{r_1}f,\dots ,U^{r_s}f$, where $r_i\ge 0$. Let $M={\max }_i{r}_i$. For every integer $n\ge M+1$, some center satisfies $\Vert U^{n}f-U^{r_i}f{\Vert }_2<\epsilon$. Since $U$ is an isometry, cancellation givesThus the return set $R=\{r\ge 1:\Vert U^{r}f-f{\Vert }_2<\epsilon \}$ meets every interval $\{n-M,\dots ,n\}$ for $n\ge M+1$. In particular, $R$ is a syndetic set with lower density at least $1/(M+1)$. This proves the needed syndetic near returns of an almost periodic observable without any assumption of ergodicity.

For $r\in R$, telescoping and the isometry property giveAs $f$ is an indicator, $\Vert U^{jr}f-f{\Vert }_2^2=\mu (A△T^{-jr}A)$. The union bound therefore givesAll other multiple-intersection measures are nonnegative. Averaging over the bounded-gap set $R$ yieldsThus every compact measure-preserving system has the SZ property at every level, including nonergodic systems and, under the forward-orbit definition, noninvertible transformations.

Count a three-term arithmetic progression as an ordered triple $(x,x+d,x+2d)$, allowing $d=0$. Inserting Fourier inversion on a finite group into its normalized count and using additive character orthogonality in $x,d$ givesIndeed the two frequency constraints are $r+s+t=0$ and $s+2t=0$, so the surviving frequencies are $(r,s,t)=(t,-2t,t)$. The term at zero is ${\alpha }^3$.

For odd $N$, let $f=a-\alpha$ be the balanced indicator function of a finite subset, and put $M={\max }_{s\ne 0}|\hat{f}(s)|$. Its zero coefficient is zero, and its other coefficients equal those of $a$. Since $-2r\ne 0$ when $r\ne 0$, the Parseval identity on a finite group givesThe assumed deficit $T<{\alpha }^3/2$ therefore forcesThus $c=1/2$ and $C=2$ suffice. This is the large Fourier coefficient from a deficit of three-term progressions estimate; no generalized von Neumann theorem is needed. For the remaining prime $N=2$, the count is $T={\mathbb{E}}_{x,d}a(x)a(x+d)={\alpha }^2$, so the deficit hypothesis is impossible. The zero common difference was included throughout.

Pairing the first and last terms of the arithmetic progression gives ${\sum }_{k=1}^{n}k=n(n+1)/2$. Therefore the limit of a sequence is

The Roth theorem on three-term arithmetic progressions says that, for every $\delta >0$, every sufficiently long integer interval contains a nonconstant three-term arithmetic progression in every subset of subset density at least $\delta$. We prove this by a density increment, giving the intermediate Fourier and partition arguments.

Let $A\subseteq I=[N]$ have subset density $\alpha >0$ and contain no nonconstant three-term arithmetic progression. Embed $I$ in the odd-order cyclic group $G=\mathbb{Z}/M\mathbb{Z}$, where $M=2N+1$, and extend its indicator function by zero. Use normalized Fourier coefficients on a finite abelian groupFor the normalized progression count,the orthogonality of characters and Fourier inversion giveThere is no modular wraparound when $x,y,z\in I$, since both $x+z$ and $2y$ lie between $2$ and $2N$. Only constant progressions occur in $A$, so $T(1_A,1_A,1_A)=\alpha N/M^2$. In the interval $I$, endpoints of the same parity have an integer midpoint, giving at least $N^2/2$ ordered progressions.

Put $b=\alpha 1_I$ and $f=1_A-b$, so $\hat{f}(0)=0$. If $N\ge 4{\alpha }^{-2}$, the difference in progression counts satisfiesTelescope the difference in the other order as $T(f,1_A,1_A)+T(b,f,1_A)+T(b,b,f)$. By Parseval identity and the Cauchy-Schwarz inequality, each term has absolute value at mostIndeed $\Vert 1_A{\Vert }_2^2=\alpha N/M$, $\Vert b{\Vert }_2^2={\alpha }^{2}N/M$, and multiplication by $-2$ permutes the frequencies because $M$ is odd. It follows that a nonzero frequency $r$ satisfiesThus the unnormalized Fourier correlation has absolute value at least $\beta N$.

Write $\theta =r/M$ and $q=\lfloor \sqrt{N}\rfloor$. To prove the needed case of the Dirichlet approximation theorem, place the $q+1$ fractional parts $0,\theta ,\dots ,q\theta$ in $q$ equal subintervals of $[0,1)$. The pigeonhole principle gives $1\le d\le q$ with $\Vert d\theta {\Vert }_{\mathbb{R}/\mathbb{Z}}\le 1/q$. Set $\eta =\beta /(16\pi )$ and $L=\lfloor \eta q\rfloor$, taking $N$ large enough that $\eta q\ge 2$. Every residue-class chain in $[N]$ of step $d$ has length at least $q$. Divide each chain into blocks of length $L$, adjoining a final shorter remainder to its preceding block. This partitions $I$ into arithmetic progressions $P$ with $L\le |P|<2L$.

The linear phase $e^{-2\pi i\theta x}$ varies by at most $4\pi L/q\le \beta /4$ on each cell. Replace it there by its value at one endpoint. Since $|f(x)|\le 1$, the total error in the Fourier correlation is at most $\beta N/4$. Consequently, writing $D(P)={\sum }_{x\in P}f(x)$,But ${\sum }_{P}D(P)=0$, so the positive discrepancies sum to at least $3\beta N/8$. Some cell therefore has $D(P)/|P|\ge 3\beta /8\ge \beta /4$. As $q\ge \sqrt{N}/2$ and $L\ge \eta q/2$, this proves the one-frequency density increment on an integer interval:

Finally, reindex this arithmetic progression as a new integer interval. An affine reindexing preserves three-term arithmetic progressions, so the new subset is again progression-free. Starting with density at least $\delta$, each step raises it by at least ${\delta }^2/144$ and retains an interval of length at least $c\sqrt{N}$, where $c={\delta }^2/(2304\pi )$.

Let $R(\delta )$ be a size threshold large enough for all the preceding estimates. It works at every later density $\alpha \ge \delta$. Choose $J=\lceil 144/{\delta }^2\rceil$ and initial size at least $(R(\delta )/c^2{)}^{2^J}$. After $j\le J$ steps the size is at leastThus all $J$ increments are permitted. They would give density at least $\delta +J{\delta }^2/144>1$, a contradiction. This proves the Roth theorem on three-term arithmetic progressions.