The statement
For any set
X ⊂ ℝⁿwith|X| = N, there exists a matrixΠ ∈ ℝ^{m×n}withm = O((1/ε²)·log N)such that for allx, y ∈ X,‖Πx − Πy‖ = (1 ± ε)‖x − y‖.
- The target dimension depends on
logof the number of points, not on the ambient dimensionn1:13:37.
Optimality
- For linear sketches this is optimal:
m = Ω(min{n, (1/ε²)·log N})is necessary — there exist point setsXthat genuinely require it1:13:37,1:14:16. - Why the
minwithn: you can always takeΠ = I, so no lower bound can ever exceedn(an audience member supplies this). Theminsays: use JL until the identity matrix becomes the better choice1:15:00,1:15:12.
Proof strategy: distributional JL plus a union bound
- Design a distribution
Dover matrices such that for every unit vectorz ∈ ℝⁿ:Pr_{Π ~ D}[ |‖Πz‖ − 1| > ε ] ≤ δ1:15:27,1:16:07. - Set
δ = 1/(N choose 2)and apply it toz = (x − y)/‖x − y‖for each pairx, y ∈ X1:16:07. - A union bound over all pairs shows one
Πworks for all of them simultaneously1:17:05.
The distribution: random signs again
D= uniform overm × nmatrices of±1/√mentries, withm = O((1/ε²)·log(1/δ))1:17:34.- The
log(1/δ)here is exactly what turns into thelog Nin the lemma1:17:34.
Why it works (sketched in words, no board proof)
- It is the same computation as the beginning of the lecture, but instead of stopping at the second moment (Chebyshev), you take a much higher moment
1:18:10,1:18:31,1:19:10. - Which moment:
log(1/δ)— the same choice students made in the problem set proving the Chernoff bound via moments, and for the same reason1:18:31,1:18:49. - The computation is hairier than the problem-set version; simpler routes exist, but the machinery is already familiar
1:19:10,1:19:25.
flowchart TD
C["Chebyshev = 2nd moment"] -->|"failure prob ~ 1/3"| A["AMS: m = O(1/ε²)"]
A -->|"median of log(1/δ) copies"| M["failure prob δ"]
C -.->|"instead: take the<br/>log(1/δ)-th moment directly"| J["Distributional JL:<br/>m = O((1/ε²)log(1/δ))"]
J -->|"δ = 1/(N choose 2), union bound"| JL["JL Lemma:<br/>m = O((1/ε²)log N)"]