diff --git a/docs/general_idea.md b/docs/general_idea.md
index bcadd6f..fcd831a 100644
--- a/docs/general_idea.md
+++ b/docs/general_idea.md
@@ -102,7 +102,7 @@ parity constraint. In a similar vein, we can define the following set of
 polynomial equations to describe codewords:
 
 $$
-F = \left[\begin{array}{c}1 - x_1^2 \\ \vdots\\ 1 - x_n^2 \\ 1 - \prod_{i \in A(1)}x_i \\ \vdots\\ 1 - \prod_{i \in A(m)}x_i\end{array}\right] \overset{!}{=} \bm{0}.
+F(\bm{x}) = \left[\begin{array}{c}1 - x_1^2 \\ \vdots\\ 1 - x_n^2 \\ 1 - \prod_{i \in A(1)}x_i \\ \vdots\\ 1 - \prod_{i \in A(m)}x_i\end{array}\right] \overset{!}{=} \bm{0}.
 $$
 
 This is a problem we can solve using homotopy continuation.