The streaming algorithm will use the fact that there exists a linear sketch for \(\ell _p\)  norms.
[Sketching \(\ell _p\)  [1]}]
For any \(m \in \) , \(p \in [1,2]\) , and \(, \delta \in (0,1)\) , let \(s = O(\log (1/\delta )/^2)\) . There exists a distribution \(\)  over \(s \times m\)  matrices, and an algorithm which takes as input a vector in \(^s\) . For any \(x \in ^m\) , with probability at least \(1 - \delta \)  over \(\sim \) , the algorithm on input \(x\) , outputs \(\in _{\ge 0}\)  satisfying

(1-)  xp (1+) xp.
