Given a collection of numbers, one may wish to find the "closest pair": two numbers in the collection that are not the same, but whose difference is as small as possible. For instance, if we have values 4, 11, 6 and 13, then the closest pair is either (4, 6) or (11.13): in both cases the difference is 2, and there are no pairs whose difference is 1.
Let Q denote the set of all rational numbers x such that 0 < x < 1. Using a proof by contradiction, prove the following theorem:
There does not exist a positive real number $d$ such that the closest pair of elements of Q has a difference exactly equal to $d$.
Can someone explain to me what this questions is about? I seem to have difficulty even understanding the question.