This article deals with the "Roth theorem" on arithmetic sequences, for the theorem on Diophantine approximation see
Thue-Siegel-Roth theorem .
The set of Roth is a theorem from the mathematical field of number theory . It says that in certain subsets of the whole numbers there are infinitely many arithmetic sequences of length . It was later generalized by Szemerédi's theorem.
![3](https://wikimedia.org/api/rest_v1/media/math/render/svg/991e33c6e207b12546f15bdfee8b5726eafbbb2f)
Roth's theorem
Let it be a subset of the whole numbers with positive upper density:
![A \ subset \ Z](https://wikimedia.org/api/rest_v1/media/math/render/svg/7b98aa54c47ddd4d3e05d0e63a472cd4beb55cb5)
-
,
then there are infinitely many arithmetic sequences of length , i.e. of form
![3](https://wikimedia.org/api/rest_v1/media/math/render/svg/991e33c6e207b12546f15bdfee8b5726eafbbb2f)
![\ left \ {a, a + r, a + 2r \ right \} \ subset A](https://wikimedia.org/api/rest_v1/media/math/render/svg/f9150cd182e11226b32525ae620aecb5d23374bb)
with .
![a \ in \ Z, r \ in \ N _ {> 0}](https://wikimedia.org/api/rest_v1/media/math/render/svg/e0495f0915af02fec41f95a59404e8363e4b43d1)
variants
Let it be an odd number and . Then for each one , so that for all sets with the inequality
![N](https://wikimedia.org/api/rest_v1/media/math/render/svg/f5e3890c981ae85503089652feb48b191b57aae3)
![{\ displaystyle G = \ mathbb {Z} / N \ mathbb {Z}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/b8026dab1bd5d541800217f9f018c0f636201d70)
![\ alpha \ in \ left (0.1 \ right)](https://wikimedia.org/api/rest_v1/media/math/render/svg/54d4259dce4256dad028c336814ab6f73830fc5f)
![c_ \ alpha> 0](https://wikimedia.org/api/rest_v1/media/math/render/svg/4d3d9cd1b9df8eeb461f8ee639f40b9f553ca839)
![{\ displaystyle A \ subset \ mathbb {Z} / N \ mathbb {Z}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/8ada9f9df3b0ddfb5762d82328e1b6d0d6f5b3f0)
![\ sharp A \ ge \ alpha N](https://wikimedia.org/api/rest_v1/media/math/render/svg/ce0edb19b97655bcbdc2fba7f790aeb5e18faa54)
![{\ displaystyle \ sharp \ left \ {x, r \ in \ mathbb {Z} / N \ mathbb {Z} \ colon x, x + r, x + 2r \ in A \ right \} \ geq c _ {\ alpha } N ^ {2}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/922e6faf0e6dca0357cad1da8a87f48a331c29d7)
applies.
This rate applies generally for 2-divisible groups: It is a compact 2-divisible Abelian group with Haarschem probability , then, for every one , so that for every measurable set with the inequality
![\ mu](https://wikimedia.org/api/rest_v1/media/math/render/svg/9fd47b2a39f7a7856952afec1f1db72c67af6161)
![\ alpha \ in \ left (0.1 \ right)](https://wikimedia.org/api/rest_v1/media/math/render/svg/54d4259dce4256dad028c336814ab6f73830fc5f)
![A \ subset G](https://wikimedia.org/api/rest_v1/media/math/render/svg/215c399a77f078e27c15cf95c5e27c53b9d93aae)
![\ mu (A) \ ge \ alpha](https://wikimedia.org/api/rest_v1/media/math/render/svg/c9ff8f651c6d277a864088ea257e0a6f70bf0852)
![{\ displaystyle \ int _ {G} \ int _ {G} 1_ {A} (x) 1_ {A} (x + r) 1_ {A} (x + 2r) \, \ mathrm {d} \ mu ( x) \ mathrm {d} \ mu (r) \ geq c _ {\ alpha}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/791636c3967ae2c7cbec6c279266c1a8bc2e4df8)
applies.
A stronger form is the Roth-Khintschin theorem .
literature
Web links
Individual evidence
-
↑ Varnavides: On Certain sets of positive density. J. London Math. Soc. 34 1959 358-360.
-
↑ Meshulam: On subsets of finite abelian groups with no 3-term arithmetic progressions. J. Combin. Theory Ser. A 71 (1995), no. 1, 168-172.