This paper extends the irreducible decomposition of martingale transport plans from one dimension to higher dimensions, providing a convex partition of R^d and analyzing the structure of polar sets.
Contribution
It introduces a convex decomposition for martingale transport plans in R^d, generalizing the one-dimensional case and establishing the existence of plans filling these components.
Findings
01
Decomposition into convex components in R^d
02
Existence of martingale plans for each component
03
Characterization of polar sets with respect to martingale plans
Abstract
Martingale transport plans on the line are known from Beiglbock & Juillet to have an irreducible decomposition on a (at most) countable union of intervals. We provide an extension of this decomposition for martingale transport plans in R^d, d larger than one. Our decomposition is a partition of R^d consisting of a possibly uncountable family of relatively open convex components, with the required measurability so that the disintegration is well-defined. We justify the relevance of our decomposition by proving the existence of a martingale transport plan filling these components. We also deduce from this decomposition a characterization of the structure of polar sets with respect to all martingale transport plans.
Equations307
F−(V):={x∈Rd:F(x)∩V=∅}
F−(V):={x∈Rd:F(x)∩V=∅}
X:(x,y)∈Ω⟼x∈Rd
X:(x,y)∈Ω⟼x∈Rd
φ⊕ψ:=φ(X)+ψ(Y),
φ⊕ψ:=φ(X)+ψ(Y),
P[f]:=EP[f]=∫XfdP=∫Xf(x)P(dx)
P[f]:=EP[f]=∫XfdP=∫Xf(x)P(dx)
P(dx,dy)=μ(dx)⊗Px(dy), where μ:=P∘X−1.
P(dx,dy)=μ(dx)⊗Px(dy), where μ:=P∘X−1.
\partial f:=\big{\{}p\in\mathbb{L}^{0}(\mathbb{R}^{d},\mathbb{R}^{d}):p(x)\in\partial f(x)\text{ for all }x\in\mathbb{R}^{d}\big{\}}.
\partial f:=\big{\{}p\in\mathbb{L}^{0}(\mathbb{R}^{d},\mathbb{R}^{d}):p(x)\in\partial f(x)\text{ for all }x\in\mathbb{R}^{d}\big{\}}.
\displaystyle\left(I^{BJ},J^{BJ}\right):x\mapsto\begin{cases}(I_{k},J_{k})&\mbox{if }x\in I_{k},\mbox{ for some }k\geq 1,\\
\big{(}\{x\},\{x\}\big{)}&\mbox{if }x\notin\cup_{k}I_{k}.\end{cases}
\displaystyle\left(I^{BJ},J^{BJ}\right):x\mapsto\begin{cases}(I_{k},J_{k})&\mbox{if }x\in I_{k},\mbox{ for some }k\geq 1,\\
\big{(}\{x\},\{x\}\big{)}&\mbox{if }x\notin\cup_{k}I_{k}.\end{cases}
JBJ(X)⊂conv(JBJ(X)∖Nν),
JBJ(X)⊂conv(JBJ(X)∖Nν),
{\rm rf}_{a}A:=\big{\{}y\in A:(a-\varepsilon(y-a),y+\varepsilon(y-a))\subset A,\text{ for some }\varepsilon>0\big{\}}.
{\rm rf}_{a}A:=\big{\{}y\in A:(a-\varepsilon(y-a),y+\varepsilon(y-a))\subset A,\text{ for some }\varepsilon>0\big{\}}.
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
Irreducible Convex Paving for Decomposition of Multi-dimensional Martingale Transport Plans
Nizar Touzi
[email protected].
CMAP, École Polytechnique, France††thanks: The authors gratefully acknowledge the financial support of the ERC 321111 Rofirm, and the Chairs Financial Risks (Risk Foundation, sponsored by Société Générale) and Finance and Sustainable Development (IEF sponsored by EDF and CA).
Abstract
: Martingale transport plans on the line are known from Beiglböck & Juillet [3] to have an irreducible decomposition on a (at most) countable union of intervals. We provide an extension of this decomposition for martingale transport plans in Rd, d≥1. Our decomposition is a partition of Rd consisting of a possibly uncountable family of relatively open convex components, with the required measurability so that the disintegration is well-defined. We justify the relevance of our decomposition by proving the existence of a martingale transport plan filling these components. We also deduce from this decomposition a characterization of the structure of polar sets with respect to all martingale transport plans.
The problem of martingale optimal transport was introduced as the dual of the problem of robust (model-free) superhedging of exotic derivatives in financial mathematics, see Beiglböck, Henry-Labordère & Penkner [2] in discrete time, and Galichon, Henry-Labordère & Touzi [9] in continuous-time. The robust superhedging problem was introduced by Hobson [14], and was addressing specific examples of exotic derivatives by means of corresponding solutions of the Skorohod embedding problem, see [6, 15, 16], and the survey [14].
Given two probability measures μ,ν on Rd, with finite first order moment, martingale optimal transport differs from standard optimal transport in that the set of all coupling probability measures P(μ,ν) on the product space is reduced to the subset M(μ,ν) restricted by the martingale condition. We recall from Strassen [20] that M(μ,ν)=∅ if and only if μ⪯ν in the convex order, i.e. μ(f)≤ν(f) for all convex functions f. Notice that the inequality μ(f)≤ν(f) is a direct consequence of the Jensen inequality, the reverse implication follows from the Hahn-Banach theorem.
This paper focuses on the critical observation by Beiglböck & Juillet [3] that, in the one-dimensional setting d=1, any such martingale interpolating probability measure P has a canonical decomposition P=∑k≥0Pk, where Pk∈M(μk,νk) and μk is the restriction of μ to the so-called irreducible components Ik, and νk:=∫x∈IkP(dx,⋅), supported in Jk, k≥0, is independent of the choice of Pk. Here, (Ik)k≥1 are open intervals, I0:=R∖(∪k≥1Ik), and Jk is an augmentation of Ik by the inclusion of either one of the endpoints of Ik, depending on whether they are charged by the distribution Pk. Remarkably, the irreducible components (Ik,Jk)k≥0 are independent of the choice of P∈M(μ,ν). To understand this decomposition, notice that convex functions in one dimension are generated by the family fx0(x):=∣x−x0∣,x0∈R, x0∈R. Then, in terms of the potential functions Uμ(x0):=μ(fx0), and Uν(x0):=ν(fx0), x0∈R, we have μ⪯ν if and only if Uμ≤Uν and μ,ν have same mean. Then, at any contact points x0, of the potential functions, Uμ(x0)=Uν(x0), we have equality in the underlying Jensen equality, which means that the singularity x0 of the underlying function fx0 is not seen by the measure. In other words, the point x0 acts as a barrier for the mass transfer in the sense that martingale transport maps do not cross the barrier x0. Such contact points are precisely the endpoints of the intervals Ik, k≥1.
The decomposition in irreducible components plays a crucial role for the quasi-sure formulation introduced by Beiglböck, Nutz, and Touzi [4], and represents an important difference between martingale transport and standard transport. Indeed, while the martingale transport problem is affected by the quasi-sure formulation, the standard optimal transport problem is not changed. We also refer to Ekren & Soner [8] for further functional analytic aspects of this duality.
Our objective in this paper is to extend the last decomposition to an arbitrary d−dimensional setting, d≥1. The main difficulty is that convex functions do not have anymore such a simple generating family. Therefore, all of our analysis is based on the set of convex functions. A first extension of the last decomposition to the multi-dimensional case was achieved by Ghoussoub, Kim & Lim [10]. Motivated by the martingale monotonicity principle of Beiglböck & Juillet [3] (see also Zaev [22] for higher dimension and general linear constraints), their strategy is to find a monotone set Γ⊂Rd×Rd, where the robust superhedging holds with equality, as a support of the optimal martingale transport in M(μ,ν). Denoting Γx:={y:(x,y)∈Γ}, this naturally induces the relation x\mboxRelx′ if x∈riconv(Γx′), which is then completed to an equivalence relation ∼. The corresponding equivalence classes define their notion of irreducible components.
Our subsequent results differ from [10] from two perspectives. First, unlike [10], our decomposition is universal in the sense that it is not relative to any particular martingale measure in M(μ,ν) (see example 2.2). Second, our construction of the irreducible convex paving allows to prove the required measurability property, thus justifying completely the existence of a disintegration of martingale plans.
Finally, during the final stage of writing the present paper, we learned about
the parallel work by Jan Obłój and Pietro Siorpaes [18].
Although the results are close, our approach is different from theirs.
We are grateful to them for pointing to us the notions of "convex
face" and "Wijsmann topology" and the relative references, which allowed us to streamline our presentation.
In an earlier version of this work we used instead a topology that we called the compacted Hausdorff distance, defined as the topology generated by the countable restrictions of the space to the closed balls centered in the origin with integer radii; the two are in our case the same topologies, as the Wijsman topology is locally equivalent to the Hausdorff topology in a locally compact set. We also owe Jan and Pietro special thanks for their useful remarks and comments on a first draft of this paper privately exchanged with them.
The paper is organized as follows. Section 2 contains the main results of the paper, namely our decomposition in irreducible convex paving, and shows the identity with the Beiglböck & Juillet [3] notion in the one-dimensional setting. Section 3 collects the main technical ingredients needed for the statement of our main results, and gives the structure of polar sets. In particular, we introduce the new notions of relative face and tangent convex functions, together with the required topology on the set of such functions. The remaining sections contain the proofs of these results. In particular, the measurability of our irreducible convex paving is proved in Section 7.
Notation We denote by R:=R∪{−∞,∞} the completed real line, and similarly denote R+:=R+∪{∞}. We fix an integer d≥1. For x∈Rd and r≥0, we denote Br(x) the closed ball for the Euclidean distance, centered in x with radius r. We denote for simplicity Br:=Br(0). If x∈X, and A⊂X, where (X,d) is a metric space, dist(x,A):=infa∈Ad(x,a). In all this paper, Rd is endowed with the Euclidean distance.
If V is a topological affine space and A⊂V is a subset of V, intA is the interior of A, clA is the closure of A, affA is the smallest affine subspace of V containing A, convA is the convex hull of A, dim(A):=dim(affA), and riA is the relative interior of A, which is the interior of A in the topology of affA induced by the topology of V. We also denote by ∂A:=clA∖riA the relative boundary of A, and by λA the Lebesgue measure of affA.
The set K of all closed subsets of Rd is a Polish space when endowed with the Wijsman topology111The Wijsman topology on the collection of all closed subsets of a metric space (X,d) is the weak topology generated by {dist(x,⋅):x∈X}. (see Beer [1]). As Rd is separable, it follows from a theorem of Hess [11] that a function F:Rd⟶K is Borel measurable with respect to the Wijsman topology if and only if its associated multifunction is Borel measurable, i.e.
[TABLE]
The subset \wideparenK⊂K of all the convex closed subsets of Rd is closed in K for the Wijsman topology, and therefore inherits its Polish structure. Clearly, \wideparenK is isomorphic to ri\wideparenK:={riK:K∈\wideparenK} (with reciprocal isomorphism cl). We shall identify these two isomorphic sets in the rest of this text, when there is no possible confusion.
We denote Ω:=Rd×Rd and define the two canonical maps
[TABLE]
For φ,ψ:Rd⟶Rˉ, and h:Rd⟶Rd, we denote
[TABLE]
with the convention ∞−∞=∞.
For a Polish space X, we denote by B(X) the collection of Borel subsets of X, and P(X) the set of all probability measures on \big{(}{\cal X},{\cal B}({\cal X})\big{)}. For P∈P(X), we denote by NP the collection of all P−null sets, suppP the smallest closed support of P, and \wideparensuppP:=clconvsuppP the smallest convex closed support of P. For a measurable function f:X⟶R, we denote domf:={∣f∣<∞}, and we use again the convention ∞−∞=∞ to define its integral, and denote
[TABLE]
Let Y be another Polish space, and P∈P(X×Y). The corresponding conditional kernel222The usual definition of a kernel requires that the map x↦Px[B] is Borel measurable for all Borel set B∈B(Rd). In this paper, we only require this map to be analytically measurable. Px is defined μ−a.e. by:
[TABLE]
We denote by L0(X,Y) the set of Borel measurable maps from X to Y. We denote for simplicity L0(X):=L0(X,Rˉ) and L+0(X):=L0(X,Rˉ+). Let A be a σ−algebra of X, we denote by LA(X,Y) the set of A−measurable maps from X to Y. For a measure m on X, we denote L1(X,m):={f∈L0(X):m[∣f∣]<∞}. We also denote simply L1(m):=L1(Rˉ,m) and L+1(m):=L+1(Rˉ+,m).
We denote by C the collection of all finite convex functions f:Rd⟶R. We denote by ∂f(x) the corresponding subgradient at any point x∈Rd. We also introduce the collection of all measurable selections in the subgradient, which is nonempty by Lemma 9.2,
[TABLE]
We finally denote f∞:=liminfn→∞fn, for any sequence (fn)n≥1 of real numbers, or of real-valued functions.
2 Main results
Throughout this paper, we consider two probability measures μ and ν on Rd with finite first order moment, and μ⪯ν in the convex order, i.e. ν(f)≥μ(f) for all f∈C. Using the convention ∞−∞=∞, we may define (ν−μ)(f)∈[0,∞] for all f∈C.
We denote by M(μ,ν) the collection of all probability measures on Rd×Rd with marginals P∘X−1=μ and P∘Y−1=ν. Notice that M(μ,ν)=∅ by Strassen [20].
An M(μ,ν)−polar set is an element of ∩P∈M(μ,ν)NP. A property is said to hold M(μ,ν)−quasi surely (abbreviated as q.s.) if it holds on the complement of an M(μ,ν)−polar set.
2.1 The irreducible convex paving
The next first result shows the existence of a maximum support martingale transport plan, i.e. a martingale interpolating measure P whose disintegration Px has a maximum convex hull of supports among all measures in M(μ,ν).
Theorem 2.1**.**
There exists P∈M(μ,ν) such that
[TABLE]
*Furthermore \wideparensuppPX is μ−a.s. unique, and we may choose this kernel so that
(i)x⟼\wideparensuppPx is analytically measurable333Analytically measurable means measurable with respect to the smallest σ−algebra containing the analytic sets. All Borel sets are analytic and all analytic sets are universally measurable, i.e. measurable with respect to all Borel measures (see Proposition 7.41 and Corollary 7.42.1 in [5]). Rd⟶\wideparenK,
(ii)x∈I(x):=ri\wideparensuppPx, for all x∈Rd, and \big{\{}I(x),x\in\mathbb{R}^{d}\big{\}} is a partition of Rd.*
This Theorem will be proved in Subsection 6.3. The (μ−a.s. unique) set valued map I(X) paves Rd by its image by (ii) of Theorem 2.1. By (2.1), this paving is stable by all P∈M(μ,ν):
[TABLE]
Finally, the measurability of the map I in the Polish space \wideparenK allows to see it as a random variable, which allows to condition probabilistic events to X∈I, even when these components are all μ−negligible when considered apart from the others. Under the conditions of Theorem 2.1, we call such I(X) the irreducible convex paving associated to (μ,ν).
Now we provide an important counterexample proving that for some (μ,ν) in dimension larger than 1, particular couplings in M(μ,ν) may define different pavings.
Example 2.2**.**
In R2, we introduce x0:=(0,0), x1:=(1,0), y0:=x0, y−1:=(0,−1), y1:=(0,1), and y2:=(2,0). Then we set μ:=21(δx0+δx1) and ν:=81(4δy0+δy−1+δy1+2δy2). We can show easily that M(μ,ν) is the nonempty convex hull of P1 and P2 where
[TABLE]
and
[TABLE]
(i) The Ghoussoub-Kim-Lim [10] (GKL, hereafter) irreducible convex paving. Let c1=1{X=Y}, c2=1−c1=1{X=Y}, and notice that Pi is the unique optimal martingale transport plan for ci, i=1,2. Then, it follows that the corresponding Pi−irreducible convex paving according to the definition of [10] are given by
[TABLE]
Figure 1 shows the extreme probabilities P1 and P2, and their associated irreducible convex pavings map CP1 and CP2.
(ii) Our irreducible convex paving. The irreducible components are given by
[TABLE]
To see this, we use the characterization of Proposition 2.4. Indeed, as M(μ,ν)=conv(P1,P2), for any P∈M(μ,ν), P≪P:=2P1+P2, and {\rm supp}\,{\mathbb{P}}_{x}\subset{\rm conv}\big{(}{\rm supp}\,\widehat{\mathbb{P}}_{x}\big{)} for x=x0,x1. Then I(x)={\rm ri}{\rm conv}\big{(}{\rm supp}\,\widehat{\mathbb{P}}_{x}\big{)} for x=x0,x1 (i.e. μ-a.s.) by Proposition 2.4.**
Remark 2.3**.**
In the one dimensional case, a convex paving which is invariant with respect to some P∈M(μ,ν) is automatically invariant with respect to all P∈M(μ,ν). Given a particular coupling P∈M(μ,ν), the finest convex paving which is P−invariant roughly corresponds to the GKL convex paving constructed in [10]. Then Example 2.2 shows that this does not hold any more in dimension greater than two.
Furthermore, in dimension one the "restriction" νI:=∫IP(dx,⋅) does not depend on the choice of the coupling P∈M(μ,ν). Once again Example 2.2 shows that it does not hold in higher dimension. Conditions guaranteeing that this property still holds in higher dimension will be investigated in [HDM2017].
2.2 Behavior on the boundary of the components
For a probability measure P on a topological space, and a Borel subset A, P∣A:=P[⋅∩A] denotes its restriction to A.
Proposition 2.4**.**
We may choose P∈M(μ,ν) in Theorem 2.1 so that for all P∈M(μ,ν) and y∈Rd,
[TABLE]
(i)* The set-valued maps \underline{J}(X):=I(X)\cup\big{\{}y\in\mathbb{R}^{d}:\nu[{y}]>0,\mbox{ and }\widehat{\mathbb{P}}_{X}\big{[}\{y\}\big{]}>0\big{\}}, and Jˉ(X):=I(X)∪\wideparensuppPX∣∂I(X) are unique *μ−*a.s, and Y∈Jˉ(X), *M(μ,ν)−q.s.
(ii)* We may chose the kernel PX so that the map Jˉ is convex valued, I⊂J⊂Jˉ⊂clI, and both J and Jˉ are constant on I(x), for all x∈Rd.*
Here we state the structure of polar sets that is a direct consequence, and will be made more precise by Theorem 3.18.
Theorem 2.5**.**
A Borel set N∈B(Ω) is M(μ,ν)−polar if and only if
[TABLE]
for some (Nμ,Nν)∈Nμ×Nν and a set valued map J such that J⊂J⊂Jˉ, the map J is constant on I(x) for all x∈Rd, I(X)⊂conv(J(X)∖Nν′), μ−a.s. for all Nν′∈Nν, and Y∈J(X), M(μ,ν)−q.s.
2.4 The one-dimensional setting
In the one-dimensional case, the decomposition in irreducible components and the structure of M(μ,ν)−polar sets were introduced in Beiglböck & Juillet [3] and Beiglböck, Nutz & Touzi [4], respectively.
Let us see how the results of this paper reduce to the known concepts in the one dimensional case. First, in the one-dimensional setting, I(x) consists of open intervals (at most countable number) or single points. Following [3] Proposition 2.3, we denote the full dimension components (Ik)k≥1.
We also have J=Jˉ (see Proposition 2.6 below) therefore, Theorem 2.5 is equivalent to Theorem 3.2 in [4]. Similar to (Ik)k≥1, we introduce the corresponding sequence (Jk)k≥1, as defined in [4]. Similar to [3], we denote by μk the restriction of μ to Ik, and νk:=∫x∈IkP[dx,⋅] is independent of the choice of P∈M(μ,ν). We define the Beiglböck & Juillet (BJ)-irreducible components
[TABLE]
Proposition 2.6**.**
Let d=1. Then I=IBJ, and Jˉ=J=JBJ, μ−a.s.
**Proof. **By Proposition 2.4 (i)-(ii), we may find P∈M(μ,ν) such that
\wideparensuppPX=clI(X), and \wideparensuppPX∣∂I(X)=Jˉ∖I(X), μ−a.s. Notice that as Jˉ∖I(Rd) only consists of a countable set of points, we have J=Jˉ. By Theorem 3.2 in [4], we have Y∈JBJ(X), M(μ,ν)−q.s. Therefore, Y∈JBJ(X), P−a.s. and we have Jˉ(X)⊂JBJ(X), μ−a.s.
On the other hand, let k≥1. By the fact that uν−uμ>0 on Ik, together with the fact that Jk∖Ik is constituted with atoms of ν, for any Nν∈Nν, Jk⊂conv(Jk∖Nν). As μ=ν outside of the components,
[TABLE]
Then by Theorem 3.2 in [4], as {Y∈/Jˉ(X)} is polar, we may find Nν∈Nν such that JBJ(X)∖Nν⊂Jˉ(X), μ−a.s. The convex hull of this inclusion, together with (2.3) gives the remaining inclusion JBJ(X)⊂Jˉ(X), μ−a.s.
The equality I(X)=IBJ(X), μ−a.s. follows from the relative interior taken on the previous equality.
□
3 Preliminaries
The proof of these results needs some preparation involving convex analysis tools.
3.1 Relative face of a set
For a subset A⊂Rd and a∈Rd, we introduce the face of A relative to a (also denoted a−relative face of A):
[TABLE]
Figure 2 illustrates examples of relative faces of a square S, relative to some points.
For later use, we list some properties whose proofs are reported in Section 9.
444
rfaA is equal to the only relative interior of face of A containing a, where we extend the notion of face to non-convex sets. A face F of A is a nonempty subset of A such that for all [a,b]⊂A, with (a,b)∩F=∅, we have [a,b]⊂F. It is discussed in Hiriart-Urruty-Lemaréchal [13] as an extension of Proposition 2.3.7 that when A is convex, the relative interior of the faces of A form a partition of A, see also Theorem 18.2 in Rockafellar [19].
Proposition 3.1**.**
(i)* For A,A′⊂Rd, we have rfa(A∩A′)=rfa(A)∩rfa(A′), and rfaA⊂rfaA′ whenever A⊂A′. Moreover, rfaA=∅ iff a∈rfaA iff a∈A.
(ii) For a convex A, rfaA=riA=∅ iff a∈riA. Moreover, rfaA is convex relatively open, A∖clrfaA is convex, and if x0∈A∖clrfaA and y0∈A, then [x0,y0)⊂A∖clrfaA. Furthermore, if a∈A, then dim(rfaclA)=dim(A) if and only if a∈riA. In this case, we have clrfaclA=clriclA=clA=clrfaA.*
3.2 Tangent Convex functions
Recall the notation (3.1), and denote for all θ:Ω→Rˉ:
[TABLE]
For θ1,θ2:Ω⟶R, we say that θ1=θ2, μ⊗pw, if
[TABLE]
The crucial ingredient for our main result is the following.
Definition 3.2**.**
A measurable function θ:Ω→R+ is a tangent convex function if
[TABLE]
We denote by Θ the set of tangent convex functions, and we define
[TABLE]
In order to introduce our main example of such functions, let
[TABLE]
Then, T(C):={Tpf:f∈C,p∈∂f}⊂Θ⊂Θμ.
Example 3.3**.**
The second inclusion is strict. Indeed, let d=1, and consider the convex function f:=∞1(−∞,0). Then θ′:=f(Y−X)∈Θ. Now let θ=θ′+∣Y−X∣. Notice that since domXθ′=domXθ={X}, we have θ′=θ, μ⊗pw for any measure μ, and θ≥θ′. Therefore θ∈Θμ. However, for all x∈Rd, θ(x,⋅) is not convex, and therefore θ∈/Θ.
In higher dimension we may even have X∈ridomθ(X,⋅), and θ(X,⋅) is not convex. Indeed, for d=2, let f:(y1,y2)⟼∞(1{∣y1∣>1}+1{∣y2∣>1}), so that θ:=f(Y−X)∈Θ. Let x0:=(1,0) and θ:=θ′+1{Y=X+x0}. Then, θ=θ′, μ⊗pw for any measure μ, and θ≥θ′. Therefore θ∈Θμ. However, θ∈/Θ as θ(x,⋅) is not convex for all x∈Rd.
Proposition 3.4**.**
(i)* Let θ∈Θμ, then domXθ=rfXdomθ(X,⋅)⊂domθ(X,⋅), μ−a.s.
(ii) Let θ1,θ2∈Θμ, then domX(θ1+θ2)=domXθ1∩domXθ2, μ−a.s.
(iii)Θμ is a convex cone.*
Proof. (i) It follows immediately from the fact that θ(X,⋅) is convex and finite on domXθ, μ−a.s. by definition of Θμ. Then domXθ⊂rfXdomθ(X,⋅). On the other hand, as domθ(X,⋅)⊂convdomθ(X,⋅), the monotony of rfx gives the other inclusion: rfXdomθ(X,⋅)⊂domXθ.
(ii) As θ1,θ2≥0, dom(θ1+θ2)=domθ1∩domθ2. Then, for x∈Rd, convdom(θ1(x,⋅)+θ2(x,⋅))⊂convdomθ1(x,⋅)∩convdomθ2(x,⋅). By Proposition 3.1 (i),
[TABLE]
As for the reverse inclusion, notice that (i) implies that {\rm dom}_{X}\theta_{1}\cap{\rm dom}_{X}\theta_{2}\subset{\rm dom}\theta_{1}(X,\cdot)\cap{\rm dom}\theta_{2}(X,\cdot)={\rm dom}\big{(}\theta_{1}(X,\cdot)+\theta_{2}(X,\cdot)\big{)}\subset{\rm conv}\,{\rm dom}\big{(}\theta_{1}(X,\cdot)+\theta_{2}(X,\cdot)\big{)}, μ−a.s. Observe that domxθ1∩domxθ2 is convex, relatively open, and contains x. Then,
[TABLE]
(iii) Given (ii), this follows from direct verification.
□
Definition 3.5**.**
A sequence (θn)n≥1⊂L0(Ω) converges μ⊗pw to some θ∈L0(Ω) if
[TABLE]
Notice that the μ⊗pw-limit is μ⊗pw unique. In particular, if θn converges to θ, μ⊗pw, it converges as well to θ∞.
Proposition 3.6**.**
*Let (θn)n≥1⊂Θμ, and θ:Ω⟶Rˉ+, such that θnn→∞⟶θ, μ⊗pw,
(i)domXθ⊂liminfn→∞domXθn, μ−a.s.
(ii) If θn′=θn, μ⊗pw, and θn′≥θn, then θn′n→∞⟶θ, μ⊗pw;
(iii)θ∞∈Θμ.*
Proof. (i) Let x∈Rd, such that θn(x,⋅) converges on domxθ to θ(x,⋅). Let y∈domxθ, let y′∈domxθ such that y′=x−ϵ(y−x), for some ϵ>0. As θn(x,y)n→∞⟶θ(x,y), and θn(x,y′)n→∞⟶θ(x,y′), then for n large enough, both are finite, and y∈domxθn. y∈liminfn→∞domxθn, and domxθ⊂liminfn→∞domxθn. The inclusion is true for μ−a.e. x∈Rd, which gives the result.
(ii) By (i), we have domXθ⊂liminfn→∞domXθn=liminfn→∞domXθn′, μ−a.s. As θn≤θn′, domXθ′∞⊂domXθ∞⊂liminfn→∞domXθn, μ−a.s. We denote Nμ∈Nμ, the set on which θn(X,⋅) does not converge to θ(X,⋅) on domXθ(X,⋅). For x∈/Nμ, for y∈domxθ, θn(x,y)=θn′(x,y), for n large enough, and θn′(x,y)n→∞⟶θ(x,y)<∞. Then domXθ=domXθ′∞, and θn′(X,⋅) converges to θ(X,⋅), on domXθ, μ−a.s. We proved that θn′n→∞⟶θ, μ⊗pw.
(iii) has its proof reported in Subsection 8.2 due to its length and technicality.
□
The next result shows the relevance of this notion of convergence for our setting.
Proposition 3.7**.**
Let (θn)n≥1⊂Θμ. Then, we may find a sequence θn∈conv(θk,k≥n), and θ∞∈Θμ such that θn⟶θ∞, μ⊗pw as n→∞.
(i)* A subset T⊂Θμ is μ⊗pw-Fatou closed if θ∞∈T for all (θn)n≥1⊂T converging μ⊗pw (in particular, Θμ is μ⊗pw−Fatou closed by Proposition 3.6(iii)).
(ii) The μ⊗pw−Fatou closure of a subset A⊂Θμ is the smallest μ⊗pw−Fatou closed set containing A:*
[TABLE]
We next introduce for a≥0 the set {\mathfrak{C}}_{a}:=\big{\{}f\in{\mathfrak{C}}:(\nu-\mu)(f)\leq a\big{\}}, and
[TABLE]
Proposition 3.9**.**
T(μ,ν)* is a convex cone.*
**Proof. **We first prove that T(μ,ν) is a cone. We consider λ,a>0, as we have λCa=Cλa, and as convex combinations and inferior limit commute with the multiplication by λ, we have λTa=Tλa. Then T(μ,ν)=cone(T1), and therefore it is a cone.
We next prove that Ta is convex for all a≥0, which induces the required convexity of T(μ,ν) by the non-decrease of the family {Ta,a≥0}. Fix 0≤λ≤1, a≥0, θ0∈Ta, and denote {\cal T}(\theta_{0}):=\big{\{}\theta\in\widehat{{\cal T}}_{a}:\lambda\theta_{0}+(1-\lambda)\theta\in\widehat{{\cal T}}_{a}\big{\}}. In order to complete the proof, we now verify that {\cal T}(\theta_{0})\supset{\mathbf{T}}\big{(}{\mathfrak{C}}_{a}\big{)} and is μ⊗pw−Fatou closed, so that T(θ0)=Ta.
To see that T(θ0) is Fatou-closed, let (θn)n≥1⊂T(θ0), converging μ⊗pw. By definition of T(θ0), we have λθ0+(1−λ)θn∈Ta for all n. Then, λθ0+(1−λ)θn⟶liminfn→∞λθ0+(1−λ)θn, μ⊗pw, and therefore λθ0+(1−λ)θ∞∈Ta, which shows that θ∞∈T(θ0).
We finally verify that {\cal T}(\theta_{0})\supset{\mathbf{T}}\big{(}{\mathfrak{C}}_{a}\big{)}. First, for \theta_{0}\in{\mathbf{T}}\big{(}{\mathfrak{C}}_{a}\big{)}, this inclusion follows directly from the convexity of {\mathbf{T}}\big{(}{\mathfrak{C}}_{a}\big{)}, implying that T(θ0)=Ta in this case. For general θ0∈Ta, the last equality implies that {\mathbf{T}}\big{(}{\mathfrak{C}}_{a}\big{)}\subset{\cal T}(\theta_{0}), thus completing the proof.
□
Notice that even though T(Ca)⊂Θ, the functions in T(μ,ν) may not be in Θ as they may not be convex in y on (domxθ)c for some x∈Rd (see Example 3.3). The following result shows that some convexity is still preserved.
Proposition 3.10**.**
For all θ∈T(μ,ν), we may find Nμ∈Nμ such that for x1,x2∈/Nμ, y1,y2∈Rd, and λ∈[0,1] with yˉ:=λy1+(1−λ)y2∈domx1θ∩domx2θ, we have:
[TABLE]
The proof of this claim is reported in Subsection 8.1. We observe that the statement also holds true for a finite number of points y1,...,yk.555
This is not a direct consequence of Proposition 3.10, as the barycentre yˉ has to be in domx1θ∩domx2θ.
3.3 Extended integral
We now introduce the extended (ν−μ)−integral:
[TABLE]
Proposition 3.11**.**
(i)* P[θ]≤ν⊖μ[θ]<∞ for all θ∈T(μ,ν) and P∈M(μ,ν).
(ii)ν⊖μ[Tpf]=(ν−μ)[f] for f∈C∩L1(ν) and p∈∂f.
(iii)ν⊖μ is homogeneous and convex.*
Proof. (i) For a>ν⊖μ[θ], set S^{a}:=\big{\{}F\in\Theta_{\mu}:{\mathbb{P}}[F]\leq a\leavevmode\nobreak\ \mbox{for all}\leavevmode\nobreak\ {\mathbb{P}}\in{\cal M}(\mu,\nu)\big{\}}. Notice that Sa is μ⊗pw−Fatou closed by Fatou’s lemma, and contains T(Ca), as for f∈C∩L1(ν) and p∈∂f, P[Tpf]=(ν−μ)[f] for all P∈M(μ,ν). Then Sa contains Ta as well, which contains θ. Hence, θ∈Sa and P[θ]≤a for all P∈M(μ,ν). The required result follows from the arbitrariness of a>ν⊖μ[θ].
(ii) Let P∈M(μ,ν). For p∈∂f, notice that Tpf∈T(Ca)⊂Ta for some a=(ν−μ)[f], and therefore (ν−μ)[f]≥ν⊖μ[Tpf]. Then, the result follows from the inequality (ν−μ)[f]=P[Tpf]≤ν⊖μ[Tpf].
(iii) Similarly to the proof of Proposition 3.9, we have λTa=Tλa, for all λ,a>0. Then with the definition of ν⊖μ we have easily the homogeneity.
To see that the convexity holds, let 0<λ<1, and θ,θ′∈T(μ,ν) with a>ν⊖μ[θ], a′>ν⊖μ[θ′], for some a,a′>0. By homogeneity and convexity of T1, λθ+(1−λ)θ′∈Tλa+(1−λ)a′, so that ν⊖μ[λθ+(1−λ)θ′]≤λa+(1−λ)a′. The required convexity property now follows from arbitrariness of a>ν⊖μ[θ] and a′>ν⊖μ[θ′].
□
The following compacteness result plays a crucial role.
Lemma 3.12**.**
Let (θn)n≥1⊂T(μ,ν) be such that
supn≥1ν⊖μ(θn)<∞.
Then we can find a sequence θn∈conv(θk,k≥n) such that
[TABLE]
**Proof. **By possibly passing to a subsequence, we may assume that limn→∞(ν⊖μ)(θn) exists. The boundedness of ν⊖μ(θn) ensures that this limit is finite. We next introduce the sequence θn of Proposition 3.7. Then θn⟶θ∞, μ⊗pw, and therefore θ∞∈T(μ,ν), because of the convergence θn⟶θ∞, μ⊗pw. As (ν⊖μ)(θn)≤supk≥n(ν⊖μ)(θk) by Proposition 3.11 (iii), we have ∞>limn→∞(ν⊖μ)(θn)=limn→∞supk≥n(ν⊖μ)(θk)≥limsupn→∞(ν⊖μ)(θn). Set l:=limsupn→∞ν⊖μ(θn). For ϵ>0, we consider n0∈N such that supk≥n0ν⊖μ(θk)≤l+ϵ. Then for k≥n0, θk∈Tl+2ϵ(μ,ν), and therefore θ∞=liminfk≥n0θk∈Tl+2ϵ(μ,ν), implying ν⊖μ(θ)≤l+2ϵ⟶l, as ϵ→0. Finally, liminfn→∞(ν⊖μ)(θn)≥ν⊖μ(θ∞).
□
3.4 The dual irreducible convex paving
Our final ingredient is the following measurement of subsets K⊂Rd:
[TABLE]
Notice that 0≤G≤d+1 and, for any convex subsets C1⊂C2 of Rd, we have
[TABLE]
For θ∈L+0(Ω),A∈B(Rd), we introduce the following map from Rd to the set \wideparenK of all relatively open convex subsets of Rd:
[TABLE]
We recall that a function is universally measurable if it is measurable with respect to every complete probability measure that measures all Borel subsets.
Lemma 3.13**.**
*For θ∈L+0(Ω) and A∈B(Rd), we have:
(i)clconvdomθ(X,⋅):Rd⟼\wideparenK, domXθ:Rd⟼ri\wideparenK, and Kθ,A:Rd⟼ri\wideparenK are universally measurable;
(ii)G:\wideparenK⟶R is Borel measurable;
(iii) if A∈Nν, and θ∈T(μ,ν), then up to a modification on a μ−null set, Kθ,A(Rd)⊂ri\wideparenK is a partition of Rd with x∈Kθ,A(x) for all x∈Rd.*
The proof is reported in Subsections 4.2 for (iii), 7.1 for (ii), and 7.2 for (i). The following property is a key-ingredient for our dual decomposition in irreducible convex paving.
Proposition 3.14**.**
For all (θ,Nν)∈T(μ,ν)×Nν, we have the inclusion Y∈clKθ,Nν(X), M(μ,ν)−q.s.
**Proof. **For an arbitrary P∈M(μ,ν), we have by Proposition 3.11 that P[θ]<∞. Then, P[domθ∖(Rd×Nν)]=1 i.e. P[Y∈DX]=1 where Dx:=conv(domθ(x,⋅)∖Nν). By the martingale property of P, we deduce that
[TABLE]
Where Λ:=PX[Y∈DX∖clKθ,Nν(X)], ED:=EPX[Y∣Y∈DX∖clKθ,Nν(X)], EK:=EPX[Y∣Y∈clKθ,Nν(X)], and PX is the conditional kernel to X of P. We have EK∈clrfXDX⊂DX and ED∈DX∖clrfXDX because of the convexity of DX∖clrfXDX given by Proposition 3.1 (ii) (DX is convex). The lemma also gives that if Λ=0, then EP[Y∣X]=ΛED+(1−Λ)EK∈DX∖clKθ,Nν(X). This implies that
[TABLE]
Then P[Λ=0]=0, and therefore P[Y∈DX∖clKθ,Nν(X)]=0. Since P[Y∈DX]=1, this shows that P[Y∈clKθ,Nν(X)]=1.□
In view of Proposition 3.14 and Lemma 3.13 (iii), we introduce the following optimization problem which will generate our irreducible convex paving decomposition:
[TABLE]
The following result gives another possible definition for the irreducible paving.
Proposition 3.15**.**
(i)* We may find a μ-a.s. unique universally measurable minimizer K:=Kθ,Nν:Rd→\wideparenK of (3.5), for some (θ,Nν)∈T(μ,ν)×Nν;
(ii) for all θ∈T(μ,ν) and Nν∈Nν, we have K(X)⊂Kθ,Nν(X), μ-a.s;
(iii) we have the equality K(X)=I(X), μ−a.s.*
In item (i), the measurability of I is induced by Lemma 3.13 (i). Existence and uniqueness, together with (ii), are proved in Subsection 4.1. finally, the proof of (iii) is reported in Subsection 6.3, and is a consequence of Theorem 3.18 below. Proposition 3.15 provides a characterization of the irreducible convex paving by means of an optimality criterion on \big{(}\widehat{{\cal T}}(\mu,\nu),{\cal N}_{\nu}\big{)}.
Remark 3.16**.**
We illustrate how to get the components from optimization Problem (3.5) in the case of Example 2.2. A T(μ,ν) function minimizing this problem (with Nν:=∅∈Nν) is θ:=liminfn→∞Tpnfn, where fn:=nf, pn:=np for some p∈∂f, and
[TABLE]
One can easily check that μ[f]=ν[f] for any n≥1: f,fn∈C0. These functions separate I(x0), I(x1) and \big{(}I(x_{0})\cup I(x_{1})\big{)}^{c}.
Notice that in this example, we may as well take θ:=0, and Nν:={y−1,y0,y1,y2}c, which minimizes the optimization problem as well.**
3.5 Structure of polar sets
Let θ∈T(μ,ν), we denote the set valued map Jθ(X):=domθ(X,⋅)∩Jˉ(X), where Jˉ is introduced in Proposition 2.4.
Remark 3.17**.**
Let θ∈T(μ,ν), up to a modification on a μ−null set, we have
[TABLE]
These claims are a consequence of Proposition 6.2 together with Lemma 6.6.**
Our second main result shows the importance of these set-valued maps:
Theorem 3.18**.**
A Borel set N∈B(Ω) is M(μ,ν)−polar if and only if
[TABLE]
for some (Nμ,Nν)∈Nμ×Nν and θ∈T(μ,ν).
The proof is reported in Section 6.3. This Theorem is an extension of the one-dimensional characterization of polar sets given by Theorem 3.2 in [4], indeed in dimension one J=Jθ=Jˉ by Proposition 2.6, together with the inclusion in Remark 3.17.
We conclude this section by reporting a duality result which will be used for the proof of Theorem 3.18. We emphasize that the primal objective of the accompanying paper De March [HDM2017] is to push further this duality result so as to be suitable for the robust superhedging problem in financial mathematics.
Let c:Rd×Rd⟶R+, and consider the martingale optimal transport problem:
[TABLE]
Notice from Proposition 3.11 (i) that Sμ,ν(θ)≤ν⊖μ(θ) for all θ∈T. We denote by Dμ,νmod(c) the collection of all (φ,ψ,h,θ) in L+1(μ)×L+1(ν)×L0(Rd,Rd)×T(μ,ν) such that
[TABLE]
The last inequality is an instance of the so-called robust superhedging property. The dual problem is defined by:
[TABLE]
Notice that for any measurable function c:Ω⟶R+, any P∈M(μ,ν), and any (φ,ψ,h,θ)∈Dμ,νmod(c), we have P[c]≤μ[φ]+ν[ψ]+P[θ]≤μ[φ]+ν[ψ]+Sμ,ν(θ), as a consequence of the above robust superhedging inequality, together with the fact that Y∈affKθ,{ψ=∞}(X), M(μ,ν)-q.s. by Proposition 3.14 This provides the weak duality:
[TABLE]
The following result states that the strong duality holds for upper semianalytic functions. We recall that a function f:Rd→R is upper semianalytic if {f≥a} is an analytic set for any a∈R. In particular, a Borel function is upper semianalytic.
Theorem 3.19**.**
*Let c:Ω→R+ be upper semianalytic. Then we have
(i)Sμ,ν(c)=Iμ,νmod(c);
(ii) If in addition Sμ,ν(c)<∞, then existence holds for the dual problem Iμ,νmod(c).*
Remark 3.20**.**
By allowing h to be infinite in some directions, orthogonal to affKθ,{ψ=∞}(X), together with the convention ∞−∞=∞, we may reformulate the robust superhedging inequality in the dual set as φ⊕ψ+h⊗+θ≥c pointwise.
3.6 One-dimensional tangent convex functions
For an interval J⊂R, we denote C(K) the set of convex functions on K.
Proposition 3.21**.**
Let d=1, then
[TABLE]
M(μ,ν)−q.s. Furthermore, for all such θ∈T(μ,ν) and its corresponding (fk)k, we have
ν⊖μ(θ)=∑k(νk−μk)[fk].
**Proof. **As all functions we consider are null on the diagonal, equality on ∪kIk×Jk implies M(μ,ν)−q.s. equality by Theorem 3.2 in [4]. Let L be the set on the right hand side.
Step 1: We first show ⊂, for a≥0, we denote La:={θ∈L:∑k(νk−μk)[fk]≤a}. Notice that La contains T(Ca) modulo M(μ,ν)−q.s. equality. We intend to prove that La is μ⊗pw−Fatou closed, so as to conclude that Ta⊂La, and therefore T(μ,ν)⊂L by the arbitrariness of a≥0.
Let θn=∑k1{X∈Ik}Tpknfkn∈La converging μ⊗pw. By Proposition 3.6, θn⟶θ:=θ∞, μ⊗pw. For k≥1, let xk∈Ik be such that θn(xk,⋅)⟶θ(xk,⋅) on domxkθ, and set fk:=θ(xk,⋅). By Proposition 5.5 in [4], fk is convex on Ik, finite on Jk, and we may find pk∈∂fk such that for x∈Ik, θ(x,⋅)=Tpkfk(x,⋅). Hence, θ=∑k1{X∈Ik}Tpkfk, and ∑k(νk−μk)[fk]≤a by Fatou’s Lemma, implying that θ∈La, as required.
Step 2: To prove the reverse inclusion ⊃, let θ=∑k1{X∈Ik}Tpkfk∈L. Let fkϵ be a convex function defined by fkϵ:=fk on Jkϵ=Jk∩{x∈Jk:dist(x,Jkc)≥ϵ}, and fkϵ affine on R∖Jkϵ. Set ϵn:=n−1, fˉn=∑k=1nfkϵn, and define the corresponding subgradient in ∂fˉn:
[TABLE]
We have (ν−μ)[fˉn]=∑k=1n(νk−μk)[fkϵn]≤∑k(νk−μk)[fk]<∞. By definition, we see that Tpˉnfˉn converges to θ pointwise on ∪k(Ik)2 and to θ∗(x,y):=liminfyˉ→yθ(x,yˉ) on ∪kIk×clIk where, using the convention ∞−∞=∞, θ′:=θ−θ∗≥0, and θ′=0 on ∪k(Ik)2. For k≥1, set Δkl:=θ′(xk,lk), and Δkr:=θ′(xk,lk) where Ik=(lk,rk), and we fix some xk∈Ik. For positive ϵ<2rk−lk, and M≥0, consider the piecewise affine function gkϵ,M with break points lk+ϵ and rk−ϵ, and:
[TABLE]
Notice that gkϵ,M is convex, and converges pointwise to gkM:=M∧θ′(2lk+rk,⋅) on Jk, as ϵ→0, with
[TABLE]
where (fk)∗ is the lower semi-continuous envelop of fk. Then by the dominated convergence theorem, we may find positive ϵkn,M<2nrk−lk such that
[TABLE]
Now let gˉn=∑k=1ngkϵkn,n,n, and pˉn′∈∂gˉn. Notice that Tpˉn′gn⟶θ′ pointwise on ∪kIk×Jk, furthermore, (ν−μ)(gˉn)≤∑k(νk−μk)[fk]+1/n≤∑k(νk−μk)[fk]+1<∞.
Then we have θn:=Tpˉnfˉn+Tpˉn′gˉn converges to θ pointwise on ∪kIk×Jk, and therefore M(μ,ν)−q.s. by Theorem 3.2 in [4]. Since (ν−μ)(fˉn+gˉn) is bounded, we see that (θn)n≥1⊂T(Ca) for some a≥0. Notice that θn may fail to converge μ⊗pw. However, we may use Proposition 3.7 to get a sequence θn∈conv(θk,k≥n), and θ∞∈Θμ such that θn⟶θ∞, μ⊗pw as n→∞, and satisfies the same M(μ,ν)−q.s. convergence properties than θn. Then θ∞∈T(μ,ν), and θ∞=θ, M(μ,ν)−q.s.
□
4 The irreducible convex paving
4.1 Existence and uniqueness
Proof of Theorem 2.1
(i) The measurability follows from Lemma 3.13. We first prove the existence of a minimizer for the problem (3.5). Let m denote the infimum in (3.5), and consider a minimizing sequence (θn,Nνn)n∈N⊂T(μ,ν)×Nν with μ[G(Kθn,Nνn)]≤m+1/n. By possibly normalizing the functions θn, we may assume that ν⊖μ(θn)≤1. Set
[TABLE]
Notice that θ is well-defined as the pointwise limit of a sequence of the nonnegative functions θN:=∑n≤N2−nθn. Since \nu\widehat{\ominus}\mu\big{[}\widehat{\theta}_{N}\big{]}\leq\sum_{n\geq 1}2^{-n}<\infty by convexity of ν⊖μ, θN⟶θ, pointwise, and θ∈T(μ,ν) by Lemma 3.12, since any convex extraction of (θn)n≥1 still converges to θ. Since θn−1({∞})⊂θ−1({∞}), it follows from the definition of Nν that
m+1/n≥μ[G(Kθn,Nνn)]≥μ[G(Kθ,Nν)], hence μ[G(Kθ,Nν)]=m as θ∈T(μ,ν), Nν∈Nν.
(ii) For an arbitrary (θ,Nν)∈T(μ,ν)×Nν, we define θˉ:=θ+θ∈T(μ,ν) and Nˉν:=Nν∪Nν, so that Kθˉ,Nˉν⊂Kθ,Nν. By the non-negativity of θ and θ, we have m\leq\mu[G\big{(}K_{\bar{\theta},\bar{N}_{\nu}}\big{)}]\leq\mu[G\big{(}K_{\widehat{\theta},\widehat{N}_{\nu}}\big{)}]=m. Then G\big{(}K_{\bar{\theta},\bar{N}_{\nu}}\big{)}=G\big{(}K_{\widehat{\theta},\widehat{N}_{\nu}}\big{)}, μ-a.s. By (3.3), we see that, μ−a.s. Kθˉ,Nˉν=Kθ,Nν and Kθˉ,Nˉν=Kθ,Nν=I. This shows that I⊂Kθ,Nν, μ-a.s.
□
4.2 Partition of the space in convex components
This section is dedicated to the proof of Lemma 3.13 (iii), which is an immediate consequence of Proposition 4.1 (ii).
Proposition 4.1**.**
*Let θ∈T(μ,ν), and A∈B(Rd). We may find Nμ∈Nμ such that:
(i) for all x1,x2∈/Nμ with Kθ,A(x1)∩Kθ,A(x2)=∅, we have Kθ,A(x1)=Kθ,A(x2);
(ii) if A∈Nν, then x∈Kθ,A(x) for x∈/Nμ, and up to a modification of Kθ,A on Nμ, Kθ,A(Rd) is a partition of Rd such that x∈Kθ,A(x) for all x∈Rd.*
Proof. (i) Let Nμ be the μ−null set given by Proposition 3.10 for θ. For x1,x2∈/Nμ, we suppose that we may find yˉ∈Kθ,A(x1)∩Kθ,A(x2). Consider y∈clKθ,A(x1). As Kθ,A(x1) is open in its affine span, y′:=yˉ+1−ϵϵ(yˉ−y)∈Kθ,A(x1) for 0<ϵ<1 small enough. Then yˉ=ϵy+(1−ϵ)y′, and by Proposition 3.10, we get
[TABLE]
By convexity of domxiθ, Kθ,A(xi)⊂domxiθ⊂domθ(xi,⋅). Then θ(x1,y′), θ(x1,yˉ), θ(x2,y′), and θ(x2,yˉ) are finite and
[TABLE]
Therefore clKθ,A(x1)∩domθ(x1,⋅)⊂domθ(x2,⋅). We have obviously clKθ,A(x2)∩domθ(x2,⋅)⊂domθ(x2,⋅) as well. Subtracting A, we get
[TABLE]
Taking the convex hull and using the fact that the relative face of a set is included in itself, we see that {\rm conv}\big{(}K_{\theta,A}(x_{1})\cup K_{\theta,A}(x_{2})\big{)}\subset{\rm conv}\big{(}{\rm dom}\theta(x_{2},\cdot)\setminus A\big{)}. Notice that, as Kθ,A(x2) is defined as the x2−relative face of some set, either x2∈riKθ,A(x) or Kθ,A(x)=∅ by the properties of rfx2. The second case is excluded as we assumed that Kθ,A(x1)∩Kθ,A(x2)=∅. Therefore, as Kθ,A(x1) and Kθ,A(x2) are convex sets intersecting in relative interior points and x2∈riKθ,A(x2), it follows from Lemma 9.1 that x_{2}\in{\rm ri}\,{\rm conv}\big{(}K_{\theta,A}(x_{1})\cup K_{\theta,A}(x_{2})\big{)}. Then by Proposition 3.1 (ii),
[TABLE]
Then, we have {\rm conv}\big{(}K_{\theta,A}(x_{1})\cup K_{\theta,A}(x_{2})\big{)}\subset{\rm rf}_{x_{2}}{\rm conv}\big{(}{\rm dom}\theta(x_{2},\cdot)\setminus A\big{)}=K_{\theta,A}(x_{2}), as rfx2 is increasing. Therefore Kθ,A(x1)⊂Kθ,A(x2) and by symmetry between x1 and x2, Kθ,A(x1)=Kθ,A(x2).
(ii) We suppose that A∈Nν. First, notice that, as Kθ,A(X) is defined as the X−relative face of some set, either x∈Kθ,A(x) or Kθ,A(x)=∅ for x∈Rd by the properties of rfx. Consider P∈M(μ,ν). By Proposition 3.14, P[Y∈clKθ,A(X)]=1. As supp(PX)⊂clKθ,A(X), μ-a.s., Kθ,A(X) is non-empty, which implies that x∈Kθ,A(x). Hence, {X∈Kθ,A(X)} holds outside the set Nμ0:={supp(PX)⊂clI(X)}∈Nμ. Then we just need to have this property to replace Nμ by Nμ∪Nμ0∈Nμ.
Finally, to get a partition of Rd, we just need to redefine Kθ,A on Nμ. If x∈x′∈/Nμ⋃Kθ,A(x′) then by definition of Nμ, the set Kθ,A(x′) is independent of the choice of x′∈/Nμ such that x∈Kθ,A(x′): indeed, if x1′,x2′∈/Nμ satisfy x∈Kθ,A(x1′)∩Kθ,A(x2′), then in particular Kθ,A(x1′)∩Kθ,A(x2′) is non-empty, and therefore Kθ,A(x1′)=Kθ,A(x2′) by (i). We set Kθ,A(x):=Kθ,A(x′). Otherwise, if x∈/x′∈/Nμ⋃Kθ,A(x′), we set Kθ,A(x):={x} which is trivially convex and relatively open. With this definition, Kθ,A(Rd) is a partition of Rd.
□
5 Proof of the duality
For simplicity, we denote \mboxVal(ξ):=μ[φ]+ν[ψ]+ν⊖μ(θ), for ξ:=(φ,ψ,h,θ)∈Dμ,νmod(c).
5.1 Existence of a dual optimizer
Lemma 5.1**.**
Let c,cn:Ω⟶R+, and ξn∈Dμ,νmod(cn), n∈N, be such that
[TABLE]
Then there exists ξ∈Dμ,νmod(c) such that
\mboxVal(ξn)⟶\mboxVal(ξ) as n→∞.
**Proof. **Denote
ξn:=(φn,ψn,hn,θn), and observe that the convergence of \mboxVal(ξn) implies that the sequence \big{(}\mu(\varphi_{n}),\nu(\psi_{n}),\nu\widehat{\ominus}\mu(\theta_{n})\big{)}_{n} is bounded, by the non-negativity of φn,ψn and ν⊖μ(θn). We also recall the robust superhedging inequality
[TABLE]
Step 1.* By Komlòs Lemma together with Lemma 3.12, we may find a sequence (φn,ψn,θn)∈conv{(φk,ψk,θk),k≥n} such that*
[TABLE]
Set φ:=∞ and ψ:=∞ on the corresponding non-convergence sets, and observe that μ[φ]+ν[ψ]<∞, by the Fatou Lemma, and therefore Nμ:={φ=∞}∈Nμ and Nν:={ψ=∞}∈Nν. We denote by (hn,cn) the same convex extractions from {(hk,ck),k≥n}, so that the sequence ξn:=(φn,ψn,hn,θn) inherits from (5.1) the robust superhedging property, as for θ1,θ2∈T(μ,ν), ψ1,ψ2∈L+1(Rd), and 0<λ<1, we have affKλθ1+(1−λ)θ2,{λψ1+(1−λ)ψ2=∞}⊂affKθ1,{ψ1=∞}∩affKθ2,{ψ2=∞}:
[TABLE]
Step 2.* Next, notice that ln:=(hn⊗)−:=max(−hn⊗,0)∈Θ for all n∈N. By the convergence Proposition 3.7, we may find convex combinations ln:=∑k≥nλknlk⟶l:=l∞, μ⊗pw. Updating the definition of φ by setting φ:=∞ on the zero *μ−measure set on which the last convergence does not hold on (∂xdoml)c, it follows from (5.2), and the fact that affKθˉ,{ψ=∞}⊂liminfn→∞affKθn,{ψn=∞}, that
[TABLE]
where θˉ:=liminfn∑k≥nλknθk∈T(μ,ν). As {φ=∞}∈Nμ, by possibly enlarging Nμ, we assume without loss of generality that {φ=∞}⊂Nμ, we see that doml⊃(Nμc×Nνc)∩domθˉ∩{Y∈affKθˉ,{ψ=∞}(X)}, and therefore
[TABLE]
Step 3.*
Let hn:=∑k≥nλknhk. Then bn:=hn⊗+ln=∑k≥nλkn(hk⊗)+ defines a non-negative sequence in Θ. By Proposition 3.7, we may find a sequence bn=:hn⊗+ln∈conv(bk,k≥n) such that bn⟶b:=b∞, μ⊗pw, where b takes values in [0,∞]. bn(X,⋅)⟶b(X,⋅) pointwise on domXb, *μ−a.s. Combining with (5.3), this shows that
[TABLE]
(b−l)(X,⋅)=liminfnhn⊗(X,⋅)*, pointwise on Kθˉ,{ψ=∞}(X) (where l is a limit of ln), *μ−a.s. Clearly, on the last convergence set, (b−l)(X,⋅)>−∞ on Kθˉ,{ψ=∞}(X), and we now argue that (b−l)(X,⋅)<∞ on Kθˉ,{ψ=∞}(X), therefore Kθˉ,{ψ=∞}(X)⊂domXb, so that we deduce from the structure of hn⊗ that the last convergence holds also on affKθˉ,{ψ=∞}(X):
[TABLE]
Indeed, let x be an arbitrary point of the last convergence set, and consider an arbitrary y∈Kθˉ,{ψ=∞}(x). By the definition of Kθˉ,{ψ=∞}, we have x∈\mboxriKθˉ,{ψ=∞}(x), and we may therefore find y′∈Kθˉ,{ψ=∞}(x) with x=py+(1−p)y′ for some p∈(0,1). Then, phn⊗(x,y)+(1−p)hn⊗(x,y′)=0. Sending n→∞, by concavity of the liminf, this provides p(b−l)(x,y)+(1−p)(b−l)(x,y′)≤0, so that (b−l)(x,y′)>−∞ implies that (b−l)(x,y)<∞.
Step 4.* Notice that by dual reflexivity of finite dimensional vector spaces, (5.4) defines a unique h(X) in the vector space affKθˉ,{ψ=∞}(X)−X, such that (b−l)(X,⋅)=h⊗(X,⋅) on affKθˉ,{ψ=∞}(X). At this point, we have proceeded to a finite number of convex combinations which induce a final convex combination with coefficients (λˉnk)k≥n≥1. Denote ξˉn:=∑k≥nλˉnkξk, and set θ:=θˉ∞. Then, applying this convex combination to the robust superhedging inequality (5.1), we obtain by sending n→∞ that (φ⊕ψ+h⊗+θ)(X,⋅)≥c(X,⋅) on affKθˉ,{ψ=∞}(X), *μ−a.s. and φ⊕ψ+h⊗+θ=∞ on the complement μ null-set. As θ is the liminf of a convex extraction of (θn), we have θ≥θ∞=θˉ, and therefore affKθ,{ψ=∞}⊂affKθˉ,{ψ=∞}. This shows that the limit point ξ:=(φ,ψ,h,θ) satisfies the pointwise robust superhedging inequality
[TABLE]
Step 5.* By Fatou’s Lemma and Lemma 3.12, we have*
[TABLE]
By (5.5), we have μ[φ]+ν[ψ]+P[θ]≥P[c] for all P∈M(μ,ν). Then, μ[φ]+ν[ψ]+Sμ,ν[θ]≥Sμ,ν[c]. By Proposition 3.11 (i), we have Sμ,ν[θ]≤ν⊖μ[θ], and therefore
[TABLE]
*by (5.6).
Then we have \mboxVal(ξ)=μ[φ]+ν[ψ]+ν⊖μ[θ]=Sμ,ν(c) and Sμ,ν[θ]=ν⊖μ[θ], so that ξ∈Dμ,νmod(c).
** ** *□
5.2 Duality result
We first prove the duality in the lattice \mboxUSCb of bounded upper semicontinuous fonctions Ω⟶R+. This is a classical result using the Hahn-Banach Theorem, the proof is reported for completeness.
Lemma 5.2**.**
Let f∈\mboxUSCb, then Sμ,ν(f)=Iμ,νmod(f)
**Proof. **We have Sμ,ν(f)≤Iμ,νmod(f) by weak duality (3.9), let us now show the converse inequality Sμ,ν(f)≥Iμ,νmod(f). By standard approximation technique, it suffices to prove the result for bounded continuous f. We denote by Cl(Rd) the set of continuous mappings Rd→R with linear growth at infinity, and by Cb(Rd,Rd) the set of continuous bounded mappings Rd⟶Rd. Define
[TABLE]
and the associated Iμ,ν(f):=inf(φˉ,ψˉ,hˉ)∈D(f)μ(φˉ)+ν(ψˉ). By Theorem 2.1 in Zaev **[22]**, and Lemma 5.3 below, we have
[TABLE]
*which provides the required result.
** ** *□
Proof of Theorem 3.19* The existence of a dual optimizer follows from a direct application of the compactness Lemma 5.1 to a minimizing sequence of robust superhedging strategies.*
As for the extension of duality result of Lemma 5.2 to non-negative upper semi-analytic functions, we shall use the capacitability theorem of Choquet, similar to **[17]** and **[4]**. Let [0,∞]Ω denote the set of all nonnegative functions Ω→[0,∞], and \mboxUSA+ the sublattice of upper semianalytic functions. Note that \mboxUSCb is stable by infimum.
*Recall that a \mboxUSCb-capacity is a monotone map C:[0,∞]Ω⟶[0,∞], sequentially continuous upwards on [0,∞]Ω, and sequentially continuous downwards on \mboxUSCb. The Choquet capacitability theorem states that a *\mboxUSCb−capacity C extends to \mboxUSA+ by:
[TABLE]
In order to prove the required result, it suffices to verify that Sμ,ν and Iμ,νmod are \mboxUSCb-capacities.
As M(μ,ν) is weakly compact, it follows from similar argument as in Prosposition 1.21, and Proposition 1.26 in Kellerer **[17*]** that Sμ,ν is a \mboxUSCb-capacity.
We next verify that Iμ,νmod is a \mboxUSCb-capacity. Indeed, the upwards continuity is inherited from Sμ,ν together with the compactness lemma 5.1, and the downwards continuity follows from the downwards continuity of Sμ,ν together with the duality result on \mboxUSCb of Lemma 5.2.
** ** *□
Lemma 5.3**.**
Let c:Ω→R+, and (φˉ,ψˉ,hˉ)∈D(c). Then, we may find ξ∈Dμ,νmod(c) such that \mboxVal(ξ)=μ[φˉ]+ν[ψˉ].
**Proof. **Let us consider (φˉ,ψˉ,hˉ)∈D(c). Then φˉ⊕ψˉ+hˉ⊗≥c≥0, and therefore
[TABLE]
Clearly, f is convex, and f(x)≥−φˉ(x) by taking value x=y in the supremum. Hence ψˉ−f≥0 and φˉ+f≥0, implying in particular that f is finite on Rd.
As φˉ and ψˉ have linear growth at infinity, f is in L1(ν)∩L1(μ). We have f∈Ca for a=ν[f]−μ[f]≥0. Then we consider p∈∂f and denote θ:=Tpf. \theta\in{\mathbf{T}}\big{(}{\mathfrak{C}}_{a}\big{)}\subset\widehat{{\cal T}}(\mu,\nu). Then denoting φ:=φˉ+f, ψ:=ψˉ−f, and h:=hˉ+p, we have ξ:=(φ,ψ,h,θ)∈Dμ,νmod(c) and
[TABLE]
*** *□
6 Polar sets and maximum support martingale plan
6.1 Boundary of the dual paving
Consider the optimization problems:
[TABLE]
and for all y∈Rd we consider
[TABLE]
These problems are well defined by the following measurability result, whose proof is reported in Subsection 7.2.
Lemma 6.1**.**
Let F:Rd⟶K, γ−measurable. Then we may find Nγ∈Nγ such that 1Y∈F(X)1X∈/Nγ is Borel measurable, and if X∈riF(X) convex, γ−a.s., then 1Y∈∂F(X)1X∈/Nγ is Borel measurable as well.
*By the same argument than that of the proof of existence and uniqueness in Proposition 3.15, we see that the problem (6.1), (resp. (6.2) for y∈Rd) has an optimizer (θ∗,Nν∗)∈T(μ,ν)×Nν, (resp. (θy∗,Nν,y∗)∈T(μ,ν)×Nν). Furthermore, D:=Rθ∗,Nν∗, (resp Dy(x):={y} if y∈∂K(x)∩domθy∗(x,⋅)∩Nν,y∗, and ∅ otherwise, for x∈Rd) does not depend on the choice of (θ∗,Nν∗), (resp. θy∗) up to a *μ−negligible modification.
We define Kˉ:=D∪K, and Kθ(X):=domθ(X,⋅)∩Kˉ(X) for θ∈T(μ,ν). Notice that if y∈Rd is not an atom of ν, we may chose Nν,y containing y, which means that Problem (6.2) is non-trivial only if y is an atom of ν. We denote atom(ν), the (at most countable) atoms of ν, and define the mapping
K:=(∪y∈atom(ν)Dy)∪K,
Proposition 6.2**.**
*Let θ∈T(μ,ν). Up to a modification on a μ−null set, we have
(i)Kˉ is convex valued, moreover Y∈Kˉ(X), and Y∈Kθ(X), M(μ,ν)−q.s.
(ii)K⊂K⊂Kθ⊂Kˉ⊂clK,
(iii)K, Kθ, and Kˉ are constant on K(x), for all x∈Rd.*
Proof. (i)
For x∈Rd, Kˉ(x)=D(x)∪K(x). Let y1,y2∈Kˉ(x), λ∈(0,1), and set y:=λy1+(1−λ)y2. If y1,y2∈K(x), or y1,y2∈D(x), we get y∈Kˉ(x) by convexity of K(x), or D(x). Now, up to switching the indices, we may assume that y1∈K(x), and y2∈D(x)∖K(x). As D(x)∖K(x)⊂∂K(x), y∈K(x), as λ>0. Then y∈Kˉ(x). Hence, Kˉ is convex valued.
Since domθ∗(X,⋅)∖Nν∗∩clK∖K⊂Rθ∗,Nν∗, we have domθ∗(X,⋅)∖Nν∗∩clK⊂Rθ∗,Nν∗∪K=Kˉ. Then, as Y∈domθ∗(X,⋅)∖Nν∗, and Y∈clK(X), Y∈Kˉ(X), M(μ,ν)−q.s.
Let θ∈T(μ,ν), then Y∈domθ(X,⋅), M(μ,ν)−q.s. Finally we get Y∈domθ(X,⋅)∩Kˉ(X)=Kθ(X), M(μ,ν)−q.s.
(ii)
As Rθ,Nν(X)⊂clconv∂K(X)=clK(X), Kˉ⊂clK. By definition, Kθ⊂Kˉ, and K⊂K. For y∈atom(ν), and θ0∈T(μ,ν), by minimality,
[TABLE]
Applying (6.3) for θ0=θ, we get Dy⊂domθ(X,⋅), and for θ0=θ∗, Dy(X)⊂Kˉ(X), μ−a.s. Taking the countable union: K⊂Kθ, μ−a.s. (This is the only inclusion that is not pointwise). Then we change K to K on this set to get this inclusion pointwise.
(iii) For θ0∈T(μ,ν), let Nμ∈Nμ from Proposition 3.10. Let x∈Nμc, y∈∂K(x), and y′:=2x+y∈K(x). Then for any other x′∈K(x)∩Nμc, 21θ0(x,y)−θ0(x,y′)=21θ0(x′,x)+21θ0(x′,y)−θ0(x′,y′), in particular, y∈domθ(x,⋅) if and only if y∈domθ(x′,⋅). Applying this result to θ, θ∗, and θy∗ for all y∈atom(ν), we get Nμ such that for any x∈Rd, Kˉ, Kθ, and K are constant on K(x)∩Nμc. To get it pointwise, we redefine these mappings to this constant value on K(x)∩Nμ, or to K(x), if K(x)∩Nμc=∅. The previous properties are preserved.
□
6.2 Structure of polar sets
Proposition 6.3**.**
A Borel set N∈B(Ω) is M(μ,ν)−polar if and only if for some (Nμ,Nν)∈Nμ×Nν and θ∈T(μ,ν), we have
[TABLE]
**Proof. **One implication is trivial as Y∈Kθ(X), M(μ,ν)−q.s. for all θ∈T(μ,ν), by Proposition 6.2. We only focus on the non-trivial implication. For an M(μ,ν)-polar set N, we have Sμ,ν(∞1N)=0, and it follows from the dual formulation of Theorem 3.19 that 0=\mboxVal(ξ) for some ξ=(φ,ψ,h,θ)∈Dμ,νmod(∞1N). Then,
[TABLE]
As h is finite valued, and φ,ψ are non-negative functions, the superhedging inequality φ⊕ψ+θ+h⊗≥∞1N on {Y∈affKθ,{ψ=∞}(X)} implies that
[TABLE]
By Proposition 3.15 (ii), we have K(X)⊂Kθ,{ψ=∞}(X), μ−a.s. Then Kˉ(X)⊂affK(X)⊂affKθ,{ψ=∞}(X), which implies that
[TABLE]
We denote Nμ:={φ=∞}∪{Kθ(X)⊂domθ(X,⋅)∩affKθ,{ψ=∞}(X)}∈Nμ, and Nν:={ψ=∞}∈Nν. Then by (6.4), 1N=0 on ({φ=∞}c×{ψ=∞}c)∩{Y∈domθ(X,⋅)∩affKθ,{ψ=∞}(X)}, and therefore by (6.5),
N⊂{X∈Nμ}∪{Y∈Nν}∪{Y∈/Kθ(X)}.
□
6.3 The maximal support probability
In order to prove the existence of a maximum support martingale transport plan, we introduce the maximization problem.
[TABLE]
where we rely on the following measurability result whose proof is reported in Subsection 7.2.
Lemma 6.4**.**
For P∈P(Ω), the map \wideparensuppPX is analytically measurable, and the map \wideparensupp(PX∣∂K(X)) is μ−measurable.
Now we prove a first Lemma about the existence of a maximal support probability.
Lemma 6.5**.**
There exists P∈M(μ,ν) such that for all P∈M(μ,ν) we have the inclusion \wideparensuppPX⊂\wideparensuppPX, μ−a.s.
**Proof. **We proceed in two steps:
Step 1:* We first prove existence for the problem 6.6. Let (Pn)n≥1⊂M(μ,ν) be a maximizing sequence. Then the measure P:=∑n≥12−nPn∈M(μ,ν), and satisfies \wideparensuppPXn⊂\wideparensuppPX for all n≥1. Consequently μ[G(\wideparensuppXPXn)]≤μ[G(\wideparensuppPX)], and therefore M=μ[G(\wideparensuppPX)].
Step 2: We next prove that \wideparensuppPX⊂\wideparensuppPX, μ-a.s. for all P∈M(μ,ν). Indeed, the measure P:=2P+P∈M(μ,ν) satisfies M≥μ[G(\wideparensuppPX)]≥μ[G(\wideparensuppPX)]=M, implying that G(\wideparensuppPX)=G(\wideparensuppPX), μ−a.s. The required result now follows from the inclusion \wideparensuppPX⊂\wideparensuppPX.
□
Proof of Proposition 3.15 (iii)
Let P∈M(μ,ν) from Lemma 6.5, if we denote S(X):=\wideparensuppPX, then we have supp(PX)⊂S(X), μ−a.s. Then {Y∈/S(X)} is M(μ,ν)−polar. By Lemma 6.1, {Y∈/S(X)}∪{X∈/Nμ′} is Borel for some Nμ′∈Nμ. By Theorem 3.18, we see that {Y∈/S(X)}⊂{Y∈/S(X)}∪{X∈/Nμ′}⊂{X∈Nμ}∪{Y∈Nν}∪{Y∈/Kθ(X)}, and therefore*
[TABLE]
for some Nμ∈Nμ, Nν∈Nν, and θ∈T(μ,ν). The last inclusion implies that Kθ(X)∖Nν⊂S(X), μ-a.s. However, by Proposition 3.15 (ii), \widehat{K}(X)\subset{\rm conv}\big{(}{\rm dom}\theta(X,\cdot)\setminus N_{\nu}\big{)}, μ−a.s. Then, since S(X) is closed and convex, we see that clK(X)⊂S(X).
To obtain the reverse inclusion, we recall from Proposition 3.15 (i) that {Y∈clK(X)}, M(μ,ν)−q.s. In particular P[Y∈clK(X)]=1, implying that S(X)⊂clK(X), μ-a.s. as clK(X) is closed convex. Finally, recall that by definition I:=riS and therefore K(X)=clI(X), μ−a.s.
□
Lemma 6.6**.**
We may choose P∈M(μ,ν) in Theorem 2.1 so that for all P∈M(μ,ν) and y∈Rd,
[TABLE]
In this case the set-valued maps \underline{J}(X):=I(X)\cup\big{\{}y\in\mathbb{R}^{d}:\nu[{y}]>0\mbox{ and }\widehat{\mathbb{P}}_{X}\big{[}\{y\}\big{]}>0\big{\}}, and Jˉ(X):=I(X)∪\wideparensuppPX∣∂I(X) are unique μ−a.s. Furthermore J(X)=K(X), Jˉ(X)=Kˉ(X), and Jθ(X)=Kθ(X), μ−a.s. for all θ∈T(μ,ν).
Proof. Step 1:*
By the same argument as in the proof of Lemma 6.5, we may find P′∈M(μ,ν) such that*
[TABLE]
*We also have similarly that \wideparensupp(PX∣∂K(X))⊂\wideparensupp(PX′∣∂K(X)), μ-a.s. for all P∈M(μ,ν). Then we prove similarly that S′(X):=\wideparensupp(PX′∣∂K(X))=D(X), *μ−*a.s., where recall that D is the optimizer for (6.1). Indeed, by the previous step, we have \wideparensupp(PX∣∂K(X))⊂S′(X), *μ−*a.s. Then {Y∈/S′(X)∪K(X)} is *M(μ,ν)−polar. By Theorem 3.18, we see that {Y∈/S′(X)∪K(X)}⊂{X∈Nμ}∪{Y∈Nν}∪{Y∈/Kθ(X)∪K(X)}, or equivalently,
[TABLE]
for some Nμ∈Nμ, Nν∈Nν, and θ∈T(μ,ν). Similar to the previous analysis, we have Kθ(X)∖Nν∖K(X)⊂S′(X), μ-a.s. Then, since S′(X) is closed and convex, we see that D(X)⊂S′(X).
To obtain the reverse inclusion, we recall from Proposition 6.2 that {Y∈Kˉ(X)}, M(μ,ν)−q.s. In particular P′[Y∈K(X)∪D(X)]=1, implying that S′(X)⊂D(X), μ-a.s. By Proposition 3.15 (iii), we have Jˉ(X)=(I∪S′)(X)=(K∪D)(X)=Kˉ(X), μ−a.s.
Finally, 2P+P′ is optimal for both problems (6.6), and (6.7). By definition, the equality Jθ(X)=Kθ(X), μ−a.s. for θ∈T(μ,ν) immediately follows.
Step 2:* Let y∈atom(ν), if y is an atom of γ1∈P(Rd) and γ2∈P(Rd), then y in an atom of λγ1+(1−λ)γ2 for all 0<λ<1. By the same argument as in Step 1, we may find Py∈M(μ,ν) such that*
[TABLE]
We denote Sy(X):=suppPXy∣affK(X)∩{y}. Recall that Dy is the notation for the optimizer of problem (6.2). We consider the set N:=\big{\{}Y\notin({\rm cl\hskip 1.42271pt}\widehat{K}(X)\setminus\{y\})\cup S_{y}(X)\big{\}}. N is polar as Y∈clK(X), q.s., and by definition of Sy. Then N⊂{X∈Nμ}∪{Y∈Nν}∪{Y∈/Kθ(X)}, or equivalently,
[TABLE]
for some Nμ∈Nμ, Nν∈Nν, and θ∈T(μ,ν). Then Dy(X)⊂Kθ(X)∖Nν⊂clK(X)∖{y}∪Sy(X), μ−a.s. Finally Dy(X)⊂Sy(X), μ−a.s.
*On the other hand, Sy⊂Dy, μ−a.s., as if PXy[{y}]>0, we have θ(X,y)<∞, μ−a.s. at the corresponding points. Hence, Dy(X)=Sy(X), μ−a.s. Now if we sum up the countable optimizers for y∈atom(ν), with the previous optimizers, then the probability P we get is an optimizer for (6.6), (6.7), and (6.9), for all y∈Rd (the optimum is [math] if it is not an atom of ν). Furthermore, the μ−a.e. equality of the maps Sy and Dy for these countable y∈atom(ν) is preserved by this countable union, then together with Proposition 3.15 (iii), we get J=K, μ−a.s.
□
As a preparation to prove the main Theorem 2.1, we need the following lemma, which will be proved in Subsection 7.2.
Lemma 6.7**.**
Let F:Rd⟶ri\wideparenK be a γ−measurable function for some γ∈P(Rd), such that x∈F(x) for all x∈Rd, and {F(x):x∈Rd} is a partition of Rd. Then up to a modification on a γ−null set, F can be chosen in addition to be analytically measurable.
Proof of Theorem 2.1*
Existence holds by Lemma 6.5 above, (i) is a consequence of Lemma 6.4, and (ii) directly stems from Lemma 3.13 (iii) together with Proposition 3.15 (iii). Now we need to deal with the measurability issue. Lemma 6.7 allows to modify ri\wideparensuppPX to get (ii) while preserving its analytic measurability, we denote I its modification. However, we need to modify PX to get the result. As \wideparensuppPX is analytically measurable by Lemma 6.4, the set of modification Nμ:={\wideparensuppPX=clI(X)}∈Nμ is analytically measurable. Then we may redefine PX on Nμ, so as to preserve a kernel for P. By the same arguments than the proof of Lemma 3.13 (ii), the measure-valued map κX:=gI(X) is a kernel thanks to the analytic measurability of I, recall the definition of gK given by (3.2). Furthermore, \wideparensuppκX=I(X) pointwise by definition. Then a suitable kernel modification from which the result follows is given by*
[TABLE]
*** *□
Proof of Proposition 2.4*
The existence and the uniqueness are given by Lemma 6.6 and the other properties follow from the identity between the J maps and the K maps, also given by the Lemma, together with Proposition 6.2.
** ** *□
Proof of Theorem 3.18*
We simply apply Lemma 6.6 to replace Kθ by Jθ in Proposition 6.3.
** ** *□
7 Measurability of the irreducible components
7.1 Measurability of G
Proof of Lemma 3.13 (ii)*
As Rd is locally compact, the Wijsman topology is locally equivalent to the Hausdorff topology666The Haussdorff distance on the collection of all compact subsets of a compact metric space (X,d) is defined by dH(K1,K2)=supx∈X∣dist(x,K1)−dist(x,K2)∣, for K1,K2⊂X, compact subsets., i.e. as n→∞, Kn⟶K for the Wijsman topology if and only if Kn∩BM⟶K∩BM for the Hausdorff topology, for all M≥0.*
We first prove that K⟼dimaffK is a lower semi-continuous map K→R. Let (Kn)n≥1⊂K with dimension dn≤d′≤d converging to K. We consider An:=affKn. As An is a sequence of affine spaces, it is homeomorphic to a d+1-uplet. Observe that the convergence of Kn allow us to chose this d+1-uplet to be bounded. Then up to taking a subsequence, we may suppose that An converges to an affine subspace A of dimension less than d′. By continuity of the inclusion under the Wijsman topology, K⊂A and dimK≤dimA≤d′.
*We next prove that the mapping K↦gK(K) is continuous on {dimK=d′} for 0≤d′≤d, which implies the required measurability. Let (Kn)n≥1⊂K be a sequence with constant dimension d′, converging to a *d′−dimensional subset, K in K. Define An:=affKn and A:=affK, An converges to A as for any accumulation set A′ of An, K⊂A′ and dimA′=dimA, implying that A′=A. Now we consider the map ϕn:An→A, x↦projA(x). For all M>0, it follows from the compactness of the closed ball BM that ϕn converges uniformly to identity as n→∞ on BM. Then, ϕn(Kn)∩BM⟶K∩BM as n→∞, and therefore λA[ϕn(Kn∩BM)∖K]+λA[K∖ϕn(Kn)∩BM]⟶0. As the Gaussian density is bounded, we also have
[TABLE]
*We next compare gA[ϕn(Kn∩BM)] to gKn(Kn∩BM). As (ϕn) is a sequence of linear functions that converges uniformly to identity, we may assume that ϕn is a *C1−diffeomorphism. Furthermore, its constant Jacobian Jn converges to 1 as n→∞. Then,
[TABLE]
As the Gaussian distribution function is 1-Lipschitz, we have
[TABLE]
*where ∣⋅∣∞ is taken on Kn∩BM. Now for arbitrary ϵ>0, by choosing M sufficiently large so that gV[V∖BM]≤ϵ for any *d′−dimensional subspace V, we have
[TABLE]
*for n sufficiently large, by the previously proved convergence. Hence G_{d^{\prime}}:=G\big{|}_{\dim^{-1}\{d^{\prime}\}} is continuous, implying that G:K⟼∑d′=0d1dim−1{d′}(K)Gd′(K) is Borel-measurable.
** ** *□
7.2 Further measurability of set-valued maps
*This subsection is dedicated to the proof of Lemmas 3.13 (i), 6.1, and 6.4. In preparation for the proofs, we start by giving some lemmas on measurability of set-valued maps. Let A be a *σ−*algebra of Rd. In practice we will always consider either the *σ−*algebra of Borel sets, the *σ−*algebra of analytically measurable sets, or the *σ−algebra of universally measurable sets.
Lemma 7.1**.**
Let (Fn)n≥1⊂LA(Rd,K). Then cl∪n≥1Fn and ∩n≥1Fn are A−measurable.
**Proof. The measurability of the union is a consequence of Propositions 2.3 and 2.6 in Himmelberg **[12*]. The measurability of the intersection follows from the fact that Rd is σ-compact, together with Corollary 4.2 in [12].
** ** *□
Lemma 7.2**.**
Let F∈LA(Rd,K). Then, clconvF, affF, and clrfXclconvF are A−measurable.
*Proof. The measurability of clconvF is a direct application of Theorem 9.1 in **[12*].
We next verify that affF is measurable. Since the values of F are closed, we deduce from Theorem 4.1 in Wagner **[21]**, that we may find a measurable x⟼y(x), such that y(x)∈F(x) if F(x)=∅, for all x∈Rd. Then we may write {\rm aff}F(x)={\rm cl\hskip 1.42271pt}\,{\rm conv}\,{\rm cl\hskip 1.42271pt}\,\cup_{q\in{\mathbb{Q}}}\big{(}y(x)+q\left(F(x)-y(x)\right)\big{)} for all x∈Rd. The measurability follows from Lemmas 7.1, together with the first step of the present proof.
We finally justify that clrfXclconvF is measurable. We may assume that F takes convex values. By convexity, we may reduce the definition of rfx to a sequential form:
[TABLE]
*so that the required measurability follows from Lemma 7.1.
** ** *□
We denote S the set of finite sequences of positive integers, and Σ the set of infinite sequences of positive integers. Let s∈S, and σ∈Σ. We shall denote s<σ whenever s is a prefix of σ.
Lemma 7.3**.**
Let (Fs)s∈S be a family of universally measurable functions Rd⟶K with convex image. Then the mapping {\rm cl\hskip 1.42271pt}{\rm conv}\big{(}\cup_{\sigma\in\Sigma}\cap_{s<\sigma}F_{s}\big{)} is universally measurable.
**Proof. **Let U the collection of universally measurable maps from Rd to K with convex image. For an arbitrary γ∈P(Rd), and F:Rd⟶K, we introduce the map
[TABLE]
*Clearly, γG and γG∗ are non-decreasing, and it follows from the dominated convergence theorem that γG, and thus γG∗, are upward continuous.
*
Step 1:* In this step we follow closely the line of argument in the proof of Proposition 7.42 of Bertsekas and Shreve [5]. Set F:={\rm cl\hskip 1.42271pt}{\rm conv}\big{(}\cup_{\sigma\in\Sigma}\cap_{s<\sigma}F_{s}\big{)}, and let (Fˉn)n a minimizing sequence for γG∗[F]. Notice that F⊂Fˉ:=∩n≥1Fˉn∈U, by Lemma 7.1. Then Fˉ is a minimizer of γG∗[F].*
For s,s′∈S, we denote s≤s′ if they have the same length ∣s∣=∣s′∣, and si≤si′ for 1≤i≤∣s∣. For s∈S, let
[TABLE]
Notice that K(s) is universally measurable, by Lemmas 7.1 and 7.2, and
[TABLE]
By the upwards continuity of γG∗, we may find for all ϵ>0 a sequence σϵ∈Σ s.t.
[TABLE]
for all k≥1, with the notation σkε:=(σ1ϵ,…,σkε). Recall that the minimizer F and K(s) are in U for all s∈S. We then define the sequence Kkϵ:=F∩K(σkϵ)∈U, k≥1, and we observe that
[TABLE]
by the fact that R(σkϵ)⊂Kkϵ. We shall prove in Step 2 that, for an arbitrary α>0, we may find ε=ε(α)≤α such that (7.1) implies that
[TABLE]
*Now let α=αn:=n−1, εn:=ϵ(αn), and notice that F:=clconv∪n≥1Fϵn∈U, with Fϵn⊂F⊂F⊂F, for all n≥1. Then, it follows from (7.2) that γG[F]=γG[F], and therefore F=F=F, *γ−*a.s. In particular, F is *γ−measurable, and we conclude that F∈U by the arbirariness of γ∈P(Rd).
Step 2:* It remains to prove that, for an arbitrary α>0, we may find ε=ε(α)≤α such that (7.1) implies (7.2). This is the point where we have to deviate from the argument of [5] because γG is not downwards continuous, as the dimension can jump down.*
Set A_{n}:=\{G\big{(}\overline{F}(X)\big{)}-\dim\overline{F}(X)\leq 1/n\}, and notice that ∩n≥1An=∅. Let n0≥1 such that γ[An0]≤21d+1α, and set ϵ:=21n01d+1α>0. Then, it follows from (7.1) that
[TABLE]
where we used the Markov inequality and the monotone convergence theorem. Then:
[TABLE]
*We finally note that \inf_{n}G(K^{\epsilon}_{n})-G\big{(}\underline{F}^{\epsilon}\big{)}=0 on {infnG(Knϵ)−dimF>0}. Then (7.2) follows by substituting the estimate in (7.4).
** ** *□
Proof of Lemma 3.13 (i)*
We consider the mappings θ:Ω→Rˉ+ such that θ=∑k=1nλk1Ck1×Ck2 where n∈N, the λk are non-negative numbers, and the Ck1,Ck2 are closed convex subsets of Rd. We denote the collection of all these mappings F. Notice that clF for the pointwise limit topology contains all L+0(Ω). Then for any θ∈L+0(Ω), we may find a family (θs)s∈Σ⊂F, such that θ=infσ∈Σsups<σθs. For θ∈L+0(Ω), and n≥0, we denote Fθ:x⟼clconvdomθ(x,⋅), and Fθ,n:x⟼clconvθ(x,⋅)−1([0,n]). Notice that Fθ=cl∪n≥1Fθ,n. Notice as well that Fθ,n is Borel measurable for θ∈F, and n≥0, as it takes values in a finite set, from a finite number of measurable sets. Let θ∈L+0(Ω), we consider the associated family (θs)s∈Σ⊂F, such that θ=infσ∈Σsups<σθs. Notice that F_{\theta,n}={\rm cl\hskip 1.42271pt}{\rm conv}\big{(}\cup_{\sigma\in\Sigma}\cap_{s<\sigma}F_{\theta_{s},n}\big{)} is universally measurable by Lemma 7.3, thus implying the universal measurability of Fθ=cldomθ(X,⋅) by Lemma 7.1.*
In order to justify the measurability of domXθ, we now define
[TABLE]
Note that F_{\theta}^{k}={\rm cl\hskip 1.42271pt}\cup_{n\geq 1}\big{(}{\rm cl\hskip 1.42271pt}{\rm conv}\cup_{\sigma\in\Sigma}\cap_{s<\sigma}F_{\theta_{s},n}\cap{\rm aff}\,{\rm rf}_{x}F_{\theta}^{k-1}\big{)}. Then, as Fθ0 is universally measurable, we deduce that \big{(}F_{\theta}^{k}\big{)}_{k\geq 1} are universally measurable, by Lemmas 7.2 and 7.3.
As domXθ is convex and relatively open, the required measurability follows from the claim:
[TABLE]
To prove this identity, we start by observing that Fθk(x)⊃cldomxθ. Since the dimension cannot decrease more than d times, we have affrfxFθd(x)=affFθd(x) and
[TABLE]
i.e. (Fθd+1)k is constant for k≥d. Consequently,
[TABLE]
As \dim{\rm conv}\big{(}{\rm dom}\theta(x,\cdot)\cap{\rm aff}\,{\rm rf}_{x}F_{\theta}^{d}(x)\big{)}\geq\dim{\rm rf}_{x}{\rm conv}\big{(}{\rm dom}\theta(x,\cdot)\cap{\rm aff}\,{\rm rf}_{x}F_{\theta}^{d}(x)\big{)}, we have equality of the dimension of {\rm conv}\big{(}{\rm dom}\theta(x,\cdot)\cap{\rm aff}\,{\rm rf}_{x}F_{\theta}^{d}(x)\big{)} with its rfx. Then it follows from Proposition 3.1 (ii) that x\in{\rm ri}\,{\rm conv}\big{(}{\rm dom}\theta(x,\cdot)\cap{\rm aff}\,{\rm rf}_{x}F_{\theta}^{d}(x)\big{)}, and therefore:
[TABLE]
Hence Fθd(x)=cldomxθ.
*Finally, Kθ,A=domX(θ+∞1Rd×A) is universally measurable by the universal measurability of domX.
** ** *□
Proof of Lemma 6.1*
We may find (Fn)n≥1, Borel-measurable with finite image, converging *γ−a.s. to F. We denote Nγ∈Nγ, the set on which this convergence does not hold. For ϵ>0, we denote F_{k}^{\epsilon}(X):=\{y\in\mathbb{R}^{d}:dist\big{(}y,F_{k}(X)\big{)}\leq\epsilon\}, so that
[TABLE]
Then, as 1Y∈F(X)1X∈/Nγ=infi≥1liminfn→∞1Y∈Fn1/i(X)1X∈/Nγ, the Borel-measurability of this function follows from the Borel-measurability of each 1Y∈Fn1/i(X).
*Now we suppose that X∈riF(X) convex, *γ−*a.s. Up to redefining Nγ, we may suppose that this property holds on Nγc, then \partial F(x)=\cap_{n\geq 1}F(x)\setminus\big{(}x+\frac{n}{n+1}(F(x)-x)\big{)}, for x∈/Nγ. We denote a:=1Y∈F(X)1X∈/Nγ. The result follows from the identity \mathbf{1}_{Y\in\partial F(X)}\mathbf{1}_{X\notin N_{\gamma}}=a-\sup_{n\geq 1}a\big{(}X,X+\frac{n}{n+1}(Y-X)\big{)}.
** ** *□
Proof of Lemma 6.4*
Let KQ:={K=conv(x1,…,xn):n∈N,(xi)i≤n⊂Qd}. Then*
[TABLE]
where FKN(x):=K if Px[BN∩K]=Px[BN], and FKN(x):=Rd otherwise.
As for any K∈KQ and N≥1, the map PX[BN∩K]−PX[BN] is analytically measurable, then FKN is analytically measurable. The required measurability result follows from lemma 7.1.
Now, in order to get the measurability of \wideparensupp(PX∣∂I(X)), we have in the same way
[TABLE]
*where FK′N(x):=K if Px[∂I(x)∩BN∩K]=Px[∂I(x)∩BN], and FK′N(x):=Rd otherwise. As PX[∂I(X)∩BN∩K]=PX[1Y∈∂I(X)1X∈/Nμ1Y∈/BN∩K], *μ−*a.s., where Nμ∈Nμ is taken from Lemma 6.1, PX[∂I(X)∩BN∩K] is *μ−*measurable, as equal *μ−*a.s. to a Borel function. Then similarly, PX[∂I(X)∩BN∩K]−PX[∂I(X)∩BN] is *μ−*measurable, and therefore \wideparensupp(PX∣∂I(X)) is *μ−*measurable.
** ** *□
Proof of Lemma 6.7*
By *γ−*measurability of F, we may find a Borel function FB:Rd⟶ri\wideparenK such that F=FB, *γ−a.s. Let a Borel Nγ∈Nγ such that F=FB on Nγc. By the fact that ri\wideparenK is Polish, we may find a sequence (Fn)n≥1 of Borel functions with finite image converging pointwise towards FB when n⟶∞. We will give an explicit expression for Fn that will be useful later in the proof. Let (Kn)n≥1⊂ri\wideparenK a dense sequence,
[TABLE]
Where dist is the distance on ri\wideparenK that makes it Polish, and we chose the K with the smallest index in case of equality.
We fix n≥1, let K∈Fn(Nγc), the image of Fn outside of Nγ, and A_{K}:=F_{n}^{-1}\big{(}\{K\}\big{)}. We will modify the image of Fn so that it is the same for all x′∈FB(x)=F(x), for all x∈Nγc∩AK. Then we consider the set AK′:=∪x∈Nγc∩AKFB(x), we now prove that this set in analytic. By Theorem 4.2 (b) in **[21]**, GrFB:={Y∈clFB(X)} is a Borel set. Let λ>0, we define the affine deformation fλ:Ω⟶Ω by f_{\lambda}(X,Y):=\big{(}X,X+\lambda(Y-X)\big{)}. By the fact that for k≥1, f1−1/k(GrFB) is Borel together with the fact that x∈fB(x) for x∈/Nγ, we have
[TABLE]
Therefore, {Y∈FB(X)}∩{X∈/Nγ} is Borel, and so is {Y∈FB(X)}∩{X∈Nγc∩AK}. Finally,
[TABLE]
therefore, AK′ is the projection of a Borel set, which is one of the definitions of an analytic set (see Proposition 7.41 in **[5]**). Now we define a suitable modification of Fn by Fn′(x):=K for all x∈AK′, we do this redefinition for all K∈FB(Nγc). Notice that thanks to the definition (7.5) and the fact that FB(x)=FB(x′) if x,x′∈/Nγ and x′∈FB(x)=F(x), we have the inclusion AK′⊂AK∪Nγ. Then the redefinitions of Fn only hold outside of Nγ, furthermore for different K1,K2∈Fn(Nγc), AK1′∩AK2′=∅ as the value of Fn(x) only depends on the value of FB(x) by (7.5). Notice that
[TABLE]
is analytically measurable, as the complement of an analytic set, and does not depend on n. For x∈Nγ′, we define Fn′(x):={x}. Notice that Fn′ is analytically measurable as the modification of a Borel Function on analytically measurable sets.
*Now we prove that Fn′ converges pointwise when n⟶∞. For x∈Nγ′, Fn′(x) is constant equal to {x}, if x∈/Nγ′, by (7.6) x∈∪x∈/NγFB(x), and therefore Fn′(x)=FB(x′)=F(x′) for some x∈Nγc, for all n≥1. Then as Fn′(x′) converges to F(x′), Fn′(x) converges to F(x). Let F′ be the pointwise limit of Fn′. the maps Fn′ are analytically measurable, and therefore, so does F′. For all n≥1, Fn′=Fn, *γ−*a.e. and therefore F′=FB=F, *γ−*a.e. Finally, F′(Nγc)=F(Nγc), and ∪F(Nγc)=(Nγ′)c. By property of F, F′(Nγc) is a partition of (Nγ′)c such that x∈F′(x) for all x∈/Nγ′. On Nγ′, this property is trivial as F′(x)={x} for all x∈Nγ′.
** ** *□
8 Properties of tangent convex functions
8.1 x-invariance of the y-convexity
We first report a convex analysis lemma.
Lemma 8.1**.**
Let f:Rd→Rˉ be convex finite on some convex open subset U⊂Rd. We denote f∗:Rd→Rˉ the lower-semicontinuous envelop of f on U, then
[TABLE]
Proof. f∗* is the lower semi-continuous envelop of f on U, i.e. the lower semi-continuous envelop of f′:=f+∞1Uc. Notice that f′ is convex Rd⟶R∪{∞}. Then by Proposition 1.2.5 in Chapter IV of [13], we get the result as f=f′ on U.
** ** *□
Proof of Proposition 3.10*
The result is obvious in T(C1), as the affine part depending on x vanishes. We may use Nν=∅. Now we denote T the set of mappings in Θμ such that the result from the proposition holds. Then we have T(C1)⊂T.*
*We prove that T is *μ⊗pw−Fatou closed. Let (θn)n be a sequence in T converging μ⊗pw to θ∈Θμ. Let n≥1, we denote Nμ, the set in Nμ from the proposition applied to θn, and let Nμ0∈Nμ corresponding to the μ⊗pw convergence of θn to θ. We denote Nμ:=∪n∈NNμn∈Nμ. Let x1,x2∈/Nμ, and yˉ∈domx1θ∩domx2θ. Let y1,y2∈domx1θ, such that we have the convex combination yˉ=λy1+(1−λ)y2, and 0≤λ≤1. Then for i=1,2, θn(x1,yi)⟶θ(x1,yi), and θn(x1,yˉ)⟶θ(x1,yˉ), as n→∞. Using the fact that θn∈T, for all n, we have
[TABLE]
Taking the limit n→∞ gives that θ∞(x2,yi)<∞, and yi∈domθ∞(x2,⋅). yˉ is interior to domx1θ, then for any y∈domx1θ, y′:=yˉ+1−ϵϵ(yˉ−y)∈domx1θ for 0<ϵ<1 small enough. Then yˉ=ϵy+(1−ϵ)y′. As we may chose any y∈domx1θ, we have domx1θ⊂domθ∞(x2,⋅). Then, we have
[TABLE]
By Lemma 9.1, as domx1θ∩domx2θ=∅, conv(domx1θ∪domx2θ)=riconv(domx1θ∪domx2θ). In particular, conv(domx1θ∪domx2θ) is relatively open and contains x2, and therefore rfx2conv(domx1θ∪domx2θ)=conv(domx1θ∪domx2θ). Finally, by \eqrefeq:inclusion, domx1θ⊂domx2θ. As there is a symmetry between x1, and x2, we have domx1θ=domx2θ. Then we may go to the limit in equation (8.1):
[TABLE]
*Now, let y1,y2∈Rd, such that we have the convex combination yˉ=λy1+(1−λ)y2, and 0≤λ≤1. we have three cases to study.
*
Case 1:* yi∈/cldomx1θ for some i=1,2.
Then, as the average yˉ of the yi is in domx1θ, by Proposition 3.1 (ii), me may find i′=1,2 such that yi′∈/convdomθ(x1,⋅), thus implying that θ(x1,yi)=∞. Then λθ(x1,y1)+(1−λ)θ(x1,y2)−θ(x1,yˉ)=∞≥0. As domx1θ=domx2θ, we may apply the same reasoning to x2, we get λθ(x1,y1)+(1−λ)θ(x2,y2)−θ(x2,yˉ)=∞≥0. We get the result.
*
Case 2:* y1,y2∈domx1θ.
This case is (8.3).
*
Case 3:* y1,y2∈cldomx1θ.
The problem arises here if some yi is in the boundary ∂domx1θ. Let x∈/Nμ, we denote the lower semi-continuous envelop of θ(x,⋅) in cldomxθ, by θ∗(x,y):=limϵ↘0θ(x,ϵx+(1−ϵ)y′), for y∈cldomxθ, where the latest equality follows from Lemma 8.1 together with that fact that θ(x,⋅) is convex on domxθ. Let y∈cldomx1θ, for 1≥ϵ>0, yϵ:=ϵx1+(1−ϵ)y∈domx1θ. By (8.1), (1−ϵ)θn(x1,y)−θn(x1,yϵ)=(1−ϵ)θn(x2,y)−θn(x2,yϵ). Taking the liminf, we have (1−ϵ)θ(x1,y)−θ(x1,yϵ)=(1−ϵ)θ(x2,y)−θ(x2,yϵ). Now taking ϵ↘0, we have θ(x1,y)−θ∗(x1,y)=θ(x2,y)−θ∗(x2,y). Then the jump of θ(x,⋅) in y is independent of x=x1 or x2. Now for 1≥ϵ>0, by (8.3)*
[TABLE]
By going to the limit ϵ↘0, we get
[TABLE]
As the (nonnegative) jumps do not depend on x=x1 or x2, we finally get
[TABLE]
*Finally, T is *μ⊗pw−*Fatou closed, and convex. T1⊂T. As the result is clearly invariant when the function is multiplied by a scalar, the Result is proved on T(μ,ν).
** ** *□
8.2 Compactness
Proof of Proposition 3.7*
We first prove the result for θ=(θn)n≥1⊂Θ. Denote conv(θ):={θ′∈ΘN:θn′∈conv(θk,k≥n),n∈N}. Consider the minimization problem:*
[TABLE]
*where the measurability of G(domXθ∞′) follows from Lemma 3.13.
*
Step 1:* We first prove the existence of a minimizer. Let (θ′k)k∈N∈conv(θ)N be a minimizing sequence, and define the sequence θ∈conv(θ) by:*
[TABLE]
Then, dom(θ∞)⊂⋂k≥1dom(θ∞′k) by the non-negativity of θ′, and we have the inclusion \big{\{}\widehat{\theta}_{n}\underset{n\to\infty}{\longrightarrow}\infty\big{\}}\subset\big{\{}\theta_{n}^{\prime k}\underset{n\to\infty}{\longrightarrow}\infty\leavevmode\nobreak\ \mbox{for some}\leavevmode\nobreak\ k\geq 1\big{\}}. Consequently,
[TABLE]
*Since (θ′k)k is a minimizing sequence, and θ∈conv(θ), this implies that μ[G(domXθ∞)]=m.
*
Step 2:* We next prove that we may find a sequence (yi)i≥1⊂L0(Rd,Rd) such that*
[TABLE]
Indeed, it follows from Lemmas 3.13, and 7.2 that the map x↦aff(domxθ∞) is universally measurable, and therefore Borel-measurable up to a modification on a μ−null set. Since its values are closed and nonempty, we deduce from the implication (ii)⟹(ix) in Theorem 4.2 of the survey on measurable selection **[21]* the existence of a sequence (yi)i≥1 satisfying (8.5).
*
Step 3:* Let m(dx,dy):=μ(dx)⊗∑i≥02−iδ{yi(x)}(dy). By the Komlòs lemma (in the form of Lemma A1.1 in [7], similar to the one used in the proof of Proposition 5.2 in [4]), we may find θ∈conv(θ) such that θn⟶θ∞∈L0(Ω), *m−a.s. Clearly, domxθ∞⊂domxθ∞, and therefore \mu\big{[}G({\rm dom}_{X}\underline{\widetilde{\theta}}_{\infty})\big{]}\leq\mu\big{[}G({\rm dom}_{x}\underline{\widehat{\theta}}_{\infty})\big{]}, for all x∈Rd. This shows that
[TABLE]
so that θ is also a solution of the minimization problem (8.4). Moreover, it follows from (3.3) that
[TABLE]
Step 4:* Notice that the values taken by θ∞ are only fixed on an *m−*full measure set. By the convexity of elements of Θ in the *y−*variable, domXθn has a nonempty interior in aff(domXθ∞). Then as *μ−a.s., θn(X,⋅) is convex, the following definition extends θ∞ to Ω:
[TABLE]
*This extension coincides with θ∞, in (x,yn(x)) for *μ−*a.e. x∈Rd, and all n≥1 such that yn(x)∈/∂domXθk for some k≥1 such that domxθn has a nonempty interior in aff(domxθ∞). As for k large enough, ∂domXθk is Lebesgue negligible in aff(domxθ∞), the remaining yn(x) are still dense in aff(domxθ∞). Then, for *μ−a.e. x∈Rd, θn(x,⋅) converges to θ∞(x,⋅) on a dense subset of aff(domxθ∞). We shall prove in Step 6 below that
[TABLE]
*Then, by Theorem 9.3, θn(X,⋅)⟶θ∞(X,⋅) pointwise on aff(domXθ∞)∖∂domθ∞(X,⋅), *μ−*a.s. Since domXθ∞=domXθ∞, and θ converges to θ∞ on domXθ∞, *μ−*a.s., θ converges to θ∞∈Θ, μ⊗pw.
*
Step 5:* Finally for general (θn)n≥1⊂Θμ, we consider θn′, equal to θn, μ⊗pw, such that θn′≤θn, for n≥1, from the definition of Θμ. Then we may find λnk, coefficients such that θn′:=∑k≥nλnkθk′∈conv(θ′) converges μ⊗pw to θ∞∈Θ. We denote θn:=∑k≥nλnkθk∈conv(θ), θn=θn′, μ⊗pw, and θn≥θn′. By Proposition 3.6 (iii), θ converges to θ∞, μ⊗pw. The Proposition is proved.*
Step 6:* In order to prove (8.7), suppose to the contrary that there is a set A such that μ[A]>0 and domθ∞(x,⋅) has an empty interior in aff(domxθ∞) for all x∈A. Then, by the density of the sequence (yn(x))n≥1 stated in (8.5), we may find for all x∈A an index i(x)≥0 such that*
[TABLE]
Moreover, since i(x) takes values in N, we may reduce to the case where i(x) is a constant integer, by possibly shrinking the set A, thus guaranteeing that y is measurable. Define the measurable function on Ω:
[TABLE]
Since Lxn is convex, and contains x for n sufficiently large by (8.8), we see that
[TABLE]
In particular, this shows that θn0∈Θ. By Komlòs Lemma, we may find
[TABLE]
for some non-negative coefficients (λkn,k≥n)n≥1 with ∑k≥nλkn=1. By convenient extension of this limit, we may assume that θ∞0∈Θ. We claim that
[TABLE]
We defer the proof of this claim to Step 7 below and we continue in view of the required contradiction. By definition of θn0 together with (8.10), we compute that
[TABLE]
By (8.8) and (8.11), this shows that the sequence θ1∈conv(θ) satisfies
[TABLE]
*We finally consider the sequence θ1:=21(θ+θ1)∈conv(θ). Clearly, domθ∞1(X,⋅)⊂domθ∞(X,⋅), and it follows from the last property of θ1 that domθ∞1(x,⋅)⊂Hxc∩domθ∞(x,⋅) for all x∈A. Notice that y(x) lies on the boundary of the half space Hx and, by (8.8), y(x)∈ridomxθ∞. Then G(domxθ∞1)<G(domxθ∞) for all x∈A and, since μ[A]>0, we deduce that \mu\big{[}G({\rm dom}_{X}\underline{\widetilde{\theta}}^{1}_{\infty})\big{]}<\mu\big{[}G({\rm dom}_{X}\underline{\widetilde{\theta}}_{\infty})\big{]}, contradicting the optimality of θ, by (8.6), for the minimization problem (8.4).
*
Step 7:* It remains to justify (8.11). Since θn(x,⋅) is convex, it follows from the Hahn-Banach separation theorem that:*
[TABLE]
for some hn(x)∈Rd, so that it follows from (8.9) that Lxn⊂(Hxn)c, and
[TABLE]
Denote gx:=gdomxθ∞ the Gaussian kernel restricted to the affine span of domxθ∞, and Br(x0) the corresponding ball with radius r, centered at some point x0. By (8.8), we may find rx so that Brx:=Br(y(x))⊂ridomxθ∞ for all r≤rx, and
[TABLE]
*where e1 is an arbitrary unit vector of the affine span of domxθ∞. Then we have the inequality ∫Brxθn0(x,y)gx(y)dy≥bxr, and since θn0 has linear growth in y by (8.10), it follows from the dominated convergence theorem that ∫Bxrθ∞0(x,y)g(dy)≥bxr>0, and therefore θ∞0(x,yxr)>0 for some yxr∈Bxr. From the arbitrariness of r∈(0,rx), We deduce (8.11) as a consequence of the convexity of θ0(x,⋅).
** ** *□
Proof of Proposition 3.6* (iii)
We need to prove the existence of some*
[TABLE]
For simplicity, we denote θ:=θ∞. Let
[TABLE]
Fix some sequence εn↘0, and denote \theta_{*}:=\liminf_{n\to\infty}{{\theta}}\big{(}X,\varepsilon_{n}X+(1-\varepsilon_{n})Y\big{)}, and
[TABLE]
where Nμ∈Nμ is chosen such that 1Y∈Fk(X)1X∈/Nμ are Borel measurable for all k from Lemma 6.1, and θ(x,⋅) (resp. θn(x,⋅)) is convex finite on domxθ (resp. domxθn), for x∈/Nμ. Consequently, θ′ is measurable. In the following steps, we verify that θ′ satisfies (8.12).
Step 1:* We prove that θ′∈Θ. Indeed, θ′∈L+0(Ω), and θ′(X,X)=0. Now we prove that θ′(x,⋅) is convex for all x∈Rd. For x∈Nμ, θ′(x,⋅)=0. For x∈/Nμ, θ(x,⋅) is convex finite on domxθ, then by the fact that domxθ is a convex relatively open set containing x, it follows from Lemma 8.1 that \theta_{*}(x,\cdot)=\lim_{n\to\infty}{{\theta}}\big{(}x,\varepsilon_{n}x+(1-\varepsilon_{n})\cdot\big{)} is the lower semi-continuous envelop of θ(x,⋅) on cldomxθ. We now prove the convexity of θ′(x,⋅) on all Rd. We denote F(x):=F(x)∖cldomxθ so that Rd=F(x)c∪F(x)∪cldomxθ. Now, let y1,y2∈Rd, and λ∈(0,1). If y1∈F(x)c, the convexity inequality is verified as θ′(x,y1)=∞. Moreover, θ′(x,⋅) is constant on F(x), and convex on cldomxθ. We shall prove in Steps 4 and 5 below that*
[TABLE]
In view of Proposition 3.1 (ii), this implies that the sets F(x) and cldomxθ are convex. Then we only need to consider the case when y1∈F(x), and y2∈cldomxθ. By Proposition 3.1 (ii) again, we have [y1,y2)⊂F(x), and therefore λy1+(1−λ)y2∈F(x), and θ′(x,λy1+(1−λ)y2)=0, which guarantees the convexity inequality.
Step 2:* We next prove that θ=θ′, μ⊗pw. By the second claim in (8.13), it follows that θ∗(X,⋅) is convex finite on domXθ, *μ−*a.s. Then as a consequence of Proposition 3.4 (ii), we have domXθ′=domX(∞1Y∈/F(X))∩domX(θ∗1Y∈cldomXθ), *μ−*a.s. The first term in this intersection is rfXF(X)=domXθ. The second contains domXθ, as it is the domX of a function which is finite on domXθ, which is convex relatively open, containing X. Finally, we proved that domXθ=domXθ′, *μ−*a.s. Then θ′(X,⋅) is equal to θ∗(X,⋅) on domXθ, and therefore, equal to θ(X,⋅), *μ−a.s. We proved that θ=θ′, μ⊗pw.
Step 3:* We finally prove that θ′≤θ pointwise. We shall prove in Step 6 below that*
[TABLE]
Then, ∞1Y∈/F(X)1X∈/Nμ≤θ, and it remains to prove that
[TABLE]
To see this, let x∈/Nμ. By definition of Nμ, θn(x,⋅)⟶θ(x,⋅) on domxθ. Notice that θ(x,⋅) is convex on domxθ, and therefore as a consequence of Lemma 8.1,
[TABLE]
Then yϵ:=(1−ϵ)y+ϵx∈domxθn, for ε∈(0,1], and n sufficiently large by (i) of this Proposition, and therefore (1−ϵ)θn(x,y)−θn(x,yϵ)≥(1−ϵ)θn′(x,y)−θn′(x,yϵ)≥0, for θn′∈Θ such that θn′=θn, μ⊗pw, and θn≥θn′. Taking the liminf as n→∞, we get (1−ϵ)θ(x,y)−θ(x,yϵ)≥0, and finally {\theta}(x,y)\geq\lim_{\epsilon\searrow 0}{\theta}\big{(}x,\epsilon x+(1-\epsilon)y\big{)}=\theta^{\prime}(x,y), by sending ϵ↘0.
Step 4:* (First claim in (8.13)) Let x0∈Rd, let us prove that F(x0) is convex. Indeed, let x,y∈F(x0), and 0<λ<1. Since cldomxθ is convex, and Fn(x0)∖clrfXFn(x0) is convex by Proposition 3.1 (ii), we only examine the following non-obvious cases:*
∙* Suppose x∈Fn(x0)∖clrfx0Fn(x0), and y∈Fp(x0)∖clrfx0Fp(x0), with n<p. Then as Fp(x0)∖clrfx0Fp(x0)⊂clrfx0Fn(x0), we have λx+(1−λ)y∈Fn(x0)∖clrfx0Fn(x0) by Proposition 3.1 (ii).*
∙* Suppose x∈Fn(x0)∖clrfx0Fn(x0), and y∈cldomx0θ, then as cldomx0θ⊂clrfx0Fn(x0), this case is handled similar to previous case.*
Step 5:* (Second claim in (8.13)). We have domXθ⊂F(X), and therefore domXθ⊂rfXF(X). Now we prove by induction on k≥1 that rfXF(X)⊂∪n≥k(Fn∖clrfXFn)∪cldomXθ. The inclusion is trivially true for k=1. Let k≥1, we suppose that the inclusions holds for k, hence rfXF(X)⊂∪n≥k(Fn∖clrfXFn)∪cldomXθ. As ∪n≥k(Fn∖clrfXFn)∪cldomXθ⊂Fk. Applying rfX gives*
[TABLE]
Then the result is proved for all k. In particular we apply it for k=d+1. Recall from the proof of Lemma 3.13 that for n≥d+1, Fn is stationary at the value cldomXθ. Then ∪n≥d+1(Fn∖clrfXFn)=∅, and rfXF(X)⊂rfXcldomXθ=domXθ. The result is proved.
Step 6:* We finally prove (8.14). Indeed, domθ(X,⋅)⊂F1 by definition. Then*
[TABLE]
*** *□
9 Some convex analysis results
As a preparation, we first report a result on the union of intersecting relative interiors of convex subsets which was used in the proof of Proposition 4.1. We shall use the following characterization of the relative interior of a convex subset K of Rd:
[TABLE]
We start by proving the required properties of the notion of relative face.
Proof of Proposition 3.1*
*(i) The proofs of the first properties raise no difficulties and are left as an exercise for the reader. We only prove that rfaA=riA=∅ iff a∈riA. We assume that rfaA=riA=∅. The non-emptiness implies that a∈A, and therefore a∈rfaA=riA. Now we suppose that a∈riA. Then for x∈riA, \big{[}x,a-\epsilon(x-a)\big{]}\subset{\rm ri}A\subset A, for some ϵ>0, and therefore riA⊂rfaA. On the other hand, by (9.2), riA={x∈Rd:x∈(x′,x0],\mboxforsomex0∈riA,\mboxandx′∈A}. Taking x0:=a∈riA, we have the remaining inclusion rfaA⊂riA.
(ii) We now assume that A is convex.
Step 1:* We first prove that rfaA is convex. Let x,y∈rfaA and λ∈[0,1]. We consider ϵ>0 such that \big{(}a-\epsilon(x-a),x+\epsilon(x-a)\big{)}\subset A and \big{(}a-\epsilon(y-a),y+\epsilon(y-a)\big{)}\subset A. Then if we write z=λx+(1−λ)y, \big{(}a-\epsilon(z-a),z+\epsilon(z-a)\big{)}\subset A by convexity of A, because a,x,y∈A.*
Step 2:* In order to prove that rfaA is relatively open, we consider x,y∈rfaA, and we verify that \big{(}x-\epsilon(y-x),y+\epsilon(y-x)\big{)}\subset{\rm rf}_{a}A for some ϵ>0. Consider the two alternatives:*
Case 1:* If a,x,y are on a line. If a=x=y, then the required result is obvious. Otherwise,*
[TABLE]
This union is open in the line and x and y are interior to it. We can find ϵ′>0 such that \big{(}x-\epsilon^{\prime}(y-x),y+\epsilon^{\prime}(y-x)\big{)}\subset{\rm rf}_{a}A.
Case 2:* If a,x,y are not on a line. Let ϵ>0 be such that \big{(}a-2\epsilon(x-a),x+2\epsilon(x-a)\big{)}\subset A and \big{(}a-2\epsilon(y-a),y+2\epsilon(y-a)\big{)}\subset A. Then x+ϵ(x−a)∈rfaA and a−ϵ(y−a)∈rfaA. Then, if we take λ:=1+2ϵϵ,*
[TABLE]
Then x+λϵ(x−y)∈rfaA and symmetrically, y+λϵ(y−x)∈rfaA by convexity of rfaA. And still by convexity, \big{(}x-\epsilon^{\prime}(y-x),y+\epsilon^{\prime}(y-x)\big{)}\subset{\rm rf}_{a}A for ϵ′:=1+2ϵϵ2>0.
Step 3:* Now we prove that A∖clrfaA is convex, and that if x0∈A∖clrfaA and y0∈A, then [x0,y0)⊂A∖clrfaA. We will prove these two results by an induction on the dimension of the space d. First if d=0 the results are trivial. Now we suppose that the result is proved for any d′<d, let us prove it for dimension d.*
Case 1:* a∈riA. This case is trivial as rfaA=riA and A⊂clriA=clrfaA because of the convexity of A. Finally A∖clrfaA=∅ which makes it trivial.*
Case 2:* a∈/riA. Then a∈∂A and there exists a hyperplan support H to A in a because of the convexity of A. We will write the equation of E, the corresponding half-space containing A, E:c⋅x≤b with c∈Rd and b∈R. As x∈rfaA implies that [a−ϵ(x−a),x+ϵ(x−a)]⊂A for some ϵ>0, we have (a−ϵ(x−a))⋅c≤b and (x+ϵ(x−a))⋅c≤b. These equations are equivalent using that a∈H and thus a⋅c=b to −ϵ(x−a)⋅c≤0 and (1+ϵ)(x−a)⋅c≤0. We finally have (x−a)⋅c=0 and x∈H. We proved that rfaA⊂H.*
Now using (i) together with the fact that rfaA⊂H and a∈H affine, we have
[TABLE]
Then we can now have the induction hypothesis on A∩H because dimH=d−1 and A∩H⊂H is convex. Then we have A∩H∖clrfaA which is convex and if x0∈A∩H∖clrfa(A∩H), y0∈A∩H and if λ∈(0,1] then λx0+(1−λ)y0∈A∖clrfa(A∩H).
First A\setminus{\rm cl\hskip 1.42271pt}{\rm rf}_{a}A=(A\setminus H)\cup\big{(}(A\cap H)\setminus{\rm cl\hskip 1.42271pt}{\rm rf}_{a}A\big{)}, let us show that this set is convex. The two sets in the union are convex (A∖H=A∩(E∖H)), so we need to show that a non trivial convex combination of elements coming from both sets is still in the union. We consider x∈A∖H, y∈A∩H∖clrfaA and λ>0, let us show that z:=λx+(1−λ)y∈(A∖H)∪(A∩H∖clrfaA). As x,y∈A (clrfaA⊂A* because A is closed), z∈A by convexity of A. We now prove z∈/H,*
[TABLE]
Then z is in the strict half space: z∈E∖H. Finally z∈A∖H and A∖clrfaA is convex.
Let us now prove the second part: we consider x0∈A∖clrfaA, y0∈clrfaA and λ∈(0,1] and write z0:=λx0+(1−λ)y0.
Case 2.1:* x0,y0∈H. We apply the induction hypothesis.*
Case 2.2:* x0,y0∈A∖H. Impossible because rfaA⊂H and clrfaA⊂clH=H. y0∈H.*
Case 2.3:* x0∈A∖H and y0∈H. Then by the same computation than in Step 1,*
[TABLE]
Step 4:* Now we prove that if a∈A, then dim(rfaclA)=dim(A) if and only if a∈riA, and that in this case, we have clrfaclA=clriclA=clA=clrfaA. We first assume that a∈riA. As by the convexity of A, riA=riclA, rfaclA=riclA, and therefore clrfaclA=clA. Finally, taking the dimension, we have dim(clrfaclA)=dim(A). In this case we proved as well that clrfaclA=clriclA=clA=clrfaA, the last equality coming from the fact that riA=rfaA as a∈riA.*
*Now we assume that a∈/riA. Then a∈∂clA, and rfaclA⊂∂clA. Taking the dimension (in the local sense this time), and by the fact that dim∂clA=dim∂A<dimA, we have dim(clrfaclA)<dim(A) (as clrfaclA is convex, the two notions of dimension coincide).
** ** *□
Lemma 9.1**.**
Let K1,K2⊂Rd be convex with riK1∩riK2=∅. Then conv(riK1∪riK2)=riconv(K1∪K2).
**Proof. **We fix y∈riK1∩riK2.
Let x∈conv(riK1∪riK2), we may write x=λx1+(1−λ)x2, with x1∈riK1, x2∈riK2, and 0≤λ≤1. If λ is [math] or 1, we have trivially that x∈riconv(K1∩K2). Let us now treat the case 0<λ<1. Then for x′∈conv(K1∪K2), we may write x′=λ′x1′+(1−λ′)x2′, with x1′∈K1, x2′∈K2, and 0≤λ′≤1. We will use y as a center as it is in both the sets. For all the variables, we add a bar on it when we subtract y, for example xˉ:=x−y. The geometric problem is the same when translated with y,
[TABLE]
However, as xˉ1 and xˉ1′ are in K1−y, as [math] is an interior point, ϵ(λλ′xˉ1′−xˉ1)∈K1−y for ϵ small enough. Then as xˉ1 is interior to K1−y as well, xˉ1−ϵ(λλ′xˉ1′−xˉ1)∈K1−y as well. By the same reasoning, xˉ2−ϵ(1−λ1−λ′xˉ2′−xˉ2)∈K2−y. Finally, by (9.3), for ϵ small enough, x−ϵ(x′−x)∈conv(K1∪K2). By (9.1), x∈riconv(K1∪K2).
*Now let x∈riconv(K1∪K2). We use again y as an origin with the notation xˉ:=x−y. As xˉ is interior, we may find ϵ>0 such that (1+ϵ)xˉ∈conv(K1∪K2). We may write (1+ϵ)xˉ=λxˉ1+(1−λ)xˉ2, with xˉ1∈K1−y, xˉ2∈K2−y, and 0≤λ≤1. Then xˉ=λ1+ϵ1xˉ1+(1−λ)1+ϵ1xˉ2. By (9.2), 1+ϵ1xˉ1∈riK1, and 1+ϵ1xˉ2∈riK2. {\bar{x}}\in{\rm conv}\big{(}{\rm ri}(K_{1}-y)\cup{\rm ri}(K_{2}-y)\big{)}, and therefore x∈conv(riK1∪riK2).
** ** *□
Now we use the measurable selection theory to establish the non-emptiness of ∂f.
Lemma 9.2**.**
For all f∈C, we have ∂f=∅.
**Proof. By the fact that f is continuous, we may write ∂f(x)=∩n≥1Fn(x) for all x∈Rd, with Fn(x):={p∈Rd:f(yn)−f(x)≥p⋅(yn−x)} where (yn)n≥1⊂Rd is some fixed dense sequence. All Fn are measurable by the continuity of (x,p)⟼f(yn)−f(x)−p⋅(yn−x) together with Theorem 6.4 in **[12*]. Therefore the mapping x⟼∂f(x) is measurable by Lemma 7.1. Moreover, the fact that this mapping is closed nonempty-valued is a well-known property of the subgradient of finite convex functions in finite dimension. Then the result holds by Theorem 4.1 in [21].
** ** *□
We conclude this section with the following result which has been used in our proof of Proposition 3.7. We believe that this is a standard convex analysis result, but we could not find precise references. For this reason, we report the proof for completeness.
Theorem 9.3**.**
Let fn,f:Rd→Rˉ be convex functions with intdomf=∅. Then fn⟶f pointwise on Rd∖∂domf if and only if fn⟶f pointwise on some dense subset A⊂Rd∖∂domf.
**Proof. **We prove the non-trivial implication "if". We first prove the convergence on intdomf. fn converges to f on a dense set. The reasoning will consist in proving that the fn are Lipschitz, it will give a uniform convergence and then a pointwise convergence. First we consider K⊂intdomf compact convex with nonempty interior. We can find N∈N and x1,...xN∈A∩(intdomf∖K) such that K⊂intconv(x1,...,xN). We use the pointwise convergence on A to get that for n large enough, fn(x)≤M for x∈conv(x1,...,xN), M>0 (take M=max1≤k≤Nf(xk)+1). Then we will prove that fn is bounded from below on K. We consider a∈A∩K and δ0:=supx∈K∣x−a∣. For n large enough, fn(a)≥m for any a∈A (take for example m=f(a)−1). We write δ1:=min(x,y)∈K×∂conv(x1,...,xN)∣x−y∣. Finally we write δ2:=supx,y∈conv(x1,...,xN)∣x−y∣. Now, for x∈K, we consider the half line x+R+(a−x), it will cut ∂conv(x1,...,xN) in one only point y∈∂conv(x1,...,xN). Then a∈[x,y], and therefore a=∣x−y∣∣a−y∣x+∣x−y∣∣a−x∣y. By the convex inequality, fn(a)≤∣x−y∣∣a−y∣fn(x)+∣x−y∣∣a−x∣fn(y). Then fn(x)≥−∣a−y∣∣a−x∣M+∣a−y∣∣x−y∣m≥−δ1δ0M+δ1δ2m. Finally, if we write m0:=−δ1δ0M+δ1δ2m,
[TABLE]
This will prove that fn is δ1M−m0-Lipschitz. We consider x∈K and a unit direction u∈Sd−1 and fn′∈∂fn(x). For a unique λ>0, y:=x+λu∈∂conv(x1,...,xN). As u is a unit vector, λ=∣y−x∣≥δ1. By the convex inequality, fn(y)≥fn(x)+fn′(x)⋅(y−x).
Then M−m0≥δ0∣fn′⋅u∣ and finally ∣fn′⋅u∣≤δ1M−m0 as this bound does not depend on u, ∣fn′∣≤δ1M−m0 for any such subgradient. For n large enough, the fn are uniformly Lipschitz on K, and so in f. The convergence is uniform on K, it is then pointwise on K. As this is true for any such K, the convergence is pointwise on intdomf.
*Now let us consider x∈(cldomf)c. The set conv(x,intdomf)∖domf has a nonempty interior because dist(x,domf)>0 and intdomf=∅. As A is dense, we can consider a∈A∩conv(x,intdomf)∖domf. By definition of conv(x,intdomf), we can find y∈intdomf such that a=λy+(1−λ)x. We have λ<1 because a∈/domf. If λ=0, fn(x)=fn(a)n→∞⟶∞. Otherwise, by the convexity inequality, fn(a)≤λfn(y)+(1−λ)fn(x). Then, as fn(a)n→∞⟶∞, and fn(y)n→∞⟶f(y)<∞, we have fn(x)n→∞⟶∞.
** ** *□
Acknowledgements
We are grateful to the two anonymous referees, whose fruitful remarks and comments contributed to enhance deeply this paper.
Bibliography22
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Gerald Beer. A polish topology for the closed subsets of a polish space. Proceedings of the American Mathematical Society , 113(4):1123–1133, 1991.
2[2] Mathias Beiglböck, Pierre Henry-Labordère, and Friedrich Penkner. Model-independent bounds for option prices: a mass transport approach. Finance and Stochastics , 17(3):477–501, 2013.
3[3] Mathias Beiglböck and Nicolas Juillet. On a problem of optimal transport under marginal martingale constraints. The Annals of Probability , 44(1):42–106, 2016.
4[4] Mathias Beiglböck, Marcel Nutz, and Nizar Touzi. Complete duality for martingale optimal transport on the line. ar Xiv preprint ar Xiv:1507.00671 , 2015.
5[5] Dimitri P Bertsekas and Steven E Shreve. Stochastic optimal control: The discrete time case , volume 23. Academic Press New York, 1978.
6[6] Alexander MG Cox and Jan Obłój. Robust pricing and hedging of double no-touch options. Finance and Stochastics , 15(3):573–605, 2011.
7[7] Freddy Delbaen and Walter Schachermayer. A general version of the fundamental theorem of asset pricing. Mathematische annalen , 300(1):463–520, 1994.
8[8] Ibrahim Ekren and H Mete Soner. Constrained optimal transport. ar Xiv preprint ar Xiv:1610.02940 , 2016.