Under the auspices of the Computational Complexity Foundation (CCF)
We give a new simple proof for the Isolation Lemma, with slightly better parameters, that also gives non-trivial results even when the weight domain $m$ is smaller than the number of variables $n$.
