Documentation

LeanPool.JohnsonLindenstraussLean

The Johnson–Lindenstrauss Lemma and Quantized JL #

Source: doi:10.1090/conm/026/737400 Authors: claytomode Status: verified Main declarations: JL.johnson_lindenstrauss, JL.johnson_lindenstrauss_pointset Tags: dimensionality-reduction, random-projection, johnson-lindenstrauss, gaussian, quantization MSC: 68W20, 60G15, 68P05

Mathematical overview #

This project formalizes the Johnson–Lindenstrauss lemma end to end: a random Gaussian projection into k dimensions preserves pairwise distances of a finite point set up to a (1 ± ε) factor with positive probability, so a distortion-ε embedding of any m-point set exists once k is logarithmic in m.

Projection, Rotation, and NormPreservation build the Gaussian random projection and the per-vector norm-concentration bound from Gaussian rotation invariance and the chi-squared law (SquaredGaussian, ChiSquared). Lemma supplies the abstract probabilistic-method union bound (JL.johnson_lindenstrauss), which EndToEnd instantiates to the pointset statement JL.johnson_lindenstrauss_pointset.

InnerProduct, QJL, GaussianTail, and QJLDistortion develop the quantized Johnson–Lindenstrauss (QJL) one-bit sign sketch: unbiasedness of the asymmetric 1-bit estimator and its sub-Gaussian distortion/concentration bound.