mirror of
https://github.com/janishutz/eth-summaries.git
synced 2026-03-14 04:40:07 +01:00
[PS] Fix more errors
This commit is contained in:
@@ -26,7 +26,7 @@ Sie sind nützlich für schwer zu berechnende W.
|
||||
{\centering $\limni P[A_n] = \P\left[ \bigcup_{n = 1}^\8 A_n \right]$\\}
|
||||
|
||||
und für $(B_n)$ mit $B_n \supseteq B_{n + 1}$ (mon. fallend) gilt:\\
|
||||
$\limni P[B_n] = \P\left[ \bigcap_{n = 1}^\8 \right]$
|
||||
$\limni P[B_n] = \P\left[ \bigcap_{n = 1}^\8 B_n \right]$
|
||||
|
||||
\shortremark Mit Monotonie: $\P[A_n] \leq \P[A_{n + 1}]$ und\\
|
||||
$\P[B_n] \geq \P[B_{n + 1}]$. Grenzwerte oben wohldefiniert.
|
||||
|
||||
@@ -12,7 +12,7 @@
|
||||
\forall A \in \cF \quad \P[A] = \sum_{i = 1}^{n} \P[A | B_i] \cdot \P[B_i]
|
||||
\]
|
||||
|
||||
\shorttheorem[Bayes] $B_i$ wie oben, damm $\forall A$ mit $\P[A] > 0$:
|
||||
\shorttheorem[Bayes] $B_i$ wie oben, dann $\forall A$ mit $\P[A] > 0$:
|
||||
\[
|
||||
\forall i = 1, \ldots, n \quad \P[B_i | A] = \frac{\P[A | B_i] \P[B_i]}{\sum_{j = 1}^{n} \P[A | B_j] \P[B_j]}
|
||||
\]
|
||||
|
||||
Binary file not shown.
Reference in New Issue
Block a user