Risk-Neutral Measures

Lecture Notes

Motivation - Sports Betting

Let’s go into the world of sports gambling. Hypothetically, we’re going to have two teams competing, Team A and Team B. Objectively, Team A is the better team. Let’s say in the real world odds, they are 4:1, meaning that Team A is 4x as likely to win as Team B. That means that

ℙ(Team A wins)=45

ℙ(Team B wins)=15

If I use these odds for betting, let’s say I have a $10 stake on Team A. If Team A wins, I will receive my original stake + a quarter of the original stake, or $12.50. If I bet on Team B, then if Team B wins, I will receive the original stake + four times the original stake, or $50.

A bookie is collecting bets. He rounds up 40 people to bet on the game. Half bet on Team A, and half bet on Team B. Assuming that the stake is $10, they have collected $400.

If Team A wins, then the $400 collected will be paid out to the 20 individuals for the value they should get

400−20×$12.50=$150

The bookie will make $150 if A wins. If B wins, then

400−20×$50=−$600 The bookie will lose $650 if B wins.

Let this amount be 𝑋. What is 𝔼[𝑋]?

𝔼[𝑋]=45($150)+15(−$600)

=0 This would be what would happen if the bookie was doing this out of the goodness of their heart. What if they took 1% of the winnings (still generous)? That’s calculated out of the winnings, so 50 cents for A winning, and $8 for B winning.

This is in expectation. What if B wins four games in a row? You’re out $4000, minus this small amount.

The bookie is much more likely to notice that A and B are equally bet. They don’t care about who wins, just how people are betting. People are betting evenly on the two teams. So if the bookie gives 1:1 odds instead of 4:1, the new numbers are:

if A wins, the bettor receives $10 + $10(1/1) = $20. And the same for B.

If A wins,

400−20(20)=0

And the same for B, so expected value is 0. But if we take a little off the top, which is calculated off the difference between total received and original stake for each person and then scaled to the number of people.

The preferred approach for bookies is to do this because this way, you’ll always make money.

This is the motivation for risk-neutral pricing.

Risk-Neutral Measure

We are going to define a new ℙ̃ which is a probability measure defined as

ℙ̃(𝐴)=∫𝐴𝑍(𝜔)𝑑ℙ(𝜔)

on the original probability space, where 𝑍 is a nonnegative random variable.

In order for this to be a valid probability measure, we have to define

ℙ̃(Ω)=∫Ω𝑍(𝜔)𝑑ℙ(𝜔)=𝔼[𝑍]=1

I could have two probability measures on a fair coin and unfair coin.

For every random variable 𝑍 that satisfies these properties, we can use this to define a new probability measure on the same event space (Ω) and sample space (ℱ︀).

The expectation under the new probability measure is the same as multiplying with Z

𝔼̃[𝑋]=𝔼[𝑋𝑍]

Equivalent Measures

What’s of particular importance is that we are going to have equivalent probability measures.

When you create this random variable Z, you can create any probability measure. But it might not be equivalent. Let’s draw a distinction between identical and equivalent probability measures.

If for all 𝜔∈Ω

ℙ(𝜔)=ℙ̃(𝜔)

then these are identical probability measures.

If for any set 𝐴∈ℱ︀ such that ℙ(𝐴)=0→ℙ̃(𝐴)=0

and if for any set 𝐴∈ℱ︀, ℙ̃(𝐴)=0→ℙ(𝐴)=0

Equivalence means that they agree on what can’t happen, they agree on what has measure 0. We care about this when we start pricing instruments. Under real world probability measurements, it’s impossible for a stock to triple in five days, we can’t have that happen in our risk-neutral artificial world.

We can then define

𝑍=𝑑ℙ̃𝑑ℙ

Using this Radon-Nikodym derivative, we can confirm these results from earlier. For 𝑋 nonnegative RV, then

𝔼̃[𝑋]=∫Ω𝑋(𝜔)𝑑ℙ̃(𝜔)

This is the more theoretical construct where 𝜔 could be anything. Because we’re not going to just get numerical values, it’s hard to write a numerical representation of that space. IF we’re dealing with the real number line, this becomes

∫−∞∞𝑋𝑓𝑋(𝑥)𝑑𝑥

To deal with this expected value, I will multiply it by

𝑑ℙ(𝜔)𝑑ℙ(𝜔)

which becomes

=∫Ω𝑋(𝜔)𝑍(𝜔)𝑑ℙ(𝜔)

which simplifies to

=𝔼[𝑋𝑍]

which we are trying to prove.

Adapted Stochastic Process

𝑍(𝑡)=𝔼[𝑍|ℱ︀(𝑡)]

This is an adapted stochastic process because it depends on information at time t.

What is

𝑍(0)=?

It would just be 1 because there’s nothing to condition on so it’s just the expectation.

What about if it’s at time T, maturity? Then Z is measurable with respect to all that information, which is Z, the Radon-Nikodym derivative.

So 𝑍(𝑡) is a stochastic process that begins at 1 and goes to the Radon-Nikodym derivative.

Is it a martingale? We can use iterated conditioning to figure out that yes, it is.

What if we add another RV into the mix? 𝔼[𝑌𝑍(𝑡)]=𝔼[𝑌𝔼[𝑍|ℱ︀(𝑡)]|ℱ︀(0)]

What do I know about Y? It’s measurable with respect to ℱ︀(𝑡), so we can put what’s known back in, in the same way we can take it out.

=𝔼[𝔼[𝑌𝑍|ℱ︀(𝑡)]|ℱ︀(0)]

Iterated conditioning shows that this is

=𝔼[𝑌𝑍]

Side note: why are we doing this? In math, you have theorems, corollaries and lemmas. Theorems are widely used, versatile and powerful results. Corollaries are results proved using just one theorem. Lemmas are little disposable proofs that are used to prove one thing that you will use somewhere later. Sometimes these lemmas become famous, like Ito’s lemma. We are building towards Girsanov.

The partial averaging theorem states

∫𝐴𝔼[𝑋|𝒢︀](𝜔)𝑑ℙ(𝜔)=∫𝐴𝑋(𝜔)𝑑ℙ(𝜔)

For the problem we’re looking at, this will become

∫𝐴𝑌(𝜔)𝑑ℙ̃(𝜔)=∫𝐴𝔼̃[𝑌|ℱ︀(𝑡)](𝜔)𝑑ℙ̃(𝜔)

What this theorem is telling me that I want to prove that the expectation of Y conditioned on information up to s is all that.

If I can confirm this is true, then I can prove this lemma.

If I’m integrating the left hand expression, it should be the same as the right hand expression.

We’re going to disassemble the toaster and then fix the broken wire inside, then reassemble the toaster.

Rewrite

∫𝐴1𝑍(𝑠)𝔼[𝑌𝑍(𝑡)|ℱ︀(𝑠)]𝑑ℙ̃(𝜔)

as

∫Ω1𝑍(𝑠)𝔼[𝑌𝑍(𝑡)|ℱ︀(𝑠)]𝕀{𝐴}𝑑ℙ̃(𝜔)

And that’s the definition of the expected value, and we can bring indicator inside because it’s nonrandom

=𝔼̃[1𝑍(𝑠)𝔼[𝕀{𝐴}𝑌𝑍(𝑡)|ℱ︀(𝑠)]]

We can use the lemma about the transformation of expectation into a different expectation using Z.

𝔼̃[𝑋]=𝔼[𝑋𝑍(𝑠)]

To get that

=𝔼[𝔼[𝕀{𝐴}𝑌𝑍(𝑡)|ℱ︀(𝑠)]]

We did all that to take out the tilde. So we can use iterated conditioning to get

=𝔼[𝕀{𝐴}𝑌𝑍(𝑡)]

=𝔼̃[𝕀{𝐴}𝑌] Which we can work backwards to prove the original.

Let 𝑋(𝑡) an Ito process.

𝑋(𝑡)=𝑋(0)+∫0𝑡Δ(𝑢)𝑑𝑊(𝑢)+∫0𝑡Θ(𝑢)𝑑𝑢

Let’s discuss the conditions for when an Ito process is a martingale.

𝔼[𝑋(𝑡)|ℱ︀(𝑠)]=𝔼[𝑋(0)+∫0𝑡Δ(𝑢)𝑑𝑊(𝑢)+∫0𝑡Θ(𝑢)𝑑𝑢|ℱ︀(𝑠)]

We know that an Ito integral with respect to a martingale is a martingale. I know that the expected value of it will be 0. But the conditioned expectation up until time s will be that integral. We have the result for the stochastic part, but not the Riemann part.

=𝑋(0)+∫0𝑠Δ(𝑢)𝑑𝑊(𝑢)+𝔼[∫0𝑡Θ(𝑢)𝑑𝑢|ℱ︀(𝑠)]

Let’s rewrite that as a combination of integrals

=𝑋(0)+∫0𝑠Δ(𝑢)𝑑𝑊(𝑢)+𝔼[∫0𝑠Θ(𝑢)𝑑𝑢+∫𝑠𝑡Θ(𝑢)𝑑𝑢|ℱ︀(𝑠)]

And I know that the s part is known.

=𝑋(0)+∫0𝑠Δ(𝑢)𝑑𝑊(𝑢)+∫0𝑠Θ(𝑢)𝑑𝑢+𝔼[∫𝑠𝑡Θ(𝑢)𝑑𝑢|ℱ︀(𝑠)]

which we can finally rewrite, using our original, as

=𝑋(𝑠)+𝔼[∫𝑠𝑡Θ(𝑢)𝑑𝑢|ℱ︀(𝑠)]

I can’t adjust this in any way. But we want to know whether it’s a martingale. So in order for us to conclude this, then that last term has to be 0. Are there restrictions that we can place on Θ(𝑢) to make sure that this is a martingale regardless of s and t? It has to always be 0. So we can get rid of it.

𝑋(𝑡)=𝑋(0)+∫0𝑡Δ(𝑢)𝑑𝑊(𝑢)

and

𝑑𝑋(𝑡)=Δ(𝑡)𝑑𝑊(𝑡) We stumbled over another way to get a martingale. If we take the differential of our process and there’s dt terms, then it can’t be a martingale because Θ(𝑡) is not 0.

Girsanov

The Big One.

What this theorem states, is that if I start with a Brownian motion, and some adapted process Θ(𝑡) that is square integrable. Using any, we can define a new Z(t)

𝑍(𝑡)=exp(−∫0𝑡Θ(𝑢)𝑑𝑊(𝑢)−12∫0𝑡Θ2(𝑢)𝑑𝑢)

And define a new stochastic process which is the Brownian motion plus the integral of the process

𝑊̃(𝑡)=𝑊(𝑡)+∫0𝑡Θ(𝑢)𝑑𝑢

Then that stochastic process is a Brownian motion.

And this is all for the goal of finding risk-neutral probability measures.

First, let’s prove that the expected value of Z is 1.

𝑍(𝑡)=exp(−∫0𝑡Θ(𝑢)𝑑𝑊(𝑢)−12∫0𝑡Θ2(𝑢)𝑑𝑢)

Let’s find the differential to see if it’s a martingale.

𝑑𝑍(𝑡)=𝑍(𝑡)𝑑𝑌(𝑡)+12𝑍(𝑡)(𝑑𝑌(𝑡))2

=−𝑍(𝑡)Θ(𝑡)𝑑𝑊(𝑡)−12𝑍(𝑡)Θ2(𝑡)𝑑𝑡+12𝑍(𝑡)Θ2(𝑡)𝑑𝑡

=−𝑍(𝑡)Θ(𝑡)𝑑𝑊(𝑡)

Because all of the dt combinations cancel out, this is a martingale.

We will use the Lévy theorem to prove that 𝑊̃(𝑡) is a Brownian motion. It needs to be a martingale, continuous paths, starts at 0, and quadratic variation is t.

The only one of these should change because of a probability measure. So we only need to show that Brownian motion is a martingale.

Now we can finally use the partial averaging proof

𝔼̃[𝑊̃(𝑡)|ℱ︀(𝑠)]=1𝑍(𝑠)𝔼[𝑊̃(𝑡)𝑍(𝑡)|ℱ︀(𝑠)]

This is the direct result of that lemma. The only thing standing in our way to finishing this proof is establishing that this is a martingale under ℙ.

Is 𝑊̃(𝑡)𝑍(𝑡) a ℙ-martingale? What’s the differential? By the product rule, it’s

𝑑(𝑊̃(𝑡)𝑍(𝑡))=𝑊̃(𝑡)𝑑𝑍(𝑡)+𝑍(𝑡)𝑑𝑊̃(𝑡)+𝑑𝑊̃(𝑡)𝑑𝑍(𝑡)

Well we already proved this result for the various differentials, so it’s

=−𝑊̃(𝑡)Θ(𝑡)𝑍(𝑡)𝑑𝑊(𝑡)+𝑍(𝑡)𝑑𝑊(𝑡)+𝑍(𝑡)Θ(𝑡)𝑑𝑡+(𝑑𝑊(𝑡)+Θ(𝑡)𝑑𝑡)(−Θ(𝑡)𝑍(𝑡)𝑑𝑊(𝑡))

That last term gets multiplied out, dt * anything is 0, becomes the negative to that third term, so we only get dW(t), so it’s a martingale.

This completes our proof.

Discount Process