DAS small changes

src/year2/distributed-autonomous-systems/sections/_averaging_systems.tex

@@ -284,7 +284,7 @@
         \end{theorem}
 
         \begin{remark}
-            By \Cref{th:lti_continuous}, row/column stochasticity is not required for consensus. Instead, the requirement is for the matrix to be Laplacian.
+            By \Cref{th:lti_continuous}, row/column stochasticity is not required for consensus. Instead, the requirement is for the matrix to be the Laplacian.
         \end{remark}
 \end{description}
 
@@ -314,7 +314,7 @@
 \end{lemma}
 
 \begin{lemma} \phantomsection\label{th:connected_simple_eigenvalue}
-    If a weighted digraph $G$ is strongly connected, then $\lambda = 0$ is a simple eigenvalue.
+    If a weighted digraph $G$ is strongly connected, then $\lambda = 0$ is a simple eigenvalue of $\matr{L}$.
 \end{lemma}
 
 \begin{theorem}[Continuous-time consensus] \marginnote{Continuous-time consensus}