update: auto commit

This commit is contained in:
2026-04-10 03:12:03 -04:00
parent 3c5c74dc22
commit 203c6bb988
+1 -1
View File
@@ -919,7 +919,7 @@ $}
\end{frame} \end{frame}
\begin{frame}{Appendix}{Why can't we fully automate the workflow using Mathematica?} \begin{frame}{Appendix}{Why can't we fully automate the workflow using Mathematica?}
The correct way is to check the geometric multiplicity for each eigenvalues. Say we get eigenvalues $\lambda_1, ..., \lambda_k$ with the algebraic multiplicity $m_1, ..., m_k$. Under the assumption that all these eigenvalues are different from each other, we check $\dim\ker(A - \lambda_i I)$ for each $i$. $\dim\ker(A - \lambda_i I) \leq m_i$, so we just have to find the condition The correct way is to check the geometric multiplicity for each eigenvalues. Say we get eigenvalues $\lambda_1, ..., \lambda_k$ with the algebraic multiplicity $m_1, ..., m_k$. Under the assumption that all these eigenvalues are different from each other, we check $\dim\ker(A - \lambda_i I)$ for each $i$. $\dim\ker(A - \lambda_i I) \leq m_i$, so we just have to find the condition for $\dim\ker(A - \lambda_i I) \geq m_i$. $\dim\ker(A - \lambda_i I) = n - \rank(A - \lambda_i I)$, so we check $\rank(A - \lambda_i I) \leq n - m_i$.
\end{frame} \end{frame}
\end{document} \end{document}