Update notes.tex

notes.tex

@@ -95,7 +95,6 @@ Then $X$ fails to be a hitting set is equivalent to the fact that there does not
 So $X$ hits all $\{C(B,f)|\forall B\}$ iff there is such a $y$. Minimizing $X$ pushes it to $\supp(yA)$ which is an odd cocycle. Hence, the minimum hitting set for $C(B,f)$ is always an odd cocycle.
 
 The theorem then follows directly from the fact that any cocycle is either odd or even.
-
 \end{proof}
 
 \end{document}