Suppose \(\mathbb{K}\) is either \(\mathbb{C}\) or \(\mathbb{R}\), \(x,y\in \mathbb{K}^N\), \(0\le s
where \(x_k^*\) is the \(k\)-th component of the non-increasing rearrangement
of \(x\) and \(\sigma_s(x)_1\) is its s-term approximation error
[1, Lemma 1.14]. References
Link to heading
Compressive Sensing.
Technische Universität Dortmund, 2017.