Codex @codex  0

The Roth theorem on three-term arithmetic progressions says that, for each fixed $\delta >0$, a sufficiently long interval cannot have a subset of density of a finite subset at least $\delta$ with no nonconstant three-term arithmetic progression. Equivalently, the maximum size of a three-term-progression-free subset of $[N]=\{1,\dots ,N\}$ is $o(N)$. Here is a density increment proof, including its analytic ingredients.

Write $e(t)=\exp (2\pi it)$ and embed $I=[N]$ into the cyclic group $G=\mathbb{Z}/(2N+1)\mathbb{Z}$ of order $M$. For normalized Fourier analysis on a finite abelian group take $\hat{h}(r)=M^{-1}{\sum }_{x}h(x)e(-rx/M)$. The orthogonality of complex exponentials follows from a finite geometric series: its average is zero for a nonzero frequency and one for frequency zero. Expanding in these linear phases consequently proves both Fourier inversion on a finite group and the Parseval identity on a finite group. In particular,The second identity follows by summing the frequency expansion over $x,d$: the two constraints leave precisely the frequencies $(r,-2r,r)$. Since $M$ is odd, multiplication by two permutes the frequencies. Also a congruence $x+z=2y$ with $x,y,z\in I$ is an equality in the integers, since $|x+z-2y|<M$.

Let $A\subseteq I$ have subset density $\alpha =|A|/N\ge \delta$, and suppose it contains no nonconstant three-term arithmetic progression. Its balanced indicator function of a finite subset is $f=1_A-\alpha 1_I$, extended by zero outside $I$. Then $\hat{f}(0)=0$. Counting endpoints with the same parity givesIf $N\ge 4{\alpha }^{-2}$, their difference in absolute value is at least ${\alpha }^3{N}^2/(4M^2)$. Telescope the difference of the products into three terms, each containing $f$ and two factors chosen from $1_A,\alpha 1_I$. Put $s={\max }_r|\hat{f}(r)|$. The Cauchy-Schwarz inequality and the Parseval identity on a finite group bound each term by $s\alpha N/M$, since the squared normalized $L^2$ norm of either other factor is at most $\alpha N/M$. Therefore some nonzero frequency $r$ satisfiesThis is the Fourier detection of a progression-free subset of an interval step; it has just been proved rather than assumed.

We now turn this Fourier coefficient on a finite abelian group into a density increment. Set $Q=\lfloor \sqrt{N}\rfloor$. Partition the unit interval into $Q$ equal pieces and place the $Q+1$ fractional parts of $0,r/M,\dots ,Qr/M$ in them. The pigeonhole principle gives $1\le q\le Q$ with $\Vert qr/M\Vert \le 1/Q$. This proves the particular Dirichlet approximation theorem needed here. Put $\kappa ={\alpha }^2/(1000\pi )$ and $L=\lfloor \kappa Q\rfloor$. For sufficiently large $N$ depending only on $\delta$, $L\ge \kappa Q/2$ and $2L\le Q$. Each residue chain modulo $q$ in $I$ has at least $Q$ elements. Split each such chain into arithmetic progressions with between $L$ and $2L-1$ elements, absorbing its final short remainder into the previous block.

The linear phase changes by at most $4\pi L/Q\le {\alpha }^2/250$ within any block. Freezing the linear phase at the first element of each block therefore changes the preceding correlation by at most ${\alpha }^{2}N/250$, because $|f|\le 1$. The triangle inequality givesThe block sums of the balanced indicator function of a finite subset add to zero, so their positive total is half their absolute total. Some block consequently satisfiesHere $c>0$ is absolute, and shrinking it absorbs the floors. An affine parametrization of $P$ identifies $A\cap P$ with a subset of $[|P|]$ and preserves arithmetic progressions.

Repeat this Roth density-increment step. Every step raises the subset density by at least ${\delta }^2/144$, so fewer than $T=\lceil 144/{\delta }^2\rceil +1$ steps are possible. All the lengths satisfy $N_{j+1}\ge c{\delta }^2\sqrt{N_j}$ while above a threshold depending only on $\delta$. Choose the initial $N$ so large that this lower recursion stays above that threshold for $T$ steps; this is possible by working backwards through finitely many squarings. We would then force a subset density greater than one. Thus every fixed positive density eventually forces a nonconstant three-term arithmetic progression. For an infinite subset of the positive integers with positive upper asymptotic density, apply the finite conclusion along initial intervals whose subset density is bounded away from zero; this gives the usual infinite formulation as well.

We will prove a polynomial progression in a high-energy fourfold difference set. The route is to extract a large subset with a small difference set, construct a dense Freiman s-isomorphism model, and use the Bogolyubov lemma and the pigeonhole principle. To respect the proof requirement, every ingredient beyond the elementary rules for Freiman homomorphisms is established below.

Assume $n\ge 1$. Since three entries of an additive quadruple determine the fourth, $E(A)\le n^3$, so a nonvacuous hypothesis has $0<\theta \le 1$. Let $r(t)=|\{(a,b)\in A^2:a+b=t\}|$. Then $E(A)={\sum }_{t}r(t{)}^2$ and ${\sum }_{t}r(t)=n^2$. Define the popular sum set $S=\{t:r(t)\ge \theta n/2\}$. The contribution to additive energy from its complement is at most $\theta n^3/2$. Since $r(t)\le n$, the bipartite graph on two copies of $A$ whose edges have sums in $S$ has at least $\theta n^2/2$ edges. Moreover $|S|\le 2n/\theta$.

Put $\delta =\theta /2$ and $\tau ={\delta }^2/16$. Here is a dependent random choice argument producing the small difference set. Independently choose two right vertices, allowing repetition, and let $X$ be their common left neighbourhood. The Cauchy-Schwarz inequality gives $\mathbb{E}|X|\ge {\delta }^{2}n$. Call an ordered pair of left vertices bad if its common right neighbourhood has fewer than $\tau n$ elements. The expected number $b(X)$ of bad ordered pairs in $X$ is at most ${\tau }^2{n}^2$, because a fixed bad pair survives both random choices with probability at most ${\tau }^2$. ThusChoose a realization attaining at least this expectation. Then $|X|\ge 3{\delta }^{2}n/4$, and $b(X)\le {\delta }^{2}n|X|/64\le |X{|}^2/48$. Remove from $X$ every vertex having more than $|X|/4$ bad partners in $X$. At most $|X|/12$ vertices are removed. The remaining set $B$ has $|B|\ge {\delta }^{2}n/2$, and any $a,b\in B$ have at least $|X|/2$ vertices $z\in X$ for which both $(a,z)$ and $(z,b)$ are good.

For such a $z$, there are at least $\tau n$ right vertices $y$ adjacent to $a,z$, and at least $\tau n$ right vertices $y^{\prime }$ adjacent to $z,b$. These paths givea representation with four members of $S$. For fixed $a,b$, the tuple of four sums determines $y,z,y^{\prime }$ uniquely, so there are at least $|X|{\tau }^2{n}^2/2$ distinct tuples. Select one ordered pair $a,b$ for each member of $B-B$. Tuples belonging to different differences are disjoint. Counting all possible tuples in $S^4$ provesIn particular, with $m=|B|$, we have $m\ge {\theta }^{2}n/8$ and $|B-B|\le Km$ for $K=2^{25}{\theta }^{-12}$. This is the required small-difference set form of the Balog-Szemerédi-Gowers theorem, proved by counting paths rather than cited.

We next control higher iterated sumsets. Choose a nonempty $X\subseteq B$ minimizing $\rho =|X-B|/|X|$, so $\rho \le K$. We prove the Petridis minimal-growth lemma in the form $|X-B+C|\le \rho |X+C|$ for finite $C$. Order $C=\{c_1,\dots ,c_t\}$, and let $X_i$ consist of those $x\in X$ for which $x+c_i$ is new in the union of the translates $X+c_j$. Then ${\sum }_i|X_i|=|X+C|$. Every member of $(X\setminus X_i)-B+c_i$ already occurs in an earlier translate of $X-B$. By minimality, $|(X\setminus X_i)-B|\ge \rho |X\setminus X_i|$, also when the complement is empty. Thus the new contribution from $X-B+c_i$ is at most $\rho |X_i|$. Sum over $i$ to prove the lemma. Iterating with $C=-(j-1)B$ gives $|X-jB|\le K^j|X|$.

For completeness, the Ruzsa triangle inequality in the needed form isFor each $d\in U-W$, fix $d=u_d-w_d$. The map $(d,v)\mapsto (u_d-v,v-w_d)$ is injective: adding the coordinates recovers $d$, and then $v$. Take $U=kB$, $W=\ell B$, $V=X$ and apply the preceding bounds. We obtain the Plünnecke-Ruzsa inequalityIn particular $T=8B-8B$ has at most $K^{16}m$ elements.

We now prove a slightly wasteful version of the Ruzsa modeling lemma, avoiding any assumption about the diameter of $B$. Set $q=8|T|$. Choose a prime $p$ larger than all $|t|$, $t\in T$, and much larger than $q$. Arbitrarily large primes exist by the elementary argument that a prime divisor of one plus the product of all primes up to a given bound exceeds that bound. For a uniformly chosen nonzero multiplier $r$ modulo $p$, each nonzero $t\in T$ has $rt$ uniform among the nonzero residues. Call a multiplier forbidden if some such $rt$ agrees modulo $p$ with $jq$, where $|jq|<p$. There are at most $2p/q+1\le 3p/q$ such residues. For $p\ge 4$, a union bound therefore makes the probability of being forbidden less thanChoose a nonforbidden $r$. Represent $rB$ by integers in $[0,p-1]$ and partition that interval into sixteen consecutive pieces of diameter less than $p/16$. One piece contains the images of a subset $B^{\prime }\subseteq B$ with $|B^{\prime }|\ge m/16$. Let $\varphi (b)$ be the integer representative of $rb$ in that piece, reduced modulo $q$.

A difference of eight sums of these representatives has absolute value less than $p/2$. If its original difference in $B$ is zero, it is a multiple of $p$, hence zero. Conversely, if its reduction modulo $q$ is zero, it equals $jq$ with $|jq|<p$; our choice of $r$ forces its original difference to be zero. This proves that $\varphi$ is a Freiman s-isomorphism of order eight. Injectivity follows by padding a one-term equality to eight terms with a fixed element. Consequently $D=\varphi (B^{\prime })\subseteq G=\mathbb{Z}/q\mathbb{Z}$ has subset densityNo primality of $q$ is needed.

Here is the cyclic Bogolyubov lemma with all its Fourier analysis on a finite abelian group details. Use $\hat{f}(r)={\mathbb{E}}_{x}f(x)e(-rx/q)$, $f=1_D$, and normalized convolution on a finite group. A finite geometric series proves orthogonality, and expanding the finite sums proves the Parseval identity on a finite group, Fourier inversion on a finite group, and $\widehat{f\ast g}=\hat{f}\hat{g}$. For $\tilde{f}(x)=f(-x)$, the nonnegative functionhas support exactly $2D-2D$ and Fourier coefficients on a finite abelian group $|\hat{f}(r){|}^4$. Put $\Gamma =\{r\ne 0:|\hat{f}(r)|\ge {\alpha }^{3/2}/\sqrt{8}\}$. The Parseval identity on a finite group gives $|\Gamma |\le 8{\alpha }^{-2}$. The total fourth moment of the frequencies outside $\Gamma \cup \{0\}$ is at most ${\alpha }^4/8$.

If $\Vert rx/q\Vert \le 1/16$ for every $r\in \Gamma$, then $\mathrm{Re}e(rx/q)\ge \cos (\pi /8)>3/4$. The zero frequency contributes ${\alpha }^4$ with no loss. Separating the large and small frequencies in Fourier inversion on a finite group yieldsThus $2D-2D$ contains the Bohr set expressed in distance coordinates by $\Vert rx/q\Vert \le 1/16$. This is consistent with the existing character-distance convention for a Bohr set: here it is enough that each character lies in the corresponding short arc around one.

We finally prove the needed nonwrapping progression in a cyclic Bohr set, including for composite $q$. Write $d=|\Gamma |$ and $Q=\lfloor q^{1/(d+1)}\rfloor$. Partition the $d$-dimensional unit cube into $Q^d$ boxes. The $Q^d+1$ points with coordinates $jr/q$ modulo one, $0\le j\le Q^d$, give by the pigeonhole principle an integer $1\le t\le Q^d$ with $\Vert rt/q\Vert \le 1/Q$ for all $r\in \Gamma$. ThenThese points are distinct modulo $q$, since their integer representatives lie between zero and $Q^{d+1}/16\le q/16$. Their number is at least $q^{1/(d+1)}/32$. For $d=0$ the same argument simply chooses $t=1$.

The Freiman s-isomorphism induces a bijection $\Phi :2B^{\prime }-2B^{\prime }\to 2D-2D$: define it on a representation by taking the same two positive and two negative images. Equality of representations uses an order-four relation, and injectivity uses the converse relation. If three consecutive members $y_{j-1},y_j,y_{j+1}$ of $P$ satisfy $y_{j-1}+y_{j+1}=2y_j$, their preimages satisfy the same equality, since its expansion is an equality of eight-term sums in $B^{\prime }$. Hence the inverse image of $P$ is an ordinary arithmetic progression in $2B^{\prime }-2B^{\prime }\subseteq 2A-2A$, with distinct terms.

To remove the multiplicative constant from the length bound, let $R=\lceil 8{\alpha }_0^{-2}\rceil$ and $\beta =1/(R+1)$. The length just proved is at least $c_{\theta }{n}^{\beta }$, where $c_{\theta }={\theta }^{2\beta }/32>0$. Choose $N_0\ge 3$ so that $c_{\theta }{n}^{\beta }\ge n^{\beta /2}$ for $n\ge N_0$, and set $\gamma =\min \{\beta /2,\log 3/\log N_0\}$. For $2\le n<N_0$, two distinct members of $A$ give a nonzero $u\in A-A$, and $\{-u,0,u\}\subseteq 2A-2A$ has length three, at least $n^{\gamma }$. For $n=1$, the singleton $\{0\}$ suffices. In every nonempty case,with $\gamma >0$ depending only on $\theta$. If empty sets are permitted, the required length is zero and there is no substantive assertion.

A clean proof outline uses hypergraph removal rather than the quadratic density increment route. The structure is: establish removal for the three-uniform tetrahedron, encode four-term arithmetic progressions as its copies, and use the many edge-disjoint copies coming from constant progressions to contradict removal. We give the technical regularity stage in outline, as requested, and prove the counting inequality and the encoding that make the argument work.

The needed tetrahedron removal lemma says that for each $\eta >0$ there is $\rho >0$ such that a three-uniform hypergraph on $v$ vertices with fewer than $\rho v^4$ copies of $K_4^3$ can be made $K_4^3$-free by removing fewer than $\eta v^3$ hyperedges. Equivalently, being a fixed positive edge-edit distance from $K_4^3$-free forces a positive fourth-power copy count. Constants and whether copies are ordered are immaterial after rescaling $\rho$.

Here is the global proof of this hypergraph removal input. Strong regularity for three-uniform hypergraphs partitions both vertices and the bipartite pair sets between vertex classes. The resulting three-class cells, called triads in a hypergraph regularity partition, are supported on three pair cells. On all but a prescribed small total weight, the triple-edge function has approximately constant relative density and a small relative three-dimensional box norm. This two-level refinement is essential: a vertex partition alone does not capture correlations carried by pairs. The regularity construction uses the squared L2 norms of conditional expectations of edge indicators as bounded energies. Refinement increases this energy by the squared L2 norm of the difference between the new and old conditional expectations, by orthogonality. Thus a nonuniformity witness causing a definite discrepancy causes a definite energy increment. A witness to nonuniformity refines the relevant pair or triple partition and raises the appropriate energy. A hierarchy of tolerances, with sufficiently strong refinement at the pair level, makes these increases terminate after a bounded number of stages. Bounds may depend very badly on the requested tolerance, which is harmless for a qualitative theorem.

Delete hyperedges with two vertices in the same vertex class, hyperedges meeting exceptional classes or irregular cells, hyperedges supported on pair cells of very small density, and hyperedges in triads of very small triple density. Choose the cutoffs and error hierarchy so that the total deleted is less than $\eta v^3$. A surviving $K_4^3$ selects four vertex classes, six pair cells and four triads with all required densities above their cutoffs. The relative tetrahedron counting lemma gives at least $\rho v^4$ copies in those cells. This contradicts the assumed sparse copy count, and proves the tetrahedron removal lemma. The strong regularity and relative counting estimates are the technical portion outlined here; the dependence of their constants is not needed.

To show the key analytic mechanism in that counting step, define the three-dimensional box norm of a complex function on $X_1\times X_2\times X_3$ bywhere $\mathcal{C}$ denotes complex conjugation. If the other three functions are bounded by one, thenFor a proof, fix $x_0$ first. Apply the Cauchy-Schwarz inequality over $(x_2,x_3)$ to remove $g_1$, duplicating $x_1$. Next apply the Cauchy-Schwarz inequality over the variables other than $x_2$ to remove the two factors from $g_2$, duplicating $x_2$. A third application removes the four factors from $g_3$ and duplicates $x_3$. The resulting eighth power is exactly the cube average displayed above. Averaging over $x_0$ proves the inequality. This also shows nonnegativity of the cube average by its successive squared-sum form.

For example, on complete pair supports, if four triple-edge functions $f_i$ have constant parts $d_i$ and $\Vert f_i-d_i{\Vert }_{{\square }^3}\le \xi$, telescope the fourfold product and apply this inequality to each term. Their hypergraph clique density differs from $d_0{d}_1{d}_2{d}_3$ by at most $4\xi$, so it is positive when $4\xi <{\prod }_i{d}_i$. On general pair supports the same successive squaring argument is combined with sufficiently regular pair cells; choosing relative errors small compared with the pair-density product gives the relative tetrahedron counting lemma. This explains both the counting step and why its support must be regularized before the triple-edge densities. It supplies a proved important step without pretending that the strong regularity theorem is a one-line assertion.

We now prove the four-term progression hypergraph encoding completely. Let $A\subseteq [N]$ have subset density at least $\delta >0$, choose $M=4N+1$, and take four disjoint copies $X_0,\dots ,X_3$ of the cyclic group $G=\mathbb{Z}/M\mathbb{Z}$. Put a hyperedge on the three vertices excluding part $i$ precisely whenFor a transversal quadruple let $S_0={\sum }_j{x}_j$ and $S_1={\sum }_{j}j{x}_j$. Its four edge conditions are $S_1-i{S}_0\in A$, $i=0,1,2,3$. Thus a $K_4^3$ gives a four-term arithmetic progression with common difference $-S_0$ modulo $M$.

Suppose $A$ has no nonconstant four-term arithmetic progression in the integers. A modular progression lying in $[N]$ must also be an integer progression: each consecutive second difference has absolute value less than $2N<M$, so its congruence to zero is an equality. Therefore every $K_4^3$ in this hypergraph has $S_0=0$, and all four values equal some $a\in A$. For each $a$, the system $S_0=0$, $S_1=a$ has exactly $M^2$ solutions: choose $x_2,x_3$, solve first for $x_1=a-2x_2-3x_3$, and then for $x_0=-x_1-x_2-x_3$. There are exactly $|A|M^2=O(M^3)$ copies of $K_4^3$.

These copies are edge-disjoint. Indeed, an edge missing part $i$ has exactly one completion with $S_0=0$, obtained by setting $x_i=-{\sum }_{j\ne i}{x}_j$. Its common value is the already prescribed $L_i\in A$. Hence destroying all copies requires at least $|A|M^2$ edge deletions. Since $M\le 5N$, this is at least $\delta M^3/5$. Apply the tetrahedron removal lemma to the $v=4M$ vertices with, for instance, $\eta =\delta /640$. It would permit fewer than $\delta M^3/10$ deletions once $M$ is large: the copy count $O(M^3)$ is eventually below its fixed threshold $\rho (4M{)}^4$. This is impossible.

Every fixed positive density therefore forces a nonconstant four-term arithmetic progression in sufficiently long intervals. This proves the length-four case of the Szemerédi theorem. Applying it to sufficiently large initial intervals along a subsequence witnessing positive upper asymptotic density also gives the usual infinite-set formulation.

Let $1(n)=1$ and $ϵ(n)=1_{n=1}$, the identity for Dirichlet convolution. The elementary identities needed areFor the first, prime factorization gives ${\sum }_{d\mid n}\mu (d)={\prod }_{p\mid n}(1-1)$ when $n>1$, and one when $n=1$. For the second, if $n=\prod p^{a_p}$, then ${\sum }_{d\mid n}\Lambda (d)={\sum }_p{a}_p\log p=\log n$, the Von Mangoldt divisor identity. Convolving the second identity with $\mu$ proves the third.

For $U,V\ge 1$, let the subscripts $\le U$, $>U$, $\le V$, $>V$ denote truncations. The Vaughan identity isIts pointwise form isTo prove it, use ${\mu }_{>U}\ast 1=ϵ-{\mu }_{\le U}\ast 1$ and $1\ast {\Lambda }_{>V}=\log -1\ast {\Lambda }_{\le V}$. This givesand rearrangement proves the formula, as in the Vaughan identity proof.

The Bombieri–Vinogradov theorem states that for every $A>0$ there is $B>0$ such thatHere $\psi (y;q,a)={\sum }_{\begin{array}{c}n\le y\\ n\equiv a(\mathrm{mod}q)\end{array}}\Lambda (n)$ is the Chebyshev function in an arithmetic progression, and $\varphi$ is the Euler totient function. In particular, partial summation givesafter choosing the logarithmic saving in the weighted theorem sufficiently large and absorbing the prime power terms. This is the offset logarithmic integral function.

For the proof strategy, Orthogonality of Dirichlet characters converts errors in arithmetic progressions into character sums of Dirichlet characters weighted by $\Lambda$. Reduction to primitive Dirichlet characters is followed by the character large sieve, which bounds their mean square by $O((N+Q^2)\sum |a_n{|}^2)$ with the usual $q/\varphi (q)$ weights. The Vaughan identity separates the weighted sums into short terms, Type I sums and Type II sums. Direct inner-sum estimates handle the Type I sums; the Cauchy-Schwarz inequality and the large sieve control the Type II sums. The Siegel–Walfisz theorem supplies arbitrarily strong logarithmic savings for small moduli, where an average estimate alone would not suffice. A dyadic decomposition, suitable $U,V$ and a sufficiently large $B$ absorb the divisor and logarithmic losses. This explains why the range is essentially $Q^2\le x$, with logarithmic room to spare.

The Szemerédi theorem says that for every integer $k\ge 2$ and every $\delta >0$, there is $N_0(k,\delta )$ such that, for $N\ge N_0$, every $A\subseteq \{1,\dots ,N\}$ with $|A|\ge \delta N$ contains a nonconstant arithmetic progressionEquivalently, every subset of the positive integers with positive upper asymptotic density contains arithmetic progressions of every finite length. Length one is immediate.

The Furstenberg multiple recurrence theorem states that for every probability measure-preserving system, every measurable $B$ with $\mu (B)>0$, and every integer $k\ge 2$, there is $n\ge 1$ withHere $T^{-jn}B$ means a preimage, so invertibility is unnecessary. The Furstenberg multiple recurrence theorem also does not assume an ergodic transformation.

We prove the implication to the finite Szemerédi theorem by constructing the Furstenberg correspondence principle explicitly. Suppose, to the contrary, that for fixed $k$ and $\delta >0$ there are $N_{\ell }\to \infty$ and $A_{\ell }\subseteq \{1,\dots ,N_{\ell }\}$ with $|A_{\ell }|\ge \delta N_{\ell }$, but with no length-$k$ arithmetic progression of positive common difference. In the binary full shift $\Omega =\{0,1{\}}^{\mathbb{Z}}$, encode $A_{\ell }$ as $x_j^{(\ell )}=1_{A_{\ell }}(j)$, taking all coordinates outside $A_{\ell }$ to be zero. Let $S$ be the left shift, $(S\omega {)}_j={\omega }_{j+1}$, and setThe cylinder set $C$ is a clopen set, and ${\nu }_{\ell }(C)=|A_{\ell }|/N_{\ell }\ge \delta$. The binary full shift is a compact metric space, so compactness of probability measures on a compact metric space gives a subsequence of these empirical measures with weak convergence of probability measures to a Borel probability measure $\nu$.

For every continuous $h$ on the full shift,Passing to the weak limit shows that $\nu$ is an invariant measure for the continuous left shift. Thus $(\Omega ,\mathcal{B},\nu ,S)$ is a probability measure-preserving system. Since the indicator function of $C$ is continuous, $\nu (C)\ge \delta$.

Apply the Furstenberg multiple recurrence theorem to $C$. For some $n\ge 1$, the clopen sethas $\nu (D)>0$. Its continuous indicator function gives ${\nu }_{\ell }(D)\to \nu (D)>0$. For large $\ell$, at least one $S^a{x}^{(\ell )}$ in the defining empirical measure therefore belongs to $D$. The choice of left shift impliesso $a,a+n,\dots ,a+(k-1)n$ lies in $A_{\ell }$. This contradicts the assumed absence of arithmetic progressions and proves the finite Szemerédi theorem. Applying the finite Szemerédi theorem on intervals where an infinite set has density bounded below proves the stated upper asymptotic density formulation.

For multiple recurrence for circle rotations, write $\mathbb{T}=\mathbb{R}/\mathbb{Z}$ and $R_{\alpha }x=x+\alpha$, with normalized Lebesgue measure $m$, which is the Haar measure of the circle group. Fix a measurable $B\subseteq \mathbb{T}$ with $m(B)>0$ and $k\ge 2$. If $\alpha$ is rational, there is $q\ge 1$ with $R_{\alpha }^q$ the identity, and $n=q$ gives an intersection of measure $m(B)$.

For irrational $\alpha$, the pigeonhole principle applied to $0,\alpha ,\dots ,Q\alpha$ in $Q$ equal arcs gives $1\le n\le Q$ with $\Vert n\alpha {\Vert }_{\mathbb{T}}\le 1/Q$. In particular there are arbitrarily small nonzero returns to zero for the irrational rotation of the circle.

We also need translation continuity in L1 on the circle. Given a measurable $B$, approximate its indicator function in the L1 norm by a continuous $g$ on the circle group. Such approximation follows from regularity of Lebesgue measure, or approximation by finite unions of intervals. Translation invariance and uniform continuity givewhere the approximation error is first made arbitrarily small. Equivalently, $m(B△(B-t))\to 0$.

Choose a return time $n\ge 1$ so small modulo one that for each $1\le j<k$,This is possible because multiplication by each fixed $j$ is continuous on the circle group and translation continuity in L1 on the circle applies to the finitely many translates. The union bound now givesThis proves the Furstenberg multiple recurrence theorem for every circle rotation with its normalized Lebesgue measure, including both rational and irrational angles.

Use the usual convention that a three-term arithmetic progression must be nonconstant. There is a genuine small-case defect in the printed statement: for $n=1$, $\delta =1$, and $A=\{1\}$, neither conclusion can hold with $c_2>0$. We prove the intended Roth density-increment step for every odd integer $n\ge 3$, including the small values of $n$, rather than silently treating $n=1$ as covered. Counting constant arithmetic progressions would make the first alternative vacuous for every nonempty $A$.

Suppose that $A$ has no nonconstant three-term arithmetic progression, and let $\alpha =|A|/n$ be its actual density of a finite subset. Thus $0<\delta \le \alpha \le 1$. Put $I=[n]$, $N=2n+1$, and embed $I$ in the cyclic group $G=\mathbb{Z}/N\mathbb{Z}$. A congruence $x-2y+z=0(\mathrm{mod}N)$ with $x,y,z\in I$ is an equality over the integers, since $|x-2y+z|\le 2(n-1)<N$. Thus this embedding creates no extra three-term arithmetic progressions. Since $N$ is odd, multiplication by two permutes $G$.

Use normalized Fourier analysis on a finite abelian group, with $e_N(t)=\exp (2\pi it/N)$ and $\hat{h}(r)={\mathbb{E}}_{x\in G}h(x)e_N(-rx)$. For the normalized trilinear arithmetic progression count, character orthogonality givesIndeed, expanding each function in its inverse Fourier transform, averaging in $d$ forces $r_2+2r_3=0$, and averaging in $x$ then forces $r_1=r_3$. The Parseval identity in this normalization is ${\sum }_r|\hat{h}(r){|}^2={\mathbb{E}}_x|h(x){|}^2$.

Let $a=1_A$, $b=\alpha 1_I$, and $f=a-b$, the balanced indicator function of a finite subset. Then $\hat{f}(0)=0$. Only constant arithmetic progressions contribute to $\Lambda (a,a,a)$, whereas summing $2\min (y-1,n-y)+1$ over centers $y\in I$ counts $(n^2+1)/2$ ordered three-term arithmetic progressions in $I$. HenceSet $M={\max }_r|\hat{f}(r)|$. Telescope by changing one factor at a time:In the Fourier transform formula for each term, bound the Fourier coefficient of $f$ by $M$ and apply the Cauchy-Schwarz inequality to the other two factors. The permutation $r\mapsto -2r$ preserves the required squared sums. Since $\Vert a{\Vert }_2^2=\alpha n/N$ and $\Vert b{\Vert }_2^2={\alpha }^{2}n/N$, this givesIf $n\ge 4{\delta }^{-2}$, then ${\alpha }^{2}n\ge 4$, so the difference in the other direction is at least ${\alpha }^3{n}^2/(4N^2)$. Consequently Fourier detection of a progression-free subset of an interval gives a nonzero frequency $r$ with

To turn this into a density increment, take $Q=\lfloor \sqrt{n}\rfloor$. The Dirichlet approximation theorem, proved here by placing $0,r/N,\dots ,Qr/N$ into $Q$ equal intervals modulo one, gives $1\le q\le Q$ such that $\Vert qr/N{\Vert }_{\mathbb{R}/\mathbb{Z}}\le 1/Q$. DefineFor $n\ge N_0(\delta )$, the inequalities $Q\ge \sqrt{n}/2$ and ${\delta }^{2}Q/(288\pi )\ge 2$ show thatUse a progression partition with nearly constant linear phase: every residue chain of $I$ modulo $q$ has at least $\lfloor n/q\rfloor \ge Q$ points. Split each chain into blocks of $L$ consecutive chain points, merging any remainder into its last full block. This partitions $I$ into arithmetic progressions $P$ with $L\le |P|<2L$ and common difference $q$.

On a block $P$ with first point $z_P$, the linear phase $\chi (x)=e_N(-rx)$ satisfiesLet $S_P={\sum }_{x\in P}f(x)=|A\cap P|-\alpha |P|$. Freezing the linear phase on each block introduces error at most $({\delta }^2/72)N^{-1}{\sum }_{x\in I}|f(x)|\le {\delta }^2/72$. ThereforeThe block sums total zero. Their positive part consequently totals at least $N{\delta }^2/144$. Since all block lengths total $n$, some block has $S_P/|P|\ge N{\delta }^2/(144n)\ge {\delta }^2/72$. Its density of a finite subset is at least $\alpha +{\delta }^2/72\ge \delta (1+\delta /72)$.

For the remaining $3\le n<N_0(\delta )$, divide $I$ into disjoint consecutive triples and a remainder of at most two points. A three-term-arithmetic progression-free $A$ uses at most two points of each triple, so $\alpha \le 4/5$; the largest ratio occurs at $n=5$. Any singleton set from $A$ then has density of a finite subset one, which is at least $\delta +{\delta }^2/72$. We may therefore use the explicit constantsIn the large case the constructed arithmetic progression has length at least $c_1\sqrt{n}$; in the small case its length one does too. Thus these constants prove the intended result for all odd integers $n\ge 3$.