I. Basic math.
 II. Pricing and Hedging.
 III. Explicit techniques.
 IV. Data Analysis.
 V. Implementation tools.
 VI. Basic Math II.
 1 Real Variable.
 A. Operations on sets and logical statements.
 B. Fundamental inequalities.
 C. Function spaces.
 D. Measure theory.
 E. Various types of convergence.
 a. Uniform convergence and convergence almost surely. Egorov's theorem.
 b. Convergence in probability.
 c. Infinitely often events. Borel-Cantelli lemma.
 d. Integration and convergence.
 e. Convergence in Lp.
 f. Vague convergence. Convergence in distribution.
 F. Signed measures. Absolutely continuous and singular measures. Radon-Nikodym theorem.
 G. Lebesgue differentiation theorem.
 H. Fubini theorem.
 I. Arzela-Ascoli compactness theorem.
 J. Partial ordering and maximal principle.
 K. Taylor decomposition.
 2 Laws of large numbers.
 3 Characteristic function.
 4 Central limit theorem (CLT) II.
 5 Random walk.
 6 Conditional probability II.
 7 Martingales and stopping times.
 8 Markov process.
 9 Levy process.
 10 Weak derivative. Fundamental solution. Calculus of distributions.
 11 Functional Analysis.
 12 Fourier analysis.
 13 Sobolev spaces.
 14 Elliptic PDE.
 15 Parabolic PDE.
 VII. Implementation tools II.
 VIII. Bibliography
 Notation. Index. Contents.

## Convergence in Lp.

efinition

The random variable belongs to the class iff . The quantity is called the norm. The sequence converges in to iff .

Proposition

(Convergence in Lp and in probability 1) If in then in probability.

Proof

By the formula ( Chebyshev inequality ) with we have and the claim follows.

Proposition

(Convergence in Lp and in probability 2) If in probability and s.t. for all then in .

Proof

Fix a small , then The last expectation converges to 0 because converges to 0.

 Notation. Index. Contents.