diff --git a/Spatial_sorting/doc_tex/Spatial_sorting/spatial_sorting.tex b/Spatial_sorting/doc_tex/Spatial_sorting/spatial_sorting.tex
index 347787dcb02..a44a5f65370 100644
--- a/Spatial_sorting/doc_tex/Spatial_sorting/spatial_sorting.tex
+++ b/Spatial_sorting/doc_tex/Spatial_sorting/spatial_sorting.tex
@@ -20,7 +20,7 @@ Given an iterator range of points, the function \ccc{hilbert_sort} sorts them
 along the space-filling Hilbert curve.
 Combined with a \ccc{std::random_shuffle}, the function \ccc{spatial_sort} will
 sort points in a way keeping enough randomness to retain theoretical optimality
-for some algorithms\footnote{in fact, this has only been proven for Delaunay triangulation},
+for some algorithms\footnote{in fact, this has only been proved for Delaunay triangulation},
 and close enough to a space-filling curve to speed-up algorithms.
 
 This an example that can considerably speed up the constructions of a Delaunay triangulation.