Английская Википедия:Corners theorem
In arithmetic combinatorics, the corners theorem states that for every <math>\varepsilon>0</math>, for large enough <math>N</math>, any set of at least <math>\varepsilon N^2</math> points in the <math>N\times N</math> grid <math>\{1,\ldots,N\}^2</math> contains a corner, i.e., a triple of points of the form <math>\{(x,y), (x+h,y), (x,y+h)\}</math> with <math>h\ne 0</math>. It was first proved by Miklós Ajtai and Endre Szemerédi in 1974 using Szemerédi's theorem.[1] In 2003, József Solymosi gave a short proof using the triangle removal lemma.[2]
Statement
Define a corner to be a subset of <math>\mathbb{Z}^2</math> of the form <math>\{(x,y), (x+h,y), (x,y+h)\}</math>, where <math>x,y,h\in \mathbb{Z}</math> and <math>h\ne 0</math>. For every <math>\varepsilon>0</math>, there exists a positive integer <math>N(\varepsilon)</math> such that for any <math>N\ge N(\varepsilon)</math>, any subset <math>A\subseteq\{1,\ldots,N\}^2</math> with size at least <math>\varepsilon N^2</math> contains a corner.
The condition <math>h\ne 0</math> can be relaxed to <math>h>0</math> by showing that if <math>A</math> is dense, then it has some dense subset that is centrally symmetric.
Proof overview
What follows is a sketch of Solymosi's argument.
Suppose <math>A\subset\{1,\ldots,N\}^2</math> is corner-free. Construct an auxiliary tripartite graph <math>G</math> with parts <math>X=\{x_1,\ldots,x_N\}</math>, <math>Y=\{y_1,\ldots,y_N\}</math>, and <math>Z=\{z_1,\ldots,z_{2N}\}</math>, where <math>x_i</math> corresponds to the line <math>x=i</math>, <math>y_j</math> corresponds to the line <math>y=j</math>, and <math>z_k</math> corresponds to the line <math>x+y=k</math>. Connect two vertices if the intersection of their corresponding lines lies in <math>A</math>.
Note that a triangle in <math>G</math> corresponds to a corner in <math>A</math>, except in the trivial case where the lines corresponding to the vertices of the triangle concur at a point in <math>A</math>. It follows that every edge of <math>G</math> is in exactly one triangle, so by the triangle removal lemma, <math>G</math> has <math>o(|V(G)|^2)</math> edges, so <math>|A|=o(N^2)</math>, as desired.
Quantitative bounds
Let <math>r_{\angle}(N)</math> be the size of the largest subset of <math>[N]^2</math> which contains no corner. The best known bounds are
- <math>\frac{N^2}{2^{(c_1+o(1))\sqrt{\log_2 N}}}\le r_{\angle}(N)\le \frac{N^2}{(\log\log N)^{c_2}},</math>
where <math>c_1\approx 1.822</math> and <math>c_2\approx 0.0137</math>. The lower bound is due to Green,[3] building on the work of Linial and Shraibman.[4] The upper bound is due to Shkredov.[5]
Multidimensional extension
A corner in <math>\mathbb{Z}^d</math> is a set of points of the form <math>\{a\}\cup\{a+he_i:1\le i\le d\}</math>, where <math>e_1,\ldots,e_d</math> is the standard basis of <math>\mathbb{R}^d</math>, and <math>h\ne 0</math>. The natural extension of the corners theorem to this setting can be shown using the hypergraph removal lemma, in the spirit of Solymosi's proof. The hypergraph removal lemma was shown independently by Gowers[6] and Nagle, Rödl, Schacht and Skokan.[7]
Multidimensional Szemerédi's Theorem
The multidimensional Szemerédi theorem states that for any fixed finite subset <math>S\subseteq\mathbb{Z}^d</math>, and for every <math>\varepsilon>0</math>, there exists a positive integer <math>N(S,\varepsilon)</math> such that for any <math>N\ge N(S,\varepsilon)</math>, any subset <math>A\subseteq\{1,\ldots,N\}^d</math> with size at least <math>\varepsilon N^d</math> contains a subset of the form <math>a\cdot S+h</math>. This theorem follows from the multidimensional corners theorem by a simple projection argument.[6] In particular, Roth's theorem on arithmetic progressions follows directly from the ordinary corners theorem.
References
External links
- Proof of the corners theorem on polymath.
