18.175: Lecture 25 Reflections and martingales Scott Sheffield MIT - - PowerPoint PPT Presentation

18 175 lecture 25 reflections and martingales
SMART_READER_LITE
LIVE PREVIEW

18.175: Lecture 25 Reflections and martingales Scott Sheffield MIT - - PowerPoint PPT Presentation

18.175: Lecture 25 Reflections and martingales Scott Sheffield MIT 18.175 Lecture 25 1 Outline Conditional expectation Martingales Arcsin law, other SRW stories 18.175 Lecture 25 2 Outline Conditional expectation Martingales Arcsin law, other SRW


slide-1
SLIDE 1

18.175: Lecture 25 Reflections and martingales

Scott Sheffield

MIT

18.175 Lecture 25

1

slide-2
SLIDE 2

Outline

Conditional expectation Martingales Arcsin law, other SRW stories

18.175 Lecture 25

2

slide-3
SLIDE 3

Outline

Conditional expectation Martingales Arcsin law, other SRW stories

18.175 Lecture 25

3

slide-4
SLIDE 4

Conditional expectation

Say we’re given a probability space (Ω, F0, P) and a σ-field

F ⊂ F0 and a random variable X measurable w.r.t. F0, with E |X | < ∞. The conditional expectation of X given F is a new random variable, which we can denote by Y = E (X |F).

We require that Y is F measurable and that for all A in F,

r r we have XdP = YdP.

A A Any Y satisfying these properties is called a version of

E (X |F).

Is it possible that there exists more than one version of

E (X |F) (which would mean that in some sense the conditional expectation is not canonically defined)?

Is there some sense in which E (X |F) always exists and is

always uniquely defined (maybe up to set of measure zero)?

18.175 Lecture 25

4

slide-5
SLIDE 5
  • Conditional expectation

Claim: Assuming Y = E (X |F) as above, and E |X | < ∞, we have E |Y | ≤ E |X |. In particular, Y is integrable. Proof: let A = {Y > 0} ∈ F and observe: r r r YdP XdP ≤ |X |dP. By similarly argument, rA

A

r

A

−YdP ≤ |X |dP.

Ac Ac

Uniqueness of Y : Suppose Y ' is F-measurable and satisfies r r r Y 'dP = XdP = YdP for all A ∈ F. Then consider

A A A

the set Y − Y ' ≥ d}. Integrating over that gives zero. Must hold for any d. Conclude that Y = Y ' almost everywhere.

18.175 Lecture 25

5

slide-6
SLIDE 6
  • Radon-Nikodym theorem

Let µ and ν be σ-finite measures on (Ω, F). Say ν << µ (or ν is absolutely continuous w.r.t. µ if µ(A) = 0 implies ν(A) = 0. Recall Radon-Nikodym theorem: If µ and ν are σ-finite measures on (Ω, F) and ν is absolutely continuous w.r.t. µ, then there exists a measurable f : Ω → [0, ∞) such that r ν(A) = A fdµ. Observe: this theorem implies existence of conditional expectation.

18.175 Lecture 25

6

slide-7
SLIDE 7

Outline

Conditional expectation Martingales Arcsin law, other SRW stories

18.175 Lecture 25

7

slide-8
SLIDE 8

Outline

Conditional expectation Martingales Arcsin law, other SRW stories

18.175 Lecture 25

8

slide-9
SLIDE 9
  • Two big results

Optional stopping theorem: Can’t make money in expectation by timing sale of asset whose price is non-negative martingale. Martingale convergence: A non-negative martingale almost surely has a limit.

18.175 Lecture 25

9

slide-10
SLIDE 10
  • Wald

Wald’s equation: Let Xi be i.i.d. with E |Xi | < ∞. If N is a stopping time with EN < ∞ then ESN = EX1EN. Wald’s second equation: Let Xi be i.i.d. with E |Xi | = 0 and EX

2 = σ2 < ∞. If N is a stopping time with EN < ∞ then i

ESN = σ2EN.

18.175 Lecture 25

10

slide-11
SLIDE 11
  • Wald applications to SRW

S0 = a ∈ Z and at each time step Sj independently changes by ±1 according to a fair coin toss. Fix A ∈ Z and let N = inf{k : Sk ∈ {0, A}. What is ESN ? What is EN?

18.175 Lecture 25

11

slide-12
SLIDE 12

Outline

Conditional expectation Martingales Arcsin law, other SRW stories

18.175 Lecture 25

12

slide-13
SLIDE 13

Outline

Conditional expectation Martingales Arcsin law, other SRW stories

18.175 Lecture 25

13

slide-14
SLIDE 14
  • Reflection principle

How many walks from (0, x) to (n, y) that don’t cross the horizontal axis? Try counting walks that do cross by giving bijection to walks from (0, −x) to (n, y).

18.175 Lecture 25

14

slide-15
SLIDE 15
  • Ballot Theorem

Suppose that in election candidate A gets α votes and B gets β < α votes. What’s probability that A is ahead throughout the counting? Answer: (α − β)/(α + β). Can be proved using reflection principle.

18.175 Lecture 25

15

slide-16
SLIDE 16
  • Arcsin theorem

Theorem for last hitting time. Theorem for amount of positive positive time.

18.175 Lecture 25

16

slide-17
SLIDE 17

MIT OpenCourseWare http://ocw.mit.edu

18.175 Theory of Probability

Spring 2014 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.