The “probabilistic method” is the art of applying probabilistic thinking to non-probabilistic problems. Applications of the probabilistic method often feel like magic. Here is my favorite example:
Theorem (Erdös, 1965). Call a set sum-free if for all
, we have
. For any finite set
of positive integers, there is a sum-free subset
of size
.
This theorem seems to have nothing to do with probability. Yet Erdös’s proof relies on a short and beautiful probabilistic argument.
Proof. Erdös’s first insight is to treat the set as living in
for some large prime number
, rather than living in
. Living in
only makes the theorem harder to prove, since any set
that is sum-free in
is also sum-free in
. But, as we shall see,
has several structural properties that Erdös beautifully exploits.
Let be a prime number satisfying
for all
. (The fact that such a prime exists is actually nontrivial, and uses the fact that there are infinitely many primes congruent to
mod
.) We’ll be using
and
throughout the rest of the proof.
Erdös begins his construction by defining a large sum-free set in which is not necessarily a subset of
:
As the name suggests, MIDDLE-THIRD consists of what is roughly the middle third of . One can easily confirm that MIDDLE-THIRD is sum-free in
.
Next, Erdös selects a random value , and examines the set
In words, is the set of
that can be written as
for some
. If we could show that
is a sum-free set of size greater than
, then the proof would be complete.
The good news is that is always sum-free, no matter the value of
. This is because, if we have
for some
, then we also have
, violating the sum-freeness of MIDDLE-THIRD. (Here we are implicitly exploiting a nontrivial property of
, namely that it supports division!)
The bad news is that could potentially be too small. To prove the theorem, we need to show that there is some option for
that results in
.
Rather than directly finding a value of for which
, Erdös instead proves a probabilistic statement: the expected value of
for a randomly chosen
satisfies
. Of course, if
, then there must exist some
for which
. What’s neat is that we don’t actually construct
, we just prove it exists.
Our new challenge is to prove that . One way to think of
is as the number of
for which
. Thus we can expand
as
This is where Erdös really exploits the structure of . In
, every non-zero element
is an additive generator, meaning that the multiples
of
are just the numbers
in some order. The result is that
is just a random element of
, and thus
Putting the pieces together, we have shown that , which implies that there is some
for which
. Since
is sum-free, this completes the proof of the theorem.
Magic!









