Moved stuff around
All checks were successful
Build Typst PDFs (Docker) / build-typst (push) Successful in 38s
All checks were successful
Build Typst PDFs (Docker) / build-typst (push) Successful in 38s
This commit is contained in:
@@ -38,7 +38,7 @@
|
||||
}
|
||||
#columns(5, gutter: 2mm)[
|
||||
|
||||
|
||||
// Gruppen
|
||||
#bgBlock(fill: colorGruppen)[
|
||||
#subHeading(fill: colorGruppen)[Gruppen]
|
||||
|
||||
@@ -92,11 +92,14 @@
|
||||
$(S_n, compose)$ ist Gruppe, aber nicht kommutativ
|
||||
]
|
||||
|
||||
/*
|
||||
// Komplex Zahlen
|
||||
#bgBlock(fill: colorAllgemein)[
|
||||
#subHeading(fill: colorAllgemein)[Komplexe Zahlen]
|
||||
|
||||
#ComplexNumbersSection()
|
||||
]
|
||||
*/
|
||||
|
||||
// Matrix Typen
|
||||
#bgBlock(fill: colorMatrix)[
|
||||
@@ -129,6 +132,8 @@
|
||||
)
|
||||
]
|
||||
|
||||
#colbreak()
|
||||
|
||||
// Vektorräume
|
||||
#bgBlock(fill: colorVR)[
|
||||
#subHeading(fill: colorVR)[Vektorräume (VR)]
|
||||
@@ -264,40 +269,6 @@
|
||||
Normalweiße alle Abbildung/Matrizen in Kannoischer Basis $hat(e)_1 = vec(1, 0, dots.v), hat(e)_2 = vec(0, 1, dots.v), ...$
|
||||
]
|
||||
|
||||
// Matrix Basics
|
||||
#bgBlock(fill: colorMatrix)[
|
||||
#subHeading(fill: colorMatrix)[Matrix Basics]
|
||||
Linera Abbildung $equiv$ EINER eindeutige Matrix \
|
||||
|
||||
- Sclar/Matrix: $lambda dot A$
|
||||
- Matrix/Matrix: $A + B$
|
||||
- Matrix-Matrix: $A dot B = Phi_A compose Phi_B = Phi_A (Phi_B (ve(x)))$ \
|
||||
$c_(j i) = sum^n_(s=1) a_(j s) b_(s i)$
|
||||
|
||||
$(KK^(n times n), +)$ sind Gruppe, $(KK^(n times n), dot)$ sind Monoid,
|
||||
|
||||
#image("../images/linAlg/matMul.jpg")
|
||||
|
||||
#SeperatorLine
|
||||
|
||||
#grid(columns: (1fr, 1fr, 1fr),
|
||||
row-gutter: 2mm,
|
||||
align(center, $(lambda mu) A = lambda (mu A)$),
|
||||
grid.cell(colspan: 2, align(center, $(lambda + mu) A = lambda A + mu A$)),
|
||||
align(center, $$),
|
||||
grid.cell(colspan: 2, align(center, $lambda (A + B) = lambda A + lambda B$)),
|
||||
)
|
||||
|
||||
*Transponieren*
|
||||
|
||||
#grid(columns: (1fr, 1fr),
|
||||
row-gutter: 2mm,
|
||||
$(A + B)^T = A^T + B^T$,
|
||||
$(lambda A)^T = lambda A^T$,
|
||||
$(A^T)^T = A$,
|
||||
$(A dot B)^T = B^T dot A^T$
|
||||
)
|
||||
]
|
||||
|
||||
|
||||
#colbreak()
|
||||
@@ -444,9 +415,44 @@
|
||||
$KK^(2 times 2): A = mat(a, b; c, d) \ A^(-1) = 1/det(A) mat(d, -b; -c, a) = 1/(a d - b c) mat(d, -b; -c, a) $
|
||||
]
|
||||
|
||||
// Matrix Basics
|
||||
#bgBlock(fill: colorMatrix)[
|
||||
#subHeading(fill: colorMatrix)[Matrix Basics]
|
||||
Linera Abbildung $equiv$ EINER eindeutige Matrix \
|
||||
|
||||
#colbreak()
|
||||
- Sclar/Matrix: $lambda dot A$
|
||||
- Matrix/Matrix: $A + B$
|
||||
- Matrix-Matrix: $A dot B = Phi_A compose Phi_B = Phi_A (Phi_B (ve(x)))$ \
|
||||
$c_(j i) = sum^n_(s=1) a_(j s) b_(s i)$
|
||||
|
||||
$(KK^(n times n), +)$ sind Gruppe, $(KK^(n times n), dot)$ sind Monoid,
|
||||
|
||||
#image("../images/linAlg/matMul.jpg")
|
||||
|
||||
#SeperatorLine
|
||||
|
||||
#grid(columns: (1fr, 1fr, 1fr),
|
||||
row-gutter: 2mm,
|
||||
align(center, $(lambda mu) A = lambda (mu A)$),
|
||||
grid.cell(colspan: 2, align(center, $(lambda + mu) A = lambda A + mu A$)),
|
||||
align(center, $$),
|
||||
grid.cell(colspan: 2, align(center, $lambda (A + B) = lambda A + lambda B$)),
|
||||
)
|
||||
|
||||
*Transponieren*
|
||||
|
||||
#grid(columns: (1fr, 1fr),
|
||||
row-gutter: 2mm,
|
||||
$(A + B)^T = A^T + B^T$,
|
||||
$(lambda A)^T = lambda A^T$,
|
||||
$(A^T)^T = A$,
|
||||
$(A dot B)^T = B^T dot A^T$
|
||||
)
|
||||
]
|
||||
|
||||
]
|
||||
|
||||
#columns(5, gutter: 2mm)[
|
||||
#bgBlock(fill: colorAbbildungen)[
|
||||
#subHeading(fill: colorAbbildungen)[Linearform]
|
||||
|
||||
@@ -523,7 +529,7 @@
|
||||
*Regel von Saurus*
|
||||
#grid(
|
||||
columns: (auto, 1fr),
|
||||
image("../images/linAlg/saurus.png", height: 1cm),
|
||||
image("../images/linAlg/saurus.png", height: 0.6cm),
|
||||
align(center+horizon, $= a_11 a_22 a_33 + a_12 a_23 a_31 + a_13 a_21 a_32 \
|
||||
- a_13 a_22 a_31 - a_12 a_21 a_33 - a_11 a_23 a_32
|
||||
$)
|
||||
@@ -534,7 +540,7 @@
|
||||
#grid(
|
||||
columns: (auto, 1fr),
|
||||
column-gutter: 2mm,
|
||||
image("../images/linAlg/laplace.jpg", height: 2cm),
|
||||
image("../images/linAlg/laplace.jpg", height: 1.6cm),
|
||||
[
|
||||
- Nach Spalte oder Zeile Entwicklung
|
||||
- #underline([Auf Vorzeichen Achten!!!])
|
||||
@@ -587,10 +593,17 @@
|
||||
|
||||
#SeperatorLine
|
||||
|
||||
*Norm*
|
||||
- $norm(ve(v)) = 0 <=> ve(v) = ve(0)$
|
||||
- $norm(lambda ve(v)) = abs(lambda) norm(ve(v))$
|
||||
- Dreieckesungleichung: $norm(x + y) <= norm(x) + norm(y)$
|
||||
#grid(
|
||||
columns: (auto, auto),
|
||||
column-gutter: 3mm,
|
||||
[*Norm*],
|
||||
[
|
||||
- $norm(ve(v)) = 0 <=> ve(v) = ve(0)$
|
||||
- $norm(lambda ve(v)) = abs(lambda) norm(ve(v))$
|
||||
- Dreieckesungleichung: $norm(x + y) <= norm(x) + norm(y)$
|
||||
]
|
||||
)
|
||||
|
||||
|
||||
*Generisch/$L_p$-Norm*: $|| v ||_p = root(p, sum_(k=1)^n (x_k)^p)$
|
||||
|
||||
@@ -620,8 +633,29 @@
|
||||
|
||||
]
|
||||
|
||||
#colbreak()
|
||||
// Matrix Normen
|
||||
#bgBlock(fill: colorMatrix)[
|
||||
#subHeading(fill: colorMatrix)[Matrix Normen]
|
||||
|
||||
$|| dot ||_M$ Matrix Norm, $|| dot ||_V$ Vektornorm
|
||||
|
||||
- submultiplikativ: $||A B||_"M" <= ||A||||B||$
|
||||
- verträglich mit einer Vektornorm: $||A v||_"V" <= ||A||_"M" ||v||_"V"$
|
||||
|
||||
*Frobenius-Norm* $||A||_"M" = sqrt(sum_(i=1)^m sum_(j=1)^n a_(m n)^2)$
|
||||
|
||||
*Induzierte Norm* \
|
||||
$||A||_"M" = sup_(v in V without {0}) (||A v||_V)/(||v||_V) = sup_(||v|| = 1) ||A v||_V$
|
||||
- submultiplikativ
|
||||
- verträglich mit einer Vektornorm $||dot||_V$
|
||||
|
||||
*maximale Spaltensumme* $||A||_r = max_(1<= i <= n) sum_(j=1)^n |a_(j)|$
|
||||
]
|
||||
|
||||
|
||||
#colbreak()
|
||||
|
||||
// Eigenwert und Eigenvektoren
|
||||
#bgBlock(fill: colorMatrixVerfahren)[
|
||||
|
||||
#subHeading(fill: colorMatrixVerfahren)[Eigenwert und Eigenvektoren ]
|
||||
@@ -664,8 +698,9 @@
|
||||
|
||||
]
|
||||
|
||||
// Gram-Schmit ONB
|
||||
#bgBlock(fill: colorMatrixVerfahren)[
|
||||
#subHeading(fill: colorMatrixVerfahren)[Gram-Schmit ONB]
|
||||
#subHeading(fill: colorMatrixVerfahren)[Gram-Schmit]
|
||||
|
||||
Idee: $ip("Orth"#text(red)[normal] ve(v), ve(x)) = "Anteil von" ve(x) "an" ve(v)$ \
|
||||
Ziel: Basis $W -->$ Orthogonal Basis $V$
|
||||
@@ -679,6 +714,7 @@
|
||||
|
||||
]
|
||||
|
||||
// Diagonalisierung
|
||||
#bgBlock(fill: colorMatrixVerfahren)[
|
||||
#subHeading(fill: colorMatrixVerfahren)[Diagonalisierung]
|
||||
$A = R D R^(-1)$
|
||||
@@ -756,23 +792,6 @@
|
||||
$S = mat(sigma_0, 0; 0, sigma_1; dots.v, dots.v; 0, 0) quad quad quad S = mat(sigma_0, 0, dots, 0; 0, sigma_1, ..., 0)$
|
||||
]
|
||||
|
||||
#bgBlock(fill: colorMatrix)[
|
||||
#subHeading(fill: colorMatrix)[Matrix Normen]
|
||||
|
||||
$|| dot ||_M$ Matrix Norm, $|| dot ||_V$ Vektornorm
|
||||
|
||||
- submultiplikativ: $||A B||_"M" <= ||A||||B||$
|
||||
- verträglich mit einer Vektornorm: $||A v||_"V" <= ||A||_"M" ||v||_"V"$
|
||||
|
||||
*Frobenius-Norm* $||A||_"M" = sqrt(sum_(i=1)^m sum_(j=1)^n a_(m n)^2)$
|
||||
|
||||
*Induzierte Norm* \
|
||||
$||A||_"M" = sup_(v in V without {0}) (||A v||_V)/(||v||_V) = sup_(||v|| = 1) ||A v||_V$
|
||||
- submultiplikativ
|
||||
- verträglich mit einer Vektornorm $||dot||_V$
|
||||
|
||||
*maximale Spaltensumme* $||A||_r = max_(1<= i <= n) sum_(j=1)^n |a_(j)|$
|
||||
]
|
||||
|
||||
#bgBlock(fill: colorMatrix)[
|
||||
#subHeading(fill: colorMatrix)[Rekursive Folgen]
|
||||
@@ -799,69 +818,65 @@
|
||||
|
||||
#colbreak()
|
||||
|
||||
// Table
|
||||
#table(
|
||||
columns: (auto, 1fr),
|
||||
inset: 2mm,
|
||||
fill: (x, y) => if (calc.rem(y, 2) == 0) { tableFillLow } else { tableFillHigh },
|
||||
[*Einheits Matrix*\ $I,E$], [
|
||||
$det(E) = 1$
|
||||
],
|
||||
[*Diagonalmatrix* \ $Sigma,D$], [
|
||||
Nur Einträger auf Hauptdiagonalen \
|
||||
$det(D) = d_00 dot d_11 dot d_22 dot ...$
|
||||
],
|
||||
[*Symetrisch*\ $S$], [
|
||||
$S = S^T$, $S in KK^(n times n)$\
|
||||
$A A^T$, $A^T A$ ist symetrisch \
|
||||
$S$ immer diagonaliserbar \
|
||||
EW immer $in RR$, EV orthogonal
|
||||
],
|
||||
[*Invertierbar*], [
|
||||
$exists A^(-1) : A A^(-1) = A^(-1) A = E$ \
|
||||
|
||||
#sinTable
|
||||
]
|
||||
|
||||
#columns(2)[
|
||||
#table(
|
||||
columns: (auto, 1fr),
|
||||
inset: 2mm,
|
||||
fill: (x, y) => if (calc.rem(y, 2) == 0) { tableFillLow } else { tableFillHigh },
|
||||
[*Einheits Matrix*\ $I,E$], [
|
||||
$det(E) = 1$
|
||||
],
|
||||
[*Diagonalmatrix* \ $Sigma,D$], [
|
||||
Nur Einträger auf Hauptdiagonalen \
|
||||
$det(D) = d_00 dot d_11 dot d_22 dot ...$
|
||||
],
|
||||
[*Symetrisch*\ $S$], [
|
||||
$S = S^T$, $S in KK^(n times n)$\
|
||||
$A A^T$, $A^T A$ ist symetrisch \
|
||||
$S$ immer diagonaliserbar \
|
||||
EW immer $in RR$, EV orthogonal
|
||||
],
|
||||
[*Invertierbar*], [
|
||||
$exists A^(-1) : A A^(-1) = A^(-1) A = E$ \
|
||||
|
||||
*Invertierbar wenn:* \
|
||||
$A$ bijektiv, $det(A) = 0$ \
|
||||
$"Spalten Vekoren lin. unabhänig"$ \
|
||||
$Rang(A) = n, A in KK^(n times n)$ \
|
||||
$det(A) = 0$ \
|
||||
|
||||
*Nicht Invertierbar wenn:*\
|
||||
$exists$ EW $!= 0 => not "invertierbar"$
|
||||
Keine Qudratische Matrix
|
||||
],
|
||||
[*Orthogonal*], [
|
||||
#grid(
|
||||
columns: (1fr, 1fr),
|
||||
[
|
||||
- Immer Bijektiv
|
||||
- $det (A) = plus.minus 1$
|
||||
$O^T = O^(-1) quad quad O^T O = O O^T = I$ \
|
||||
$ip(O v, O w) = ip(v, w)$
|
||||
]
|
||||
)
|
||||
|
||||
],
|
||||
[*Unitair* $equiv$ Orthogonal $in CC$], [
|
||||
- Immer Bijektiv
|
||||
$V = V^*$
|
||||
|
||||
],
|
||||
[*Diagonaliserbar*], [
|
||||
$exists A = B D B^(-1)$, $D$ diagonal,
|
||||
|
||||
$B$: Splaten sind EV von $A$
|
||||
|
||||
- Selbst-Adujunkte ($$) diagonalisierbar
|
||||
- Symetrisch Matrix
|
||||
- $A in KK^(n times n) "UND" alg(lambda) = geo(lambda)$
|
||||
],
|
||||
[*postiv-semi-definit*], [
|
||||
$forall$ EW $>= 0$
|
||||
],
|
||||
)
|
||||
*Invertierbar wenn:* \
|
||||
$A$ bijektiv, $det(A) = 0$ \
|
||||
$"Spalten Vekoren lin. unabhänig"$ \
|
||||
$Rang(A) = n, A in KK^(n times n)$ \
|
||||
$det(A) = 0$ \
|
||||
|
||||
*Nicht Invertierbar wenn:*\
|
||||
$exists$ EW $!= 0 => not "invertierbar"$
|
||||
Keine Qudratische Matrix
|
||||
],
|
||||
[*Orthogonal*], [
|
||||
#grid(
|
||||
columns: (1fr, 1fr),
|
||||
[
|
||||
- Immer Bijektiv
|
||||
- $det (A) = plus.minus 1$
|
||||
$O^T = O^(-1) quad quad O^T O = O O^T = I$ \
|
||||
$ip(O v, O w) = ip(v, w)$
|
||||
]
|
||||
)
|
||||
|
||||
],
|
||||
[*Unitair* $equiv$ Orthogonal $in CC$], [
|
||||
- Immer Bijektiv
|
||||
$V = V^*$
|
||||
|
||||
],
|
||||
[*Diagonaliserbar*], [
|
||||
$exists A = B D B^(-1)$, $D$ diagonal,
|
||||
|
||||
$B$: Splaten sind EV von $A$
|
||||
|
||||
- Selbst-Adujunkte ($$) diagonalisierbar
|
||||
- Symetrisch Matrix
|
||||
- $A in KK^(n times n) "UND" alg(lambda) = geo(lambda)$
|
||||
],
|
||||
[*postiv-semi-definit*], [
|
||||
$forall$ EW $>= 0$
|
||||
],
|
||||
)
|
||||
]
|
||||
|
||||
Reference in New Issue
Block a user