# From Van der Waerden’s Theorem to Roth’s Theorem: Colorings, Density, and Arithmetic Progressions

Abstract

This paper gives an expository introduction to arithmetic progressions in Ramsey theory and additive combinatorics. We begin with the language of colorings, using small examples to illustrate how simple coloring rules can force surprisingly rigid structure. The main result discussed is Van der Waerden’s theorem, which states that every finite coloring of the positive integers contains arbitrarily long monochromatic arithmetic progressions. We prove this theorem using a color-focusing argument, emphasizing the central ideas behind the proof rather than treating it as a purely technical construction. After presenting Van der Waerden’s theorem, we explain how the coloring perspective naturally leads to questions about density. Instead of asking whether a pattern must appear in one color class of every coloring, one can ask whether every sufficiently large subset of the integers must contain the same kind of arithmetic structure. This shift connects Ramsey theory to additive combinatorics and motivates density results such as Roth’s theorem on three-term arithmetic progressions. The goal of this paper is to make these connections accessible, showing how elementary questions about colorings lead to deeper themes involving structure, randomness, and unavoidable patterns in the integers.

Domains and classifications

Version history

Expositio keeps public paper versions together so readers can see the current PDF while still understanding how the record has changed.