Download - Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Transcript
Page 1: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Trading Strategies Generated byLyapunov Functions

Johannes Ruf

University College London

Joint work with Bob Fernholz and Ioannis Karatzas

Second International Congress on Actuarial Scienceand Quantitative Finance

Cartagena, June 2016

Page 2: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Outline

1. Functionally generated trading strategies

2. Arbitrage over arbitrary time horizons?

Page 3: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Some notation

• A probability space (Ω,F ,P) equipped with aright-continuous filtration F.

• L(X ): progressively measurable processes, integrable withrespect to some semimartingale X (·).

• d ∈ N : number of assets at time zero.

• Nonnegative continuous P–semimartingales, representing therelative market weights of each asset:

µ(·) =(µ1(·), · · · , µd(·)

)Ttaking values in

∆d =

(x1, · · · , xd

)′ ∈ [0, 1]d :d∑

i=1

xi = 1

.

Page 4: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Some notation

• A probability space (Ω,F ,P) equipped with aright-continuous filtration F.

• L(X ): progressively measurable processes, integrable withrespect to some semimartingale X (·).

• d ∈ N : number of assets at time zero.

• Nonnegative continuous P–semimartingales, representing therelative market weights of each asset:

µ(·) =(µ1(·), · · · , µd(·)

)Ttaking values in

∆d =

(x1, · · · , xd

)′ ∈ [0, 1]d :d∑

i=1

xi = 1

.

Page 5: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Some notation

• A probability space (Ω,F ,P) equipped with aright-continuous filtration F.

• L(X ): progressively measurable processes, integrable withrespect to some semimartingale X (·).

• d ∈ N : number of assets at time zero.

• Nonnegative continuous P–semimartingales, representing therelative market weights of each asset:

µ(·) =(µ1(·), · · · , µd(·)

)Ttaking values in

∆d =

(x1, · · · , xd

)′ ∈ [0, 1]d :d∑

i=1

xi = 1

.

Page 6: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Stochastic discount factors

• Some results below require the notion of a stochastic discountfactor (or, deflator) for µ(·).

• A deflator is a continuous, adapted, strictly positive processZ (·) with Z (0) = 1 for which

all products Z (·)µi (·) , i = 1, · · · , d are local martingales.

Page 7: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Stochastic discount factors

• Some results below require the notion of a stochastic discountfactor (or, deflator) for µ(·).

• A deflator is a continuous, adapted, strictly positive processZ (·) with Z (0) = 1 for which

all products Z (·)µi (·) , i = 1, · · · , d are local martingales.

Page 8: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

From integrands to trading strategies• Given: ϑ(·) ∈ L(µ).• Define

V ϑ(·) =d∑

i=1

ϑi (·)µi (·).

• Consider the quantity

Qϑ(·) = V ϑ(·)− V ϑ(0)−∫ ·0

⟨ϑ(t), dµ(t)

⟩,

which measures the “defect of self-financibility” of ϑ(·).• If Qϑ(·) = 0 fails, the process ϑ(·) is not a trading strategy.• However, for any C ∈ R,

ϕi (·) = ϑi (·)− Qϑ(·) + C

is a trading strategy and satisfies

V ϕ(·) = V ϑ(0) + C +

∫ ·0

⟨ϑ(t),dµ(t)

⟩.

Page 9: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

From integrands to trading strategies• Given: ϑ(·) ∈ L(µ).• Define

V ϑ(·) =d∑

i=1

ϑi (·)µi (·).

• Consider the quantity

Qϑ(·) = V ϑ(·)− V ϑ(0)−∫ ·0

⟨ϑ(t), dµ(t)

⟩,

which measures the “defect of self-financibility” of ϑ(·).• If Qϑ(·) = 0 fails, the process ϑ(·) is not a trading strategy.• However, for any C ∈ R,

ϕi (·) = ϑi (·)− Qϑ(·) + C

is a trading strategy and satisfies

V ϕ(·) = V ϑ(0) + C +

∫ ·0

⟨ϑ(t),dµ(t)

⟩.

Page 10: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

From integrands to trading strategies• Given: ϑ(·) ∈ L(µ).• Define

V ϑ(·) =d∑

i=1

ϑi (·)µi (·).

• Consider the quantity

Qϑ(·) = V ϑ(·)− V ϑ(0)−∫ ·0

⟨ϑ(t), dµ(t)

⟩,

which measures the “defect of self-financibility” of ϑ(·).• If Qϑ(·) = 0 fails, the process ϑ(·) is not a trading strategy.• However, for any C ∈ R,

ϕi (·) = ϑi (·)− Qϑ(·) + C

is a trading strategy and satisfies

V ϕ(·) = V ϑ(0) + C +

∫ ·0

⟨ϑ(t),dµ(t)

⟩.

Page 11: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

From integrands to trading strategies• Given: ϑ(·) ∈ L(µ).• Define

V ϑ(·) =d∑

i=1

ϑi (·)µi (·).

• Consider the quantity

Qϑ(·) = V ϑ(·)− V ϑ(0)−∫ ·0

⟨ϑ(t), dµ(t)

⟩,

which measures the “defect of self-financibility” of ϑ(·).• If Qϑ(·) = 0 fails, the process ϑ(·) is not a trading strategy.• However, for any C ∈ R,

ϕi (·) = ϑi (·)− Qϑ(·) + C

is a trading strategy and satisfies

V ϕ(·) = V ϑ(0) + C +

∫ ·0

⟨ϑ(t),dµ(t)

⟩.

Page 12: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Arbitrage relative to the market

DefinitionA trading strategy ϕ(·) is a relative arbitrage with respect to themarket portfolio over the time horizon [0,T ] if

V ϕ(0) = 1; V ϕ(·) ≥ 0

and

P(V ϕ(T ) ≥ 1

)= 1; P

(V ϕ(T ) > 1

)> 0.

Page 13: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Regular functions

DefinitionA continuous function G : supp (µ)→ R is regular if

1. there exists a measurable function

DG =(D1G , · · · ,DdG

)T: supp (µ)→ Rd

such that the process ϑ(·) ∈ L(µ) with

ϑi (·) = DiG(µ(·)

), i = 1, · · · , d ;

2. the continuous, adapted process

ΓG (·) = G(µ(0)

)− G

(µ(·)

)+

∫ ·0

⟨ϑ(t), dµ(t)

⟩has finite variation on compact intervals.

Page 14: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Regular functions

DefinitionA continuous function G : supp (µ)→ R is regular if

1. there exists a measurable function

DG =(D1G , · · · ,DdG

)T: supp (µ)→ Rd

such that the process ϑ(·) ∈ L(µ) with

ϑi (·) = DiG(µ(·)

), i = 1, · · · , d ;

2. the continuous, adapted process

ΓG (·) = G(µ(0)

)− G

(µ(·)

)+

∫ ·0

⟨ϑ(t), dµ(t)

⟩has finite variation on compact intervals.

Page 15: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Lyapunov functions

DefinitionWe call a regular function G a Lyapunov function if the processΓG (·) is non-decreasing.

Remark:Assume there exists a deflator Z (·) for µ(·) and G is nonnegative aLyapunov function for µ(·). Then

Z (·)G(µ(·)

)= Z (·)

(G (µ(0)) +

∫ ·0

d∑i=1

DiG(µ(t)

)dµi (t)

)

−∫ ·0

ΓG (t)dZ (t)−∫ ·0Z (t)dΓG (t)

is a P–local supermartingale, thus also a P–supermartingale as it isnonnegative.

Page 16: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Lyapunov functions

DefinitionWe call a regular function G a Lyapunov function if the processΓG (·) is non-decreasing.

Remark:Assume there exists a deflator Z (·) for µ(·) and G is nonnegative aLyapunov function for µ(·). Then

Z (·)G(µ(·)

)= Z (·)

(G (µ(0)) +

∫ ·0

d∑i=1

DiG(µ(t)

)dµi (t)

)

−∫ ·0

ΓG (t)dZ (t)−∫ ·0Z (t)dΓG (t)

is a P–local supermartingale, thus also a P–supermartingale as it isnonnegative.

Page 17: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Lyapunov functions

DefinitionWe call a regular function G a Lyapunov function if the processΓG (·) is non-decreasing.

Remark:Assume there exists a deflator Z (·) for µ(·) and G is nonnegative aLyapunov function for µ(·). Then

Z (·)G(µ(·)

)= Z (·)

(G (µ(0)) +

∫ ·0

d∑i=1

DiG(µ(t)

)dµi (t)

)

−∫ ·0

ΓG (t)dZ (t)−∫ ·0Z (t)dΓG (t)

is a P–local supermartingale, thus also a P–supermartingale as it isnonnegative.

Page 18: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

An example for regular and Lyapunov functions

Example

For instance, if G is of class C2, in a neighbourhood of ∆d , Ito’sformula yields

ΓG (·) = − 1

2

d∑i=1

d∑j=1

∫ ·0

D2ijG(µ(t)

)d⟨µi , µj

⟩(t)

with D2ijG = ∂2G

∂xi ∂xj. Therefore, G is regular; if it is also concave,

then G becomes a Lyapunov function.

Page 19: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

An example for regular and Lyapunov functions

Example

For instance, if G is of class C2, in a neighbourhood of ∆d , Ito’sformula yields

ΓG (·) = − 1

2

d∑i=1

d∑j=1

∫ ·0

D2ijG(µ(t)

)d⟨µi , µj

⟩(t)

with D2ijG = ∂2G

∂xi ∂xj. Therefore, G is regular; if it is also concave,

then G becomes a Lyapunov function.

Page 20: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Functionally generated strategies (additive case)For a regular function G consider the trading strategy ϕ(·) with

ϕi (·) = DiG (µ(·))− Qϑ(·) + C

with

C = G(µ(0)

)−

d∑j=1

µj(0)DjG(µ(0)

).

DefinitionWe say that the trading strategy ϕ(·) is additively generated bythe regular function G .

Proposition

The value process generated by the strategy ϕ(·) is given by

Vϕ(·) = G(µ(·)

)+ ΓG (·).

Page 21: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Functionally generated strategies (additive case)For a regular function G consider the trading strategy ϕ(·) with

ϕi (·) = DiG (µ(·))− Qϑ(·) + C

with

C = G(µ(0)

)−

d∑j=1

µj(0)DjG(µ(0)

).

DefinitionWe say that the trading strategy ϕ(·) is additively generated bythe regular function G .

Proposition

The value process generated by the strategy ϕ(·) is given by

Vϕ(·) = G(µ(·)

)+ ΓG (·).

Page 22: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Functionally generated strategies (additive case)For a regular function G consider the trading strategy ϕ(·) with

ϕi (·) = DiG (µ(·))− Qϑ(·) + C

with

C = G(µ(0)

)−

d∑j=1

µj(0)DjG(µ(0)

).

DefinitionWe say that the trading strategy ϕ(·) is additively generated bythe regular function G .

Proposition

The value process generated by the strategy ϕ(·) is given by

Vϕ(·) = G(µ(·)

)+ ΓG (·).

Page 23: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Functionally generated arbitrage (additive case)

TheoremFix a Lyapunov function G : supp (µ)→ [0,∞) satisfyingG (µ(0)) = 1, and suppose that for T∗ > 0 we have

P(ΓG (T∗) > 1

)= 1.

Then the additively generated strategy ϕ(·) strongly outperformsthe market over every time-horizon [0,T ] with T ≥ T∗.

Idea of proof:

Vϕ(T ) = G(µ(T )

)+ ΓG (T ) ≥ ΓG (T∗) > 1.

Page 24: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Functionally generated arbitrage (additive case)

TheoremFix a Lyapunov function G : supp (µ)→ [0,∞) satisfyingG (µ(0)) = 1, and suppose that for T∗ > 0 we have

P(ΓG (T∗) > 1

)= 1.

Then the additively generated strategy ϕ(·) strongly outperformsthe market over every time-horizon [0,T ] with T ≥ T∗.

Idea of proof:

Vϕ(T ) = G(µ(T )

)+ ΓG (T ) ≥ ΓG (T∗) > 1.

Page 25: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Example: entropy function

• Consider the (nonnegative) Gibbs entropy function

G (x) =d∑

j=1

xj log

(1

xj

).

• Assuming that either µ(·) ∈∆d+ or the existence of an SDF

Z (·), G is a Lypanuov function with nondecreasing

ΓG (·) =1

2

d∑j=1

∫ ·0

1µj (t)>0d⟨µj⟩(t)

µj(t).

• IfP(ΓG (t) ≥ η t , ∀ t ≥ 0

)= 1

for some real constant η > 0 , then arbitrage exists over anytime-horizon [0,T ] with T > G(µ(0))

η .

Page 26: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Example: entropy function

• Consider the (nonnegative) Gibbs entropy function

G (x) =d∑

j=1

xj log

(1

xj

).

• Assuming that either µ(·) ∈∆d+ or the existence of an SDF

Z (·), G is a Lypanuov function with nondecreasing

ΓG (·) =1

2

d∑j=1

∫ ·0

1µj (t)>0d⟨µj⟩(t)

µj(t).

• IfP(ΓG (t) ≥ η t , ∀ t ≥ 0

)= 1

for some real constant η > 0 , then arbitrage exists over anytime-horizon [0,T ] with T > G(µ(0))

η .

Page 27: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Example: entropy function

• Consider the (nonnegative) Gibbs entropy function

G (x) =d∑

j=1

xj log

(1

xj

).

• Assuming that either µ(·) ∈∆d+ or the existence of an SDF

Z (·), G is a Lypanuov function with nondecreasing

ΓG (·) =1

2

d∑j=1

∫ ·0

1µj (t)>0d⟨µj⟩(t)

µj(t).

• IfP(ΓG (t) ≥ η t , ∀ t ≥ 0

)= 1

for some real constant η > 0 , then arbitrage exists over anytime-horizon [0,T ] with T > G(µ(0))

η .

Page 28: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Cumulative excess growth of the market

0.0

0.5

1.0

1.5

2.0

2.5

1927 1932 1937 1942 1947 1952 1957 1962 1967 1972 1977 1982 1987 1992 1997 2002

YEAR

CUM

ULAT

IVE

EXCE

SS G

ROW

TH

Figure: Cumulative Excess Growth ΓG (·) for the U.S. Equity Market,during the period 1926 –1999. — Thanks to Bob Fernholz!

Page 29: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Arbitrage over arbitrary time horizons?

Assume that the market’s cumulative excess growth

ΓG (·) =1

2

d∑j=1

∫ ·0

1µj (t)>0d⟨µj⟩(t)

µj(t).

satisfiesΓG (·) ≥ η t , ∀ t ∈ [0,∞)

for some η > 0.

Does there exist arbitrage with respect to the marketportfolio over time horizon [0,T ] , for any T > 0?

Page 30: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Arbitrage over arbitrary time horizons?

Assume that the market’s cumulative excess growth

ΓG (·) =1

2

d∑j=1

∫ ·0

1µj (t)>0d⟨µj⟩(t)

µj(t).

satisfiesΓG (·) ≥ η t , ∀ t ∈ [0,∞)

for some η > 0.

Does there exist arbitrage with respect to the marketportfolio over time horizon [0,T ] , for any T > 0?

Page 31: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

A counter-example

• Consider the generating function

Q(x) = 1−d∑

j=1

x2j .

• Then

ΓQ(·) =d∑

j=1

⟨µj⟩(·) ≤

d∑j=1

∫ ·0

1µj (t)>0d⟨µj⟩(t)

µj(t)= 2ΓG (·).

• Goal: Construct process µ(·) with each component amartingale such that ΓQ(t) = t, t ∈ [0,T ∗] for some T ∗ > 0.

• This then yields a counterexample.

Page 32: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

A counter-example

• Consider the generating function

Q(x) = 1−d∑

j=1

x2j .

• Then

ΓQ(·) =d∑

j=1

⟨µj⟩(·) ≤

d∑j=1

∫ ·0

1µj (t)>0d⟨µj⟩(t)

µj(t)= 2ΓG (·).

• Goal: Construct process µ(·) with each component amartingale such that ΓQ(t) = t, t ∈ [0,T ∗] for some T ∗ > 0.

• This then yields a counterexample.

Page 33: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

An Ito diffusion• Consider d = 3 (three assets).• Consider SDEs:

dv1(t) =1√3

(v2(t)− v3(t))dΘ(t);

dv2(t) =1√3

(v3(t)− v1(t))dΘ(t);

dv3(t) =1√3

(v1(t)− v2(t))dΘ(t).

• Define r(v) =

√∑3i=1

(vi − 1

3

)2.

• Ito’s formula yields

〈v1〉(t) + 〈v2〉(t) + 〈v3〉(t) = r2(v(t)) = r2(v(0))et .

• A solution:

vi (t) =1

3+ δet/2 cos

(Θ(t) + 2π

(u +

i − 1

3

)).

Page 34: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

An Ito diffusion• Consider d = 3 (three assets).• Consider SDEs:

dv1(t) =1√3

(v2(t)− v3(t))dΘ(t);

dv2(t) =1√3

(v3(t)− v1(t))dΘ(t);

dv3(t) =1√3

(v1(t)− v2(t))dΘ(t).

• Define r(v) =

√∑3i=1

(vi − 1

3

)2.

• Ito’s formula yields

〈v1〉(t) + 〈v2〉(t) + 〈v3〉(t) = r2(v(t)) = r2(v(0))et .

• A solution:

vi (t) =1

3+ δet/2 cos

(Θ(t) + 2π

(u +

i − 1

3

)).

Page 35: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

An Ito diffusion• Consider d = 3 (three assets).• Consider SDEs:

dv1(t) =1√3

(v2(t)− v3(t))dΘ(t);

dv2(t) =1√3

(v3(t)− v1(t))dΘ(t);

dv3(t) =1√3

(v1(t)− v2(t))dΘ(t).

• Define r(v) =

√∑3i=1

(vi − 1

3

)2.

• Ito’s formula yields

〈v1〉(t) + 〈v2〉(t) + 〈v3〉(t) = r2(v(t)) = r2(v(0))et .

• A solution:

vi (t) =1

3+ δet/2 cos

(Θ(t) + 2π

(u +

i − 1

3

)).

Page 36: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

An Ito diffusion• Consider d = 3 (three assets).• Consider SDEs:

dv1(t) =1√3

(v2(t)− v3(t))dΘ(t);

dv2(t) =1√3

(v3(t)− v1(t))dΘ(t);

dv3(t) =1√3

(v1(t)− v2(t))dΘ(t).

• Define r(v) =

√∑3i=1

(vi − 1

3

)2.

• Ito’s formula yields

〈v1〉(t) + 〈v2〉(t) + 〈v3〉(t) = r2(v(t)) = r2(v(0))et .

• A solution:

vi (t) =1

3+ δet/2 cos

(Θ(t) + 2π

(u +

i − 1

3

)).

Page 37: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

An Ito diffusion (cont’d)• A slight modification:

dv1(t) =1√

3r(t)(v2(t)− v3(t))dΘ(t);

dv2(t) =1√

3r(t)(v3(t)− v1(t))dΘ(t);

dv3(t) =1√

3r(t)(v1(t)− v2(t))dΘ(t).

• This can be made sense of also if

v1(0) = v2(0) = v3(0) = 1/3.

• Now,

〈v1〉(t) + 〈v2〉(t) + 〈v3〉(t) = r2(v(t)) = t.

• Market model µ(·): stopped version of v(·).

Page 38: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

An Ito diffusion (cont’d)• A slight modification:

dv1(t) =1√

3r(t)(v2(t)− v3(t))dΘ(t);

dv2(t) =1√

3r(t)(v3(t)− v1(t))dΘ(t);

dv3(t) =1√

3r(t)(v1(t)− v2(t))dΘ(t).

• This can be made sense of also if

v1(0) = v2(0) = v3(0) = 1/3.

• Now,

〈v1〉(t) + 〈v2〉(t) + 〈v3〉(t) = r2(v(t)) = t.

• Market model µ(·): stopped version of v(·).

Page 39: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

An Ito diffusion (cont’d)• A slight modification:

dv1(t) =1√

3r(t)(v2(t)− v3(t))dΘ(t);

dv2(t) =1√

3r(t)(v3(t)− v1(t))dΘ(t);

dv3(t) =1√

3r(t)(v1(t)− v2(t))dΘ(t).

• This can be made sense of also if

v1(0) = v2(0) = v3(0) = 1/3.

• Now,

〈v1〉(t) + 〈v2〉(t) + 〈v3〉(t) = r2(v(t)) = t.

• Market model µ(·): stopped version of v(·).

Page 40: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Muchas gracias y buena suerte!

Page 41: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Concave functions are Lyapunov

TheoremA continuous function G : supp (µ)→ R is Lyapunov if it can beextended to a continuous, concave function on

1. ∆d+ = ∆d ∩ (0, 1)d and

P(µ(t) ∈∆d

+ , ∀ t ≥ 0)

= 1;

2.

(x1, · · · , xd

)T ∈ Rd :∑d

i=1 xi = 1

l

3. ∆d , and there exists a deflator Z (·).

Page 42: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Concave functions are Lyapunov

TheoremA continuous function G : supp (µ)→ R is Lyapunov if it can beextended to a continuous, concave function on

1. ∆d+ = ∆d ∩ (0, 1)d and

P(µ(t) ∈∆d

+ , ∀ t ≥ 0)

= 1;

2.

(x1, · · · , xd

)T ∈ Rd :∑d

i=1 xi = 1

l

3. ∆d , and there exists a deflator Z (·).

Page 43: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Concave functions are Lyapunov

TheoremA continuous function G : supp (µ)→ R is Lyapunov if it can beextended to a continuous, concave function on

1. ∆d+ = ∆d ∩ (0, 1)d and

P(µ(t) ∈∆d

+ , ∀ t ≥ 0)

= 1;

2.

(x1, · · · , xd

)T ∈ Rd :∑d

i=1 xi = 1

l

3. ∆d , and there exists a deflator Z (·).

Page 44: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Functions based on rank

• “Rank operator” R : ∆d 7→Wd , where

Wd =(

x1, · · · , xd)∈∆d : 1 ≥ x1 ≥ x2 ≥ · · · ≥ xd−1 ≥ xd ≥ 0

.

• Process of market weights ranked in descending order, namely

µ(·) = R(µ(·)).

• Then µ(·) can be interpreted again as a market model;however, without a deflator.

TheoremConsider a function G : supp (µ)→ R, which is regular for µ(·).Then G = G R is a regular function for µ(·).

Page 45: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Functions based on rank

• “Rank operator” R : ∆d 7→Wd , where

Wd =(

x1, · · · , xd)∈∆d : 1 ≥ x1 ≥ x2 ≥ · · · ≥ xd−1 ≥ xd ≥ 0

.

• Process of market weights ranked in descending order, namely

µ(·) = R(µ(·)).

• Then µ(·) can be interpreted again as a market model;however, without a deflator.

TheoremConsider a function G : supp (µ)→ R, which is regular for µ(·).Then G = G R is a regular function for µ(·).

Page 46: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Functions based on rank

• “Rank operator” R : ∆d 7→Wd , where

Wd =(

x1, · · · , xd)∈∆d : 1 ≥ x1 ≥ x2 ≥ · · · ≥ xd−1 ≥ xd ≥ 0

.

• Process of market weights ranked in descending order, namely

µ(·) = R(µ(·)).

• Then µ(·) can be interpreted again as a market model;however, without a deflator.

TheoremConsider a function G : supp (µ)→ R, which is regular for µ(·).Then G = G R is a regular function for µ(·).

Page 47: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Functions based on rank

• “Rank operator” R : ∆d 7→Wd , where

Wd =(

x1, · · · , xd)∈∆d : 1 ≥ x1 ≥ x2 ≥ · · · ≥ xd−1 ≥ xd ≥ 0

.

• Process of market weights ranked in descending order, namely

µ(·) = R(µ(·)).

• Then µ(·) can be interpreted again as a market model;however, without a deflator.

TheoremConsider a function G : supp (µ)→ R, which is regular for µ(·).Then G = G R is a regular function for µ(·).

Page 48: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Functionally generated strategies (multiplicative case)For a regular function G such that 1/G (µ(·)) is locally bounded,consider

ϑi (·) = ϑi (·)× exp

(∫ ·0

dΓG (t)

G(µ(t)

)) = DiG (µ(·))× exp

(∫ ·0

dΓG (t)

G(µ(t)

))and the trading strategy ψ(·) with

ψi (·) = ϑ(·)− Qϑ(·) + C .

DefinitionWe say that the trading strategy ψ(·) is multiplicatively generatedby the regular function G .

Proposition (Master equation of Fernholz, 1999, 2002)

The value process generated by the strategy ψ(·) is given by

Vψ(·) = G(µ(·)

)exp

(∫ ·0

dΓG (t)

G(µ(t)

)) > 0.

Page 49: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Functionally generated strategies (multiplicative case)For a regular function G such that 1/G (µ(·)) is locally bounded,consider

ϑi (·) = ϑi (·)× exp

(∫ ·0

dΓG (t)

G(µ(t)

)) = DiG (µ(·))× exp

(∫ ·0

dΓG (t)

G(µ(t)

))and the trading strategy ψ(·) with

ψi (·) = ϑ(·)− Qϑ(·) + C .

DefinitionWe say that the trading strategy ψ(·) is multiplicatively generatedby the regular function G .

Proposition (Master equation of Fernholz, 1999, 2002)

The value process generated by the strategy ψ(·) is given by

Vψ(·) = G(µ(·)

)exp

(∫ ·0

dΓG (t)

G(µ(t)

)) > 0.

Page 50: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Functionally generated strategies (multiplicative case)For a regular function G such that 1/G (µ(·)) is locally bounded,consider

ϑi (·) = ϑi (·)× exp

(∫ ·0

dΓG (t)

G(µ(t)

)) = DiG (µ(·))× exp

(∫ ·0

dΓG (t)

G(µ(t)

))and the trading strategy ψ(·) with

ψi (·) = ϑ(·)− Qϑ(·) + C .

DefinitionWe say that the trading strategy ψ(·) is multiplicatively generatedby the regular function G .

Proposition (Master equation of Fernholz, 1999, 2002)

The value process generated by the strategy ψ(·) is given by

Vψ(·) = G(µ(·)

)exp

(∫ ·0

dΓG (t)

G(µ(t)

)) > 0.

Page 51: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Functionally generated strategies (multiplicative case)For a regular function G such that 1/G (µ(·)) is locally bounded,consider

ϑi (·) = ϑi (·)× exp

(∫ ·0

dΓG (t)

G(µ(t)

)) = DiG (µ(·))× exp

(∫ ·0

dΓG (t)

G(µ(t)

))and the trading strategy ψ(·) with

ψi (·) = ϑ(·)− Qϑ(·) + C .

DefinitionWe say that the trading strategy ψ(·) is multiplicatively generatedby the regular function G .

Proposition (Master equation of Fernholz, 1999, 2002)

The value process generated by the strategy ψ(·) is given by

Vψ(·) = G(µ(·)

)exp

(∫ ·0

dΓG (t)

G(µ(t)

)) > 0.

Page 52: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Functionally generated arbitrage (multiplicative case)

TheoremFix a regular function G : supp (µ)→ [0,∞) satisfyingG (µ(0)) = 1, and suppose that for T∗ > 0 and ε > 0 we have

P(ΓG (T∗) > 1 + ε

)= 1 .

Then there exists a constant c > 0 such that the trading strategyψ(c)(·), multiplicatively generated by the regular functionG (c) = (G + c)/(1 + c) strongly outperforms the market over thetime-horizon [0,T∗]; and, if G is a Lyapunov function, also overevery time-horizon [0,T ] with T ≥ T∗.

Page 53: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Paying off my credit card debts ...

DefinitionA function G : ∆d → R is Lyapunov if

1. there exists a measurable function DG such that the processϑ(·) ∈ L(µ) with ϑi (·) = DiG

(µ(·)

);

2. the continuous, adapted process

ΓG (·) = G(µ(0)

)− G

(µ(·)

)+

∫ ·0

⟨ϑ(t), dµ(t)

⟩is nondecreasing.

TheoremA function G is a Lyapunov function if it is either

1. concave on ∆d+ = ∆d ∩ (0, 1)d and µ(·) ∈∆d

+; or

2. concave and continuous on ∆d , and there exists a deflator.

Page 54: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Paying off my credit card debts ...

DefinitionA function G : ∆d → R is Lyapunov if

1. there exists a measurable function DG such that the processϑ(·) ∈ L(µ) with ϑi (·) = DiG

(µ(·)

);

2. the continuous, adapted process

ΓG (·) = G(µ(0)

)− G

(µ(·)

)+

∫ ·0

⟨ϑ(t), dµ(t)

⟩is nondecreasing.

TheoremA function G is a Lyapunov function if it is either

1. concave on ∆d+ = ∆d ∩ (0, 1)d and µ(·) ∈∆d

+; or

2. concave and continuous on ∆d , and there exists a deflator.

Page 55: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Remarks on the proof that a concave function is Lyapunov

Dellacherie & Meyer:

A paper from 1972:

Page 56: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Remarks on the proof that a concave function is Lyapunov

Dellacherie & Meyer:

A paper from 1972:

Page 57: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Remarks on the proof that a concave function is Lyapunov

Dellacherie & Meyer:

A paper from 1972:

Page 58: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Remarks on the proof that a concave function is Lyapunov

Outline:

• Continuous semimartingale X = N − A on [[0, τ [[ such thatlimt↑τ Xt exists in R can only lose semimartingale property ifeither

• N and A diverge, or• the variation of A tends to infinity.

• Simple to show that that cannot happen.

• Iterate this argument.

Warning: Without the assumption that a semimartingale X is“almost a martingale” (in the sense that there exists an SDF), aconcave transformation of X on a compact set is usually NOT asemimartingale, not even in one dimension.

Page 59: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Remarks on the proof that a concave function is Lyapunov

Outline:

• Continuous semimartingale X = N − A on [[0, τ [[ such thatlimt↑τ Xt exists in R can only lose semimartingale property ifeither

• N and A diverge, or• the variation of A tends to infinity.

• Simple to show that that cannot happen.

• Iterate this argument.

Warning: Without the assumption that a semimartingale X is“almost a martingale” (in the sense that there exists an SDF), aconcave transformation of X on a compact set is usually NOT asemimartingale, not even in one dimension.

Page 60: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Remarks on the proof that a concave function is Lyapunov

Outline:

• Continuous semimartingale X = N − A on [[0, τ [[ such thatlimt↑τ Xt exists in R can only lose semimartingale property ifeither

• N and A diverge, or• the variation of A tends to infinity.

• Simple to show that that cannot happen.

• Iterate this argument.

Warning: Without the assumption that a semimartingale X is“almost a martingale” (in the sense that there exists an SDF), aconcave transformation of X on a compact set is usually NOT asemimartingale, not even in one dimension.

Page 61: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Remarks on the proof that a concave function is Lyapunov

Outline:

• Continuous semimartingale X = N − A on [[0, τ [[ such thatlimt↑τ Xt exists in R can only lose semimartingale property ifeither

• N and A diverge, or• the variation of A tends to infinity.

• Simple to show that that cannot happen.

• Iterate this argument.

Warning: Without the assumption that a semimartingale X is“almost a martingale” (in the sense that there exists an SDF), aconcave transformation of X on a compact set is usually NOT asemimartingale, not even in one dimension.

Page 62: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Discussion: entropy function

Recall:

ΓG (·) =1

2

d∑j=1

∫ ·0

d⟨µj⟩(t)

µj(t);

P(ΓG (t) ≥ η t , ∀ t ≥ 0

)= 1.

• Under this condition there exists one (horizon-independent)trading strategy, which is an arbitrage over any time-horizon[0,T ] with

T >G (µ(0))

η.

• Fernholz & Karatzas (2005) asked whether then there is alsoarbitrage possible over any time horizon.

Page 63: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Discussion: entropy function

Recall:

ΓG (·) =1

2

d∑j=1

∫ ·0

d⟨µj⟩(t)

µj(t);

P(ΓG (t) ≥ η t , ∀ t ≥ 0

)= 1.

• Under this condition there exists one (horizon-independent)trading strategy, which is an arbitrage over any time-horizon[0,T ] with

T >G (µ(0))

η.

• Fernholz & Karatzas (2005) asked whether then there is alsoarbitrage possible over any time horizon.

Page 64: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

Discussion: entropy function

Recall:

ΓG (·) =1

2

d∑j=1

∫ ·0

d⟨µj⟩(t)

µj(t);

P(ΓG (t) ≥ η t , ∀ t ≥ 0

)= 1.

• Under this condition there exists one (horizon-independent)trading strategy, which is an arbitrage over any time-horizon[0,T ] with

T >G (µ(0))

η.

• Fernholz & Karatzas (2005) asked whether then there is alsoarbitrage possible over any time horizon.

Page 65: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

On the process ΓG (·)• If there exists a stochastic discount factor, then the process

ΓG (·) is independent of the choice of the supergradient.

• Bouleau (1981, 1984): If G is twice continuously differentiablein some “open” A ∈∆d ,

ΓG (·) =1

2

d∑i ,j=1

∫ ·01A(X (t))Di ,jG (µ(t))d〈µi , µj〉(t)

+

∫ ·01∆d\A(X (t))dΓG (t).

• Our conjecture: quadratic covariation:

ΓG (·) =1

2

d∑i ,j=1

[DiG (µ(·)), µj(·)].

Page 66: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

On the process ΓG (·)• If there exists a stochastic discount factor, then the process

ΓG (·) is independent of the choice of the supergradient.

• Bouleau (1981, 1984): If G is twice continuously differentiablein some “open” A ∈∆d ,

ΓG (·) =1

2

d∑i ,j=1

∫ ·01A(X (t))Di ,jG (µ(t))d〈µi , µj〉(t)

+

∫ ·01∆d\A(X (t))dΓG (t).

• Our conjecture: quadratic covariation:

ΓG (·) =1

2

d∑i ,j=1

[DiG (µ(·)), µj(·)].

Page 67: Trading Strategies Generated by Lyapunov Functionsicasqf.org/2016/wp-content/uploads/2016/06/Johannes-Ruf.pdfTrading Strategies Generated by Lyapunov Functions Johannes Ruf University

On the process ΓG (·)• If there exists a stochastic discount factor, then the process

ΓG (·) is independent of the choice of the supergradient.

• Bouleau (1981, 1984): If G is twice continuously differentiablein some “open” A ∈∆d ,

ΓG (·) =1

2

d∑i ,j=1

∫ ·01A(X (t))Di ,jG (µ(t))d〈µi , µj〉(t)

+

∫ ·01∆d\A(X (t))dΓG (t).

• Our conjecture: quadratic covariation:

ΓG (·) =1

2

d∑i ,j=1

[DiG (µ(·)), µj(·)].