(⟸) (via contrapositive)
Suppose G does not distinguish k-sparse vectors. Then there is some x=x′ with ∣∣x∣∣0,∣∣x′∣∣0≤k such that Gx=Gx′. Note that ∣∣x−x′∣∣0≤2k, but
Gx−Gx′=G(x−x′)=0 Thus G does not have the 2k NSP.
(⟹)
Now, suppose Gdoes distinguish k sparse vectors. Suppose ∣∣x∣∣0≤2k and x=0. Then there exist x′,x′′k-sparse such that x=x′−x′′. Then
0=Gx′−Gx′′=G(x′−x′′)=Gx
ie G has the 2kNSP.