diff --git a/paper/Divilkovskiy2024SourceSpace_en.pdf b/paper/Divilkovskiy2024SourceSpace_en.pdf
index 1e7e0c6..7fb12dd 100644
Binary files a/paper/Divilkovskiy2024SourceSpace_en.pdf and b/paper/Divilkovskiy2024SourceSpace_en.pdf differ
diff --git a/paper/Divilkovskiy2024SourceSpace_en.synctex.gz b/paper/Divilkovskiy2024SourceSpace_en.synctex.gz
index f3068a8..55b8fa3 100644
Binary files a/paper/Divilkovskiy2024SourceSpace_en.synctex.gz and b/paper/Divilkovskiy2024SourceSpace_en.synctex.gz differ
diff --git a/paper/Divilkovskiy2024SourceSpace_en.tex b/paper/Divilkovskiy2024SourceSpace_en.tex
index d3eed50..6121121 100644
--- a/paper/Divilkovskiy2024SourceSpace_en.tex
+++ b/paper/Divilkovskiy2024SourceSpace_en.tex
@@ -239,7 +239,7 @@ \section{Pairwise correlation between time series as the distance function}
 \end{align*}
 $$ \blacksquare $$
 
-\textbf{Consequence. (A trivial method for obtaining a pair of possible answers.)} This theorem shows that using pairwise correlation as a distance function gives at most \textit{two} different answers when recovering. Moreover, having obtained one, one can explicitly find the second one. Then, to find both possible answers, it is proposed to apply any non-convex optimisation method to find at least one of the minimum of the function. Therefore with the formula above we are able to find another minimum.
+\textbf{Corollary. (A trivial method for obtaining a pair of possible answers.)} This theorem shows that using pairwise correlation as a distance function gives at most \textit{two} different answers when recovering. Moreover, having obtained one, one can explicitly find the second one. Then, to find both possible answers, it is proposed to apply any non-convex optimisation method to find at least one of the minimum of the function. Therefore with the formula above we are able to find another minimum.
 
 \begin{figure}[H]
 	\centering