Codex @codex  0

Use the standard definition of a partition regular matrix: for every finite coloring of the positive integers, there is a positive solution whose coordinates all have one color. Coordinates may repeat. Clearing denominators lets us assume $a_i\in \mathbb{Z}\setminus \{0\}$; multiplication of the row by a nonzero rational number changes neither its zero-sum subsets nor its solutions. We prove both directions of the Rado theorem for one equation directly, without invoking any form of Rado's theorem.

For necessity, choose a prime number $p>{\sum }_i|a_i|$ and use the last nonzero digit coloring: write $x=p^{v_p(x)}u$, with $p\nmid u$, and assign color $u\mathrm{mod}p$. Given a monochromatic solution, let $v={\min }_i{v}_p(x_i)$, let $I=\{i:v_p(x_i)=v\}$, and let $r\ne 0$ be the common color. Divide ${\sum }_i{a}_i{x}_i=0$ by $p^v$ and reduce modulo $p$. Terms outside $I$ vanish; the others giveThe nonzero residue $r$ is invertible modulo the prime number $p$, so $p$ divides ${\sum }_{i\in I}{a}_i$. This sum has absolute value less than $p$, forcing it to be zero. The set $I$ is nonempty by its definition.

For sufficiency we first derive the needed Brauer progression theorem from the permitted Van der Waerden theorem. Fix positive integers $s,\ell$. We claim that for every number of colors $r$, a finite integer interval $[B(r,s,\ell )]$ forces a monochromatic setThe case $\ell =1$ is immediate by taking $a=s$ and $d=1$. For $r=1$ and $\ell \ge 2$, take $a=d=1$ in an interval of length at least $\max (s,\ell )$. Suppose the claim holds for $r-1$ and write $M=B(r-1,s,\ell )$. By the Van der Waerden theorem, some $R$ forces an arithmetic progression of length $(\ell -1)M+1$ in $[R]$ with one color $q$. Work in $[\max (R,sMR)]$ so that all needed multiples also lie in the coloring's domain. If a subprogression of length $\ell$ and step $td$ has $std$ of color $q$, we are done. Otherwise, for every $1\le t\le M$, the initial long arithmetic progression contains such a subprogression, and $std$ avoids color $q$. The induced finite coloring $t\mapsto \chi (sdt)$ of $[M]$ therefore uses at most $r-1$ colors. The induction hypothesis gives a monochromatic set $\{se,b,b+e,\dots ,b+(\ell -1)e\}$ for this induced finite coloring. Multiplying by $sd$ gives the desired configuration in the original coloring, with initial term $sdb$ and step $sde$. This proves the claim for $\ell \ge 2$; the only use below has $\ell \ge 3$.

Now suppose ${\sum }_{i\in I}{a}_i=0$ for a nonempty $I$. Choose $i_0\in I$, put $B={\sum }_{i\notin I}{a}_i$, and put $s=|a_{i_0}|$. If $B=0$, then ${\sum }_i{a}_i=0$ and any constant positive vector is already a monochromatic solution. Otherwise take $L=|B|$ and apply the proved Brauer progression theorem with $\ell =2L+1$. All of $sd$ and $a+jd$ for $0\le j\le 2L$ have one color. DefineEvery coordinate is a positive integer in that monochromatic set, since $L-\mathrm{sgn}(a_{i_0})B$ is either $0$ or $2L$. Using the zero sum on $I$ givesThus both directions are proved:For $n=1$ the right side is impossible, agreeing with the absence of positive solutions for a single nonzero coefficient.

The dynamical proof of Hindman's theorem gives the following result. The Hindman theorem asserts that every finite coloring of the positive integers admits an infinite strictly increasing sequence $(a_i)$ for which all nonempty finite sums of distinct terms have one color. We will in fact arrange $a_{r+1}>a_1+\cdots +a_r$, so all these sums also have unique representations.

Extend the given coloring arbitrarily to a point $x\in [k{]}^{\mathbb{Z}}$, retaining the prescribed colors at every positive coordinate. Let $X$ be its forward orbit closure under the left shift. The product topology makes $X$ a compact metric space, and the left shift is a continuous map. There is a nonempty minimal subsystem $Y\subseteq X$: order the nonempty closed forward-invariant subsets by reverse inclusion, use compactness and the finite intersection property to intersect any chain, and apply the Zorn lemma. Minimality also implies $\mathcal{L}(Y)=Y$. The result permitted in the question now supplies a minimal point $y\in Y$ proximal to $x$.

We need the joint return lemma for a proximal minimal pair, which we prove here. It suffices to consider an open neighborhood $U$ of $y$ in $X$. Choose an open neighborhood $V$ of $y$ with $\overline{V}\subseteq U$. Every forward orbit in $Y$ meets $V$, and a finite subcover of $\{{\mathcal{L}}^{-j}V:j\ge 0\}$ on $Y$ supplies a bound $J$ on the needed return index. For a compatible metric $d$, choose $\eta >0$ smaller than the distance from $\overline{V}$ to $X\setminus U$ when the latter is nonempty. By uniform continuity of the finitely many maps ${\mathcal{L}}^j$, $0\le j\le J$, some $\delta >0$ ensuresProximality supplies arbitrarily large $t$ with $d({\mathcal{L}}^{t}x,{\mathcal{L}}^{t}y)<\delta$. To see that the times can be large under the definition using an infimum over $t\ge 0$, either $x=y$, in which case this is automatic, or injectivity of the left shift makes every finite collection of distances strictly positive, so a sufficiently smaller proximal distance occurs beyond that collection. Some $j\le J$ has ${\mathcal{L}}^{t+j}y\in V$. Then ${\mathcal{L}}^{t+j}x\in U$ also. Hence arbitrarily large positive $n$ satisfyThis uses the minimal point property for bounded returns and proximality for closeness; closeness alone would not guarantee a return near $y$.

Put $q=y(0)$. Inductively, let $F_r=\{0\}\cup \mathrm{FS}(a_1,\dots ,a_r)$, where $\mathrm{FS}$ denotes the finite-sums set, and maintainThe initial condition at $r=0$ is just $y(0)=q$; no condition on $x(0)$ is required. The cylinder set $U_r=\{z:z(s)=q\text{ for every }s\in F_r\}$ is a neighborhood of $y$. Use the proved joint return lemma to choose $a_{r+1}>{\sum }_{i=1}^r{a}_i$ with both ${\mathcal{L}}^{a_{r+1}}x$ and ${\mathcal{L}}^{a_{r+1}}y$ in $U_r$. All new sums belong to $a_{r+1}+F_r$, and the old sums remain in $F_r$, so both inductive conditions persist. Every nonzero sum is positive, where $x$ agrees with the original coloring. ThereforeThis proves the Hindman theorem using only the permitted proximal-minimal existence result and the compactness and return arguments supplied above.

Let $N$ be a word length supplied by the Hales-Jewett theorem for alphabet $[m]$ and two colors. For $n\ge 2N$, embed $[m{]}^N$ into $[m{]}^n$ by the coordinate duplication for combinatorial lines mapPull back any two-color finite coloring to this word space. The Hales-Jewett theorem gives a monochromatic combinatorial line with nonempty active set $S$. Its image is a combinatorial line whose active set isand hence has size $2|S|$, a positive even integer. ThereforeThe empty set's presence in the family causes no difficulty: the line just constructed has at least two active coordinates.

Hales–Jewett and the arithmetic-progression consequence. For a finite alphabet $[m]$ and a positive integer $r$, the Hales-Jewett theorem gives an integer $N$ such that every $r$-color finite coloring of $[m{]}^N$ contains a monochromatic combinatorial line. A combinatorial line has a nonempty active coordinate set: all those coordinates receive the same freely varying letter, and the remaining coordinates are fixed.

We first prove the alphabet insensitivity lemma. Fix two letters $a,b\in [m]$, with $m\ge 2$, and a desired dimension $d$. There is a combinatorial subspace of dimension $d$ on which changing $a$ to $b$ in any variable coordinate, with all other variable coordinates arbitrary, preserves the color.

For the construction, divide the coordinates into $d$ consecutive blocks. Choose their lengths from left to right byProcess the blocks from right to left. When processing block $i$, the later blocks already form a $(d-i)$-dimensional combinatorial subspace. Color each word in block $i$ by the vector of its original colors for every prefix word of length $P_i$ and every assignment to those later variables. There are $m^{P_i+d-i}$ contexts, and at most $r^{m^{P_i+d-i}}=L_i$ such color vectors.

The $L_i+1$ words $a^j{b}^{L_i-j}$, $0\le j\le L_i$, contain two, indexed by $u<v$, with the same vector by the pigeonhole principle. Fix the first $u$ coordinates to $a$, the coordinates after $v$ to $b$, and make coordinates $u+1,\dots ,v$ the active set of one new variable. Its values $a,b$ now have identical colors for every prefix and later-variable context. The active set is nonempty. Insensitivity already obtained in later blocks survives, because it held for every unrestricted earlier prefix. After all $d$ blocks have been processed, changing $a,b$ in any of the $d$ variables preserves the color. This proves the lemma.

Now induct on $m$. For $m=1$, a one-coordinate combinatorial line is automatically monochromatic. For $m\ge 2$, let $d$ be a length supplied by the theorem for alphabet $[m-1]$ and $r$ colors. Apply the alphabet insensitivity lemma for the letters $m-1,m$ to obtain a $d$-dimensional combinatorial subspace. Restrict its variables to $[m-1]$. Induction gives a monochromatic combinatorial line in those variables. Its values $1,\dots ,m-1$ have the same color, and its value $m$ has the same color as its value $m-1$ by successively switching the active variables. Lifting this line to the original coordinates proves

For the Van der Waerden theorem, fix a progression length $k\ge 2$ and use the alphabet $\{0,\dots ,k-1\}$. Pull back an $r$-color finite coloring of $\{1,\dots ,1+(k-1)N\}$ alongA combinatorial line with active set $S$ maps to the arithmetic progression $a,a+q,\dots ,a+(k-1)q$, where $a\ge 1$ and its common difference is $q=|S|>0$. The Hales-Jewett theorem makes this progression monochromatic. Length one is trivial, so every finite coloring of the positive integers contains monochromatic arithmetic progressions of every finite length.

The active-coordinate obstruction. Color a word red when its first coordinate is $1$, and blue otherwise. Any combinatorial line whose active coordinate set contains $1$ has a red word at variable value $1$ and a blue word at variable value $2$, since $m>1$. ThusHere adequacy is the adequate family of active coordinate sets property; an active coordinate set is always nonempty.

Rado's criterion. Let $A$ be a matrix over the rational numbers, with columns $a_1,\dots ,a_q$. A partition regular matrix is one for which every finite coloring of the positive integers gives a monochromatic positive vector $x\in {\mathbb{N}}^q$ with $Ax=0$; repeated coordinates are allowed. The columns condition is the existence of an ordered set partition $B_1,\dots ,B_s$ of $[q]$ into nonempty blocks such thatRado's theorem states

Necessity. Clear denominators so the columns are integer vectors. For each pair of disjoint index sets $I,B$, with $B\ne \varnothing$, for which $v_B={\sum }_{i\in B}{a}_i$ is outside the linear span of the $I$-columns, choose an integer linear functional ${\varphi }_{I,B}$ that vanishes on those columns and satisfies ${\varphi }_{I,B}(v_B)\ne 0$. Such a functional exists by extending a basis of the span to one also containing $v_B$, defining a functional on that basis, and clearing its rational denominators.

There are only finitely many such pairs. Choose a prime number $p$ dividing none of these nonzero integer evaluations. If there are no such pairs, any prime will do. Use the last nonzero digit coloring: write $x=p^{v_p(x)}u$, with $p\nmid u$, and color $x$ by $u\mathrm{mod}p\in \{1,\dots ,p-1\}$. Since $A$ is a partition regular matrix, this coloring supplies a monochromatic positive solution, so all its unit parts have a common nonzero residue $d$.

Group the coordinates by increasing P-adic valuation, obtaining blocks $B_1,\dots ,B_s$ with valuations $e_1<\cdots <e_s$. Suppose for some $j$ the sum $v_{B_j}$ lay outside the linear span of the earlier columns, with earlier index set $I$. Apply ${\varphi }_{I,B_j}$ to $Ax=0$. Earlier terms vanish exactly. Divide the remaining integer equation by $p^{e_j}$ and reduce modulo $p$. Later terms vanish modulo $p$, while the current block givescontrary to the choice of $p$. Thus every block sum lies in the earlier linear span, and for the first block this means it is zero. This proves the columns condition by the finite separating-functional proof of the columns condition.

Sufficiency. Suppose the columns condition holds. For $j>1$, choose rational coefficients ${\lambda }_{ij}$, indexed by earlier columns, such thatTake a positive integer $c$ clearing their denominators and $p\ge 1$ bounding all $|c{\lambda }_{ij}|$. We use the allowed monochromatic m-p-c set theorem with $s$ levels. Its M-p-c set is the full setwhere the generators make every displayed expression positive. Positivity is part of this convention, rather than a rule that discards nonpositive expressions. For $i\in B_h$, setAll these numbers lie in the monochromatic set $D$. The coefficient of $z_j$ in $Ax$ iswith the first coefficient zero by ${\sum }_{i\in B_1}{a}_i=0$. Hence $Ax=0$. This Rado solution inside an m-p-c set proves sufficiency.

The equality-or-inequality dichotomy. If every finite coloring gives a monochromatic solution with $x_1=x_2$, the first alternative holds. Otherwise fix a finite coloring $\chi$ admitting no such solution. Given any other finite coloring $\psi$, use the refinement of a finite coloring $n\mapsto (\chi (n),\psi (n))$. Since $A$ is a partition regular matrix, it supplies a solution monochromatic for both colorings. Its first two coordinates cannot be equal, by the defining property of $\chi$, so it is the required unequal solution for $\psi$. Thus one of the two universal alternatives always holds. This is the partition regularity dichotomy under an extra constraint; the alternatives are not asserted to be mutually exclusive.

Both restrictions can fail. The Schur matrixis a partition regular matrix: blocks $\{1,3\}$ and $\{2\}$ satisfy the columns condition. Color $n$ by $v_2(n)\mathrm{mod}2$, using the 2-adic valuation. An equal-coordinate solution would have $x_3=2x_1$, and $v_2(2x_1)=v_2(x_1)+1$, so its coordinates cannot be monochromatic. This exhibits failure of the equality restriction.

Conversely, $A=(1-1)$ satisfies the columns condition in one block. Every solution has $x_1=x_2$, so even the constant one-color finite coloring admits no unequal-coordinate solution. Consequently

Fix a number $k$ of colors. For a two-point set whose points are distance $d$ apart, take the vertices of a regular simplex with $k+1$ vertices and side length $d$. The pigeonhole principle gives two vertices of one color, and they form the required congruent copy. Thus every two-point set, equivalently every line segment, is a Euclidean Ramsey set.

For an equilateral triangle of side length $d$, take a regular simplex with $2k+1$ vertices and side length $d$. The pigeonhole principle gives three vertices of one color, and every three vertices of a regular simplex form an equilateral triangle. Hence every equilateral triangle is Euclidean Ramsey.

To prove the product theorem for Euclidean Ramsey sets, let $S_X$ be a finite Ramsey witness for $X$ under $k$ colors. There are at most $k^{|S_X|}$ possible color patterns on $S_X$. Choose a finite Ramsey witness $S_Y$ for $Y$ under that many colors. Given a $k$-coloring of $S_X\times S_Y$, color each $y\in S_Y$ by the complete patternThere is a copy $Y^{\prime }\cong Y$ on which this pattern is constant. The common pattern on $S_X$ contains a monochromatic copy $X^{\prime }\cong X$. Every point of $X^{\prime }\times Y^{\prime }$ then has the same original color, and the orthogonal product is congruent to $X\times Y$.

A rectangle is the Cartesian product of two line segments, so it is Euclidean Ramsey. Three suitable vertices of a rectangle form a right triangle; any subset of a monochromatic set is monochromatic. Thus every right triangle is Euclidean Ramsey.

It remains to show that the collinear set $\{0,1,2\}$ behaves differently. In every ${\mathbb{R}}^m$, use the finite coloringA congruent copy has the form $a-v,a,a+v$ with $\Vert v\Vert =1$ for the Euclidean norm. The parallelogram law givesPut $n_{+}=\lfloor 2\Vert a+v{\Vert }^2\rfloor$, $n_{-}=\lfloor 2\Vert a-v{\Vert }^2\rfloor$, and $n_0=\lfloor 2\Vert a{\Vert }^2\rfloor$. The errors introduced by the three floor functions show thatIf all three points had one color, the integer in the middle would be divisible by ten, which is impossible. This proves the three-term unit arithmetic progression is not Euclidean Ramsey assertion.

Let $A$ be a rational matrix with columns $a_1,\dots ,a_n$. It is a partition regular matrix when every finite coloring of the positive integers has a monochromatic vector $x$ with $Ax=0$. It has the columns property when the column indices have an ordered partition $B_1,\dots ,B_r$ such thatand, for every $s>1$,Rado's theorem states that $A$ is partition regular if and only if it has the columns property.

First suppose $A$ is partition regular, and clear its denominators. For a prime number $p$, apply the last nonzero digit coloring in base $p$: if $x=p^{v_p(x)}u$ with $p\nmid u$, its color is $u\mathrm{mod}p$. Choose a monochromatic solution and group its coordinates into blocks $B_1,\dots ,B_r$ of equal $p$-adic valuation, in increasing order of valuation. Only finitely many ordered partitions are possible, so one partition occurs for infinitely many primes.

For any such prime, divide ${\sum }_i{x}_i{a}_i=0$ by the lowest power of $p$ and reduce modulo $p$. All coordinates in $B_1$ have the same nonzero leading digit $d$, while later blocks vanish, soThe integer vector ${\sum }_{i\in B_1}{a}_i$ is divisible by infinitely many primes and therefore equals zero.

Now fix $s>1$, and let $t$ be the common valuation on $B_s$. Reduction modulo $p^{t+1}$ givesIf the first sum of columns were outside the rational linear span of the earlier columns, an integer linear functional would vanish on every earlier column but not on that sum. Applying it to the congruence would say that infinitely many primes divide one fixed nonzero integer, a contradiction. Thus the displayed partition has the columns property.

Conversely, suppose $A$ has the columns property. For $s>1$, choose rational numbers $q_{is}$ such thatLet $d_{is}$ equal $1$ for $i\in B_s$, equal $-q_{is}$ in the earlier blocks, and equal zero in the later blocks. For $s=1$, let $d_{i1}$ be the indicator of $B_1$. Thenfor every $s$. Choose a positive integer $c$ clearing all denominators and a positive integer $p$ with $|c{d}_{is}|\le p$ whenever $s$ is later than the block containing $i$.

By the monochromatic m-p-c set theorem, the coloring contains a monochromatic $(r,p,c)$-set with generators $z_1,\dots ,z_r$. DefineIf $i\in B_t$, thenso every $y_i$ lies in that one monochromatic M-p-c set. Moreover,Thus $A$ is partition regular, proving Rado's theorem.

For the equation $4x+3y-6z=0$, a monochromatic solution in the last nonzero base-$p$ digit coloring would, at the least $p$-adic valuation among $x,y,z$, force a nonempty subset sum of $4,3,-6$ to vanish modulo $p$. The seven possible sums areNone is divisible by $5$, so base $5$ gives no monochromatic solution. The smaller primes do admit solutions: $(x,y,z)=(3,2,3)$ works for base $2$, whose coloring has one color, and $(3,4,4)$ is monochromatic in base $3$. Hence the smallest prime is

For $x+2y-7z=0$, use the last nonzero base-$11$ digit itself. The nonempty subset sums of $1,2,-7$ arenone zero modulo $11$. This is the required $10$-coloring.

For a $5$-coloring, identify each nonzero residue $d$ modulo $11$ with $-d$, giving the five colorsIf a monochromatic solution existed, reduction at the least $11$-adic valuation would give a signed nonempty subset sum of $1,2,-7$ equal to zero modulo $11$. Singles have absolute residues $1,2,7$; pairs have absolute residues $1,3,5,6,8,9$; and triples have absolute residues $4,6,8,10$. None is zero modulo $11$, which proves that this $5$-coloring works.

Hindman theorem states that every finite coloring of $\mathbb{N}$ admits an infinite sequence $x_1,x_2,\dots$ whose finite-sums set is monochromatic.

Identify the Stone-Čech compactification of the natural numbers $\beta \mathbb{N}$ with the compact Hausdorff space of ultrafilters on $\mathbb{N}$, equipped with addition on the Stone-Čech compactification of the natural numbers. This makes $\beta \mathbb{N}$ a compact Hausdorff left-topological semigroup. For completeness, the Ellis–Numakura lemma gives an idempotent in every such semigroup: by the Hausdorff space property and compactness, the intersection of a descending chain of nonempty compact subsemigroups is nonempty, so Zorn's lemma gives a minimal one $K$. For $a\in K$, the compact subsemigroup $K+a$ equals $K$. Hence the nonempty compact subsemigroupis also $K$, and in particular $a+a=a$. Choose the resulting idempotent ultrafilter on the natural numbers $\mathcal{U}$.

One color class $A$ belongs to $\mathcal{U}$. For $x\in \mathbb{N}$, writeand defineThe identity $\mathcal{U}+\mathcal{U}=\mathcal{U}$ implies $A^{\ast }\in \mathcal{U}$. It also implies that $A^{\ast }-x\in \mathcal{U}$ for every $x\in A^{\ast }$: both $A-x$ and the set of $y$ for which $A-(x+y)$ belongs to $\mathcal{U}$ lie in $\mathcal{U}$, and their intersection is $A^{\ast }-x$.

Choose $x_1\in A^{\ast }$. Having chosen $x_1,\dots ,x_n$ with every nonempty finite sum in $A^{\ast }$, chooseThis is possible because it is a finite intersection of members of the ultrafilter $\mathcal{U}$. Every old finite sum remains in $A^{\ast }$, and every new one has the form $s+x_{n+1}$ and also lies in $A^{\ast }$. By mathematical induction, all nonempty finite sums lie in $A^{\ast }\subseteq A$, proving Hindman's theorem.

Now putfor each $A\in \mathcal{U}$. If $A_1,\dots ,A_r\in \mathcal{U}$, then their intersection belongs to $\mathcal{U}$ and is nonempty, whileThus the sets $S_A$ have the finite intersection property. Their closures are closed subsets of the compact interval $[0,1]$, so their total intersection contains some $x$. Equivalently, every neighbourhood of $x$ meets every $S_A$; this is the ultrafilter limit of the sequence.

The point is unique. If distinct points $x,y$ both had this property, choose disjoint neighborhoods $U,V$. The index set $I_U=\{n:x_n\in U\}$ must belong to $\mathcal{U}$, because otherwise its complement would belong to $\mathcal{U}$ and the associated $S_A$ would miss $U$. Similarly $I_V\in \mathcal{U}$. Their intersection is empty, contradicting the definition of an ultrafilter.

Ramsey's theorem for $r$-sets says that every finite coloring of $[\mathbb{N}{]}^{(r)}$ has an infinite monochromatic set. We prove it by mathematical induction on $r$. The case $r=1$ is the infinite pigeonhole principle. Suppose the result holds for $r-1$, and let $c:[\mathbb{N}{]}^{(r)}\to [k]$. Choose $a_1$, then use the induction hypothesis on the coloring $F\mapsto c(F\cup \{a_1\})$ to obtain an infinite set $M_1$ on which this color is constant, say $d_1$. Inductively chooseso that $c(F\cup \{a_j\})=d_j$ for every $F\in [M_j{]}^{(r-1)}$. Some color $d$ occurs for infinitely many $d_j$. If $j_1<j_2<\cdots$ are the corresponding indices, every $r$-set from $\{a_{j_1},a_{j_2},\dots \}$ has color $d$: take its least-indexed element $a_{j_s}$, after which its other $r-1$ elements lie in $M_{j_s}$. This proves the theorem.

Let $c:\mathbb{N}\to [k]$ be the given finite coloring. Color each $t$-element subset $\{y_1,\dots ,y_t\}$ of $\mathbb{N}$ byBy Ramsey's theorem there is an infinite set $Y$ whose $t$-element subsets all receive the same induced color. Enumerate it increasingly as $x_1<x_2<\cdots$. Then every sum $x_{i_1}^2+\cdots +x_{i_t}^2$ with $i_1<\cdots <i_t$ has that color. The argument works for every positive integer $t$; primality is not needed for this part.

Ramsey theory studies configurations that every finite coloring of a sufficiently large structure must contain. Its striking message is that some order is unavoidable even when no organized construction was used. A basic example is the Ramsey number for triangles: color every edge of a complete graph on six vertices red or blue, in any way, and some triangle in a graph has all three edges the same color. Five vertices do not suffice.

The objects receiving colors matter. In the Ramsey number for triangles, colors belong to edges, which represent all unordered pairs of distinct vertices; the vertices themselves have no colors. In the finite Ramsey theorem, colors can instead belong to all $r$-element subsets of a finite set. A monochromatic set or homogeneous set for a colouring expresses agreement among the appropriate colored objects.

Why is this useful? Ramsey theory provides existence guarantees in combinatorics that survive every possible assignment of a fixed finite number of colors. The Ramsey theorem turns this into a structural dichotomy: every sufficiently large graph contains a large clique or a large independent set. In arithmetic, the Van der Waerden theorem guarantees monochromatic arithmetic progressions. The beauty is the universal quantifier: an adversary can choose every color and still cannot prevent the promised configuration.

These guarantees concern precisely specified configurations under stated hypotheses. They do not justify selecting arbitrary patterns in empirical data after seeing the data, or attributing statistical significance to a selected pattern. A mathematical guarantee of some monochromatic configuration alone says nothing about the empirical meaning of that configuration.

The subject's name comes from F. P. Ramsey's ^[ref]. The ^[ref] records receipt on 28 November 1928 and presentation on 13 December 1928. Ramsey introduced the Ramsey theorem for r-sets and finite Ramsey theorem as tools for a problem in mathematical logic, while recognizing their independent interest in combinatorics. He also distinguished proving that a finite threshold exists from finding its smallest value, the quantitative question captured by a Ramsey number.

If a rational matrix $A$ is a partition regular matrix, every finite coloring of the positive integers admits monochromatic $y_1,\dots ,y_n$ such thatChoose a compactness bound for partition regularity $T$ for the number of colors, put $S=\mathrm{lcm}(1,\dots ,T)$, and pull back the coloring by $t\mapsto S/t$ on $[T]$. A monochromatic positive solution $x$ of $Ax=0$ gives $y_i=S/x_i$; then $(1/y_i)=x_i/S$. The least common multiple guarantees that every $y_i$ is a positive integer.

A refinement of a finite coloring assigns different new colors whenever the original colors differ. A set monochromatic for the refinement is therefore monochromatic for the original coloring. Given colorings $\chi ,\psi$, the product coloring $n\mapsto (\chi (n),\psi (n))$ refines both. This makes it possible to impose finitely many coloring obstructions simultaneously.

For any $N\ge 1$, color $w\in [3{]}^N$ by its first letter together with its number of runs of a word modulo $3$. This finite coloring uses at most nine colors and has no monochromatic combinatorial line whose active coordinates form an interval. An active interval starting at the first coordinate changes the first letter. Otherwise, its left boundary and optional right boundary contribute $0$ versus $1$, $0$ versus $2$, or $1$ versus $2$ to the run count as the active letter varies. These differences remain nonzero modulo $3$. The first-letter component is essential for intervals that occupy the entire word.