From 1e2dbd7074af7ae0d54e9a94b1a7843c1d6c9f8a Mon Sep 17 00:00:00 2001
From: Yu Cong <sxlxcsxlxc@gmail.com>
Date: Wed, 5 Nov 2025 00:02:31 +0800
Subject: [PATCH] Update notes.tex

---
 notes.tex | 1 -
 1 file changed, 1 deletion(-)

diff --git a/notes.tex b/notes.tex
index d818dba..156b29d 100644
--- a/notes.tex
+++ b/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}
\ No newline at end of file