jrpie-notes/probability-theory
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

fixed bugs

Browse source
This commit is contained in:
Josia Pietsch 2023-06-29 01:24:35 +02:00
parent 62fc7f892d
commit 888b670668
Signed by untrusted user who does not match committer: jrpie
GPG key ID: E70B571D66986A2D
1 changed files with 5 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
inputs/lecture_20.tex
View file

@ -246,7 +246,7 @@ we need the following theorem, which we won't prove here:
we get from the above that we get from the above that
\[ \[
\bE[X_T] \overset{n \ge M}{=} \bE[X^T_n] \begin{cases} \bE[X_T] \overset{n \ge M}{=} \bE[X^T_n] \begin{cases}
\le \bE[X_0] & \text{ supermartingale}, \le \bE[X_0] & \text{ supermartingale},\\
= \bE[X_0] & \text{ martingale}. = \bE[X_0] & \text{ martingale}.
\end{cases} \end{cases}
\] \]
@ -269,7 +269,7 @@ we need the following theorem, which we won't prove here:
taking values in $\N$. taking values in $\N$.
If one of the following holds If one of the following holds
\begin{itemize}[(i)] \begin{enumerate}[(i)]
\item $T \le M$ is bounded, \item $T \le M$ is bounded,
\item $(X_n)_n$ is uniformly bounded \item $(X_n)_n$ is uniformly bounded
and $T < \infty$ a.s., and $T < \infty$ a.s.,
@ -277,7 +277,7 @@ we need the following theorem, which we won't prove here:
and $|X_n(\omega) - X_{n-1}(\omega)| \le K$ and $|X_n(\omega) - X_{n-1}(\omega)| \le K$
for all $n \in \N, \omega \in \Omega$ and for all $n \in \N, \omega \in \Omega$ and
some $K > 0$, some $K > 0$,
\end{itemize} \end{enumerate}
then $\bE[X_T] \le \bE[X_0]$. then $\bE[X_T] \le \bE[X_0]$.
If $(X_n)_n$ even is a martingale, then If $(X_n)_n$ even is a martingale, then