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.

Roth's theorem
Let it be a subset of the whole numbers with positive upper density:

-
,
then there are infinitely many arithmetic sequences of length , i.e. of form


with .

variants
Let it be an odd number and . Then for each one , so that for all sets with the inequality







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





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.