diff --git a/sections/coherent-families.tex b/sections/coherent-families.tex
@@ -509,9 +509,9 @@ Proposition~\ref{thm:better-sl(n)-parameters}.
We denote by \(\mathscr{B}\) the set of \(\mathfrak{sl}_n\)-sequences \(m\)
which are \emph{not} ordered, but becomes ordered after removing one term. We
also consider the \emph{extremal} subsets \(\mathscr{B}^+ = \{m \in
- \mathscr{B} : (m_2, m_3, \ldots, m_n) \ \text{is ordered}\}\) and
- \(\mathscr{B}^- = \{m \in \mathscr{B} : (m_1, m_2, \ldots, m_{n - 1}) \
- \text{is ordered}\}\).
+ \mathscr{B} : (\widehat{m_1}, m_2, \ldots, m_n) \ \text{is ordered}\}\) and
+ \(\mathscr{B}^- = \{m \in \mathscr{B} : (m_1, \ldots, m_{n - 1},
+ \widehat{m_n}) \ \text{is ordered}\}\).
\end{definition}
% TODO: Add a picture of parts of 𝓑 for n = 3 in here