Epsilon Nets
A common technique in arguments in sketching is to appeal to the concept of an Epsilon Net. This article explains what that is and why it always exists.
We will be working in the column space of a matrix . Without loss of generality, we will assume that has orthonormal columns; if it doesn’t, we can always find an orthonormal basis for its column space by considering its SVD, , and redefining . That is enough because the set is the same as the set where is the rank of .
Definition: Define the set . An -net is a subset such that, for every , there exists a such that .
Existence
Lemma: For , there exists an -net for the set (defined above) whose size is at most .
Proof: Let’s consider the unit sphere in . Instead of finding a net for , we will argue by finding a net for . That’s because provides an isometry when operating on the unit sphere, so that a net for gives us a net for the image of under .
Finding a net over the unit sphere is trivial. We can choose a maximal set such that no two points in the set are within distance from each other. This means that balls of radius centered at points in are disjoint. These balls all fit in the ball with radius centered at the origin. The volume of this enlarged ball is times larger than the small balls. As such, there can be at most small balls, implying that . [This is the covering number of the unit sphere, which is a compact set.]
Now let . We can show by contradiction that, for any there must exist a point in such that . Suppose there exists no such for some for some . That implies that, there exists no point in for which . But that contradicts our construction of .