deletions | additions       diff --git a/Numerical Foundation 2.tex b/Numerical Foundation 2.tex  index 7f89567..68a7550 100644  --- a/Numerical Foundation 2.tex  +++ b/Numerical Foundation 2.tex 
...
It can be proven~\cite{Candes2006,Donoho2006,Candes2008} that the number of entries of \(B\) which must be measured in order to fully recover \(A\) by solving the BP problem in eq.~\ref{eq:bpdn} scales as  \begin{align}  \label{eq:csscaling}  M^* M  \propto \mu^2 S \log N^2\ . \end{align}  This scaling equation encapsulates the important aspects of compressed sensing applied to sparse matrices: if a proper basis is chosen, the number of entries which must be measured scales linearly with the the matrix.