Math 2.0

definition

Martingale

Definition

Let (Ω,F,P)(\Omega, \mathcal{F}, P) be a probability space with a filtration (Fn)n≥0(\mathcal{F}_n)_{n \ge 0}: σ-algebras with F0⊆F1⊆⋯⊆F\mathcal{F}_0 \subseteq \mathcal{F}_1 \subseteq \dots \subseteq \mathcal{F}. A martingale with respect to (Fn)(\mathcal{F}_n) is a sequence (Mn)n≥0(M_n)_{n \ge 0} of real random variables with these three properties:

  1. MnM_n is Fn\mathcal{F}_n-measurable for each nn.
  2. E[∣Mn∣]<∞E[|M_n|] < \infty for each nn.
  3. E[Mn+1∣Fn]=MnE[M_{n+1} \mid \mathcal{F}_n] = M_n almost surely for each nn.

Remarks

If "==" in property 3 is replaced by "≥\ge", the sequence is a submartingale. If it is replaced by "≤\le", it is a supermartingale. By the law of total expectation, E[Mn]=E[M0]E[M_n] = E[M_0] for each nn. Examples: the simple random walk SnS_n and Sn2−nS_n^2 - n are martingales for the filtration of the steps. Doob's optional stopping theorem and Doob's martingale convergence theorem are the main tools of the theory.

Explanations

L1 human

A martingale is a fair game: given everything you know now, your expected fortune after the next round is your fortune now. No betting strategy can change the expected value of a martingale at fixed times.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Martingale_(probability_theory), General definition