[Analysis] More Linear Algebra

This commit is contained in:
RobinB27
2026-01-28 12:06:43 +01:00
parent ebd8dedc40
commit e281501750
4 changed files with 88 additions and 50 deletions

View File

@@ -1,14 +1,12 @@
Relevant definitions used throughout Analysis II. Relevant definitions used throughout Analysis II.\\
\subtext{$\textbf{A} \in \R^{m \times n},\quad x,y \in \R^n,\quad \alpha \in \R$} \subtext{$\textbf{A} \in \R^{m \times n},\quad x,y \in \R^n,\quad \alpha \in \R$}
\definition \textbf{Scalar Product} $x \cdot y :=\sum_{i=0}^{n} (x_i \cdot y_i)$ \begin{footnotesize}
\definition \textbf{Euclidian Norm} $||x|| := \displaystyle\sqrt{\sum_{i=1}^{n} x_i^2}$\\ \definition \textbf{Scalar Product} $x \cdot y :=\sum_{i=0}^{n} (x_i \cdot y_i)$\\
\subtext{Used to generalize $|x|$ in many Analysis I definitions} \definition \textbf{Euclidian Norm} $||x|| := \displaystyle\sqrt{\sum_{i=1}^{n} x_i^2}$\\
\lemma \textbf{Properties of} $||x||$
\lemma \textbf{Properties of} $||x||$ \begin{center}
\begin{center}
$ $
\begin{array}{ll} \begin{array}{ll}
(i) & ||x|| \geq 0 \\ (i) & ||x|| \geq 0 \\
@@ -17,35 +15,22 @@ Relevant definitions used throughout Analysis II.
(iv) & ||x + y|| \leq ||x|| + ||y||\quad \text{(Triangle Inequality)} (iv) & ||x + y|| \leq ||x|| + ||y||\quad \text{(Triangle Inequality)}
\end{array} \end{array}
$ $
\end{center} \end{center}
\definition \textbf{Definiteness} \definition \textbf{Definiteness}
\begin{center} \begin{center}
$ $
\begin{array}{lcl} \begin{array}{lcl}
\text{Positive Definite} &\iffdef& x^\top \textbf{A} x > 0\ \forall x \in \R^n_{\neq 0} \\ \text{Positive Definite} &\iffdef& x^\top \textbf{A} x > 0\ \forall x \in \R^n_{\neq 0} \\
\text{Negative Definite} &\iffdef& x^\top \textbf{A} x < 0\ \forall x \in \R^n_{\neq 0} \text{Negative Definite} &\iffdef& x^\top \textbf{A} x < 0\ \forall x \in \R^n_{\neq 0}
\end{array} \end{array}
$ $
\end{center} \end{center}
\smalltext{If $0$ is allowed, $\textbf{A}$ is called positive/negative semi-definite.} \color{gray}\scriptsize
If $0$ is allowed, $\textbf{A}$ is called positive/negative semi-definite.
\definition \textbf{Trace} $\text{Tr}(\textbf{A}) := \displaystyle\sum_{i=0}^{\text{min}(m,n)} (\textbf{A})_{i, i}$ \color{black}\footnotesize
\begin{footnotesize}
\lemma \textbf{Determinant} of $\textbf{A} \in \R^{2\times2}$
$$
\det(\textbf{A})
=
\det\left(
\begin{bmatrix}
a & b \\
c & d
\end{bmatrix}
\right) = ad - bc
$$
\definition \textbf{Trace} $\text{Tr}(\textbf{A}) := \displaystyle\sum_{i=0}^{\text{min}(m,n)} (\textbf{A})_{i, i}$\\
\lemma \textbf{Inverse} of $\textbf{A} \in \R^{2\times2}$ \lemma \textbf{Inverse} of $\textbf{A} \in \R^{2\times2}$
$$ $$
\textbf{A}^{-1} \textbf{A}^{-1}
@@ -61,4 +46,61 @@ Relevant definitions used throughout Analysis II.
-c & a -c & a
\end{bmatrix} \end{bmatrix}
$$ $$
\color{gray}\scriptsize
For $A \in \R^{n \times n}$: Gauss Algorithm.
\color{black}\footnotesize
\lemma \textbf{Determinant} of $\textbf{A} \in \R^{2\times2}$
$$
\det(\textbf{A})
=
\det\left(
\begin{bmatrix}
a & b \\
c & d
\end{bmatrix}
\right) = ad - bc
$$
\color{gray}\scriptsize
For $A \in \R^{n \times n}$: Cofactor method.
\color{black}\footnotesize
\lemma \textbf{Determinant} of $A \in \R^{3\times3}$ (Sarrus)
% https://tex.stackexchange.com/a/32981/184539
$$\begin{tikzpicture}[>=stealth]
\matrix [%
matrix of math nodes,
column sep=1em,
row sep=1em
] (sarrus) {%
a_{11} & a_{12} & a_{13} & a_{11} & a_{12} \\
a_{21} & a_{22} & a_{23} & a_{21} & a_{22} \\
a_{31} & a_{32} & a_{33} & a_{31} & a_{32} \\
};
\path ($(sarrus-1-1.north west)-(0.5em,0)$) edge ($(sarrus-3-1.south west)-(0.5em,0)$)
($(sarrus-1-3.north east)+(0.5em,0)$) edge ($(sarrus-3-3.south east)+(0.5em,0)$)
(sarrus-1-1) edge (sarrus-2-2)
(sarrus-2-2) edge[->] (sarrus-3-3)
(sarrus-1-2) edge (sarrus-2-3)
(sarrus-2-3) edge[->] (sarrus-3-4)
(sarrus-1-3) edge (sarrus-2-4)
(sarrus-2-4) edge[->] (sarrus-3-5)
(sarrus-3-1) edge[dashed] (sarrus-2-2)
(sarrus-2-2) edge[->,dashed] (sarrus-1-3)
(sarrus-3-2) edge[dashed] (sarrus-2-3)
(sarrus-2-3) edge[->,dashed] (sarrus-1-4)
(sarrus-3-3) edge[dashed] (sarrus-2-4)
(sarrus-2-4) edge[->,dashed] (sarrus-1-5);
\foreach \c in {1,2,3} {\node[anchor=south] at (sarrus-1-\c.north) {$+$};};
\foreach \c in {1,2,3} {\node[anchor=north] at (sarrus-3-\c.south) {$-$};};
\end{tikzpicture}$$
\lemma \textbf{Properties of Eigenvalues}
$$
\text{Tr}(\textbf{A}) = \sum_{i=0}^{n} \lambda_i \qquad\qquad \text{det}(\textbf{A}) = \prod_{i=0}^{n} \lambda_i
$$
\color{gray}\scriptsize
To find $\lambda_i$ solve $\det(\textbf{A} - \lambda \textbf{I}) = 0$.
\color{black}\footnotesize
\end{footnotesize} \end{footnotesize}

View File

@@ -118,11 +118,7 @@ If $f(x)$ is replaced by $h(y) = f(g(y))$, then $h$ is a sol. too.\\
\end{footnotesize} \end{footnotesize}
\begin{subbox}{Separation of Variables} \begin{subbox}{Separation of Variables}
Form: \smalltext{Form: $ y' = a(y)\cdot b(x) $}
$$
y' = a(y)\cdot b(x)
$$
Solve using:
$$ $$
\int \frac{1}{a(y)}\ \text{d}y = \int b(x) \dx + c \int \frac{1}{a(y)}\ \text{d}y = \int b(x) \dx + c
$$ $$

View File

@@ -38,4 +38,4 @@
% Flexible graphs / visualisations inside latex % Flexible graphs / visualisations inside latex
\usepackage{tikz} \usepackage{tikz}
\usetikzlibrary{positioning, arrows.meta} \usetikzlibrary{positioning, arrows.meta, calc, matrix}