1. Introduction and main results
Strong andweak convergence of numerical schemes for stochastic differential equations (SDEs) with regular coefficients have enjoyed considerable investigation; see the monographs available, e.g. [Reference Kloeden and Platen12]. As we know, (forward) Euler–Maruyama (EM) is the simplest algorithm to discretize SDEs whose coefficients are of linear growth. However, an EM scheme is invalid once the coefficients of the SDEs involved are of nonlinear growth; see e.g. [Reference Hutzenthaler, Jentzen and Kloeden10] for some illustrative counterexamples. Hence other variants of the EM scheme were designed to treat SDEs with non-global Lipschitz conditions; see [Reference Higham, Mao and Stuart7] and [Reference Higham, Mao and Yuan8] for the backward EM scheme, [Reference Dareiotis, Kumar and Sabanis2] and [Reference Hutzenthaler, Jentzen and Kloeden11] for the tamed EM algorithm, and [Reference Mao18] concerning the truncated EM method, to name a few. Today the convergence analysis of numerical algorithms for SDEs with irregular coefficients also receives a great deal of attention; see e.g. [Reference Gyöngy and Rásonyi5] for SDEs with Hölder-continuous diffusions via the Yamada–Watanabe approximation approach, [Reference Yan31] for SDEs whose drift terms are Hölder-continuous with the aid of the Meyer–Tanaka formula and estimates on local times, and [Reference Bao, Huang and Yuan1] and [Reference Pamen and Taguchi24] for SDEs whose drifts are Hölder(–Dini)-continuous by regularities of the corresponding backward Kolmogorov equations. In the past few years, numerical approximations of SDEs with discontinuous drifts have also gained a lot of interest; see e.g. [Reference Halidias and Kloeden6], [Reference Leobacher and Szölgyenyi16], [Reference Leobacher and Szölgyenyi17], [Reference Müller-Gronbach and Yaroslavtseva20], and [Reference Neuenkirch, Szölgyenyi and Szpruch21]. Until now, most of the existing literature on strong approximations of SDEs with discontinuous drift coefficients have been implemented under the additional assumption that the drift term is piecewise Lipschitz-continuous.
Since the pioneering work of Zvonkin [Reference Zvonkin34], the well-posedness of SDEs with irregular coefficients has made great progress in several ways; see e.g. [Reference Flandoli, Gubinelli and Priola3], [Reference Gyöngy and Martinez4], [Reference Krylov and Röckner14], [Reference Xie and Zhang30], and [Reference Zhang32] for SDEs driven by Brownian motions or jump processes, and [Reference Huang and Wang9] and [Reference Röckner and Zhang25] for McKean–Vlasov (or distribution-dependent or mean-field) SDEs. There also exist a number of works on numerical simulation of SDEs with low regularity. In particular, [Reference Ngo and Taguchi22] is concerned with the strong convergence rate of the EM scheme for SDEs with irregular coefficients, where the one-sided Lipschitz condition is imposed on the drift term. Subsequently, the one-sided Lipschitz condition applied in [Reference Ngo and Taguchi22] was dropped in [Reference Ngo and Taguchi23], whereas one-dimensional SDEs are barely affected. At this point, our goal in this paper has been evident. More precisely, motivated by the previous literature, we aim to investigate the convergence rate of EM for multidimensional SDEs with low regularity, where the drift terms need not be piecewise Lipschitz-continuous; see e.g. [Reference Halidias and Kloeden6], [Reference Leobacher and Szölgyenyi16], [Reference Leobacher and Szölgyenyi17], [Reference Müller-Gronbach and Yaroslavtseva20], and [Reference Neuenkirch, Szölgyenyi and Szpruch21].
Now we consider the following SDE:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn1.png?pub-status=live)
where
$b\colon \mathbb{R}^d\rightarrow\mathbb{R}^d$
,
$\sigma\colon \mathbb{R}^d\rightarrow\mathbb{R}^d\otimes\mathbb{R}^m$
, and
$(W_t)_{t\ge 0}$
is an m-dimensional Brownian motion on some filtered probability space
$(\Omega,\mathscr F,(\mathscr F_t)_{t\ge 0},\mathbb P)$
. For the drift b and the diffusion
$\sigma$
, we assume the following.
-
(A1)
$\|b\|_{\infty}\colon= \sup_{x\in\mathbb{R}^d}|b(x)|<\infty$ , and there exists a constant
$p>{{d}/{2}}$ such that
$|b|^2\in L^p(\mathbb{R}^d)$ , the usual
$L^p$ -space on
$\mathbb{R}^d$ .
-
(A2) There exist constants
$\gamma\ge 2$ ,
$\alpha_\gamma>0,$ and a continuous decreasing function
$\phi_\gamma\colon (0,\infty)\rightarrow(0,\infty)$ with
$\int_0^l\phi_\gamma(s)\,{\text{d}} s<\infty$ for arbitrary
$l>0$ such that
\begin{equation*}\dfrac{1}{ s^{{{d}/{2}}}}\int_{\mathbb{R}^d}|b(x+y)-b(x+z)|^\gamma\text{{e}}^{-{{1}/{s}}|x|^2}{\text{d}} x\leq\phi_\gamma(s)|y-z|^{\alpha_\gamma},\quad y,z\in\mathbb{R}^d,\ s>0.\end{equation*}
-
(A3) There exist constants
$\breve{\lambda}_0,\hat\lambda_0,L_0>0$ such that
(1.2)\begin{align}&\breve{\lambda}_0|\xi|^2\le\langle (\sigma\sigma^*)(x)\xi,\xi\rangle \le\hat\lambda_0|\xi|^2,\quad x,\xi\in\mathbb{R}^d,\end{align}
(1.3)\begin{align}&\|\sigma(x)-\sigma(y)\|_{\text{HS}} \le L_0|x-y|,\quad x,y\in\mathbb{R}^d,\end{align}
where
$\sigma^*$ means the transpose of
$\sigma$ and
$\|\cdot\|_{\text{HS}}$ stands for the Hilbert–Schmidt norm.
Below we make some comments on the assumptions (A2) and (A3).
Remark 1.1. If
$\phi_\gamma$
is bounded, then we can replace
$\phi_\gamma(s)$
in (A2) with
$\sup_{s\in [0,T]}\phi_\gamma(s)$
, which is automatically decreasing. Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU2.png?pub-status=live)
Instead of
$\phi_\gamma$
decreasing, we can assume that
$\phi_\gamma$
satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn4.png?pub-status=live)
Then, for any
$\kappa_0>0$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU3.png?pub-status=live)
It is not easy to check (1.4) for
$\phi_\gamma$
with
$\lim_{\delta \rightarrow 0^+} \phi_\gamma(\delta)=+\infty$
. However, if
$\phi_\gamma$
is decreasing, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU4.png?pub-status=live)
Hence, in this case, (1.4) holds if and only if there is
$C>0$
such that
$ \phi_{\gamma}(x)\leq {{C}/{x}}$
.
Remark 1.2. For
$x\in\mathbb{R}^d$
, let
$\|\sigma(x)\|_{\text{op}}=\sup_{|y|\le1}|\sigma(x)y|$
, the operator norm of
$\sigma(x)$
. By the Cauchy–Schwarz inequality, it follows from (1.2) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU5.png?pub-status=live)
where
$\{e_i\}_{i=1}^d$
is the orthogonal basis of
$\mathbb{R}^d$
. Then we arrive at
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn5.png?pub-status=live)
Under (A1) and (A3), (1.1) has a unique strong solution
$(X_t)_{t\ge 0}$
; see e.g. [Reference Huang and Wang9, Lemma 3.1]. (A2) is imposed to reveal the convergence rate of the EM scheme corresponding to (1.1), which is defined as follows: for any
$\delta \in(0,1), $
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn6.png?pub-status=live)
with
$t_\delta \colon= \lfloor t/\delta \rfloor\delta$
, where
$\lfloor t/\delta \rfloor$
denotes the integer part of
$t/\delta $
. We emphasize that
$\left(X^{(\delta)}_{k\delta }\right)_{k\ge 0}$
is a homogeneous Markov process; see e.g. [Reference Mao and Yuan19, Theorem 6.14]. For
$t\ge s$
and
$x\in\mathbb{R}^d$
, let
$p^{(\delta)}(s,t,x,\cdot)$
denote the transition density of
$ X^{(\delta)}_t$
with starting point
$X_s^{(\delta)}=x$
. Set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU6.png?pub-status=live)
Our first main result in this paper is stated as follows.
Theorem 1.1. Assume
$({\bf A1})$
–
$({\bf A3})$
. Then, for
$\beta\in(0,\gamma)$
,
$(p,q)\in \mathscr{K}$
, and
$T>0$
, there exist constants
$C_1,C_2>0$
independent of
$\delta $
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn7.png?pub-status=live)
Compared with [Reference Ngo and Taguchi22], in Theorem 1.1 we get rid of the one-sided Lipschitz condition for the drift coefficients. On the other hand, [Reference Ngo and Taguchi23] is extended to the multidimensional set-up. We point out that an
$\mathcal {A}$
approximation is given in advance in [Reference Ngo and Taguchi22, Reference Ngo and Taguchi23] to approximate the drift term. So, in contrast to the assumption set in [Reference Ngo and Taguchi22, Reference Ngo and Taguchi23], assumption (A2) is much more explicit. On the other hand, by a close inspection of the argument of Lemma 2.2 below, assumption (A2) can indeed be replaced by the other alternatives. For instance, (A2) may be replaced by (A2′
) below.
-
(A2′ ) There exist constants
$\gamma\ge 2, \beta_\gamma,\theta_\gamma>0$ such that, for some constant
$C>0$ ,
\begin{equation*}\dfrac{1}{(rs)^{d/2}}\sup_{z\in\mathbb{R}^d}\int_{\mathbb{R}^d\times\mathbb{R}^d}|b(x)-b(y)|^\gamma\text{{e}}^{-{{|x-z|^2}/{s}}}\text{{e}}^{-{{|y-x|^2}/{r}}}\,{\text{d}} y \,{\text{d}} x\le C r^{\theta_\gamma} s^{\beta_\gamma-1},\quad s,r>0.\end{equation*}
The drift b satisfying (A2′
) is said to be of the Gaussian–Besov class with index
$(\beta_\gamma,\theta_\gamma)$
, written as
$\text{GB}^\gamma_{\beta_\gamma,\theta_\gamma}(\mathbb{R}^d)$
. The index
$\theta_\gamma$
is used to characterize the order of continuity and
$\beta_\gamma$
is used to characterize the type of continuity. Note that functions with the same order of continuity may enjoy a different type of continuity; see e.g.
$f(x)=|x|^{{1}/{2}}$
with
$(1,\frac12)$
and
$f(x)={\bf1}_{[c,d]}(x),c,d\in\mathbb{R}$
, with
$(\frac12,\frac12)$
. We refer to Example 4.2 below for the drift
$b\in\text{GB}^2_{\beta_2,\theta_2}(\mathbb{R}^d)$
. For
$\theta\in(0,1)$
and
$p\ge 1$
, let
$W^{\theta,p}(\mathbb{R}^d)$
be the fractional-order Sobolev space on
$\mathbb{R}^d$
. Nevertheless,
$ W^{\theta,p}(\mathbb{R}^d) \subsetneq \text{GB}^2_{1-{{d}/{p}},\theta}(\mathbb{R}^d)$
,
$\theta>0$
,
$p\in[2,\infty)\cap(d,\infty)$
; see Example 4.3 for more details. Furthermore, [Reference Suo, Yuan and Zhang29, Example 2.3] shows that the drift b constructed therein satisfies (A2′
) but need not be piecewise Lipschitz-continuous (see e.g. [Reference Leobacher and Szölgyenyi16] and [Reference Leobacher and Szölgyenyi17]).
In Theorem 1.1, the integrability condition (i.e.
$|b|^2\in L^p(\mathbb{R}^d)$
) seems to be a little bit restrictive, which rules out some typical examples, e.g.
$b(x)={\bf1}_{[0,\infty)}(x)$
. Below, by implementing a truncation argument, the integrability condition can indeed be dropped. In such a set-up (i.e. without the integrability condition), we can still derive the convergence rate of the EM algorithm, which is presented below.
Theorem 1.2. Assume
$({\bf A1})$
–
$({\bf A3})$
without
$|b|^2\in L^p\big(\mathbb{R}^d\big)$
. Then, for
$\beta\in(0,2)$
,
$(p,q)\in\mathscr{K}_2$
, and
$T>0$
, there exist constants
$C_1,C_2>0$
independent of
$\delta $
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn8.png?pub-status=live)
We remark that the right-hand side of (1.8) approaches zero since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU8.png?pub-status=live)
due to the fact that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU9.png?pub-status=live)
whenever
$(p,q)\in\mathscr{K}_2$
.
The remainder of this paper is organized as follows. In Section 2, by employing Zvonkin’s transform and establishing Krylov’s estimate and Khasminskii’s estimate for the EM algorithm, which is based on a Gaussian-type heat kernel estimate, we complete the proof of Theorem 1.1. In Section 3 we aim to finish the proof of Theorem 1.2 by adopting a truncation argument. In Section 4 we provide some illustrative examples to demonstrate our theory. In the Appendix we show explicit upper bounds of the parameters associated with Gaussian heat kernel estimates concerned with the exact solution and the EM scheme.
2. Proof of Theorem 1.1
Before finishing the proof of Theorem 1.1, we prepare several auxiliary lemmas. Set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn9.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn10.png?pub-status=live)
where
$\Gamma({\cdot})$
denotes the gamma function. Due to Stirling’s formula,
$\Gamma(z+1)\sim\sqrt {2\pi z}(z/\text{{e}})^z$
, we have
$\Lambda_2<\infty$
.
The lemma below provides an explicit upper bound of the transition kernel for
$\left(X_t^{(\delta)}\right)_{t\ge 0}$
.
Lemma 2.1. Under
$({\bf A1})$
and
$({\bf A3})$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn11.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn12.png?pub-status=live)
Proof. For fixed
$t>0$
there is an integer
$k\ge 0$
such that
$[k\delta ,(k+1)\delta)$
. By a direct calculation, it follows from (1.2) and (1.3) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn13.png?pub-status=live)
where in the second inequality we used the basic inequality
$|a-b|^2\ge \frac{1}{2}|a|^2-|b|^2$
,
$a,b\in\mathbb{R}^d$
. Next, by invoking Lemma A.2 below, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn14.png?pub-status=live)
where
$\Lambda_2,\kappa_0$
were given in (2.2) and (2.4),respectively. Subsequently, (2.3) follows immediately by taking advantage of the Chapman–Kolmogorov equation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU10.png?pub-status=live)
and the fact that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU11.png?pub-status=live)
Lemma 2.2. Under
$({\bf A1})$
–
$({\bf A3})$
, for any
$T>0$
, there exists a constant
$C>0 $
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn15.png?pub-status=live)
where
$\alpha>0$
was introduced in
$({\bf A2})$
.
Proof. Observe that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU12.png?pub-status=live)
By
$\|b\|_\infty<\infty$
due to (A1), it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn16.png?pub-status=live)
For
$t\in[k\delta ,(k+1)\delta)$
, by taking the mutual independence between
$X^{(\delta)}_{k\delta }$
and
$W_t-W_{k\delta }$
into account and employing Lemma 2.1, we derive that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn17.png?pub-status=live)
for some constant
$C_1>0$
, where
$\kappa_0$
was given in (2.4). With the aid of the fact that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn18.png?pub-status=live)
we infer from (A2) and (2.9) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU13.png?pub-status=live)
for some constants
$C_2,C_3,C_4>0$
. Hence we arrive at
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn19.png?pub-status=live)
Observe that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU14.png?pub-status=live)
where in the second inequality we used the fact that
$\phi_\gamma\colon (0,\infty)\rightarrow(0,\infty)$
is decreasing. Hence (2.7) holds true by combining (2.8) with (2.11) and by utilizing
$\int_0^{\kappa_0T}\phi_\gamma(t)\,{\text{d}} t<\infty$
for arbitrary
$T>0$
.
For any
$p,q\ge 1$
and
$0\le S\le T$
, let
$L^p_q(S,T)=L^q([S,T];L^p(\mathbb{R}^d))$
be the family of all Borel-measurable functions
$f\colon [S,T]\times\mathbb{R}^d\rightarrow\mathbb{R}^d$
endowed with the norm
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU15.png?pub-status=live)
For simplicity we shall write
$L^p_q(T)$
in place of
$L^p_q(0,T)$
. In contrast to (1.1), in (1.6) we have written the drift term as
$b(X_{t_\delta }^{(\delta)})$
instead of
$b(X_t^{(\delta)})$
so that the classical Krylov estimate (see e.g. [Reference Gyöngy and Martinez4], [Reference Huang and Wang9], [Reference Krylov and Röckner14], [Reference Xie and Zhang30], and [Reference Zhang32]) is not directly applicable. However, the following lemma shows that
$(X_t^{(\delta)})_{t\ge 0}$
still satisfies the Khasminskii estimate by employing a Gaussian heat kernel estimate, although the Krylov estimate for
$(X_{t_\delta }^{(\delta)})_{t\ge 0}$
is invalid, as Remark 2.1 below describes.
Lemma 2.3. Assume
$({\bf A1})$
and
$({\bf A3})$
. Then, for
$f\in L^p_q(T)$
with
$(p,q)\in\mathscr{K}_1$
and
$T>0$
, the Khasminskii-type estimate
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn20.png?pub-status=live)
holds, where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn21.png?pub-status=live)
Proof. For
$0\le s\le t\le T$
, note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU16.png?pub-status=live)
Since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU17.png?pub-status=live)
we derive from (1.2) and Hölder’s inequality that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn22.png?pub-status=live)
where
$y_{x,w}\colon= x+b(x)(r-s_\delta)+\sigma(x)w$
,
$x\in\mathbb{R}^d$
,
$w\in\mathbb{R}^m$
. For
$r\ge k\delta $
, let
$X_{k\delta ,r}^{(\delta),x}$
be the EM scheme determined by (1.6) with
$X_{k\delta ,k\delta }^{(\delta),x}=x$
. From the tower property of conditional expectation, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU18.png?pub-status=live)
In terms of Lemma 2.1, along with Hölder’s inequality, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU19.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU20.png?pub-status=live)
By Hölder’s inequality this yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn23.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn24.png?pub-status=live)
in which
$\alpha_0>0$
was introduced in (2.13). For each
$k\ge 1$
, applying (2.16) inductively gives
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn25.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU21.png?pub-status=live)
Taking
$\delta _0=\left(2\alpha_0\lambda\|f\|_{ L^p_q(T)}\right)^{-\gamma_0}$
, we obviously have
$ \lambda \alpha_0\delta _0^{{{1}/{\gamma_0}}}\|f\|_{ L^p_q(T)}=\frac{1}{2}$
. With this and (2.17) in hand, we derive that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn26.png?pub-status=live)
which further implies inductively that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn27.png?pub-status=live)
Therefore (2.12) is now available by recalling
$\delta _0=\left(2\alpha_0\lambda\|f\|_{ L^p_q(T)}\right)^{-\gamma_0}$
.
The following lemma is concerned with Khasminskii’s estimate for the solution process
$(X_t)_{t\ge 0}$
, which is more or less standard; see e.g. [Reference Gyöngy and Martinez4], [Reference Huang and Wang9], [Reference Krylov and Röckner14], [Reference Xie and Zhang30], and [Reference Zhang32]. Here we state the Khasminskii estimate and provide a sketch of its proof merely for the sake of an explicit upper bound.
Lemma 2.4. Assume
$({\bf A1})$
and
$({\bf A3})$
. Then, for
$f\in L^p_q(T)$
with
$(p,q)\in\mathscr{K}_1$
,
$\lambda>0$
, and
$T>0$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn28.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn29.png?pub-status=live)
with
$\beta_T$
being given in (A.2)below.
Proof. By (A.1) below, it follows from Hölder’s inequality and theMarkov property that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn30.png?pub-status=live)
where
$(X^{s,x}_t)_{t\ge s}$
stands for the solution to (1.1) with the initial value
$X_s^{s,x}=x$
, and
$\hat\beta_T,\hat \alpha_0>0$
were introduced in (2.21). Then (2.20) follows immediately by utilizing (2.22) and by following the argument to derive (2.19).
Remark 2.1. In (2.16), Krylov’s estimate for
$\left(X_t^{(\delta)}\right)_{t\ge 0}$
instead of
$\left(X_{t_\delta }^{(\delta)}\right)_{t\ge 0}$
is available, whereas the Krylov estimate associated with
$\left(X_{t_\delta }^{(\delta)}\right)_{t\ge 0}$
no longer holds true. Indeed, if we take
$s,t\in[k\delta ,(k+1)\delta)$
for some integer
$k\ge 1$
, we obviously have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn31.png?pub-status=live)
which is a random variable. Hence it is impossible to control the quantity on the left-hand side of (2.23) by
$\|f\|_{L^p_q(T)}$
up to a constant; see also [Reference Shao26] for more details.
Before we go further, we introduce some additional notation. For
$p\ge 1$
and
$m\ge 0$
, let
$H^m_p$
be the usual Sobolev space on
$\mathbb{R}^d$
with the norm
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU22.png?pub-status=live)
where
$\nabla^m$
denotes the mth-order gradient operator. For
$q\ge 1$
and
$0\le S\le T$
, let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU23.png?pub-status=live)
and let
$\mathscr{H}_p^{m,q}(S,T)$
be the collection of all functions
$f\colon [S,T]\times\mathbb{R}^d\rightarrow\mathbb{R}$
such that
$f\in\mathbb{H}_p^{m,q}(S,T)$
and
$\partial_t f\in L^p_q(S,T)$
. For a locally integrable function
$h\colon \mathbb{R}^d\rightarrow\mathbb{R}$
, the Hardy–Littlewood maximal operator
$\mathscr{M}h$
is defined as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU24.png?pub-status=live)
where
$B_r(x) $
is the ball with the radius r centered at the point x and
$|B_r(x)|$
denotes the d-dimensional Lebesgue measure of
$B_r(x)$
.
To make the content self-contained, we recall the Hardy–Littlewood maximal theorem, which is stated as follows.
Lemma 2.5. For any
$f \in W^{1,1}_{\text{loc}}(\mathbb{R}^d)$
, there exists a constant
$C>0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn32.png?pub-status=live)
For any
$f\in L^p(\mathbb{R}^d)$
,
$p>1$
, there exists a constant
$C_p$
, independent of d, such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn33.png?pub-status=live)
Remark 2.2. For the detailed proof of (2.24), please refer to the counterpart of [Reference Zhang33, Lemma 3.5]. Comparing with [Reference Zhang33, Lemma 3.5], we have replaced the local maximum function by the global one due to the monotonicity of the local maximum function. On the other hand, the inequality in (2.25) is called the Hardy–Littlewood maximal inequality, which can be consulted in [Reference Stein28, Theorem 1, page 5]. Combining (2.24) with (2.25), it is clear that for
$f\in H^1_p$
, the right-hand side of (2.24) is finite for a.e.
$x,y\in\mathbb{R}^d$
.
Now we are in a position to complete the proof of Theorem 1.1.
Proof of Theorem 1.1. For any
$\lambda >0$
, consider the following PDE for
$u^\lambda\colon [0,T]\times\mathbb{R}^d\rightarrow\mathbb{R}^d$
:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn34.png?pub-status=live)
where
$\{e_j\}_{j=1}^d$
stipulates the orthogonal basis of
$\mathbb{R}^d$
and
$\left(\nabla_bu^\lambda\right)(x)$
(resp.
$\left(\nabla_{e_{j}}u^\lambda\right)(x)$
) means the directional derivative of
$u^\lambda$
at the point x along the direction b(x) (resp.
$e_j$
). According to [Reference Xie and Zhang30, Lemma 4.3], (2.26) has a unique solution
$u^{\lambda}\in \mathscr{H}_{2p}^{2,2q}(0,T)$
for the pair
$ (p,q)\in\mathscr{K}_1$
due to
$p>{{d}/{2}}$
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn35.png?pub-status=live)
for some constant
$c_1>0$
independent of
$\lambda$
, where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU25.png?pub-status=live)
With the help of (2.27), there is a constant
$\lambda_0\ge 1$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn36.png?pub-status=live)
For
$u^\lambda\in{\mathscr{H}_{2p}^{2,2q}(0,T)}$
, there exists a sequence
$u^{\lambda,k}\in C^{1,2}([0,T]\times\mathbb{R}^d;\mathbb{R}^d)$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU26.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU27.png?pub-status=live)
Henceforth, we can apply Itô’s formula directly to
$u^\lambda\in{\mathscr{H}_{2p}^{2,2q}(0,T)}$
by adopting a standard approximation approach; for more details see e.g. the arguments of [Reference Xie and Zhang30, Theorem 2.1] and [Reference Zhang32, Lemma 4.3]. Set
$\theta^\lambda_t(x)\colon= x+u^\lambda_t(x)$
,
$x\in\mathbb{R}^d$
, and
$Z_t^{(\delta)}\colon= X_t-X^{(\delta)}_t$
. By Itô’s formula, we obtain from (2.26) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn37.png?pub-status=live)
Let
$\Gamma_t= \theta^\lambda_t(X_t)-\theta^\lambda_t\left(X^{(\delta)}_t\right)$
,
$t\ge 0$
. From (2.28), it is easy to see that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn38.png?pub-status=live)
Hence, by Itô’s formula, we derive from (2.29) that for
$\gamma\ge 2$
in (A2),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn39.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU28.png?pub-status=live)
By means of (2.28) and (2.30), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn40.png?pub-status=live)
Also, by virtue of (2.28), as well as (2.30), we find that there exists a constant
$c_2>0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn41.png?pub-status=live)
Owing to (1.3) and (1.5), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU29.png?pub-status=live)
Combining (2.30) and Young’s inequality, this leads to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn42.png?pub-status=live)
for some constant
$c_3>0$
. Furthermore, thanks to (1.2), (1.5), (2.24), (2.28), and (2.30), we derive from Hölder’s inequality that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn43.png?pub-status=live)
for some constants
$c_4,c_5,c_6>0$
. As a result, plugging (2.32)–(2.35) into (2.31) gives
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU30.png?pub-status=live)
in which, for some constant
$\hat c_1>0$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU31.png?pub-status=live)
Consequently, by the stochastic Gronwall inequality (see e.g. [Reference Xie and Zhang30, Lemma 3.8]), we deduce that for
$0<\kappa'<\kappa<1$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU32.png?pub-status=live)
where
$\|f\|_{t,\infty}\colon= \sup_{0\le s\le t}|f(s)|$
for a continuous function
$f\colon \mathbb{R}_+\rightarrow\mathbb{R}^d$
. The estimate above, together with Lemma 2.2 and the fact that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU33.png?pub-status=live)
for some constant
$\hat c_2>0$
, leads to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn44.png?pub-status=live)
for some constant
$\hat c_3>0$
. By Hölder’s inequality, we deduce for some constant
$\hat c_4>0$
that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU34.png?pub-status=live)
In addition to (2.12), (2.20), (2.25) as well as (2.27), this implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn45.png?pub-status=live)
for someconstants
$\hat c_5,\hat c_6,\hat c_7>0$
. Substituting (2.37) back into (2.36), we find constants
$\hat c_8,\hat c_9>0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU35.png?pub-status=live)
so that we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU36.png?pub-status=live)
We therefore complete the proof.
3. Proof of Theorem 1.2
In this section we aim to complete the proof of Theorem 1.2 by carrying out a truncation approach; see e.g. [Reference Bao, Huang and Yuan1] and [Reference Ngo and Taguchi23] for further details.
Let
$\psi\colon \mathbb{R}_+\rightarrow[0,1]$
be a smooth function such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU37.png?pub-status=live)
For each integer
$k\ge 1$
, let
$b_k(x)=b(x)\psi(|x|/k)$
,
$x\in\mathbb{R}^d$
, be the truncation function associated with the drift b. A direct calculation shows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn46.png?pub-status=live)
Consider the following truncated SDE corresponding to (1.1):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn47.png?pub-status=live)
The EM scheme associated with (3.2) is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU38.png?pub-status=live)
Observe that for
$\beta\in(0,\gamma)$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn48.png?pub-status=live)
where, for a map
$f\colon [0,T]\rightarrow\mathbb{R}^d$
, we set
$\|f\|_{T,\infty}\colon= \sup_{0\le t\le T}|f(t)|$
. Via Hölder’s inequality and the fact that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU39.png?pub-status=live)
it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU40.png?pub-status=live)
Since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU41.png?pub-status=live)
in which
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU42.png?pub-status=live)
with the quadratic variation
$\langle M\rangle _T\le d\hat\lambda_0 T$
, we derive from [Reference Shigekawa27, Proposition 6.8, page 147] that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn49.png?pub-status=live)
where in the last display we used the inequality
$(a-b)^2\ge a^2/2-b^2$
,
$a,b\in\mathbb{R}$
. Thus (3.4), together with
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU43.png?pub-status=live)
for some constant
$C_{1}$
, yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn50.png?pub-status=live)
for some constant
$C_2>0$
. Following a similar procedure, we also derive that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn51.png?pub-status=live)
for some constant
$C_3>0$
. Moreover, for
$(p,q)\in \mathscr{K}_2$
, according to Theorem 1.1, there exist constants
$C_4,C_5>0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU44.png?pub-status=live)
This, together with (3.1), implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn52.png?pub-status=live)
for some constant
$C_6>0$
. As a consequence, from (3.5), (3.6), and (3.7), we arrive at
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU45.png?pub-status=live)
for some constants
$C_7,C_8>0$
. Thereby, the desired assertion (1.8) follows by taking
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU46.png?pub-status=live)
4. Illustrative examples
In this section we give examples to demonstrate that the assumption imposed on the drift term holds true.
Example 4.1. Let
$b(x)={\bf1}_{[a_1,a_2]}(x)$
,
$x\in\mathbb{R}$
, for some constants
$a_1<a_2$
. Evidently b is not continuous at all but
$b^2\in L^p$
for any
$p\ge 1$
. Observe that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU47.png?pub-status=live)
so that b does not obey the one-sided Lipschitz condition. Next we aim to show that b given above satisfies (A2). By a direct calculation, for any
$s>0$
,
$\gamma\ge 2$
, and
$y\in\mathbb{R}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU48.png?pub-status=live)
If
$z\ge 0$
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU49.png?pub-status=live)
On the other hand, for
$z<0$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU50.png?pub-status=live)
So (A2) holds true with
$\alpha=1$
and
$\phi(s)=s^{-{{1}/{2}}}$
,
$s>0$
.
Example 4.2. For
$\theta>0$
and
$p\in[2,\infty)\cap(d,\infty)$
, if the Gagliardo seminorm is finite, that is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU51.png?pub-status=live)
then
$b\in \text{GB}^2_{1-{{d}/{p}},\theta}(\mathbb{R}^d)$
. Indeed, by Hölder’s inequality and (2.10), it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn53.png?pub-status=live)
for some constants
$C_1,C_2,C_3>0$
. On the other hand, if
$d=1$
and
$p=2$
, we deduce from (4.1) that
$b\in \text{GB}^2_{1/2,\theta}(\mathbb{R}^d)$
due to
$\lim_{x\rightarrow0}x^x=1$
.
Example 4.3. For
$0<a<b<\infty$
,
$f({\cdot})\colon= \unicode{x1d7d9}_{[a,b]}({\cdot})\in\text{GB}^2_{{{1}/{2}},{{1}/{2}}}(\mathbb{R})$
, whereas
$f\notin W^{{{1}/{2}},2}(\mathbb{R})$
. In fact it is easy to see that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU52.png?pub-status=live)
which yields
$f\notin W^{{{1}/{2}},2}(\mathbb{R})$
. On the other hand, since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU53.png?pub-status=live)
for some constant
$C>0$
, we arrive at
$f \in\text{GB}^2_{{{1}/{2}},{{1}/{2}}}(\mathbb{R})$
.
Appendix A
The next lemma provides explicit estimates of the parameters concerning a Gaussian-type estimate of transition density for the diffusion process
$(X_t)_{t\ge 0}$
solving (1.1).
Lemma A.1. Under
$\|b\|_\infty<\infty$
and
$({\bf A3})$
, the transition density p of
$(X_t)_{t\ge s}$
satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn54.png?pub-status=live)
where
$\Gamma({\cdot})$
is the gamma function and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn55.png?pub-status=live)
Proof. The proof of Lemma A.1 is based on the parametrix method [Reference Konakov and Mammen13, Reference Lemaire and Menozzi15]. To complete the proof of Lemma A.1, it suffices to refine the argument of [Reference Konakov and Mammen13, Lemma 3.2]; for further details see also [Reference Lemaire and Menozzi15, pages 1660–1662]. Under
$\|b\|_\infty<\infty$
and
$({\bf A3})$
,
$X_t$
admits a smooth transition density p(s,t,x,y) at the point y, given
$X_s=x$
, such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn56.png?pub-status=live)
where L is the infinitesimal generator of (1.1) and
$L^*$
is its adjoint operator. For
$t>s$
and
$x,x'\in\mathbb{R}^d$
, let
$ \tilde X^{s,x,x'}_t $
solve the frozen SDE
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn57.png?pub-status=live)
and let
$\tilde p^{x'}(s,t,x,x')$
stand for its transition density at x’, given
$\tilde X^{s,x,x'}_s=x$
. Evidently
$\tilde p^{x'}$
admits the explicit form
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU54.png?pub-status=live)
A direct calculation yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU55.png?pub-status=live)
where
$\tilde L^{x'}$
is the infinitesimal generator of (A.4). By (A.3) and (A.4), we derive from [Reference Konakov and Mammen13, (3.8)] that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn58.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn59.png?pub-status=live)
In (A.5), iterating for p(s,u,x,z) gives
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn60.png?pub-status=live)
where
$\tilde p\otimes H^{(0)}\colon= \tilde p$
and
$\tilde p^{x'}\otimes H^{(i)}\colon= \left(\tilde p^{x'}\otimes H^{(i-1)}\right)\otimes H,i\ge 1$
, with
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU56.png?pub-status=live)
If we can claim that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn61.png?pub-status=live)
in which
$\beta_T,p_0$
were introduced in (A.2), then (A.1) follows from (A.7) and (A.8). Below it suffices to show that (A.8) holds true. By means of (2.10) and
$|a-b|^2\ge\frac{1}{2}|a|^2-|b|^2$
,
$a,b\in\mathbb{R}^d$
, it follows from (1.2) and
$\|b\|_\infty<\infty$
that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn62.png?pub-status=live)
Thus, combining (2.10) with (A.9), together with
$\|b\|_\infty<\infty$
and (1.3), enables us to obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn63.png?pub-status=live)
By
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU57.png?pub-status=live)
we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU58.png?pub-status=live)
Hence, taking advantage of
$\|b\|_\infty<\infty$
, (1.2), and (A.10), as well as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU59.png?pub-status=live)
yields (A.8).
For
$x,x'\in\mathbb{R}^d$
and
$j\ge 0, $
let
$ (\tilde X^{(\delta),j,x,x'}_{i\delta })_{i\ge j}$
solve the following frozen EM scheme associated with (1.1):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU60.png?pub-status=live)
Write
$\tilde p^{(\delta),x'}(j\delta ,j'\delta ,x,y)$
by the transition density of
$ \tilde X^{(\delta),j,x,x'}_{j'\delta }$
at the point y, given
${ \tilde X^{(\delta),j,x,x'}_{j\delta }=x}$
.
The following lemma reveals explicit upper bounds of coefficients with regard to the Gaussian bound of the discrete-time EM scheme.
Lemma A.2. Under
$\|b\|_\infty<\infty$
and
$({\bf A3})$
, for any
$0\le j<j'\le \lfloor T/\delta \rfloor$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn64.png?pub-status=live)
Proof. To obtain (A.11), we refine the proof of [Reference Lemaire and Menozzi15, Lemma 4.1]. For
$\psi\in C^2(\mathbb{R}^d;\mathbb{R})$
and
$j\ge 0$
, set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU61.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU62.png?pub-status=live)
In what follows, let
$0\le j<j'\le\lfloor T/\delta \rfloor$
. According to [Reference Konakov and Mammen13, Lemma 3.6], we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn65.png?pub-status=live)
where
$(\tilde p^{(\delta),x'}\otimes_\delta H^{(\delta),(0)})=\tilde p^{(\delta),x'}$
,
$H^{(\delta),(k)} =H^{(\delta)}\otimes_\delta H^{(\delta),(k-1)}$
, with
$\otimes_\delta $
being the convolution-type binary operation defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU63.png?pub-status=live)
If the assertion
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn66.png?pub-status=live)
holds true, where
$\hat C_T$
was given in (2.1), then (A.11) follows due to (A.12) by an induction argument. So, in order to complete the proof of Lemma A.2, it remains to verify (A.13). First of all, we show (A.13) for
$j'=j+1$
. By the definition of
$H^{(\delta)}$
, observe from (1.2) that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU64.png?pub-status=live)
Next we aim to estimate
$\Lambda_1,\Lambda_2,\Lambda_3$
one by one. By
$\|b\|_\infty<\infty$
, (1.2), and (2.10), it follows from the first fundamental theorem of calculus that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn67.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU65.png?pub-status=live)
By invoking
$|\text{{e}}^a-\text{{e}}^b|\le\text{{e}}^{a\vee b} |a-b|$
,
$a,b\in\mathbb{R}$
, and utilizing
$\|b\|_\infty<\infty$
, (1.2), and (2.10), this yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn68.png?pub-status=live)
Also, making use of
$\|b\|_\infty<\infty$
, (1.2) and (2.10), in addition to
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU66.png?pub-status=live)
due to (1.2) and (1.3), we arrive at
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn69.png?pub-status=live)
We therefore conclude that (A.13) holds with
$j'=j+1$
by taking (A.14)–(A.16) into account. Below, we are going to show that (A.13) is still available for
$j'>j+1$
. According to the definition of
$H^{(\delta)}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU67.png?pub-status=live)
where
$\Gamma_z(x)\colon= b(x)\delta +\sqrt \delta \sigma(x)z$
,
$x\in\mathbb{R}^d$
,
$z\in\mathbb{R}^m$
. By Taylor’s expansion, we also have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU68.png?pub-status=live)
where
$\nabla^i$
means the ith-order gradient operator. Employing
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU69.png?pub-status=live)
for a symmetric
$d\times d$
-matrix and
$\int_{\mathbb{R}^m}\text{{e}}^{-{{|z|^2}/{2}}}z\,{\text{d}} z={\bf0}$
gives
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU70.png?pub-status=live)
where H was defined as in (A.6) with
$p^{x'} $
replaced by
$\tilde p^{(\delta),x'}$
. Equations (A.9) and (A.10) enable us to obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn70.png?pub-status=live)
Note that
$\Pi_3$
can be reformulated as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqnU71.png?pub-status=live)
By means of (1.2), (1.3) and (2.10), it follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn71.png?pub-status=live)
Also, by exploiting (1.2), and (2.10), we infer from Taylor expansion that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20220623172611105-0295:S0021900221000565:S0021900221000565_eqn72.png?pub-status=live)
Consequently, (A.13) follows from (A.17), (A.18), and (A.19).
Acknowledgements
We are indebted to the referees for their valuable comments which have greatly improved our earlier version.
Funding information
This paper is supported in part by National Natural Science Foundation of China (grants 11771326, 11801406, 11831014, 11901604, 12071340). The third author is also supported by the Emerging Interdisciplinary Project disciplinary funding of CUFE.
Competing interests
There were no competing interests to declare which arose during the preparation or publication process of this article.