This paper develops a dual representation for the Kantorovich functional in the context of martingale optimal transport, utilizing quotient sets, Choquet capacities, and a regularized topology on the Skorokhod space.
Contribution
It introduces a novel dual formulation of the Kantorovich functional for martingale measures using quotient sets and Choquet capacities, with new regularization techniques on the Skorokhod space.
Findings
01
Dual representation of Kantorovich functional established
02
Choquet capacity generated by martingale measures constructed
03
Regularized S-topology on Skorokhod space developed
Abstract
We obtain a dual representation of the Kantorovich functional defined for functions on the Skorokhod space using quotient sets. Our representation takes the form of a Choquet capacity generated by martingale measures satisfying additional constraints to ensure compatibility with the quotient sets. These sets contain stochastic integrals defined pathwise and two such definitions starting with simple integrands are given. Another important ingredient of our analysis is a regularized version of Jakubowski's S-topology on the Skorokhod space.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Banach Space Theory · Optimization and Variational Analysis
Full text
Martingale optimal transport duality111Research
was partly supported by the Swiss National Foundation Grant SNF 200020-172815.
Patrick Cheridito222Department of Mathematics, ETH Zurich, Switzerland
Matti Kiiski22footnotemark: 2
David J. Prömel333Mathematical Institute, University of Oxford, UK
H. Mete Soner444Department of Operations Research and Financial Engineering, Princeton University, USA
Abstract
We obtain a dual representation of the Kantorovich functional defined for functions on the Skorokhod space using quotient sets. Our representation takes the form of a Choquet capacity generated by martingale measures satisfying additional constraints to ensure compatibility with the quotient sets. These sets contain stochastic integrals defined pathwise and two such definitions starting with simple integrands are given. Another important ingredient of our analysis is a regularized version of Jakubowski’s S-topology on the Skorokhod space.
Kantorovich duality
[42, 43] is an important
tool in the classical theory of optimal
transport [3, 13, 57].
Abstractly it provides a dual
representation for a
convex, lower semicontinuous functional
Φ defined on a locally convex
Riesz spaceX, i.e., a
locally convex lattice-ordered topological vector space.
In the Kantorovich setting, X is a set of real-valued functions defined
on a topological space Ω. Typical examples are the set of all bounded continuous
functions Cb(Ω) or the set of all bounded Borel measurable functions
Bb(Ω) with the supremum norm.
For a quotient set given by a convex cone I, we consider the extended real-valued functional given by
[TABLE]
There are several immediate properties of
Φ. For instance, it follows directly from the definition that Φ is monotone and convex. Also,
it is clear that for any constant c, one has
Φ(c;I)≤c and
Φ(λξ;I)=λΦ(ξ;I)
for every λ≥0. If additionally, one can establish that
Φ is lower semicontinuous and proper (i.e.,
not identically equal to infinity and never equal to minus infinity),
then one may apply the Fenchel-Moreau theorem [60, Theorem 2.4.14] to obtain the
representation
[TABLE]
where the set of sub-gradients ∂Φ is
the convex subset of the topological dual X∗ of X given by
∂Φ=∂Φ(0;I):={φ∈X∗:φ(ξ)≤Φ(ξ;I)\mboxforallξ∈X}.
This formulation is similar to the one given in [13].
In addition to many other applications, it provides a natural framework
for risk management [51, 52]. Recently, it has also been used to reduce
model dependency in pricing problems [8, 33]. In these applications, Φ
is the super-replication functional and I the hedging set. The main
goal of this paper is to establish the dual representation (1.1) in the case where
Ω is a suitable subset of the Skorokhod space
taking also the trajectory of transportation into account.
In classical optimal transport, one has Ω=Rd×Rd
and the quotient set Iot is defined through
two given probability measures μ,ν on Rd
by
[TABLE]
where μ(f)=∫fdμ, ν(h)=∫hdν and
(f⊕h)(x,y):=f(x)+h(y).
Let Φot be the corresponding convex functional
on X=Cb(Ω) with the supremum norm.
Then, it is immediate that Φot is proper
and Lipschitz continuous. Moreover,
[TABLE]
Hence, any φ∈∂Φot is non-negative and has marginals
μ and ν. It follows that φ is tight and therefore a Radon
probability measure on Ω.
Alternatively,
one could deduce the countable additivity
of the dual elements by
using the β0-topology on Cb(Ω)
recalled in Appendix B below.
If the topology on Ω is completely regular Hausdorff (T321), then
the topological dual of Cb(Ω) with the β0-topology
is equal to the set of all signed Radon measures of finite total variation
and the tightness argument is not needed. On the other hand, one then has to prove
the continuity of Φ with respect to this topology. We use
this observation in our study, which considers the problem on a more complex
topological space Ω.
Kellerer [45] used Choquet’s capacibility theorem [20] to show that the optimal transport
duality also holds for measurable (and Suslin) functions if measurable functions are used in the
definition of the quotient set. Similarly, for martingale or constrained optimal transport, one needs to
enlarge the set I to achieve duality for more general functions with the same set of sub-gradients
[9, 29]. Alternatively, one could fix the quotient set I
and obtain duality by extending the set of sub-gradients
as it is done in [29]. We do not pursue this approach here.
In this paper, we study general martingale optimal transport
on a subset Ω of the Skorokhod space D([0,T];R+d) of all R+d-valued
càdlàg functions, i.e., functions ω:[0,T]↦R+d that are
continuous from the right and have finite left limits.
We assume that Ω is a closed subset of D([0,T];R+d) with respect to Jakubowski’s
S-topology [39, 40] and endow it with a regularized version of S.
Our main goal is to prove duality with the same Choquet capacity
defined by countably additive (martingale) measures,
for different choices of X by appropriately extending the quotient set.
Martingale optimal transport was first introduced
in a discrete time model in [8]
and in continuous time in [33].
Since then it has been investigated
extensively. The initial duality results
[25, 26, 27, 38]
are proved
by real-analytic techniques and
only for uniformly continuous functions.
Alternatively,
[4, 5, 6, 18, 19] use functional analytical tools. In particular,
[18] provides
a general representation result.
[19] proves duality in discrete time and [4, 5, 6] for a σ-compact set
Ω. Our approach is similar to that of [6] but
without the assumption of σ-compactness.
Instead, we use the S-topology introduced by Jakubowski [39]
which provides an efficient
characterization
of compact sets via up-crossings. This characterization
allows us in Theorem 6.4 to construct an increasing sequence of
compact sets Kn such that Φ(\mathbbm1Ω∖Kn)
decreases to zero. This localization result is central to our approach.
In a similar context, Jakubowski’s S-topology was first used
in [34, 35, 36] to prove several important properties of martingale optimal transport.
Their set-up is related to [33] and differs from ours.
In martingale optimal transport, the quotient set I
contains the “stochastic integrals”. Since
there is no a priori given probabilistic structure,
the definition of the
integral must be pathwise and is
a delicate aspect of the problem.
Starting from simple integrands, we first
extend the integrands using
the theory developed by Vovk [58, 59],
later by [49] and used
in [7] to prove duality.
This construction provides
duality for upper semicontinuous
functions.
We then further enlarge the quotient set I by taking its Fatou-closure
as defined in Subsection 2.3
and prove the duality for measurable functions
by using Choquet’s capacitability theorem
as done earlier in [4, 5, 6, 9].
These results are stated in Theorem 3.1.
Section 8 provides examples
showing the necessity of enlarging the set of integrands.
There are also deep
connections between duality and the fundamental
theorem of asset pricing (FTAP),
which provides equivalent conditions
for the dual set of measures to be non-empty.
In the classical probabilistic setting,
[37] proves it
for the Black-Scholes model,
[21] for discrete time and
[22, 23] in full generality.
The robust discrete time model has first been studied in [1] and
later in [15, 16, 17]. [10, 14] on the other hand
study probabilistic models with none or finitely many static options.
We also obtain a general robust FTAP, Corollary 9.7,
as an immediate consequence of our main duality result Theorem 3.1.
The paper is organized as follows. After providing the necessary
structure and definitions in Section 2, we state
the main result in Section 3. Important properties
of the dual elements are proven in Section 4,
and several approximation results are derived in Section 5.
Section 6 analyses Φ on Cb(Ω).
The proof of the main result, Theorem 3.1, is given in Section 7.
Several examples are constructed in Section 8.
Section 9 discusses applications to model-free finance.
The topological structures used in the paper and a sufficient condition
for a probability measure to be a martingale measure are given in the Appendix.
2 Set-up
Let Ω be a non-empty subset of the Skorokhod space D([0,T];R+d) of
all càdlàg functions ω:[0,T]→R+d that is closed with respect to
Jakubowski’s S-topology [39, 40]. We denote the relative topology of S on
Ω again by S and, similarly to [46], endow Ω with the
coarsest topology S∗ making all S-continuous functions ξ:Ω→R continuous.
More details on S and S∗ are given in Appendix A, where it is shown that (Ω,S∗) is a
perfectly normal Hausdorff space (T6), and every Borel probability measure on (Ω,S∗)
is automatically a Radon measure. Moreover, we know from [39, 46] that for all s<t and
every i=1,…,d, ∫stωi(u)du is continuous with respect to S, and
[TABLE]
is S-lower semicontinuous, where ∣⋅∣ denotes the Euclidean norm on Rd.
For t∈[0,T], we denote by Xt(ω)=ω(t) the coordinate
map on Ω and let FX=(Ft)t∈[0,T] be the natural filtration
of X given by FtX=σ(Xs:s≤t). By F=(Ft), we denote the
right-continuous filtration given by Ft=Ft+X=⋂s>tFsX, t<T, and
FT=FTX. Adapted and predictable processes, as well as stopping times,
are defined with respect to the filtration F.
In particular, for any open subset A of R+d, the hitting time
τA(ω)=inf{t≥0:Xt(ω)∈A} is a stopping time; see e.g. [24, 50] for these facts.
Moreover, arguments from [39, 46] show that FT=FTX is equal to the collection of all Borel subsets of (Ω,S∗).
2.1 Riesz spaces
Let B(Ω) be the set of all Borel measurable functions ξ:Ω→[−∞,∞]
and Bb(Ω) the subset of bounded functions in B(Ω). For p∈[1,∞),
we define
[TABLE]
and
[TABLE]
By Ub(Ω) and Up(Ω) we denote the sets of all upper semicontinuous
functions in Bb(Ω) and Bp(Ω), respectively. C(Ω) is the
set of all real-valued continuous functions on Ω. Cb(Ω) and
Cp(Ω) are defined analogously to Ub(Ω) and Up(Ω).
In addition, we need the set
[TABLE]
where ξ+=max(ξ,0) and ξ−=max(−ξ,0).
By M(Ω) we denote the set of all signed Radon measures of bounded total variation on
Ω and by P(Ω)⊂M(Ω) the subset of probability measures.
For Q∈P(Ω) and ξ∈B(Ω), we define the expectation EQ[ξ]∈[−∞,∞]
by EQ[ξ]:=EQ[ξ+]−EQ[ξ−] with the convention ∞−∞=−∞. For p≥1,
Lp(Ω,Q) is the collection of all functions ξ∈B(Ω) satisfying
EQ[∣ξ∣p]<∞.
The β0-topology on Cb(Ω) is generated by the semi-norms
∥.η∥∞, η∈B0+(Ω), where we use the
superscript + to indicate the subset of non-negative elements.
More details on the β0-topology are given in Appendix B.
Since (Ω,S∗) is a perfectly normal Hausdorff space, it is also completely regular,
and it follows that the dual of Cb(Ω) with the β0-topology is M(Ω); see e.g.
[41, 54].
2.2 The standing assumption
We fix universal constants1≤p<q. All our definitions and results depend on
them, but we do not show this dependence in our notation.
Definition 2.1**.**
For a convex cone G⊂B(Ω), we denote by
Q(G) the (possibly empty) set of all probability measures
Q∈P(Ω) such that EQ[γ]≤0 for all γ∈G
and the canonical map X is an (F,Q)-martingale, i.e.,
for every t∈[0,T], Xt∈L1(Ω,Q)
and EQ[Y⋅(Xt−XT)]=0
for all Ft-measurable
Y∈Bb(Ω)d.**
The following assumption is used throughout the paper.
Although all results assume it, we do not always state this assumption
explicitly.
Assumption 2.2**.**
G⊂Cq,p(Ω)* is a convex cone, and there exist cq∈R+ and ξq∈G
such that ∣XT∣q≤cq+ξq.*
Then, for every Q∈Q(G), EQ[∣XT∣q]≤cq+EQ[ξq]≤cq. We combine this with Doob’s martingale
inequality to conclude that
[TABLE]
In particular, EQ[Y⋅(Xt−XT)]=0 for all Q∈Q(G),
every t∈[0,T] and any Ft-measurable
Y∈Bq−1(Ω)d.
If, for a given μ∈P(R+d), G contains all functions
g(ω(T))−μ(g) with g∈Cb(R+d),
then any element Q∈Q(G) has the marginal
μ at the final time T. Hence, the above construction
includes the classical example of given marginals.
For this example, the celebrated result of Strassen [55]
provides necessary and sufficient conditions for Q(G) to be non-empty;
see also Corollary 9.7, below.
2.3 Integrals and quotient sets
A simple integrandH consists of a sequence of pairs (τn,hn)n∈N
such that
τ0≤τ1≤τ2≤⋯ are
F-stopping times, and each
hn∈Bq−1(Ω)d is Fτn-measurable.
We assume that for every ω∈Ω there is an index
n(ω) such that
τn(ω)≥T.
The corresponding integral is defined directly as
[TABLE]
A simple integrand H is called
admissible if for some λ∈Bq+(Ω)
[TABLE]
Hs denotes the set of all admissible
simple integrands.
An admissible integrand is a
collection of simple integrands H:=(Hk)k∈N⊂Hs
satisfying
(Hk⋅X)t≥−Λ,
for every t∈[0,T], k∈N,
for some Λ∈Bq+(Ω). H denotes
the set of all admissible integrands. The corresponding
integral is defined pathwise by,
[TABLE]
We use the following quotient sets:
[TABLE]
[TABLE]
Moreover, let I(G)⊂B(Ω) be the Fatou-closure of I(G), i.e., the smallest set
of extended real-valued Borel measurable functions containing I(G) with the property that
for every sequence {ℓn}n∈N⊂I(G) satisfying a
uniform lower bound ℓn≥−λ for some λ∈Bq+,
liminfnℓn∈I(G). In the context of financial applications,
similar integrals were first constructed in [58] and later used in
[7, 49, 59]. Their properties have recently been studied in [48].
It is clear that Is(G)⊂I(G)⊂I(G)
and I(0) are all convex cones.
where σQ(G)(⋅):=supQ∈Q(G)EQ[⋅]
is the support functional of Q(G).
The proof is given in Section 7. If Q(G) is empty,
by convention σQ(G) is identically equal to minus infinity, in which case
both sides of the above equalities are
equal to minus infinity; see Corollary 5.3.
Counter-examples
of Section 8
show that in general Is(G) could be smaller
than I(G) and (3.2) does not hold in general with I(G).
4 Properties of Q(G)
Recall X∗ in (2.1). If Q(G) is empty, all results of this section hold trivially.
For ξ∈B(Ω), we define for every constant c≥0,
[TABLE]
Lemma 4.1**.**
limc→∞σQ(G)(ξc)=σQ(G)(ξ)* for all ξ∈Bp(Ω).*
Proof.
Fix Q∈Q(G) and ξ∈Bp(Ω).
There exists
a constant c0>0 so that
∣ξ(ω)∣≤c0X∗p(ω) whenever ∣ξ(ω)∣≥c0.
Using (2.1),
we estimate that for c≥c0,
[TABLE]
Hence, by sub-additivity,
[TABLE]
∎
Lemma 4.2**.**
For every H∈H, t∈[0,T], and Q∈Q(G),
EQ[(H⋅X)t]≤0.
Consequently, EQ[ℓ]≤0
for every ℓ∈I(G) and Q∈Q(G).
Proof.
Fix Q∈Q(G) and
H=(τn,hn)n∈N∈Hs.
For m≥1, set
[TABLE]
Since by definition each hn∈Bq−1(Ω)d
and X is an (F,Q)-martingale, we have
EQ[ℓtm]=0. By the admissibility of H,
there exists λ∈Bq+(Ω) such that
ℓtm≥−λ for each m and t∈[0,T].
Therefore, by Fatou’s Lemma and (2.1),
[TABLE]
Let H=(Hk)k∈N∈H. Then, by definition each Hk∈Hs and
by the above result EQ[(Hk⋅X)t]≤0.
Again by admissibility, there exists Λ∈Bq+(Ω) so that
(Hk⋅X)t≥−Λ for each k≥1,t∈[0,T].
By Fatou’s Lemma,
for t∈[0,T],
[TABLE]
The final
statement follows directly from the definitions.
∎
Lemma 4.3**.**
For every ℓ∈I(G) and Q∈Q(G),
EQ[ℓ]≤0. Therefore,
[TABLE]
Proof.
Set
K(G):={ξ∈B(Ω):σQ(G)(ξ)≤0}.
By Lemma 4.2, I(G)⊂K(G).
Consider a sequence {ξn}n∈N⊂K(G)
satisfying a uniform lower bound ξn≥−λ
for some λ∈Bq+(Ω).
Then, by Fatou’s Lemma and the uniform bound
(2.1),
[TABLE]
Hence, liminfnξn∈K(G).
Since I(G), by its definition,
is the smallest set of measurable functions
with this property
containing I(G),
we conclude that I(G)⊂K(G).
Fix ξ∈B(Ω).
Suppose that ξ≤c+ℓ for some c∈R and
ℓ∈I(G). Since I(G)⊂K(G),
EQ[ξ]≤EQ[c+ℓ]≤c for every
Q∈Q(G).
Hence, σQ(G)(ξ)≤c.
Since Φ(ξ;I(G))
is the infimum of all such constants,
σQ(G)(ξ)≤Φ(ξ;I(G)).
The fact I(G)⊂I(G)
implies that
Φ(ξ;I(G))≤Φ(ξ;I(G)).
∎
5 Approximation results
Lemma 5.1**.**
c^q∗:=Φ(X∗q;I(G))<∞.
Proof.
For N∈N,
{yk}k=0N⊂R+ and n≤N, let
yn∗:=max0≤k≤nyk.
Step 2.
Set τ0:=0 and for each ω∈Ω and n∈N
define recursively
[TABLE]
Then, the
τn’s are stopping times.
For ω∈Ω, i=1,…,d, n=0,1,2,…, set
[TABLE]
It is clear that hn∗∈Bq−1(Ω)d
and therefore H∗:=(τn,hn∗)n∈N is a simple integrand.
Step 3. We claim that H∗ is
admissible. Indeed, fix t∈[0,T], ω∈Ω, i=1,…,d, and set
yn:=Xτn∧ti(ω). For k∈N, set
[TABLE]
Then, for
n≤n~, yn=Xτni and therefore,
hn∗,i(ω)=h(yn∗). For n~<n<k,
Xτn+1∧ti=Xτn∧ti=Xti and yn~+1=Xτk∧ti.
By Step 1,
[TABLE]
Hence, for every t∈[0,T]
and integer k,
[TABLE]
for some constant c∗ depending only on d and q.
Hence, H∗ is admissible.
Step 4. We let t=T in (5.1)
and send k to infinity to obtain
[TABLE]
Choose a constant c^∗ so that
for all y=(y1,…,yd)∈R+d,
∣y∣q≤c^∗∑i≤d∣yi∣q.
Let cq,ξq be as in Assumption 2.2.
Then,
[TABLE]
Since H∗∈Hs, ξq∈G and G is a cone,
ℓ∗:=(c^∗H∗⋅X)T+c^∗c∗ξq∈I(G).
Step 5. By definition of the τn’s,
[TABLE]
from which one obtains Φ(X∗q;I(G))≤c^∗c∗cq+1<∞.
∎
Corollary 5.2**.**
For any convex cone I⊃I(G) and ξ∈Bp(Ω), one has
limc→∞Φ(ξc;I)=Φ(ξ;I).
Proof.
Fix ξ∈Bp(Ω). There exists c0>0 so that
∣ξ∣≤c0X∗p whenever ∣ξ∣≥c0.
Step 1.
For c≥c0,
[TABLE]
Since I includes I(G), Φ((∣ξ∣−c)\mathbbm1{∣ξ∣≥c};I)≤c0q/pc1−q/pΦ(X∗q;I(G)), which in view of Lemma 5.1, gives
limsupc→∞Φ((∣ξ∣−c)\mathbbm1{∣ξ∣≥c};I)≤0.
Step 2.
Since ∣ξ−ξc∣≤(∣ξ∣−c)\mathbbm1{∣ξ∣≥c}, one obtains from sub-additivity,
[TABLE]
which by the previous step, gives
limsupc→∞Φ(ξc;I)≤Φ(ξ;I).
Step 3.
Similarly,
[TABLE]
and therefore, Φ(ξ;I)≤liminfc→∞Φ(ξc;I).
∎
It is a direct consequence of the definition that Φ(ξ;I(G))≤∥ξ∥∞ for any ξ∈Bb(Ω).
In particular, Φ(0;I(G))≤0.
Corollary 5.3**.**
We have the following alternatives:
(i)
If Φ(0;I(G))=0, then
∣Φ(ξ;I(G))∣≤∥ξ∥∞ for all ξ∈Bb(Ω).
(ii)
If Φ(0;I(G))<0, then Q(G) is empty,
and Φ(⋅;I(G))≡Φ(⋅;I(G))≡−∞
on Bp(Ω).
In particular,
(3.1) and (3.2) hold trivially.
Proof.
First, suppose that Φ(0;I(G))=0 and let ξ∈Bb(Ω). Since
ξ+∥ξ∥∞≥0, one has
[TABLE]
Now assume that Φ(0;I(G))<0. Then, there exist c<0, ℓ∈I(G) such that
c+ℓ≥0. Also, for any constant
λ>0, λ(c+ℓ)≥0. Since I(G) is a
cone, λℓ∈I(G) and consequently,
Φ(0;I(G))≤cλ. As λ>0 above was arbitrary,
we have Φ(0;I(G))=−∞ and
[TABLE]
This shows that −∞≤σQ(G)(⋅)≤Φ(⋅;I(G))≤Φ(⋅;I(G))≡−∞ on Bb(Ω), and by Corollary 5.2, also on
Bp(Ω).
Moreover, (4.2) implies that if Q(G) is non-empty,
Φ(0;I(G))=0. Hence if Φ(0;I(G))<0, Q(G) must be empty.
∎
For an Rd-valued càdlàg process Y, set
[TABLE]
Lemma 5.4**.**
Let Y be an Rd-valued, adapted, càdlàg process.
Suppose that there exists λ∈Bq−1(Ω)
satisfying ∣Yu∣≤λ for every
u∈[0,T].
Then, ℓY∈I(0) and
for any quotient set I containing
I(0), Φ(ℓY;I)≤0
Proof.
For k∈N and n=0,…,k set
τnk:=nT/k, Ynk:=Yτnk,
Xnk:=Xτnk,
h0k:=−(T/k)Y0 and hnk:=hn−1k−(T/k)Ynk for n≥1.
Since λ∈Bq−1(Ω),
the simple integrand Hk:=(τnk,hnk)n=0k
is admissible.
Moreover,
[TABLE]
Let H:=(Hk)k∈N. Since both Y and X are càdlàg,
[TABLE]
One can directly verify that H∈H. Hence, ℓY∈I(0).
∎
6 Continuity on Cb(Ω)
We use the compact notation
Φ(⋅)=Φ(⋅;I(G)).
Lemma 6.1**.**
limsupc→∞Φ(\mathbbm1{X∗>c})≤0.
Proof.
Fix c>0, i∈{1,…,d} and
set X∗i:=supt∈[0,T]Xti.
Since XTi≥0,
[TABLE]
Set h1i=−1, h1j=0 for j=i,
τ0(ω):=inf{t≥0:Xti∈(c,∞)}∧T, τ1:=T and let H be the corresponding
integrand. Then, (H⋅X)T=(Xτ1i−XTi).
By right-continuity, we have Xτ1i≥c on the set {X∗i>c}
and τ1=T on its complement. Consequently,
(H⋅X)T≥(c−XTi)\mathbbm1{X∗i>c}
and
Φ((c−XTi)\mathbbm1{X∗i>c})≤0.
Therefore,
Φ(\mathbbm1{X∗i>c})≤Φ(XTi)/c, which, by Lemma 5.1, converges to
zero as c tends to infinity.
Since {X∗>dc}⊂∪i{X∗i>c},
the claim of the lemma follows from the sub-additivity of Φ.
∎
Definition 6.2**.**
For ω∈D([0,T];R+), t∈[0,T], and
a<b, the number of* up-crossings up to t,
Uta,b(ω), *is the largest
integer
n for which one can find
0≤t1<⋯<t2n≤t
such that ω(t2k−1)<a and ω(t2k)>b
for k=1,…,n. **
For ω∈D([0,T];R+d),
we set Uta,b,i(ω):=Uta,b(ωi).
Lemma 6.3**.**
For 0<a<b and i=1,…,d,
there exists Ha,b,i∈Hs
such that
[TABLE]
Proof.
For k≥1, set Ik:=[0,a) if k is an odd integer
and Ik:=(b,∞) if k is even, and τ0:=0.
Recursively define a sequence of random times by
[TABLE]
where the infimum over an empty set is infinity.
Since X is càdlàg and Ik is open,
τk’s are F-stopping times.
Define hk=(hk1,…,hkd) as follows:
hki:=1 when k is odd, hki:=0 for k even and hkj=0
for j=i.
Let Ha,b,i be the corresponding simple integrand.
It is clear that for every t∈[0,T], ω∈Ω,
(Ha,b,i⋅X)t(ω)≥−a+(b−a)Uta,b,i(ω). Hence, Ha,b,i∈Hs.
∎
6.1 Localization
Theorem 6.4**.**
There exists an increasing sequence of compact subsets
{Kn}n∈N of Ω satisfying,
[TABLE]
Proof.
We complete the proof in several steps.
Step 1.
Let D be a countable dense subset of (0,∞) and {(aj,bj):j∈N} an enumeration
of the countable set {(a,b)∈D×D:0<a<b}. For all n∈N, define
[TABLE]
where cjn:=2j+n(aj∨1)/(bj−aj) and Bn:={ω∈Ω:X∗(ω)≤n}.
Since Ω is S-closed, one obtains from [39, Corollary 2.10] that
Knij and Bn are S-closed subsets of D([0,T];R+d). Hence, all Kn are S-compact
and therefore also S∗-compact subsets of Ω; see Appendix A or [46, Corollary 5.11].
Moreover,
[TABLE]
Step 2.
Let Ha,b,i be as in Lemma 6.3
and set Hni,j:=(cjn(bj−aj))−1Haj,bj,i.
Then, for every t∈[0,T],
[TABLE]
Hence, Hni,j∈Hs and also
(Hni,j⋅X)T≥−2−(j+n)+\mathbbm1Ω∖Kni,j.
For k≥1, set
Hnk:=∑i=1d∑j=1kHni,j.
Then, for every k≥1 and t∈[0,T],
(Hnk⋅X)t≥−d2−n.
Hence, for each n, Hn:=(Hnk)k∈N∈H and
Finally, since for each pair (i,j), the sets Kni,j
are increasing in n, we conclude that Kn is also increasing in n.
∎
6.2 β0-continuity
Proposition 6.5**.**
Suppose that
Φ(0)=0. Then Φ is real-valued and β0-continuous on Cb(Ω).
Proof.
By Corollary 5.3, Φ is real-valued and the compact sets constructed in
Theorem 6.4
satisfy Φ(\mathbbm1Ω∖Kn)↓0
as n tends to infinity.
Let K0 be the empty set and by re-labelling,
we may assume that
Φ(\mathbbm1Ω∖Kk)≤2−2k,
for every k≥0.
Define
[TABLE]
Since on the complement of Kk−1,
∣η∗∣≤2−k, η∗∈B0(Ω).
Fix an integer n and
ξ∈Cb(Ω). Since
on Kk∖Kk−1, η∗=2−k, on Kk∖Kk−1, (η∗)−1=2k, so, on Kn=∪k=1n(Kk∖Kk−1),
[TABLE]
In view of the hypothesis Φ(0)=0,
∣Φ(ξ\mathbbm1Kn)∣≤Φ(∣ξ∣\mathbbm1Kn) and
consequently,
For ξ,ζ∈Cb(Ω),
by sub-additivity,
Φ(ξ)=Φ((ξ−ζ)+ζ)≤Φ(ξ−ζ)+Φ(ζ).
Hence, Φ(ξ)−Φ(ζ)≤Φ(ξ−ζ)≤4∥(ξ−ζ)η∗∥∞.
Switching the roles of ξ and ζ, we conclude that
∣Φ(ξ)−Φ(ζ)∣≤4∥(ξ−ζ)η∗∥∞.
Since the β0-topology is generated by the semi-norms
∥.η∥∞ for arbitrary η∈B0+(Ω) and
η∗∈B0+(Ω), the above inequality yields that Φ is β0-continuous on
Cb(Ω) (see Appendix B below).
∎
6.3 Sub-differential
Proposition 6.6**.**
Q(G)=∂Φ:={φ∈M(Ω):φ(ξ)≤Φ(ξ;I(G)),ξ∈Cb(Ω)}.
Proof.
The lower bound (4.2) implies that
Q(G)⊂∂Φ.
To prove the opposite inclusion, fix
Q∈∂Φ⊂M(Ω).
The monotonicity of Φ implies that
Q≥0. Since Φ(c)≤c for every constant c,
we conclude that
Q∈P(Ω).
Step 1.
Let ξ∈C+(Ω), and define ξc for c≥0 as in (4.1).
Then, ξc≤ξ and by the defining property of Q,
EQ[ξc]≤Φ(ξc)≤Φ(ξ).
So, by monotone convergence,
EQ[ξ]=limc→∞EQ[ξc]≤Φ(ξ).
Step 2.
For ε>0, set
[TABLE]
Since the map XT and time integrals are
S-continuous [39],
Xε is S∗-continuous.
Hence, for every t∈[0,T], ∣Xtε∣∈C1(Ω) and
∣Xtε∣≤X∗, where X∗ is
as in (2.1).
Also, limε→0Xtε(ω)=Xt(ω)
for every ω∈Ω.
Fix t∈[0,T] and choose ξ=∣Xtε∣q
in Step 1
to obtain,
EQ[∣Xtε∣q]≤Φ(∣Xtε∣q)≤Φ(X∗q).
By Fatou’s Lemma,
[TABLE]
where c^q∗ is as in Lemma 5.1.
Hence, Xt∈Lq(Ω,Q) for every t∈[0,T].
Step 3.
Fix t∈[0,T) and an Ft-measurable Y∈Cb(Ω)d.
For ε∈(0,T−t], set
[TABLE]
Observe that ℓY,ε∈C1(Ω),
limε→0ℓY,ε(ω)=ℓY(ω), for all ω∈Ω and
in view of
Corollary 5.4, Φ(ℓY,ε)≤0.
Moreover,
[TABLE]
Then, by Fatou’s Lemma,
EQ[ℓY]≤liminfε→0EQ[ℓY,ε].
We now use again Fatou’s Lemma,
the sub-differential inequality,
and Corollary 5.2 to obtain
EQ[ℓY,ε]≤liminfc→∞EQ[ℓY,εc]≤limc→∞Φ(ℓY,εc)=Φ(ℓY,ε)≤0.
Since this argument also holds for −Y, we conclude that
EQ[ℓY]=0.
Step 4.
Let Y be as in the previous step.
For c>0, set Yc:=Y[(∣Xt∣+1)∧c].
Since Xt,XT∈Lq(Ω,Q), by dominated convergence,
[TABLE]
The above equality, the integrability proved
in Step 2 and Lemma C.1
imply that X is an (F,Q)-martingale.
As in (2.1), this also implies that
EQ[X∗q]<∞.
Step 5. Let ξ∈Cp(Ω). Then, ∣ξ∣≤cξ(1+X∗q)
for some constant cξ and for every c>0,
∣ξc∣≤cξX∗q.
Since X∗∈Lq(Ω,Q),
dominated convergence yields that
EQ[ξ]=limc→∞EQ[ξc].
Also, by Corollary 5.2,
limc→∞Φ(ξc)=Φ(ξ)
and the sub-differential inequality at ξc∈Cb(Ω)
imply that EQ[ξc]≤Φ(ξc).
Hence,
EQ[ξ]=limc→∞EQ[ξc]≤limc→∞Φ(ξc)=Φ(ξ)
for every ξ∈Cp(Ω).
Step 6. Fix γ∈G.
Then, by Assumption 2.2,
γ∈Cq,p(Ω) and hence,
γ−∈Cp(Ω).
For a>0, set γa:=γ∧a.
Since γa≤γ,
Φ(γa)≤Φ(γ)≤0.
Also, γa∈Cp(Ω)
and by the previous step,
EQ[γa]≤Φ(γa)≤0.
Moreover, ∣γa∣≤∣γ∣≤cγ(1+X∗q) for some cγ>0.
Since X∗∈Lq(Ω,Q),
dominated convergence yields
EQ[γ]=lima→∞EQ[γa]≤0.
Hence, EQ[γ]≤0 for every γ∈G. This
and Step 4 imply that
∂Φ⊂Q(G).
∎
The above results also prove
the compactness of the set
Q(G).
Corollary 6.7**.**
Q(G)* is convex and both compact as well as sequentially compact with respect to the topology induced by the pairing
⟨Cb(Ω),M(Ω)⟩.*
Proof.
It is clear that Q(G)
is convex.
Let Kn be
as in the
proof of Theorem 6.4.
Then, by (4.2),
σQ(G)(\mathbbm1Ω∖Kn)≤Φ(\mathbbm1Ω∖Kn)=:αn.
By Theorem 6.4, αn tends to zero. Hence,
Q(Kn)≥1−αn uniformly over Q∈Q(G).
Since αn converges to zero,
Q(G) is uniformly tight.
By Proposition 6.6,
Q(G)=⋂ξ∈Cb(Ω){Q∈P(Ω):EQ[ξ]≤Φ(ξ)}.
Hence, Q(G) is weak∗ closed.
Then, by Prokhorov’s theorem for completely regular Hausdorff spaces
[12, Theorem 8.6.7], Q(G) is weak∗ compact. By the second assertion
of [12, Theorem 8.6.7], since the compact sets Kn above are
metrizable [46, Proposition 5.7], Q(G) is also sequentially weak∗ compact.
∎
In view of Corollary 5.3,
we may assume that Φ(0;I(G))=0.
Then, by the results of
Section 6, Φ is convex, finite-valued and β0-continuous.
Hence, the hypotheses of the Fenchel-Moreau
theorem on the topological space Cb(Ω) with
the locally convex β0-topology are
satisfied
[60, Theorem 2.3.3]. Since Φ
is positively homogenous,
Φ(ξ;I(G))=σ∂Φ(ξ)
for every ξ∈Cb(Ω).
We then
complete the proof of
duality on Cb(Ω)
by Proposition 6.6.
∎
7.2 Duality on Up(Ω)
We first extend the duality from Cb(Ω) to Ub(Ω)
by a minimax argument.
Lemma 7.2**.**
The duality Φ(ξ;I(G))=σQ(G)(ξ)
holds for all ξ∈Cb(Ω) if and only if it holds for all ξ∈Ub(Ω).
Proof.
Assume that the duality holds on Cb(Ω) and
let η∈Ub(Ω).
In view of (4.2), we need to show that
σQ(G)(η)≥Φ(η;I(G)).
Since S∗ is perfectly normal by Lemma A.6 below,
for every Q∈P(Ω),
EQ[η]=infη≤ξ∈Cb(Ω)EQ[ξ].
Clearly, {ξ∈Cb(Ω):η≤ξ} is a convex subset
of Cb(Ω) and the mapping
that takes (ξ,Q)
to EQ[ξ] is continuous and bilinear on
Cb(Ω)×Q(G).
Moreover, by Corollary 6.7, Q(G) is a
convex, weak∗ compact subset of P(Ω).
Hence, the assumptions of a standard minimax argument are satisfied,
see e.g. [60, Theorem 2.10.2].
Since Φ is monotone,
[TABLE]
Therefore, the duality holds on Ub(Ω).
∎
Proposition 7.3**.**
Φ(ξ;I(G))=σQ(G)(ξ)* for all ξ∈Up(Ω).*
Proof.
Fix ξ∈Up(Ω) and ξc be as in (4.1). Then,
ξc∈Ub(Ω) and duality holds at ξc. We now combine this
with Lemma 4.1 and Corollary 5.2 to arrive at
[TABLE]
∎
7.3 Duality on Bp(Ω)
In this section, we follow the approach of [45]
and extend the duality
to measurable functions
by the Choquet capacitability theorem
[20].
Proposition 7.4**.**
Φ(ξ;I(G))=σQ(G)(ξ)* for all ξ∈Bp(Ω).*
Proof.
We write Φ(⋅)
instead of Φ(⋅;I(G))
and Φ(⋅)
for Φ(⋅;I(G)) as before.
Step 1.
Since I(G)⊃I(G),
Φ≤Φ. By Proposition 7.3
and (4.2),
for every η∈Ub(Ω),
σQ(G)(η)≤Φ(η)≤Φ(η)=σQ(G)(η). Hence,
Φ=Φ on Ub(Ω).
Step 2.
Consider a sequence {Qn}n∈N in M(Ω)
converging to Q∗
in the weak∗ topology.
Then,
EQn[ξ] converges to EQ∗[ξ]
for every ξ∈Cb(Ω).
Fix η∈Ub(Ω).
Since S∗ is perfectly normal by Lemma A.6 below,
there is a decreasing sequence
{ξk}k∈N⊂Cb(Ω) converging to η and
EQ∗[ξk] converges to EQ∗[η].
We use this and the weak∗ convergence of
Qn to arrive at
[TABLE]
Since by Corollary 6.7,
Q(G) is weak∗ compact,
the above property
implies that for every η∈Ub(Ω)
there is Qη∈Q(G) satisfying,
EQη[η]=σQ(G)(η).
Step 3.
Suppose that a sequence {ηn}n∈N⊂Ub(Ω)
decreases monotonically to a function η∗∈Ub(Ω).
Then, Qn:=Qηn satisfies
EQn[ηn]=σQ(G)(ηn).
Since Q(G) is sequentially compact with respect to σ(M,Cb),
there is a subsequence
(without loss of generality,
again denoted by Qn)
and Q∗∈Q(G)
such that Qn converges
to Q∗ in the weak∗ topology.
Then, by the previous step,
[TABLE]
where we used monotone convergence in the final equality.
By the first step, Φ=Φ on Ub(Ω).
Then, by Proposition 7.3 and (4.2),
[TABLE]
Since ηn’s are decreasing to η∗,
the opposite inequality is immediate.
Hence,
[TABLE]
Step 4.
Consider {ζn}n∈N⊂Bb(Ω)
increasing monotonically to ζ∗∈Bb(Ω).
Choose {ℓn}n∈N⊂I(G) so that
Φ(ζn)+n1+ℓn(ω)≥ζn(ω),
for every ω∈Ω.
It is clear that Φ(ζ1)≤Φ(ζn)≤Φ(ζ∗).
Since ζn≥ζ1,
ℓn≥(ζ1−Φ(ζ∗)−1)∧0=:−λ.
Then, by the definition of I(G),
ℓ∗:=liminfnℓn∈I(G). Therefore,
[TABLE]
for every ω∈Ω.
Hence, limn→∞Φ(ζn)≥Φ(ζ∗). Again
the opposite inequality is immediate. So we have shown that
[TABLE]
Step 5. (7.1) and (7.2) imply
that we can apply the Choquet capacitability theorem
(see [45, Proposition 2.11] or [4, Proposition 2.1])
to the functional Φ. Let S(Ω) denote the family of all Suslin functions
generated by Ub(Ω) i.e. functions of the form
supϕ∈NNinfk≥1ξϕ∣k, where
ϕ∣k denotes the restriction of ϕ∈NN to
{1,…,k} and each ξϕ∣k is an element of Ub(Ω); we refer to
[32, Section 42] for details. Since the S∗-topology on Ω is
perfectly normal,
by Lemma A.6 below,
the family S(Ω)
contains Bb(Ω).
Moreover, Φ=Φ on Ub(Ω).
Hence,
Φ(ζ)=sup{Φ(η):η∈Ub(Ω),η≤ζ} for every ζ∈Bb(Ω).
This approximation
together with the duality proved in Lemma 7.2 yield,
[TABLE]
Hence, the duality holds on Bb(Ω).
Step 5. We now follow the proof of
Proposition 7.3mutatis mutandis
to extend the result to Bp(Ω).
∎
8 Counter-examples
In this section, d=1, T=1, p=1 and q=2.
For a given μ∈P(R+), set
[TABLE]
Example 8.1**.**
Suppose that μ is supported in [1,3]
and let Ω=D([0,1];[1,3]).
Then, there exists a countable set A⊂Ω
such that
0=σQ(Gμ)(\mathbbm1A)=Φ(\mathbbm1A;I(Gμ))
and Φ(\mathbbm1A;Is(Gμ))=1. In particular,
Is(Gμ)=I(Gμ).**
Proof.
For ω∈Ω, let v3(ω):=supπ∑k=1n∣ω(τk)−ω(τk−1)∣3,
where π ranges over all finite partitions 0=τ0<τ1<⋯<τn=1 of [0,1].
Set t0=1 and for k≥1,
tk:=1/k, sk:=(tk+1+tk)/2,
ck:=2f(sk)/(tk−tk+1) with f(x):=x1/3 for x≥0, and
[TABLE]
It is clear that ω∈A⊂Ω
and ω(tn)=0, ω(sn)=f(sn).
Set
ωn(t):=ω(t∧tn) for t∈[0,1].
Then, ωn(t)=0 for t∈[tn,1] and
[TABLE]
Let Q be the set of
rational numbers in [1,2]. Set
Aq:={q+ωn:n∈N} and
A:=∪q∈QAq.
Then, A⊂{ω∈Ω:v3(ω)=∞}.
Since for any martingale measure Q, Q(ω∈Ω:v3(ω)=∞)=0,
we conclude that σQ(Gμ)(\mathbbm1A)=0.
Suppose that for some c∈R,
γ∈G and H=(τm,hm)m∈N∈Hs,
we have c+γ(ω)+(H⋅X)1(ω)≥\mathbbm1A(ω)
for every ω∈Ω.
Then, γ(ω)=g(X1(ω)) with
μ(g)=0 and γ(ω)=g(q) for every ω∈Aq. Hence,
c+g(q)+(H⋅X)1(q+ωn)≥1,
for every q∈Q,n≥1.
By the adaptedness of H,
(H⋅X)1(q+ωn)=(H⋅X)tn(q+ω),
for each q. Therefore,
[TABLE]
This implies that c+g(q)≥1. Moreover, g is continuous
and μ(g)=0. Hence, c≥1.
Since Φ(\mathbbm1A;Is(Gμ)) is the smallest
of all such constants, we conclude that Φ(\mathbbm1A;Is(Gμ))≥1.
As \mathbbm1A≤1, Φ(\mathbbm1A;Is(Gμ))=1.
We next proceed
as in Lemma 6.3 to show that Φ(\mathbbm1A;I(Gμ))=0.
Indeed, for k≥2, define Hk=(τmk,hmk)m∈N∈Hs
as follows.
Let τ0k=0 and
for m≥1, recursively define the stopping times by,
[TABLE]
For m≥0, set h2mk=k−4/3, h2m+1k=0.
Let Utk(ω) be the crossings in the time
interval [0,t] between the lower boundary
ω(0)+k−1/3/3 and the upper boundary ω(0)+k−1/3/2.
Then, as in Lemma 6.3,
[TABLE]
In particular, Hk∈Hs. Observe that Utk(q+ωn)≥k−n for all n≤k.
Therefore, for any q∈[1,2],
[TABLE]
For ε>0, let Hε:=ε(Hj)j∈N,
where Hj:=∑k≤jHk. Then, for each j≥1,
[TABLE]
Hence, Hε is admissible. Also, for q∈[1,2],
[TABLE]
Therefore, Φ(\mathbbm1A;I(Gμ))≤εC∗ for every ε>0.
∎
The following example motivates the use of the
Fatou-closure I(G) to establish the duality for measurable functions in
Theorem 3.1.
Example 8.2**.**
Let Ω=D([0,1];R+) and consider the
quotient spaces given by G={g(X1(ω)):g∈C2,1(R+),g(1)=0}.
Then, there exists an open set B⊂Ω such that
0=σQ(G)(\mathbbm1B)=Φ(\mathbbm1B;I(G))<1=Φ(\mathbbm1B;I(G)). In particular,
I(G)=I(G).**
Proof.
Consider the open set
B:={XT=1}, set ω∗≡1
and let Q∗ be
the Dirac measure at ω∗.
Then, Q(G)={Q∗}. Hence,
σQ(G)(\mathbbm1B)=EQ∗[\mathbbm1B]=0.
Suppose that ℓ∈I(G) and c∈R satisfy
c+ℓ≥\mathbbm1B. By the definition of I(G),
there are H∈H and g(X1(⋅))∈G such that
ℓ(ω)=(H⋅X)1(ω)+g(X1(ω)).
Consider a constant path ω≡x. Then,
for this path (H⋅X)T(ω)=0 and therefore,
\mathbbm1B(ω)=1≤c+g(x) for every x=1. Since g(1)=0
and g is continuous, we conclude that c≥1. Hence,
Φ(\mathbbm1B;I(G))=1.
∎
9 Financial applications
In this section we assume that X models the discounted prices of d assets.
Alternatively, one could also model undiscounted prices and introduce an additional
process representing a savings account. But this does not change the
essential mathematical structure; see [19]. For related examples and
discussions of the role of Ω as a prediction set, we refer to [5, 6, 38].
The set G represents the set of net outcomes of investments in liquid derivative instruments.
Their initial prices are normalized to zero. Since we do not assume any probabilistic structure,
this set plays an essential role in determining the pricing functionals.
We give different examples of the set G. They show that
finite discrete-time models can be included in our framework by appropriately
choosing the closed set Ω.
Example 9.1** (Final Marginal).**
In this example Ω=D([0,T];R+d).
We fix
a probability measure μ on R+d with finite q-th moments and set
[TABLE]
Then,
Q(Gμ) consists of
all martingale measures Q whose final marginal
is μ, i.e.,
[TABLE]
Remark 9.2**.**
The duality in the setting of Example 9.3 with one fixed marginal does not immediately extend to the case of two marginals assuming that Ω=D([0,T];R+d). The difficulty arises from the fact that the coordinate mapping X0 is not continuous. This issue can be removed by introducing a fictitious element X0− on the Skorokhod space D([0,T];R+d), i.e. one considers Ωx0−:=R+d×D([0,T];R+d).**
Example 9.3** (Initial Value and Final Marginal).**
In addition to a final
marginal, in this example we wish to fix the initial
asset values x0∈R+d. However,
the canonical map,
Xt:ω∈D([0,T];R+d)↦ω(t)∈R+d,
is continuous only for t=T and discontinuous at all other points.
Therefore,
Ωx0:={ω∈Ω:ω(0)=x0}
is not an S-closed subset of D([0,T];R+d).
To overcome this difficulty, we fix a small time increment h>0 and define
[TABLE]
One may directly verify that Ωh,x0 is S-closed. We keep Gμ as in the previous example.
Then, the elements
of Q(Gμ) restricted to Ωh,x0
are martingale measures
with the final marginal μ and
satisfy
[TABLE]
The set Q(Gμ) is non-empty provided that
∫xμ(dx)=x0. **
Example 9.4** (Multiple Marginals).**
In Example 9.1 we fixed the marginal of the dual measures
at the final time. In a given application, marginals at other time points
T={t1,…,tN} might be approximately known. So one may want to fix
these marginals as well. Since Xti are all discontinuous, functions of the form g(Xti)
are not necessarily S∗-continuous on D([0,T];R+d).
So, as in the previous example, we fix a small h>0
and consider the set given by
[TABLE]
Then, ΩT is an S-closed subset of
D([0,T];R+d).
Moreover, for each i, Xti restricted to ΩT
is S∗-continuous. Given probability measures
{μi}i=1N on R+d with finite q-th moments, we consider the set
[TABLE]
Then, GT⊂Cq(ΩT). The measures Q∈Q(GT) are
martingale measures and have marginal μi at times t∈[ti,ti+h).
Assume 0≤t1<…<tN≤T.
In view of Strassen’s result [55], Q(GT) is non-empty
if and only if μi’s are increasing in convex order, i.e,
μ1(φ)≤…≤μN(φ),
for every convex function φ:R+d→R.**
In the following examples, we collect some common option payoffs satisfying the assumptions of Theorem 3.1.
Example 9.5**.**
The typical
examples of S∗-continuous functions are
the payoffs of Asian type options.
Indeed, let g:[0,T]→R
be continuous.
Then,
[TABLE]
for any i∈{1,…,d}, is S∗-continuous.
However, the running maximum and minimum of
Xi are only lower and upper semicontinuous, respectively; see [39].
We refer the reader to [39], [46]
for further examples.*
∎*
In particular, the duality (3.2) holds for every derivative contract that is a measurable function of the
underlying assets.
Example 9.6**.**
Since Ω is a measurable subset of D([0,T];R+d), we know from [44]
that there exists an F-progressively measurable d×d-matrix-valued process
⟨X⟩=(⟨X⟩t)t∈[0,T] on Ω which equals the predictable quadratic
variation of XQ-a.s., for every F-martingale measure Q on Ω. We define the
d×d-matrix-valued volatility process σ=(σt)t∈[0,T] as the
square-root of the non-negative, symmetric matrix-valued process
[TABLE]
In particular, σ is a measurable process Ω. So Theorem 3.1 yields model-independent
price bounds for derivative contracts written on σ. However, the construction of the quadratic variation process
⟨X⟩ relies on stopping times and therefore, on F-progressively measurable partitions of the
interval [0,T], which in general are non-deterministic; we refer to [11] for details.
In particular, derivative contracts depending on σ are in general not upper semicontinuous on Ω.**
As a consequence of Theorem
3.1, we obtain a
fundamental theorem of asset pricing relating the non-emptiness of
Q(G) to an appropriate no-arbitrage condition. For classical versions of this result
see e.g. [21] for discrete time,
[22, 23] for continuous time and the references therein.
Robust versions have been derived in
[1, 19, 22, 26]. Our no-arbitrage conditions are
the following.
Corollary 9.7**.**
**Robust Fundamental Theorem of Asset Pricing.
**Under Assumption 2.2, the following are equivalent:
(i)
Q(G)* is non-empty.*
(ii)
Φ(η;I(G))* is finite for all η∈Bp(Ω).*
(iii)
Φ(0;I(G))=0.
Appendix A Appendix: S and S∗-topologies
The following definition is from Jakubowski [39, 40].
Definition A.1**.**
For {νn}n∈N⊂D([0,T];R+d) and ν∗∈D([0,T];R+d),
we write νn⇀Sν∗ if for each ε>0, there exist functions
{νn,ε}n∈N and ν∗,ε in
D([0,T];R+d) which are of* finite variation *such that
[TABLE]
and
[TABLE]
for all f∈Cb([0,T];Rd), where the integrals in (A.1) are Stieltjies integrals
with ν0−n,ε=ν0−∗,ε=0.
The topology
generated by this sequential convergence is
called the* S-topology.*
In particular, a subset C⊂D([0,T];R+d) is
S-closed if and only if it is
sequentially closed for the above notion
of convergence, i.e.,
if {νn}n∈N⊂C
and νn⇀Sν∗,
then ν∗∈C. Open sets are the complements
of the closed ones. One may directly verify that this collection of sets
satisfies the definition of a topology.
Remark A.2**.**
The (a posteriori)
convergence in this topology could be different from
the a priori convergence
⇀S defined above. This
definition of a topology is known as
the Kantorovich–Kisyński recipe; see [47]
or [30, Sections 1.7.18, 1.7.19 on pages 63-64].
In particular, it is discussed in
[40, Appendix] that {νn}n∈N
converges to ν∗ in the (a posteriori)
S-topology,
if every subsequence
{νnk}k∈N has a further subsequence
{νnkl}l∈N such that
νnkl⇀Sν∗.
As a different example, if one starts with almost-sure convergence as the a priori
convergence (instead of the ⇀S
convergence as above), then the resulting a posteriori convergence
is the convergence-in-probability; see [40]. **
The following fact from [39, 40]
is an essential ingredient of our continuity proof.
Recall the up-crossings Uta,b,i of Definition 6.2.
A subset K⊂D([0,T];R+d) is relatively S-compact if and only if
[TABLE]
Let us denote the relative topology of S on Ω again by S. It is not known whether
(Ω,S) is completely regular. As this property plays an important role in our analysis,
we regularize S on Ω analogously to [46].
Definition A.4**.**
The* S∗-topology on Ω is the coarsest topology making all S-continuous
functions ξ:Ω→R continuous.*
It is clear from this definition that S∗⊂S, and a function
ξ:Ω→R is S∗-continuous if and only if it is S-continuous.
Moreover, (Ω,S) and (Ω,S∗) are both Hausdorff, and since
compact sets stay compact if the topology is weakened, every
S-compact subset of Ω is also S∗-compact.
The collection of finite intersections of sets of the form
[TABLE]
with arbitrary S-continuous functions ξ:Ω→R, form a neighborhood basis
at ω∗. In particular, for any S∗-open set O
and ω∗∈O, there is a neighborhood of ω∗ of the form
[TABLE]
contained in O, where each ξk is an S-continuous function from Ω to R.
For each k≤n, set ηk(ω)=∣ξk(ω)−ξk(ω∗)∣∧1 and η(ω)=maxk≤nηk(ω). Then, η continuously maps Ω into [0,1]
and satisfies η(ω∗)=0 and η(ω)=1
for all ω∈O. This is the defining property of a completely regular space.
Hence, (Ω,S∗) is a completely regular Hausdorff space, (T321). In fact,
it turns out to be perfectly normal.
Lemma A.5**.**
(Ω,S∗)* is perfectly normal Hausdorff (T6) and a Lusin space.
In particular, every Borel probability measure on (Ω,S∗) is a Radon measure.*
Proof.
It is well-known that the standard J1-topology on the Skorokhod space
is Polish. Moreover, by [39, Theorem 2.13 (vi)], S⊂J1.
So, since Ω is S-closed it is also J1-closed. Therefore, if we
denote the relative J1-topology on Ω again by J1,
(Ω,J1) is still Polish and S∗⊂J1. As a consequence,
the identity map from (Ω,J1) to (Ω,S∗) is bijective and continuous, which
shows that (Ω,S∗) is a Lusin space.
[31, Proposition I.6.1, page 19] proves that any completely regular Lusin space is
perfectly normal.
We note that [31] uses the terminology “Espaces standards”
[31, Definition I.2.1, page 7] which is exactly
a Lusin space and the term “régulier” as defined on page 18 in [31]
corresponds to completely regular.
The reader may also consult page 64 of [28] for
a brief discussion of this implication.
Finally, on a Lusin space, every Borel probability measure is Radon;
see e.g., [53, p. 122].
∎
We also need the following facts about the S∗-topology.
Lemma A.6**.**
Every S∗-upper semicontinuous function from Ω to
R is the pointwise limit of a decreasing sequence
of S∗-continuous functions, and the family of Suslin functions generated by
Ub(Ω) includes Bb(Ω).
Proof.
The statement about approximation of upper
semicontinuous functions by continuous ones
is proved in [56, Theorem 3]. Also, see
[24, Theorem 49 (c)] or [30, Page 61].
The statement about Suslin functions is proved in
[4] (see the end of the proof of Theorem 2.2).
Alternatively, by Proposition 421L in [32, page 143]
on any topological space, every Baire set is a Suslin set.
On perfectly normal Hausdorff spaces, Baire and Borel sets agree
[12, Proposition 6.3.4]. Hence, bounded Borel functions
with respect to S∗ are Suslin.
∎
Remark A.7**.**
[46] contains more results about the S∗-topology on D([0,T];Rd).
In particular, the compact sets of S∗ and S agree.
Also,
the S∗-topology is the strongest topology on the Skorokhod space
for which the compactness criteria (A.2) holds
and the Riesz representation theorem with the β0-topology is true.
**
Appendix B Appendix: β0-topology
Let E be a completely regular Hausdorff space
and recall that B0(E) is the set of real-valued, bounded, Borel measurable
functions on E that vanish at infinity. Note that any perfectly
normal topology, such as S∗ on Ω, is completely regular.
For each η∈B0+(E) consider the semi-norm on Cb(E) given by,
[TABLE]
The β0-topology on Cb(E) is generated by the semi-norms ∥.∥η
as η varies in B0+(E).
Importantly, the topological dual of Cb(E)
with the β0-topology is the set of all signed Radon measures of bounded total
variation on E; see e.g., [41, Theorem 3, page 141] or [54] for further
details on the β0-topology.
Appendix C Appendix: Martingale Measures
Lemma C.1**.**
Let Q∈P(Ω) such that supt∈[0,T]EQ[∣Xt∣q]<∞ for some q>1 and
EQ[Y⋅(XT−Xt)]=0 for every t∈[0,T] and all Ft-measurable
Y∈Cb(Ω)d. Then, the canonical map X is an (F,Q)-martingale.
Proof.
Fix t<T, and denote by A the family of all subsets of Ω that can be written
as a finite intersection of sets of the form Xtj−1(Bj) for tj≤t
and a Borel subset Bj of Rd. Let i∈{1,…,d}. If we can show that
[TABLE]
it follows from a monotone class argument that
[TABLE]
By uniform integrability and right-continuity of X, this implies
[TABLE]
which proves the lemma.
To show (C.1), note that for every set A∈A of the form
[TABLE]
for t1,…,tk≤t and
Borel subsets B1,…,Bk of Rd, there exist bounded
continuous functions fjn:Rd→R such that
[TABLE]
On the other hand, for all n, one has
[TABLE]
for the S-continuous functions
[TABLE]
Since f1n(Xt1ε)⋯fkn(Xtkε) is Ft+ε-measurable
and belongs to Cb(Ω), it follows from the assumptions that (C.2)–(C.3) vanish,
and the proof is complete.
∎
Bibliography60
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] B. Acciaio, M. Beiglböck, F. Penkner, and W. Schachermayer. A model-free version of the fundamental theorem of asset pricing and the super-replication theorem. Mathematical Finance , 26(2):233–251, 2016.
2[2] B. Acciaio, M. Beiglböck, F. Penkner, W. Schachermayer, and J. Temme. A trajectorial interpretation of Doob’s martingale inequalities. The Annals of Applied Probability , 23(4):1494–1505, 2013.
3[3] L. Ambrosio and N. Gigli. A User’s Guide to Optimal Transport . Springer, 2013.
4[4] D. Bartl, P. Cheridito, and M. Kupper. Robust expected utility maximization with medial limits. Journal of Mathematical Analysis and Applications , 471(1-2):752–775, 2019.
5[5] D. Bartl, M. Kupper, and A. Neufeld. Pathwise superhedging on prediction sets. Ar Xiv:1711.02764 , 2017.
6[6] D. Bartl, M. Kupper, D. J. Prömel, and L. Tangpi. Duality for pathwise superhedging in continuous time. Finance and Stochastics , 23(3):697–728, 2019.
7[7] M. Beiglböck, A. M. G. Cox, M. Huesmann, N. Perkowski, and D. J. Prömel. Pathwise superreplication via Vovk’s outer measure. Finance and Stochastics , 21(4):1141–1166, 2017.
8[8] M. Beiglböck, P. Henry-Labordère, and F. Penkner. Model-independent bounds for option prices – a mass transport approach. Finance and Stochastics , 17(3):477–501, 2013.