  It has been observed independently by many researchers that the isolating cut
lemma of Li and Panigrahi [FOCS 2020] can be easily extended to obtain new
algorithms for finding the non-trivial minimizer of a symmetric submodular
function and solving the hypergraph minimum cut problem. This note contains
these observations.
