A sharp threshold for van der Waerden's theorem in random subsets

We establish sharpness for the threshold of van der Waerden's theorem in random subsets of ℤ/nℤ. More precisely, for k≥3 and Z ⊆ ℤ/nℤ say Z has the van der Waerden property if any two-colouring of Z yields a monochromatic arithmetic progression of length k. Rödl and Rucinski (1995) determined the threshold for this property for any k and we show that this threshold is sharp. The proof is based on Friedgut's criterion (1999) for sharp thresholds and on the recently developed container method for independent sets in hypergraphs by Balogh, Morris and Samotij (2015) and by Saxton and Thomason (2015).