Chapter 32

Quadratic Variation32.1 How to Recognize a Martingale

The main ideas are most easily understood in the special case where it is assumed themartingale is bounded. Then one can extend to more general situations using a localizingsequence of stopping times.

Let {M (t)} be a continuous martingale having values in a separable Hilbert space. Theidea is to consider the submartingale,

{∥M (t)∥2

}and write it as the sum of a martingale

and an increasing submartingale. An important part of the argument is the following lemmawhich gives a checkable criterion for a stochastic process to be a martingale.

Lemma 32.1.1 Let {X (t)} be a stochastic process adapted to the filtration {Ft} fort ≥ 0. Then it is a martingale for the given filtration if for every stopping time σ it follows

E (X (t)) = E (X (σ)) .

In fact, it suffices to check this on stopping times which have two values.

Proof: Let s < t and A ∈Fs. Define a stopping time

σ (ω)≡ sXA (ω)+ tXAC (ω)

This is a stopping time because [σ ≤ l] = Ω ∈Fl if l ≥ t. Also [σ ≤ l] = A ∈Fs ⊆Fl ifl ∈ [s, t) and [σ ≤ l] = /0 ∈Fl if l < s. Then by assumption,∫

AX (t)dP+

∫AC

X (t)dP =

by assumption︷ ︸︸ ︷∫X (t)dP =

∫X (σ)dP =

∫A

X (s)dP+∫

ACX (t)dP

Therefore, ∫A

X (t)dP =∫

AX (s)dP

and since X (s) is Fs measurable, it follows E (X (t) |Fs) = X (s) a.e. and this shows{X (t)} is a martingale. ■

Note that if t ∈ [0,T ] , it suffices to check the expectation condition for stopping timeswhich have two values no larger than T .

The following lemma will be useful.

Lemma 32.1.2 Suppose Xn → X in L1 (Ω,F ,P;E) where E is a separable Banachspace. Then letting G be a σ algebra contained in F ,

E (Xn|G )→ E (X |G )

in L1 (Ω) .

859

Chapter 32Quadratic Variation32.1 How to Recognize a MartingaleThe main ideas are most easily understood in the special case where it is assumed themartingale is bounded. Then one can extend to more general situations using a localizingsequence of stopping times.Let {@ (t)} be a continuous martingale having values in a separable Hilbert space. Theidea is to consider the submartingale, {\\m (t) I} and write it as the sum of a martingaleand an increasing submartingale. An important part of the argument is the following lemmawhich gives a checkable criterion for a stochastic process to be a martingale.Lemma 32.1.1 Let {X (t)} be a stochastic process adapted to the filtration {F;} fort > 0. Then it is a martingale for the given filtration if for every stopping time o it followsE(X (t)) =E(X(0)).In fact, it suffices to check this on stopping times which have two values.Proof: Let s <t and A € ¥;. Define a stopping time0 (@) =s%4(@)+tZ% 4c (@)This is a stopping time because [o < J] =Qe F, if] >t. Alsol[o <I]=AEC FY, CF, if1 é [s,t) and [o <1] =0 € F, if 1 <s. Then by assumption,[x@ap+ / X()dP=JA JACby assumption[x@ar= [x(ojar= | x(syap+ | x oarTherefore,[x@ar= [x(arand since X(s) is %; measurable, it follows E (X (t)|-%;) = X (s) a.e. and this shows{X (t)} is a martingale.Note that if t € [0,7], it suffices to check the expectation condition for stopping timeswhich have two values no larger than T.The following lemma will be useful.Lemma 32.1.2 Suppose X, — X in L'(Q,.%,P;E) where E is a separable Banachspace. Then letting GY be a o algebra contained in F,E (X,|%Y) E (X|Y)in L'(Q).859