Rado's theorem (Ramsey theory)
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 formula_1 be a system of linear equations, where formula_2 is a matrix with integer entries. This system is said to be formula_3"-regular" if, for every formula_3-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 formula_1 is regular if and only if the matrix "A" satisfies the "columns condition". Let "c" denote the "i"-th column of "A". The matrix "A" satisfies the columns condition provided that there exists a partition "C", "C", ..., "C" of the column indices such that if formula_6, then 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 where "T" ranges over each nonempty subset of the set 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 formula_8. 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: formula_9 Computability. Given a system of linear equations it is a priori unclear how to check computationally that it is regular. Fortunately, Rado'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 "C", "C", ..., "C" 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 "C" 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.