This paper introduces a new characterization of quasi-sure no-arbitrage in discrete-time models with multiple priors, unifying various existing notions and facilitating key results in mathematical finance.
Contribution
It provides a novel equivalence for quasi-sure no-arbitrage, connecting it with other conditions and illustrating with explicit examples.
Findings
01
New characterization of quasi-sure no-arbitrage
02
Equivalence with existing no-arbitrage notions
03
Illustrative examples demonstrating concepts
Abstract
In a discrete time and multiple-priors setting, we propose a new characterisation of the condition of quasi-sure no-arbitrage which has become a standard assumption. This characterisation shows that it is indeed a well-chosen condition being equivalent to several previously used alternative notions of no-arbitrage and allowing the proof of important results in mathematical finance. We also revisit the so-called geometric and quantitative no-arbitrage conditions and explicit two important examples where all these concepts are illustrated.
\displaystyle\mathcal{R}^{T}:=\{P\in\mathfrak{P}(\Omega^{T}),\;\exists\,Q^{{}^{\prime}}\in\mathcal{Q}^{T},P\ll Q^{{}^{\prime}}\;\mbox{and $P$ is a martingale measure}\}.
\displaystyle\mathcal{R}^{T}:=\{P\in\mathfrak{P}(\Omega^{T}),\;\exists\,Q^{{}^{\prime}}\in\mathcal{Q}^{T},P\ll Q^{{}^{\prime}}\;\mbox{and $P$ is a martingale measure}\}.
P1:={λP1∗+(1−λ)P,0<λ≤1,P∈Q1},
P1:={λP1∗+(1−λ)P,0<λ≤1,P∈Q1},
\displaystyle\begin{split}\mathcal{P}^{t+1}&:=\Bigl{\{}P\otimes\left(\lambda p^{*}_{t+1}+(1-\lambda)q_{t+1}\right),\;0<\lambda\leq 1,\\
&\quad\quad\quad\quad\quad P\in\mathcal{P}^{t},\;q_{t+1}(\cdot,\omega^{t})\in\mathcal{Q}_{t+1}(\omega^{t})\;\mbox{for all $\omega^{t}\in\Omega^{t}$}\Bigr{\}}.\end{split}
\displaystyle{\mathcal{K}}^{T}:=\{P\in\mathfrak{P}(\Omega^{T}),\;\exists\,Q^{{}^{\prime}}\in\mathcal{P}^{T},P\sim Q^{{}^{\prime}}\;\mbox{and $P$ is a martingale measure}\}.
\displaystyle{\mathcal{K}}^{T}:=\{P\in\mathfrak{P}(\Omega^{T}),\;\exists\,Q^{{}^{\prime}}\in\mathcal{P}^{T},P\sim Q^{{}^{\prime}}\;\mbox{and $P$ is a martingale measure}\}.
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.
Full text
No-arbitrage with multiple-priors in discrete time
Léonard de Vinci Pôle Universitaire, Research Center,
92916 Paris La Défense, France and
LMR, FRE 2011 Université Reims Champagne-Ardenne.
Abstract
In a discrete time and multiple-priors setting, we propose a new characterisation of the condition of quasi-sure no-arbitrage which has become a standard assumption. This characterisation shows that it is indeed a well-chosen condition being equivalent to several previously used alternative notions of no-arbitrage and allowing the proof of
important results in mathematical finance.
We also revisit the so-called geometric and quantitative no-arbitrage conditions and explicit two important examples where all these concepts are illustrated.
Key words: No-arbitrage, Knightian uncertainty; multiple-priors; non-dominated model
The concept of no-arbitrage is fundamental in the modern theory of mathematical finance. Roughly speaking, it means that one cannot hope to make a profit without taking some risk. In a classical uni-prior setting,
the Fundamental Theorem of Asset Pricing (FTAP in short) makes the link between an appropriate notion of no-arbitrage and the existence of equivalent risk-neutral probability measures.
This result is essential for pricing issues, namely for the superreplication price which is for a given claim the minimum selling price needed to superreplicate it by trading in the market.
The FTAP was initially formalised in [Harrison and Kreps, 1979], [Harrison and Pliska, 1981] and [Kreps, 1981] while [Dalang et al., 1990] established it in a general discrete-time setting and [Delbaen and Schachermayer, 1994] in continuous time models. The literature on the subject is huge and we refer to [Delbaen and Schachermayer, 2006] for a general overview.
However, the reliance on a single probability measure has long been questioned in the economic literature and is often referred to as Knightian uncertainty, in reference to [Knight, 1921]. In a financial context, it is called model-risk and also has a long history. The financial crisis together with the evolution of the structure and behaviour of financial markets, have made these issues even more acute for both academics and practitioners. In particular, this has motivated further research to find good notions of no-arbitrage allowing to extend the FTAP and the superreplication price characterisation
while accounting for model uncertainty. A typical example of such endeavor, directly motivated by concrete situations, is to find no-arbitrage prices for some exotic derivative products (such as barrier options, lookback options, double digit options,…) using as input the prices of actively traded european options, without making any assumptions on the dynamic of the underlying. This is the so-called model-independent approach, pioneered in [Hobson, 1998]. We refer to [Hobson, 2011] for a detailed presentation including the related Skorokhod embedding problem. Importantly, [Davis and Hobson, 2007] have shown that the expected dichotomy between the existence of a suitable martingale measure and the existence of a model-independent arbitrage might not hold. [Acciaio et al., 2013] have also established a FTAP in a model-independent framework
under a fairly weak notion of no-arbitrage111An arbitrage is a strategy with a strictly positive terminal payoff in all states of the world., but assuming the existence of a traded option with a super-linearly growing payoff-function.
An alternative way of modeling uncertainty is to replace the single probability measure of the classical setting with a set of priors representing all the possible models: This is the so-called quasi-sure or multiple-priors approach. As the set can vary between a singleton and all the probability measures on a given space, this formulation encompasses a wide range of settings, including the classical one. As the set of priors is not assumed to be dominated, this has raised challenging mathematical questions and has lead to the development of innovative tools such as quasi-sure stochastic analysis, non-linear expectations and G-Brownian motions. On these topics, we refer among others to [Peng, 2008, 2011], [Denis and Martini, 2006], [Denis et al., 2011], [Nutz and van Handel, 2013], [Soner et al., 2011a] and [Soner et al., 2011b].
Following this approach, [Bouchard and Nutz, 2015] have introduced in a discrete-time setting with time horizon T, a no-arbitrage condition called the NA(QT) condition (where QT represents all the possible models). It states that if the terminal value of a trading strategy is non-negative QT-quasi-surely, then it always equals [math] QT-quasi-surely (see Definition 3.1). This is a natural extension of the classical uni-prior where almost sure equality and inequality are replaced with their quasi-sure pendant. [Bouchard and Nutz, 2015] established a generalisation of the FTAP together with a Superhedging Theorem. This framework has also been used to study a large range of related problems (FTAP with transaction cost, american options, worst-case optimal investment, …) and we refer among others to [Bouchard and Nutz., 2016], [Bayraktar et al., 2015], [Blanchard and Carassus, 2018] and [Bartl, 2019b].
Finally, the so-called pathwise approach is an other fruitful modeling approach: In this setting, uncertainty is introduced by describing a subset of relevant events or scenarii without references to any probability measure and without specifying their relative weight. In a discrete-time setting, [Burzoni et al., 2016c], [Burzoni et al., 2016a] introduce a set of scenarii S representing the agent beliefs and an Arbitrage de la Classe S is a trading strategy leading to a terminal value that is always non-negative for all the events in S and positive for a least one event in S. A corresponding FTAP is then obtained. Note that by choosing different sets S, different definitions of no-arbitrage can be considered and in particular the model independent approach previously mentioned can be recovered by choosing the whole space for S. Importantly, [Oblój and Wiesel, 2018] have recently unified the quasi-sure and the pathwise approaches showing that under technical assumptions both approaches are actually equivalent (see Metatheorem 1.1, see also Remark 3.34).
In this paper we follow the multiple-priors approach of [Bouchard and Nutz, 2015]. Despite its success, one might still wonder if the NA(QT) condition is the “right” one. Indeed, at first sight at least, under this condition it is not even clear if there exists a model P∈QT
satisfying the uni-prior no-arbitrage condition NA(P). Theorem 3.30 will prove that this is in fact possible. But as Lemmata 3.7 and 4.5 show, QT might still contain some models that are not arbitrage free.
This means that an agent may not be able to delta-hedge a simple vanilla option using different levels of volatility in a arbitrage free way.
So instead of NA(QT) one may assume that every model is arbitrage free i.e. that the NA(P) condition holds true for every model P∈QT. We call this sNA(QT) for strong no-arbitrage, see Definition 3.3. This alternative condition has appeared
in recent results on robust utility maximisation of unbounded functions, see for instance [Blanchard and Carassus, 2018] and [Rásonyi and Meireles-Rodrigues, 2018].
Our main result provides a characterisation of the NA(QT) condition that gives some kind of definitive answer to these questions and confirms that the NA(QT) condition is indeed the “right” condition in the quasi-sure setting. More precisely, Theorem 3.8 shows that the NA(QT) condition is equivalent to the existence of
a subclass of priors PT⊂QT such that PT and QT have the same polar sets (roughly speaking the same relevant events)
and such that the sNA(PT) hold true.
In addition to enable a better economic comprehension of NA(QT),
Theorem 3.8 also provides several interesting results.
First, it allows for a short proof of
a refinement of the FTAP of [Bouchard and Nutz, 2015] using the classical
Dalang-Morton-Willinger Theorem (see Corollary 3.12 and
[Bayraktar and Zhou, 2017, Theorem 2.1]).
Then, Theorem 3.8 provides tractable theorems for the existence of solutions in the problem of robust utility
maximisation. Indeed it allows to prove the equivalence between NA(QT) and two other conditions previously used in the litterature for solving this problem.
The first one is the no-arbitrage condition introduced in Bartl et al. [2019] which states that for every prior Q∈QT there exist a prior P∈QT such that Q≪P and NA(P) holds true (see Corollary 3.11).
The second one is the condition used by [Rásonyi and Meireles-Rodrigues, 2018] which requires the
existence of a model P∗∈QT satisfying NA(P∗) and such that for this model the affine space generated by the conditional support always equals Rd (see Theorem 3.30, Remark 3.35 and also [Bayraktar and Zhou, 2017] in a one period setup).
Finally, Theorem 3.8 allows to show that one may replace the set QT by the set PT in the problem of maximisation of robust expected utility without changing the value function (see Lemma 3.14 and Corollary 3.17).
We then introduce local characterisations of the NA(QT) condition called
the geometric and the quantitative conditions (see Definition 3.19, 3.20 and Theorem 3.24). The geometric condition goes back in the uni-prior setup to [Jacod and Shiryaev, 1998, Theorem 3 g)] and provides some geometric intuition. Theorem 3.24 generalises the preceding result to the quasi-sure setting. The geometric condition is an important tool in the multiple-priors literature. It has been used in different setups by [Oblój and Wiesel, 2018] and by [Burzoni et al., 2016b]. It is also efficient to prove concretely that the NA(QT) condition holds true.
The quantitative no-arbitrage goes back to [Rásonyi and Stettner, 2005, Proposition 3.3] and is used to solve optimisation problems using the dynamic programming principle. For example, it provides explicit bounds on the optimal strategies in the problem of maximisation of expected utility, see Remark 3.22.
Again Theorem 3.24 generalises [Rásonyi and Stettner, 2005, Proposition 3.3] to the quasi-sure setting. Together with Propositions 3.28 and 3.37, this fills a gap opened in [Blanchard and Carassus, 2018, Proposition 2.3], proving difficult measurability results and opening the possibility to solve, in the setting of [Bouchard and Nutz, 2015], the problem of multi-prior optimal investment for unbounded utility function defined on the whole real-line (see Remark 3.29).
Finally, Proposition 3.39 explicits the relation between the different notions of no-arbitrage in the dominated case
while Proposition 4.1 is used to build examples of sets of probability measures QT which are not dominated.
The proofs follow the same idea: We first study a one-period problem with deterministic initial data where we rely on separation theorem and elementary geometric consideration in finite dimension. Then we extend the results to the multi-period setting relying on advanced measurable selections arguments. The proof of Proposition 4.1 relies also on relatively recent topological results.
Finally, these theoretical results are complemented by two concrete and useful examples. The first one proposes a multiple-priors binomial model and the second one a generic way of introducing uncertainty for the discretised dynamics of a diffusion process. In both cases, we show that the NA(QT) conditions holds true and provide explicit expressions for the parameters introduced in the geometric and quantitative versions of the NA(QT) condition and for the set PT.
The paper is structured as follows: Section 2 presents the framework and notations needed in the paper. Different definitions of conditional support which are at the heart of our study are introduced and important measurability results established. Section 3 contains the different definitions of no-arbitrage together with our main result. In Section 4 we propose two detailed examples illustrating the previous results and also how to build set of probability measures which are not dominated.
Finally, Section 5 collects the missing proofs.
2 The Model
This section presents our multiple-priors framework and gives introductory definitions.
2.1 Uncertainty modeling
The construction of the global probability space is based on a product of the local (between time t and t+1) ones using measurable selection under Assumption 2.2 below. This is tailor made for the dynamic programming approach.
We fix a time horizon T∈N and introduce a sequence (Ωt)1≤t≤T of Polish spaces. Each Ωt+1 contains all possible scenarii between time t and t+1. For some 1≤t≤T, we set Ωt:=Ω1×⋯×Ωt (with the convention that Ω0 is reduced to a singleton), B(Ωt) its Borel sigma-algebra and P(Ωt) the set of all probability measures on (Ωt,B(Ωt)). An element of Ωt will be denoted by ωt=(ω1,…,ωt)=(ωt−1,ωt) for (ω1,…,ωt)∈Ω1×⋯×Ωt.
We also introduce the universal sigma-algebra Bc(Ωt) which is the intersection of all possible completions of B(Ωt).
Let S:={St,0≤t≤T} be a
Rd-valued process
where for all 0≤t≤T, St=(Sti)1≤i≤d represents the price of d risky securities at time t. We assume that there is a riskless asset whose price is constant and equals 1. We also make the following assumptions already stated in [Bouchard and Nutz, 2015] to which we refer for further details and motivations on the framework.
Assumption 2.1**.**
The process S is (B(Ωt))0≤t≤T-adapted.
Trading
strategies are represented by (Bc(Ωt−1))1≤t≤T-measurable and d-dimensional processes ϕ:={ϕt,1≤t≤T} where for all 1≤t≤T, ϕt=(ϕti)1≤i≤d represents the
investor’s holdings in each of the d assets at time t.
The set of all such trading
strategies is denoted by Φ.
The notation ΔSt:=St−St−1 will often be used.
If x,y∈Rd then
the concatenation xy stands for their scalar product. The symbol ∣⋅∣ denotes the Euclidean norm
on Rd (or on R). Trading is assumed to be self-financing and the value at time t of a portfolio ϕ starting from
initial capital x∈R is given by
[TABLE]
We construct the set QT of all possible priors in the market. For all 0≤t≤T−1, let Qt+1:Ωt↠P(Ωt+1)222The notation ↠ stands for set-valued mapping. where Qt+1(ωt) can be seen as the set of all possible priors for the t-th period given the state ωt until time t.
Assumption 2.2**.**
For all 0≤t≤T−1, Qt+1 is a non-empty and convex valued random set such that
[TABLE]
is an analytic set.
Let X be a Polish space.
An analytic set of X is the continuous image of some Polish space, see [Aliprantis and Border, 2006, Theorem 12.24 p447]. We denote by A(X) the set of analytic sets of X and recall some key properties that will often be used without further reference in the rest of the paper. The projection of an analytic set is an analytic set see ([Bertsekas and Shreve, 2004, Proposition 7.39 p165]), a countable union or intersection of analytic sets is an analytic set (see [Bertsekas and Shreve, 2004, Corollary 7.35.2 p160]), the Cartesian product of analytic sets is an analytic set (see [Bertsekas and Shreve, 2004, Proposition 7.38 p165]), the image or pre-image of an analytic set is an analytic set (see [Bertsekas and Shreve, 2004, Proposition 7.40 p165]) and (see [Bertsekas and Shreve, 2004, Proposition 7.36 p161, Corollary 7.42.1 p169])
[TABLE]
However the complement of an analytic set does not need to be an analytic set.
We will also use without further references a particular case of the Projection Theorem (see [Castaing and Valadier, 1977, Theorem 3.23 p75]) and of the Auman’s Theorem (see [Sainte-Beuve, 1974, Corollary 1]) which we recall for sake of completeness.
Let (X,T) be a measurable space and Y be some Polish space.
If G∈T⊗B(Y), then the projection of G on X\mboxProjX(G) belongs to Tc(X), the completion of T with respect to any probability measures on (X,T). Let Γ:X↠Y be such that \mboxgraph(Γ)∈T⊗B(Y). Then there exist a Tc(X)−B(Y) measurable selector σ:X→Y such that σ(x)∈Γ(x) for all x∈{Γ=∅}.
From the Jankov-von Neumann Theorem (see [Bertsekas and Shreve, 2004, Proposition 7.49 p182]) and Assumption 2.2, there exists some Bc(Ωt)-measurable qt+1:Ωt→P(Ωt+1) such that for all ωt∈Ωt, qt+1(⋅,ωt)∈Qt+1(ωt) (recall that for all ωt∈Ωt, Qt+1(ωt)=∅). For all 1≤t≤T let Qt⊂P(Ωt) be defined by
[TABLE]
where Qt:=Q1⊗q2⊗⋯⊗qt denotes the t-fold application of Fubini’s Theorem (see [Bertsekas and Shreve, 2004, Proposition 7.45 p175]) which defines a measure on P(Ωt) and SKt+1 is the set of universally-measurable stochastic kernel on Ωt+1 given Ωt (see [Bertsekas and Shreve, 2004, Definition 7.12 p134, Lemma 7.28 p174]).
Apart from Assumption 2.2, no specific assumptions on the set of priors are made: QT is neither assumed to be dominated by a given probability measure nor to be weakly compact.
This setting allows for various general definitions of the sets QT. Section 4 presents some concrete examples of non-dominated settings. We refer also to [Bartl, 2019a] for other examples.
2.2 Multiple-priors conditional supports
The following definitions are at the heart of our study.
Definition 2.3**.**
Let P∈P(ΩT) with the fixed disintegration P:=Q1⊗q2⊗⋯⊗qT where qt∈SKt for all 1≤t≤T.
For all 0≤t≤T−1, the random sets Et+1:Ωt×P(Ωt+1)↠Rd, Dt+1,DPt+1:Ωt↠Rd are defined for ωt∈Ωt, p∈P(Ωt+1) by
[TABLE]
Remark 2.4*.*
As Rd is second countable,
p(ΔSt+1(ωt,⋅)∈Et+1(ωt,p))=1, see [Aliprantis and Border, 2006, Theorem 12.14] and p(ΔSt+1(ωt,⋅)∈Dt+1(ωt))=1 for all p∈Qt+1(ωt), see [Bouchard and Nutz, 2015, Lemma 4.2].
Remark 2.5*.*
It is easy to verify that for all ωt∈Ωt, p∈Qt+1(ωt)
[TABLE]
Recall that any probability P∈P(ΩT) can be decomposed using Borel-measurable stochastic kernel, see for instance [Bertsekas and Shreve, 2004, Corollary 7.27.2 p139].
Then for some fixed disintegration of P∈QT, P:=Q1⊗q2⊗⋯⊗qT, all 0≤t≤T−1 and all ωt∈Ωt
The following lemma
establishes some important measurability properties of the random sets previously introduced and uses the following notations. For some R⊂Rd, let
[TABLE]
Recall that \mboxConv(R)={∑i=1nλipi,n≥1,pi∈R,∑i=1nλi=1,λi≥0} see [Rockafellar, 1970, Theorem 2.3 p12] and that \mboxConv(R)=\mboxConv(R).
For a random set R:Ω↠Rd,
\mboxConv(R) and \mboxAff(R) are the random sets defined for all ω∈Ω by
\mboxConv(R)(ω):=\mboxConv(R(ω))\mboxand\mboxAff(R)(ω):=\mboxAff(R(ω)).
Lemma 2.6**.**
Let Assumptions 2.1 and 2.2 hold true and let 0≤t≤T−1 be fixed.
Let P∈QT with a fixed disintegration P:=Q1⊗q2⊗⋯⊗qT.
•
The random sets Et+1, \mboxConv(Et+1), \mboxAff(Et+1) are non-empty, closed valued and B(Ωt)⊗B(P(Ωt+1))-measurable333See [Rockafellar and Wets, 1998, Definition 14.1]. with graphs in B(Ωt)⊗B(P(Ωt+1))⊗B(Rd).
•
The random sets Dt+1,
DPt+1, \mboxConv(Dt+1),
\mboxConv(DPt+1), \mboxAff(Dt+1)
and \mboxAff(DPt+1) are non-empty, closed valued
and Bc(Ωt)-measurable. Furthermore their graphs
belong to Bc(Ωt)⊗B(Rd).
Proof.
The measurability of Dt+1 follows from [Blanchard and Carassus, 2018, Lemma 2.2]. Fix some open set O⊂Rd. Assumption 2.1 and [Bertsekas and Shreve, 2004, Proposition 7.29 p144] imply that (ωt,p)→p(ΔSt+1(ωt,.)∈O) is B(Ωt)⊗B(P(Ωt+1))-measurable. The measurability of Et+1 and DPt+1 follows from
[TABLE]
where we have used Assumption 2.2 and the Projection Theorem as (ωt,q)→qt+1(⋅,ωt)−q is Bc(Ωt)⊗P(Ωt+1)-measurable.
Then, [Rockafellar and Wets, 1998, Proposition 14.2, Exercise 14.12] implies that \mboxConv(Et+1), \mboxAff(Et+1) are B(Ωt)⊗B(P(Ωt+1))-measurable and
that \mboxConv(Dt+1),
\mboxConv(DPt+1), \mboxAff(Dt+1)
and \mboxAff(DPt+1) are Bc(Ωt)-measurable.
Finally, [Rockafellar and Wets, 1998, Theorem 14.8] implies that the graphs of Et+1, \mboxConv(Et+1) and \mboxAff(Et+1) belong to B(Ωt)⊗B(P(Ωt+1))⊗B(Rd) while the graphs of Dt+1, DPt+1, \mboxConv(Dt+1),
\mboxConv(DPt+1), \mboxAff(Dt+1),
and \mboxAff(DPt+1)
belong to Bc(Ωt)⊗B(Rd).
3 No-arbitrage characterisations
3.1 Global no-arbitrage condition
and main result
In the uni-prior case, for any P∈PT, the no-arbitrage NA(P) condition holds true if VT0,ϕ≥0P-a.s. for some ϕ∈Φ implies that VT0,ϕ=0P-a.s. In the multiple-priors setting,
the no-arbitrage condition NA(QT), also referred as quasi-sure no-arbitrage, was introduced in [Bouchard and Nutz, 2015]. Our main message will be that it is indeed a good assumption. Besides being a natural extension of the classical uni-prior arbitrage condition, we will show that it is equivalent to several conditions previously used in the literature.
Definition 3.1**.**
The NA(QT) condition holds true if
V_{T}^{0,\phi}\geq 0\;\mathcal{Q}^{T}\mbox{-q.s. for some \phi\in\Phi} implies that VT0,ϕ=0QT\mbox−q.s.
Recall that for a given P⊂P(ΩT),
a set N⊂ΩT is called a P-polar if for all P∈P, there exists some AP∈Bc(ΩT) such that P(AP)=0 and N⊂AP. A property holds true P-quasi-surely (q.s.), if it is true outside a P-polar set. Finally a set is of P-full measure if its complement is a P-polar set.
[Bouchard and Nutz, 2015] proves that
Definition 3.1 allows a FTAP generalisation. The NA(QT) is equivalent to the following: For all Q∈QT, there exists some P∈RT such that Q≪P where
[TABLE]
The next result is straightforward.
Lemma 3.2**.**
Let P and M be two sets of probability measures on P(ΩT) such that P and M have the same polar sets. Then the NA(P) and the NA(M) conditions are equivalent.
Nevertheless, it is not true that under the NA(QT) condition, the NA(P) condition holds true for all P∈QT, see Lemma 3.7 below.
This condition is called the “strong no-arbitrage” or sNA(QT).
Definition 3.3**.**
The sNA(QT) condition holds true if the NA(P) holds true for all P∈QT.
Remark 3.4*.*
The sNA(QT) is a strong condition. But it is related to practical situations in finance: If it does not hold true, there exists a model P∈QT and a strategy ϕ∈Φ such that VT0,ϕ≥0P\mbox−a.s. and P(VT0,ϕ>0)>0 and an agent having sold some derivative product may not be able to use different arbitrage free models to manage the resulting position (think for instance of different volatility level to delta-hedge a simple vanilla option).
The sNA(QT) condition is also useful to obtain tractable theorems on multiple-priors expected utility maximisation for unbounded function, see [Blanchard and Carassus, 2018, Theorem 3.6] and [Rásonyi and Meireles-Rodrigues, 2018, Theorem 3.9].
Finally, this definition seems also relevant in a continuous time setting for studying the no-arbitrage characterisation, see [Biagini et al., 2015, Definition 2.1, Theorem 3.4].
In the spirit of the model-dependent arbitrage introduced in [Davis and Hobson, 2007] (see also Remark 3.35) we introduce the notion of “weak no-arbitrage”.
Definition 3.5**.**
The wNA(QT) condition holds true if there exists some P∈QT such that the NA(P) holds true.
Remark 3.6*.*
The contraposition of the wNA(QT) condition is that for all models P∈QT, there exists a strategy ϕP such that VT0,ϕP≥0P\mbox−a.s. and P(VT0,ϕP>0)>0. A concrete example of a such model-dependent arbitrage is given in [Davis and Hobson, 2007].
We illustrate now the obvious relations between the three no-arbitrage conditions introduced
(see also Figure 2). The more subtle one will be addressed in Theorems 3.8 and 3.30. This last theorem shows that the NA(QT) condition implies the wNA(QT) one.
Lemma 3.7**.**
Assume that QT={P} for some P∈P(ΩT). Then the NA(QT),sNA(QT),wNA(QT) and NA(P) conditions are equivalent.
2. 2.
Assume that there exists a dominating probability measure P∈QT. Then the NA(QT) and NA(P) conditions are equivalent.
3. 3.
The sNA(QT) condition implies the wNA(QT) but the converse does not hold true.
4. 4.
The sNA(QT) condition implies the NA(QT)
but the converse does not true.
5. 5.
The wNA(QT) condition does not imply the NA(QT) condition.
Proof.
The first item is clear. The second one follows from Lemma 3.2. The first part of item 3 is trivial and it easy to construct simple counter-example for the second part (see Example 3.36 below). We now prove item 4.
If the NA(QT) condition fails, there exists some ϕ∈Φ and P∈QT such that VT0,ϕ≥0QT\mbox−q.s. and P(VT0,ϕ>0)>0: The sNA(QT) condition also fails. Now consider a one-period model with one risky asset S0=0, S1:Ω→R (for some Polish space Ω). Let P1 such that P1(±ΔS1>0)>0 and P2 such that P2(ΔS1≥0)=1 and P2(ΔS1>0)>0 and set Q={λP1+(1−λ)P2,0<λ≤1}. Then NA(P2) fails while NA(Q) holds true. Note that Lemma 4.5 provides another counter-example. Finally for item 5, consider a one period model with two risky assets S01=S02=0 and S11,2:Ω→R. Let P1 be such that P1(ΔS11≥0)=1, P1(ΔS11>0)>0 and P2 such that P2(ΔS11=0)=1, P2(±ΔS12>0)>0 and set Q={λP1+(1−λ)P2,0<λ≤1}. Then the NA(P2) and thus the wNA(Q) conditions are clearly verified. But the NA(Q) condition does not hold true. Indeed, let h=(1,0).
Then hΔS1≥0Q-q.s. but P1(hΔS1>0)>0. Note that \mboxAff(D)=R2 and \mboxAff(DP2)={0}×R.
The following theorem is our main result.
Theorem 3.8**.**
Assume that Assumptions 2.1 and 2.2 hold true. The following conditions are equivalent.
•
The NA(QT) condition holds true.
•
There exists some PT⊂QT such that PT and QT have the same polar-sets and such that the sNA(PT) condition holds true.
Let P∗ as in Theorem 3.30 below with the fix disintegration P∗:=P1∗⊗p2∗⊗⋯⊗pT∗. The set
PT is defined recursively as follows:
For all 1≤t≤T−1
[Burzoni et al., 2016b, Theorem 4] delivers a similar message but in a completely different setup which does not rely on a set of priors and under the no open-arbitrage assumption. The set PT is replaced by the set of probability measures with full support.
Remark 3.10*.*
In previous studies on robust pricing and hedging, it is often assumed that there exists some additional assets available only for static trading (buy and hold), see for instance [Bouchard and Nutz, 2015, Theorem 5.1]. This raises the mathematical difficulties as, roughly speaking, its breaks the dynamic consistency between time zero and future times and might prevent from obtaining a dynamic programming principle. A typical illustration of the issue arising is the so-called duality gap for American options, where the superhedging price for an American option may be strictly larger than the supremum of its expected (discounted) payoff over all stopping times and all (relevant) martingale measures (see for instance [Bayraktar et al., 2015], [Hobson and Neuberger, 2016], [Bayraktar and Zhou, 2017]).
In our setting all assets are dynamically traded and some of them may be derivatives products. Obviously the level of uncertainty regarding the behaviours of each assets might depend on its nature and this will be reflected in the set of prior QT. This follows the spirit of the original approach developed in [Hobson, 1998] where the prices of actively traded options is taken as input. Furthermore, from a pure practical point of view,
we think that additional financial assets which provide useful informations for pricing should be traded at least on a daily basis.
Hence, introducing trading constraints or transactions cost could be a better way to reflect the potential difference of liquidity between assets and derivatives. From a theoretical perspective, [Aksamit et al., 2018] shows that any setup as in [Bouchard and Nutz, 2015] can be lifted to a setup with dynamic trading in all assets in a way which does not introduce arbitrage (see [Aksamit et al., 2018, Lemma 3.1]).
The idea is to assume that the options are traded dynamically and to choose a set of priors QT which does not impose any assumptions about their dynamics other than these resulting from no arbitrage in the initial setup. An admissible pricing measure in the original setup can be used to define dynamic options prices via conditional expectations and can thus be lifted to a martingale measure in the extended setup.
We now propose three applications of Theorem 3.8 which show how usefull it is.
The first application establishes the equivalence between the NA(QT) condition and the no-arbitrage condition introduced by [Bartl et al., 2019] which studies the problem of robust maximisation of expected utility using medial limits.
Corollary 3.11**.**
Assume that Assumptions 2.1 and 2.2 hold true. The following conditions are equivalent
•
The NA(QT) condition holds true.
•
For all Q∈QT, there exists some P∈PT such that Q≪P and such that NA(P) holds true.
•
For all Q∈QT, there exists some P∈QT such that Q≪P and such that NA(P) holds true.
Proof.
Assume that the NA(QT) condition holds true and choose some Q∈QT with the fixed disintegration Q:=Q1⊗q2⊗⋯⊗qT. Let
[TABLE]
where P∗ is given in Theorem 3.30 with the fixed disintegration P∗:=P1∗⊗p2∗⊗⋯⊗pT∗.
Then (10) implies that P∈PT and obviously Q≪P. Now, Theorem 3.8 implies that the NA(P) condition holds true and the second assertion is proved. As PT⊂QT,
the second assertion implies the third one.
Assume now that the third assertion holds true and let ϕ∈Φ such that VT0,ϕ≥0QT-q.s. Fix some Q∈QT. Then there exists P∈QT such that Q≪P and such that NA(P) holds true. Thus VT0,ϕ=0P-a.s and also Q-a.s. As this is true for all Q∈QT, we get that VT0,ϕ=0QT-q.s.
The second application allows to prove the robust FTAP from the classical one. Our proof uses the one-period arguments of [Bayraktar and Zhou, 2017, Theorem 2.1] adapted to the multi-period setting.
Let
[TABLE]
Corollary 3.12**.**
Assume that Assumptions 2.1 and 2.2 hold true. The following conditions are equivalent
•
The NA(QT) condition holds true.
•
For all Q∈QT, there exists some P∈KT such that Q≪P.
•
For all Q∈QT, there exists some P∈RT (see (8)) such that Q≪P.
Note that this is a refinement of the version of [Bouchard and Nutz, 2015] as we have more information about the measure P.
Proof.
Assume that the NA(QT) condition holds true.
Corollary 3.11 implies that for all Q∈QT there exists some Q′∈PT such that Q≪Q′ and such that NA(Q′) holds true. Now the classical FTAP (see [Dalang et al., 1990]) establishes the existence of some P∼Q′ such that P is a martingale measure. Thus P∈KT.
As Q≪P, the second assertion holds true. As KT⊂RT, the second assertion implies the third one. Assume now that the third assumption holds true and
let ϕ∈Φ such that VT0,ϕ≥0QT-q.s. Fix some Q∈QT. Then there exists P∈P(ΩT) and Q′∈QT such that Q≪P, P≪Q′ and P is a martingale measure. As VT0,ϕ≥0Q′-a.s and thus P-a.s. and
EP(VT0,ϕ)=0, we get that
VT0,ϕ=0P-a.s and also Q-a.s. As this is true for all Q∈QT, we obtain that VT0,ϕ=0QT-q.s.
Lastly, Theorem 3.8 allows to obtain a tractable theorem on maximisation of expected utility under the NA(QT) condition avoiding the difficult [Blanchard and Carassus, 2018, Assumption 2.1]. Note that the no-arbitrage condition is indeed related to the utility maximisation problem in the uni-prior case (see for instance [Rogers, 1994]). In the robust case, it is not clear whether a similar approach could work. This is the subject of further research.
A random utility U is a function defined on ΩT×(0,∞) taking values in R∪{−∞} such that for every x∈R, U(⋅,x) is B(ΩT)-measurable and for every ωT∈ΩT, U(ωT,⋅) is proper444There exists x∈(0,+∞) such that U(ωT,x)>−∞ and U(ωT,x)<+∞ for all x∈(0,+∞).,
non-decreasing and concave on (0,+∞). We extend U by (right) continuity in [math] and set U(⋅,x)=−∞ if x<0.
Fix some x≥0.
For P∈P(ΩT) fixed, we denote by Φ(x,U,P) the set of all strategies ϕ∈Φ such that VTx,ϕ(⋅)≥0P-a.s. and such that either EPU+(⋅,VTx,ϕ(⋅))<∞ or EPU−(⋅,VTx,ϕ(⋅))<∞.
Then
Φ(x,U,QT):=⋂P∈QTΦ(x,U,P).
The set Φ(x,U,PT) is defined similarly changing QT by PT where PT is defined in (10).
The multiple-priors portfolio problem with initial wealth x≥0 is
[TABLE]
We also define
[TABLE]
Let for all 1≤t≤T
[TABLE]
Assumption 3.13**.**
We have that U+(⋅,1),U−(⋅,41)∈WT and ΔSt,1/αtP∈Wt for all 1≤t≤T and P∈Pt (see Remark 3.27 for the definition of αtP).
The first lemma shows the equality between both value functions.
Lemma 3.14**.**
Assume that the NA(QT) condition and Assumptions 2.1 and 2.2 hold true. Furthermore, assume that
U is either bounded from above or that Assumption 3.13 holds true.
Then u(x)=uP(x) for all x≥0.
Proof.
Fix x≥0. Theorem 3.8 will be in force.
Let P∗ be given by Theorem 3.30 with the fixed disintegration P∗:=P1∗⊗p2∗⊗⋯⊗pT∗.
First we show that Φ(x,U,QT)=Φ(x,U,PT).
The first inclusion follows from
PT⊂QT. As PT and QT have the same polar sets,
VTx,ϕ(⋅)≥0QT-q.s. and VTx,ϕ(⋅)≥0PT-q.s. are equivalent.
So to prove the reverse inequality it is enough to show that
for ϕ∈Φ(x,U,PT)EQU+(⋅,VTx,ϕ(⋅))<∞ or EQU−(⋅,VTx,ϕ(⋅))<∞ for any Q∈QT. It is obviously true
if U is bounded from above. Assume now that Assumption 3.13 holds true. Let Q∈QT with the fixed disintegration Q:=P1⊗q2⊗…⊗qT and choose
[TABLE]
Then R∈PT, see (10). Assume that ERU+(⋅,VTx,ϕ(⋅))<∞ (the same argument applies to the negative part). Then
[TABLE]
Thus
[TABLE]
Next we show that for all x≥0 and ϕ∈Φ(x,U,PT)
[TABLE]
As PT⊂QT,uP(x,ϕ)≥u(x,ϕ). Let Q∈QT with the fixed disintegration Q:=P1⊗q2⊗…⊗qT. Let
and
the only term in EPnU(⋅,VTx,ϕ(⋅)) that is not multiplied by 1/n is (1−1/n)TEQU(⋅,VTx,ϕ(⋅)).
Moreover, (10) implies that all the others probability measures appearing in EPnU(⋅,VTx,ϕ(⋅)) belongs to PT.
Fix R∈PT as one of this measures and note that ϕ∈ϕ(x,U,R).
Theorem 3.8 implies that the sNA(PT) and also the NA(R) conditions hold true.
We first prove that
ERU+(⋅,VTx,ϕ(⋅))<∞. If U is bounded from above this is immediate. Assume that Assumption 3.13 holds true. Then [Blanchard et al., 2018, Theorem 4.17] shows that for R-almost all ωT∈ΩT,
[TABLE]
as ΔSs,αsR1∈Ws for all s≥1.
Suppose that x≥1 else by monotonicity of U+, one may replace x by 1. Then [Blanchard and Carassus, 2018, Proposition 3.24] (as λ≥1) implies that
[TABLE]
as U+(⋅,1), U−(⋅,41)∈WT.
Now if ERU−(⋅,VTx,ϕ(⋅))=−∞, as R∈PT, we get that
u(x,ϕ)≤uP(x,ϕ)=−∞. Thus uP(x,ϕ)=u(x,ϕ). Else
letting n go to infinity in (17) we obtain that
uP(x,ϕ)≤EQU(⋅,VTx,ϕ(⋅)) and taking the infimum over all Q∈QT, uP(x,ϕ)≤u(x,ϕ): (16) is proved.
Finally taking in (16) the supremum over all ϕ∈Φ(x,U,PT), we get that u(x)=uP(x).
To state the corollary on the existence of an optimal solution for (12), we need two additional assumptions.
Assumption 3.15**.**
There exists some 0≤s<∞ such that −s≤Sti(ωt)<+∞ for all 1≤i≤d, ωt∈Ωt and 0≤t≤T.
Assumption 3.16**.**
For all r∈Q, r>0,supP∈QTEPU−(⋅,r)<+∞.
Corollary 3.17**.**
Assume that the NA(QT) condition and Assumptions 2.1, 2.2, 3.15 and 3.16 hold true. Furthermore, assume that
U is either bounded from above or that Assumption 3.13 holds true. Let x≥0. Then,
there exists some optimal strategy ϕ∗∈Φ(x,U,QT) such that
[TABLE]
Proof.
Fix some x≥0. Theorem 3.8 implies that sNA(PT) holds true.
So [Blanchard and Carassus, 2018, Theorem 3.6] gives the existence of an optimal strategy for uP(x). Lemma 3.14 allows to conclude since u(x)=uP(x).
3.2 Local no-arbitrage conditions and further
results
We now turn to local conditions which are at the heart of the proofs due to the structure of the model.
We recall the first part of [Bouchard and Nutz, 2015, Theorem 4.5] which establishes the essential link between the global version NA(QT) and its local version.
Theorem 3.18**.**
Assume that Assumptions 2.1 and 2.2 hold true. Then the following statements are equivalent.
The NA(QT) condition hold true.
For all 0≤t≤T−1, there exists a Qt-full measure set ΩNAt∈Bc(Ωt) such that for all ωt∈ΩNAt, hΔSt+1(ωt,⋅)≥0Qt+1(ωt)\mbox−q.s. for some h∈Rd implies that hΔSt+1(ωt,⋅)=0Qt+1(ωt)\mbox−q.s.
We present two other local definitions of no-arbitrage and establish their equivalence with the NA(QT) conditions in Theorem 3.24 which is an analogous of Theorem 3.18.
The first definition proposes a geometric view of the no-arbitrage. Theorem 3.24 extends the uni-prior result of [Jacod and Shiryaev, 1998, Theorem 3g)], see also [Kabanov and Safarian, 2010, Proposition 2.1.6]. Note that the geometric no-arbitrage has appeared in different multiple-priors contexts, see [Oblój and Wiesel, 2018, Proposition 6.4] and [Burzoni et al., 2016b, Corollary 21]. A similar idea was already exploited in [Bouchard and Nutz, 2015, Lemma 3.3]. Theorem 3.24 will also allow us to prove Proposition 3.28 and Theorem 3.30.
Recall that for a convex set C⊂Rd, the relative interior of C (see [Rockafellar, 1970, Section 6]) is \mboxRi(C)={y∈C,∃ε>0,\mboxAff(C)∩B(y,ε)⊂C}
where B(y,ε) is the open ball in Rd centered in y with radius ε.
Moreover for a convex-valued random set R,\mboxRi(R) is the random set defined by \mboxRi(R)(ω):=\mboxRi(R(ω)) for ω∈Ω.
Definition 3.19**.**
The geometric no-arbitrage condition holds true if for all 0≤t≤T−1, there exists some Qt-full measure set ΩgNAt∈Bc(Ωt) such that for all ωt∈ΩgNAt, 0∈\mboxRi(\mboxConv(Dt+1))(ωt). In this case for all ωt∈ΩgNAt, there exists εt(ωt)>0 such that
[TABLE]
The geometric (local) no-arbitrage condition is indeed practical: Together with Theorem 3.24 it allows to check whether the (global) \mboxNA(QT) condition holds true or not.
As
QT and for all 1≤t≤T,ΔSt+1 are given one gets \mboxRi(\mboxConv(Dt+1))(⋅) and it is easy to check whether [math] is in it or not (see Section 4 for examples of such a reasoning).
Secondly, in the spirit of [Rásonyi and Stettner, 2005, Proposition 3.3] (see also [Blanchard and Carassus, 2018, Proposition 2.3]), we introduce the so-called quantitative no-arbitrage condition.
Definition 3.20**.**
The quantitative no-arbitrage condition holds true if for all 0≤t≤T−1, there exists some Qt-full measure set ΩqNAt∈Bc(Ωt) such that for all ωt∈ΩqNAt, there exists βt(ωt),κt(ωt)∈(0,1) such that for all h∈\mboxAff(Dt+1)(ωt) , h=0 there exists ph∈Qt+1(ωt) satisfying
[TABLE]
In the case where there is only one risky asset and one period, (20) is interpreted as follows : There exists a prior p+ for which the price of the risky asset increases enough and an other one p− for which it decreases i.e. p∓(±ΔS(⋅)<−β)≥κ where β,κ∈(0,1). The number κ serves as a measure of the gain/loss probability and the number β of their size.
Remark 3.21*.*
Definition 3.20 is the direct adaptation to the multiple-priors set-up of [Rásonyi and Stettner, 2005, Proposition 3.3]: The probability measure depends of the strategy. For an agent buying or selling some quantity of risky assets, there is always a prior in which she is exposed to a potential loss. Proposition 3.37 will show that one can in fact choose a comment prior for all strategies in Definition 3.20.
Remark 3.22*.*
Theorem 3.8 and Proposition 3.37 are precious for solving the problem of maximisation of expected utility. For example when the utility function U is defined on (0,∞) they provide natural bounds for the one step strategies or for U(VTx,Φ), see (18) and [Blanchard and Carassus, 2018, Lemma 3.11 and (44)]. This is used to prove the existence of the optimal strategy but it could also be used to compute it numerically. We propose in Section 4 explicit values for βt and κt.
Remark 3.23*.*
In (20), βt(ωt) provides information on Dt+1(ωt) while κt(ωt) provides information on Qt+1(ωt).
Moreover, Definition 3.20 can equivalently be formulated as follow: For all 0≤t≤T−1, there exists some Qt-full measure set ΩqNAt∈Bc(Ωt) such that for all ωt∈ΩqNAt, there exists αt(ωt)∈(0,1) such that for all h∈\mboxAff(Dt+1)(ωt) , h=0 there exists ph∈Qt+1(ωt) satisfying
[TABLE]
Indeed, (21) implies (20) and assuming (20), (21) is true with αt(ωt)=min(κt(ωt),βt(ωt))∈(0,1).
Theorem 3.24**.**
Assume that Assumptions 2.1 and 2.2 hold true. Then the NA(QT) condition (see Definition 3.1), the geometric no-arbitrage (see Definition 3.19) and the quantitative no-arbitrage (see Definition 3.20) are equivalent and one can choose ΩNAt=ΩqNAt=ΩgNAt for all 0≤t≤T−1. Furthermore, one can choose βt=εt/2 in (20) (for εt introduced in (19)).
Under Assumptions 2.1 and 2.2 and any of the no-arbitrage condition, 0∈\mboxConv(Dt+1)(ωt) and \mboxAff(Dt+1)(ωt) is a vector space for all ωt∈ΩNAt.
The next proposition is [Jacod and Shiryaev, 1998, Theorem 3] but could also be obtained as a direct application of Theorem 3.24 together with [Bertsekas and Shreve, 2004, Lemma 7.28 p174] and [Aliprantis and Border, 2006, Theorem 12.28] in the specific setting where QT={P1⊗p2⊗⋯⊗pT}. Indeed, Theorem 3.24 does not apply directly as \mboxgraph(pt) belongs a priory to Bc(Ωt×P(Ωt+1)) and not to A(Ωt×P(Ωt+1)), and one needs to build some Borel-measurable version of pt. Proposition 3.26 will be used in the sequel to prove that the NA(P) condition holds true.
Proposition 3.26**.**
Assume that Assumption 2.1 holds true and let P∈P(ΩT) with the fixed disintegration P:=P1⊗p2⊗⋯⊗pT where pt∈SKt for all 1≤t≤T. Then the NA(P) condition holds true if and only if 0∈\mboxRi(\mboxConv(DPt+1))(⋅)Pt-a.s. for all 0≤t≤T−1.
Remark 3.27*.*
Similarly, under the assumption of Proposition 3.26, one can show that the NA(P) condition holds true if and only if the quantitative no-arbitrage holds true for QT={P} which is exactly [Rásonyi and Stettner, 2005, Proposition 3.3]. In this case, we denote αt in (21) by αtP.
We now establish some tricky measurability properties.
Proposition 3.28**.**
Assume that Assumptions 2.1 and 2.2 hold true. Under one of the no-arbitrage conditions (see Definitions 3.1, 3.19 and 3.20) one can choose a Bc(Ωt)-measurable version of εt (in (19)) and βt (in (20)).
The measurability of κt cannot be directly inferred from the one of εt but will be obtained in Proposition 3.37 as a consequence of Theorem 3.8. The measurability of κt is useful to solve the problem of multi-priors optimal investment for unbounded utility function defined on the whole real-line since the bounds on the optimal strategies depends on κt
see for instance [Rásonyi and Stettner, 2005, (17)] in a non-robust setting and [Rásonyi and Meireles-Rodrigues, 2018, Proof of Lemma 3.3] in the robust context.
The next theorem is crucial. It is a first step towards Theorem 3.8: It gives the existence of the measure P∗ which allows to build recursively the set
PT (see (10)). But it is also of own interest since it gives the equivalence between NA(QT) and a stronger form of wNA(QT).
Theorem 3.30**.**
Assume that Assumptions 2.1 and 2.2 hold true. The NA(QT) condition holds true if and only if there exists
some P∗∈QT such that \mboxAff(DP∗t+1)(ωt)=\mboxAff(Dt+1)(ωt) and 0∈\mboxRi(\mboxConv(DP∗t+1))(ωt) for all 0≤t≤T−1, ωt∈ΩNAt 555The set ΩNAt was introduced in Theorem 3.18, see also (45)..
Theorem 3.30 was proved in a one period setting in [Bayraktar and Zhou, 2017, Lemma 2.2].
Remark 3.32*.*
The probability measure P∗ of Theorem 3.30 is not unique. In fact, under NA(QT), all
P∈PT satisfy \mboxAff(DPt+1)(ωt)=\mboxAff(Dt+1)(ωt) and 0∈\mboxRi(\mboxConv(DPt+1))(ωt) for all 0≤t≤T−1, ωt∈ΩNAt, see proof of Theorem 3.8 step 2 iii).
Remark 3.33*.*
The main (and difficult) point in Theorem 3.30 is that P∗∈QT. Thus any Qt-null set is also a P∗-null set and in particular ΩNAt is of P∗-full measure (see Theorem 3.18). So 0∈\mboxRi(\mboxConv(DP∗t+1))(ωt) for ωt∈ΩNAt and the NA(P∗) condition holds true (see Proposition 3.26).
We have actually more since ΩNAt is of Qt-full measure.
We will provide in Section 4 explicit form of P∗.
Remark 3.34*.*
Theorem 3.30 is related and complements [Oblój and Wiesel, 2018, Theorem 3.1]. Indeed, in both cases the main issue is to find some pt+1∗(⋅,ωt)∈Qt+1(ωt) such that 0∈\mboxRi(\mboxConv(DP∗t+1))(ωt)⊂\mboxRi(\mboxConv(Dt+1))(ωt) (recall (7)). This is used in [Oblój and Wiesel, 2018] to make the link with the quasi-sure setting and in our case to establish Theorem 3.8.
Remark 3.35*.*
[Rásonyi and Meireles-Rodrigues, 2018, Assumption 2.1] asserts that there exists at least one arbitrage free model (in the uni-prior sense) and that for this model the affine space generated by the conditional support always equals Rd. Those are the conditions verified by P∗ in Theorem 3.30 and thus [Rásonyi and Meireles-Rodrigues, 2018, Theorem 3.7] which shows the existence in the problem of maximisation of expected utility for bounded function defined on the whole real line works under NA(QT).
Example 3.36**.**
The probability measure P∗∈QT of Theorem 3.30 provides a kind of stronger NA(P∗).
The counter example of the last item in Lemma 3.7 illustrates why the condition \mboxAff(DP∗t+1)(⋅)=\mboxAff(Dt+1)(⋅)Qt-q.s. is needed in Theorem 3.30. However this is not enough to obtain equivalence with the NA(QT) condition and the following counterexample illustrates why 0∈\mboxRi(\mboxConv(DP∗t+1))(⋅)Qt-q.s. is needed and why 0∈\mboxRi(\mboxConv(DP∗t+1))(⋅)Pt∗-p.s. is not enough.
Let T=2, d=1, Ω1:=Ω2:={−1,0,1}, S0:=2, S1(ω1):=2+ω1, S2(ω1,ω2):=2+ω1+ω2. Let Pna:=21(δ−1+δ1), P0:=δ0 and P1:=δ1 be three probability measures on P(Ω1). Set Q1:=\mboxConv(P0,Pna) and define Q2(⋅) as follow: Q2(±1)={Pna} and Q2(0)={P1}. This is illustrated in Figure 2.
It is clear that Assumptions 2.1 and 2.2 hold true.
Let p2(⋅)∈Q2(⋅) and set P∗:=Pna⊗p2∈Q2
(see Figure 2).
It is immediate that the NA(P∗) and thus the wNA(Q2) conditions hold true. Furthermore DP∗2(±1)=D2(±1)={−1,1} and DP∗2(0)=D2(0)={1}. Thus for all ω1, \mboxAff(DP∗2)(ω1)=\mboxAff(D2)(ω1)=R. As 0∈\mboxRi(\mboxConv(DP∗2))(±1) and P1∗({±1})=1, 0∈\mboxRi(\mboxConv(DP∗2))(⋅)P1∗-a.s. Now let Qˉ:=P0⊗p2∈Q2 (see Figure 2). Then Qˉ1({0})=1 and 0∈/\mboxRi(\mboxConv(DP∗2))(0) implies that 0∈\mboxRi(\mboxConv(DP∗2))(⋅)Qˉ1-p.s. and thus 0∈\mboxRi(\mboxConv(DP∗2))(⋅)Q1-q.s. are not verified.
Let us check that the NA(Q2) condition does not hold true. Choose ϕ∈Φ such that ϕ1=0 and ϕ2(ω1)=10(ω1) and use again Qˉ=P0⊗p2∈Q2. Then V20,ϕ≥0Q2-q.s. and Qˉ({V20,ϕ>0})=δ1({ω2>0})=1.
Now replace Q2 by Q2(⋅):=\mboxConv(Pna,P1) while keeping Q1=Q1 as before and set P∗:=Pna⊗p2, where p2(⋅,ω1):=Pna(⋅) for all ω1. Then DP∗2(ω1)={−1,1}, \mboxAff(DP∗2)(ω1)=\mboxAff(D2)(ω1)=R and 0∈\mboxRi(\mboxConv(DP∗2))(ω1) for all ω1. One can directly check that the NA(Q2) condition holds true.
Finally, one may build P2 using (10) and P∗. It is clear that P2 is strictly included in Q2 since it does not contain {P0⊗q2,q2(⋅,ω2)∈Q2(ω2)}.
The following result provides an answer to the measurability issue raised in Remark 3.29 and also provides a commun prior for all strategies.
Proposition 3.37**.**
Assume that Assumptions 2.1 and 2.2 as well as the NA(QT) condition hold true.
Then for all 0≤t≤T−1
there exists some Bc(Ωt)-measurable random variables βt(⋅),κt(⋅)∈(0,1) such that for all ωt∈ΩNAt and h∈\mboxAff(Dt+1)(ωt) , h=0
[TABLE]
where pt+1∗(⋅,ωt) is defined in Theorem 3.30 with the fix disintegration P∗:=P1∗⊗p2∗⊗⋯⊗pT∗.
Remark 3.38*.*
We have that βt(ωt)=κt(ωt)=1 only if DP∗t+1(ωt)={0}. Indeed if βt(ωt)=κt(ωt)=1 and DP∗t+1(ωt)={0}, then for all h∈\mboxAff(Dt+1)(ωt) with ∣h∣=1pt+1∗(hΔSt+1(ωt,⋅)<−1,ωt)=1.
Fix such a h and let Fh:={y∈Rd,hy≤−1}. Then
pt+1∗(ΔSt+1(ωt,⋅)∈F±h,ωt)=1 and DP∗t+1(ωt)=Et+1(ωt,pt+1∗(⋅,ωt))⊂F−h∩F+h=∅, see Remark 2.5. Note that it is not easy to obtain this result for Theorem 3.24 as the prior in (20) depends on h.
Finally, if there exists a dominating probability measure P∈QT, the following result holds true.
Proposition 3.39**.**
Assume that Assumptions 2.1 and 2.2 hold true. Assume furthermore that there exists some dominating measure P∈QT. Then the NA(P) and the NA(QT) conditions are equivalent. In this case, for all 0≤t≤T−1,
[TABLE]
Remark 3.40*.*
One can choose P∗=P in Proposition 3.37 changing ΩNAt by the full-measure set where (23) holds true. Moreover, PT (see (10)) in Theorem 3.8 can be constructed from P.
This section proposes concrete examples of multiple-priors setting illustrating our results. We also use these examples to present how to build sets of probability measures which are not dominated. This relies on the following result.
Proposition 4.1**.**
Assume that Assumption 2.2 holds true and that there exists some P∈QT, some 0≤t≤T−1 and some ΩNt∈Bc(Ωt) such that Pt(ΩNt)>0 and such that the set Qt+1(ωt) is not dominated for all ωt∈ΩNt. Then QT is not dominated.
Suppose that T≥1, d=1 and Ωt=R (or (0,∞)) for all 1≤t≤T. The risky asset (St)0≤t≤T is such that S0=1
and St+1=StYt+1 where Yt+1 is a real-valued and B(Ωt+1)-measurable random variable such that Yt+1(Ωt+1)=(0,∞) for all 0≤t≤T−1 (if Ωt=(0,∞) you can think of Yt=ωt). The positivity of Yt implies that St(ωt)>0 for all ωt∈Ωt. It is clear that Assumption 2.1 is verified. Then, for 0≤t≤T−1 let
[TABLE]
where πt,Πt,ut,Ut,dt,Dt are real-valued B(Ωt)-measurable random variables such that 0≤πt(ωt)≤Πt(ωt)≤1, ut(ωt)≤Ut(ωt) and dt(ωt)≤Dt(ωt) for all ωt∈Ωt.666This could be generalised by setting Bt+1(ωt):={πδu+(1−π)δd,π∈St(ωt),u∈Ut(ωt),d∈Dt(ωt)}, where St, Ut, Dt are Borel-measurable random sets Ωt↠R.
Assumption 4.2**.**
We have that πt(ωt)<1, Πt(ωt)>0 and 0<dt(ωt)<1<Ut(ωt) for all 0≤t≤T−1 and ωt∈Ωt.
For all 0≤t≤T−1 and ωt∈Ωt, let
[TABLE]
where q(Yt+1∈⋅) is the law of Yt+1 under q. In words, at each step, the risky asset can go up or down and there is uncertainty not only on the probability of the jumps but also on their sizes.
Remark 4.3*.*
The usual binomial model (see [Cox et al., 1979]) corresponds to πt=Πt=π, ut=Ut=u and dt=DT=d where 0<π<1, d<1<u.
First, Qt+1 is convex valued by definition. Since Yt+1(Ωt+1)=(0,∞), Qt+1(ωt)=∅, hence Qt+1(ωt)=∅ for all ωt∈Ωt.
We show successively that \mboxgraph(Bt+1), \mboxgraph(Qt+1) and \mboxgraph(Qt+1) are analytic sets. For ωt∈Ωt, let
[TABLE]
Then F is Borel-measurable (see [Bertsekas and Shreve, 2004, Corollary 7.21.1 p130]), \mboxgraph(E)∈Bc(Ωt)⊗B(R3) as πt,Πt,ut,Ut,dt and Dt are Borel-measurable. We conclude that
\mbox{graph}\left(\mathcal{B}_{t+1}\right)$$=F\left(\mbox{graph}(E)\right) is analytic.
Let Φ:P(Ωt+1)→P(R) be defined by Φ(q):=q(Yt+1∈⋅).
Using [Bertsekas and Shreve, 2004, Propositions 7.29 p144 and 7.26 p134], Φ is a Borel-measurable stochastic kernel on R given P(Ωt+1). So Φ^(ωt,q):=(ωt,Φ(q)) is also Borel-measurable and \mboxgraph(Qt+1)=Φ^−1(\mboxgraph(Bt+1)) is analytic. Then one can show as in [Bartl, 2019b, Proofs for Section 2.3] that \mboxgraph(Qt+1) is analytic since Qt+1 is the convex hull of Qt+1.
Lemma 4.5**.**
Under Assumption 4.2, the NA(QT) condition holds true and the sNA(QT) condition might fails.
Proof.
It is clear that for all 0≤t≤T−1, all ωt∈Ωt,
[TABLE]
So the NA(QT) condition holds true as 0∈\mboxRi(\mboxConv(Dt+1))(ωt) for all ωt∈Ωt (see Theorem 3.24).
Under Assumption 4.2, one may have that ut(ωt)<1 for all ωt∈Ωt, 0≤t≤T−1 and find some at(ωt)∈[ut(ωt),1). For all 0≤t≤T−1 and ωt∈Ωt, let
[TABLE]
where rt(ωt)∈[πt(ωt),Πt(ωt)]. Set Q:=Q1⊗q2⊗⋯⊗qT∈QT. As
[TABLE]
0∈/\mboxConv(DQt+1)(ωt) for all ωt∈Ωt and Proposition 3.26 implies that NA(Q) and thus sNA(QT) fail.
We now provide some explicit expressions for εt, βt and κt of (19) and (20) and exhibit a candidate for the measure P∗ of Theorem 3.30.
Lemma 4.6**.**
Assume that Assumption 4.2 holds true. For all 0≤t≤T−1, all ωt∈Ωt let
[TABLE]
where N>1 and M>1 are fixed and allows to get sharper bound for εt(ωt),βt(ωt) and κt(ωt). Then
Moreover, for P∗:=P0∗⊗p1∗⋯⊗pT∗∈QT,0∈\mboxRi(\mboxConv(DP∗t+1))(ωt) and \mboxAff(DP∗t+1)(ωt)=\mboxAff(Dt+1)(ωt)=R for all ωt∈Ωt.
Finally, assume that for some 0≤t≤T−1 and some ωt∈Ωt, ut(ωt)<Ut(ωt) or dt(ωt)<Dt(ωt). Then the set Qt+1(ωt) is not dominated and one can construct sets QT which are not dominated.
Remark 4.7*.*
Note that P∗ is not unique.
The (Borel) measurability of εt,βt and κt are clear. Similarly they will inherit any integrability conditions imposed on St, πt, Πt, dt, Dt,ut and Ut. For instance if they
belong to Wt
for all 1≤t≤T so do εt,βt and κt.
Proof.
Fix some 0≤t≤T−1, ωt∈Ωt.
Let qt+1±(Yt+1∈⋅,ωt):=rt+1±(⋅,ωt)∈Qt+1(ωt). Then
[TABLE]
and (25) follows while (19) follows from Theorem 3.24.
As pt+1∗∈SKt+1, P∗∈QT.
From (25), the quantitative no-arbitrage (20) holds true for all ωt∈Ωt with ph=pt+1∗(⋅,ωt) for all possible strategy h. Therefore the NA(P∗) condition holds true (see Remark 3.27).
Theorem 3.24
implies also that 0∈\mboxRi(\mboxConv(DP∗t+1))(ωt). Moreover \mboxAff(DP∗t+1)(ωt)=\mboxAff(Dt+1)(ωt)=R for all ωt.
For the last item, assume that for some 0≤t≤T−1 and some ωt∈Ωt, ut(ωt)<Ut(ωt) and that the set Qt+1(ωt) is dominated by some measure p.
For x∈(0,∞) let
Ax:={Yt+1−1({x})}=∅ as Yt+1(Ωt)=(0,∞).
Fix x(ωt)∈(min(1,ut(ωt)),Ut(ωt)) and choose a(ωt)∈Ax(ωt) and
b(ωt)∈Adt(ωt). Let rx(.,ωt):=Πt(ωt)δa(ωt)+(1−Πt(ωt))δb(ωt)∈Bt+1(ωt) and px(Yt+1∈⋅,ωt):=rx(.,ωt)∈Qt+1(ωt).
As rx({a(ωt)},ωt)=Πt(ωt)>0, p({a(ωt)})>0, which leads to an uncountable number of atoms for p.
Then, Proposition 4.1 allows to build examples of sets QT which are not dominated.
4.2 Discretized d-dimensional diffusion
We provide now an example for the discretized dynamics of a multi-dimensional diffusion process in the spirit of [Carassus and Rásonyi, 2015, Example 8.2].
Fix a period T≥1 and n≥d. Denote by
Mn the set of real-valued matrix with n rows and n columns. Choose some constant Y0∈Rn and let Yt+1 be defined by the following difference equation for all 0≤t≤T−1, (ωt,ωt+1)∈Ωt×Ωt+1
[TABLE]
where μt+1:Rn×Ωt×Ωt+1→Rn, νt+1:Rn×Ωt→Mn, Zt+1:Ωt×Ωt+1→Rn are assumed to be Borel-measurable.
Two cases will be studied: Sti=Yti and Sti=eYti for all 1≤i≤d. In a uni-prior setting if the law of Zt+1 is assumed to be normal, this corresponds to the popular normal and lognormal dynamic for the underlying assets. Note that in both cases if d<n we may think that Yti for i>d represents some non-traded assets or the evolution of some economic factors that will influence the market.
Assume that some P0∈P(ΩT) is given with fixed disintegration P0:=P10⊗p20⊗⋯⊗pT0, where pt+10∈SKt+1 for all 0≤t≤T−1: P0 could be an initial guess or estimate for the prior. For all 0≤t≤T−1, let rt and qt be functions from Ωt to (0,∞): rt will be the bound on the drift while qt guarantees that the diffusion is non-degenerated (in dimension one it is a lower bound on the volatility).
We make the following assumptions on the dynamic of Y.
Assumption 4.8**.**
For all 0≤t≤T−1, rt is B(Ωt)-measurable. For all
ωt∈Ωt,x∈Rn,
•
νt+1(x,ωt)∈Mnqt(ωt) where
Mnδ:={M∈Mn,∀h∈Rn,htMMth≥δhth} for δ>0.
•
Zt+1(ωt,⋅) and μt+1(ωt,⋅) are independent under pt+10(⋅,ωt).
DZt+1t+1(ωt)=Rn, where DZt+1t+1(ωt) is the support of Zt+1(ωt,⋅) under pt+10(⋅,ωt), see (5).
The model uncertainty on the laws of μt+1 and Zt+1 is given by the folowing sets.
[TABLE]
where for some k≥1, Ft:P(Ωt+1)×Ωt→Rk is a Borel-measurable function such that Ft(pt+10(⋅,ωt),ωt)=0
for all 0≤t≤T−1, ωt∈Ωt.
By assumption pt+10(⋅,ωt)∈Qt+1(ωt) for all ωt∈Ωt and thus P0∈QT. Note that for a given p∈Qt+1(ωt) the law of Zt+1(ωt,⋅) and μt+1(ωt,⋅) under p are not necessarily independent.
The financial interpretation is the following. The set Qt+11(ωt) allows the drift of the diffusion to be not only stochastic but with an unknown distribution. It is only assumed to be bounded.
If Ft(p,ωt)=1\mboxdistt(p,pt+10(⋅,ωt))≤bt(ωt)−1 with bt(ωt)>0 and
\mboxdistt some kind of distance function between probability measures, the set Qt+12(ωt) contains models which are close enough from pt+10(⋅,ωt). This could happen if the physical measure is not known but estimated from data at each step. A popular choice for the \mboxdistt function is the Wasserstein distance. But one may also choose for the coordinate i of F(p,ωt) (with 1≤i≤k) the difference between the moments of order i of Zt+1(ωt,⋅) under p and under pt+10(⋅,ωt)
and incorporate all the models p such that the moments of Zt+1(ωt,⋅) under p are equals to the ones of Zt+1(ωt,⋅) under pt+10(⋅,ωt) up to order k.
Lemma 4.9**.**
Under Assumption 4.8, Assumptions 2.1 and 2.2 are satisfied.
Proof.
Assumption 2.1 follows from the
Borel measurability of μt+1, νt+1, Zt+1 and thus of Yt+1.
As the function (ωt,p)→p(μt+1(Yt(ωt),ωt,⋅)∈[−rt(ωt),rt(ωt)]n) is Borel-measurable (see [Bertsekas and Shreve, 2004, Proposition 7.29 p144]), \mboxgraph(Qt+11) is analytic. The Borel-measurability of Ft implies that \mboxgraph(Qt+12) is an analytic set and so is \mboxgraph(Qt+1). It is clear that Qt+11 is convex valued. If
Ft(⋅,ωt) is convex
for all ωt∈Ωt,
then Qt+12 is convex valued. Else one may consider the convex hull of Qt+12 whose analyticity can be established as in the proof of Lemma 4.4. Assumption 2.2 is proved.
Now we give explicit values for
βt and κt in (20) with ph=pt+10(⋅,ωt) and prove NA(QT).
Lemma 4.10**.**
Assume that Assumption 4.8 is satisfied and that Sti=Yti for all 1≤i≤d and all 1≤t≤T. Then Dt+1(ωt)=Rd for all ωt∈Ωt and 1≤t≤T−1 and NA(QT) condition holds true. Let
[TABLE]
where K is the (finite) set of functions from {1,⋯,d} to {−1,1} and for some k∈K
[TABLE]
Then, for all h∈Rd with ∣h∣=1
[TABLE]
Proof.
First, we show that for all ωt∈Ωt,Dt+1(ωt)=Rd. To do that we prove that
[TABLE]
Let DY,P0t+1(ωt) be the support of Y(ωt,⋅) under pt+10(⋅,ωt), see (5).
Using (7) DY,P0t+1(ωt)⊂DYt+1(ωt) and it is enough to prove that DY,P0t+1(ωt)=Rn.
Fix some ωt∈Ωt. For ease of reading, we adopt the following notations. Let ΔY(⋅)=ΔYt+1(ωt,⋅), R(⋅)=μt+1(Yt(ωt),ωt,⋅), X(⋅)=ΔY(⋅)−R(⋅), M=νt+1(Yt(ωt),ωt), Z(⋅)=Zt+1(ωt,⋅) and p0(⋅)=pt+10(⋅,ωt). As X(⋅)=MZ(⋅) (see (28)) and Z and R are independent under p0, X and R are also independent under p0.
Fix some x0∈Rn, ε>0. By assumption M is an invertible matrix: There exists some y0∈Rn, α>0, such that B(y0,α)⊂M−1(B(x0,ε))777M−1(B(x0,ε)) is open in Rn and is not empty because M is a bijective function on Rn.. The forth item of Assumption 4.8 together with Lemma 5.2 imply that888With the notation
pR0(A)=p0(R∈A) for all A∈B(Rn).
[TABLE]
as X and R are independent under p0.
Lemma 5.2 implies that the supports of X and of ΔY under p0 are equal to Rn.
For all 0≤t≤T−1, ωt∈Ωt, Dt+1(ωt)=Rd and 0∈\mboxRi(\mboxAff(Dt+1)(ωt)). Theorem 3.24 implies that the NA(QT) condition is verified.
Fix now some ωt∈Ωt and h∈Rd with ∣h∣=1.
First, DY,P0t+1(ωt)=Rn implies that for all k∈K, ωt∈Ωt
[TABLE]
where Oh:={z∈Rn,k(i)zi<−\mboxln2,∀1≤i≤d} is an open set of Rn.
Set k∗(i):=\mboxsign(hi) for all 1≤i≤d, then k∗∈K. Let ωt+1∈Gk∗(ωt) as (35) implies that Gk∗(ωt) is not empty. For all 1≤i≤d,
[TABLE]
As ∣h∣=1 there exists 1≤i∗≤d such that n1≤d1≤∣hi∗∣≤1 and
[TABLE]
Therefore
pt+10(hΔSt+1(ωt,⋅)<−\mboxln2/n,ωt)≥mink∈K(pt+10(Gk(ωt),ωt)).
Recalling (35), (33) is satisfied.
We now treat the log-normal case.
Lemma 4.11**.**
Assume that Assumption 4.8 is satisfied and that Sti=eYti for all 1≤i≤d and all 1≤t≤T. Then Dt+1(ωt)=Rd for all ωt∈Ωt and 1≤t≤T−1 and NA(QT) condition holds true. Let
[TABLE]
recall (32) for the definition of Gk(ωt).
Then, for all h∈Rd with ∣h∣=1
[TABLE]
Proof.
Let 0≤t≤T−1 and fix ωt∈Ωt. Using (7) DP0t+1(ωt)⊂Dt+1(ωt) and it is enough to prove that DP0t+1(ωt)=Rd. This will follow from Lemma 5.2 if for any open set O of Rd,p0(ΔSt+1(⋅,ωt)∈O,ωt)>0.
Fix an open set O of Rd and let
Fωt:Rn→Rd be defined by Fωt(x1,⋯,xn)=(eYt1(ωt)(ex1−1),⋯,eYtd(ωt)(exd−1)). As Fωt is continuous
Fωt−1(O) is an open set of Rn. Then
[TABLE]
using (34) and Lemma 5.2 again.
Thus for all 0≤t≤T−1, ωt∈Ωt, Dt+1(ωt)=Rd and 0∈\mboxRi(\mboxAff(Dt+1)(ωt)). Theorem 3.24 implies that the NA(QT) condition is verified.
Fix a ωt∈Ωt, h∈Rd with ∣h∣=1. Then
[TABLE]
Let k∗∈K as in the proof of the preceding lemma
and let ωt+1∈Gk∗(ωt). First, for all 1≤i≤d,
[TABLE]
As ∣h∣=1 there is a component hi∗ such that n1≤d1≤∣hi∗∣≤1 and as Sti∗(ωt)>0, (38) implies that
Note that in both cases (Sti=Yti and Sti=eYti), we can choose P∗=P0 in Theorem 3.30.
We now give a one dimension illustration of the previous setting where QT is not dominated.
Take n=d=1 and Ωt:=Ω for some Polish space Ω. Let Z be some real-valued random variable defined on Ω and p0∈P(Ω) be such that under p0, Z is normally distributed with mean [math] and standard deviation 1. Set P0:=p0⊗⋯⊗p0 and Zt+1(ωt,ωt+1):=Z(ωt+1) for all 0≤t≤T−1 and ωt∈Ωt. Define F:P(Ω)→R2 by F(p):=(Ep(Z),Ep(Z−Ep(Z))2−1) and F(ωt,ωt+1):=F(ωt+1) for all 0≤t≤T−1 and ωt∈Ωt. Finally, set Qt+1(ωt):={p∈P(Ω),F(p)=0}=:Q for all 0≤t≤T−1, ωt∈Ωt. For each ωt, the law of the driving process Z for the next period is centered with variance 1 but not necessarily normally distributed.
Assumption 4.8 on the dynamic of Y are verified if we choose Y0:=1 and for all 0≤t≤T−1, x∈R, (ωt,ωt+1)∈Ωt×Ω
[TABLE]
for some r∈R and σ>0 fixed.
As ΔYt=r+σZ and Z is normally distributed with mean [math] and standard deviation 1 under p0, (31) (or (36)) implies that
[TABLE]
where Φ is the cumulative distribution function of some normal law with mean [math] and standard deviation 1. We have already seen that βt(ωt)=β=(\mboxln2)/n when St=Yt. In the other case, St(ωt)=\mboxexp(Yt(ωt))=\mboxexp(1+rt+σ∑i=1tZ(ωi)) and βt(ωt)=(1/2)min(1,St(ωt)) (see (36)).
Finally, the set QT is not dominated. Indeed, we show that Q is not dominated and conclude using Proposition 4.1. Assume that there is some p∈P(Ω) which dominates Q. For x=0, let qx∈P(Ω) such that
[TABLE]
Then qx∈Q and {x∈R,p({Z=x})>0}=R\{0}, a contradiction.
5 Proofs
The first section presents the one-period version of our problems with deterministic initial data. We will study the different notions of arbitrage and their equivalence (see Proposition 5.7). We also prove Proposition 5.8 that will be used in the proof of Theorem 3.30.
In the second section the multi-period results are proved relying on the one-period results together with measurable selections technics. Finally, the third section presents
the proof of Proposition 4.1.
5.1 One-period model
Let (Ω,G) be a measured space, P(Ω) the set of all probability measures defined on G and Q a non-empty convex subset of P(Ω). For P∈Q fixed, EP denotes the expectation under P. Let Y be a G-measurable Rd-valued random variable.
The following sets are the pendant in the one-period case of the ones introduced in Definition 2.3. Let P∈Q
[TABLE]
The next lemma will be used in the proof of Proposition 3.28.
Lemma 5.1**.**
Let C be a convex set of Rd and fix some ε>0. Then B(0,ε)∩\mboxAff(C)⊂C if and only if B(0,ε)∩\mboxAff(C)⊂C.
Proof.
The reverse implication is trivial. Assume that B(0,ε)∩\mboxAff(C)⊂C and let x∈B(0,ε)∩\mboxAff(C). As ∣x∣<ε, there exists some δ>0 such that B(x,δ)∩\mboxAff(C)⊂B(0,ε)∩\mboxAff(C)⊂C. Hence x∈\mboxRi(C)=\mboxRi(C)⊂C (see [Rockafellar, 1970, Theorem 6.3 p46]).
This lemma allows an easy characterisation of the support and was used several time in the paper.
Lemma 5.2**.**
Let h∈Rd and P∈P(Ω) be fixed. Then, h∈E(P) if and only if for all n≥1, P(Y(⋅)∈B(h,1/n))>0. Similarly, h∈D if and only if for all n≥1, there exists some Pn∈Q, such that Pn(Y(⋅)∈B(h,1/n))>0.
Proof.
Fix some h∈Rd. By definition h∈/E(P) if and only if there exists an open set O⊂Rd such that h∈O and P(Y(⋅)∈O)=0 and the first item follows.
Similarly, h∈/D if and only if there exists an open set O⊂Rd such that h∈O and P(Y(⋅)∈O)=0 for all P∈Q and the second item follows.
Now, we introduce the definitions of no-arbitrage in this one period setting. The first one is the one-period pendant of the NA(QT) condition while the two others are the pendant of Definitions 3.19 and 3.20.
Definition 5.3**.**
The one-period no-arbitrage condition holds true if hY(⋅)≥0Q-q.s. for some h∈Rd implies that hY(⋅)=0Q-q.s.
Definition 5.4**.**
The one-period geometric no-arbitrage condition holds true if 0∈\mboxRi(\mboxConv(D)). This is equivalent to 0∈\mboxConv(D) and there exists some ε>0 such that
B(0,ε)∩\mboxAff(D)⊂\mboxConv(D).
Definition 5.5**.**
The one-period quantitative no-arbitrage condition holds true if there exists some constants β,κ∈(0,1]
such that for all h∈\mboxAff(D), h=0 there exists Ph∈Q satisfying
[TABLE]
Remark 5.6*.*
We recall that if 0∈/\mboxRi(\mboxConv(D)) there exists some h∗∈\mboxAff(D), h∗=0 such that h∗Y(⋅)≥0Q-q.s. This is a classical exercise relying on separation arguments in Rd, see [Rockafellar, 1970, Theorems 11.1, 11.3 p97] or [Föllmer and Schied, 2002, Proposition A.1].
Proposition 5.7 establishes that these three preceding conditions are actually equivalent.
Proposition 5.7**.**
Definitions 5.3, 5.4 and 5.5 are equivalent. Moreover, one can choose β=ε/2 in (42) where ε>0 is such that
B(0,ε)∩\mboxAff(D)⊂\mboxConv(D) in Definition 5.4.
Proof.
Step 1 : Definition 5.3 implies Definitions 5.4 and 5.5.
First we show by contradiction that for all h∈\mboxAff(D)
[TABLE]
Assume that there exists some h∈\mboxAff(D), h=0 such that hY(⋅)≥0Q-q.s. Definition 5.3 implies that hY(⋅)=0Q\mbox−q.s. and999X⊥ stands for the orthogonal space of some set X.
[TABLE]
see for instance [Nutz, 2016, Proof of Lemma 2.6].
This implies that h∈\mboxAff(D)∩(\mboxAff(D))⊥⊂{0}, a contradiction.
Now we show that Definition 5.4 holds true. If 0∈/\mboxRi(\mboxConv(D)), Remark 5.6
implies that there exists some h∗∈\mboxAff(D), h∗=0 such that h∗Y(⋅)≥0Q-q.s. which contradicts (43).
Then, we prove that Definition 5.5 holds also true. For all n≥1, let
[TABLE]
with the convention that inf∅=+∞. We have seen that Definition 5.4 holds true: 0∈\mboxRi(\mboxConv(D))⊂\mboxAff(D) and \mboxAff(D) is a vector space.
If \mboxAff(D)={0}, then n0=1<∞. Assume now that \mboxAff(D)={0}. We prove by
contradiction that n0<∞.
Assume that n0=∞. For all n≥1, there exists some hn∈An.
By passing to a sub-sequence we can assume that hn tends to some h∗∈\mboxAff(D) with ∣h∗∣=1. Let Bn:={hnY(⋅)<−1/n}. Then
{h∗Y(⋅)<0}⊂liminfnBn and Fatou’s Lemma implies that for any P∈Q
[TABLE]
So h∗Y(⋅)≥0Q-q.s. and (43) implies that h∗=0
which contradicts ∣h∗∣=1. Thus n0<∞ and we can set β=κ=1/n0.
It is clear that β,κ∈(0,1] and by definition of An0, (42) holds true.
Fix some h∈Rd such that hY(⋅)≥0Q-q.s. Let p(h) be the orthogonal projection of h on \mboxAff(D) (recall that \mboxAff(D) is a vector space since 0∈\mboxRi(\mboxConv(D))⊂\mboxAff(D)). Assume for a moment that p(h)=0. Remark 2.4 shows that P({Y(⋅)∈D})=1 for all P∈Q,hY(⋅)=p(h)Y(⋅)=0Q-q.s. and Definition 5.3 is verified.
Next we show that hy≥0 for all y∈D
and by convex combinations for all y∈\mboxConv(D). Indeed if there exists y0∈D such that hy0<0, then there exists some δ>0 such that hy<0 for all y∈B(y0,δ). But Lemma 5.2 implies the existence of some P∈Q such that P(Y(⋅)∈B(y0,δ))>0, a contradiction. Now, if p(h)=0, as 0∈\mboxRi(\mboxConv(D)), there exists some ε>0 such that B(0,ε)∩\mboxAff(D)⊂\mboxConv(D),−εp(h)/∣p(h)∣∈\mboxConv(D) and
[TABLE]
a contradiction.
*Step 4:
If B(0,ε)∩\mboxAff(D)⊂\mboxConv(D) one can choose β=ε/2 in (42).
*This is similar to the proof of Definition 5.4 implies Definition 5.5. The set An is modified by setting
[TABLE]
The same arguments as before apply and
if n0=∞ there exists some h∗∈\mboxAff(D), ∣h∗∣=1 such that h∗Y≥−ε/2QT-q.s. We also get that h∗y≥−ε/2 for all y∈\mboxConv(D). Choosing y=−(2/3)εh∗∈B(0,ε)∩\mboxAff(D)⊂\mboxConv(D), we obtain a contradiction. So, (42) holds true with β=ε/2 and κ=1/n0101010The same argument shows that one can set κ=infh∈\mboxAff(D),∣h∣=1supP∈QP(hY(⋅)<−2ε)>0 illustrating why the measurability of κ cannot be directly obtained, see Remark 3.29..
The next proposition follows from [Bayraktar and Zhou, 2017, Lemma 2.2] and
will be used in the proof of Theorem 3.30.
Proposition 5.8**.**
Assume that the one-period no-arbitrage condition (see Definition 5.3) holds true. Then there exists some P∗∈Q such that 0∈\mboxRi(\mboxConv(E(P∗))) and \mboxAff(E(P∗))=\mboxAff(D).
Proof.
[Bayraktar and Zhou, 2017, Lemma 2.2] gives the existence of some P∗∈Q such that NA(P∗) holds true and \mboxAff(E(P∗))=\mboxAff(D). Note that the proof of [Bayraktar and Zhou, 2017, Lemma 2.2] relies on the convexity of Q. Now Proposition 3.26 (for T=1) shows that 0∈\mboxRi(\mboxConv(E(P∗))).
5.2 Multi-period model
First we define the distance of a point x∈Rd to a set F⊂Rd by d(x,F):=inf{∣x−f∣,f∈F} and the Hausdorff distance between two sets F,G⊂Rd by
d(F,G)=supx∈Rd∣d(x,F)−d(x,G)∣.
Fix some 0≤t≤T−1 and ωt∈Ωt. We say that the NA(Qt+1(ωt)) condition holds true if hΔSt+1(ωt,⋅)≥0Qt+1(ωt)-q.s. for some h∈Rd implies that hΔSt+1(ωt,⋅)=0Qt+1(ωt)-q.s. Proposition 5.7 implies that the NA(Qt+1(ωt)) condition is equivalent to (19) and (20) for any ωt∈Ωt.
Then Theorem 3.18 shows that Definition 3.1 is equivalent to the fact that
[TABLE]
is a Qt-full measure set and belongs to Bc(Ωt) for all 0≤t≤T−1. Thus, for all 0≤t≤T−1, one may choose ΩNAt=ΩqNAt=ΩgNAt. Furthermore, Proposition 5.7 shows that one can take βt(ωt)=εt(ωt)/2 for ωt∈ΩNAt.
Fix some 0≤t≤T−1. We set Γt+1(ωt)=∅ for ωt∈/ΩNAt and for all ωt∈ΩNAt
[TABLE]
where the equality comes from Lemma 5.1.
Assume for a moment that \mboxgraphΓt+1∈Bc(Ωt)⊗B(Rd) has been proved. The Aumann Theorem implies the existence of a Bc(Ωt)-measurable selector εt:{Γt+1=∅}→R such that εt(ωt)∈Γt+1(ωt) for every ωt∈{Γt+1=∅}. Now, Theorem 3.24 and (19) imply that ΩNAt={Γt+1(ωt)=∅} (recall that Γt+1(ωt)=∅ outside ΩNAt).
Setting εt=1 outside ΩNAt,εt is Bc(Ωt)-measurable and Proposition 3.28 is proved as we can choose βt=εt/2 (see Theorem 3.24).
It remains to show that \mboxgraphΓt+1∈Bc(Ωt)⊗B(Rd). For all ε>0, ε∈Q, let
[TABLE]
As \mboxgraphΓt+1=⋃ε∈Q,ε>0Aε×{ε},
it is enough to prove that Aε∈Bc(Ωt). Let h:Rd×Ωt be defined by
[TABLE]
Then [Aliprantis and Border, 2006, Theorem 18.5 p595] and Lemma 2.6 show that for all x∈Rdh(x,⋅) is Bc(Ωt)-measurable and that h(⋅,ωt) is continuous for all ωt∈Ωt.
As \mboxConv(Dt+1)(ωt) is closed-valued,
As mentioned in Remark 3.34, our proof uses similar ideas as the one used in the proof of [Oblój and Wiesel, 2018, Theorem 3.1] and relies crucially on the measurability and convexity of Graph(Qt+1(ωt)) (see Assumption 2.2).
Proof.
*Reverse implication.
*Fix some 0≤t≤T−1 and ωt∈ΩNAt.
As P∗∈QT, Remark 2.5 implies that
DP∗t+1(ωt)⊂Dt+1(ωt).
As \mboxAff(Dt+1)(ωt)=\mboxAff(DP∗t+1)(ωt) and 0∈\mboxRi(\mboxConv(DP∗t+1))(ωt), there exists some ε>0 such that
*For all 0≤t≤T−1, let Et+1:Ωt↠P(Ωt+1) be defined by Et+1(ωt)=∅ if ωt∈ΩNAt and if ωt∈ΩNAt
[TABLE]
Theorem 3.18 and Proposition 5.8 show that ΩNAt={Et+1=∅}. Assume for a moment that we have proved the existence
of pt+1∗∈SKt+1 such that pt+1∗(⋅,ωt)∈Et+1(ωt) for all ωt∈ΩNAt. Let
P∗:=p1∗⊗⋯⊗pT∗.
Then, P∗∈QT (see (2)), (7) implies that
[TABLE]
and
0∈\mboxRi(\mboxConv(DP∗t+1))(ωt) for all ωt∈ΩNAt.
So it remains to prove the existence of pt+1∗. Fix some 0≤t≤T−1 and let
[TABLE]
[Artstein, 1972, Lemma 5.6] and Lemma 2.6 show that \mboxRi(\mboxConv(Et+1)) is B(Ωt)⊗B(P(Ωt+1))-measurable and B∈B(Ωt)⊗B(P(Ωt+1)) follows.
Let h be defined by
[TABLE]
Note that C={h−1(0)}. Then [Aliprantis and Border, 2006, Theorem 18.5 p595] and Lemma 2.6 show that x∈Rd(ωt,p)→d(x,\mboxAff(Et+1)(ωt,p)) is B(Ωt)⊗B(P(Ωt+1)) measurable and ωt→d(x,\mboxAff(Dt+1)(ωt)) is Bc(Ωt) measurable.
They also show
x→∣d(x,\mboxAff(Et+1)(ωt,p))−d(x,\mboxAff(Dt+1)(ωt))∣ is continuous. Thus
[TABLE]
and h is Bc(Ωt)⊗B(P(Ωt+1)) measurable. It follows that C∈Bc(Ωt)⊗B(P(Ωt+1)).
[Rockafellar, 1970, Theorem 6.3 p46], Assumption 2.2
and Lemma 5.9 show that
[TABLE]
where for some Polish space X and some paving J (i.e. a non-empty collection of subsets of X containing the empty set), A(J) denotes the set of all nuclei of Suslin Scheme on J (see [Bertsekas and Shreve, 2004, Definition 7.15 p157]).
Now [Bouchard and Nutz, 2015, Lemma 4.11] (which relies on [Leese, 1978]) gives the existence of
pt+1∗∈SKt+1 such that pt+1∗(⋅,ωt)∈Et+1(ωt) for all ωt∈ΩNAt={Et+1=∅}. The proof is complete.
The following lemma was used in the previous proof.
Lemma 5.9**.**
Let X,Y be two Polish spaces. Let Γ1∈A(X×Y) and Γ2∈Bc(X)⊗B(Y). Then Γ1∩Γ2∈A(Bc(X)⊗B(Y)).
Proof.
[Bertsekas and Shreve, 2004, Proposition 7.35 p158, Proposition 7.41 p166] imply that Γ1∈A(X×Y)=A(B(X)⊗B(Y))⊂A(Bc(X)⊗B(Y)) and Γ2∈Bc(X)⊗B(Y)⊂A(Bc(X)⊗B(Y)) and thus Γ1∩Γ2∈A(Bc(X)⊗B(Y)).
*Lemma 3.7 implies that the NA(PT) condition holds true and Lemma 3.2 shows that the NA(QT) is satisfied.
*Step 2: Direct implication.
*Theorem 3.30 implies that there exists some P∗∈QT with the fixed disintegration P∗:=P1∗⊗p2∗⊗⋯⊗pT∗ such that \mboxAff(DP∗t+1)(ωt)=\mboxAff(Dt+1)(ωt) and 0∈\mboxRi(\mboxConv(DP∗t+1))(ωt)
for all ωt∈ΩNAt and all 0≤t≤T−1.
The direct implication holds true if i), ii) and iii) below are proved111111Note that i) and ii) are true if we only assume that P∗∈QT..
i) Pt⊂Qt for all 1≤t≤T.
This follows by induction from (10), pt+1∗(⋅,ωt)∈Qt+1(ωt) and the convexity of Qt+1(ωt).
ii) Qt and Pt have the same polar-sets for all 1≤t≤T.
Fix some 1≤t≤T. As Pt⊂Qt, it is clear that a Qt-polar set is also a Pt-polar set.
To establish the other inclusion, we prove by induction that for all 1≤t≤T and all Qt∈Qt, there exists some (λ1t,⋯,λ2tt)∈(0,1]2t such that ∑i=12tλit=1 and some (Rit)3≤i≤2t⊂Qt (if t≥2) such that
[TABLE]
For t=1, let Q1∈Q1 and P1:=(P1∗+Q1)/2. Then, Q1<<P1 and P1∈P1, see (10). Now assume that the property is true for some t≥1. Let
Qt+1∈Qt+1 with the fixed disintegration Qt+1:=Qt⊗qt+1 where
Qt∈Qt and qt+1(⋅,ωt)∈Qt+1(ωt) for all ωt∈Ωt. Then, there exists some (Rit)3≤i≤2t⊂Qt, (λ1t,⋯,λ2tt)∈(0,1]2t such that (47) holds true. Let
[TABLE]
Then Pt+1∈Pt+1 (see (10)), (Rit+1)3≤i≤2(t+1)⊂Qt+1,∑i=12(t+1)λit+1=1 and
[TABLE]
As Qt+1<<Pt+1, the induction is proven.
iii) The sNA(PT) condition holds true.
Fix some P∈PT⊂QT, some 0≤t≤T−1 and ωt∈ΩNAt. We establish that 0∈\mboxRi(\mboxConv(DPt+1))(ωt). Then Pt(ΩNAt)=1 and Proposition 3.26 shows that NA(P) holds true and iii) follows.
Remark 2.5 and (10) imply that DP∗t+1(ωt)⊂DPt+1(ωt)⊂Dt+1(ωt). Thus, 0∈\mboxConv(DP∗t+1)(ωt)⊂\mboxConv(DPt+1)(ωt). We have that
[TABLE]
As 0∈\mboxRi(\mboxConv(DP∗t+1))(ωt), there exists some ε>0 such that
Theorem 3.30 implies that there exists some P∗∈QT with the fixed disintegration P∗=P1∗⊗p2∗⊗⋯⊗pT∗ such that \mboxAff(DP∗t+1)(ωt)=\mboxAff(Dt+1)(ωt) and 0∈\mboxRi(\mboxConv(DP∗t+1))(ωt) for all ωt∈ΩNAt and all 0≤t≤T−1.
To find a Bc(Ωt)-measurable version of βt and κt in (20) we follow the same idea as in [Blanchard et al., 2018, Proposition 3.7]. Fix some 0≤t≤T−1. Set nt(ωt):=inf{n≥1,AnP∗(ωt)=∅} where for all n≥1AnP∗(ωt)=∅ if ωt∈/ΩNAt and if ωt∈ΩNAt,
[TABLE]
For all ωt∈Ωt, as in the proof of Proposition 5.7, nt(ωt)<∞ and one may set κt(ωt)=βt(ωt):=1/nt(ωt)∈(0,1).
Then, by definition of AnP∗, (20) is true with Ph(⋅)=pt+1∗(⋅,ωt)∈Qt+1(ωt) since \mboxAff(DP∗t+1)(ωt)=\mboxAff(Dt+1)(ωt) for all ωt∈ΩNAt.
To prove that κt=βt is Bc(Ωt)-measurable, we show that {AnP∗=∅}∈Bc(Ωt) since for all k≥1,
[TABLE]
Fix some n≥1. As pt+1∗ is only universally-measurable, we use Lemma 5.10 to prove that {AnP∗=∅}∈Bc(Ωt).
Fix P∈P(Ωt). First, applying [Bertsekas and Shreve, 2004, Lemma 7.28 p173], there exists pt+1P a Borel-measurable stochastic kernel on Ωt+1 given Ωt and ΩPt∈B(Ωt) such that P(ΩPt)=1 and pt+1P(⋅,ωt)=pt+1∗(⋅,ωt) for all ωt∈ΩPt.
Set AnP as in (48) replacing pt+1∗ with pt+1P if ωt∈ΩNAt (and AnP(ωt)=∅ if ωt∈/ΩNAt).
Then
[TABLE]
and it remains to establish that
{AnP=∅}∈Bc(Ωt).
Remark that
[TABLE]
Lemma 2.6 implies that \mboxgraph(\mboxAff(DP∗t+1))∈Bc(Ωt)⊗B(Rd). As (ωt,h,ωt+1)→hΔSt+1(ωt,ωt+1) and pt+1P are Borel-measurable, [Bertsekas and Shreve, 2004, Proposition 7.29 p144] implies that (ωt,h)→pt+1P(hΔSt+1(ωt,⋅)<−1/n,ωt) is B(Ωt)⊗B(Rd)-measurable. Thus, applying the Projection Theorem, \mboxProjΩt(\mboxgraph(AnP))={AnP=∅}∈Bc(Ωt) and the proof is complete.
Lemma 5.10**.**
Let X be a Polish space. Let A⊂X. Assume that for all P∈P(X) there exists some AP∈Bc(X) and some P-full measure set XP∈B(X) such that A∩XP=AP∩XP. Then A∈Bc(X).
Proof.
Fix some P∈P(X). We show that A∈BP(X), the completion of B(X) with respect to P. As this is true for all P∈P(X), A∈Bc(X) will follow.
There exists AP∈Bc(X) and XP∈B(X) such that P(XP)=1 and A∩XP=AP∩XP. As AP∩XP∈Bc(Ωt)⊂BP(X) there exists a P-negligible set NP and A~P∈B(X) such that AP∩XP=A~P∪NP. Now, let MP:=A∩(X\XP)⊂X\XP. As X\XP∈B(X) and P(X\XP)=0, MP is a P-negligible set and
Lemma 3.7 implies that NA(P) and NA(QT) are equivalent.
Fix some disintegration of P∈QT,P:=P1⊗p2⊗⋯⊗pT and some 1≤t≤T. As Pt dominates Qt
Proposition 3.26 implies that
[TABLE]
Lemma 5.12 below provides a Qt-full measure set Ωt\Ωndt such that pt+1(⋅,ωt) dominates Qt+1(ωt) for all ωt∈Ωt\Ωndt. Thus Dt+1(ωt)⊂DPt+1(ωt) and the equality follows from (7) as P∈QT.
The proof of Proposition 4.1 follows directly from Lemma 5.12. Indeed assume that the set QT is dominated. As ΩNt⊂Ωndt, ΩNt is a Qt-polar set which contradicts Pt(ΩNt)>0.
The proof of Lemma 5.12 is fairly technical and needs the introduction of the Wijsman topology as well as Lemma
5.11. Note that the reverse implication in Proposition 4.1 seems intuitive but raises challenging technical issues.
Let (X,d) be a Polish space and F be the set of non-empty closed subsets of X. The Wijsman topology on F denoted by TW is such that
[TABLE]
where d(x,F):=inf{d(x,f),f∈F}.
Note that F endowed with TW is a Polish space (see [Beer, 1991]).
Lemma 5.11**.**
The function (F,x)∈F×X→1F(x) is B(F)⊗B(X)-measurable.
Proof.
The function d:(x,F)∈X×F→d(x,F) is separately continuous.
Indeed for all fixed x∈X, d(x,⋅) is continuous by definition of TW and [Aliprantis and Border, 2006, Theorem 3.16] implies that d(⋅,F) is continuous for all fixed F∈F. Using [Aliprantis and Border, 2006, Lemma 4.51 p153] d is B(X)⊗B(F)-measurable. We conclude since
x∈F if and only if d(x,F)=0.
Lemma 5.12**.**
Assume that Assumption 2.2 holds true and that QT is dominated by P∈P(ΩT) with the fix disintegration P:=P0⊗p1⊗⋯⊗pT where p^t∈SKt for all 1≤t≤T. Then
[TABLE]
and is a Qt-polar set for all 0≤t≤T−1.
Proof.
Fix some 0≤t≤T−1. We proceed in two steps.
*Step 1: Ωndt∈Bc(Ωt).
*To prove Step 1, we use Lemma 5.10 and fix R∈P(Ωt).
Applying [Bertsekas and Shreve, 2004, Lemma 7.28 p174], there exists pt+1R a Borel-measurable stochastic kernel on Ωt+1 given Ωt and a R-full-measure set ΩRt∈B(Ωt) such that
[TABLE]
Let Ft+1 be the set of non-empty and closed subsets of Ωt+1 and let NtR:Ωt↠P(Ωt+1)×Ft+1 be defined for all ωt∈Ωt by
[TABLE]
We first claim that
[TABLE]
Let ωt∈Ωndt∩ΩRt. As Qt+1(ωt) is not dominated by pt+1(⋅,ωt)=pt+1R(⋅,ωt), there exists some q∈Qt+1(ωt) and some A∈B(Ωt) such that pt+1R(A,ωt)=0 and q(A)>0. As q∈P(Ωt+1) is inner-regular (see [Aliprantis and Border, 2006, Definition 12.2 p435, Theorem 12.7 p438, Lemma 12.3 p435]), there exists some F∈Ft+1, F⊂A such that q(F)>0 and (q,F)∈NtR(ωt) follows. The reverse inclusion is clear.
Thus Lemma 5.10 applies and Step 1 is completed if
{NtR=∅}=\mboxProjΩt(\mboxgraph(NtR))∈Bc(Ωt).
This will follows from Jankov-von Neumann Theorem (see [Bertsekas and Shreve, 2004, Proposition 7.49 p182]) if
[TABLE]
This follows from \mboxgraph(NtR)=A∩B∩C where
[TABLE]
see Assumption 2.2 for the measurability of A. For B and C, Lemma 5.11 together with [Bertsekas and Shreve, 2004, Proposition 7.29 p144] imply that (ωt,q,F)→pt+1R(F,ωt) and
(ωt,q,F)→q(F) are Borel-measurables (recall that pt+1R(dωt+1∣ωt,q,F)=pt+1R(dωt+1,ωt)
and q(dωt+1∣ωt,q,F)=q(dωt+1) are Borel-measurable stochastic kernels).
*Step 2: Ωndt is a Qt-polar set.
*We proceed by contradiction and assume that there exists some P∈QT such that Pt(Ωndt)>0.
We choose R=Pt in (49) and (50) and we denote by
[TABLE]
see (51) and Step 1.
The Jankov-von Neumann Theorem and (52) also give the existence of qt+1P a universally-measurable stochastic kernel on Ωt+1 given Ωt and a universally measurable function Ft+1P:Ωt→Ft+1 such that (qt+1P(⋅,ωt),Ft+1P(ωt))∈NtPt(ωt) for all ωt∈Ωnd1t. For ωt∈/Ωnd1t we set Ft+1P(ωt)=∅ and qt+1P(⋅,ωt)=qt+1(⋅,ωt) where qt+1 is a given universally-measurable selector of Qt+1.
Note that as Pt dominates Qt, 1=Pt(ΩPtt)=Pt(ΩPtt) and Pt(Ωnd1t)>0.
We now build some Q∈QT, E∈Bc(Ωt+1) such that Pt+1(E)=0 but Qt+1(E)>0
which contradicts the fact that P dominates QT.
Let
[TABLE]
Lemma 5.11 implies that (F,ωt+1)→1F(ωt+1) is B(Ft+1)⊗B(Ωt+1)-measurable and as (ωt,ωt+1)→(Ft+1P(ωt),ωt+1) is Bc(Ωt+1)-measurable, φ
is Bc(Ωt+1)-measurable by composition. Thus E belong to Bc(Ωt+1).
Let (E)ωt:={ωt+1∈Ωt+1,(ωt,ωt+1)∈E}, then
[TABLE]
where we have used that for ωt∈/Ωnd1t(E)ωt=∅ and for ωt∈Ωnd1t(E)ωt=Ft+1P(ωt) and that pt+1(Ft+1P(ωt),ωt)=pt+1Pt(Ft+1P(ωt),ωt)=0. But
[TABLE]
since Pt(Ωnd1t)>0 and qt+1P(Ft+1P(ωt),ωt)>0 for all ωt∈Ωnd1t. This concludes the proof.
Bibliography52
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1Acciaio et al. [2013] B. Acciaio, M. Beiglbock, 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, 2013.
2Aksamit et al. [2018] A. Aksamit, S.Deng, J. Oblój, and X. Tan. The robust pricing–hedging duality for american options in discrete time financial markets. Mathematical Finance , Published Online, 2018.
3Aliprantis and Border [2006] C. D. Aliprantis and K. C. Border. Infinite Dimensional Analysis : A Hitchhiker’s Guide . Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer-Verlag, Berlin, 3rd edition, 2006.
4Artstein [1972] Z. Artstein. Set-valued measures. Transaction of the American Mathematical society , 165, 1972.
5Bartl [2019 a] D. Bartl. Exponential utility maximization under model uncertainty for unbounded endowments. Annals of Applied Probability , 29(1):577–612, 2019 a.
6Bartl [2019 b] D. Bartl. Conditional nonlinear expectations. Stochastic Processes and their Applications , 2019 b.
7Bartl et al. [2019] 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.
8Bayraktar and Zhou [2017] E. Bayraktar and Z. Zhou. On arbitrage and duality under model uncertainty and portfolio constraints. Mathematical Finance , 27(4):998–1012, 2017.