In the first few lectures of Graph Theory, the lecturer (Paul Russell) presented a cute application of Ramsey theory to Fermat’s Last Theorem. It makes a great introduction to the general process of casting a problem in one branch of mathematics as a problem in another and is the perfect size for a blog post, so I thought I’d talk about it.

The setup is as follows. One naive way to go about proving the nonexistence of nontrivial integer solutions to (that is, solutions such that are not equal to zero) is using modular arithmetic; that is, one might hope that for every it might be possible to find a modulus such that the equation has no nontrivial solution . To simplify matters, we’ll assume that are relatively prime to , or else there is some subtlety in the definition of “nontrivial” (e.g. we might have not divisible by but .) Note that it might be the case that is not relatively prime to a particular nontrivial solution in the integers, but if we can prove non-existence of nontrivial solutions for infinitely many (in particular, such that any integer is relatively prime to at least one such ) then we can conclude that no nontrivial integer solutions exist.

By the Chinese Remainder Theorem, this is possible if and only if it is possible with a prime power, say . If is relatively prime to , this is possible if and only if it is possible with . This is because given a nontrivial solution we can use Hensel’s lemma to lift it to a nontrivial solution for any (and even to ), and the converse is obvious. (Again to simplify matters, we’ll ignore the finitely many primes that divide .) So we are led to the following question.

For a fixed positive integer do there exist infinitely many primes relatively prime to such that has no nontrivial solutions?

As it turns out, the answer is no. In 1916 Schur found a clever way to prove this by proving the following theorem.

Theorem: For every positive integer there exists a positive integer such that if is partitioned into disjoint subsets , then there exists such that there exist with . In other words, the Schur number exists. (Note that I am using a convention which is off by .)

If we let be a prime greater than and let the be the cosets of the subgroup of powers in , which has index at most , we obtain the following as a corollary.

Corollary: Fix a positive integer . For any sufficiently large prime , there exists a nontrivial solution to .

Ramsey theory

As one might expect, the heart of the proof of Schur’s theorem is Ramsey theory, by which I mean it consists of iterated application of the pigeonhole principle. We induct on . The result is obvious for and gives . For an arbitrary value of we would like to reduce the result to the corresponding result for , which we do as follows. Let be a positive integer to be chosen later. If is partitioned into disjoint subsets , then by pigeonhole at least one, say , has at least elements in it, say . If there is a solution to among these, we are done; otherwise, for any we know that , hence it must be in one of the remaining partitions.

We are done if we can show there exists a triple of indices such that are all in the same partition. (Note that it is not necessary that these numbers be distinct.) A convenient way to recast this problem is to use the language of graph theory. The partitioning of the terms into one of the partitions which is not is equivalent to the coloring of the edges of the complete graph using colors, and we want to find a monochromatic triangle in this graph.

Theorem: For any positive integer , there exists a smallest positive integer such that if the edges of the complete graph are colored using colors, then there exists a monochromatic triangle. In other words, the Ramsey number exists.

Proof. It is not hard to see that . For general we proceed by induction. Let be a positive integer to be chosen later. Pick a vertex . Among the edges attached to , at least will be the same color by pigeonhole. If among the corresponding vertices there is some edge of the same color, we have found a monochromatic triangle; otherwise, these vertices make up a complete graph colored using at most colors and we can use the inductive hypothesis as long as . This gives (in particular exists), hence for example . (The first two are equalities, but the value of is unknown; the best upper bound appears to be due to R. L. Kramer, who showed that .)

Now to complete the proof of Schur’s theorem it suffices to pick large enough so that . This gives (in particular exists).

Comments

What I find instructive about this example is that it is a good illustration of how ignoring extraneous information can help you gain perspective on a problem. The decomposition of into cosets of powers has a lot of structure, but as it turns out, for finding solutions to linear equations like our lives are easier if we ignore that structure, as long as we are willing to make as large as necessary. And in the actual proof of Schur’s theorem, we needed to ignore even more structure (the identity of the numbers ) to get a reduction to a stronger statement on which induction could work. (So this is also an example of strengthening the inductive hypothesis.)

So much for the Ramsey theory. To close, I’d like to make one more comment about the number theory. If we lift the requirement that are relatively prime to , we run into triviality problems. It might be that for some prime power divisor of we have but (for example). So we should insist that this not be the case. But even if it isn’t, if we allow one of to be divisible by then we still get lots of nontrivial solutions for any relatively prime to (not necessarily large). This is again because of Hensel’s lemma; if is relatively prime to then roots of numbers relatively prime to exist in , so we can let (for odd ; we can take for ) and let be an root in . Then this solution reduces to a nontrivial solution for sufficiently large .