Problem 6
Consider an integer , and a set of points in the plane such that the distance between any two different points in is at least . Prove there is a line separating such that the distance from any point of to is at least for some absolute constant . (A line separates a set of points if some segment joining two points in crosses .)
Step 7 of 8: Combine the two bounds
In plain words
The competing estimates force the cubic-root scale.
Detailed analysis
Combining gives for an absolute constant : if this is immediate, while for the left side is at least and rearranging gives the cubic-root bound.