Advanced Probability Theory
Proposition:
Kolmogorov ineq. : Let
Supremum inequality,
Theorem.: Let
Proof: W. L. O. G. , suppose
Definition: A measurable space is called separable, if every atom of it is singleton. Two measurable spaces are called isomorphic if there exists a bijection that is measurable both sides (which is called measurable a isomorphism). /%E5%88%9D%E7%AD%89%E6%8F%8F%E8%BF%B0%E9%9B%86%E5%90%88%E8%AE%BA/%E6%A0%87%E5%87%86Borel%E7%A9%BA%E9%97%B4)
Lemma: Let
Monotone class theorem.’s:
Definition: Let
Theorem1.2.3: Let
(1)
(2)
Theorem.: If
Proof: Let
Definition: Let
Claim:
- Let
, then either or . - Let
be the algebra generating . Then , let $\mathcal C_\omega = \{B \in \mathcal C \vert \omega \in B\}, then
Proof of 2:
For any given
Theorem: Let
- There exists a sequence of simple function
, s.t. , , and . - If
is nonnegative, then there exists a monotonely increasing sequence of nonnegative simple measurable functions s.t. .
Proof: Writing
Then
Theorem: Let
; or ; ,
Thencontaining all -measurable function on .
Proof:
Let
Theorem: Let
; , and is measurable(correspondingly, real-valued or bounded) ; .
Thencontaining all -measurable (correspondingly, real-valued or bounded) funcions on .
Proof: Let
Then
Theorem: Let
- If
a null set . s.t. , , then we call that is almostly converges to . Denote it as a.e. or . - If
> , in , s.t. converges to on uniformly. Then we call converges to almost uniformly, denoted as . - If
> , . Then we call converges to in probability, denoted as .