aboutsummaryrefslogtreecommitdiffstats
path: root/vorlesungen/slides/3/minimalpolynom.tex
diff options
context:
space:
mode:
authorLordMcFungus <mceagle117@gmail.com>2021-03-22 18:05:11 +0100
committerGitHub <noreply@github.com>2021-03-22 18:05:11 +0100
commit76d2d77ddb2bed6b7c6b8ec56648d85da4103ab7 (patch)
tree11b2d41955ee4bfa0ae5873307c143f6b4d55d26 /vorlesungen/slides/3/minimalpolynom.tex
parentmore chapter structure (diff)
parentadd title image (diff)
downloadSeminarMatrizen-76d2d77ddb2bed6b7c6b8ec56648d85da4103ab7.tar.gz
SeminarMatrizen-76d2d77ddb2bed6b7c6b8ec56648d85da4103ab7.zip
Merge pull request #1 from AndreasFMueller/master
update
Diffstat (limited to 'vorlesungen/slides/3/minimalpolynom.tex')
-rw-r--r--vorlesungen/slides/3/minimalpolynom.tex30
1 files changed, 30 insertions, 0 deletions
diff --git a/vorlesungen/slides/3/minimalpolynom.tex b/vorlesungen/slides/3/minimalpolynom.tex
new file mode 100644
index 0000000..2b36a65
--- /dev/null
+++ b/vorlesungen/slides/3/minimalpolynom.tex
@@ -0,0 +1,30 @@
+%
+% minimalpolynom.tex
+%
+% (c) 2021 Prof Dr Andreas Müller, OST Ostschweizer Fachhochschule
+%
+\begin{frame}[t]
+\frametitle{Minimalpolynom}
+\begin{block}{Definition}
+Zu jeder $n\times n$-Matrix $A$
+gibt es ein Polynom $m_A(X)\in\Bbbk[X]$ minimalen Grades $\deg m_A\le n^2$
+derart, dass $m_A(A)=0$.
+\end{block}
+\uncover<2->{%
+\begin{block}{Strategie}
+Das Minimalpolynom ist eine ``Invariante'' der Matrix $A$
+\end{block}}
+\uncover<3->{%
+\begin{block}{Satz von Cayley-Hamilton}
+Für jede $n\times n$-Matrix $A\in M_n(\Bbbk)$ gilt $\chi_A(A)=0$
+\uncover<4->{%
+\[
+\Downarrow
+\]
+Das Minimalpolynom $m_A\in \Bbbk[X]$ ist ein Teiler
+des charakteristischen Polynoms $\chi_A\in \Bbbk[X]$}
+\\
+\uncover<5->{$\Rightarrow $
+Faktorzerlegung on $\chi_A(X)$ ermitteln!}
+\end{block}}
+\end{frame}