Rado's theorem is a theorem from the branch of mathematics known as Ramsey theory. It is named for the German mathematician Richard Rado. It was proved in his thesis, Studien zur Kombinatorik.

## Statement

Let ${\displaystyle A\mathbf {x} =\mathbf {0} }$  be a system of linear equations, where ${\displaystyle A}$  is a matrix with integer entries. This system is said to be ${\displaystyle r}$ -regular if, for every ${\displaystyle r}$ -coloring of the natural numbers 1, 2, 3, ..., the system has a monochromatic solution. A system is regular if it is r-regular for all r ≥ 1.

Rado's theorem states that a system ${\displaystyle A\mathbf {x} =\mathbf {0} }$  is regular if and only if the matrix A satisfies the columns condition. Let ci denote the i-th column of A. The matrix A satisfies the columns condition provided that there exists a partition C1, C2, ..., Cn of the column indices such that if ${\displaystyle s_{i}=\Sigma _{j\in C_{i}}c_{j}}$ , then

1. s1 = 0
2. for all i ≥ 2, si can be written as a rational[1] linear combination of the cj's in all the Ck with k < i. This means that si is in the linear subspace of Qm spanned by the set of the cj's.

## Special cases

Folkman's theorem, the statement that there exist arbitrarily large sets of integers all of whose nonempty sums are monochromatic, may be seen as a special case of Rado's theorem concerning the regularity of the system of equations

${\displaystyle x_{T}=\sum _{i\in T}x_{\{i\}},}$

where T ranges over each nonempty subset of the set {1, 2, ..., x}.[2]

Other special cases of Rado's theorem are Schur's theorem and Van der Waerden's theorem. For proving the former apply Rado's theorem to the matrix ${\displaystyle (1\ 1\ {-1})}$ . For Van der Waerden's theorem with m chosen to be length of the monochromatic arithmetic progression, one can for example consider the following matrix:

${\displaystyle \left({\begin{matrix}1&1&-1&0&\cdots &0&0\\1&2&0&-1&\cdots &0&0\\\vdots &\vdots &\vdots &\vdots &\ddots &\vdots &\vdots \\1&m-1&0&0&\cdots &-1&0\\1&m&0&0&\cdots &0&-1\end{matrix}}\right)}$

## Computability

Given a system of linear equations it is a priori unclear how to check computationally that it is regular. Fortunately, Radu's theorem provides a criterion which is testable in finite time. Instead of considering colourings (of infinitely many natural numbers), it must be checked that the given matrix satisfies the columns condition. Since the matrix consists only of finitely many columns, this property can be verified in finite time.

However, the subset sum problem can be reduced to the problem of computing the required partition C1, C2, ..., Cn of columns: Given an input set S for the subset sum problem we can write the elements of S in a matrix of shape 1 × |S|. Then the elements of S corresponding to vectors in the partition C1 sum to zero. The subset sum problem is NP-complete. Hence, verifying that a system of linear equations is regular is also an NP-complete problem.

## References

1. ^ Modern graph theory by Béla Bollobás. 1st ed. 1998. ISBN 978-0-387-98488-9. Page 204
2. ^ Graham, Ronald L.; Rothschild, Bruce L.; Spencer, Joel H. (1980), "3.4 Finite Sums and Finite Unions (Folkman's Theorem)", Ramsey Theory, Wiley-Interscience, pp. 65–69.