Szemerédi's theorem
Statement
For a subset , define its upper density by
and say that has positive upper density if this quantity is . For an integer , an arithmetic progression of length is a set of the form with positive integers.
Let have positive upper density. Then for every positive integer , the set contains an arithmetic progression of length .
Equivalently, in finitary form: for every positive integer and every real there exists a positive integer such that for every , every subset of of size at least contains an arithmetic progression of length . Writing for the largest cardinality of a subset of containing no arithmetic progression of length , this asserts that for every fixed ,
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.