\sectiondot
subsection
Relative compactness of Itô integrals on the M1 Skorokhod space with identification of limits
Fabrice Wunderlich
Scuola Normale Superiore, Pisa, IT. [email protected] of Statistics, London School of Economics, London, UK.
Abstract
We establish general results for weak relative compactness of sequences of Itô integrals with respect to Skorohod’s functional M1 topology, under general conditions. Moreover, we are able to explicitly characterise the form of the limit points of all convergent subsequences. This result closes a longstanding gap in the literature, where weak relative compactness had previously only been shown under the significantly more restrictive J1 topology, or the S topology which is too coarse to preserve continuity for most common functionals.
1 Introduction
We consider the problem of weak relative compactness of sequences of stochastic Itô integrals with respect to Skorokhod’s M1 topology. Let DRd[0,∞) be the space of càdlàg paths x:[0,∞)→Rd, and let dJ1, dM1 be the classical metrics inducing the J1 and M1 topology [20, 3, 24], respectively. Given a sequence {Xn} of semimartingales on filtered probability spaces (Ωn,Fn,\mathbbmFn,Pn), and {Hn} a sequence of \mathbbmFn-adapted càdlàg processes, we aim to identify general conditions that ensure the weak relative compactness of the sequence
[TABLE]
on (DRd[0,∞),dM1), assuming (Hn,Xn)⇒(H0,X0) on (DRd[0,∞),dM1)×(DRd[0,∞),dM1). Moreover, we are interested in explicitly characterising the form of limit points of any weakly convergent subsequences.
1.1 Classical approaches to weak continuity of Itô integrals
Classical approaches, which pursued ’full’ weak convergence of the sequence (1.1), typically start by imposing a critical control on the behaviour of the integrators Xn (see e.g. the UT condition [12, p.112], the UCV condition [14, C2.2(i)], or GD in [21]). Several fundamental examples such as [9, §6b, p. 38] and [21, Ex. 3.17] demonstrate that such control can generally not be omitted without risking the stochastic unboundedness of the integral processes, even when the individual processes converge uniformly. In the sequel, we will therefore assume such control, that is that the integrators Xn decompose as
[TABLE]
such that, for every t>0, we have
[TABLE]
for all c>0, where τcn:=inf{s>0:∣Mn∣s∗≥c}. Here, we have denoted ∣Z∣t∗:=sup0≤s≤t∣Zs∣ the running supremum of a stochastic process Z over the time interval [0,t], TV[0,t](Z) its total variation on [0,t], and ΔZt:=Zt−Zt− the jump of Z at time t.
If one seeks to obtain ’full’ weak convergence of the sequence (1.1), an additional assumption beyond (GD) is required, acting on the interplay between the integrands and integrators beyond adaptedness and joint weak convergence (see e.g. [21, (AVCI) & Thm. 3.6]). Originally introduced by [11, Eq. (6)], the condition rules out that—asymptotically—there is a significant increment of the integrands before one of the integrators. This prevents the approximating integrals from accruing a mass surplus or deficit that does not translate to the limiting integral. More formally, define a function w^δT:DRd[0,∞)×DRd[0,∞)→R+ of the largest consecutive increment within a δ-period of time on [0,T], namely
[TABLE]
where the supremum is restricted to 0≤s,u≤T. In this definition we have applied the usual notation a∧b:=min{a,b}, and we have denoted by x(i) the i-th coordinate of x. Then, the additional condition on the interplay can be stated as
[TABLE]
In [21, Prop. 3.8] it has been showed that, whenever the limiting quantities H0, X0 almost surely have no common discontinuities, or if the pairs (Hn,Xn) converge on the strong J1 space (DR2d[0,∞),dJ1) opposed to on (DRd[0,∞),dJ1)×(DRd[0,∞),dJ1) (which—quintessentially—requires the integrands to eventually jump at the same time as the integrators), then (AVCI) is satisfied. In fact, the most influential seminal papers [12, 14] for the J1 toplogy built their weak convergence results for stochastic integrals around the latter sufficient criterion. We shall stress that it is significantly more intricate to show tightness (and thus, by extension via Prokhorov’s theorem, weak relative compactness) of the pairs (Hn,Xn) on the strong space DR2d[0,∞) than on the product space (DRd[0,∞))2 (cf. [21, Rmk. 3.10]. While both criteria provide a simple lever in many interesting cases, beyond these instances it quickly becomes either unclear how to practically verify (AVCI) or the condition might simply not be satisfied.
Example 1.1 suggests that, even if (AVCI) fails, one may still expect at least the weak relative compactness of the integrals.
Example 1.1**.**
Consider first the deterministic sequences defined by xn=1[1−1/n,∞), as well as hn=hn′:=1[0,1−2/n)+31[1−2/n,∞) if n is even, and hn=hn′′:=1[0,1+1/n)+31[1+1/n,∞) if n is odd. Obviously, hn→1[0,1)+31[1,∞)=:h0, xn→1[1,∞)=:x0 in the J1 topology but due to the preceding jump of hn before the one of xn for even n, we have
[TABLE]
and therefore we merely obtain relative compactness, with J1 convergence of the subsequences
[TABLE]
as well as
[TABLE]
Extending the above example in a way that introduces stochasticity, consider now Bernoulli random variables ξn and
[TABLE]
almost surely in J1, while leaving the Xn:=xn→x0=:X0 unchanged as above. The ξn trivially being tight, by Prokhorov’s theorem there exists a subsequence {ξnk} of the latter converging in distribution to some Bernoulli ξ, and thus
[TABLE]
1.2 A gap in the literature for weak relative compactness
Indeed, while a lack of (AVCI) generally jeopardises ’full’ functional weak convergence, Kurtz & Protter [14, pp. 1051-1054] were able to show that, for J1 convergent semimartingale integrands and integrators (Hn,Xn)⇒(H0,X0) on (DRd[0,∞),dJ1)×(DRd[0,∞),dJ1) where the integrators Xn have UCV (which, in fact, can be regarded as equivalent to (GD) in our setting), the sequence {(Xn,∫0∙Hs−ndXsn)} is weakly relatively compact on (DR2d[0,∞),dJ1). Moreover, they identified the limit points of converging subsequences as
[TABLE]
where {βi} is some subset of the random jump times of (H0,X0). Clearly, the fact that we still achieve weak relative compactness in J1 despite a potential absence of (AVCI) is immensely useful. Yet, it becomes more and more clear that the J1 topology presents substantial rigidity for many modern modeling purposes as it requires both the jump times and jump sizes of a convergent sequence to approximately match those of the limit.
If we leave the realm of regularity offered by Skorokhod’s J1 and M1 topologies, [10] introduced a significantly coarser ’ultraweak’ topology, the so-called S topology, which is closely linked to the conditions F1–F3 in [21, Prop. 2.16]. As shown by [22], the UT condition, popularised in [12], implies tightness with respect to the S topology ([10, Thm. 4.1]). Therefore, since UT propagates from the integrators to the integral, one obtains S tightness with the fairly minimal assumption of UT. As for UCV, the UT condition—in the configuration of this paper—is equivalent to (GD), and thus S tightness carries over to our framework of (GD) instead of UT. Although the S space is not metrizeable, and hence we cannot directly apply the Prokhorov theorem in order to deduce weak relative compactness from tightness, [10, Thm. 3.4] showed that this very implication is nonetheless true for the S topology. While, in certain specific cases, S tightness might thus turn out to be practical, we shall note that many useful continuous functionals in the classical Skorokhod spaces, such as, e.g., the running supremum or time evaluations, are generally nowhere continuous on the S space. This critically limits the number of potential use cases for weak limit theorems with respect to the S topology.
In contrast, Skorokhod’s M1 topology bridges the gap between the rigidity of the J1 topology and the looseness of the S topology. Indeed, it enables a flexible approximation of limiting jumps through combinations of staggered smaller jumps or continuous pieces, as long as these almost monotonically morph into the limiting discontinuity. For both an excellent introduction to and an advanced study of the M1 topology we refer to Whitt’s canonical monograph [24]. At the same time, convergence in the M1 topology is sufficiently robust, with many
natural functionals (such as, e.g., the running supremum and time coordinates evaluated at continuity times of the limit) preserving convergence. Moreover, compactness in the M1 topology is very often easier to achieve, especially when monotonic components are present. For these reasons, the M1 topology increasingly becomes a standard tool for the study of functional convergence on the space of càdlàg paths. It has been used for a wide range of applications, from problems in financial mathematics [2], queueing and network theory [19, 17, 5], the analysis of physical systems [13, 16, 7], questions related to the Bouchaud trap model [1, 4], to the study of mean field interaction models [8, 6, 15, 18].
1.3 Overview of the main results
In this article, we establish the weak relative compactness of Itô integrals on the M1 Skorokhod space (or J1 space if the integrators converge in J1), whenever (1) the integrators satisfy (GD), (2) there is some essential regularity property of the limiting pair (H0,X0) (Theorem 2.3). Notably, if only the integrands converge in M1 and the integrators converge in J1, then this regularity property is no longer required (Corollary 2.5). The form of the limit points for convergent subsequences will be explicitly identified as the limiting stochastic integral ∫Hs−0dXs0 plus the sum of jump products of the integrand H0 and integrator X0, weighed according to random variables taking values in [0,1]d. Furthermore, we will show that if, contrary to (AVCI), asymptotically all increments of the integrators occur after those of the integrands, then we are in fact able to recover again ’full’ weak convergence, again without any additional regularity. Here, in the correction term of the limit, the weights of all jump products are equal to one (Proposition 2.4).
2 Extending relative compactness to M1
The results on weak relative compactness in the setting of integrands and integrators converging with respect to either the J1 topology or the
S topology, as described in Section 1, leave a fundamental gap in the literature for analogue statements within the framework of the M1 topology. This gap will be addressed in the sequel. Whenever we have (Hn,Xn)⇒(H0,X0) on (DRd[0,∞),ρ~)×(DRd[0,∞),ρ), with \tilde{\rho},\rho\in\{\text{J_{1}},\text{M_{1}}\}, we will refer to this as the ρ~–ρ case.
2.1 The M1–M1 case
Under a certain regularity property imposed on the integrands, we will extend Kurtz & Protter’s result (1.3) on weak relative compactness in the J1–J1 case to our more general M1–M1 framework. The regularity required for this will consist in assuming the limiting processes to satisfy H−0ΔH0∣ΔX0∣≥0. This crucial assumption can best be motivated by means of the simple deterministic Example 2.1, highlighting how jumps in the limiting integrands, which entail an instant sign reversal, may generally jeopardise M1 convergence. Therefore, in order to obtain
Example 2.1**.**
Consider
[TABLE]
and note that hn→h0:=1−21[1,∞) in the J1 topology while xn→x0:=1[1,∞) in M1. The integral process ∫0∙hn(s−)dxn(s)=(1/2)1[1−3/n,1−1/n) is evidently not relatively compact in the M1 topology (as illustrated in Figure 1).
In Condition R1, we formalise the critical regularity needed for extension to the M1–M1 case.
Condition R1**.**
For the limiting processes H0,X0 it holds coordinatewise that for any s>0
[TABLE]
Condition R2**.**
For any strictly decreasing null sequence {ak}⊆(0,∞), it holds that for all T>0, ε>0
[TABLE]
We shall effectively view Condition R2 as a means to warrant existence of the process of summed up jump products ∑s≤∙ΔHs0ΔXs0, which will serve as the fundamental correction term in this analysis. A simple criterion for Condition R2 to be satisfied is the following.
Criterion 2.2** (A simple criterion for Condition R2).**
If H0 has square-integrable jumps, e.g. if it is a semimartingale and therefore has existing quadratic variation, then a simple application of the Cauchy-Schwarz inequality shows that the processes
[TABLE]
almost surely form a Cauchy sequence with respect to the uniform norm on compacts. Hence, Condition R2 is satisfied in this case.
Let {ak}⊆(0,∞) be a strictly decreasing null sequence to be specified at the beginning of Section 3. For a càdlàg stochastic process H~0 on a probability space (Ω~0,F~0,P~0) equipped with the natural filtration of H~0, let τ~j0,k be the stopping time indicating the j-th jump of H~0 of size larger than ak, i.e.
[TABLE]
as well as σ~j0,k the stopping time indicating the j-th jump of H~0 of size larger than ak yet smaller or equal to ak−1, i.e.
[TABLE]
Clearly, these stopping times almost surely exhaust all jumps of the process H~0, that is
[TABLE]
for some A∈F~0 with P~0(A)=1. Denote the set of distinct stopping times σ~j0,k by T(H~0).
Theorem 2.3**.**
*Let {Xn} be a sequence of d-dimensional semimartingales with good decompositions (GD) on filtered probability spaces (Ωn,Fn,Fn,Pn). Consider a sequence of adapted d-dimensional càdlàg processes {Hn} on the same filtered probability space such that (Hn,Xn)⇒(H0,X0) on (DRd[0,∞),dM1)2 and assume Conditions R1 and R2.
Then, there is a subsequence {Hnm,Xnm}m≥1, a probability space (Ω~0,F~0,P~0) as well as stochastic processes H~0,X~0:[0,∞)×Ω~0→DRd[0,∞) such that L(H0,X0)=L(H~0,X~0), X~0 is a semimartingale in the filtration generated by the pair (H~0,X~0) and*
[TABLE]
on (DRd[0,∞),dM1)3 as m→∞, where 0≤ξ~σ0≤1 coordinatewise and the ξ~σ0 are random variables on (Ω~0,F~0,P~0). In fact, X~0 is a semimartingale with respect to the filtration generated by the tuple (H~0,X~0,{ξ~σ01[σ,∞)}σ∈T(H~0)).
We shall point out that the only quantities on the right-hand side of (2.3) which, in terms of their law, may differ depending on the specific subsequence {(Hnm,Xnm)}, are the random variables ξ~σ0. For an intuition on the nature of these sets, we refer back to Example 1.1.
Figure 2 displays a concise classification of the tightness result in Theorem 2.3.
The following proposition shows that entirely ruling out consecutive increments of the integrators before the integrands asymptotically yields again full weak convergence of the stochastic integrals, yet with a fully-fledged correction term. In terms of the limit of suitable subsequences of integrals, omitting (AVCI) therefore may well be comprehended as ending up on a random spectrum with respect to the presence of the correction term in (2.5).
Proposition 2.4**.**
Under the assumptions of Theorem 2.3, suppose that asymptotically there are almost surely no consecutive large increments of the Xn before the Hn, i.e.,
[TABLE]
for all a>0 and T>0, where w^δT is defined in (1.2). Then, X0 is a semimartingale in the natural filtration generated by the pair (H0,X0) and it holds
[TABLE]
on (DRd[0,∞),dM1)3.
2.2 The M1–J1 case
Provided the integrators Xn converge on the more restrictive J1 Skorokhod space, we are able to recover enough structure to ensure weak relative compactness, even for the J1 topology, without Condition R1. Hence, this leads to versions of Theorem 2.3 and Proposition 2.4 which do not require to assume Condition R1. This result is stated through the following corollary.
Corollary 2.5**.**
If (Hn,Xn)⇒(H0,X0) on (DRd[0,∞),dM1)×(DRd[0,∞),dJ1), then both Theorem 2.3 and Proposition 2.4 remain valid even without Condition R1, and the convergence (2.3), or (2.5) respectively, hold on the stronger space (DRd[0,∞),dM1)×(DR2d[0,∞),dJ1).
3 Proofs
Define
[TABLE]
with the usual notation a∨b:=max{a,b}, and recall that this set is at most countable (see e.g. [9, Lem. VI.3.12]).
Towards a proof of Theorem 2.3 and Proposition 2.4, we construct the subsequent quantities. Let {Θℓ} be a sequence of nested partitions such that
[TABLE]
with vanishing mesh size, i.e., ∣Θℓ∣:=supi≥2(νiℓ−νi−1ℓ)→0 as ℓ→∞, ∣Θℓ∣∈/{∣x−y∣:x,y∈DiscP0(H0,X0)}, and ∣Θℓ∣↓:=infi≥2(νiℓ−νi−1ℓ)>0 for all ℓ≥1. Further, define
[TABLE]
and analogously for ⌊x⌋Θℓ, where we simply reverse the inequalities, replace the minimum by a maximum, and ∣Θℓ∣↓/2 by −∣Θℓ∣↓/2. The distinction made for the second case x∈Θℓ serves purely technical reasons relevant to the proof of Lemma 3.10.
Choose a strictly decreasing null sequence {ak} in such a way that
ak∈(0,∞)\fgebackslash(VΘℓ∪W) for all ℓ≥1, where VΘℓ is defined in (3.33) of Lemma 3.20 and W in Lemma 3.17 in the Appendix.
To given k,ℓ≥1, n≥0 set ρ0n,k,ℓ≡0 and define iteratively
[TABLE]
for all j≥1, where Hn,(i) denotes the i-th coordinate of Hn. Then, we can set
[TABLE]
Note that for fixed k,ℓ≥1, n≥0, there are almost surely only finitely many τj on compact time intervals. We can now proceed to the proof of the main results, and we will proceed in several auxiliary steps (Sections 3.1 & 3.2). The final proofs of the main results will then be presented in Sections 3.3, 3.4 and 3.5.
3.1 Relative compactness for the corrected integrands
Lemma 3.1**.**
For fixed k,ℓ≥1, the sequence {Hn−H~n,k,ℓ}n≥1 is tight on (DRd[0,∞),dM1).
Proof.
According to [24, Thm. 12.12.3], the sequence {Hn−H~n,k,ℓ}n≥1 is M1 tight if and only if, for every T>0 in a dense subset of [0,∞),
- (1)
the sequence is stochastically bounded on [0,T], that is
[TABLE]
2. (2)
the M1 modulus of continuity vanishes asymptotically in probability on increasingly small intervals, that is for all η>0 it holds that
[TABLE]
where w′(x,δ):=sup{∥xt−[xs,xr]∥:0∨(t−δ)≤s≤t≤r≤(t+δ)∧T} with ∥xt−[xs,xr]∥:=inf{∣xt−y∣:0≤λ≤1,y=λxs+(1−λ)xr}.
3. (3)
there is local uniform convergence at [math] and T, which means for all η>0 it holds that
[TABLE]
where u(x,t,δ):=sup{∣xr−xs∣:0∨(t−δ)≤r,s≤(t+δ)∧T}.
Since Hn⇒H0 on (DRd[0,∞),dM1), an application of Skorokhod’s representation theorem together with [24, Thm. 12.5.1(v)] gives us that for every t∈[0,∞)\fgebackslashDiscP0(H0) there is local uniform tightness at t of the type
[TABLE]
for all η>0. Recall that DiscP0(H0) is a countable subset of [0,∞) and let T>0, T∈[0,∞)\fgebackslashDiscP0(H0). Clearly, due to the tightness of the sequence {Hn} on the M1 Skorokhod space, it satisfies the conditions (1)–(3) with Hn−H~n,k,ℓ replaced by Hn. Then, (1) and (3) follow immediately—by definition of H~n,k,ℓ—from ∣Hn−H~n,k,ℓ∣T∗≤∣Hn∣T∗ and u(Hn−H~n,k,ℓ,0,δ)∨u(Hn−H~n,k,ℓ,T,δ)≤u(Hn,0,δ)∨u(Hn,T,δ). Thus, it only remains to show (2). Towards this goal, let ε,η>0 and choose δ>0, N≥1 such that Pn(An,δ)>1−ε for all n≥N, where
[TABLE]
Indeed, this choice is possible due to (3.2) and the fact that {Hn} is M1 tight and therefore satisfies (2) with Hn−H~n,k,ℓ replaced by Hn (note that Θℓ∩[0,T] is finite). Now, let r,s,t>0 be such that 0∨(t−δ)≤s≤t≤r≤(t+δ)∧T and fix ω∈Ωn. First, consider the case ρj−1n,k,ℓ(ω)≤s<τjn,k,ℓ(ω)≤t<ρjn,k,ℓ(ω)≤r<τj+1n,k,ℓ(ω) for some j≥1, for which
[TABLE]
where we have omitted the dependence of all quantities on ω. If τjn,k,ℓ(ω)≤s<ρjn,k,ℓ(ω)≤t<r<τj+1n,k,ℓ(ω) for some j≥1, then
[TABLE]
since ρjn,k,ℓ∈Θℓ and 0∨(ρjn,k,ℓ−δ)≤r,s≤(ρjn,k,ℓ+δ)∧T. For the sake of brevity, we do not provide details on the remaining cases and we shall simply note that such bound can be derived in similar ways for them, so to obtain
[TABLE]
almost surely. Hence, 1−ε<Pn(An,δ)≤Pn(w′(Hn−H~n,k,ℓ,δ)≤η) for all n≥N. Since
ε>0 was arbitrary, we deduce (2).
∎
By Prokhorov’s theorem, from Lemma 3.1 we deduce that, for any k,ℓ≥1 and subsequence of {Hn−H~n,k,ℓ}n≥1, there exists a further subsequence {Hnm(k,ℓ)−H~nm(k,ℓ),k,ℓ}m≥1 and a càdlàg stochastic process Y{nm(k,ℓ)},k,ℓ such that
[TABLE]
on (DRd[0,∞),dM1) as m→∞. Moreover, by definition of the processes (3.1), Hνn−H~νn,k,ℓ=Hνn for all ν∈Θℓ, and therefore the finite-dimensional distributions of Hnm−H~nm(k,ℓ),k,ℓ converge to those of H0 on Θℓ⊆[0,∞)\fgebackslashDiscP0(H0,X0).
Lemma 3.2**.**
For fixed k≥1 and a sequence {ℓr} with ℓr→∞ as r→∞, the sequence of respective limits {Y{nm(k,ℓr)},k,ℓr}r≥1 from (3.4) is tight on (DRd[0,∞),dM1).
Proof.
Let ε,η>0.By (3.4) and since weak convergence is metrizeable, there exist b:=b(r) such that dw(Hnb(k,ℓr)−H~nb(k,ℓr),k,ℓr,Y{nm(k,ℓr)},k,ℓr)→0 as b→∞, where dw denotes any metric generating the topology of weak convergence of Borel probability measures on (DRd[0,∞),dM1). Thus, in order to show M1 tightness of the sequence {Y{nm(k,ℓr)},k,ℓr}r≥1 it suffices to show tightness of the sequence {Hnb(k,ℓr)−H~nb(k,ℓr),k,ℓr}r≥1. Without loss of generality, we may assume that the b are such that there exists δ>0 with
[TABLE]
for all b≥1 (as a result of the M1 tightness of the Hn; see the partial condition (2) in the proof of Lemma 3.1). Let us write nb instead of nb(k,ℓr) for brevity. Now, proceed in analogy to the proof of Lemma 3.1, noting that instead of the bound in (3.3) we achieve
[TABLE]
whenever τjnb,k,ℓr≤s<ρjnb,k,ℓr≤t<p<τj+1nb,k,ℓr for some j≥1 and p−s≤δ/2, since ρjnb,k,ℓr−τjnb,k,ℓr≤∣Θℓr∣ and therefore p−τjnb,k,ℓr<δ/2+2∣Θℓr∣. Recall that ∣Θℓr∣ denotes the mesh size of the partition Θℓr. In fact, all other cases for s,t,p with p−s≤δ/2 yield the same bound (again, the procedure is similar and we omit the details for the sake of brevity of this account). Thus, we obtain
[TABLE]
for r large enough, due to ∣Θℓr∣→0 as r→∞.
∎
Again, by Prokhorov’s theorem and Lemma 3.2, to every subsequence of {ℓr} there exists a further subsequence—which, whenever there is no risk of ambiguity, we will denote as the original sequence—converging weakly in (DRd[0,∞),dM1) to some limit Y{nm(k,ℓr)},k,{ℓr}, that is
[TABLE]
as r→∞. We will now show that the laws of Y{nm(k,ℓr)},k,{ℓr} and H0 coincide and therefore the convergence in
(3.5) does not depend on the actual subsequence of {ℓr}, yielding in fact
[TABLE]
as r→∞ for any original sequence {ℓr}. Recall that the Borel σ-algebra on the Skorokhod space is generated by the marginal time projections onto a dense subset of times, and the set ⋃ℓ≥1Θℓ is dense in [0,∞).
Lemma 3.3**.**
For any k≥1 and limit Y{nm(k,ℓr)},k,{ℓr} from (3.5) the finite-dimensional distributions of Y{nm(k,ℓr)},k,{ℓr} and H0 coincide on Θℓ, that is
[TABLE]
for all p≥1 and ν1,...,νp∈⋃ℓ≥1Θℓ.
Proof.
Let k,p≥1 and ν1,...,νp∈Θℓ, for some ℓ≥1. In order to lighten notation, we will simply write Y to denote Y{nm(k,ℓr)},k,{ℓr}. By (3.4), (3.5), and since weak convergence on the M1 space is metrizeable, again there exist b:=b(r) such that nb(k,ℓr)→∞ as r→∞, and
[TABLE]
on (DRd[0,∞),dM1) as r→∞. Moreover, in order to further ease notation, we will suppress the dependence of nb(k,ℓr) on k,r and simply write nb in the sequel. Recall that D:=[0,∞)\fgebackslash(DiscP(Y)∪DiscP0(H0)) is cocountable and choose a sequence of times {(t1q,...,tpq)}q≥1 such that (t1q,...,tpq)∈Dp, tjq↓νj as q→∞, and tjq=νj for every j=1,...,p. Let f:Rpd→R be Lipschitz and bounded, and denote fν=f∘πν1,...,νp, ftq=f∘πt1q,...,tpq, where πα1,...,αp(x):=(xα1,...,xαp) is the coordinate projection at times (α1,...,αp). Then, we obtain the bound
[TABLE]
for all r,q≥1. Since fν(H^r)=fν(Hnb) by definition of the processes H^r, and νj∈[0,∞)\fgebackslashDiscP0(H0), j=1,...,p, the generalised continuous mapping theorem [3, Thm. 2.7] yields that the last term on the right side of (3.8) converges to zero as r→∞ (and therefore nb→∞), as a consequence of Hnb⇒H0 on (DRd[0,∞),dM1) and [24, Thm. 12.5.1(v)]. By the same reasoning, the second term on the right-hand side of (3.8) converges to zero as r→∞, for each q≥1. The first term simply follows by dominated convergence and the right-continuity of Y. Finally, the third term can be estimated by
[TABLE]
where ∥f∥Lip is the maximum of the Lipschitz constant and bound of f. By definition of the processes H^r (and more precisely (3.1)), note that ∣H^νjnb−H^tjqr∣≤u(Hnb,νj,tjq−νj), where u is defined as in (3) in the proof of Lemma 3.1. Hence, for every ε>0,
[TABLE]
and, by (3.2) we obtain
[TABLE]
as ε>0 was arbitrary. Thus, we obtain that the left-hand side of (3.8) equals zero, which yields the claim.
∎
We can now deduce the following weak limit result.
Proposition 3.4**.**
For all subsequences of the natural numbers {kp}, {ℓr} and {nm}, there exist further subsequences {ℓr(p)}, {nm(p)} of {ℓr} and {nm} respectively such that
[TABLE]
on (DRd[0,∞),dM1) as p→∞.
Proof.
Since the topology of weak convergence on (DRd[0,∞),dM1) is metrizeable, the result follows directly from (3.6) and (3.4) by making use of a diagonal sequence argument.
∎
Lemma 3.5** (An (AVCI)-type result for the approximations).**
For all γ>0 and T>0 it holds that
[TABLE]
where w^δT is defined in (1.2).
Proof.
Denote H^n,k,ℓ:=Hn−H~n,k,ℓ. Let γ,ε>0, T>0 and choose k≥1 such that ak<γ. Now, fix ℓ≥1 and choose δ:=δ(γ,ℓ)>0 small enough that
[TABLE]
where u is defined as in (3) in the proof of Lemma 3.1. The existence of such δ can be deduced as in (3.2), due to Xn⇒X0 on (DRd[0,∞),dM1) and Θℓ∩[0,T]⊆[0,∞)\fgebackslashDiscP0(X0) being finite. Consider ω∈{w^δT(H^n,k,ℓ,Xn)>γ}. Then, there exist random times 0≤s(ω)≤t(ω)≤p(ω)≤T, satisfying p(ω)−t(ω)≤δ, t(ω)−s(ω)≤δ, and
[TABLE]
Note that there must be j≥1 so that s(ω)<ρjn,k,ℓ(ω)≤t(ω). Indeed, otherwise, we have ρjn,k,ℓ(ω)≤s(ω)<t(ω)<ρj+1n,k,ℓ(ω) for some j≥1. By definition of the stopping times ρjn,k,ℓ before (3.1), (3.10), and the definition of the processes H^n,k,ℓ in (3.1), it follows ρjn,k,ℓ(ω)≤s(ω)<τj+1n,k,ℓ(ω)≤t(ω)<ρj+1n,k,ℓ(ω). However, this implies
[TABLE]
which yields a contradiction.
Thus, there exists j≥1 such that s(ω)<ρjn,k,ℓ(ω)≤t(ω)<p(ω). Since ρjn,k,ℓ(ω)∈Θℓ and p(ω)−s(ω)<2δ,
[TABLE]
and therefore ω∈{maxν∈Θℓ∩[0,T]u(Xn,ν,2δ)>γ}, since we recall ∣Xt(ω)n(ω)−Xp(ω)n(ω)∣>γ. Finally, we deduce
[TABLE]
As ε,γ>0 were arbitrary, this yields the result.
∎
Finally, the prior considerations allow us to establish the following weak convergence results with respect to the corrected integrands.
Proposition 3.6**.**
Let {kp}, {nm} and {ℓr} be subsequences of the natural numbers. Then, there exist further subsequences {nm(p)}, {ℓr(p)} of {nm} and {ℓr} respectively such that
[TABLE]
on (DRd[0,∞),dM1)3 as p→∞.
Proof.
By Proposition 3.4 there exist subsequences {nm(p)}, {ℓr(p)} that ensure
[TABLE]
on (DRd[0,∞),dM1) as p→∞. Without loss of generality, assume that
[TABLE]
on (DRd[0,∞),dM1)3 as p→∞, and by Lemma 3.5 the sequence {(Hnm(p)−H~nm(p),kp,ℓp,Xnm(p))} has (AVCI). Then, the result follows immediately from [21, Thm. 3.6].
∎
3.2 Dealing with the remainder integrals
Let η,γ>0, T>0 and Xn=Mn+An the semimartingale decomposition of the Xn satisfying (GD). In this section, we are going to investigate the limiting behaviour of the remainder integrals
[TABLE]
By M1 tightness of the Xn and Hn, choose δ,R>0 such that Pn(An,k∁)≤η
for all n≥1, and ℓ≥1 large enough that 2∣Θℓ∣<δ, where
[TABLE]
and
[TABLE]
denotes the maximal number of increments of Hn larger than ak in size. Its tightness (as well as the tightness of the running supremum), is a well-known standard property of M1 tight sequences of stochastic processes (see e.g. [21, Cor. A.9]). We shall point out that {#{j:τjn,k,ℓ≤T}>R}⊆{NakT(Hn)>R}, and therefore there are at most R stopping times τjn,k,ℓ, j≥1, with τjn,k,ℓ≤T on the set An,k.
Towards the next lemma, recall the definition of w′ in (2) of the proof of Lemma 3.1. By accessing the ’future’ of the dynamics, we will be able to closely approximate sequences of real-valued càdlàg processes, which are tight in M1, on small enough intervals through monotone step functions. Lemma 3.7 formalises this observation for deterministic paths.
Lemma 3.7**.**
Let x∈DR[0,∞), γ,δ>0, T>0 and 0≤t1<t2≤T with t2−t1≤δ. If w′(x,δ)<γ/2, then there exists an increasing càdlàg step function ξ:[t1,t2]→[0,1] such that ξ(t1)=0, ξ(t2)=1, and
[TABLE]
for all t∈[t1,t2].
Proof.
Define ν(λ):=x(t1)+λ(x(t2)−x(t1)), set σ0:=t1, ξ(σ0):=0 as well as iteratively
[TABLE]
for j≥1. Further, define σˉ:=inf{t>0:∣x(t)−x(t2)∣≤γ/2}∧t2. Since t2−t1<δ and w′(x,δ)≤γ/2, it holds that ∣x(σj)−ν(ξ(σj))∣≤γ/2, j≥1. By definition of the σj and a simple application of the triangle inequality, we thus obtain ∣x(σj)−x(σj+1)∣≥γ/2 for all j≥1. Set either
[TABLE]
or
[TABLE]
In both cases, the sum is—in fact—finite. Indeed, it is well-known that, on compact time intervals, the number of increments of a càdlàg function larger than γ/2 is bounded and, as described above, ∣x(σj)−x(σj+1)∣≥γ/2 for all j≥1. Moreover, from the definition of the quantities it clearly holds ∣x(t)−ν(ξ(t))∣≤γ (in the case of (3.15), on [σˉ,t2] this holds due to ∣x(σˉ)−x(t2)∣≤γ/2 and w′(x,δ)≤γ/2), and so it only remains to show that ξ is monotone.
Let us first assume x(σ1)>ν(ξ(σ0))=x(t1). Then, we immediately deduce x(t2)>x(t1). Indeed, x(t2)>x(t1) must hold since, otherwise, x(σ1)≥x(t1)+γ>x(t1)≥x(t2), and consequently there is inf{∣x(σ1)−y∣:y∈[x(t1)∧x(t2),x(t1)∨x(t2)]}≥γ, which is a contradiction to w′(x,δ)≤γ/2. Similarly, we obtain that x(σj)≥ν(ξ(σj)) for all j≥1. To see this, assume for the sake of a contradiction, that j is the first index with x(σj)<ν(ξ(σj)), which yields x(σj)≥x(σj−1)≥ν(ξ(σj−1)). Then, ν(ξ(σj−1))≤x(σj−1)≤x(σj)<ν(ξ(σj))≤x(t2), which yields that x(σj)∈[ν(ξ(σj−1)),x(t2)]. Thus, there exists λ such that x(σj)=ν(λ), implying, by definition of ξ, that ξ(σj)=λ, which contradicts x(σj)<ν(ξ(σj)). Hence, it must hold that x(σj)≥x(σj−1)≥ν(ξ(σj−1)) for all j≥1, and therefore x(σj)∈[ν(ξ(σj−1)),x(t2)]. Finally, this immediately gives us that x(σj)=ν(α) with α≥ξ(σj−1), implying ξ(σj)=α≥ξ(σj−1) and hence the monotonicity of ξ. Monotonicity in the case x(σ1)≤x(t1) can be shown analogously.
∎
The approximation in Lemma 3.7 will generally suspend adaptedness if we apply it to adapted càdlàg stochastic processes. Lemma 3.8 offers an obvious direct alternative for monotone approximation that preserves adaptedness.
Lemma 3.8**.**
Let x∈DR[0,∞), R,γ,δ>0, T>0 and 0≤t1<t2≤T with t2−t1≤δ. If w′(x,δ)<γ/2 and NγT(x)<R, then there exists a monotone càdlàg step function ξ of the form
[TABLE]
as well as ξ(t2):=limt↑t2ξ(t), where the σj are stopping times and ∣x(t)−ξ(t)∣≤γ for all t∈[t1,t2].
Proof.
Set σ0:=t1 and define iteratively
[TABLE]
for j≥1, as well as ξ as in (3.16). First consider the case that x(t1)≤x(t2). Due to w′(x,δ)<γ/2, it is immediate that x(t)∈(x(t1)−γ/2,x(t2)+γ/2). Assume for the sake of a contradiction that j≥0 is the first index such that x(σj+1)<x(σj). By definition of the stopping times this implies x(σj+1)≤x(σj)−γ and x(σj)<x(t2)+γ/2, and so we obtain inf{∣x(σj+1)−y∣:y∈[x(σj)∧x(t2),x(σj)∨x(t2)]}≥γ. This, however, contradicts w′(x,δ)<γ/2, since t1<σj<σj+1≤t2≤t1+δ. Thus, ξ is increasing on [t1,t2]. For the case x(t1)>x(t2) one can proceed similarly, deducing that ξ is decreasing.
∎
Whenever there is no risk for confusion, for the rest of this section we will simply write ⌊τjn,k,ℓ⌋ and ⌈τjn,k,ℓ⌉ to denote ⌊τjn,k,ℓ⌋Θℓ and ⌈τjn,k,ℓ⌉Θℓ. Lemma 3.7 allows us to decompose
[TABLE]
for ⌊τjn,k,ℓ⌋≤t≤⌈τjn,k,ℓ⌉ on {w′(Xn,δ)≤γ/2} (and thus on An,k), where ξj,n,k,ℓ is a coordinatewise non-decreasing, Rd-valued step function with ∣ξj,n,k,ℓ∣≤d, and ∣ϕj,n,k,ℓ∣≤dγ. Recall that d is the dimension of the random vectors Hn,Xn. We shall emphasise that neither ξj,n,k,ℓ nor ϕj,n,k,ℓ are generally adapted. This will not pose an issue in the remaining parts of this section, as will be thoroughly explained at the relevant positions. Similarly, we can decompose the Hn on An.k according to Lemma 3.7 by
[TABLE]
for τjn,k,ℓ≤t≤⌈τjn,k,ℓ⌉, where as above ζj,n,k,ℓ is a coordinatewise non-decreasing, Rd-valued step function with ∣ζj,n,k,ℓ∣≤d, and ∣ψj,n,k,ℓ∣≤dγ. Moreover, we obtain a second decomposition from Lemma 3.8,
[TABLE]
for τjn,k,ℓ≤t≤⌈τjn,k,ℓ⌉, where ζ^j,n,k,ℓ is a coordinatewise monotone and càdlàg simple Rd-valued process with ∣ζ^tj,n,k,ℓ∣≤∣Hn∣T∗, and ∣ψ^j,n,k,ℓ∣≤dγ. We point out, that—unlike the decompositions in (3.17), (3.18)—the processes of the decomposition (3.19) are in fact adapted processes.
In a next step, we are going to use the previous decompositions in order to decompose the remainder integrals on the right-hand side of (3.12). More precisely, on An,k, (3.17) gives us
[TABLE]
for each j,n,k,ℓ≥1 and t≥0. Now, applying decomposition (3.18) for the integrands of the first integral and decomposition (3.19) for the integrands of the second integral, we obtain
[TABLE]
on An,k.
We will say that a family of processes Zn,k,ℓ vanish conveniently in probability, if for every ε>0 there is
[TABLE]
With this definition at hand, we state the following lemma.
Lemma 3.9**.**
All but the first summand on the right-hand side of (3.20) vanish conveniently in probability.
Proof.
It suffices to show the claim individually for each of the four processes. On An,k, the following bounds can be derived.
-
By definition of τjn,k,ℓ, the fact that ρj−1n,k,ℓ∨(τjn,k,ℓ−∣Θℓ∣)≤⌊τjn,k,ℓ⌋≤τjn,k,ℓ, and ∣ξj,n,k,ℓ∣≤d, the second summand can be bounded by
[TABLE]
for all t≥0, n,k,ℓ≥1.
2. 2.
The ξj,n,k,ℓ are coordinatewise increasing and therefore processes of finite variation. Hence, the third summand is a Lebesgue-Stieltjes integral, and it holds that
[TABLE]
for all t≥0, n,k,ℓ≥1, due to ∣ψj,n,k,ℓ∣≤dγ, and ξj,n,k,ℓ∈[0,1]d being coordinatewise increasing on [τjn,k,ℓ,ρjn,k,ℓ].
3. 3.
With regards to the fourth summand, recall that ζ^j,n,k,ℓ is almost surely a càdlàg simple process, which can be written as
[TABLE]
for stopping times σi with σi≤σi+1 for all i≥1, and every t∈[τjn,k,ℓ,ρjn,k,ℓ]. Further recall that ∣ζ^tj,n,k,ℓ∣≤∣Hn∣T∗≤R on An,k. Without loss of generality, assume that σ1=τjn,k,ℓ. Then, the fourth summand on the right-hand side of (3.20) is a simple integral, which by restructuring of the sum (i.e. integration by parts) becomes
[TABLE]
Using that ∣ζ^tj,n,k,ℓ∣≤R, that ζ^j,n,k,ℓ is coordinatewise monotone, and ∣ϕj,n,k,ℓ∣≤dγ, we deduce
[TABLE]
for all t≥0, n,k,ℓ≥1.
4. 4.
For the last summand, we recall that ϕj,n,k,ℓ=Xn−ξj,n,k,ℓ, with ξj,n,k,ℓ∈[0,1]d coordinatewise non-decreasing and therefore of finite variation. Hence, we can rewrite the integrals as
[TABLE]
The second integral on the right-hand side of (3.21) can be estimated as in point 2 above. Turning to the first integral on the right-hand side of (3.21), we will use the good decompositions (GD) of Xn, together with the adaptedness of ψ^j,n,k,ℓ (which makes the integral process a local martingale) and the fact that ∣ψ^j,n,k,ℓ∣≤dγ by construction. An application of Lenglart’s inequality [9, Lem. I.3.30] with the L-domination property satisfied due to the classical Burkholder–Davis–Gundy inequality, we obtain
[TABLE]
for any β>0, where σ1:=inf{t≥τjn,k,ℓ:[Mn]T≥β}, σ2:=inf{t≥τjn,k,ℓ:∣Mn∣T∗≥R} and Λ denotes the ’upper’ constant arising from the Burkholder-Davis-Gundy inequality. Another application of Lenglart’s inequality to Pn([Mn]T≥β) finally, yields
[TABLE]
for any β>0, where λ>0 denotes the ’lower’ constant arising from the Burkholder-Davis-Gundy inequality. Due to (GD), without loss of generality assume that R>0 is such that limsupn→∞Pn(TV[0,T](An)>R)≤γ, and denote
Γ:=limsupn→∞En[∣ΔMT∧σ2n∣]<∞.
Since R>0 was also chosen so that we have supn≥1Pn(∣Xn∣T∗>R)≤γ, the former implies
[TABLE]
due to Mn=Xn−An. Consequently, by choosing β:=1/γ, (3.22) yields
[TABLE]
as γ→0. More directly, since the An are of finite variation, we also obtain
[TABLE]
as γ→0.
∎
Turning to the investigation of the limiting behaviour of the first summand of (3.20), we begin with the following lemma. For a càdlàg process H~0, we will define τ~j0,k,ℓ in full analogy to the quantities τj0,k,ℓ before (3.1), simply with H0 replaced by H~0.
Lemma 3.10**.**
Suppose (Hn,Xn)⇒(H~0,X~0) on (DRd[0,∞),dM1)2. Then, for all k,ℓ≥1 there is weak convergence
[TABLE]
on (DRd[0,∞),dM1)2×([0,∞)3×R4d,∣⋅∣)N as n→∞.
Proof.
Since we also have (Hn,Xn)⇒(H0,X0), due to the uniqueness of weak limits and the choice of the Θℓ and ak made at the beginning of Section 3, we recall that in particular
[TABLE]
as well as ∣Θℓ∣∈/{∣x−y∣:x,y∈DiscP~0(H~0,X~0)}, for all ℓ,k≥1, where the quantities ςak,ν,∣Θℓ∣ are defined by
[TABLE]
as in (3.32) in the Appendix.
By the generalised continuous mapping theorem [3, Thm. 2.7], it suffices to prove convergence for the deterministic counterparts of the quantities in (3.23) on (DRd[0,∞),dM1)2. In alignment with this, fix k,ℓ≥1 and assume hn:=Hn, xn:=Xn and h0:=H~0, x0:=X~0 to be deterministic càdlàg paths such that dM1(hn,h0)∨dM1(xn,x0)→0, as well as Θℓ∈/Disc(h0,x0), ∣Θℓ∣∈/{∣x−y∣:x,y∈Disc(h0,x0)}, and ςak−,ν,∣Θℓ∣(h0)=ςak,ν,∣Θℓ∣(h0) for all ν∈Θℓ. In order to ease notation, we will omit the indices k,ℓ for all respective quantities. In particular, this will apply to the τjn,k,ℓ, Θℓ and ak.
- (1)
As a first step, we note that τ1n→τ10. Indeed, τ1n=ςak,0,∣Θℓ∣(hn) for all n≥0, 0∈Θ and the continuity result in Lemma 3.18(iv) yield τ1n→τ10.
2. (2)
Recall the definition of ⌈τjn⌉Θ, ⌊τjn⌋Θ and ∣Θ∣↓ from the beginning of Section 3. Suppose τjn→τj0 for some j≥1. Then, clearly ⌈τjn⌉Θ=⌈τj0⌉Θ and ⌊τjn⌋Θ=⌊τj0⌋Θ for large enough n. To see this, first consider the case τj0∈/Θ. Let ν1,ν2∈Θ such that ν1<τj0<ν2 and (ν1,ν2)∩Θ=∅, implying ⌈τj0⌉Θ=ν2, ⌊τj0⌋Θ=ν1. Then, τjn∈(ν1,ν2) for large enough n and we immediately obtain ⌈τjn⌉Θ=ν2, ⌊τjn⌋Θ=ν1. Now, consider the case τj0∈Θ. Let ν1,ν2∈Θ such that ν1<τj0<ν2 and (ν1,ν2)∩Θ={τj0}. Hence, by definition of ∣Θ∣↓ it holds for all t∈(τj0−∣Θ∣↓/2,τj0+∣Θ∣↓/2) that ⌊t⌋Θ=ν1 and ⌈t⌉Θ=ν2, since ν1≤t−∣Θ∣↓/2<τj0 and ν2>t+∣Θ∣↓/2≤ν2. We deduce the claim for large enough n.
3. (3)
Suppose ⌈τjn⌉Θ=⌈τj0⌉Θ for large enough n. This implies τj+10=ςak,⌈τj0⌉Θ,∣Θℓ∣(h0), τj+1n=ςak,⌈τj0⌉Θ,∣Θℓ∣(hn), ⌈τj0⌉Θ∈Θ, for large enough n. As in (1), we obtain τj+1n→τj+10 by Lemma 3.18(iv). Induction from (1) and (2) finally yields τjn→τj0, 1{⌈τjn⌉Θ=⌈τj0⌉Θ}→1 and 1{⌊τjn⌋Θ=⌊τj0⌋Θ}→1 as n→∞ for all j≥1.
4. (4)
It is well-known that dM1(hn,h0)→0 as n→∞ implies hn(t)→h0(t) for all t∈/Disc(h0) (see e.g. [24, Thm. 12.5.1(v)]). Since Θ⊆[0,∞)\fgebackslashDisc(h0) and ⌈τj0⌉Θ,⌊τj0⌋Θ∈Θ for all j≥1, we deduce hn(⌈τj0⌉Θ)→h0(⌈τj0⌉Θ), hn(⌊τj0⌋Θ)→h0(⌊τj0⌋Θ) for all j≥1. Due to (3), ⌈τjn⌉Θ=⌈τj0⌉Θ and ⌊τjn⌋Θ=⌊τj0⌋Θ for large enough n, therefore implying hn(⌈τjn⌉Θ)→h0(⌈τj0⌉Θ) and hn(⌊τjn⌋Θ)→h0(⌊τj0⌋Θ) as n→∞, for every j≥1. Finally, apply the same argument to xn, x0.
∎
Toward the next proposition, let us define
[TABLE]
for each j,n,k,ℓ≥1 and t≥0.
Proposition 3.11**.**
Let c>0. There exists a subsequence of {(Hn,Xn)} (which, for conciseness of notation, we will denote as the original sequence) and a probability space (Ω~0,F~0,P~0) such that
[TABLE]
on ({\bf D}_{\mathbb{R}^{d}}[0,\infty),\mathop{}\!\mathrm{d}_{\operatorname{\operatorname{M}_{1}}})^{2}\times\big{(}([0,\infty)^{3}\times\mathbb{R}^{4d},|\cdot|)\times({\bf D}_{\mathbb{R}^{d}}[-c,\infty),\mathop{}\!\mathrm{d}_{\operatorname{\operatorname{M}_{1}}})\big{)}^{\mathbb{N}} as n→∞, where the limiting quantities are all defined on (Ω~0,F~0,P~0). In particular, in this case there is L(H~0,X~0)=L(H0,X0).
Proof.
For each j,k,ℓ≥1, the processes Yj,n,k,ℓ, n≥1, are coordinatewise non-decreasing and, by construction of ζj,n,k,ℓ,ξj,n,k,ℓ, almost surely bounded by one in each component. By naturally extending the processes Yj,n,k,ℓ to [−c,∞) for some c>0, each component is tight in (DR[−c,∞),dM1). Indeed, the M1 tightness criteria (1)-(3) in the proof of Lemma 3.1 can be seen to be immediately satisfied, where the local uniform convergence at zero is simply replaced by local uniform convergence at −c. Now, coordinatewise tightness is sufficient for tightness of the Yj,n,k,ℓ on the product space (DR[−c,∞),dM1)d, due to the characterisation of compact sets in product Hausdorff spaces as precisely those closed sets which are contained in the Cartesian product of compact sets of the individual spaces. In this case, that is Q is compact in (DR[−c,∞),dM1)d if and only if Q is closed and Q⊆K1×...×Kd with each Ki compact in (DR[−c,∞),dM1).
Repeating this argument, we obtain the tightness of the sequence
[TABLE]
n≥1, on the respective product spaces
[TABLE]
endowed with their product Borel σ-algebras. By Prokhorov’s theorem, to {SLn}n≥1 there exists a subsequence (which we will denote as the original sequence) such that the law of SLn converges weakly, that is
[TABLE]
as n→∞. It is straightforward to verify that the family {μL} satisfies the assumptions of the Kolmogorov extension theorem, for example by the continuous mapping theorem. Hence, there exists a probability space (Ω~0,F~0,P~0) and tuples
[TABLE]
on this space taking values in the product space
[TABLE]
endowed with its product Borel σ-algebra, such that the pushforward measure through the restrictions of L(S~0) to the respective first 2+8L3 components coincides with μL.
Indeed, the concrete specified form of the tuple S~0—except for the quantities Y~j,0,k,ℓ—follows directly from the continuity of coordinate restrictions, the continuous mapping theorem [3, Thm. 2.7] and Lemma 3.10. Moreover, we clearly have L(H~0,X~0)=L(H0,X0). As per Lemma 3.12 below, the limiting Y~j,0,k,ℓ are coordinatewise non-decreasing, hence yielding their convergence in the stronger space (DRd[−c,∞),dM1) (see e.g. [24, Thm. 12.7.3]).
∎
We will collect a crucial property of the processes Y~j,0,k,ℓ that arise in the limit of (3.25).
Lemma 3.12**.**
Under the notation of Proposition 3.11, it holds that for all j,k,ℓ≥1,
[TABLE]
and the process Y~j,0,k,ℓ is almost surely coordinatewise non-decreasing.
Proof.
Fix j,k,ℓ≥1 and define the set
[TABLE]
which is open in the product topology of (DR[0,∞),dM1)d×([0,∞),∣⋅∣) and clearly
[TABLE]
Since (Yj,n,k,ℓ,τ~jn,k,ℓ)⇒(Y~j,0,k,ℓ,τ~j0,k,ℓ) according to Proposition 3.11, making use of the Portmanteau theorem yields
[TABLE]
where the last equation follows directly from the definition of the Yj,n,k,ℓ in (3.24).
One now proceeds in the same way with (Y~j,0,k,ℓ,⌈τ~j0,k,ℓ⌉) for the open set
[TABLE]
in order to complete the proof of the first part of the lemma. The monotonicity follows similarly due to the fact that the set of non-decreasing càdlàg paths is a closed subset of the M1 Skorokhod space.
∎
Recall the definition of stopping times {τ~j0,k}k,j≥1 and T(H~0)={σ~j0,k}k,j≥1 from (2.1).
Lemma 3.13**.**
To every subsequence of {(Hn,Xn)} such that there is convergence (3.25), there exists a subsequence of the natural numbers {ℓr} and càdlàg processes Y~j,0,k, j,k≥1, on a common probability space such that
Y~j,0,k,ℓr⇒Y~j,0,k as r→∞ on (DRd[0,∞),dM1) for all j,k≥1. Without loss of generality, we may assume the common probability space to be (Ω~0,F~0,P~0) from Proposition 3.11 and that
[TABLE]
on ({\bf D}_{\mathbb{R}^{d}}[0,\infty),\mathop{}\!\mathrm{d}_{\operatorname{\operatorname{M}_{1}}})^{2}\times\big{(}([0,\infty)^{3}\times\mathbb{R}^{4d},|\cdot|)\times({\bf D}_{\mathbb{R}^{d}}[-c,\infty),\mathop{}\!\mathrm{d}_{\operatorname{\operatorname{M}_{1}}})\big{)}^{\mathbb{N}} as r→∞. Moreover, each Y~j,0,k∈[0,1]d is a single-jump process and can be written as
[TABLE]
Proof.
The relative compactness of the left-hand side of (3.26) follows from the relative compactness of the individual component sequences, in the same way as described at the beginning of the proof of Proposition 3.11. For this, in particular one makes use of the fact that, according to Lemma 3.12, the Y~j,0,k,ℓ are bounded coordinatewise non-decreasing processes. Hence, there exists a subsequence {ℓr} of the natural numbers such that the left-hand side of (3.26) converges weakly as r→∞. Denote the individual limits of the Y~j,0,k,ℓr by Y~j,0,k. By definition of the τ~j0,k,ℓ and the paths of H~0 being càdlàg, it becomes clear that almost surely τ~j0,k,ℓ=τ~j0,k for every j,k≥1 and large enough ℓ. This directly entails ⌈τ~j0,k,ℓ⌉↓τ~j0,k and ⌊τ~j0,k,ℓ⌋↑τ~j0,k almost surely as ℓ→∞. The processes H~0, X~0 being càdlàg, this also implies the almost sure convergence (H~⌊τ~j0,k,ℓr⌋0,H~⌈τ~j0,k,ℓr⌉0,X~⌊τ~j0,k,ℓr⌋0,X~⌈τ~j0,k,ℓr⌉0)→(H~τ~j0,k−0,H~τ~j0,k0,X~τ~j0,k−0,X~τ~j0,k0).
Without loss of generality, we may assume the common limiting probability space to be (Ω~0,F~0,P~0) from Proposition 3.11, and denote all limiting quantities as on the right-hand side of (3.26). Indeed, otherwise take the limiting processes H~0,X~0 and redo Proposition 3.11. According to Lemma 3.12, the Y~j,0,k,ℓ are zero on [0,τ~j0,k,ℓ) and constant on (τ~j0,k,ℓ,∞). Making use of the sets B,C in the proof of Lemma 3.12 being open, the convergence (Y~j,0,k,ℓr,τ~j0,k,ℓr,⌈τ~j0,k,ℓr⌉)⇒(Y~j,0,k,τ~j0,k,τ~j0,k) on (DRd[−c,∞),dM1)×([0,∞),∣⋅∣)2, we deduce the specific form of the single-jump process Y~j,0,k as in the proof of Lemma 3.12.
∎
Lemma 3.14**.**
To every subsequence of {(Hn,Xn)} and every subsequence of the natural numbers {ℓr} such that there is convergence (3.25) and (3.26), there exists a subsequence {kp} of the natural numbers and random variables ξ~σ~j0,i0∈[0,1]d—which, without loss of generality, live on the common probability space (Ω~0,F~0,P~0) from Proposition 3.11 and Lemma 3.13—such that
[TABLE]
as p→∞ on (DRd[0,∞),dM1)2×(Rd,∣⋅∣)N.
Proof.
A simple application of Prokhorov’s theorem to {(H~0,X~0,(Y~σ~j0,ij,0,kp)i,j≥1)}p≥1 yields the claim. Without loss of generality, we may assume the common limiting probability space to be (Ω~0,F~0,P~0) from Proposition 3.11 and Lemma 3.13. Indeed, otherwise take the limiting processes H~0,X~0 and redo Proposition 3.11.
∎
In the sequel, whenever we write "⇒n,r,p→∞" it is to describe the consecutive weak limits starting with the weak limit in n for each r,p, then the weak limit in r for each p, and finally the weak limit in p.
Proposition 3.15**.**
There exists a subsequence of {(Hn,Xn)} (which we will denote as the original sequence), subsequences of the natural numbers {ℓr}, {kp}, and a probability space (Ω~0,F~0,P~0) such that
[TABLE]
on (DRd[0,∞),dM1)3, where the limiting quantities all live on the common probability space (Ω~0,F~0,P~0) and ξ~σ0∈[0,1]d, σ∈T(H~0).
Proof.
Let {(Hn,Xn)} be a further subsequence chosen according to Proposition 3.11 such that the convergence (3.25) holds. Then, choose a subsequence {ℓr} such that there is (3.26) and finally a subsequence {kp} admitting (3.27).
Since weak convergence on (DRd[0,∞),dM1) is equivalent to weak convergence on (DRd[0,T],dM1) for all T>0 in an unbounded subset of [0,∞), it suffices to show the weak convergence on (DRd[0,T],dM1)3 for all T∈Θℓr. Fix T∈Θℓr. Then, for any p,r≥1 and on the compact intervals [0,T], the number of jumps of the Hn larger than akp are tight in n, i.e., supn≥0Pn(τJn,kp,ℓr≤T)→0 as J→∞. Therefore, it is sufficient to show
[TABLE]
in order to obtain
[TABLE]
on (DRd[0,T],dM1)3. Note that addition is a continuous operation on the M1 Skorokhod space whenever the limiting objects have no common discontinuity. On account of Lemma 3.12, Disc(Y~i,0,kp,ℓr)∩Disc(Y~j,0,kp,ℓr)=∅ almost surely whenever i=j. Hence, (3.2) follows from generalised continuous mapping [3, Thm. 2.7] and (3.25), together with the fact that T is an almost sure continuity point of all limiting quantities.
Next, a similar argument as in the first part of the proof together with Lemma 3.13 (note in particular that the Y~j,0,kp=Y~τ~j0,kpj,0,kp1[τ~j0,kp,∞), j≥1, do not have common discontinuities) yields
[TABLE]
on (DRd[0,T],dM1)3 as r→∞.
Finally, recall the definition of the stopping times σ~j0,i given in (2.2) and let us rewrite
[TABLE]
Since (H0,X0) and (H~0,X~0) coincide in law, Condition (R2) and ∣Y~j,0,k∣≤d ensure that, uniformly on compacts, {Z~0,kp} is a Cauchy sequence with respect to convergence in probability. Thus, it suffices to investigate the limiting behaviour of
[TABLE]
as p→∞, for each K≥1. And by a similar argument as in the first part of the proof, it even is enough to consider
[TABLE]
as p→∞, for each K,J≥1. Applying the continuous mapping theorem and Lemma 3.14, we deduce
[TABLE]
as p→∞.
∎
Proposition 3.16**.**
There exists a subsequence of {(Hn,Xn)} (which we will denote as the original sequence), subsequences of the natural numbers {ℓr}, {kp}, and a probability space (Ω~0,F~0,P~0) such that
[TABLE]
on (DRd[0,∞),dM1)3, where the limiting quantities all live on the common probability space (Ω~0,F~0,P~0) and ξ~σ0∈[0,1]d, σ∈T(H~0).
Proof.
Based on the decomposition (3.20), combining Lemma 3.9 (note that γ,η>0 was arbitrary and Pn(An,k∁)≤η) and Proposition 3.15 yields the claim.
∎
3.3 Proof of our main result Theorem 2.3
We are now ready to prove Theorem 2.3.
Proof of Theorem 2.3.
Since the topology of weak convergence on the separable metric space (DRd[0,∞),dM1)3 is metrizeable, from Proposition 3.16 we can extract subsequences {nm}, {ℓr}, {kp}, and a probability space (Ω~0,F~0,P~0), such that for any increasing functions κ1,κ2:N→N holds that
[TABLE]
on (DRd[0,∞),dM1)3 as p→∞. Now, according to Corollary 3.6, we can find subsequences {nm(p)}, {ℓr(p)} of {nm} and {ℓr} respectively with
[TABLE]
on (DRd[0,∞),dM1)3 as p→∞. Indeed, note that the results in Section 3.1 hold equally true if we replace (H0,X0) by (H~0,X~0) as both quantities coincide in law. Since p↦m(p), p↦r(p) are increasing, the convergence of the remainder integrals above holds true for these subsequences. Further, without loss of generality we may assume
[TABLE]
on (DRd[0,∞),dM1)4 as p→∞. Now, given that (H0,X0) and (H~0,X~0) coincide in law on (DRd[0,∞),dM1)2 endowed with its Borel σ-algebra, Condition (R1) also holds for the pair (H~0,X~0). Therefore, it holds P~0-almost surely that coordinatewise
[TABLE]
for all t≥0, since DiscP~0(H~0,X~0) is at most countable.
Making use of the fact the map (α,β)↦α+β is continuous in (DRd[0,∞),dM1)2 at all points (α,β) such that Δα(i)(t)Δβ(i)(t)≥0 for all components 1≤i≤r and all t≥0 (see e.g. [24, Thm. 12.7.3]), the generalised continuous mapping theorem yields
[TABLE]
on (DRd[0,∞),dM1)3 as p→∞.
∎
3.4 Proof of Proposition 2.4
In this section, we will give a brief outline of how to prove Proposition 2.4. We will proceed exactly as in the proofs in Sections 3.1–3.3, except for the limiting behaviour of the first summand on the right-hand side of (3.20). Under the assumptions of Proposition 2.4, the integral part of this term can be shown to asymptotically equal one. For simplicity, let us assume d=1. The proof for d>1 can be adapted in a straightforward fashion.
Conduct the proof in full analogy to the one of Theorem 2.3 until (3.20), where for the ξjn,k,ℓ in the decomposition (3.17) we make use of the specific construction (3.15), while the ζjn,k,ℓ in decomposition (3.18) are constructed according to (3.14). Assume that the elements of T∪Θℓ are continuity point of all Hn, n≥0. Indeed, this comes with no loss of generality as the sets DiscPn(Hn) are known to be countable, and therefore this does not disturb the construction of the sets Θℓ at the beginning of Section 3. Further, let ℓ≥1 be large enough so that, due to (2.4), we have
[TABLE]
for all n,k≥1. Indeed, this is possible since, by definition, supj≥1∣ρjn,k,ℓ−τjn,k,ℓ∣≤∣Θℓ∣→0 as ℓ→∞. Moreover, on the event
[TABLE]
we have, in particular, that ∣X⌊τjn,k,ℓ⌋n−Xsn∣>γ implies ∣Hs−n−H(ρjn,k,ℓ∧T)−n∣≤γ/2 for all j≥1 and ⌊τjn,k,ℓ⌋≤s≤ρjn,k,ℓ∧T. Inspecting the constructions (3.15) of the
non-decreasing step function ξ in the proof of Lemma 3.7, we deduce that the following holds true for the quantities ξj,n,k,ℓ in (3.17) on Γn,k,ℓ(γ)∩An,k: if we define
[TABLE]
then ξj,n,k,ℓ≡0 on [⌊τjn,k,ℓ⌋,σjn,k,ℓ). Clearly, it must also hold that
[TABLE]
since we have assumed to be on the event Γn,k,ℓ(γ). Thus, by construction (3.14) of the processes ζj,n,k,ℓ and since ρjn,k,ℓ and T were chosen to be continuity points of Hn, according to Lemma 3.7 we obtain that ζj,n,k,ℓ≡1 on (σˉjn,k,ℓ,ρjn,k,ℓ∧T] for some σˉjn,k,ℓ<σjn,k,ℓ (where ∣Hσˉjn,k,ℓn−Hρjn,k,ℓ∧Tn∣≤γ/2). Thus, from ξj,n,k,ℓ≡0 on [⌊τjn,k,ℓ⌋,σjn,k,ℓ)⊃[⌊τjn,k,ℓ⌋,σ~jn,k,ℓ], ξρjn,k,ℓ∧Tj,n,k,ℓ=1, and ζj,n,k,ℓ≡1 on (σ~jn,k,ℓ,ρjn,k,ℓ∧T] we deduce
[TABLE]
With this information at hand, first replace all instances of An,k by Γn,k,ℓ(γ)∩An,k and continue with the proofs from Lemma 3.9 to Lemma 3.13. In analogy to the proof of Lemma 3.12, we can then establish that Y~j,0,k,ℓ≡1 on [⌈τ~j0,k,ℓ⌉,∞) and, by definition, Y~j,0,k,ℓ≡0 on [0,⌊τ~j0,k,ℓ⌋). And finally, as in the proof of Lemma 3.13 this translats to the Y~j,0,k so that they are of the form
[TABLE]
Now follow the procedure until the end of Section 3.3 and note that, due to the above, ξ~σ0≡1 for all σ∈T(H~0). This, however, implies that the weak limit in (2.3) is
[TABLE]
which does not depend on the specific subsequence, hence there is actual weak convergence (2.5).
3.5 Proof of Corollary 2.5
Proof of Corollary 2.5.
The proof follows the exact same structure of the proof of Theorem 2.3 in Sections 3.1–3.3, and we will simply highlight the instances where specific modifications are required.
Define sets
[TABLE]
with t0=0 and tr=T, where the outer infimum runs over all partitions of [0,T] with mesh size no smaller than ∣Θℓ∣. Due to the J1 tightness of the Xn, by [3, Thm. 13.2] it holds that limsupℓ→∞limsupn→∞Pn(A~n,k,ℓ)=0. Therefore, note that replacing An,k in (3.13) by An,k,ℓ:=An,k∩A~n,ℓ leaves the proof of Theorem 2.3 unaffected. With regards to Section 3.2, the following is clearly true on A~n,ℓ: for all k,j≥1 there exists a random time κjn,k,ℓ∈[τjn,k,ℓ∧T,ρn,k,ℓ∧T) such that
[TABLE]
Consequently, the ξj,n,k,ℓ from (3.17)—obtained by virtue of Lemma 3.7 with choice (3.14)—are single-jump processes of the form ξj,n,k,ℓ=1[κjn,k,ℓ,∞), and the Yj,n,k,ℓ in (3.24) become
[TABLE]
where we recall 0≤ζj,n,k,ℓ≤1. Evidently, these processes are tight in the J1 topology, and so all convergences related to the Yj,n,k,ℓ and Y~j,0,k,ℓ in Section 3.2 can be seen to hold in J1 instead of M1. Thus, it is straightforward to show that the convergences in Proposition 3.15 and Proposition 3.16, in fact, hold on (DRd[0,∞),dM1)×(DRd[0,∞),dJ1)2. As a consequence, also the convergence in (3.30) can be strengthened, namely to be on (DRd[0,∞),dM1)×(DRd[0,∞),dJ1)3. Finally, since \big{|}\Delta\int_{0}^{s}H^{n}_{r-}-\tilde{H}^{n,k,\ell}_{r-}\mathop{}\!\mathrm{d}X_{r}^{n}\big{|}\vee\big{|}\Delta\int_{0}^{s}\tilde{H}^{n,k,\ell}_{r-}\mathop{}\!\mathrm{d}X_{r}^{n}\big{|}\leq 2|H^{n}|_{s}^{*}|\Delta X^{n}_{s}| for all s>0 almost surely, we can apply Lemma 3.21 together with the continuous mapping theorem and [21, Prop. A.3] in order to obtain (3.31) on (DRd[0,∞),dM1)×(DR2d[0,∞),dJ1).
∎
Appendix
In this appendix we collect a few technical lemmas.
Lemma 3.17**.**
The set
[TABLE]
is at most countable.
Proof.
Assume for the sake of a contradiction that there exists ε>0, an interval (b1,b2)⊂[0,∞), and uncountably many a∈(b1,b2) such that P0(∣ΔHϕ(a)0∣=a or ∣ΔXϕ(a)0∣=a)>ε for some map ϕ:(b1,b2)→[0,∞). If the set
[TABLE]
is countable, then there is at least one s∈Λ such that ϕ maps infinitely many a∈(b1,b2) to s. By σ-additivity of P0, this yields a contradiction to the finiteness of the probability measure P0. Hence, Λ must be uncountable and therefore, in particular, there is an interval [0,T] containing infinitely many distinct ϕ(a)∈Λ, which implies
[TABLE]
for infinitely many distinct ϕ(a), since b1<a. This however, yields a contradiction as it is well-known that {s>0:P0(∣ΔHs0∣∨∣ΔXs0∣>c)>β)∩[0,T] is finite for each c,β>0.
∎
For t≥0, μ>0 and a>0 we define
[TABLE]
for all α∈DRd[0,∞), where α(i) denotes the i-th coordinate of α. Further let Disc(α)={s>0:∣Δα(s)∣>0}. Following in the style of [9, p.340/341], we state the following lemma.
Lemma 3.18**.**
Under the notation of (3.32) it holds that
- (i)
for all α∈DRd[0,∞), t≥0 and μ>0, the map a↦ςa,t,μ(α) is non-decreasing and right-continuous,
2. (ii)
for given t≥0, μ>0 and α∈DRd[0,∞), the set
[TABLE]
where ςa−,t,μ(α):=lima~↑aτa~,t,μ(α), is at most countable,
3. (iii)
for all t≥0, μ>0 and a>0, the maps α↦ςa,t,μ(α) and α↦ςa−,t,μ(α) are Borel-measurable on (DRd[0,∞),dM1),
4. (iv)
for all t≥0, μ>0 and a>0, the map α↦ςa,t,μ(α), (DRd[0,∞),dM1)→([0,∞),∣⋅∣) is continuous at each point α satisfying a∈/Vt,μ(α), t∈/Disc(α) and μ∈/{∣x−y∣:x,y∈Disc(α)}.
Proof.
(i) is trivial. (ii) As a non-decreasing, left-continuous map, a↦τa,t,μ(α) has at most countably many discontinuities, hence Vt,μ(α) is at most countable. (iii) follows from standard arguments based on the right-continuity of the paths and the fact that the Borel σ-algebra is generated by the time evaluations. For the brevity of this account, we do not provide a detailed proof.
(iv) Let dM1(αn,α)→0 and a∈/Vt,μ(α). We begin by showing that limsupn→∞ςa,t,μ(αn)≤ςa,t,μ(α). Let ε>0 and choose r,s∈[0,∞)\fgebackslashDisc(α) such that t∨(s−μ)≤r≤s as well as s<ςa,t,μ(α)+ε, and ∣α(r)−α(s)∣>a. It is well-known that M1 convergence implies pointwise convergence at continuity points of the limit and so we deduce ∣αn(r)−αn(s)∣>a for large enough n. Hence, ςa,t,μ(αn)≤s<ςa,t,μ(α)+ε and, since ε was arbitrary, it follows limsupn→∞ςa,t,μ(αn)≤ςa,t,μ(α). It remains to show liminfn→∞ςa,t,μ(αn)≥ςa,t,μ(α). Fix a continuity point T≥ςa,t,μ(α). Without loss of generality, assume towards a contradiction that there are ε>0, 1≤i≤d, and times rn with t∨(ςa,t,μ(αn)−μ)≤rn≤ςa,t,μ(αn)<ςa,t,μ(α)−ε such that ∣αn(i)(rn)−αn(i)(ςa,t,μ(αn))∣>a for all n≥1. Clearly, we may therefore also assume that d=1, i.e. α(i)=α.
Now, let Πn be the set of all parametric representations (un,pn) of αn, n≥1, on [0,T]; and analogously define Π for α. Recall that dM1(αn,α)→0 as n→∞ implies
[TABLE]
as n→∞. For an introduction to parametric representations and path convergence in M1, see [24, pp. 80-83]. Choose parametric representations (un,pn),(u,p) with ∣un−u∣1∗∨∣pn−p∣1∗→0. Clearly, there exist zn,z~n∈[0,1] such that pn(zn)=ςa,t,μ(αn),pn(z~n)=rn, as well as ∣un(zn)−un(z~n)∣>a. Without loss of generality, assume zn→z, z~n→z~, for some z,z~∈[0,1]. Otherwise pass to a subsequence. An application of the triangle inequality yields
[TABLE]
By continuity of u, we deduce ∣u(z)−u(z~)∣≥a. Moreover, another simple application of the triangle inequality and the continuity of p imply that ςa,t,μ(αn)=pn(zn)→p(z) and pn(z~n)→p(z~), yielding further that t∨(p(z)−μ)≤p(z~)≤p(z)≤ςa,t,μ(α)−ε. Let δ>0 and distinguish four cases:
(1) if p(z),p(z~)∈/Disc(α), then it holds u(z)=α(p(z)), u(z~)=α(p(z~)), and thus a≤∣u(z)−u(z~)∣=∣α(p(z))−α(p(z~))∣ implies ςa−,t,μ(α)≤ςa,t,μ(α)−ε. Since a∈/Vt,μ(α) we know ςa−,t,μ(α)=ςa,t,μ(α), hence there is a contradiction.
(2) if p(z)∈Disc(α) and p(z~)=p(z), then due to the fact that u(z),u(z~) lie on the completed graph of α, u(z),u(z~)∈[α(p(z)−)∧α(p(z)),α(p(z)−)∨α(p(z))]. From ∣u(z)−u(z~)∣≥a it thus follows ∣α(p(z))−α(p(z)−)∣≥a. Hence, there exists a time r with t∨(p(z)−μ)<r<p(z)≤ςa,t,μ(α)−ε such that ∣α(r)−α(p(z))∣>a−δ, and by consequence ςa−δ,t,μ(α)≤ςa,t,μ(α)−ε. Since δ was arbitrary, we deduce ςa−,t,μ(α)≤ςa,t,μ(α)−ε, which yields a contradiction as in the first case.
(3) if p(z)∈Disc(α) and p(z~)<p(z), then due to t∈/Disc(α) and μ∈/{∣x−y∣:x,y∈Disc(α)} we deduce t∨(p(z)−μ)∈/Disc(α). Since u(z) lies on the completed graph of α, as in case (2) from ∣u(z)−u(z~)∣≥a we deduce the existence of a time s with t∨(p(z)−μ)≤p(z~)<s≤p(z) and ∣α(s)−u(z~)∣>a−δ. Also u(z~) lies on the completed graph and so there is a time r with t∨(p(z)−μ)≤r<s≤p(z) such that ∣α(s)−α(r)∣>a−δ. Indeed, if p(z~)=t∨(p(z)−μ), then we can choose r=p(z~) and, given that t∨(p(z)−μ)∈/Disc(α), this gives r=p(z~). Otherwise, either ∣α(s)−α(p(z~))∣>a−δ or ∣α(s)−α(p(z~)−)∣>a−δ and the existence of such r is guaranteed due to α being càdlàg. The desired contradiction follows, as in case (2), from ∣α(s)−u(z~)∣>a−δ for all δ>0.
(4) if p(z)∈Disc(α) and p(z~)∈/Disc(α), a contradiction follows in a similar way to (3).
∎
Lemma 3.19**.**
The set \{a>0\mathrel{\mathop{\ordinarycolon}}\mathbb{P}^{0}\big{(}a\in V_{t,\mu}(H^{0})\big{)}>0\}
is at most countable for every t≥0 and μ>0.
Proof.
The process a↦ςa,t,μ(H0) is càdlàg by (i) of Lemma 3.18. Note that \{a>0\mathrel{\mathop{\ordinarycolon}}\mathbb{P}^{0}\big{(}a\in V_{t,\mu}(H^{0})\big{)}>0\}=\operatorname{Disc}_{\mathbb{P}^{0}}(a\mapsto\varsigma_{a,t,\mu}(H^{0})) and it is well-known that the latter set is at most countable.
∎
Lemma 3.20**.**
Let Θ be a countable set with ∣Θ∣=supx,y∈Θ∣x−y∣>0. Then, the set
[TABLE]
is at most countable.
Proof.
Follows immediately from Lemma 3.19.
∎
Lemma 3.21**.**
Let {Zn}, {Z~n}, {Hn} and {Xn} be stochastic processes such that (Hn,Xn,Zn,Z~n)⇒(H,X,Z,Z~) on (DRd[0,∞),dM1)×(DRd[0,∞),dJ1)3. If, for every n≥1, it holds ∣ΔZsn∣∨∣ΔZ~sn∣≤2∣Hn∣s∗∣ΔXsn∣ almost surely for all s>0. Then, Xn, Zn and Z~n converge together weakly on the strong J1 Skorokhod space, that is
[TABLE]
Proof.
Denote Λα:={(h,x,z,z~):∣Δzs∣∨∣Δz~s∣≤2∣h∣s∗∣Δxs∣ for all s>0}⊆(DRd[0,∞))4 and write ρ(λ1,...,λ4),(β1,...,β4)):=dM1(λ1,β1)∨max{dJ1(λi,βi):i=2,...,4}. If we can show that the map
[TABLE]
is sequentially continuous in the sense g(yn)→g(y) whenever yn∈Λα and yn→y∈Λα, then the result of the the lemma follows from the generalised continuous mapping theorem [23, Thm. 1.11.1]. To this aim, let {(hn,xn,zn,z~n)}⊆Λα converging to some (h,x,z,z~)∈Λα with respect to ρ as n→∞. Fix T>0 a continuity point of (z,z~,h,x) and recall that ∣hn∣T∗ is uniformly bounded by some K>1 as a result of the sequence of hn being relatively compact in M1. Denote by λnz,λnz~,λnx:[0,T]→[0,T] the increasing homeomorphisms such that ∣xn∘λnx−x∣T∗∨∣λnx−Id∣T∗→0, and analogously for zn,z~n.
Now, for any s∈Disc(x)∩Disc(z)=Disc(z), there is N≥1 such that λnz(s)=λnx(s) for all n≥N. Indeed, otherwise there exist ε>0, s∈Disc(x)∩Disc(z) with ∣Δx(s)∣∨∣Δz(s)∣>ε, and a subsequence satisfying λnz(s)=λnx(s) for all n≥1. Recall that λnx(s),λnz(s)→s as n→∞. It is straightforward to show ∣Δxn(λnx(s))∣→∣Δx(s)∣>ε and ∣Δzn(λnz(s))∣→∣Δz(s)∣>ε. Since ∣Δzn(λnz(s))∣≤2∣hn∣λnz(s)∗∣Δxn(λnz(s))∣≤2K∣Δxn(λnz(s))∣, we deduce ∣Δxn(λnz(s))∣>ε/K for large enough n. However, this means that on any interval (s−θ,s+θ), θ>0, the xn jump twice with jump sizes at least ε/K for large enough n (precisely at λnz(s),λnx(s)), and therefore cannot converge in J1, which yields a contradiction. In full analogy, we obtain that for any s∈Disc(x)∩Disc(z~)=Disc(z~) there is N≥1 such that λnz~(s)=λnx(s) for all n≥N.
In a next step, observe that ∣zn∘λnx−z∣T∗→0 is equivalent to ∣zn∘λnz−zn∘λnx∣T∗→0. Assume towards a contradiction that ∣zn∘λnz−zn∘λnx∣T∗→0. Then, there exist ε>0, a subsequence {nk} and times {sk}⊆[0,T] with ∣znk(λnkz(sk))−znk(λnkx(sk))∣>ε for all k≥1. Extract a further subsequence of times, which we will also denote by {sk} such that sk→s∈[0,T]. Assume that {sk} is increasing (the case {sk} decreasing can be treated similarly). Then, we obtain
[TABLE]
for each k≥1, and, if s∈/Disc(z), (3.34) immediately leads to a contradiction due to ∣(λnz)−1−Id∣T∗∨∣λnx−Id∣T∗→0. On the other hand, if s∈Disc(z), then it is known from above that λnz(s)=λnx(s) for large enough n and thus, since both homeomorphisms are strictly increasing, λnkz(sk),λnkx(sk)<λnkz(s)=λnkx(s) for large enough k. Consequently, s>(λnkz)−1(λnkx(sk)) for large enough k and at the same time we still have (λnkz)−1(λnkx(sk))→s. Hence, we deduce a contradiction to (3.34) since z(sk)→z(s−) and z∘(λnkz)−1(λnkx(sk))→z(s−). A similar procedure shows ∣z~n∘λnx−z~∣T∗→0.
Finally, this yields ∣(xn,zn,z~n)∘λnx−(x,z,z~)∣T∗→0 and therefore the convergence (zn,z~n,xn)→(z,z~,x) on (DR3d[0,∞),dJ1).
∎
Acknowledgements. I would like to thank Andreas Søjmark for introducing me to the broader research area years ago and for helpful discussions during the development of this work. Moreover, I am grateful to Giulia Livieri for her kind and valuable support. Part of this research was funded by PRIN 2022, project no. P20229CJRS – CUP E53D2301652000, and the Research Investment Funding of the Department of Statistics at the LSE.