Introduction
Multivariate diffusions are used throughout financial econometrics, in models of the term structure, of stochastic volatility, and of commodity and credit markets. Their parameters are usually estimated by maximum likelihood from discretely sampled data. The difficulty is that the transition density, and hence the likelihood, is rarely known in closed form.
Following Aït-Sahalia [3 , 4 ] , a large literature replaces the unknown density with an explicit small-time expansion and maximizes the resulting approximate likelihood. The delta expansion of Yang et al. [54 ] is a recent member of this family. It is derived from argument, and its coefficients follow from a recursion that involves only derivatives of the drift and diffusion coefficients.
The statistical justification of these estimators has a gap. Yang et al. [54 ] show that their approximate estimator approaches the exact MLE as the sampling interval Δ \Delta Δ tends to zero with the number of observations n n n fixed (their Theorem 4.1). To conclude that it converges to the true parameter, one also needs the asymptotic theory of the exact MLE. On this point, Yang et al. [54 ] write that “the corresponding results about the convergence of the true MLEs in multivariate diffusions are challenging and still open in the literature.” Li [41 ] leaves the same question for future work. For scalar diffusions, the gap is largely filled by Aït-Sahalia [3 ] and Chang and Chen [11 ] . Both work with the transformation to unit volatility, which in general exists only in one dimension. Chang and Chen [11 ] also obtain asymptotic normality of the exact MLE only when n Δ n 3 → ∞ n\Delta_n^3 \to\infty n Δ n 3 → ∞ , so that the sampling interval shrinks more slowly than n − 1 / 3 n^{-1/3} n − 1/3 , and under high-level conditions on the expansion terms. The open question therefore concerns the multivariate case in the high-frequency regime, with the sampling interval allowed to shrink at any polynomial rate.
Setting. We work in the high-frequency, long-span regime: n → ∞ n \to\infty n → ∞ , Δ n → 0 \Delta_n \to0 Δ n → 0 and n Δ n → ∞ n\Delta_n \to\infty n Δ n → ∞ . This is the natural regime for the question. With Δ \Delta Δ fixed, an expansion of fixed order has an error that does not vanish, so the approximate estimator converges to a pseudo-true value. With the time span n Δ n n\Delta_n n Δ n fixed, the drift parameters cannot be estimated consistently ([23 , 24 ] ). We consider ergodic diffusions whose drift is Lipschitz and may grow linearly, and whose volatility is bounded away from zero and either bounded or proportional to the size of the state, comparable to 1 + ∣ x ∣ 1 + |x| 1 + ∣ x ∣ in every direction. In the second case, the coefficients must also vary on the scale of the state, in the sense of the derivative bounds in Assumption H6. This class contains multivariate Ornstein–Uhlenbeck processes, Gaussian affine term-structure models, nonlinear models with bounded volatility, and models whose volatility grows with the level of the process, such as Student-type diffusions with heavy-tailed stationary laws. It does not contain square-root models such as CIR and Heston, whose volatility vanishes at the boundary.
The main idea. The exact likelihood is not available in closed form, so we never analyze it directly. Instead, we compare it with the likelihood built from a delta expansion of high order K K K . If the expansion is accurate in relative terms at every observed transition, simultaneously for all parameter values, the two log-likelihoods differ by O P ( 1 ) O_{\mathbb{P}(1)} O P ( 1 ) uniformly, and the exact MLE inherits the asymptotic behavior of the explicit contrast. Comparing the exact likelihood with an explicit approximation is an old idea ([16 , 3 ] ). What makes it work here is that a high-order expansion is accurate enough to absorb even the most extreme observation in the sample.
Contributions. The paper makes four main contributions and provides one technical tool of independent interest.
Asymptotic theory for the exact MLE (Theorem 1 and Corollary 1). The exact MLE is consistent and asymptotically normal whenever Δ n \Delta_n Δ n decays polynomially, with rate n Δ n \sqrt{n\Delta_n} n Δ n for drift and n \sqrt{n} n for diffusion parameters. The same argument gives a proof of local asymptotic normality (LAN) without Malliavin calculus; LAN was first established by Gobet [25 ] . Hence the exact MLE
is efficient. Under an additional assumption on the rate of ergodic averages, which we verify only for stationary Ornstein–Uhlenbeck processes, and when n Δ n n\Delta_n n Δ n also grows polynomially, its moments also converge (Theorem 5 ).
A transfer principle for approximate likelihoods (Theorem 2). We give a high-level condition under which an approximate likelihood yields an estimator asymptotically equivalent to the exact MLE, together with two sufficient conditions on the error of the density or of the log-density. The conditions concern only the accuracy of the approximation, not how it is constructed. They are worst-case bounds, so the theorem is a theoretical transfer principle rather than a practical recipe. Delta expansions of high order satisfy them with any centering. This includes the expansion of Li [41 ] , which Chen, Wan and Yang [13 ] show to be the delta expansion with μ 0 = 0 \mu_0 = 0 μ 0 = 0 , and the conditions are also met, for scalar diffusions, the expansion of Lee et al. [40 ] , under a restrictive condition on the Lamperti-transformed drift.
The bias of the delta-expansion estimator (Theorems 3 and 4 ). For the estimator of fixed order K K K that is used in practice, efficiency under n Δ n K + 1 → 0 n\Delta_n^{K+1} \to0 n Δ n K + 1 → 0 is expected from the theory of higher-order contrasts (Kessler, [37 ] ; Uchida and Yoshida [51 ] ). What is new is an explicit bias term of order n Δ n ( K + 1 ) / 2 \sqrt{n}\Delta_n^{(K+1)/2} n Δ n ( K + 1 ) /2 , given by the projection of the first omitted correction on the score. It shows that the condition cannot be weakened whenever this bias is nonzero. For K ≥ 1 K \ge1 K ≥ 1 , the leading bias falls on the drift parameters when K K K is even and on the diffusion parameters when K K K is odd; for the Euler contrast, K = 0 K = 0 K = 0 , it falls on the diffusion parameters. This alternation could not be seen in classical expansions, which truncate in integer powers of Δ \Delta Δ and so correspond to even K K K only; it appears because the delta expansion is graded in powers of Δ 1 / 2 \Delta^{1/2} Δ 1/2 .
Volatility proportional to the state (Proposition 2 and Theorem 6 ). All results except Corollary 2(b) extend to volatility that is comparable to 1 + ∣ x ∣ 1 + |x| 1 + ∣ x ∣ in every direction, when the drift and volatility vary on the scale of the state; moment convergence then requires a version of the rate assumption. This class contains heavy-tailed models, such as Student-type diffusions, whose stationary laws have only finitely many moments. The extension rests on the observation that such models look the same at every scale: the expansion error, measured on the local scale, is bounded uniformly in the starting point, and no moments of the stationary law are needed. Intermediate growth, such as ( 1 + ∣ x ∣ 2 ) 1 / 4 (1 + |x|^2)^{1/4} ( 1 + ∣ x ∣ 2 ) 1/4 , and growth in some directions only are not covered.
A technical tool: a uniform bound on the expansion error (Proposition 1). We give a self-contained proof that the delta expansion of every order is accurate on the whole state space, with a polynomial weight in the starting point. Yang et al. [54 ] prove such a bound for starting points in a compact set, bounded drift and K ≥ m K \ge m K ≥ m .
Together, these results supply the missing half of the decomposition argument of Yang et al. [54 ] and Li [41 ] , justify Wald inference based on the exact likelihood, and tell the user of a fixed-order expansion how large K K K must be and which parameters suffer if it is too small. A Monte Carlo study confirms the theory: once κ 2 Δ n \kappa_2\Delta_n κ 2 Δ n , the fastest mean-reversion rate times the sampling interval, is below about 0.1, the bias predicted by Theorem 4 matches the simulated bias to within a few hundredths of a standard deviation.
Related literature. The exact MLE has received less attention than its approximations, because it is not available in closed form. For reducible diffusions it can be computed by Monte Carlo (Beskos et al., 2006, 2009), but its asymptotic theory under high-frequency sampling is a separate question. Gobet [25 ] establishes LAN for multivariate elliptic ergodic diffusions, with the same rates and information matrix as ours. LAN identifies the efficiency bound but is silent about the MLE. Showing that the MLE attains the bound additionally requires global consistency and a quadratic approximation of the log-likelihood that is uniform near θ 0 \theta_0 θ 0 , and both require control of the exact likelihood over the whole parameter space. Theorem 1(a) supplies exactly this control. How our proof of LAN compares with Gobet’s is discussed after Corollary 1.
Sørensen [49 ] develops a general efficiency theory for approximate martingale estimating functions of scalar diffusions sampled at high frequency; see also Jacod and Sørensen [32 ] and Kessler et al. [38 ] . Applying a score-based theory of this kind to the exact MLE requires control of the θ \theta θ -derivatives of log p Δ \log p_\Delta log p Δ . One could try to obtain such control by differentiating the Duhamel representation behind Proposition 1 in θ \theta θ . Our argument shows that this is unnecessary: it uses only the size of p Δ p_\Delta p Δ , and never its derivatives in θ \theta θ . With Δ \Delta Δ fixed, the exact MLE is covered by the general theory for ergodic Markov chains [10 ] , subject to verifying its regularity conditions, as Aït-Sahalia [3 ] does for scalar diffusions. We are not aware of a complete proof of consistency and asymptotic normality of the exact MLE for multivariate ergodic diffusions in the high-frequency regime.
For approximate estimators, the theory of contrast and quasi-likelihood estimators in this regime is well developed. Florens-Zmirou [19 ] and Yoshida [55 ] study Euler-type contrasts, and Kessler [37 ] adds higher-order corrections for scalar diffusions. Uchida and Yoshida [51 , 52 ] and Kamatani and Uchida [35 ] develop adaptive and multi-step estimators for multivariate models within the quasi-likelihood analysis of Yoshida [56 ] , and Jacobsen [30 , 31 ] studies small-Δ \Delta Δ optimality of estimating functions. See also Pilipovic et al. [47 ] for splitting schemes and Ganguly [22 ] for estimators without density expansions.
Closest to our analysis of the delta-expansion estimator, Iguchi et al. [29 ] build a likelihood proxy from a small-time expansion with Hermite-type corrections, for elliptic and hypo-elliptic models, and prove asymptotic normality under n Δ n 3 → 0 n\Delta_n^3 \to0 n Δ n 3 → 0 , the same rate condition as for K = 2 K=2 K = 2 in our Theorem 4 . Their proxy is a Gaussian-type contrast with corrected moments rather than a delta expansion. Our results for the delta-expansion estimator cover every order K K K , give the bias explicitly, and show that the rate condition is sharp. On the other hand, we treat only elliptic models. Explicit small-Δ \Delta Δ expansions of the bias of discretized estimating equations, including the Euler scheme, go back to Aït-Sahalia and Mykland [5 , 6 ] . In principle, our bias constant could be obtained from their general formulas applied to the score of the delta-expansion contrast. What is new is its closed form for the delta expansion of every order in the multivariate case, its parity structure, and the resulting sharpness of the rate condition.
The rest of this paper is organized as follows: Section 2 recalls the delta expansion and defines the estimator. Section 3 states the assumptions, and Section 4 presents the results. Section 5 reports the Monte Carlo evidence, and Section 6 concludes. Proofs are collected in the appendices.
The delta expansion and the estimator
Model and notation. We observe an m m m -dimensional diffusion
d X t = μ ( X t ; α ) d t + σ ( X t ; β ) d W t , ν ( x ; β ) = σ ( x ; β ) σ ( x ; β ) T , (1) dX_t = \mu(X_t;\alpha)\,dt + \sigma(X_t;\beta)\,dW_t,\qquad\nu(x;\beta)=\sigma(x;\beta)\sigma(x;\beta)^\mathsf{T}, \tag*{(1)} d X t = μ ( X t ; α ) d t + σ ( X t ; β ) d W t , ν ( x ; β ) = σ ( x ; β ) σ ( x ; β ) T , (1)
at the times t i = i Δ n t_i = i\Delta_n t i = i Δ n , i = 0 , … , n i = 0,\ldots,n i = 0 , … , n , where W W W is an m m m -dimensional Brownian motion. The parameter is θ = ( α , β ) \theta= (\alpha,\beta) θ = ( α , β ) , with true value θ 0 = ( α 0 , β 0 ) \theta_0 = (\alpha_0,\beta_0) θ 0 = ( α 0 , β 0 ) . We write X i = X t i X_i = X_{t_i} X i = X t i , Δ = Δ n \Delta= \Delta_n Δ = Δ n , ε = Δ \varepsilon= \sqrt{\Delta} ε = Δ and ⟨ x ⟩ = ( 1 + ∣ x ∣ 2 ) 1 / 2 \langle x\rangle= (1+|x|^2)^{1/2} ⟨ x ⟩ = ( 1 + ∣ x ∣ 2 ) 1/2 , and we let F i \mathcal{F}_i F i be the σ \sigma σ -field generated by ( X s ) s ≤ t i (X_s)_{s\le t_i} ( X s ) s ≤ t i . We keep the subscript in asymptotic statements, which involve n n n , and drop it when a statement concerns a single transition. In Propositions 1 and 2, which are not asymptotic, Δ ∈ ( 0 , 1 ] \Delta\in(0,1] Δ ∈ ( 0 , 1 ] is arbitrary. The transition density over one step is p Δ ( x ′ ∣ x ; θ ) p_\Delta(x'|x;\theta) p Δ ( x ′ ∣ x ; θ ) . The exact log-likelihood, conditional on X 0 X_0 X 0 , is
ℓ n ( θ ) = ∑ i = 1 n log p Δ ( X i ∣ X i − 1 ; θ ) . \ell_n(\theta) = \sum_{i=1}^{n}\log p_\Delta(X_i|X_{i-1};\theta). ℓ n ( θ ) = i = 1 ∑ n log p Δ ( X i ∣ X i − 1 ; θ ) .
Under the assumptions of § 3 , p Δ ( x ′ ∣ x ; θ ) p_\Delta(x'|x;\theta) p Δ ( x ′ ∣ x ; θ ) is strictly positive and jointly continuous in ( x , x ′ , θ ) (x,x',\theta) ( x , x ′ , θ ) (Lemma A.7 ). Hence ℓ n \ell_n ℓ n is continuous on the compact set Θ \Theta Θ , and a measurable maximizer θ ^ n \hat{\theta}_n θ ^ n exists [34 Lemma 2] . All our results for θ ^ n \hat{\theta}_n θ ^ n except moment convergence (Theorem 5 ), which uses an exact maximizer, also hold for approximate maximizers, with ℓ n ( θ ^ n ) ≥ sup Θ ℓ n − o P ( 1 ) \ell_n(\hat{\theta}_n)\ge\sup_\Theta\ell_n-o_P(1) ℓ n ( θ ^ n ) ≥ sup Θ ℓ n − o P ( 1 ) . We also refer to the delta-expansion estimator defined below as the approximate MLE of Yang et al. [54 ] .
The delta expansion
Yang et al. [54 ] expand p Δ p_\Delta p Δ around the density of a Brownian motion with drift whose coefficients are frozen at the starting point. In its general form, the frozen drift is a constant μ 0 \mu_0 μ 0 , which may depend on the starting point x x x and on θ \theta θ . The subscript in μ 0 \mu_0 μ 0 does not refer to the true parameter: μ 0 \mu_0 μ 0 is evaluated at the same θ \theta θ as the rest of the expansion. Let
z = x ′ − x − μ 0 Δ Δ , q ( x ′ ∣ x ; θ ) = Δ − m / 2 ϕ ( z ; ν ( x ; β ) ) , z = \frac{x'-x-\mu_0\Delta}{\sqrt{\Delta}}, \qquad q(x'|x;\theta) = \Delta^{-m/2}\phi(z;\nu(x;\beta)), z = Δ x ′ − x − μ 0 Δ , q ( x ′ ∣ x ; θ ) = Δ − m /2 ϕ ( z ; ν ( x ; β )) ,
where ϕ ( ⋅ ; Σ ) \phi(\cdot;\Sigma) ϕ ( ⋅ ; Σ ) is the N ( 0 , Σ ) N(0,\Sigma) N ( 0 , Σ ) density. The delta expansion of order K K K is
p ( K , Δ ) ( x ′ ∣ x ; θ ) = q ( x ′ ∣ x ; θ ) ( 1 + ∑ k = 1 K Δ k / 2 C k ( z ; x , θ ) ) , (2) p^{(K,\Delta)}(x'|x;\theta) = q(x'|x;\theta)\left(1+\sum_{k=1}^{K}\Delta^{k/2}C_k(z;x,\theta)\right), \tag*{(2)} p ( K , Δ ) ( x ′ ∣ x ; θ ) = q ( x ′ ∣ x ; θ ) ( 1 + k = 1 ∑ K Δ k /2 C k ( z ; x , θ ) ) , (2)
C k = ∑ N = ⌈ ( k + 1 ) / 2 ⌉ 2 k 1 N ! ∑ ∣ h ∣ = 2 N − k w N , h ( x ; θ ) H h ( z ; ν ( x ; β ) ) , C_k = \sum_{N=\lceil(k+1)/2\rceil}^{2k}\frac{1}{N!}\sum_{|h|=2N-k}w_{N,h}(x;\theta)H_h(z;\nu(x;\beta)), C k = N = ⌈( k + 1 ) /2 ⌉ ∑ 2 k N ! 1 ∣ h ∣ = 2 N − k ∑ w N , h ( x ; θ ) H h ( z ; ν ( x ; β )) ,
where H h ( z ; Σ ) = ( − 1 ) ∣ h ∣ ϕ ( z ; Σ ) − 1 ∂ h ϕ ( z ; Σ ) H_h(z;\Sigma)=(-1)^{|h|}\phi(z;\Sigma)^{-1}\partial^h\phi(z;\Sigma) H h ( z ; Σ ) = ( − 1 ) ∣ h ∣ ϕ ( z ; Σ ) − 1 ∂ h ϕ ( z ; Σ ) are multivariate Hermite polynomials. The coefficients w N , h ( x ; θ ) w_{N,h}(x;\theta) w N , h ( x ; θ ) come from a recursion that involves only μ \mu μ , ν \nu ν , their derivatives and μ 0 \mu_0 μ 0 (equations (18)–(20) of Yang et al. [54 ] , restated in Appendix § 10 ).
For estimation we use the centering μ 0 = μ ( x ; α ) \mu_0=\mu(x;\alpha) μ 0 = μ ( x ; α ) , which Yang et al. [54 ] recommend and use in their numerical work. With this choice, the Gaussian kernel q q q is the Euler density, and the first correction C 1 C_1 C 1 does not involve the drift parameters (Lemma A.1 (c)). Unless stated otherwise, z z z , q q q and C k C_k C k refer to this centering. Other centerings are treated in § 4 .
The estimator
Far in the tails, the bracket in (2) can become negative, and then its logarithm is undefined. With probability tending to one, no observation falls there (Lemma A.2). Still, an estimator should be defined on every sample. We therefore write R ( z ; x , θ ) = ∑ k = 1 K ε k C k ( z ; x , θ ) R(z;x,\theta)=\sum_{k=1}^{K}\varepsilon^k C_k(z;x,\theta) R ( z ; x , θ ) = ∑ k = 1 K ε k C k ( z ; x , θ ) , with R ≡ 0 R\equiv0 R ≡ 0 for K = 0 K=0 K = 0 , and for K ≥ 0 K\ge0 K ≥ 0 maximize the truncated contrast
ℓ n ( K ) ( θ ) = ∑ i = 1 n [ log q ( X i ∣ X i − 1 ; θ ) + log max { 1 + R i ( θ ) , 1 2 } ] , R i ( θ ) = R ( z i ( α ) ; X i − 1 , θ ) , (3) \ell_n^{(K)}(\theta)=\sum_{i=1}^{n}\left[\log q(X_i|X_{i-1};\theta)+\log\max\left\{1+R_i(\theta),\frac{1}{2}\right\}\right], \qquad R_i(\theta)=R(z_i(\alpha);X_{i-1},\theta), \tag*{(3)} ℓ n ( K ) ( θ ) = i = 1 ∑ n [ log q ( X i ∣ X i − 1 ; θ ) + log max { 1 + R i ( θ ) , 2 1 } ] , R i ( θ ) = R ( z i ( α ) ; X i − 1 , θ ) , (3)
where z i ( α ) = ( X i − X i − 1 − μ ( X i − 1 ; α ) Δ ) / ε z_i(\alpha) = (X_i - X_{i-1} - \mu(X_{i-1};\alpha)\Delta)/\varepsilon z i ( α ) = ( X i − X i − 1 − μ ( X i − 1 ; α ) Δ ) / ε . The delta-expansion estimator θ ^ n ( K ) = ( α ^ n , β ^ n ) \hat{\theta}_n^{(K)} = (\hat{\alpha}_n,\hat{\beta}_n) θ ^ n ( K ) = ( α ^ n , β ^ n ) is any measurable maximizer of ℓ n ( K ) \ell_n^{(K)} ℓ n ( K ) over Θ \Theta Θ . On the event
Ω n = { max 1 ≤ i ≤ n sup θ ∈ Θ ∣ R i ( θ ) ∣ ≤ 1 4 } , \Omega_n = \left\{ \max_{1\leq i\leq n}\sup_{\theta\in\Theta}|R_i(\theta)| \leq\frac{1}{4} \right\}, Ω n = { 1 ≤ i ≤ n max θ ∈ Θ sup ∣ R i ( θ ) ∣ ≤ 4 1 } ,
the truncation is inactive, and ℓ n ( K ) \ell_n^{(K)} ℓ n ( K ) is the approximate log-likelihood of Yang et al. [54 ] . The two constants play different roles: the floor 1 2 \frac{1}{2} 2 1 keeps the contrast finite on every sample, while on Ω n \Omega_n Ω n , where ∣ R i ∣ ≤ 1 4 |R_i| \leq\frac{1}{4} ∣ R i ∣ ≤ 4 1 , the logarithm and its derivatives are bounded uniformly, which is what the proofs use. For K = 0 K=0 K = 0 we set R ≡ 0 R\equiv0 R ≡ 0 , so θ ^ n ( 0 ) \hat{\theta}_n^{(0)} θ ^ n ( 0 ) is the Euler (Gaussian quasi-) maximum likelihood estimator.
Two properties of (2) drive the analysis. First, the leading factor q q q is the Euler density, so the delta-expansion contrast is the Euler contrast plus a correction of order ε \varepsilon ε per observation. This reduces consistency to a perturbation of the Euler theory. Second, every C k C_k C k is a combination of Hermite polynomials of positive degree, which have mean zero under the local Gaussian law N ( 0 , ν ( x ; β ) ) N(0,\nu(x;\beta)) N ( 0 , ν ( x ; β )) . Hence p ( K , Δ ) p^{(K,\Delta)} p ( K , Δ ) integrates to one exactly, and the error of the expansion shows up as an explicit bias of the score. This is where the order K K K enters.
Assumptions
The assumptions of this section cover bounded volatility; § 4.6 replaces Assumptions H1 and H2 by a version for volatility of linear growth. The assumptions are of three kinds, plus one used only for moments. Smoothness and ellipticity (H1–H2) control the expansion, ergodicity (H3) supplies laws of large numbers, and identifiability (H4) pins down the true parameter. A rate condition on ergodic averages (H5) is used only for moment convergence.
Assumption H1 (parameters and smoothness). Θ = Θ α × Θ β \Theta= \Theta_\alpha\times\Theta_\beta Θ = Θ α × Θ β , where Θ α ⊂ R p α \Theta_\alpha\subset\mathbb{R}^{p_\alpha} Θ α ⊂ R p α and Θ β ⊂ R p β \Theta_\beta\subset\mathbb{R}^{p_\beta} Θ β ⊂ R p β are closures of bounded open convex sets, and θ 0 \theta_0 θ 0 lies in the interior of Θ \Theta Θ . The drift depends only on α \alpha α and the diffusion coefficient only on β \beta β . The functions μ ( x ; α ) \mu(x;\alpha) μ ( x ; α ) and σ ( x ; β ) \sigma(x;\beta) σ ( x ; β ) are C ∞ C^\infty C ∞ in ( x , θ ) (x,\theta) ( x , θ ) . The function σ \sigma σ and all its partial derivatives are bounded on R m × Θ \mathbb{R}^m \times\Theta R m × Θ . Every partial derivative of μ \mu μ of order at least one in x x x is bounded on R m × Θ \mathbb{R}^m \times\Theta R m × Θ , and ∣ ∂ α b μ ( x ; α ) ∣ ≤ C ⟨ x ⟩ |\partial_\alpha^b\mu(x;\alpha)| \leq C\langle x\rangle ∣ ∂ α b μ ( x ; α ) ∣ ≤ C ⟨ x ⟩ for every multi-index b b b .
Separating drift and diffusion parameters is standard (Kessler, [37 ] ; Gobet, [25 ] ; Uchida and Yoshida, [51 ] ), and all models in Yang et al. [54 ] have this structure. The two groups are estimated at different rates, and the separation makes the limiting information block-diagonal. Many models in which a parameter appears in both coefficients can be reparametrized to separate them. For instance, the Ornstein–Uhlenbeck process d X t = − κ X t d t + 2 κ v d W t dX_t=-\kappa X_t\,dt+\sqrt{2\kappa v}\,dW_t d X t = − κ X t d t + 2 κ v d W t , parametrized by its stationary variance v v v , separates with σ 2 = 2 κ v \sigma^2=2\kappa v σ 2 = 2 κ v as the diffusion parameter. When a parameter genuinely enters both coefficients, as in the Pearson diffusions of Forman and Sørensen [20 ] , it is identified through the diffusion coefficient at rate n \sqrt{n} n , and the rate matrix and the information structure change; we leave this case for future work.
The conditions on μ \mu μ say that the drift is Lipschitz in x x x and grows at most linearly. They allow the Ornstein–Uhlenbeck drift μ ( x ; α ) = κ ( x ˉ − x ) \mu(x;\alpha)=\kappa(\bar{x}-x) μ ( x ; α ) = κ ( x ˉ − x ) , Gaussian affine models, and nonlinear drifts such as − κ x + g ( x ) -\kappa x+g(x) − κ x + g ( x ) with g g g bounded and smooth. They exclude superlinear drifts such as − x 3 -x^3 − x 3 . The conditions on σ \sigma σ exclude square-root volatilities. We need them for the heat kernel bounds of Menozzi et al. [42 ] , on which Proposition 1 rests. Convexity of Θ \Theta Θ is used in mean-value expansions and in a Sobolev inequality for suprema over the parameter space.
Assumption H2 (uniform ellipticity). There are constants 0 < λ min ≤ λ max < ∞ 0 < \lambda_{\min} \le\lambda_{\max} < \infty 0 < λ m i n ≤ λ m a x < ∞ with λ min I ≤ ν ( x ; β ) ≤ λ max I \lambda_{\min}I \le\nu(x;\beta) \le\lambda_{\max}I λ m i n I ≤ ν ( x ; β ) ≤ λ m a x I for all x x x and β \beta β . We write Λ = λ max / λ min \Lambda= \lambda_{\max}/\lambda_{\min} Λ = λ m a x / λ m i n .
Uniform ellipticity is Assumption 2.3 of Yang et al. [54 ] . It gives a smooth transition density with Gaussian bounds and keeps the Hermite polynomials in (2) well defined. The ratio Λ \Lambda Λ reappears in Theorem 1, where it controls how extreme an observed increment can look relative to the Gaussian kernel q q q .
Assumption H3 (ergodicity and moments). Under θ 0 \theta_0 θ 0 : (i) X X X is positive Harris recurrent with invariant probability π \pi π , so that T − 1 ∫ 0 T g ( X s ) d s → ∫ g d π T^{-1}\int_0^T g(X_s)\,\mathrm{d}s \to\int g\,\mathrm{d}\pi T − 1 ∫ 0 T g ( X s ) d s → ∫ g d π almost surely, for every initial law and every π \pi π -integrable g g g ; (ii) the initial law has finite moments of all orders, and sup t ≥ 0 E ∣ X t ∣ p < ∞ \sup_{t\ge0}\mathbb{E}|X_t|^p < \infty sup t ≥ 0 E ∣ X t ∣ p < ∞ for every p ≥ 1 p \ge1 p ≥ 1 .
This assumption turns sums over observations into integrals against π \pi π . For Harris recurrence and the associated ergodic theorems, see Harris [27 ] , Meyn and Tweedie [43 ] and Kaspi and Mandelbaum [36 ] .
A convenient sufficient condition is mean reversion: ⟨ μ ( x ; α 0 ) , x ⟩ ≤ − c ∣ x ∣ \langle\mu(x;\alpha_0),x\rangle\le-c|x| ⟨ μ ( x ; α 0 ) , x ⟩ ≤ − c ∣ x ∣ for ∣ x ∣ ≥ r |x| \ge r ∣ x ∣ ≥ r , together with E e a ∣ X 0 ∣ < ∞ \mathbb{E}e^{a|X_0|} < \infty E e a ∣ X 0 ∣ < ∞ for some a > 0 a > 0 a > 0 . To see why it suffices, let
A f ( x ) = ⟨ μ ( x ; α 0 ) , ∇ f ( x ) ⟩ + 1 2 tr ( ν ( x ; β 0 ) ∇ 2 f ( x ) ) Af(x) = \langle\mu(x;\alpha_0),\nabla f(x)\rangle+ \frac{1}{2}\operatorname{tr}\left(\nu(x;\beta_0)\nabla^2 f(x)\right) A f ( x ) = ⟨ μ ( x ; α 0 ) , ∇ f ( x )⟩ + 2 1 tr ( ν ( x ; β 0 ) ∇ 2 f ( x ) )
be the generator of X X X under θ 0 \theta_0 θ 0 , acting on functions f ∈ C 2 ( R m ) f \in C^2(\mathbb{R}^m) f ∈ C 2 ( R m ) , and let V ( x ) = e a ′ ∣ x ∣ V(x) = e^{a'|x|} V ( x ) = e a ′ ∣ x ∣ for ∣ x ∣ ≥ r |x| \ge r ∣ x ∣ ≥ r , smoothed near the origin. For ∣ x ∣ ≥ r |x| \ge r ∣ x ∣ ≥ r , ∇ V = a ′ V x / ∣ x ∣ \nabla V = a'Vx/|x| ∇ V = a ′ V x /∣ x ∣ and ∇ 2 V = V [ a ′ 2 x x T / ∣ x ∣ 2 + a ′ ( I − x x T / ∣ x ∣ 2 ) / ∣ x ∣ ] \nabla^2V = V[a'^{2}xx^{\mathsf{T}}/|x|^2 + a'(I - xx^{\mathsf{T}}/|x|^2)/|x|] ∇ 2 V = V [ a ′ 2 x x T /∣ x ∣ 2 + a ′ ( I − x x T /∣ x ∣ 2 ) /∣ x ∣ ] , so
A V ( x ) = V ( x ) [ a ′ ⟨ μ ( x ; α 0 ) , x ⟩ ∣ x ∣ + a ′ 2 2 x T ν x ∣ x ∣ 2 + a ′ 2 ∣ x ∣ ( tr ν − x T ν x ∣ x ∣ 2 ) ] . AV(x) = V(x)\left[a'\frac{\langle\mu(x;\alpha_0),x\rangle}{|x|} + \frac{a'^{2}}{2}\frac{x^{\mathsf{T}}\nu x}{|x|^2} + \frac{a'}{2|x|}\left(\operatorname{tr}\nu- \frac{x^{\mathsf{T}}\nu x}{|x|^2}\right)\right]. A V ( x ) = V ( x ) [ a ′ ∣ x ∣ ⟨ μ ( x ; α 0 ) , x ⟩ + 2 a ′ 2 ∣ x ∣ 2 x T ν x + 2∣ x ∣ a ′ ( tr ν − ∣ x ∣ 2 x T ν x ) ] .
The first term is at most − a ′ c -a'c − a ′ c by mean reversion, the second at most a ′ 2 λ max / 2 a'^{2}\lambda_{\max}/2 a ′ 2 λ m a x /2 by Assumption H2, and the third lies between 0 and a ′ m λ max / ( 2 ∣ x ∣ ) a'm\lambda_{\max}/(2|x|) a ′ m λ m a x / ( 2∣ x ∣ ) . Hence
A V ≤ V [ − a ′ c + a ′ 2 λ max / 2 + O ( ∣ x ∣ − 1 ) ] . AV \le V\left[-a'c + a'^{2}\lambda_{\max}/2 + O(|x|^{-1})\right]. A V ≤ V [ − a ′ c + a ′ 2 λ m a x /2 + O ( ∣ x ∣ − 1 ) ] .
For a ′ < c / λ max a' < c/\lambda_{\max} a ′ < c / λ m a x the bracket is at most − a ′ c / 2 -a'c/2 − a ′ c /2 once ∣ x ∣ |x| ∣ x ∣ is large, so A V ≤ − a ′ c 2 V + b 1 B AV \le-\frac{a'c}{2}V+b1_B A V ≤ − 2 a ′ c V + b 1 B for a constant b b b and a ball B B B . This is a Foster–Lyapunov drift condition. Together with the irreducibility implied by uniform ellipticity, this gives positive Harris recurrence and uniform exponential moments (Meyn and Tweedie [44 ] ; Down et al. [18 ] ). Linear drifts − κ x -\kappa x − κ x whose matrix κ \kappa κ has a positive definite symmetric part satisfy the condition, and so does the bounded drift in § 5 . For a linear drift − κ x -\kappa x − κ x with a general stable κ \kappa κ , that is, with all eigenvalues of κ \kappa κ having positive real part, the Lyapunov equation κ T P + P κ = I \kappa^{\mathsf{T}}P + P\kappa= I κ T P + P κ = I has a unique symmetric positive definite solution P P P , and V ( x ) = exp { a ′ ( x T P x ) 1 / 2 } V(x) = \exp\{a'(x^{\mathsf{T}}Px)^{1/2}\} V ( x ) = exp { a ′ ( x T P x ) 1/2 } , smoothed near the origin, plays the same role for small a ′ > 0 a' > 0 a ′ > 0 . More generally, it does so for any drift with ⟨ μ ( x ; α 0 ) , P x ⟩ ≤ − c ∣ x ∣ \langle\mu(x;\alpha_0),Px\rangle\le-c|x| ⟨ μ ( x ; α 0 ) , P x ⟩ ≤ − c ∣ x ∣ for large ∣ x ∣ |x| ∣ x ∣ and some symmetric positive definite P P P ; for P ≠ I P \ne I P = I this condition is not implied by the Euclidean one above.
Assumption H4 (identifiability). (a) If ν ( x ; β ) = ν ( x ; β 0 ) \nu(x;\beta) = \nu(x;\beta_0) ν ( x ; β ) = ν ( x ; β 0 ) for π \pi π -almost every x x x , then β = β 0 \beta= \beta_0 β = β 0 . (b) If μ ( x ; α ) = μ ( x ; α 0 ) \mu(x;\alpha) = \mu(x;\alpha_0) μ ( x ; α ) = μ ( x ; α 0 ) for π \pi π -almost every x x x , then α = α 0 \alpha= \alpha_0 α = α 0 . (c) The matrices
Γ α = ∫ ( ∂ α μ ) T ν − 1 ( ∂ α μ ) d π , ( Γ β ) j k = 1 2 ∫ tr ( ν − 1 ∂ β j ν ν − 1 ∂ β k ν ) d π , \Gamma_\alpha= \int(\partial_\alpha\mu)^{\mathsf{T}}\nu^{-1}(\partial_\alpha\mu)\,\mathrm{d}\pi,\qquad
(\Gamma_\beta)_{jk} = \frac{1}{2}\int\operatorname{tr}\left(\nu^{-1}\partial_{\beta_j}\nu\,\nu^{-1}\partial_{\beta_k}\nu\right)\,\mathrm{d}\pi, Γ α = ∫ ( ∂ α μ ) T ν − 1 ( ∂ α μ ) d π , ( Γ β ) j k = 2 1 ∫ tr ( ν − 1 ∂ β j ν ν − 1 ∂ β k ν ) d π ,
evaluated at θ 0 \theta_0 θ 0 , are positive definite. We write Γ = diag ( Γ α , Γ β ) \Gamma= \operatorname{diag}(\Gamma_\alpha,\Gamma_\beta) Γ = diag ( Γ α , Γ β ) .
Parts (a) and (b) ensure that the limiting contrasts in the consistency proof have unique maximizers. Part (c) is the corresponding local condition, and Γ \Gamma Γ is the Fisher information. Information about the drift accumulates with the time span n Δ n n\Delta_n n Δ n rather than with the number of observations, which is why α \alpha α is estimated at the slower rate.
Assumption H5 (rate of ergodic averages). For every p ≥ 1 p \ge1 p ≥ 1 and every C 1 C^1 C 1 function g g g with
∣ g ( x ) ∣ + ∣ ∇ g ( x ) ∣ ≤ C ⟨ x ⟩ r , |g(x)| + |\nabla g(x)| \le C\langle x\rangle^r, ∣ g ( x ) ∣ + ∣∇ g ( x ) ∣ ≤ C ⟨ x ⟩ r ,
for some C C C and r r r ,
sup T ≥ 1 T p / 2 E ∣ 1 T ∫ 0 T g ( X s ) d s − ∫ g d π ∣ p ≤ C p , r C p , \sup_{T\ge1} T^{p/2}\mathbb{E}\left|\frac{1}{T}\int_0^T g(X_s)\,ds-\int g\,d\pi\right|^p \le C_{p,r}C^p, T ≥ 1 sup T p /2 E T 1 ∫ 0 T g ( X s ) d s − ∫ g d π p ≤ C p , r C p ,
where C p , r C_{p,r} C p , r depends only on p p p and r r r .
The expectation is taken under the initial law of the data. This assumption is standard in the quasi-likelihood analysis of ergodic diffusions ([56 , 51 ] ). One route to it runs as follows. Under the drift condition below Assumption H3, the process is exponentially ergodic in a weighted norm ([18 ] ), so the stationary process is exponentially β \beta β -mixing. Moment inequalities for averages of mixing processes ([17 Section 1.4] ) then give the bound in Assumption H5 for functions with polynomial growth. For the stationary Ornstein–Uhlenbeck processes of Section 5, all of these ingredients are standard. For other initial laws, the bound has to be transferred from the stationary case, which requires a coupling argument that we do not pursue.
Main results
This section is organized around the exact MLE. Section 4.1 provides the tool: a bound on the error of the delta expansion on the whole state space. Section 4.2 states the main result, the asymptotic theory of the exact MLE, and Section 4.3 extends it to arbitrary density approximations that come with a quantitative error bound. Section 4.4 analyzes the delta-expansion estimator of fixed order; its consistency and quadratic expansion are also the main ingredients in the proof of the result on the exact MLE. Section 4.5 treats moments, and Section 4.6 extends all results to volatility of linear growth. Throughout, we assume that Δ n ≤ C n − a \Delta_n \le Cn^{-a} Δ n ≤ C n − a for some a > 0 a > 0 a > 0 ; Remark 2 explains why. Since n Δ n → ∞ n\Delta_n \to\infty n Δ n → ∞ , it is necessary that a < 1 a < 1 a < 1 .
A uniform bound on the expansion error
Theorem 3.3 of Yang et al. [54 ] bounds the error of the delta expansion for starting points in a compact set, bounded drift and orders K ≥ m K \ge m K ≥ m . That is not enough for our purpose. An ergodic process visits every region of the state space, and every transition contributes to the likelihood, so we need a bound on all of R m \mathbb{R}^m R m . With an unbounded drift the bound cannot be uniform in the starting point, but a polynomial weight suffices.
Proposition 1 (uniform expansion error). Suppose Assumptions H1–H2 hold, and let μ 0 = μ 0 ( x ; θ ) \mu_0 = \mu_0(x;\theta) μ 0 = μ 0 ( x ; θ ) be any centering with ∣ μ 0 ( x ; θ ) ∣ ≤ C ⟨ x ⟩ |\mu_0(x;\theta)| \le C\langle x\rangle ∣ μ 0 ( x ; θ ) ∣ ≤ C ⟨ x ⟩ . For every integer K ≥ 1 K \ge1 K ≥ 1 there are constants C K C_K C K and r K r_K r K such that, for all Δ ∈ ( 0 , 1 ] \Delta\in(0,1] Δ ∈ ( 0 , 1 ] , x , x ′ ∈ R m x,x' \in\mathbb{R}^m x , x ′ ∈ R m and θ ∈ Θ \theta\in\Theta θ ∈ Θ ,
∣ p ( K , Δ ) ( x ′ ∣ x ; θ ) − p Δ ( x ′ ∣ x ; θ ) ∣ ≤ C K ⟨ x ⟩ r K Δ ( K + 1 − m ) / 2 . \left|p^{(K,\Delta)}(x' \mid x;\theta)-p_\Delta(x' \mid x;\theta)\right| \le C_K\langle x\rangle^{r_K}\Delta^{(K+1-m)/2}. p ( K , Δ ) ( x ′ ∣ x ; θ ) − p Δ ( x ′ ∣ x ; θ ) ≤ C K ⟨ x ⟩ r K Δ ( K + 1 − m ) /2 .
Since q q q is of order Δ − m / 2 \Delta^{-m/2} Δ − m /2 in the bulk of the distribution, the proposition says that the relative error of the expansion is of order Δ ( K + 1 ) / 2 \Delta^{(K+1)/2} Δ ( K + 1 ) /2 where the data lie.
The proof (Appendix § 10 ) is self-contained apart from the heat kernel bounds of Menozzi et al. [42 ] . These are Gaussian bounds for the transition density and its gradient, centered at the deterministic flow of the drift. We write the error as a time integral by a Duhamel argument, show that the integrand vanishes near the starting point to an order that compensates for the singularity of the Hermite kernels, and integrate. The weight ⟨ x ⟩ r K \langle x\rangle^{r_K} ⟨ x ⟩ r K comes from the linear growth of the drift.
The exact MLE
We now turn to the question left open by Yang et al. [54 ] . As explained in the introduction, the delta expansion serves here as a tool of proof rather than of computation. Drift and diffusion parameters are estimated at different rates, collected in the matrix
D n = diag ( n Δ n I p α , n I p β ) . D_n = \operatorname{diag}\left(\sqrt{n\Delta_n}I_{p_\alpha},\sqrt{n}I_{p_\beta}\right). D n = diag ( n Δ n I p α , n I p β ) .
where I p I_p I p is the p × p p\times p p × p identity matrix and p α p_\alpha p α , p β p_\beta p β are the dimensions of α \alpha α and β \beta β (Assumption H1). We write S n S_n S n for the normalized martingale part of the Euler score at θ 0 \theta_0 θ 0 , a sum of martingale differences with S n → d N ( 0 , Γ ) S_n \xrightarrow{\mathrm{d}} N(0,\Gamma) S n d N ( 0 , Γ ) . Lemma D.2 gives the precise definition and shows that the martingale parts of the scores of all delta-expansion contrasts differ from S n S_n S n by o P ( 1 ) o_{\mathbb{P}}(1) o P ( 1 ) .
Theorem 1 (exact MLE). Suppose Assumptions H1–H4 hold, n Δ n → ∞ n\Delta_n\to\infty n Δ n → ∞ , and Δ n ≤ C n − a \Delta_n\le Cn^{-a} Δ n ≤ C n − a for some a ∈ ( 0 , 1 ) a\in(0,1) a ∈ ( 0 , 1 ) and C < ∞ C<\infty C < ∞ . Let θ ^ n \hat{\theta}_n θ ^ n be a measurable maximizer of ℓ n \ell_n ℓ n , or more generally a measurable θ ^ n \hat{\theta}_n θ ^ n with ℓ n ( θ ^ n ) ≥ sup Θ ℓ n − o P ( 1 ) \ell_n(\hat{\theta}_n)\ge\sup_\Theta\ell_n-o_{\mathbb{P}}(1) ℓ n ( θ ^ n ) ≥ sup Θ ℓ n − o P ( 1 ) . Then:
(a) for every integer K K K with K + 1 > 2 ( 1 + m Λ ) / a K+1>2(1+m\Lambda)/a K + 1 > 2 ( 1 + m Λ ) / a , sup θ ∈ Θ ∣ ℓ n ( θ ) − ℓ n ( K ) ( θ ) ∣ → P 0 \sup_{\theta\in\Theta}|\ell_n(\theta)-\ell_n^{(K)}(\theta)|\xrightarrow{\mathbb{P}}0 sup θ ∈ Θ ∣ ℓ n ( θ ) − ℓ n ( K ) ( θ ) ∣ P 0 ;
(b) θ ^ n → P θ 0 \hat{\theta}_n\xrightarrow{\mathbb{P}}\theta_0 θ ^ n P θ 0 and D n ( θ ^ n − θ 0 ) = Γ − 1 S n + o P ( 1 ) → d N ( 0 , diag ( Γ α − 1 , Γ β − 1 ) ) D_n(\hat{\theta}_n-\theta_0)=\Gamma^{-1}S_n+o_{\mathbb{P}}(1)\xrightarrow{\mathrm{d}}N\left(0,\operatorname{diag}(\Gamma_\alpha^{-1},\Gamma_\beta^{-1})\right) D n ( θ ^ n − θ 0 ) = Γ − 1 S n + o P ( 1 ) d N ( 0 , diag ( Γ α − 1 , Γ β − 1 ) ) ;
(c) for every K ≥ 1 K\ge1 K ≥ 1 with n Δ n K + 1 → 0 n\Delta_n^{K+1}\to0 n Δ n K + 1 → 0 , D n ( θ ^ n ( K ) − θ ^ n ) → P 0 D_n(\hat{\theta}_n^{(K)}-\hat{\theta}_n)\xrightarrow{\mathbb{P}}0 D n ( θ ^ n ( K ) − θ ^ n ) P 0 .
Part (a) is the heart of the argument. By Proposition 1, the relative error of the expansion at an observation is of order Δ ( K + 1 ) / 2 \Delta^{(K+1)/2} Δ ( K + 1 ) /2 divided by the Gaussian kernel. The kernel is smallest at the most extreme standardized increment, which is of order log n \sqrt{\log n} log n , and this costs at most a factor n ( 1 + δ ) m Λ n^{(1+\delta)m\Lambda} n ( 1 + δ ) m Λ for any δ > 0 \delta>0 δ > 0 . A high enough order makes the total error over n n n observations vanish. The threshold 2 ( 1 + m Λ ) / a 2(1+m\Lambda)/a 2 ( 1 + m Λ ) / a is crude, since it guards against the most extreme increment and the least favorable parameter value at once. This is harmless: the order K K K in (a) is a device of the proof and is never computed in practice.
The proof has two inputs. The consistency and quadratic expansion of the explicit contrast are stated in Section 4.4 (Theorems 3 and 4 ), which can be read independently of Sections 4.2–4.3. Proposition 1 makes the explicit contrast ℓ n ( K ) \ell_n^{(K)} ℓ n ( K ) a uniformly accurate surrogate for ℓ n \ell_n ℓ n , and the analysis of ℓ n ( K ) \ell_n^{(K)} ℓ n ( K ) in Section 4.4 supplies consistency and a uniform quadratic expansion. Neither input involves derivatives of p Δ p_\Delta p Δ in θ \theta θ .
Part (b) needs no rate condition on Δ n \Delta_n Δ n beyond polynomial decay. Part (c) complements Theorem 4.1 of Yang et al. [54 ] , which concerns the limit Δ → 0 \Delta\to0 Δ → 0 with n n n fixed: the approximate and exact estimators agree at the scale of their own sampling error, for every order at which the approximate estimator is asymptotically unbiased. Together, (b) and (c) show that both terms of the decomposition
θ ^ n ( K ) − θ 0 = ( θ ^ n ( K ) − θ ^ n ) + ( θ ^ n − θ 0 ) \hat{\theta}_n^{(K)}-\theta_0=(\hat{\theta}_n^{(K)}-\hat{\theta}_n)+(\hat{\theta}_n-\theta_0) θ ^ n ( K ) − θ 0 = ( θ ^ n ( K ) − θ ^ n ) + ( θ ^ n − θ 0 )
used by Yang et al. [54 ] vanish at the optimal rates. The uniform approximation in (a), combined with the quadratic expansion of the explicit contrast, also gives the LAN property.
Corollary 1 (local asymptotic normality and efficiency). Under the assumptions of Theorem 1, for every bounded sequence u n ∈ R p α + p β u_n \in\mathbb{R}^{p_\alpha+p_\beta} u n ∈ R p α + p β ,
ℓ n ( θ 0 + D n − 1 u n ) − ℓ n ( θ 0 ) = u n T S n − 1 2 u n T Γ u n + o P ( 1 ) , S n ⟶ d N ( 0 , Γ ) . \ell_n(\theta_0+D_n^{-1}u_n)-\ell_n(\theta_0)=u_n^\mathsf{T}S_n-\frac{1}{2}u_n^\mathsf{T}\Gamma u_n+o_P(1),\qquad S_n\mathrel{\mathop{\longrightarrow}^{d}}N(0,\Gamma). ℓ n ( θ 0 + D n − 1 u n ) − ℓ n ( θ 0 ) = u n T S n − 2 1 u n T Γ u n + o P ( 1 ) , S n ⟶ d N ( 0 , Γ ) . Consequently, the exact MLE and, when n Δ n K + 1 → 0 n\Delta_n^{K+1}\to0 n Δ n K + 1 → 0 , the delta-expansion estimator of order K K K are asymptotically efficient in the sense of the Hájek–Le Cam convolution and local asymptotic minimax theorems.
The LAN property itself is not new. Gobet [25 ] proves it with the same rates and information matrix, using Malliavin calculus and requiring only Δ n → 0 \Delta_n\to0 Δ n → 0 ; his conditions and ours are not nested. Our proof avoids Malliavin calculus, relying instead on the heat kernel bounds behind Proposition 1, at the price of polynomial decay of Δ n \Delta_n Δ n . Efficiency follows because both estimators are asymptotically linear in the central sequence S n S_n S n ([33 , 39 ] ). The rate matrix D n D_n D n has different rates in the two blocks, but it is deterministic, so the standard theory for LAN experiments applies.
Consequences for inference. Theorem 1 and Corollary 1 justify Wald inference based on the exact likelihood. A consistent estimate of Γ \Gamma Γ is obtained by plugging θ ^ n \hat{\theta}_n θ ^ n into sample averages: Γ ^ α = n − 1 ∑ i ( ∂ α μ ) T ν − 1 ( ∂ α μ ) \hat{\Gamma}_\alpha=n^{-1}\sum_i(\partial_\alpha\mu)^\mathsf{T}\nu^{-1}(\partial_\alpha\mu) Γ ^ α = n − 1 ∑ i ( ∂ α μ ) T ν − 1 ( ∂ α μ ) and ( Γ ^ β ) j k = ( 2 n ) − 1 ∑ i tr ( ν − 1 ∂ β j ν ν − 1 ∂ β k ν ) (\hat{\Gamma}_\beta)_{jk}=(2n)^{-1}\sum_i\operatorname{tr}(\nu^{-1}\partial_{\beta_j}\nu\nu^{-1}\partial_{\beta_k}\nu) ( Γ ^ β ) j k = ( 2 n ) − 1 ∑ i tr ( ν − 1 ∂ β j ν ν − 1 ∂ β k ν ) , evaluated at ( X i − 1 ; θ ^ n ) (X_{i-1};\hat{\theta}_n) ( X i − 1 ; θ ^ n ) . Its consistency follows from Lemma A.5 and continuity. Wald confidence sets based on θ ^ n \hat{\theta}_n θ ^ n and Γ ^ \hat{\Gamma} Γ ^ therefore have asymptotically correct coverage. The uniform quadratic expansion (13) also suggests the usual chi-square limits for likelihood-ratio statistics. Because the two blocks are estimated at different rates, a general statement requires care with the restricted estimator, and we do not pursue it here. Theorem 5 below adds convergence of moments, which justifies mean squared error approximations.
Other density approximations
The proof of Theorem 1 uses the delta expansion only through its accuracy. The next theorem replaces it with an arbitrary approximation. Part (a) gives a high-level condition, and part (b) gives two sufficient conditions that can be checked directly, one on the error of the density and one on the error of the log-density.
Theorem 2 (approximate likelihoods). Suppose the assumptions of Theorem 1 hold. Let p ~ n ( x ′ ∣ x ; θ ) \widetilde{p}_n(x'|x;\theta) p n ( x ′ ∣ x ; θ ) be real-valued and measurable in ( x , x ′ , θ ) (x,x',\theta) ( x , x ′ , θ ) , and let ℓ ~ n ( θ ) = ∑ i log p ~ n ( X i ∣ X i − 1 ; θ ) \widetilde{\ell}_n(\theta)=\sum_i\log\widetilde{p}_n(X_i|X_{i-1};\theta) ℓ n ( θ ) = ∑ i log p n ( X i ∣ X i − 1 ; θ ) , with log u = − ∞ \log u=-\infty log u = − ∞ for u ≤ 0 u\le0 u ≤ 0 .
(a) Suppose that sup θ ∈ Θ ∣ ℓ ~ n ( θ ) − ℓ n ( θ ) ∣ = o P ( n Δ n ) \sup_{\theta\in\Theta}|\widetilde{\ell}_n(\theta)-\ell_n(\theta)|=o_P(n\Delta_n) sup θ ∈ Θ ∣ ℓ n ( θ ) − ℓ n ( θ ) ∣ = o P ( n Δ n ) and that sup ∣ θ − θ 0 ∣ ≤ η ∣ ℓ ~ n ( θ ) − ℓ n ( θ ) ∣ ⟶ P 0 \sup_{|\theta-\theta_0|\le\eta}|\widetilde{\ell}_n(\theta)-\ell_n(\theta)|\mathrel{\mathop{\longrightarrow}^{P}}0 sup ∣ θ − θ 0 ∣ ≤ η ∣ ℓ n ( θ ) − ℓ n ( θ ) ∣ ⟶ P 0 for some η > 0 \eta>0 η > 0 . Then every θ ~ n \widetilde{\theta}_n θ n with ℓ ~ n ( θ ~ n ) ≥ sup θ ℓ ~ n − o P ( 1 ) \widetilde{\ell}_n(\widetilde{\theta}_n)\ge\sup_\theta\widetilde{\ell}_n-o_P(1) ℓ n ( θ n ) ≥ sup θ ℓ n − o P ( 1 ) satisfies D n ( θ ~ n − θ ^ n ) ⟶ P 0 D_n(\widetilde{\theta}_n-\hat{\theta}_n)\mathrel{\mathop{\longrightarrow}^{P}}0 D n ( θ n − θ ^ n ) ⟶ P 0 . In particular, D n ( θ ~ n − θ 0 ) ⟶ d N ( 0 , diag ( Γ α − 1 , Γ β − 1 ) ) D_n(\widetilde{\theta}_n-\theta_0)\mathrel{\mathop{\longrightarrow}^{d}}N(0,\operatorname{diag}(\Gamma_\alpha^{-1},\Gamma_\beta^{-1})) D n ( θ n − θ 0 ) ⟶ d N ( 0 , diag ( Γ α − 1 , Γ β − 1 )) , and θ ~ n \widetilde{\theta}_n θ n is efficient.
(b) The conditions in (a) hold, with sup θ ∈ Θ ∣ ℓ ~ n − ℓ n ∣ ⟶ P 0 \sup_{\theta\in\Theta}|\widetilde{\ell}_n-\ell_n|\mathrel{\mathop{\longrightarrow}^{P}}0 sup θ ∈ Θ ∣ ℓ n − ℓ n ∣ ⟶ P 0 , if one of the following holds for constants C C C , r r r and ϱ \varrho ϱ that do not depend on n n n :
(i) density error: for some γ > ( 1 + m Λ ) / a \gamma> (1+m\Lambda)/a γ > ( 1 + m Λ ) / a and all x , x ′ , θ x,x',\theta x , x ′ , θ ,
∣ p ~ n ( x ′ ∣ x ; θ ) − p Δ ( x ′ ∣ x ; θ ) ∣ ≤ C ⟨ x ⟩ r Δ n γ − m / 2 ; \left|\widetilde p_n(x'|x;\theta)-p_\Delta(x'|x;\theta)\right| \le C\langle x\rangle^r\Delta_n^{\gamma-m/2}; ∣ p n ( x ′ ∣ x ; θ ) − p Δ ( x ′ ∣ x ; θ ) ∣ ≤ C ⟨ x ⟩ r Δ n γ − m /2 ;
(ii) log-density error: p ~ n > 0 \widetilde p_n>0 p n > 0 , and for some γ > 1 / a \gamma>1/a γ > 1/ a , ϱ ≥ 0 \varrho\ge0 ϱ ≥ 0 and all x , x ′ , θ x,x',\theta x , x ′ , θ ,
∣ log p ~ n ( x ′ ∣ x ; θ ) − log p Δ ( x ′ ∣ x ; θ ) ∣ ≤ C ⟨ x ⟩ r Δ n γ ( 1 + ∣ x ′ − x ∣ ϱ Δ n − ϱ / 2 ) . \left|\log\widetilde p_n(x'|x;\theta)-\log p_\Delta(x'|x;\theta)\right| \le C\langle x\rangle^r\Delta_n^\gamma\left(1+|x'-x|^\varrho\Delta_n^{-\varrho/2}\right). ∣ log p n ( x ′ ∣ x ; θ ) − log p Δ ( x ′ ∣ x ; θ ) ∣ ≤ C ⟨ x ⟩ r Δ n γ ( 1 + ∣ x ′ − x ∣ ϱ Δ n − ϱ /2 ) .
Reading part (a). Globally, the approximation need only be good enough to preserve consistency, which is why an error of order o P ( n Δ n ) o_{\mathbb{P}}(n\Delta_n) o P ( n Δ n ) suffices; the stronger requirement o P ( 1 ) o_{\mathbb{P}}(1) o P ( 1 ) is needed only near θ 0 \theta_0 θ 0 . Part (a) is a direct consequence of the argmax argument behind Theorem 1. Where ℓ ~ n \widetilde\ell_n ℓ n is not continuous in θ \theta θ , the supremum and the probabilities in (a) are understood as outer ones.
Reading part (b). Condition (i) is the form in which Proposition 1 delivers accuracy: for the delta expansion of order K K K it holds with γ = ( K + 1 ) / 2 \gamma=(K+1)/2 γ = ( K + 1 ) /2 and reproduces the threshold of Theorem 1(a), no more. Both conditions are worst-case bounds and should not be read as practical accuracy targets. Condition (i) is very demanding, because an absolute error must be small compared with the density at the most extreme observed increment; in the bulk of the distribution it amounts to a relative accuracy of order n − ( 1 + m Λ ) n^{-(1+m\Lambda)} n − ( 1 + m Λ ) . Condition (ii) works in relative terms from the start, and its threshold 1 / a 1/a 1/ a amounts roughly to a relative accuracy of order n − 1 n^{-1} n − 1 per transition.
What is not covered. Since (a) needs o P ( 1 ) o_{\mathbb{P}}(1) o P ( 1 ) only near θ 0 \theta_0 θ 0 , a local version of (i) with a smaller threshold should be possible. Stochastic approximations, such as simulated likelihoods, would require conditions on averaged errors and uniform control in θ \theta θ . We pursue neither, so Theorem 2 should be read as a theoretical transfer principle rather than a practical recipe.
Relation to other density approximations. § 5 of Yang et al. [54 ] relates the delta expansion to earlier approximations. For a scalar diffusion with unit volatility, to which any scalar diffusion can be reduced by the Lamperti transform, the delta expansion with μ 0 = 0 \mu_0=0 μ 0 = 0 and order 2 K 2K 2 K coincides with the expansion of Lee et al. [40 ] (Yang et al. [54 ] , Proposition 5.1). That expansion, which its authors also call a delta expansion, rearranges the Hermite series of Aït-Sahalia [3 ] by collecting terms in powers of Δ 1 / 2 \Delta^{1/2} Δ 1/2 .
In the multivariate case, Yang et al. [54 ] rewrite the Malliavin-calculus expansion of Li [41 ] in terms of Hermite polynomials. They verify by symbolic computation that, in one and two dimensions, it agrees with the delta expansion with μ 0 = 0 \mu_0=0 μ 0 = 0 at every order they checked. Chen, Wan and Yang [13 ] settle the general case: in any dimension and at any order, the expansion of Li [41 ] has the same formula as the delta expansion with μ 0 = 0 \mu_0=0 μ 0 = 0 , with a Hermite-polynomial expansion as the intermediate step. The two are therefore one expansion, written in two ways. The expansions of Aït-Sahalia [2 , 4 ] and Choi [14 , 15 ] are of a different kind: they approximate the log-density in integer powers of Δ \Delta Δ and are not algebraically related to (2). Theorem 2 and Corollary 2 below give conditions under which these approximations inherit the asymptotic theory of the exact MLE.
The next corollary applies the theorem to these expansions.
Corollary 2 (other expansions). Suppose the assumptions of Theorem 1 hold.
(a) For any centering μ 0 ( x ; θ ) \mu_0(x;\theta) μ 0 ( x ; θ ) that is measurable in ( x , θ ) (x,\theta) ( x , θ ) with ∣ μ 0 ( x ; θ ) ∣ ≤ C ⟨ x ⟩ |\mu_0(x;\theta)| \le C\langle x\rangle ∣ μ 0 ( x ; θ ) ∣ ≤ C ⟨ x ⟩ , in particular μ 0 = 0 \mu_0=0 μ 0 = 0 , the delta expansion of order K K K with K + 1 > 2 ( 1 + m Λ ) / a K+1 > 2(1+m\Lambda)/a K + 1 > 2 ( 1 + m Λ ) / a satisfies condition (i) of Theorem 2.
(b) Let m = 1 m=1 m = 1 and let F ( x ; β ) = ∫ 0 x d u σ ( u ; β ) F(x;\beta)=\int_0^x \frac{\mathrm{d}u}{\sigma(u;\beta)} F ( x ; β ) = ∫ 0 x σ ( u ; β ) d u be the Lamperti transform. Suppose the drift μ Y ( y ; θ ) \mu_Y(y;\theta) μ Y ( y ; θ ) of Y = F ( X ; β ) Y=F(X;\beta) Y = F ( X ; β ) satisfies the spatial conditions on μ \mu μ in Assumption H1, uniformly in θ \theta θ : it is smooth in y y y , ∣ μ Y ( y ; θ ) ∣ ≤ C ⟨ y ⟩ |\mu_Y(y;\theta)| \le C\langle y\rangle ∣ μ Y ( y ; θ ) ∣ ≤ C ⟨ y ⟩ , and its spatial derivatives of every order ≥ 1 \ge1 ≥ 1 are bounded. (The separation of drift and diffusion parameters is not needed here, since μ Y \mu_Y μ Y depends on both α \alpha α and β \beta β .) Here Λ \Lambda Λ is the ellipticity ratio of Assumption H2 for X X X . Let p ~ n ( x ′ ∣ x ; θ ) = p Y L S L ( F ( x ′ ) ∣ F ( x ) ; θ ) / σ ( x ′ ; β ) \widetilde p_n(x'|x;\theta)=p_Y^{\mathrm{LSL}}(F(x')|F(x);\theta)/\sigma(x';\beta) p n ( x ′ ∣ x ; θ ) = p Y LSL ( F ( x ′ ) ∣ F ( x ) ; θ ) / σ ( x ′ ; β ) , where p Y L S L p_Y^{\mathrm{LSL}} p Y LSL is the expansion of Lee et al. [40 ] for Y Y Y that coincides, by Proposition 5.1 of Yang et al. [54 ] and in the indexing used there, with the delta expansion of Y Y Y of order 2 K ′ 2K' 2 K ′ and centering μ 0 = 0 \mu_0=0 μ 0 = 0 . If 2 K ′ + 1 > 2 ( 1 + Λ ) / a 2K'+1 > 2(1+\Lambda)/a 2 K ′ + 1 > 2 ( 1 + Λ ) / a , then p ~ n \widetilde p_n p n satisfies condition (i) of Theorem 2.
Part (a) covers the expansion of Li [41 ] as well. By the equivalence theorem of Chen, Wan and Yang [13 ] , it is the delta expansion with μ 0 = 0 \mu_0=0 μ 0 = 0 , so at a sufficiently high order it satisfies condition (i), and the approximate MLE of Li [41 ] inherits the asymptotic theory of the exact MLE in every dimension. Part (a) also shows that the centering does not matter for the equivalence with the exact MLE. It does matter at a fixed, low order: with μ 0 = 0 \mu_0=0 μ 0 = 0 , the drift enters the corrections at order ε \varepsilon ε rather than ε 2 \varepsilon^2 ε 2 , and our consistency proof would have to be redone.
The condition on the drift of Y Y Y in (b) is restrictive. Its derivative involves μ σ ′ / σ \mu\sigma'/\sigma μ σ ′ / σ , so with a linearly growing drift it essentially requires σ ′ ( x ) = O ( 1 / ∣ x ∣ ) \sigma'(x)=O(1/|x|) σ ′ ( x ) = O ( 1/∣ x ∣ ) . It holds, for instance, for μ ( x ; α ) = − α x \mu(x;\alpha)=-\alpha x μ ( x ; α ) = − α x and σ ( x ; β ) = β ( 1 + 0.3 tanh x ) \sigma(x;\beta)=\beta(1+0.3\tanh x) σ ( x ; β ) = β ( 1 + 0.3 tanh x ) .
The log-density expansions of Aït-Sahalia [4 ] and Choi [14 , 15 ] are natural candidates for condition (ii). To our knowledge, however, no error bound of that form, uniform in the starting point and the parameter, is available for them.
The delta-expansion estimator
We now analyze the delta-expansion estimator of a fixed order K K K , the estimator that is computed in practice. Its consistency and quadratic expansion are the tools behind Theorem 1, and its bias shows how large K K K must be.
Consistency. Consistency holds for every order. It depends only on the structure of the corrections, not on how accurately they approximate the true density, so it does not use Proposition 1.
Theorem 3 (consistency). Suppose Assumptions H1–H3 and H4(a,b) hold, n Δ n → ∞ n\Delta_n\to\infty n Δ n → ∞ and Δ n ≤ C n − a \Delta_n\le Cn^{-a} Δ n ≤ C n − a for some a > 0 a>0 a > 0 . Then for every K ≥ 0 K\ge0 K ≥ 0 , P ( Ω n ) → 1 \mathbb{P}(\Omega_n)\to1 P ( Ω n ) → 1 and θ ^ n ( K ) → P θ 0 \widehat{\theta}_n^{(K)}\xrightarrow{\mathbb{P}}\theta_0 θ n ( K ) P θ 0 .
The proof (Appendix § 11 ) separates the two time scales. Normalized by n n n , the contrast identifies the diffusion parameters, and the corrections are negligible. Normalized by n Δ n n\Delta_n n Δ n , the contrast identifies the drift parameters. At this scale, the corrections are as large as the signal and vanish only on average, because they are Hermite polynomials with mean zero under the local Gaussian law. This cancellation requires the diffusion parameters to be estimated consistently, so the proof treats them first.
Asymptotic distribution. For the asymptotic distribution, the order of the expansion matters, because it determines the bias of the score. With D n D_n D n as in § 4.2 , let
ξ n = n Δ n ( K + 1 ) / 2 . \xi_n = \sqrt{n}\Delta_n^{(K+1)/2}. ξ n = n Δ n ( K + 1 ) /2 .
The bias is the projection of the first omitted correction C K + 1 C_{K+1} C K + 1 on the Euler scores. For K ≥ 1 K \ge1 K ≥ 1 and Z ∼ N ( 0 , ν ( x ; β 0 ) ) Z \sim N(0,\nu(x;\beta_0)) Z ∼ N ( 0 , ν ( x ; β 0 )) , let
b α ( x ) = E [ ( ∂ α μ ) ⊤ ν − 1 Z C K + 1 ( Z ; x , θ 0 ) ] , b β j ( x ) = 1 2 E [ ( Z ⊤ ν − 1 ∂ β j ν ν − 1 Z − tr ( ν − 1 ∂ β j ν ) ) C K + 1 ( Z ; x , θ 0 ) ] . (4) \begin{aligned}
b_\alpha(x) &= \mathbb{E}\left[(\partial_\alpha\mu)^\top\nu^{-1}Z C_{K+1}(Z;x,\theta_0)\right],\\
b_{\beta_j}(x) &= \frac{1}{2}\mathbb{E}\left[\left(Z^\top\nu^{-1}\partial_{\beta_j}\nu\nu^{-1}Z-\operatorname{tr}(\nu^{-1}\partial_{\beta_j}\nu)\right)C_{K+1}(Z;x,\theta_0)\right]. \tag*{(4)}
\end{aligned} b α ( x ) b β j ( x ) = E [ ( ∂ α μ ) ⊤ ν − 1 Z C K + 1 ( Z ; x , θ 0 ) ] , = 2 1 E [ ( Z ⊤ ν − 1 ∂ β j ν ν − 1 Z − tr ( ν − 1 ∂ β j ν ) ) C K + 1 ( Z ; x , θ 0 ) ] . (4)
with all coefficients evaluated at ( x ; θ 0 ) (x;\theta_0) ( x ; θ 0 ) , and let B ˉ ( K ) = ∫ ( b α , b β ) d π \bar{B}^{(K)}=\int(b_\alpha,b_\beta)\,\mathrm{d}\pi B ˉ ( K ) = ∫ ( b α , b β ) d π .
Theorem 4 (asymptotic expansion). Suppose Assumptions H 1 H1 H 1 –H 4 H4 H 4 hold, K ≥ 1 K \ge1 K ≥ 1 , n Δ n → ∞ n\Delta_n \to\infty n Δ n → ∞ and Δ n ≤ C n − a \Delta_n \le Cn^{-a} Δ n ≤ C n − a for some a > 0 a > 0 a > 0 . Then
D n ( θ ^ n ( K ) − θ 0 ) = Γ − 1 ( S n + ξ n B ˉ ( K ) ) + o P ( 1 + ξ n ) , D_n(\hat{\theta}_n^{(K)}-\theta_0)=\Gamma^{-1}(S_n+\xi_n\bar{B}^{(K)})+o_{\mathbb{P}}(1+\xi_n), D n ( θ ^ n ( K ) − θ 0 ) = Γ − 1 ( S n + ξ n B ˉ ( K ) ) + o P ( 1 + ξ n ) , where S n → d N ( 0 , Γ ) S_n \xrightarrow{d} N(0,\Gamma) S n d N ( 0 , Γ ) is the normalized martingale part of the score (Lemma D.2 ). Moreover, B ˉ β ( K ) = 0 \bar{B}^{(K)}_\beta=0 B ˉ β ( K ) = 0 if K K K is even and B ˉ α ( K ) = 0 \bar{B}^{(K)}_\alpha=0 B ˉ α ( K ) = 0 if K K K is odd. The same expansion holds for the Euler estimator, K = 0 K=0 K = 0 , with ξ n = n Δ n \xi_n=\sqrt{n}\Delta_n ξ n = n Δ n and B ˉ ( 0 ) : = B ˉ ( 1 ) \bar{B}^{(0)}:=\bar{B}^{(1)} B ˉ ( 0 ) := B ˉ ( 1 ) , whose drift block is zero.
The theorem describes all sampling regimes at once: the martingale term S n S_n S n is always of order one, while the bias term ξ n B ˉ ( K ) \xi_n\bar{B}^{(K)} ξ n B ˉ ( K ) may vanish, stay bounded or diverge, as Corollary 3 makes explicit. The remainder is of smaller order because Proposition 1, applied at order K + 1 K+1 K + 1 , controls the second omitted term. The following consequences are immediate.
Corollary 3 (sampling regimes). Under the assumptions of Theorem 4 , with ξ n 2 = n Δ n K + 1 \xi_n^2=n\Delta_n^{K+1} ξ n 2 = n Δ n K + 1 for K ≥ 1 K \ge1 K ≥ 1 and ξ n 2 = n Δ n 2 \xi_n^2=n\Delta_n^2 ξ n 2 = n Δ n 2 for K = 0 K=0 K = 0 :
(a) if ξ n → 0 \xi_n\to0 ξ n → 0 , then D n ( θ ^ n ( K ) − θ 0 ) → d N ( 0 , diag ( Γ α − 1 , Γ β − 1 ) ) D_n(\hat{\theta}_n^{(K)}-\theta_0)\xrightarrow{d}N(0,\operatorname{diag}(\Gamma_\alpha^{-1},\Gamma_\beta^{-1})) D n ( θ ^ n ( K ) − θ 0 ) d N ( 0 , diag ( Γ α − 1 , Γ β − 1 )) ;
(b) if ξ n → ξ ∈ ( 0 , ∞ ) \xi_n\to\xi\in(0,\infty) ξ n → ξ ∈ ( 0 , ∞ ) , then D n ( θ ^ n ( K ) − θ 0 ) → d N ( ξ Γ − 1 B ˉ ( K ) , diag ( Γ α − 1 , Γ β − 1 ) ) D_n(\hat{\theta}_n^{(K)}-\theta_0)\xrightarrow{d}N(\xi\Gamma^{-1}\bar{B}^{(K)},\operatorname{diag}(\Gamma_\alpha^{-1},\Gamma_\beta^{-1})) D n ( θ ^ n ( K ) − θ 0 ) d N ( ξ Γ − 1 B ˉ ( K ) , diag ( Γ α − 1 , Γ β − 1 )) ;
(c) if ξ n → ∞ \xi_n\to\infty ξ n → ∞ and B ˉ ( K ) ≠ 0 \bar{B}^{(K)}\ne0 B ˉ ( K ) = 0 , then D n ( θ ^ n ( K ) − θ 0 ) / ξ n → P Γ − 1 B ˉ ( K ) D_n(\hat{\theta}_n^{(K)}-\theta_0)/\xi_n\xrightarrow{\mathbb{P}}\Gamma^{-1}\bar{B}^{(K)} D n ( θ ^ n ( K ) − θ 0 ) / ξ n P Γ − 1 B ˉ ( K ) , so ∣ D n ( θ ^ n ( K ) − θ 0 ) ∣ → P ∞ \lvert D_n(\hat{\theta}_n^{(K)}-\theta_0)\rvert\xrightarrow{\mathbb{P}}\infty ∣ D n ( θ ^ n ( K ) − θ 0 )∣ P ∞ .
Part (a) is the efficient limit: the rates are optimal, the two blocks are asymptotically independent, and the covariance attains the efficiency bound (Corollary 1). Parts (b) and (c) show that, for the full parameter vector, the condition ξ n → 0 \xi_n\to0 ξ n → 0 , that is, n Δ n K + 1 → 0 n\Delta_n^{K+1}\to0 n Δ n K + 1 → 0 for K ≥ 1 K\ge1 K ≥ 1 , cannot be weakened whenever B ˉ ( K ) ≠ 0 \bar{B}^{(K)}\ne0 B ˉ ( K ) = 0 . In part (c), the expansion remains local, since ξ n / n Δ n = Δ n K / 2 → 0 \xi_n/\sqrt{n\Delta_n}=\Delta_n^{K/2}\to0 ξ n / n Δ n = Δ n K /2 → 0 for K ≥ 1 K\ge1 K ≥ 1 and ξ n / n = Δ n → 0 \xi_n/\sqrt{n}=\Delta_n\to0 ξ n / n = Δ n → 0 for K = 0 K=0 K = 0 . The bias constant is nonzero in all our examples: in closed form for K = 1 K=1 K = 1 and K = 2 K=2 K = 2 in the Ornstein–Uhlenbeck model below, and numerically for K = 3 K=3 K = 3 . Each additional order relaxes the condition by a factor Δ n \Delta_n Δ n . For K = 1 K=1 K = 1 , as for the Euler contrast (K = 0 K=0 K = 0 ), the condition is n Δ n 2 → 0 n\Delta_n^2\to0 n Δ n 2 → 0 .
Comparison with the scalar case. Corollary 3(a) agrees with the scalar theory of Chang and Chen [11 ] . Their expansion of order J J J in powers of Δ \Delta Δ corresponds to K = 2 J K=2J K = 2 J here, and for Δ n → 0 \Delta_n\to0 Δ n → 0 they show that the approximate MLE has the limit of the exact MLE when J ≥ 2 J\ge2 J ≥ 2 , n Δ n 2 J → ∞ n\Delta_n^{2J}\to\infty n Δ n 2 J → ∞ and n Δ n 2 J + 1 → 0 n\Delta_n^{2J+1}\to0 n Δ n 2 J + 1 → 0 . With K = 2 J K=2J K = 2 J , the last condition is exactly ξ n → 0 \xi_n\to0 ξ n → 0 . Because expansions in integer powers of Δ \Delta Δ correspond to even K K K only, their first omitted term is always odd in z z z , and their leading bias always falls on the drift. The alternation between the two blocks for odd K K K appears only because the delta expansion is graded in powers of Δ 1 / 2 \Delta^{1/2} Δ 1/2 . The present results remove the lower bound n Δ n 3 → ∞ n\Delta_n^3 \to\infty n Δ n 3 → ∞ , apply in any dimension, and, through parts (b) and (c) and the parity statement, describe what happens when the condition fails.
Which parameters are biased. The parity statement in Theorem 4 says on which parameters the leading bias falls. Let K ≥ 1 K \ge1 K ≥ 1 . When K K K is even, C K + 1 C_{K+1} C K + 1 is a combination of Hermite polynomials of odd degree. These are orthogonal to the diffusion score, which is quadratic in Z Z Z , so the leading bias affects only the drift. When K K K is odd, the roles are reversed, and the leading bias affects only the diffusion parameters. For the Euler contrast, K = 0 K = 0 K = 0 , the leading bias is that of K = 1 K = 1 K = 1 and falls on the diffusion parameters. For the block that is spared, the score bias is of smaller order (Remark 1). We expect that the weaker condition n Δ n K + 2 → 0 n\Delta_n^{K+2} \to0 n Δ n K + 2 → 0 then suffices for that block, but we do not prove this block-wise statement here.
An example. In the Ornstein–Uhlenbeck model d X t = − κ X t d t + diag ( s 1 , s 2 ) d W t dX_t = -\kappa X_t\,dt + \operatorname{diag}(s_1,s_2)\,dW_t d X t = − κ X t d t + diag ( s 1 , s 2 ) d W t of § 5 , C 1 = 0 C_1 = 0 C 1 = 0 and
C 2 = 1 2 [ z T ν − 1 E 1 ν − 1 z − tr ( ν − 1 E 1 ) ] , E 1 = − 1 2 ( κ ν + ν κ T ) . C_2 = \frac{1}{2}\left[z^{\mathsf T}\nu^{-1}E_1\nu^{-1}z-\operatorname{tr}(\nu^{-1}E_1)\right], \qquad E_1=-\frac{1}{2}(\kappa\nu+\nu\kappa^{\mathsf T}). C 2 = 2 1 [ z T ν − 1 E 1 ν − 1 z − tr ( ν − 1 E 1 ) ] , E 1 = − 2 1 ( κ ν + ν κ T ) .
This gives B ˉ s j ( 1 ) = − κ j j / s j ≠ 0 \bar{B}_{s_j}^{(1)}=-\kappa_{jj}/s_j \ne0 B ˉ s j ( 1 ) = − κ j j / s j = 0 , so that ( Γ − 1 B ˉ ( 1 ) ) s j Δ n = − 1 2 κ j j s j Δ n (\Gamma^{-1}\bar{B}^{(1)})_{s_j}\Delta_n=-\frac{1}{2}\kappa_{jj}s_j\Delta_n ( Γ − 1 B ˉ ( 1 ) ) s j Δ n = − 2 1 κ j j s j Δ n . This is the familiar downward bias of Euler volatility estimates, which understate s j s_j s j by a fraction of about 1 2 κ j j Δ n \frac{1}{2}\kappa_{jj}\Delta_n 2 1 κ j j Δ n .
Remark 1 (bias orders by block). The proof gives the order of the score bias in each block. Define γ \gamma γ by requiring that the bias contribution to the normalized score in that block is of order n Δ n γ \sqrt{n}\,\Delta_n^\gamma n Δ n γ . The orders are:
Table 8.
Bold entries are exact (given a nonzero bias constant); the others are upper bounds, up to factors that grow more slowly than any power of n n n (Lemma D.1).
One caution applies to the non-bold entries. The normalized Hessian has off-diagonal blocks of order ε \varepsilon ε , so the leading bias in one block also enters the estimate of the other block at order n Δ n ( K + 2 ) / 2 \sqrt{n}\Delta_n^{(K+2)/2} n Δ n ( K + 2 ) /2 . Heuristically, the table therefore also gives the orders of the estimator bias, but in the non-leading block the constant combines two effects; § 5 shows an instance.
The K = 0 K = 0 K = 0 column is the classical Euler case, with the familiar conditions n Δ n 3 → 0 n\Delta_n^3 \to0 n Δ n 3 → 0 for the drift and n Δ n 2 → 0 n\Delta_n^2 \to0 n Δ n 2 → 0 for the diffusion parameters (Appendix § 12 ). Relative to the Euler contrast, K = 2 K = 2 K = 2 improves only the diffusion parameters, and K = 3 K = 3 K = 3 is needed to improve the drift.
Remark 2 (polynomial decay of Δ n \Delta_n Δ n ). The condition Δ n ≤ C n − a \Delta_n \le Cn^{-a} Δ n ≤ C n − a plays two roles. First, with a linearly growing drift, it controls the largest state in the sample: max i ∣ X i ∣ \max_i |X_i| max i ∣ X i ∣ grows more slowly than any power of n n n , so ε max i ⟨ X i ⟩ r → 0 \varepsilon\max_i\langle X_i\rangle^r \to0 ε max i ⟨ X i ⟩ r → 0 . Second, in Theorem 1, it makes a fixed-order expansion accurate enough at the most extreme observation.
For the delta-expansion estimator the condition costs nothing in practice: efficiency requires n Δ n K + 1 → 0 n\Delta_n^{K+1} \to0 n Δ n K + 1 → 0 anyway, which implies polynomial decay. For the exact MLE it is a limitation of the method. If Δ n \Delta_n Δ n decays more slowly than every power of n n n , for instance Δ n = 1 / log n \Delta_n = 1/\log n Δ n = 1/ log n , no fixed order suffices. LAN holds without the condition under the (different) assumptions of Gobet [25 ] , and we conjecture that Theorem 1 holds without it under Assumptions H1–H4. In applications the condition is mild. Daily data, Δ n = 1 / 252 \Delta_n = 1/252 Δ n = 1/252 , with n n n between 10 3 10^3 1 0 3 and 10 5 10^5 1 0 5 correspond to Δ n = n − a \Delta_n = n^{-a} Δ n = n − a with a a a between 0.48 and 0.80.
Moment convergence
Convergence in law does not imply convergence of moments. Moments are needed, for instance, to justify bias and mean squared error approximations. Because Θ \Theta Θ is compact, ∣ D n ( θ ~ − θ 0 ) ∣ ≤ C n \lvert D_n(\tilde{\theta}-\theta_0)\rvert\le C\sqrt{n} ∣ D n ( θ ~ − θ 0 )∣ ≤ C n for every Θ \Theta Θ -valued θ ~ \tilde{\theta} θ ~ . Moment convergence therefore follows once large deviations from θ 0 \theta_0 θ 0 have probability that decays faster than any power of n n n , and Assumption H5 delivers this.
Theorem 5 (moment convergence). Suppose Assumptions H1–H5 hold and c n − a 1 ≤ Δ n ≤ C n − a c n^{-a_1} \le\Delta_n \le C n^{-a} c n − a 1 ≤ Δ n ≤ C n − a for some 0 < a ≤ a 1 < 1 0 < a \le a_1 < 1 0 < a ≤ a 1 < 1 . Let N ∼ N ( 0 , diag ( Γ α − 1 , Γ β − 1 ) ) N \sim N(0,\operatorname{diag}(\Gamma_\alpha^{-1},\Gamma_\beta^{-1})) N ∼ N ( 0 , diag ( Γ α − 1 , Γ β − 1 )) . Then, for every continuous f f f with ∣ f ( u ) ∣ ≤ C ( 1 + ∣ u ∣ p ) \lvert f(u)\rvert\le C(1+\lvert u\rvert^p) ∣ f ( u )∣ ≤ C ( 1 + ∣ u ∣ p ) for some p p p :
(a) E f ( D n ( θ ^ n − θ 0 ) ) → E f ( N ) \mathbb{E}f(D_n(\hat{\theta}_n-\theta_0)) \to\mathbb{E}f(N) E f ( D n ( θ ^ n − θ 0 )) → E f ( N ) , for an exact maximizer θ ^ n \hat{\theta}_n θ ^ n ;
(b) E f ( D n ( θ ^ n ( K ) − θ 0 ) ) → E f ( N ) \mathbb{E}f(D_n(\hat{\theta}_n^{(K)}-\theta_0)) \to\mathbb{E}f(N) E f ( D n ( θ ^ n ( K ) − θ 0 )) → E f ( N ) for every K ≥ 1 K \ge1 K ≥ 1 with n Δ n K + 1 → 0 n\Delta_n^{K+1} \to0 n Δ n K + 1 → 0 .
The lower bound on Δ n \Delta_n Δ n makes the time span n Δ n n\Delta_n n Δ n grow polynomially, so that the drift contrast concentrates with polynomial probability bounds. This is needed both for the delta-expansion estimator and for the consistency step of the exact MLE. The proof (Appendix § 14 ) repeats the arguments for Theorems 3–1, with every convergence in probability replaced by an L p L^p L p bound. It is simpler than the quasi-likelihood analysis of Yoshida [56 ] , because compactness of Θ \Theta Θ makes a large deviation inequality unnecessary.
Volatility of linear growth
Assumptions H1 and H2 require the volatility to be bounded. This excludes models in which volatility rises with the level of the process, such as d X t = − κ X t d t + s 1 + X t 2 d W t dX_t=-\kappa X_t\,dt+s\sqrt{1+X_t^2}\,dW_t d X t = − κ X t d t + s 1 + X t 2 d W t , a member of the Pearson family of Forman and Sørensen [20 ] whose stationary law is a scaled Student distribution. This subsection shows that all results extend to volatility that is proportional to the size of the state: it grows like 1 + ∣ x ∣ 1+\lvert x\rvert 1 + ∣ x ∣ in every direction and is bounded away from zero. The two classes are not nested, because the new assumption also asks the drift to vary on the scale of the state.
Assumption H6 (proportional volatility). Θ \Theta Θ and the parameterization are as in Assumption H1, μ \mu μ and σ \sigma σ are C ∞ C^\infty C ∞ in ( x , θ ) (x,\theta) ( x , θ ) , and for all multi-indices a a a (in x x x ) and b b b (in θ ) \theta) θ ) ,
∣ ∂ x a ∂ θ b μ ( x ; α ) ∣ + ∣ ∂ x a ∂ θ b σ ( x ; β ) ∣ ≤ C a , b ⟨ x ⟩ 1 − ∣ a ∣ . \lvert\partial_x^a\partial_\theta^b\mu(x;\alpha)\rvert+\lvert\partial_x^a\partial_\theta^b\sigma(x;\beta)\rvert\le C_{a,b}\langle x\rangle^{1-\lvert a\rvert}. ∣ ∂ x a ∂ θ b μ ( x ; α )∣ + ∣ ∂ x a ∂ θ b σ ( x ; β )∣ ≤ C a , b ⟨ x ⟩ 1 − ∣ a ∣ . Moreover, there are constants 0 < λ min ≤ λ max < ∞ 0<\lambda_{\min}\le\lambda_{\max}<\infty 0 < λ m i n ≤ λ m a x < ∞ with λ min ⟨ x ⟩ 2 I ≤ ν ( x ; β ) ≤ λ max ⟨ x ⟩ 2 I \lambda_{\min}\langle x\rangle^2 I\le\nu(x;\beta)\le\lambda_{\max}\langle x\rangle^2 I λ m i n ⟨ x ⟩ 2 I ≤ ν ( x ; β ) ≤ λ m a x ⟨ x ⟩ 2 I for all x x x and β \beta β , and we write Λ = λ max / λ min \Lambda=\lambda_{\max}/\lambda_{\min} Λ = λ m a x / λ m i n .
The derivative bounds say that μ \mu μ and σ \sigma σ vary on the scale ⟨ x ⟩ \langle x\rangle ⟨ x ⟩ , which is the scale of the volatility itself. With ⟨ x ⟩ = ( 1 + ∣ x ∣ 2 ) 1 / 2 \langle x\rangle=(1+\lvert x\rvert^2)^{1/2} ⟨ x ⟩ = ( 1 + ∣ x ∣ 2 ) 1/2 , the example σ ( x ) = s 1 + x 2 \sigma(x)=s\sqrt{1+x^2} σ ( x ) = s 1 + x 2 has ν = s 2 ⟨ x ⟩ 2 \nu=s^2\langle x\rangle^2 ν = s 2 ⟨ x ⟩ 2 , so Λ = 1 \Lambda=1 Λ = 1 . Linear drifts and σ ( x ; β ) = β 1 + ∣ x ∣ 2 Σ \sigma(x;\beta)=\beta\sqrt{1+\lvert x\rvert^2}\,\Sigma σ ( x ; β ) = β 1 + ∣ x ∣ 2 Σ , with Σ \Sigma Σ a fixed invertible matrix, satisfy them. So do σ ( x ; β ) = 1 + ∣ x ∣ 2 Σ ( x ; β ) \sigma(x;\beta)=\sqrt{1+|x|^2}\,\Sigma(x;\beta) σ ( x ; β ) = 1 + ∣ x ∣ 2 Σ ( x ; β ) , where Σ \Sigma Σ is smooth, bounded and uniformly elliptic with ∣ ∂ β a ∂ x b Σ ∣ ≤ C ⟨ x ⟩ − ∣ a ∣ |\partial_\beta^a\partial_x^b\Sigma|\le C\langle x\rangle^{-|a|} ∣ ∂ β a ∂ x b Σ∣ ≤ C ⟨ x ⟩ − ∣ a ∣ for all a a a and b b b . The assumption excludes volatility that vanishes somewhere, as in CIR and Heston models, and volatility that grows in some directions but not in others, such as diag ( 1 + x 1 2 , 1 + x 2 2 ) \operatorname{diag}(\sqrt{1+x_1^2},\sqrt{1+x_2^2}) diag ( 1 + x 1 2 , 1 + x 2 2 ) .
The key observation is that the model looks the same at every scale. Near a starting point x x x , the process moves on the scale ⟨ x ⟩ Δ \langle x\rangle\sqrt{\Delta} ⟨ x ⟩ Δ , and the rescaled process ( X t − x ) / ⟨ x ⟩ (X_t-x)/\langle x\rangle ( X t − x ) / ⟨ x ⟩ has bounded, uniformly elliptic coefficients near the origin, with constants that do not depend on x x x . The delta expansion is equivariant under this affine change of variables. Hence the expansion error, measured relative to the local Gaussian scale, is bounded uniformly in the starting point, and no polynomial weight is needed.
Proposition 2 (scale-invariant expansion error). Suppose Assumption H6 holds, and let μ 0 = μ 0 ( x ; θ ) \mu_0=\mu_0(x;\theta) μ 0 = μ 0 ( x ; θ ) be any centering with ∣ μ 0 ( x ; θ ) ∣ ≤ C ⟨ x ⟩ |\mu_0(x;\theta)|\le C\langle x\rangle ∣ μ 0 ( x ; θ ) ∣ ≤ C ⟨ x ⟩ . For every integer K ≥ 1 K\ge1 K ≥ 1 there is a constant C K C_K C K such that, for all Δ ∈ ( 0 , 1 ] \Delta\in(0,1] Δ ∈ ( 0 , 1 ] , θ ∈ Θ \theta\in\Theta θ ∈ Θ , x ∈ R m x\in\mathbb{R}^m x ∈ R m and x ′ x' x ′ with ∣ x ′ − x ∣ ≤ ⟨ x ⟩ / 8 |x'-x|\le\langle x\rangle/8 ∣ x ′ − x ∣ ≤ ⟨ x ⟩ /8 ,
∣ p ( K , Δ ) ( x ′ ∣ x ; θ ) − p Δ ( x ′ ∣ x ; θ ) ∣ ≤ C K ( ⟨ x ⟩ 2 Δ ) − m / 2 Δ ( K + 1 ) / 2 . \left|p^{(K,\Delta)}(x'|x;\theta)-p_\Delta(x'|x;\theta)\right|\le C_K\left(\langle x\rangle^2\Delta\right)^{-m/2}\Delta^{(K+1)/2}. p ( K , Δ ) ( x ′ ∣ x ; θ ) − p Δ ( x ′ ∣ x ; θ ) ≤ C K ( ⟨ x ⟩ 2 Δ ) − m /2 Δ ( K + 1 ) /2 .
The bound is local, but observed transitions satisfy ∣ X i − X i − 1 ∣ ≤ C ⟨ X i − 1 ⟩ Δ n log n |X_i-X_{i-1}|\le C\langle X_{i-1}\rangle\sqrt{\Delta_n\log n} ∣ X i − X i − 1 ∣ ≤ C ⟨ X i − 1 ⟩ Δ n log n with probability tending to one, so all of them fall in the region where it applies. The proof (Appendix § 15 ) rescales and localizes the process, applies Proposition 1 to a modified process with bounded coefficients, and bounds the effect of the localization with the parabolic Harnack inequality.
Table 1 illustrates the proposition for the scalar model above with κ = 1 \kappa=1 κ = 1 and s = 0.5 s=0.5 s = 0.5 . Its exact transition density is computed by solving the Kolmogorov forward equation for the Lamperti transform Y = asinh ( X ) / s Y=\operatorname{asinh}(X)/s Y = asinh ( X ) / s , which has unit volatility and the bounded drift − ( κ / s + s / 2 ) tanh ( s Y ) -(\kappa/s+s/2)\tanh(sY) − ( κ / s + s /2 ) tanh ( s Y ) . The maximal relative error of the delta expansion over ∣ x ′ − x − μ ( x ) Δ ∣ ≤ 3 σ ( x ) Δ |x'-x-\mu(x)\Delta|\le3\sigma(x)\sqrt{\Delta} ∣ x ′ − x − μ ( x ) Δ∣ ≤ 3 σ ( x ) Δ does not grow with the starting point. Between the two smallest values of Δ \Delta Δ , dividing Δ \Delta Δ by four divides the error by 4.3, 9.8 and 17.6 for K = 1 , 2 , 3 K=1,2,3 K = 1 , 2 , 3 , close to the factors 4, 8 and 16 implied by the rates Δ \Delta Δ , Δ 3 / 2 \Delta^{3/2} Δ 3/2 and Δ 2 \Delta^2 Δ 2 . At Δ = 0.01 \Delta=0.01 Δ = 0.01 the expansion is not yet in its asymptotic regime at three local standard deviations.
Table 1 : Maximal relative error of the delta expansion of order K K K over ∣ x ′ − x − μ ( x ) Δ ∣ ≤ 3 σ ( x ) Δ \lvert x' - x - \mu(x)\Delta\rvert\le3\sigma(x)\sqrt{\Delta} ∣ x ′ − x − μ ( x ) Δ ∣ ≤ 3 σ ( x ) Δ , for d X t = − X t d t + 0.5 1 + X t 2 d W t dX_t = -X_t\,dt + 0.5\sqrt{1 + X_t^2}\,dW_t d X t = − X t d t + 0.5 1 + X t 2 d W t started at x x x . The benchmark is a numerical solution of the forward equation; successive grid refinements change it by at most 10 − 5 10^{-5} 1 0 − 5 in relative terms, and entries below 10 − 5 10^{-5} 1 0 − 5 are not resolved. At Δ = 0.01 \Delta= 0.01 Δ = 0.01 the window has half-width 3 σ ( x ) Δ = 0.15 ⟨ x ⟩ 3\sigma(x)\sqrt{\Delta} = 0.15\langle x\rangle 3 σ ( x ) Δ = 0.15 ⟨ x ⟩ , so ∣ x ′ − x ∣ \lvert x' - x\rvert ∣ x ′ − x ∣ reaches about 0.16 ⟨ x ⟩ 0.16\langle x\rangle 0.16 ⟨ x ⟩ for x ≥ 10 x \ge10 x ≥ 10 , slightly beyond the region of Proposition 2, whose constant 1 8 \frac{1}{8} 8 1 is not sharp. At x = 0 x = 0 x = 0 the odd-order corrections vanish by symmetry, so K = 2 K = 2 K = 2 and K = 3 K = 3 K = 3 coincide.
Table 1. Maximal relative error of the delta expansion of order K K K over ∣ x ′ − x − μ ( x ) Δ ∣ ≤ 3 σ ( x ) Δ \lvert x' - x - \mu(x)\Delta\rvert\le3\sigma(x)\sqrt{\Delta} ∣ x ′ − x − μ ( x ) Δ ∣ ≤ 3 σ ( x ) Δ .
With Proposition 2 in place of Proposition 1, the rest of the theory carries over. Because every quantity is now naturally measured relative to ⟨ x ⟩ \langle x\rangle ⟨ x ⟩ , the polynomial weights disappear, and so does the need for moments of the stationary law. This matters here: in the scalar example, the stationary law has a Student-type tail and only finitely many moments.
Theorem 6 (proportional volatility). Suppose Assumptions H6, H3(i) and H4 hold, with an arbitrary initial law, n Δ n → ∞ n\Delta_n\to\infty n Δ n → ∞ , and Δ n ≤ C n − a \Delta_n\le Cn^{-a} Δ n ≤ C n − a for some a ∈ ( 0 , 1 ) a\in(0,1) a ∈ ( 0 , 1 ) . Then:
(a) Theorems 1, 3 and 4 , and Corollaries 1 and 3, hold as stated, with Λ \Lambda Λ from Assumption H6;
(b) Theorem 2(a) holds as stated, and Theorem 2(b) holds when conditions (i) and (ii) are replaced by
(i’) ∣ p ~ n ( x ′ ∣ x ; θ ) − p Δ ( x ′ ∣ x ; θ ) ∣ ≤ C ( ⟨ x ⟩ 2 Δ n ) − m / 2 Δ n γ , (ii’) ∣ log p ~ n ( x ′ ∣ x ; θ ) − log p Δ ( x ′ ∣ x ; θ ) ∣ ≤ C Δ n γ ( 1 + ∣ x ′ − x ∣ ϱ ⟨ x ⟩ − ϱ Δ n − ϱ / 2 ) , \begin{aligned}
\text{(i')} \quad|\tilde p_n(x'|x;\theta)-p_\Delta(x'|x;\theta)|&\le C(\langle x\rangle^2\Delta_n)^{-m/2}\Delta_n^\gamma,\\
\text{(ii')} \quad|\log\tilde p_n(x'|x;\theta)-\log p_\Delta(x'|x;\theta)|&\le C\Delta_n^\gamma(1+|x'-x|^\varrho\langle x\rangle^{-\varrho}\Delta_n^{-\varrho/2}),
\end{aligned} (i’) ∣ p ~ n ( x ′ ∣ x ; θ ) − p Δ ( x ′ ∣ x ; θ ) ∣ (ii’) ∣ log p ~ n ( x ′ ∣ x ; θ ) − log p Δ ( x ′ ∣ x ; θ ) ∣ ≤ C (⟨ x ⟩ 2 Δ n ) − m /2 Δ n γ , ≤ C Δ n γ ( 1 + ∣ x ′ − x ∣ ϱ ⟨ x ⟩ − ϱ Δ n − ϱ /2 ) , both required only for ∣ x ′ − x ∣ ≤ ⟨ x ⟩ / 8 |x'-x|\le\langle x\rangle/8 ∣ x ′ − x ∣ ≤ ⟨ x ⟩ /8 , with the same thresholds on γ \gamma γ ; Corollary 2(a) holds as stated;
(c) Theorem 5 holds, under its two-sided condition c n − a 1 ≤ Δ n ≤ C n − a cn^{-a_1}\le\Delta_n\le Cn^{-a} c n − a 1 ≤ Δ n ≤ C n − a , if in addition Assumption H5 holds for functions g g g with ∣ g ( x ) ∣ + ⟨ x ⟩ ∣ ∇ g ( x ) ∣ ≤ C |g(x)|+\langle x\rangle|\nabla g(x)|\le C ∣ g ( x ) ∣ + ⟨ x ⟩ ∣∇ g ( x ) ∣ ≤ C .
Corollary 2(b) is not claimed under Assumption H6. The moment condition in Assumption H3(ii) is not needed, because all functions that are averaged over the sample are bounded once increments are measured on the local scale. The information matrices in Assumption H4 are finite for the same reason: ν − 1 / 2 ∂ α μ \nu^{-1/2}\partial_\alpha\mu ν − 1/2 ∂ α μ and ν − 1 ∂ β j ν \nu^{-1}\partial_{\beta_j}\nu ν − 1 ∂ β j ν are bounded. The proof (Appendix § 15 ) goes through the appendices and lists the changes.
Monte Carlo evidence
The experiments address three questions. Are the limits in Theorems 4 and 1 accurate at realistic sample sizes? Does the bias of the delta-expansion estimator have the size and block structure that Theorem 4 predicts? And what happens when the sampling interval is not small relative to the time scale of the model?
Designs and implementation
Ornstein–Uhlenbeck designs. Designs 1–3 use the bivariate Ornstein–Uhlenbeck model
d X t = − κ X t d t + diag ( s 1 , s 2 ) d W t , κ = ( κ 11 0 κ 21 κ 22 ) , s 1 = s 2 = 1. dX_t = -\kappa X_t\,dt + \operatorname{diag}(s_1,s_2)\,dW_t,\qquad
\kappa=
\begin{pmatrix}
\kappa_{11} & 0 \\
\kappa_{21} & \kappa_{22}
\end{pmatrix},
\qquad s_1 = s_2 = 1. d X t = − κ X t d t + diag ( s 1 , s 2 ) d W t , κ = ( κ 11 κ 21 0 κ 22 ) , s 1 = s 2 = 1.
This is the bivariate OU specification of Yang et al. [54 ] , with diffusion parameters added. Its transition density is Gaussian and can be computed exactly by the matrix-exponential method of Van Loan [53 ] , so the exact MLE is available as a benchmark. Paths are simulated exactly from this Gaussian transition, starting from the stationary law, so the OU designs carry no discretization error. The model satisfies Assumptions H1–H4, since the symmetric part of κ \kappa κ is positive definite in all three designs. Because ν \nu ν is constant, C 1 ≡ 0 C_1 \equiv0 C 1 ≡ 0 , and K = 1 K = 1 K = 1 coincides with the Euler contrast. Closed forms for C 2 C_2 C 2 , C 3 C_3 C 3 and C 4 C_4 C 4 are given in Appendix H. The three designs differ as follows:
Design 1 uses the parameter values of Yang et al. [54 ] , κ = ( 5 , 1 , 10 ) \kappa= (5,1,10) κ = ( 5 , 1 , 10 ) , and Δ n = n − 0.6 \Delta_n = n^{-0.6} Δ n = n − 0.6 , so that n Δ n 2 → 0 n\Delta_n^2 \to0 n Δ n 2 → 0 .
Design 2 has slow mean reversion, κ = ( 0.5 , 0.1 , 1 ) \kappa= (0.5,0.1,1) κ = ( 0.5 , 0.1 , 1 ) , and Δ n = n − 0.4 \Delta_n = n^{-0.4} Δ n = n − 0.4 . Here n Δ n 2 → ∞ n\Delta_n^2 \to\infty n Δ n 2 → ∞ , which puts the Euler contrast outside its classical regime, while κ Δ n \kappa\Delta_n κ Δ n stays small.
Design 3 uses the values of Design 1 with Δ n = n − 0.4 \Delta_n = n^{-0.4} Δ n = n − 0.4 . Now κ 22 Δ n \kappa_{22}\Delta_n κ 22 Δ n falls only from 0.63 at n = 1000 n = 1000 n = 1000 to 0.21 at n = 16000 n = 16000 n = 16000 , so the sampling interval is not small relative to the fastest time scale of the model.
A nonlinear design. Design 4 uses a model with state-dependent volatility,
μ ( x ) = ( − α 1 tanh x 1 α 2 tanh x 1 − α 3 tanh x 2 ) , σ ( x ) = ( β 1 ( 1 + 0.3 tanh x 2 ) 0 0 β 2 ( 1 + 0.3 tanh x 1 ) ) , \mu(x) =
\begin{pmatrix}
-\alpha_1 \tanh x_1 \\
\alpha_2 \tanh x_1 - \alpha_3 \tanh x_2
\end{pmatrix},
\qquad
\sigma(x) =
\begin{pmatrix}
\beta_1(1 + 0.3 \tanh x_2) & 0 \\
0 & \beta_2(1 + 0.3 \tanh x_1)
\end{pmatrix}, μ ( x ) = ( − α 1 tanh x 1 α 2 tanh x 1 − α 3 tanh x 2 ) , σ ( x ) = ( β 1 ( 1 + 0.3 tanh x 2 ) 0 0 β 2 ( 1 + 0.3 tanh x 1 ) ) ,
with ( α 1 , α 2 , α 3 , β 1 , β 2 ) = ( 1 , 0.5 , 1.5 , 0.7 , 0.9 ) (\alpha_1,\alpha_2,\alpha_3,\beta_1,\beta_2) = (1,0.5,1.5,0.7,0.9) ( α 1 , α 2 , α 3 , β 1 , β 2 ) = ( 1 , 0.5 , 1.5 , 0.7 , 0.9 ) and Δ n = n − 0.4 \Delta_n = n^{-0.4} Δ n = n − 0.4 . The drift is bounded and mean-reverting, and the volatility is bounded and uniformly elliptic. Since ν \nu ν varies with the state, C 1 ≠ 0 C_1 \ne0 C 1 = 0 , and every part of Lemma A.1 is exercised. No closed-form density is available, so we compare the expansion orders K = 0 , 1 , 2 K = 0,1,2 K = 0 , 1 , 2 .
Paths are simulated by an Euler scheme with 40 sub-steps per observation interval, after a burn-in of 50 time units. The simulation error is of relative order Δ n / 40 \Delta_n/40 Δ n /40 . As an order-of-magnitude estimate, n Δ n / 40 ≈ 0.07 \sqrt{n}\Delta_n/40 \approx0.07 n Δ n /40 ≈ 0.07 standardized units for the diffusion parameters at n = 16000 n = 16000 n = 16000 . A direct check with 160 sub-steps, reported with the results, confirms that the effect is smaller still. The matrix Γ \Gamma Γ is computed from a separate Euler path of 4 × 10 5 4 \times10^5 4 × 1 0 5 observations with spacing 0.05 and 10 sub-steps, which spans 2 × 10 4 2 \times10^4 2 × 1 0 4 time units.
Implementation. The coefficients C k C_k C k are computed in closed form, using for Design 4 the tensor formulas of Appendix H. Every closed form was checked against a direct numerical implementation of the recursion of Yang et al. [54 ] at randomly drawn ( x , z , θ ) (x,z,\theta) ( x , z , θ ) , and the two agree to machine precision. All estimators maximize the truncated contrast (3) . We use L-BFGS-B, followed by a Nelder–Mead polishing step whenever L-BFGS-B does not report convergence.
To mimic practice, the optimizer does not start at the true value. For the OU designs it starts from the Euler estimate, which has a closed form by least squares. For Design 4 it starts from the Euler estimate, itself computed from a crude initial value ( α = ( 0.5 , 0 , 1 ) (\alpha= (0.5,0,1) ( α = ( 0.5 , 0 , 1 ) and β \beta β from realized variances). After polishing, every fit converged in all four designs. In Design 4, L-BFGS-B flagged two of the 900 fits, both for K ≥ 1 K \ge1 K ≥ 1 and none for the Euler estimator; polishing changed no entry of Table 6 at the reported precision. The optimizer is run without bounds, with the volatility parameters on the log scale, so the compactness of Θ \Theta Θ is not imposed in the simulations.
Table 6. Standardized errors: Monte Carlo mean (standard deviation); the target is 0 (1). Nonlinear model satisfying Assumptions H 1 H_1 H 1 –H 4 H_4 H 4 , 100 replications; the Monte Carlo standard error of a mean is about 0.10. The last column is as in Table 5 .
Reported statistics. We report the Monte Carlo mean and standard deviation of the standardized errors n Δ n ( α ^ j − α 0 j ) / sd j \sqrt{n\Delta_n}(\hat{\alpha}_j-\alpha_{0j})/\operatorname{sd}_j n Δ n ( α ^ j − α 0 j ) / sd j and n ( β ^ j − β 0 j ) / sd j \sqrt{n}(\hat{\beta}_j-\beta_{0j})/\operatorname{sd}_j n ( β ^ j − β 0 j ) / sd j , where sd j = [ ( Γ − 1 ) j j ] 1 / 2 \operatorname{sd}_j = [(\Gamma^{-1})_{jj}]^{1/2} sd j = [( Γ − 1 ) j j ] 1/2 with Γ \Gamma Γ evaluated at θ 0 \theta_0 θ 0 . In Designs 1–3 the parameters are the entries of κ \kappa κ and s s s . If the asymptotic theory is accurate, these statistics have mean 0 and standard deviation 1.
All estimators are computed on the same simulated paths. Their differences from the exact MLE therefore carry much less Monte Carlo noise than the errors themselves, and they isolate the effect of the approximation (Table 3 ). Table 7 reports the coverage of nominal 95% Wald intervals based on the plug-in estimate of Γ \Gamma Γ at θ ^ \hat{\theta} θ ^ , which is what a practitioner would compute. Seeds differ across designs.
Table 3: Paired differences from the exact MLE: Monte Carlo mean of (estimator minus exact MLE) in standardized units, with its Monte Carlo standard error in parentheses. Same replications as Table 2 .
Table 3. Paired differences from the exact MLE: Monte Carlo mean of (estimator minus exact MLE) in standardized units, with its Monte Carlo standard error in parentheses. Same replications as Table 2 .
Table 7. Coverage (%) of nominal 95% Wald intervals based on the plug-in estimate of Γ \Gamma Γ , at the smallest and largest sample sizes. With 200 (100) replications, the Monte Carlo standard error of a coverage near 95% is 1.5 (2.2) points.
The results are organized as follows. We first show that the exact MLE is close to its Gaussian limit, then use paired differences to measure the approximation bias of each estimator in each block, and compare it with the prediction of Theorem 4 . Designs 3 and 4 then probe a coarse sampling interval and state-dependent volatility.
Results
The exact MLE. In Designs 1 and 2, the exact MLE is close to its Gaussian limit, with coverage between 90% and 98% (Table 2 and Table 7 ). It has a small upward finite-span bias of 0.1–0.3 standard deviations in the mean-reversion parameters κ 11 \kappa_{11} κ 11 and κ 22 \kappa_{22} κ 22 . The paired differences in Table 3 separate this bias from the approximation error, and we focus on them below.
Table 2. Standardized errors: Monte Carlo mean (standard deviation); the target is 0 (1). Ornstein–Uhlenbeck model, 200 replications; the Monte Carlo standard error of a mean is about 0.07.
Designs 1 and 2: diffusion parameters. The Euler estimator of the diffusion parameters is badly biased. Relative to the exact MLE, its standardized bias for s 2 s_2 s 2 is between −2.7 and −3.4 in Design 1 and between −1.4 and −1.9 in Design 2 (Table 3 ). Its Wald intervals for s 2 s_2 s 2 cover the true value only 9–67% of the time.
The bias evolves as the theory predicts. Its order n Δ n \sqrt{n}\Delta_n n Δ n is proportional to n − 0.1 n^{-0.1} n − 0.1 in Design 1 and to n 0.1 n^{0.1} n 0.1 in Design 2, which implies factors of 0.87 and 1.15 per quadrupling of n n n . For s 2 s_2 s 2 , the observed factors are 0.89 and 0.88 in Design 1, and 1.13 and 1.15 in Design 2.
The K = 2 K = 2 K = 2 expansion removes the diffusion bias. Its paired differences from the exact MLE are at most 0.04, and its coverage is between 90% and 98%. The K = 3 K = 3 K = 3 estimator does almost as well once n ≥ 4000 n \ge4000 n ≥ 4000 , with differences of at most 0.16, but at n = 1000 n = 1000 n = 1000 in Design 1 its difference for s 2 s_2 s 2 is 0.43. At that sample size the higher-order estimators are also more variable: the standard deviation of the K = 3 K = 3 K = 3 estimate of κ 22 \kappa_{22} κ 22 is 1.59 in Design 1.
Why does K = 3 K = 3 K = 3 do worse than K = 2 K = 2 K = 2 here? For both orders, the score bias in the diffusion block is of order n Δ n 2 \sqrt{n}\Delta_n^2 n Δ n 2 and has the same constant. The difference comes, heuristically, from the cross-block effect noted in Remark 1. For K = 2 K = 2 K = 2 , the drift bias feeds into the diffusion estimates through the cross-block Hessian, at order n Δ n ( K + 2 ) / 2 = n Δ n 2 \sqrt{n}\Delta_n^{(K+2)/2} = \sqrt{n}\Delta_n^2 n Δ n ( K + 2 ) /2 = n Δ n 2 , the same order as the score bias, and largely offsets it. We quantify this by computing, by Gauss–Hermite quadrature under the exact transition, the expected score and the maximizer of the expected contrast. In Design 1 at n = 16000 n = 16000 n = 16000 , the score bias alone implies a standardized bias of 0.055 in s 2 s_2 s 2 for both orders, and the cross term contributes −0.041 for K = 2 K = 2 K = 2 and essentially zero for K = 3 K = 3 K = 3 . This matches the simulated values of 0.01 and 0.06.
Designs 1 and 2: drift parameters. The drift parameters show the block structure of Remark 1 even more clearly. Once n ≥ 4000 n \ge4000 n ≥ 4000 , the Euler and K = 2 K = 2 K = 2 estimators have nearly identical drift biases relative to the exact MLE: −0.41 and −0.39 for κ 22 \kappa_{22} κ 22 at n = 4000 n = 4000 n = 4000 in Design 1, and −0.24 for both at n = 16000 n = 16000 n = 16000 . This is what the theory predicts, since γ α = 3 / 2 \gamma_\alpha= 3/2 γ α = 3/2 for both orders.
The rate of decay also matches. For the Euler estimator in Design 1, the bias falls by a factor of
0.58 per quadrupling of n n n , against the predicted 4 − 0.4 = 0.57 4^{-0.4}=0.57 4 − 0.4 = 0.57 for an order of n Δ n 3 / 2 \sqrt{n}\Delta_n^{3/2} n Δ n 3/2 . In Design 2 it falls by factors of 0.79 and 0.87, against the predicted 4 − 0.1 = 0.87 4^{-0.1}=0.87 4 − 0.1 = 0.87 .
Going one order further removes the drift bias. The K = 3 K=3 K = 3 estimator, for which γ α = 5 / 2 \gamma_\alpha=5/2 γ α = 5/2 , has paired differences of at most 0.04 for n ≥ 4000 n\ge4000 n ≥ 4000 , and the K = 4 K=4 K = 4 estimator agrees with the exact MLE to within 0.01. The only sizeable departures from these patterns occur at n = 1000 n=1000 n = 1000 in Design 1, where κ 22 Δ n = 0.16 \kappa_{22}\Delta_n=0.16 κ 22 Δ n = 0.16 and higher-order terms are still visible.
In these two designs, the truncation in (3) is rarely active. Even at n = 1000 n=1000 n = 1000 , the average fraction of observations with ∣ R i ( θ ^ ) ∣ > 1 4 |R_i(\hat{\theta})|>\frac{1}{4} ∣ R i ( θ ^ ) ∣ > 4 1 , which we do not tabulate, is at most 3.9% in Design 1 and 0.4% in Design 2.
Predicted versus simulated bias. Theorem 4 predicts the size of the approximation bias, not only its order. In the OU designs, the constants B ˉ ( K ) \bar{B}^{(K)} B ˉ ( K ) can be computed by Gaussian quadrature. Table 4 compares the predicted bias ξ n ( Γ − 1 B ˉ ( K ) ) j / s d j \xi_n(\Gamma^{-1}\bar{B}^{(K)})_j/sd_j ξ n ( Γ − 1 B ˉ ( K ) ) j / s d j with the simulated paired differences, and the agreement is close. The table also reports the all-order bias at fixed Δ n \Delta_n Δ n , computed from the maximizer of the expected contrast under the exact transition, which includes every order of the expansion error but no finite-sample noise.
Table 4. Approximation bias in Designs 1 and 2, in standardized units. “pred” is the leading bias ξ n ( Γ − 1 B ˉ ( K ) ) j / s d j \xi_n(\Gamma^{-1}\bar{B}^{(K)})_j/\mathrm{sd}_j ξ n ( Γ − 1 B ˉ ( K ) ) j / sd j of Theorem 4 ; “all” is the all-order bias D n ( θ K ∗ − θ 0 ) / s d D_n(\theta_K^*-\theta_0)/\mathrm{sd} D n ( θ K ∗ − θ 0 ) / sd , where θ K ∗ \theta_K^* θ K ∗ maximizes the expected contrast under the exact transition; “MC” is the Monte Carlo mean of the paired difference between the estimator and the exact MLE. Only the block that carries the leading bias is shown. In these designs the Euler estimator coincides with K = 1 K = 1 K = 1 . Panel A: diffusion parameters. Panel B: drift parameters. K = 2 K = 2 K = 2 .
For the Euler estimator of the volatilities, the bias constant has the closed form B ˉ s j ( 1 ) = − κ j j / s j \bar{B}^{(1)}_{s_j}=-\kappa_{jj}/s_j B ˉ s j ( 1 ) = − κ j j / s j , so the predicted standardized bias is − n Δ n κ j j / 2 -\sqrt{n}\Delta_n\kappa_{jj}/\sqrt{2} − n Δ n κ j j / 2 . It is within 0.05 of the simulated value in every case except s 2 s_2 s 2 at n = 1000 n=1000 n = 1000 in Design 1, where it is within 0.15. For the drift bias of the K = 2 K=2 K = 2 estimator and the diffusion bias of the K = 3 K=3 K = 3 estimator, prediction and simulation differ by at most 0.02 in Design 2 and for n ≥ 4000 n\ge4000 n ≥ 4000 in Design 1. The exception is again n = 1000 n=1000 n = 1000 in Design 1, most of all for κ 22 \kappa_{22} κ 22 , where the leading term predicts − 0.71 -0.71 − 0.71 , the all-order bias is − 0.40 -0.40 − 0.40 and the simulation gives − 0.26 -0.26 − 0.26 . About two-thirds of this discrepancy is due to terms of higher order in Δ n \Delta_n Δ n , which are visible because κ 22 Δ n = 0.16 \kappa_{22}\Delta_n=0.16 κ 22 Δ n = 0.16 ; the rest is finite-sample variation over a time span of only n Δ n = 16 n\Delta_n=16 n Δ n = 16 .
Finally, the Euler drift bias in Table 3 agrees with the K = 2 K=2 K = 2 prediction, as the heuristic in Remark 1 suggests: for both orders, the leading drift bias is the projection of C 3 C_3 C 3 on the drift score.
Design 3: a coarse sampling interval. When the sampling interval is not small relative to 1 / κ 22 1/\kappa_{22} 1/ κ 22 , the picture changes (Table 5 ). The exact MLE is still well behaved. The Euler estimator, however, is badly biased in both blocks: its standardized biases are about − 4 -4 − 4 for κ 22 \kappa_{22} κ 22 and between − 11 -11 − 11 and − 17 -17 − 17 for s 2 s_2 s 2 , and its Wald intervals for κ 22 \kappa_{22} κ 22 , s 1 s_1 s 1 and s 2 s_2 s 2 never contain the truth.
Table 5. Standardized errors: Monte Carlo mean (standard deviation); the target is 0 (1). 200 replications. The last column is the average percentage of observations with ∣ R i ( θ ^ ) ∣ > 1 4 |R_i(\hat{\theta})| > \frac{1}{4} ∣ R i ( θ ^ ) ∣ > 4 1 .
The expansions are now used well beyond their range of validity. At n = 1000 n=1000 n = 1000 , between 57% and 76% of the observations have ∣ R i ( θ ^ ) ∣ > 1 4 |R_i(\hat{\theta})|>\frac{1}{4} ∣ R i ( θ ^ ) ∣ > 4 1 , and the floor 1 2 \frac{1}{2} 2 1 in (3) binds for 5–7% of them. Higher orders do not help, and they are also more variable, with standardized standard deviations of up to 1.94. For κ 22 \kappa_{22} κ 22 , the odd order K = 3 K=3 K = 3 overshoots, with standardized biases of +6.5 to +9.8, and K = 4 K=4 K = 4 overshoots less (+1.6 to +3.9). The K = 2 K=2 K = 2 estimator, whose drift bias has the same leading order as Euler’s, ends up the least biased (−1.6 to −0.15). As n n n grows and κ 22 Δ n \kappa_{22}\Delta_n κ 22 Δ n falls to 0.21, the fraction of large corrections drops to about 5%. The K = 2 K=2 K = 2 and K = 4 K=4 K = 4 estimators then recover the diffusion parameters, but the drift remains distorted for K = 3 K=3 K = 3 and K = 4 K=4 K = 4 , and even K = 2 K=2 K = 2 still has a bias of −0.78 for κ 11 \kappa_{11} κ 11 , with coverage of 84%.
This suggests a practical heuristic, which we have not calibrated beyond these designs. The fraction of observations with ∣ R i ( θ ^ ) ∣ > 1 4 |R_i(\hat{\theta})|>\frac{1}{4} ∣ R i ( θ ^ ) ∣ > 4 1 is a cheap diagnostic, available in any application. When it is large, as in Design 3 at n = 1000 n=1000 n = 1000 , the sampling interval is too coarse for the expansion, and
raising the order does not help. Fractions of a few percent, as in Design 1 at n = 1000 n = 1000 n = 1000 , were harmless in our experiments.
Design 4: state-dependent volatility. Table 6 shows the same pattern in a model with state-dependent volatility, where C 1 ≠ 0 C_1 \ne0 C 1 = 0 . The Euler estimator of the diffusion parameters is biased by −1.2 to −1.9 standardized units, and for β 2 \beta_2 β 2 the bias grows with n n n , as n Δ n ∝ n 0.1 \sqrt{n}\Delta_n \propto n^{0.1} n Δ n ∝ n 0.1 predicts. Its Wald intervals for β 2 \beta_2 β 2 cover the true value in only 47–64% of replications.
Adding the first correction (K = 1 K = 1 K = 1 ) changes essentially nothing. This is what Remark 1 predicts: γ β = 1 \gamma_\beta= 1 γ β = 1 for both K = 0 K = 0 K = 0 and K = 1 K = 1 K = 1 , because C 1 C_1 C 1 is orthogonal to the leading diffusion score. The second-order expansion removes the bias, with standardized means between −0.07 and 0.18, and restores the coverage of the diffusion parameters to 91–95%. All remaining deviations are within two Monte Carlo standard errors.
The drift estimates are essentially the same for all three orders, with small finite-span biases of at most 0.23. Without an exact benchmark, these cannot be separated from the expansion bias, which Remark 1 predicts to be of order n Δ n 3 / 2 \sqrt{n}\Delta_n^{3/2} n Δ n 3/2 , in standardized units, for all three orders. The correction terms remain small throughout: the average fraction of observations with ∣ R i ( θ ^ ) ∣ > 1 4 |R_i(\hat{\theta})| > \frac{1}{4} ∣ R i ( θ ^ ) ∣ > 4 1 is at most 1.5%.
Is the simulation scheme accurate enough for these conclusions? To check, we repeated the n = 16000 n = 16000 n = 16000 experiment with 100 new replications, simulating each path twice from the same Brownian increments: once with 160 Euler sub-steps per observation interval and once with the 40 sub-steps used above. The paired differences in standardized errors (40 minus 160 sub-steps) are 0.026 and 0.039 for β 1 \beta_1 β 1 and β 2 \beta_2 β 2 under the Euler contrast, 0.028 and 0.041 under K = 2 K = 2 K = 2 , and at most 0.004 for the drift parameters, with paired standard errors below 0.001. These are below the rough estimate of 0.07 given with the design and well below the Monte Carlo standard error of 0.10, so the simulation scheme does not affect the comparison between expansion orders.
Conclusion
This paper develops the asymptotic theory of the exact MLE for multivariate diffusions observed at high frequency over a long span. For ergodic diffusions with a drift that may grow linearly and a volatility that is bounded away from zero and either bounded or proportional to the size of the state, the exact MLE is consistent, asymptotically normal and efficient whenever Δ n \Delta_n Δ n decays polynomially, and, under an additional condition on ergodic averages and polynomial growth of n Δ n n\Delta_n n Δ n , its moments converge. This answers the question left open by Yang et al. [54 ] and Li [41 ] , and it justifies Wald inference based on the exact likelihood for this class of models. The proof compares the exact likelihood with an explicit expansion of high order, and the same comparison gives conditions, in terms of approximation error, under which an approximate likelihood inherits the properties of the exact MLE. Together with the equivalence theorem of Chen, Wan and Yang [13 ] , this covers the expansion of Li [41 ] . For the delta-expansion estimator of fixed order, an explicit bias term shows that the condition n Δ n K + 1 → 0 n\Delta_n^{K+1} \to0 n Δ n K + 1 → 0 for efficiency cannot be weakened when the bias constant is nonzero, and identifies the parameters that the leading bias affects. The Monte Carlo evidence agrees with these predictions in size as well as in order, and shows that a higher order does not help when the sampling interval is coarse relative to the time scale of the model.
For future research, the most important is to cover square-root and other degenerate models, such as CIR and Heston, whose volatility vanishes at the boundary. This requires heat kernel bounds for degenerate diffusions and control of the boundary behavior. Volatility that grows in some directions but not in others, as in componentwise models, or at an intermediate rate, would require an anisotropic or non-proportional version of the rescaling in § 4.6 . Further problems include:
drifts of superlinear growth, and time-inhomogeneous models, where no invariant law is available;
the exact MLE when Δ n \Delta_n Δ n decays more slowly than any power of n n n (Remark 2);
fixed-order theory for other expansions, such as the delta expansion with μ 0 = 0 \mu_0 = 0 μ 0 = 0 and log-density expansions, and a data-driven choice of K K K ;
richer settings with irregular sampling, microstructure noise, jumps or latent factors.
Acknowledgment
The author would like to thank Nian Yang for sharing the code used in Yang et al. [54 ] , which was very helpful for § 5 . Additionally, the author would like to thank all the co-authors of the paper Chau et al. [12 ] , especially Thai Nguyen (Laval University, Canada) for many fruitful discussions while working on the paper, which led to insights that were essential in completing this paper.
Statement on AI use
In § 5 , the author used the free version of Claude (Anthropic) to assist with code development in discussions guided by the author’s ideas. The author checked the code, the results and the text, and takes full responsibility for the accuracy and correctness of the mathematical arguments, the computational results and the content of the paper.
Preliminary lemmas
Throughout the appendices, C C C and r r r denote generic constants that may change from line to line and do not depend on n n n , i i i , x x x or θ \theta θ . Recall ⟨ x ⟩ = ( 1 + ∣ x ∣ 2 ) 1 / 2 \langle x\rangle=(1+|x|^2)^{1/2} ⟨ x ⟩ = ( 1 + ∣ x ∣ 2 ) 1/2 , which satisfies ⟨ x ′ ⟩ ≤ ⟨ x ⟩ + ∣ x ′ − x ∣ \langle x'\rangle\leq\langle x\rangle+|x'-x| ⟨ x ′ ⟩ ≤ ⟨ x ⟩ + ∣ x ′ − x ∣ and ∣ ∇ ⟨ x ⟩ ∣ ≤ 1 |\nabla\langle x\rangle|\leq1 ∣∇ ⟨ x ⟩ ∣ ≤ 1 . A “polynomial with weighted coefficients” is a polynomial in z z z whose coefficients c ( x ; θ ) c(x;\theta) c ( x ; θ ) satisfy ∑ j ≤ 3 ∣ ∂ θ j c ∣ + ∑ j ≤ 2 ∣ ∇ x ∂ θ j c ∣ ≤ C ⟨ x ⟩ r \sum_{j\leq3}|\partial_\theta^j c|+\sum_{j\leq2}|\nabla_x\partial_\theta^j c|\leq C\langle x\rangle^r ∑ j ≤ 3 ∣ ∂ θ j c ∣ + ∑ j ≤ 2 ∣ ∇ x ∂ θ j c ∣ ≤ C ⟨ x ⟩ r . The derivatives of order three in θ \theta θ and the mixed derivatives are used only in Appendices D and F; for the coefficients of the C k C_k C k they hold by the smoothness in Assumption H1. We write H + ( x , β ) H^+(x,\beta) H + ( x , β ) for the linear span of { H h ( ⋅ ; ν ( x ; β ) ) : ∣ h ∣ ≥ 1 } \{H_h(\cdot;\nu(x;\beta)):|h|\geq1\} { H h ( ⋅ ; ν ( x ; β )) : ∣ h ∣ ≥ 1 } . Each of its elements has mean zero under N ( 0 , ν ( x ; β ) ) N(0,\nu(x;\beta)) N ( 0 , ν ( x ; β )) . Let ζ i = ( X i − X i − 1 ) / ε \zeta_i=(X_i-X_{i-1})/\varepsilon ζ i = ( X i − X i − 1 ) / ε , so that z i ( α ) = ζ i − ε μ ( X i − 1 ; α ) z_i(\alpha)=\zeta_i-\varepsilon\mu(X_{i-1};\alpha) z i ( α ) = ζ i − ε μ ( X i − 1 ; α ) , and let
L ( ζ , x ; θ ) = log ( 1 + R ( ζ − ε μ ( x ; α ) ; x , θ ) ) \mathcal{L}(\zeta,x;\theta)=\log\left(1+R(\zeta-\varepsilon\mu(x;\alpha);x,\theta)\right) L ( ζ , x ; θ ) = log ( 1 + R ( ζ − ε μ ( x ; α ) ; x , θ ) )
on { ∣ R ∣ ≤ 1 4 } \{|R|\leq\frac14\} { ∣ R ∣ ≤ 4 1 } . Derivatives in θ \theta θ are taken with the data ( ζ , x ) (\zeta,x) ( ζ , x ) fixed. Compared with the case of bounded coefficients, the only change in this appendix is that every bound now carries a polynomial weight in the current state. Moment bounds make such weights harmless in averages, and Lemma A.2 shows that the largest state in the sample grows more slowly than any power of n n n .
The first lemma records the algebraic structure of the corrections C k C_k C k that the consistency and bias arguments rely on: their polynomial form, their zero mean under the local Gaussian law, and the order in ε \varepsilon ε at which the drift parameters enter.
Lemma A.1 (structure of the corrections). Under Assumptions H1–H2:
(a) Each C k ( ⋅ ; x , θ ) C_k(\cdot;x,\theta) C k ( ⋅ ; x , θ ) is a polynomial of degree at most 3 k 3k 3 k with weighted coefficients.
(b) C k ( ⋅ ; x , θ ) ∈ H + ( x , β ) C_k(\cdot;x,\theta)\in H^+(x,\beta) C k ( ⋅ ; x , θ ) ∈ H + ( x , β ) for every k k k . Consequently, ∫ p ( K , Δ ) ( x ′ ∣ x ; θ ) d x ′ = 1 \int p^{(K,\Delta)}(x'|x;\theta)\,dx'=1 ∫ p ( K , Δ ) ( x ′ ∣ x ; θ ) d x ′ = 1 for all x x x , θ \theta θ and Δ \Delta Δ .
(c) C 1 ( z ; x , θ ) C_1(z;x,\theta) C 1 ( z ; x , θ ) does not depend on α \alpha α .
(d) On { ∣ R ∣ ≤ 1 4 } \{|R|\leq\frac14\} { ∣ R ∣ ≤ 4 1 } , with z = ζ − ε μ ( x ; α ) z=\zeta-\varepsilon\mu(x;\alpha) z = ζ − ε μ ( x ; α ) , there are G ( 1 ) , G ( 2 ) ∈ H + ( x , β ) G^{(1)},G^{(2)}\in H^+(x,\beta) G ( 1 ) , G ( 2 ) ∈ H + ( x , β ) with weighted coefficients, and functions Q ( 1 ) ( z ; x , θ ) , Q ( 2 ) ( z ; x , θ ) Q^{(1)}(z;x,\theta),Q^{(2)}(z;x,\theta) Q ( 1 ) ( z ; x , θ ) , Q ( 2 ) ( z ; x , θ ) with ∣ Q ( j ) ∣ ≤ C ⟨ x ⟩ r ( 1 + ∣ z ∣ 6 K + 2 ) |Q^{(j)}|\leq C\langle x\rangle^r(1+|z|^{6K+2}) ∣ Q ( j ) ∣ ≤ C ⟨ x ⟩ r ( 1 + ∣ z ∣ 6 K + 2 ) , where C C C does not depend on ( x , θ ) (x,\theta) ( x , θ ) , such that
∂ α L = ε 2 G ( 1 ) ( z ; x , θ ) + ε 3 Q ( 1 ) ( z ; x , θ ) , ∂ α 2 L = ε 2 G ( 2 ) ( z ; x , θ ) + ε 3 Q ( 2 ) ( z ; x , θ ) . \partial_\alpha\mathcal{L}=\varepsilon^2G^{(1)}(z;x,\theta)+\varepsilon^3Q^{(1)}(z;x,\theta),\qquad
\partial_\alpha^2\mathcal{L}=\varepsilon^2G^{(2)}(z;x,\theta)+\varepsilon^3Q^{(2)}(z;x,\theta). ∂ α L = ε 2 G ( 1 ) ( z ; x , θ ) + ε 3 Q ( 1 ) ( z ; x , θ ) , ∂ α 2 L = ε 2 G ( 2 ) ( z ; x , θ ) + ε 3 Q ( 2 ) ( z ; x , θ ) . Moreover, ∣ ∂ α L ∣ ≤ C ε 2 ⟨ x ⟩ r ( 1 + ∣ z ∣ 3 K ) |\partial_\alpha\mathcal{L}|\leq C\varepsilon^2\langle x\rangle^r(1+|z|^{3K}) ∣ ∂ α L ∣ ≤ C ε 2 ⟨ x ⟩ r ( 1 + ∣ z ∣ 3 K ) , ∣ L ∣ + ∣ ∂ β L ∣ ≤ C ε ⟨ x ⟩ r ( 1 + ∣ z ∣ 3 K ) |\mathcal{L}|+|\partial_\beta\mathcal{L}|\leq C\varepsilon\langle x\rangle^r(1+|z|^{3K}) ∣ L ∣ + ∣ ∂ β L ∣ ≤ C ε ⟨ x ⟩ r ( 1 + ∣ z ∣ 3 K ) , ∣ ∂ β 2 L ∣ ≤ C ε ⟨ x ⟩ r ( 1 + ∣ z ∣ 6 K ) |\partial_\beta^2\mathcal{L}|\leq C\varepsilon\langle x\rangle^r(1+|z|^{6K}) ∣ ∂ β 2 L ∣ ≤ C ε ⟨ x ⟩ r ( 1 + ∣ z ∣ 6 K ) and ∣ ∂ α ∂ β L ∣ ≤ C ε 2 ⟨ x ⟩ r ( 1 + ∣ z ∣ 6 K + 2 ) |\partial_\alpha\partial_\beta\mathcal{L}|\leq C\varepsilon^2\langle x\rangle^r(1+|z|^{6K+2}) ∣ ∂ α ∂ β L ∣ ≤ C ε 2 ⟨ x ⟩ r ( 1 + ∣ z ∣ 6 K + 2 ) .
Parts (a) and (b) show that the corrections are O P ( ε ) O_{\mathrm{P}}(\varepsilon) O P ( ε ) at the scale 1 / n 1/n 1/ n . Part (d) gives the finer structure needed at the drift scale 1 / ( n Δ ) 1/(n\Delta) 1/ ( n Δ ) .
Proof. (a) In (2) , N ≤ 2 k N\leq2k N ≤ 2 k gives ∣ h ∣ = 2 N − k ≤ 3 k |h|=2N-k\leq3k ∣ h ∣ = 2 N − k ≤ 3 k . By Lemma B.1 (b) in Appendix § 10 , ∣ w N , h ( x ; θ ) ∣ ≤ C ⟨ x ⟩ N |w_{N,h}(x;\theta)|\leq C\langle x\rangle^N ∣ w N , h ( x ; θ ) ∣ ≤ C ⟨ x ⟩ N . The coefficients w N , h ( x ; θ ) w_{N,h}(x;\theta) w N , h ( x ; θ ) are polynomials in μ \mu μ , μ 0 \mu_0 μ 0 , ν \nu ν and their derivatives at x x x , so the same bound holds for their θ \theta θ -derivatives up to order three and for the mixed derivatives ∇ x ∂ θ j \nabla_x\partial_\theta^j ∇ x ∂ θ j , j ≤ 2 j\leq2 j ≤ 2 . Differentiating in α \alpha α produces mixed derivatives ∂ x a ∂ θ b μ \partial_x^a\partial_\theta^b\mu ∂ x a ∂ θ b μ with ∣ a ∣ ≥ 1 |a|\geq1 ∣ a ∣ ≥ 1 , which are bounded by Assumption H1, so no extra powers of ⟨ x ⟩ \langle x\rangle ⟨ x ⟩ arise beyond those already counted. The coefficients of H h ( ⋅ ; Σ ) H_h(\cdot;\Sigma) H h ( ⋅ ; Σ ) are polynomials in the entries of Σ − 1 \Sigma^{-1} Σ − 1 , which are bounded and smooth in β \beta β by Assumption H2.
(b) In (2) , N ≥ ⌈ ( k + 1 ) / 2 ⌉ N\geq\lceil(k+1)/2\rceil N ≥ ⌈( k + 1 ) /2 ⌉ , so ∣ h ∣ = 2 N − k ≥ 1 |h|=2N-k\geq1 ∣ h ∣ = 2 N − k ≥ 1 . The change of variables x ′ ↦ z x'\mapsto z x ′ ↦ z gives ∫ q H h d x ′ = ∫ ϕ ( z ; ν ) H h ( z ; ν ) d z = ( − 1 ) ∣ h ∣ ∫ ∂ h ϕ ( z ; ν ) d z = 0 \int q\,H_h\,dx'=\int\phi(z;\nu)H_h(z;\nu)\,dz=(-1)^{|h|}\int\partial^h\phi(z;\nu)\,dz=0 ∫ q H h d x ′ = ∫ ϕ ( z ; ν ) H h ( z ; ν ) d z = ( − 1 ) ∣ h ∣ ∫ ∂ h ϕ ( z ; ν ) d z = 0 . (c) For k = 1 k=1 k = 1 the pairs ( N , ∣ h ∣ ) (N, |h|) ( N , ∣ h ∣ ) in (2) are ( 1 , 1 ) (1,1) ( 1 , 1 ) and ( 2 , 3 ) (2,3) ( 2 , 3 ) . With μ 0 = μ ( x ; α ) \mu_0=\mu(x;\alpha) μ 0 = μ ( x ; α ) , the recursion (5) gives w 1 , e j ( y ) = μ j ( y ) − μ j ( x ) w_{1,e_j}(y)=\mu_j(y)-\mu_j(x) w 1 , e j ( y ) = μ j ( y ) − μ j ( x ) , which vanishes at y = x y=x y = x . For ∣ h ∣ = 3 |h|=3 ∣ h ∣ = 3 ,
w 2 , h ( y ) = A w 1 , h ( y ) + ∑ i A i w 1 , h − e i ( y ) + 1 2 ∑ i , j ( ν i j ( y ) − ν i j ( x ) ) w 1 , h − e i − e j ( y ) . w_{2,h}(y)=Aw_{1,h}(y)+\sum_i A_iw_{1,h-e_i}(y)+\frac{1}{2}\sum_{i,j}\left(\nu_{ij}(y)-\nu_{ij}(x)\right)w_{1,h-e_i-e_j}(y). w 2 , h ( y ) = A w 1 , h ( y ) + i ∑ A i w 1 , h − e i ( y ) + 2 1 i , j ∑ ( ν ij ( y ) − ν ij ( x ) ) w 1 , h − e i − e j ( y ) .
The first term is zero because ∣ h ∣ > 2 |h|>2 ∣ h ∣ > 2 , and the last vanishes at y = x y=x y = x . In the middle term, w 1 , h − e i w_{1,h-e_i} w 1 , h − e i has ∣ h − e i ∣ = 2 |h-e_i|=2 ∣ h − e i ∣ = 2 , so it is a difference ν k l ( y ) − ν k l ( x ) \nu_{kl}(y)-\nu_{kl}(x) ν k l ( y ) − ν k l ( x ) , with factor 1 2 \frac{1}{2} 2 1 if h − e i = 2 e k h-e_i=2e_k h − e i = 2 e k and factor 1 1 1 if h − e i = e k + e l h-e_i=e_k+e_l h − e i = e k + e l with k ≠ l k\ne l k = l , since both ordered pairs contribute. The operator A i f = ( μ i ( y ) − μ i ( x ) ) f + ∑ j ν i j ( y ) ∂ j f A_if=(\mu_i(y)-\mu_i(x))f+\sum_j\nu_{ij}(y)\partial_jf A i f = ( μ i ( y ) − μ i ( x )) f + ∑ j ν ij ( y ) ∂ j f maps it, at y = x y=x y = x , to ∑ j ν i j ( x ) ∂ j ν k l ( x ) \sum_j\nu_{ij}(x)\partial_j\nu_{kl}(x) ∑ j ν ij ( x ) ∂ j ν k l ( x ) , which depends on β \beta β only. In tensor notation, C 1 = 1 4 ∑ a , b , i , j ν a b ∂ a ν i j H b i j ( z ) C_1=\frac{1}{4}\sum_{a,b,i,j}\nu_{ab}\partial_a\nu_{ij}H_{bij}(z) C 1 = 4 1 ∑ a , b , i , j ν ab ∂ a ν ij H bij ( z ) , where H b i j = − ϕ − 1 ∂ b ∂ i ∂ j ϕ H_{bij}=-\phi^{-1}\partial_b\partial_i\partial_j\phi H bij = − ϕ − 1 ∂ b ∂ i ∂ j ϕ . In passing from the multi-index sum 1 2 ! ∑ ∣ h ∣ = 3 w 2 , h H h \frac{1}{2!}\sum_{|h|=3}w_{2,h}H_h 2 ! 1 ∑ ∣ h ∣ = 3 w 2 , h H h to the sum over ordered triples ( b , i , j ) (b,i,j) ( b , i , j ) , each multi-index h h h appears 3 ! / h ! 3!/h! 3 ! / h ! times; this multiplicity and the pair factors above combine to the constant 1 4 \frac{1}{4} 4 1 . We also checked the formula numerically against the recursion (§ 5 ).
(d) As a function of ( ζ , x , θ ) (\zeta,x,\theta) ( ζ , x , θ ) , the parameter α \alpha α enters R = ∑ k ε k C k ( ζ − ε μ ( x ; α ) ; x , θ ) R=\sum_k\varepsilon^kC_k(\zeta-\varepsilon\mu(x;\alpha);x,\theta) R = ∑ k ε k C k ( ζ − ε μ ( x ; α ) ; x , θ ) in two ways. It enters through the argument, with ∂ α z = − ε ∂ α μ \partial_\alpha z=-\varepsilon\partial_\alpha\mu ∂ α z = − ε ∂ α μ , and through the coefficients w N , h w_{N,h} w N , h . The Hermite polynomials depend on β \beta β only. By (c), ∂ α ( ε C 1 ) = − ε 2 ∇ z C 1 ∂ α μ \partial_\alpha(\varepsilon C_1)=-\varepsilon^2\nabla_zC_1\partial_\alpha\mu ∂ α ( ε C 1 ) = − ε 2 ∇ z C 1 ∂ α μ . The generating function ∑ h H h ( z ; Σ ) u h / h ! = exp ( u ⊤ Σ − 1 z − 1 2 u ⊤ Σ − 1 u ) \sum_hH_h(z;\Sigma)u^h/h!=\exp(u^\top\Sigma^{-1}z-\frac{1}{2}u^\top\Sigma^{-1}u) ∑ h H h ( z ; Σ ) u h / h ! = exp ( u ⊤ Σ − 1 z − 2 1 u ⊤ Σ − 1 u ) yields ∂ z j H h = ∑ k ( Σ − 1 ) j k h k H h − e k \partial_{z_j}H_h=\sum_k(\Sigma^{-1})_{jk}h_kH_{h-e_k} ∂ z j H h = ∑ k ( Σ − 1 ) j k h k H h − e k . Since C 1 C_1 C 1 involves only ∣ h ∣ = 3 |h|=3 ∣ h ∣ = 3 , we get ∇ z C 1 ∈ H + \nabla_zC_1\in H^+ ∇ z C 1 ∈ H + . The explicit α \alpha α -derivative of ε 2 C 2 \varepsilon^2C_2 ε 2 C 2 is ε 2 \varepsilon^2 ε 2 times Hermite polynomials with ∣ h ∣ ∈ { 2 , 4 } |h|\in\{2,4\} ∣ h ∣ ∈ { 2 , 4 } ; the term with ∣ h ∣ = 6 |h|=6 ∣ h ∣ = 6 is built from ν \nu ν alone (Appendix H) and does not depend on α \alpha α . The remaining contributions to ∂ α R \partial_\alpha R ∂ α R carry at least ε 3 \varepsilon^3 ε 3 ; these include the degree-one terms of C k C_k C k for odd k ≥ 3 k\ge3 k ≥ 3 . Writing ∂ α L = ∂ α R − R ∂ α R / ( 1 + R ) \partial_\alpha L=\partial_\alpha R-R\partial_\alpha R/(1+R) ∂ α L = ∂ α R − R ∂ α R / ( 1 + R ) gives the first display, with G ( 1 ) = ∂ α C 2 − ∇ z C 1 ∂ α μ G^{(1)}=\partial_\alpha C_2-\nabla_zC_1\partial_\alpha\mu G ( 1 ) = ∂ α C 2 − ∇ z C 1 ∂ α μ , where C 2 : = 0 C_2:=0 C 2 := 0 if K = 1 K=1 K = 1 . On { ∣ R ∣ ≤ 3 4 } \{|R|\le\frac{3}{4}\} { ∣ R ∣ ≤ 4 3 } we have ∣ 1 + R ∣ ≥ 3 4 |1+R|\ge\frac{3}{4} ∣1 + R ∣ ≥ 4 3 . This gives the direct bound of degree 3 K 3K 3 K for ∂ α L = ∂ α R / ( 1 + R ) \partial_\alpha L=\partial_\alpha R/(1+R) ∂ α L = ∂ α R / ( 1 + R ) , and the degree bound on Q ( 1 ) Q^{(1)} Q ( 1 ) accounts for the product R ∂ α R / ( 1 + R ) R\partial_\alpha R/(1+R) R ∂ α R / ( 1 + R ) ; similarly for ∂ α 2 L = [ ∂ α 2 R ( 1 + R ) − ∂ α R ∂ α R ⊤ ] / ( 1 + R ) 2 \partial_\alpha^2L=[\partial_\alpha^2R(1+R)-\partial_\alpha R\partial_\alpha R^\top]/(1+R)^2 ∂ α 2 L = [ ∂ α 2 R ( 1 + R ) − ∂ α R ∂ α R ⊤ ] / ( 1 + R ) 2 . Differentiating once more in α \alpha α preserves the structure. The explicit derivative of G ( 1 ) G^{(1)} G ( 1 ) stays in H + H^+ H + , the term − ε ∇ z G ( 1 ) ∂ α μ -\varepsilon\nabla_zG^{(1)}\partial_\alpha\mu − ε ∇ z G ( 1 ) ∂ α μ is absorbed into Q ( 2 ) Q^{(2)} Q ( 2 ) , and so are the derivatives of the ε 3 \varepsilon^3 ε 3 terms. The factors ∂ α μ \partial_\alpha\mu ∂ α μ grow at most linearly and are absorbed into the weights. The remaining bounds follow from (a), because every term of R R R carries at least one factor ε \varepsilon ε , and every α \alpha α -derivative of R R R carries at least ε 2 \varepsilon^2 ε 2 .
The next lemma controls the largest state and the largest standardized increment in the sample. It is used to show that the truncation in (3) is eventually inactive and, in Theorem 1, to bound the worst-case relative error of the expansion.
Lemma A.2 (maximal states and increments). Suppose Assumptions H 1 H1 H 1 –H 3 H3 H 3 hold, Δ n ≤ C n − a \Delta_n\le Cn^{-a} Δ n ≤ C n − a , and let δ > 0 \delta>0 δ > 0 .
(a) For every q ≥ 1 q\ge1 q ≥ 1 , P ( max 0 ≤ i ≤ n ∣ X i ∣ > n δ ) ≤ C q n 1 − q δ \mathbb{P}(\max_{0\le i\le n}|X_i|>n^\delta)\le C_qn^{1-q\delta} P ( max 0 ≤ i ≤ n ∣ X i ∣ > n δ ) ≤ C q n 1 − q δ .
(b) There is C C C such that, for u > 0 u>0 u > 0 and uniformly in i i i , on { ∣ X i − 1 ∣ ≤ n δ } \{|X_{i-1}|\le n^\delta\} { ∣ X i − 1 ∣ ≤ n δ } ,
P ( sup α ∈ Θ α ∣ z i ( α ) ∣ ≥ ( 1 + C Δ n ) u + C ε n δ ∣ F i − 1 ) ≤ 2 m exp ( − u 2 2 m λ max ) . \mathbb{P}\left(\sup_{\alpha\in\Theta_\alpha}|z_i(\alpha)|\ge(1+C\Delta_n)u+C\varepsilon n^\delta\mid\mathcal{F}_{i-1}\right)\le2m\exp\left(-\frac{u^2}{2m\lambda_{\max}}\right). P ( α ∈ Θ α sup ∣ z i ( α ) ∣ ≥ ( 1 + C Δ n ) u + C ε n δ ∣ F i − 1 ) ≤ 2 m exp ( − 2 m λ m a x u 2 ) . (c) P ( max 1 ≤ i ≤ n sup α ∣ z i ( α ) ∣ 2 < 2 ( 1 + δ ) m λ max log n ) → 1 \mathbb{P}(\max_{1\le i\le n}\sup_\alpha|z_i(\alpha)|^2<2(1+\delta)m\lambda_{\max}\log n)\to1 P ( max 1 ≤ i ≤ n sup α ∣ z i ( α ) ∣ 2 < 2 ( 1 + δ ) m λ m a x log n ) → 1 , and P ( max i sup α ∣ z i ( α ) ∣ 2 > c log n ) = O ( n 1 − c / ( 2 m λ max ) + δ ) + O ( n − L ) \mathbb{P}(\max_i\sup_\alpha|z_i(\alpha)|^2>c\log n)=O(n^{1-c/(2m\lambda_{\max})+\delta})+O(n^{-L}) P ( max i sup α ∣ z i ( α ) ∣ 2 > c log n ) = O ( n 1 − c / ( 2 m λ m a x ) + δ ) + O ( n − L ) for every c , L → ∞ c,L\to\infty c , L → ∞ .
(d) max i sup θ ∣ R i ( θ ) ∣ → P 0 \max_i\sup_\theta|R_i(\theta)|\xrightarrow{\mathbb{P}}0 max i sup θ ∣ R i ( θ ) ∣ P 0 ; in particular P ( Ω n ) → 1 \mathbb{P}(\Omega_n)\to1 P ( Ω n ) → 1 .
Proof. (a) follows from Markov’s inequality, a union bound and Assumption H3(ii). For (b), let x = X i − 1 x=X_{i-1} x = X i − 1 and M s = ∫ t i − 1 s σ ( X u ; β 0 ) d W u M_s=\int_{t_{i-1}}^s \sigma(X_u;\beta_0)\,dW_u M s = ∫ t i − 1 s σ ( X u ; β 0 ) d W u for s ∈ [ t i − 1 , t i ] s\in[t_{i-1},t_i] s ∈ [ t i − 1 , t i ] . Since ∣ μ ( X u ) ∣ ≤ ∣ μ ( x ) ∣ + L ∣ X u − x ∣ |\mu(X_u)|\leq|\mu(x)|+L|X_u-x| ∣ μ ( X u ) ∣ ≤ ∣ μ ( x ) ∣ + L ∣ X u − x ∣ with L L L the Lipschitz constant of μ \mu μ , Gronwall’s lemma gives sup s ∣ X s − x ∣ ≤ e L Δ ( Δ ∣ μ ( x ) ∣ + sup s ∣ M s ∣ ) \sup_s|X_s-x|\leq e^{L\Delta}(\Delta|\mu(x)|+\sup_s|M_s|) sup s ∣ X s − x ∣ ≤ e L Δ ( Δ∣ μ ( x ) ∣ + sup s ∣ M s ∣ ) . Hence
∣ ε z i − M t i ∣ = ∣ ∫ t i − 1 t i ( μ ( X u ) − μ ( x ) ) d u ∣ ≤ C Δ ( Δ ⟨ x ⟩ + sup s ∣ M s ∣ ) . \left|\varepsilon z_i-M_{t_i}\right|=\left|\int_{t_{i-1}}^{t_i}(\mu(X_u)-\mu(x))\,du\right|\leq C\Delta\left(\Delta\langle x\rangle+\sup_s|M_s|\right). ∣ ε z i − M t i ∣ = ∫ t i − 1 t i ( μ ( X u ) − μ ( x )) d u ≤ C Δ ( Δ ⟨ x ⟩ + s sup ∣ M s ∣ ) .
and sup α ∣ z i ( α ) − z i ∣ ≤ ε sup α ∣ μ ( x ; α ) − μ ( x ; α 0 ) ∣ ≤ C ε ⟨ x ⟩ \sup_\alpha|z_i(\alpha)-z_i|\leq\varepsilon\sup_\alpha|\mu(x;\alpha)-\mu(x;\alpha_0)|\leq C\varepsilon\langle x\rangle sup α ∣ z i ( α ) − z i ∣ ≤ ε sup α ∣ μ ( x ; α ) − μ ( x ; α 0 ) ∣ ≤ C ε ⟨ x ⟩ . Each coordinate M j M^j M j is a continuous martingale with quadratic variation at most λ max Δ \lambda_{\max}\Delta λ m a x Δ , so the exponential inequality for continuous martingales with bounded quadratic variation ([48 Ch. IV, Ex. 3.16] ) gives P ( sup s ∣ M s ∣ ≥ ε u ∣ F i − 1 ) ≤ 2 m exp ( − u 2 / ( 2 m λ max ) ) \mathbb{P}(\sup_s|M_s|\geq\varepsilon u\mid\mathcal{F}_{i-1})\leq2m\exp(-u^2/(2m\lambda_{\max})) P ( sup s ∣ M s ∣ ≥ ε u ∣ F i − 1 ) ≤ 2 m exp ( − u 2 / ( 2 m λ m a x )) . This proves (b). For (c), take δ ′ < min ( δ , a ) / 4 \delta'<\min(\delta,a)/4 δ ′ < min ( δ , a ) /4 and u 2 = 2 ( 1 + δ / 2 ) m λ max log n u^2=2(1+\delta/2)m\lambda_{\max}\log n u 2 = 2 ( 1 + δ /2 ) m λ m a x log n in (b). A union bound over i i i , together with (a) for δ ′ \delta' δ ′ , bounds the failure probability by 2 m n − δ / 2 + o ( 1 ) 2mn^{-\delta/2}+o(1) 2 m n − δ /2 + o ( 1 ) , because ε n δ ′ → 0 \varepsilon n^{\delta'}\to0 ε n δ ′ → 0 and ( 1 + C Δ ) u ≤ 2 ( 1 + δ ) m λ max log n (1+C\Delta)u\leq\sqrt{2(1+\delta)m\lambda_{\max}\log n} ( 1 + C Δ ) u ≤ 2 ( 1 + δ ) m λ m a x log n for large n n n . The second claim follows in the same way, the term O ( n − L ) O(n^{-L}) O ( n − L ) coming from part (a) with q q q large. For (d), Lemma A.1 (a) gives ∣ R i ∣ ≤ ∑ k C ε k ⟨ X i − 1 ⟩ r ( 1 + ∣ z i ( α ) ∣ 3 k ) |R_i|\leq\sum_k C\varepsilon^k\langle X_{i-1}\rangle^r(1+|z_i(\alpha)|^{3k}) ∣ R i ∣ ≤ ∑ k C ε k ⟨ X i − 1 ⟩ r ( 1 + ∣ z i ( α ) ∣ 3 k ) , which is at most C ∑ k ( ε n δ ′ ( log n ) 3 / 2 ) k → 0 C\sum_k(\varepsilon n^{\delta'}(\log n)^{3/2})^k\to0 C ∑ k ( ε n δ ′ ( log n ) 3/2 ) k → 0 on the events of (a) and (c). □
The bound in (c) is of the right order: for Gaussian increments, the maximum of n n n squared standardized values grows like 2 log n 2\log n 2 log n times the largest variance. The factor m m m comes from a crude union bound over coordinates. It enters the exponent of n n n , and hence the thresholds ( 1 + m Λ ) / a (1+m\Lambda)/a ( 1 + m Λ ) / a in Theorems 1(a) and 2(b). A sharper chi-square-type bound would remove it, but the thresholds are not meant to be sharp, and we keep the simpler argument.
Over one step, the standardized increment is Gaussian up to an error of order ε \varepsilon ε in every L p L^p L p norm. The following lemma makes this precise and replaces exact Gaussian computations throughout.
Lemma A.3 (one-step conditional moments). Under θ 0 \theta_0 θ 0 and Assumptions H1–H2, let x = X i − 1 x=X_{i-1} x = X i − 1 , z i = z i ( α 0 ) z_i=z_i(\alpha_0) z i = z i ( α 0 ) and υ i = ( W t i − W t i − 1 ) / ε \upsilon_i=(W_{t_i}-W_{t_{i-1}})/\varepsilon υ i = ( W t i − W t i − 1 ) / ε . Then:
(a) z i = σ ( x ; β 0 ) υ i + ρ i z_i=\sigma(x;\beta_0)\upsilon_i+\rho_i z i = σ ( x ; β 0 ) υ i + ρ i with E [ ∣ ρ i ∣ p ∣ F i − 1 ] ≤ C p Δ p / 2 ⟨ x ⟩ p \mathbb{E}[|\rho_i|^p\mid\mathcal{F}_{i-1}]\leq C_p\Delta^{p/2}\langle x\rangle^p E [ ∣ ρ i ∣ p ∣ F i − 1 ] ≤ C p Δ p /2 ⟨ x ⟩ p for every p ≥ 1 p\geq1 p ≥ 1 ;
(b) ∣ E [ z i ∣ F i − 1 ] ∣ ≤ C Δ 3 / 2 ⟨ x ⟩ |\mathbb{E}[z_i\mid\mathcal{F}_{i-1}]|\leq C\Delta^{3/2}\langle x\rangle ∣ E [ z i ∣ F i − 1 ] ∣ ≤ C Δ 3/2 ⟨ x ⟩ ;
(c) if f f f satisfies ∣ f ( z ) − f ( z ′ ) ∣ ≤ c ( 1 + ∣ z ∣ r + ∣ z ′ ∣ r ) ∣ z − z ′ ∣ |f(z)-f(z')|\leq c(1+|z|^r+|z'|^r)|z-z'| ∣ f ( z ) − f ( z ′ ) ∣ ≤ c ( 1 + ∣ z ∣ r + ∣ z ′ ∣ r ) ∣ z − z ′ ∣ , then
∣ E [ f ( z i ) ∣ F i − 1 ] − ∫ f ( z ) ϕ ( z ; ν ( x ; β 0 ) ) d z ∣ ≤ C r c ε ⟨ x ⟩ r + 1 ; \left|\mathbb{E}[f(z_i)\mid\mathcal{F}_{i-1}]-\int f(z)\,\phi(z;\nu(x;\beta_0))\,dz\right|\leq C_rc\varepsilon\langle x\rangle^{r+1}; E [ f ( z i ) ∣ F i − 1 ] − ∫ f ( z ) ϕ ( z ; ν ( x ; β 0 )) d z ≤ C r c ε ⟨ x ⟩ r + 1 ; (d) sup α ∣ z i ( α ) − z i ∣ ≤ C ε ⟨ x ⟩ \sup_\alpha|z_i(\alpha)-z_i|\leq C\varepsilon\langle x\rangle sup α ∣ z i ( α ) − z i ∣ ≤ C ε ⟨ x ⟩ , and E [ sup α ∣ z i ( α ) ∣ p ∣ F i − 1 ] + E [ sup s ∈ [ t i − 1 , t i ] ⟨ X s ⟩ p ∣ F i − 1 ] ≤ C p ⟨ x ⟩ p \mathbb{E}[\sup_\alpha|z_i(\alpha)|^p\mid\mathcal{F}_{i-1}]+\mathbb{E}[\sup_{s\in[t_{i-1},t_i]}\langle X_s\rangle^p\mid\mathcal{F}_{i-1}]\leq C_p\langle x\rangle^p E [ sup α ∣ z i ( α ) ∣ p ∣ F i − 1 ] + E [ sup s ∈ [ t i − 1 , t i ] ⟨ X s ⟩ p ∣ F i − 1 ] ≤ C p ⟨ x ⟩ p .
Proof. By Gronwall’s lemma as in the proof of Lemma A.2 and the Burkholder–Davis–Gundy inequality, E [ sup s ∈ [ t i − 1 , t i ] ∣ X s − x ∣ p ∣ F i − 1 ] ≤ C p ( Δ p ⟨ x ⟩ p + Δ p / 2 ) ≤ C p Δ p / 2 ⟨ x ⟩ p \mathbb{E}[\sup_{s\in[t_{i-1},t_i]}|X_s-x|^p\mid\mathcal{F}_{i-1}]\leq C_p(\Delta^p\langle x\rangle^p+\Delta^{p/2})\leq C_p\Delta^{p/2}\langle x\rangle^p E [ sup s ∈ [ t i − 1 , t i ] ∣ X s − x ∣ p ∣ F i − 1 ] ≤ C p ( Δ p ⟨ x ⟩ p + Δ p /2 ) ≤ C p Δ p /2 ⟨ x ⟩ p . Decompose
z i = σ ( x ) υ i + ε − 1 ∫ ( μ ( X s ) − μ ( x ) ) d s + ε − 1 ∫ ( σ ( X s ) − σ ( x ) ) d W s . z_i=\sigma(x)\upsilon_i+\varepsilon^{-1}\int(\mu(X_s)-\mu(x))\,ds+\varepsilon^{-1}\int(\sigma(X_s)-\sigma(x))\,dW_s. z i = σ ( x ) υ i + ε − 1 ∫ ( μ ( X s ) − μ ( x )) d s + ε − 1 ∫ ( σ ( X s ) − σ ( x )) d W s .
The second term is at most ε − 1 Δ ∥ ∇ μ ∥ ∞ sup s ∣ X s − x ∣ \varepsilon^{-1}\Delta\|\nabla\mu\|_\infty\sup_s|X_s-x| ε − 1 Δ∥∇ μ ∥ ∞ sup s ∣ X s − x ∣ , which has conditional L p L^p L p norm O ( Δ ⟨ x ⟩ ) O(\Delta\langle x\rangle) O ( Δ ⟨ x ⟩) . By BDG, the third term has conditional L p L^p L p norm at most C ε − 1 ( Δ ⋅ Δ ⟨ x ⟩ 2 ) 1 / 2 = C ε ⟨ x ⟩ C\varepsilon^{-1}(\Delta\cdot\Delta\langle x\rangle^2)^{1/2}=C\varepsilon\langle x\rangle C ε − 1 ( Δ ⋅ Δ ⟨ x ⟩ 2 ) 1/2 = C ε ⟨ x ⟩ . This proves (a). For (b), E [ z i ∣ F i − 1 ] = ε − 1 ∫ E [ μ ( X s ) − μ ( x ) ∣ F i − 1 ] d s \mathbb{E}[z_i\mid\mathcal{F}_{i-1}]=\varepsilon^{-1}\int\mathbb{E}[\mu(X_s)-\mu(x)\mid\mathcal{F}_{i-1}]\,ds E [ z i ∣ F i − 1 ] = ε − 1 ∫ E [ μ ( X s ) − μ ( x ) ∣ F i − 1 ] d s . By Itô’s formula, the integrand equals ∫ t i − 1 s E [ A μ ( X u ) ∣ F i − 1 ] d u \int_{t_{i-1}}^s\mathbb{E}[\mathcal{A}\mu(X_u)\mid\mathcal{F}_{i-1}]\,du ∫ t i − 1 s E [ A μ ( X u ) ∣ F i − 1 ] d u , where A \mathcal{A} A is the generator. Since ∣ A μ ( y ) ∣ ≤ C ⟨ y ⟩ |\mathcal{A}\mu(y)|\leq C\langle y\rangle ∣ A μ ( y ) ∣ ≤ C ⟨ y ⟩ under Assumption H1, the integrand is at most C ⟨ x ⟩ ( s − t i − 1 ) C\langle x\rangle(s-t_{i-1}) C ⟨ x ⟩ ( s − t i − 1 ) . For (c), the condition on f f f , Hölder’s inequality and (a) bound ∣ E [ f ( z i ) − f ( σ ( x ) υ i ) ∣ F i − 1 ] ∣ \left|\mathbb{E}[f(z_i)-f(\sigma(x)\upsilon_i)\mid\mathcal{F}_{i-1}]\right| ∣ E [ f ( z i ) − f ( σ ( x ) υ i ) ∣ F i − 1 ] ∣ by C r C ε ⟨ x ⟩ r + 1 C r_C\varepsilon\langle x\rangle^{r+1} C r C ε ⟨ x ⟩ r + 1 , and σ ( x ) υ i ∼ N ( 0 , ν ( x ; β 0 ) ) \sigma(x)\upsilon_i\sim N(0,\nu(x;\beta_0)) σ ( x ) υ i ∼ N ( 0 , ν ( x ; β 0 )) given F i − 1 \mathcal{F}_{i-1} F i − 1 . Part (d) follows from the proof of Lemma A.2 and the moment bound above.
Part (b) is the reason why the drift contrast in the consistency proof has a negligible centering: the Euler mean is correct to order Δ 2 \Delta^2 Δ 2 , so the standardized increment has conditional mean O ( Δ 3 / 2 ) O(\Delta^{3/2}) O ( Δ 3/2 ) rather than O ( ε ) O(\varepsilon) O ( ε ) .
The next three lemmas turn averages over observations into integrals against π \pi π , uniformly in the parameter. Lemma A.4 is used for functions of the state, Lemma A.5 in Step 1 of the consistency proof and in the Hessian bounds, and Lemma A.6 at the drift scale.
Lemma A.4 (ergodic averages). Under Assumptions H1–H3, let g : R m → R g:\mathbb{R}^{m}\to\mathbb{R} g : R m → R be C 1 C^1 C 1 with ∣ g ( x ) ∣ + ∣ ∇ g ( x ) ∣ ≤ C ⟨ x ⟩ r |g(x)|+|\nabla g(x)|\le C\langle x\rangle^r ∣ g ( x ) ∣ + ∣∇ g ( x ) ∣ ≤ C ⟨ x ⟩ r . If Δ n → 0 \Delta_n\to0 Δ n → 0 and n Δ n → ∞ n\Delta_n\to\infty n Δ n → ∞ , then n − 1 ∑ i = 1 n g ( X i − 1 ) ⟶ P ∫ g d π n^{-1}\sum_{i=1}^{n}g(X_{i-1})\mathrel{\mathop{\longrightarrow}^{\mathbb{P}}}\int g\,d\pi n − 1 ∑ i = 1 n g ( X i − 1 ) ⟶ P ∫ g d π , for every initial law allowed by Assumption H3.
Proof. Let T n = n Δ n T_n=n\Delta_n T n = n Δ n . Then
1 n ∑ i g ( X i − 1 ) − 1 T n ∫ 0 T n g ( X s ) d s = 1 T n ∑ i ∫ t i − 1 t i ( g ( X i − 1 ) − g ( X s ) ) d s . \frac{1}{n}\sum_i g(X_{i-1})-\frac{1}{T_n}\int_0^{T_n}g(X_s)\,ds
=\frac{1}{T_n}\sum_i\int_{t_{i-1}}^{t_i}\bigl(g(X_{i-1})-g(X_s)\bigr)\,ds. n 1 i ∑ g ( X i − 1 ) − T n 1 ∫ 0 T n g ( X s ) d s = T n 1 i ∑ ∫ t i − 1 t i ( g ( X i − 1 ) − g ( X s ) ) d s .
By the mean-value theorem, Assumption H3(ii) and Lemma A.3(d), its L 1 L^1 L 1 norm is O ( ε ) O(\varepsilon) O ( ε ) . The continuous-time average converges almost surely by Assumption H3(i). Integrability of g g g under π \pi π follows from Assumption H3(ii) and Fatou’s lemma.
Lemma A.5 (uniform law of large numbers). Suppose Assumptions H1–H3 hold, Δ n → 0 \Delta_n\to0 Δ n → 0 and n Δ n → ∞ n\Delta_n\to\infty n Δ n → ∞ . Let ϑ \vartheta ϑ range over a compact set K ⊂ R q K\subset\mathbb{R}^q K ⊂ R q , and let f ( x , z ; ϑ ) f(x,z;\vartheta) f ( x , z ; ϑ ) be C 1 C^1 C 1 in ( x , ϑ ) (x,\vartheta) ( x , ϑ ) and satisfy, for some r r r ,
∣ f ∣ + ∣ ∂ ϑ f ∣ + ∣ ∇ x f ∣ ≤ C ⟨ x ⟩ r ( 1 + ∣ z ∣ r ) , ∣ f ( x , z ; ϑ ) − f ( x , z ′ ; ϑ ) ∣ ≤ C ⟨ x ⟩ r ( 1 + ∣ z ∣ r + ∣ z ′ ∣ r ) ∣ z − z ′ ∣ . |f|+|\partial_\vartheta f|+|\nabla_xf|\le C\langle x\rangle^r(1+|z|^r),\qquad|f(x,z;\vartheta)-f(x,z';\vartheta)|\le C\langle x\rangle^r(1+|z|^r+|z'|^r)|z-z'|. ∣ f ∣ + ∣ ∂ ϑ f ∣ + ∣ ∇ x f ∣ ≤ C ⟨ x ⟩ r ( 1 + ∣ z ∣ r ) , ∣ f ( x , z ; ϑ ) − f ( x , z ′ ; ϑ ) ∣ ≤ C ⟨ x ⟩ r ( 1 + ∣ z ∣ r + ∣ z ′ ∣ r ) ∣ z − z ′ ∣. With f ˉ ( x ; ϑ ) = ∫ f ( x , z ; ϑ ) ϕ ( z ; ν ( x ; β 0 ) ) d z \bar f(x;\vartheta)=\int f(x,z;\vartheta)\phi(z;\nu(x;\beta_0))\,dz f ˉ ( x ; ϑ ) = ∫ f ( x , z ; ϑ ) ϕ ( z ; ν ( x ; β 0 )) d z ,
sup ϑ ∈ K , α ′ ∈ Θ α ∣ 1 n ∑ i = 1 n f ( X i − 1 , z i ( α ′ ) ; ϑ ) − ∫ f ˉ ( x ; ϑ ) π ( d x ) ∣ ⟶ P 0. \sup_{\vartheta\in K,\ \alpha'\in\Theta_\alpha}\left|\frac{1}{n}\sum_{i=1}^{n}f(X_{i-1},z_i(\alpha');\vartheta)-\int\bar f(x;\vartheta)\,\pi(dx)\right|\mathrel{\mathop{\longrightarrow}^{\mathbb{P}}}0. ϑ ∈ K , α ′ ∈ Θ α sup n 1 i = 1 ∑ n f ( X i − 1 , z i ( α ′ ) ; ϑ ) − ∫ f ˉ ( x ; ϑ ) π ( d x ) ⟶ P 0.
Proof. By Lemma A.3(d) and the Lipschitz condition in z z z , replacing z i ( α ′ ) z_i(\alpha') z i ( α ′ ) by z i = z i ( α 0 ) z_i=z_i(\alpha_0) z i = z i ( α 0 ) changes the average by at most C ε n − 1 ∑ i ⟨ X i − 1 ⟩ r + 1 ( 1 + sup α ∣ z i ( α ) ∣ r ) = O P ( ε ) C\varepsilon n^{-1}\sum_i\langle X_{i-1}\rangle^{r+1}(1+\sup_\alpha|z_i(\alpha)|^r)=O_{\mathbb{P}}(\varepsilon) C ε n − 1 ∑ i ⟨ X i − 1 ⟩ r + 1 ( 1 + sup α ∣ z i ( α ) ∣ r ) = O P ( ε ) , uniformly. Fix ϑ \vartheta ϑ and write f i = f ( X i − 1 , z i ; ϑ ) f_i=f(X_{i-1},z_i;\vartheta) f i = f ( X i − 1 , z i ; ϑ ) . Lemma A.3(c) gives E [ f i ∣ F i − 1 ] = f ˉ ( X i − 1 ; ϑ ) + O ( ε ⟨ X i − 1 ⟩ 2 r + 1 ) \mathbb{E}[f_i\mid\mathcal{F}_{i-1}]=\bar f(X_{i-1};\vartheta)+O(\varepsilon\langle X_{i-1}\rangle^{2r+1}) E [ f i ∣ F i − 1 ] = f ˉ ( X i − 1 ; ϑ ) + O ( ε ⟨ X i − 1 ⟩ 2 r + 1 ) . The martingale n − 1 ∑ i ( f i − E [ f i ∣ F i − 1 ] ) n^{-1}\sum_i(f_i-\mathbb{E}[f_i\mid\mathcal{F}_{i-1}]) n − 1 ∑ i ( f i − E [ f i ∣ F i − 1 ]) has second moment at most C n − 1 Cn^{-1} C n − 1 by Assumption H3(ii). The function f ˉ ( ⋅ ; ϑ ) \bar f(\cdot;\vartheta) f ˉ ( ⋅ ; ϑ ) is C 1 C^1 C 1 with polynomially bounded gradient: differentiating under the integral, ∇ x f ˉ = ∫ ∇ x f ϕ ( z ; ν ) d z + ∫ f ∇ x ϕ ( z ; ν ( x ; β 0 ) ) d z \nabla_x\bar f=\int\nabla_xf\,\phi(z;\nu)\,dz+\int f\,\nabla_x\phi(z;\nu(x;\beta_0))\,dz ∇ x f ˉ = ∫ ∇ x f ϕ ( z ; ν ) d z + ∫ f ∇ x ϕ ( z ; ν ( x ; β 0 )) d z , where the first term is controlled by the bound on ∇ x f \nabla_xf ∇ x f and the second because ν ( ⋅ ; β 0 ) \nu(\cdot;\beta_0) ν ( ⋅ ; β 0 ) is smooth, bounded with bounded derivatives, and uniformly elliptic. When the lemma is applied to ∂ ϑ f ˉ \partial_\vartheta\bar f ∂ ϑ f ˉ as well, as in Appendix F, the same argument uses polynomial bounds on ∇ x ∂ ϑ f \nabla_x\partial_\vartheta f ∇ x ∂ ϑ f , which hold for all functions to which we apply it, since they are polynomials in z z z with smooth coefficients. Lemma A.4 then gives pointwise convergence. For uniformity, ∣ f i ( ϑ ) − f i ( ϑ ′ ) ∣ ≤ C ∣ ϑ − ϑ ′ ∣ ⟨ X i − 1 ⟩ r ( 1 + ∣ z i ∣ r ) |f_i(\vartheta)-f_i(\vartheta')|\le C|\vartheta-\vartheta'|\langle X_{i-1}\rangle^r(1+|z_i|^r) ∣ f i ( ϑ ) − f i ( ϑ ′ ) ∣ ≤ C ∣ ϑ − ϑ ′ ∣ ⟨ X i − 1 ⟩ r ( 1 + ∣ z i ∣ r ) , where n − 1 ∑ i ⟨ X i − 1 ⟩ r ( 1 + ∣ z i ∣ r ) = O P ( 1 ) n^{-1}\sum_i\langle X_{i-1}\rangle^r(1+|z_i|^r)=O_{\mathbb{P}}(1) n − 1 ∑ i ⟨ X i − 1 ⟩ r ( 1 + ∣ z i ∣ r ) = O P ( 1 ) , and the limit is Lipschitz in ϑ \vartheta ϑ . Convergence on a finite η \eta η -net of K K K therefore extends to all of K K K .
Lemma A.6 (uniform martingale bound). Let g ( x ; θ ) g(x;\theta) g ( x ; θ ) be R m \mathbb{R}^{m} R m -valued and C 1 C^{1} C 1 in θ \theta θ , with ∣ g ∣ + ∣ ∂ θ g ∣ ≤ C ⟨ x ⟩ r |g|+|\partial_{\theta}g|\le C\langle x\rangle^{r} ∣ g ∣ + ∣ ∂ θ g ∣ ≤ C ⟨ x ⟩ r , and let M n ( θ ) = ∑ i = 1 n g ( X i − 1 ; θ ) ⊤ ( z i − E [ z i ∣ F i − 1 ] ) M_{n}(\theta)=\sum_{i=1}^{n}g(X_{i-1};\theta)^{\top}(z_{i}-\mathbb{E}[z_{i}\mid\mathcal{F}_{i-1}]) M n ( θ ) = ∑ i = 1 n g ( X i − 1 ; θ ) ⊤ ( z i − E [ z i ∣ F i − 1 ]) with z i = z i ( α 0 ) z_{i}=z_{i}(\alpha_{0}) z i = z i ( α 0 ) . Under Assumptions H 1 H1 H 1 –H 3 H3 H 3 , E sup θ ∈ Θ ∣ M n ( θ ) ∣ p ≤ C p n p / 2 \mathbb{E}\sup_{\theta\in\Theta}|M_{n}(\theta)|^{p}\le C_{p}n^{p/2} E sup θ ∈ Θ ∣ M n ( θ ) ∣ p ≤ C p n p /2 for every p ≥ 1 p\ge1 p ≥ 1 . Consequently,
sup θ ∣ 1 n ε ∑ i = 1 n g ( X i − 1 ; θ ) ⊤ z i ∣ = O P ( ( n Δ n ) − 1 / 2 ) + O P ( Δ n ) . \sup_{\theta}\left|\frac{1}{n\varepsilon}\sum_{i=1}^{n}g(X_{i-1};\theta)^{\top}z_{i}\right|=O_{\mathbb{P}}\left((n\Delta_{n})^{-1/2}\right)+O_{\mathbb{P}}(\Delta_{n}). θ sup n ε 1 i = 1 ∑ n g ( X i − 1 ; θ ) ⊤ z i = O P ( ( n Δ n ) − 1/2 ) + O P ( Δ n ) . Proof. Let p > p α + p β p>p_{\alpha}+p_{\beta} p > p α + p β . Burkholder’s inequality, Lemma A.3(a) and Assumption H 3 H3 H 3 (ii) give E ∣ M n ( θ ) ∣ p + E ∣ ∂ θ M n ( θ ) ∣ p ≤ C n p / 2 \mathbb{E}|M_{n}(\theta)|^{p}+\mathbb{E}|\partial_{\theta}M_{n}(\theta)|^{p}\le Cn^{p/2} E ∣ M n ( θ ) ∣ p + E ∣ ∂ θ M n ( θ ) ∣ p ≤ C n p /2 uniformly in θ \theta θ . Since Θ \Theta Θ is the closure of a bounded convex open set, the Sobolev embedding W 1 , p ↪ C 0 W^{1,p}\hookrightarrow C^{0} W 1 , p ↪ C 0 (Adams and Fournier, [1 ] ) gives E sup θ ∣ M n ∣ p ≤ C ∫ Θ ( E ∣ M n ∣ p + E ∣ ∂ θ M n ∣ p ) d θ ≤ C n p / 2 \mathbb{E}\sup_{\theta}|M_{n}|^{p}\le C\int_{\Theta}(\mathbb{E}|M_{n}|^{p}+\mathbb{E}|\partial_{\theta}M_{n}|^{p})\,d\theta\le Cn^{p/2} E sup θ ∣ M n ∣ p ≤ C ∫ Θ ( E ∣ M n ∣ p + E ∣ ∂ θ M n ∣ p ) d θ ≤ C n p /2 . Smaller p p p follow by Hölder’s inequality. The second statement then follows from Lemma A.3(b).
Lemmas A.4–A.6 are standard in the high-frequency literature (cf. Kessler, [37 ] ; Yoshida, [56 ] ). We include proofs because the uniformity over ( α , ϑ ) (\alpha,\vartheta) ( α , ϑ ) in Lemma A.5 is exactly what the treatment of the correction terms requires.
The last lemma of this appendix concerns the exact likelihood itself. It shows that the exact MLE is well defined, which the rest of the argument takes for granted.
Lemma A.7 (regularity of the exact density). Under Assumptions H 1 H1 H 1 –H 2 H2 H 2 , fix Δ ∈ ( 0 , 1 ] \Delta\in(0,1] Δ ∈ ( 0 , 1 ] and choose for each ( x , θ ) (x,\theta) ( x , θ ) the version of p Δ ( ⋅ ∣ x ; θ ) p_{\Delta}(\cdot\mid x;\theta) p Δ ( ⋅ ∣ x ; θ ) that is continuous in x ′ x' x ′ . Then p Δ ( x ′ ∣ x ; θ ) p_{\Delta}(x'\mid x;\theta) p Δ ( x ′ ∣ x ; θ ) is strictly positive and jointly continuous in ( x , x ′ , θ ) (x,x',\theta) ( x , x ′ , θ ) .
Proof. By the two-sided Gaussian bound and the forward gradient bound of Menozzi et al. [42 ] (see (8) in Appendix § 10 ), p Δ p_{\Delta} p Δ is strictly positive and bounded, and p Δ ( ⋅ ∣ x ; θ ) p_{\Delta}(\cdot\mid x;\theta) p Δ ( ⋅ ∣ x ; θ ) is Lipschitz with a constant that is uniform over ( x , θ ) (x,\theta) ( x , θ ) in compact sets. Let X x , θ X^{x,\theta} X x , θ denote the solution of (1) started at x x x under θ \theta θ . Since the coefficients are Lipschitz in x x x and smooth in θ \theta θ , with ∣ μ ( y ; θ ) − μ ( y ; θ ′ ) ∣ ≤ C ∣ θ − θ ′ ∣ ⟨ y ⟩ |\mu(y;\theta)-\mu(y;\theta')|\le C|\theta-\theta'|\langle y\rangle ∣ μ ( y ; θ ) − μ ( y ; θ ′ ) ∣ ≤ C ∣ θ − θ ′ ∣ ⟨ y ⟩ , the standard L 2 L^{2} L 2 stability estimate gives E ∣ X Δ x , θ − X Δ x ′ , θ ′ ∣ 2 → 0 \mathbb{E}|X_{\Delta}^{x,\theta}-X_{\Delta}^{x',\theta'}|^{2}\to0 E ∣ X Δ x , θ − X Δ x ′ , θ ′ ∣ 2 → 0 as ( x ′ , θ ′ ) → ( x , θ ) (x',\theta')\to(x,\theta) ( x ′ , θ ′ ) → ( x , θ ) . Hence the law of X Δ x , θ X_{\Delta}^{x,\theta} X Δ x , θ is weakly continuous in ( x , θ ) (x,\theta) ( x , θ ) . For a smooth mollifier g η g_{\eta} g η with support in a ball of radius η \eta η , the map ( x , x ′ , θ ) ↦ ∫ g η ( x ′ − y ) p Δ ( y ∣ x ; θ ) d y (x,x',\theta)\mapsto\int g_{\eta}(x'-y)p_{\Delta}(y\mid x;\theta)\,dy ( x , x ′ , θ ) ↦ ∫ g η ( x ′ − y ) p Δ ( y ∣ x ; θ ) d y is therefore continuous, and by the uniform Lipschitz bound it differs from p Δ ( x ′ ∣ x ; θ ) p_{\Delta}(x'\mid x;\theta) p Δ ( x ′ ∣ x ; θ ) by at most C η C\eta C η , locally uniformly. A locally uniform limit of continuous functions is continuous.
Only continuity in θ \theta θ and strict positivity are used later: they make ℓ n \ell_{n} ℓ n finite and continuous on the compact set Θ \Theta Θ , so that a measurable maximizer exists.
Proof of Proposition 1
The proof follows the strategy of Yang et al. [54 ] : write the error of an Itô–Taylor kernel as a time integral by Dynkin’s formula, then show that the integrand vanishes near the starting point to an order that compensates for the singularity of the Hermite kernels. It differs from theirs in three respects. Dynkin’s formula is applied only to explicit functions, so no regularity of p p p in the backward variables is needed. The Gaussian bounds are centered at the deterministic flow of the drift, which allows unbounded drift. And the bookkeeping of the vanishing orders is done uniformly on R m \mathbb{R}^{m} R m , which gives the polynomial weight and every order K ≥ 1 K\ge1 K ≥ 1 . Fix θ \theta θ , which we suppress, the starting point x x x , the endpoint x ′ x' x ′ , and Δ ∈ ( 0 , 1 ] \Delta\in(0,1] Δ ∈ ( 0 , 1 ] . Let μ 0 = μ 0 ( x ; θ ) \mu_0=\mu_0(x;\theta) μ 0 = μ 0 ( x ; θ ) be the centering and ν 0 = ν ( x ; β ) \nu_0=\nu(x;\beta) ν 0 = ν ( x ; β ) . All constants below depend only on the bounds in Assumptions H1–H2, on ∣ μ 0 ( x ; θ ) ∣ ≤ C ⟨ x ⟩ |\mu_0(x;\theta)|\le C\langle x\rangle ∣ μ 0 ( x ; θ ) ∣ ≤ C ⟨ x ⟩ , and on the orders involved.
The Itô–Taylor kernel. For τ > 0 \tau>0 τ > 0 and y ∈ R m y\in\mathbb{R}^m y ∈ R m let
F ( τ , y ) = τ − m / 2 ϕ ( ς ; ν 0 ) , ς = x ′ − y − μ 0 τ τ . F(\tau,y)=\tau^{-m/2}\phi(\varsigma;\nu_0),\qquad\varsigma=\frac{x'-y-\mu_0\tau}{\sqrt{\tau}}. F ( τ , y ) = τ − m /2 ϕ ( ς ; ν 0 ) , ς = τ x ′ − y − μ 0 τ .
This is the transition density from y y y to x ′ x' x ′ over time τ \tau τ of a Brownian motion with constant drift μ 0 \mu_0 μ 0 and covariance ν 0 \nu_0 ν 0 . Hence ( − ∂ τ + A 0 ) F = 0 (-\partial_\tau+A_0)F=0 ( − ∂ τ + A 0 ) F = 0 , where A 0 = μ 0 ⋅ ∇ + 1 2 ν 0 : ∇ 2 A_0=\mu_0\cdot\nabla+\frac{1}{2}\nu_0:\nabla^2 A 0 = μ 0 ⋅ ∇ + 2 1 ν 0 : ∇ 2 acts on y y y , and ∂ y h F = τ − ∣ h ∣ / 2 H h ( ς ; ν 0 ) F \partial_y^hF=\tau^{-|h|/2}H_h(\varsigma;\nu_0)F ∂ y h F = τ − ∣ h ∣/2 H h ( ς ; ν 0 ) F . Let A = μ ( y ) ⋅ ∇ + 1 2 ν ( y ) : ∇ 2 A=\mu(y)\cdot\nabla+\frac{1}{2}\nu(y):\nabla^2 A = μ ( y ) ⋅ ∇ + 2 1 ν ( y ) : ∇ 2 be the generator of (1) . Define functions w N , h ( y ) w_{N,h}(y) w N , h ( y ) , for N ≥ 0 N\geq0 N ≥ 0 and multi-indices h h h , by w 0 , 0 = 1 w_{0,0}=1 w 0 , 0 = 1 , w 0 , h = 0 w_{0,h}=0 w 0 , h = 0 for h ≠ 0 h\neq0 h = 0 , and
w N + 1 , h = A w N , h + ∑ i A i w N , h − e i + 1 2 ∑ i , j ( ν i j ( y ) − ν 0 , i j ) w N , h − e i − e j , (5) w_{N+1,h}=Aw_{N,h}+\sum_i A_iw_{N,h-e_i}+\frac{1}{2}\sum_{i,j}(\nu_{ij}(y)-\nu_{0,ij})w_{N,h-e_i-e_j}, \tag*{(5)} w N + 1 , h = A w N , h + i ∑ A i w N , h − e i + 2 1 i , j ∑ ( ν ij ( y ) − ν 0 , ij ) w N , h − e i − e j , (5)
A i f = ( μ i ( y ) − μ 0 , i ) f + ∑ j ν i j ( y ) ∂ j f . A_if=(\mu_i(y)-\mu_{0,i})f+\sum_j\nu_{ij}(y)\partial_jf. A i f = ( μ i ( y ) − μ 0 , i ) f + j ∑ ν ij ( y ) ∂ j f .
with w N , h = 0 w_{N,h}=0 w N , h = 0 when h h h has a negative entry. This is the recursion (18)–(20) of Yang et al. [54 ] for time-homogeneous coefficients. Let A N = ∑ h w N , h ∂ y h F A_N=\sum_h w_{N,h}\partial_y^hF A N = ∑ h w N , h ∂ y h F . Because A 0 A_0 A 0 has constant coefficients, ( − ∂ τ + A 0 ) ∂ y h F = 0 (-\partial_\tau+A_0)\partial_y^hF=0 ( − ∂ τ + A 0 ) ∂ y h F = 0 , and the product rule gives
( − ∂ τ + A ) ( w ∂ y h F ) = ( A w ) ∂ y h F + ∑ i ( ν ∇ w ) i ∂ y h + e i F + w [ ∑ i ( μ i − μ 0 , i ) ∂ y h + e i F + 1 2 ∑ i , j ( ν i j − ν 0 , i j ) ∂ y h + e i + e j F ] . (-\partial_\tau+A)(w\partial_y^hF)=(Aw)\partial_y^hF+\sum_i(\nu\nabla w)_i\partial_y^{h+e_i}F
+w\left[\sum_i(\mu_i-\mu_{0,i})\partial_y^{h+e_i}F+\frac{1}{2}\sum_{i,j}(\nu_{ij}-\nu_{0,ij})\partial_y^{h+e_i+e_j}F\right]. ( − ∂ τ + A ) ( w ∂ y h F ) = ( A w ) ∂ y h F + i ∑ ( ν ∇ w ) i ∂ y h + e i F + w [ i ∑ ( μ i − μ 0 , i ) ∂ y h + e i F + 2 1 i , j ∑ ( ν ij − ν 0 , ij ) ∂ y h + e i + e j F ] .
Summing over h h h and collecting terms shows that ( − ∂ τ + A ) A N = A N + 1 (-\partial_\tau+A)A_N=A_{N+1} ( − ∂ τ + A ) A N = A N + 1 . For J ≥ 1 J\geq1 J ≥ 1 let P J ( τ , y ) = ∑ N = 0 J τ N N ! A N ( τ , y ) P_J(\tau,y)=\sum_{N=0}^J\frac{\tau^N}{N!}A_N(\tau,y) P J ( τ , y ) = ∑ N = 0 J N ! τ N A N ( τ , y ) . The sum telescopes:
( − ∂ τ + A ) P J = ψ J : = τ J J ! A J + 1 . (6) (-\partial_\tau+A)P_J=\psi_J:=\frac{\tau^J}{J!}A_{J+1}. \tag*{(6)} ( − ∂ τ + A ) P J = ψ J := J ! τ J A J + 1 . (6)
The proof rests on two properties of the coefficient functions: they grow at most polynomially, and they vanish at the starting point to an order that increases with ∣ h ∣ |h| ∣ h ∣ . The next lemma makes both precise.
Lemma B.1 (coefficient functions). For all N N N and h h h :
(a) w N , h = 0 w_{N,h}=0 w N , h = 0 if ∣ h ∣ > 2 N |h|>2N ∣ h ∣ > 2 N , and w N , 0 = 0 w_{N,0}=0 w N , 0 = 0 if N ≥ 1 N\geq1 N ≥ 1 ;
(b) ∣ ∂ a w N , h ( y ) ∣ ≤ C N , a ( ⟨ x ⟩ + ∣ y − x ∣ ) N |\partial^a w_{N,h}(y)|\leq C_{N,a}(\langle x\rangle+|y-x|)^N ∣ ∂ a w N , h ( y ) ∣ ≤ C N , a (⟨ x ⟩ + ∣ y − x ∣ ) N for every multi-index a a a ;
(c) ∂ a w N , h ( x ) = 0 \partial^a w_{N,h}(x)=0 ∂ a w N , h ( x ) = 0 whenever ∣ a ∣ < 2 ∣ h ∣ − 3 N |a|<2|h|-3N ∣ a ∣ < 2∣ h ∣ − 3 N . Consequently, ∣ ∂ a w N , h ( y ) ∣ ≤ C ∣ y − x ∣ ( 2 ∣ h ∣ − 3 N − ∣ a ∣ ) + ( ⟨ x ⟩ + ∣ y − x ∣ ) N |\partial^a w_{N,h}(y)|\leq C|y-x|^{(2|h|-3N-|a|)_+}(\langle x\rangle+|y-x|)^N ∣ ∂ a w N , h ( y ) ∣ ≤ C ∣ y − x ∣ ( 2∣ h ∣ − 3 N − ∣ a ∣ ) + (⟨ x ⟩ + ∣ y − x ∣ ) N .
Proof. All three claims follow by induction on N N N from (5) . For (a), each step raises ∣ h ∣ |h| ∣ h ∣ by at most two, and A w N , 0 = 0 Aw_{N,0}=0 A w N , 0 = 0 when w N , 0 w_{N,0} w N , 0 is constant. For (b), note that ∣ μ ( y ) − μ 0 ∣ ≤ C ( ⟨ x ⟩ + ∣ y − x ∣ ) |\mu(y)-\mu_0|\leq C(\langle x\rangle+|y-x|) ∣ μ ( y ) − μ 0 ∣ ≤ C (⟨ x ⟩ + ∣ y − x ∣ ) , that μ \mu μ appears in (5) at most once per step, either through A i A_i A i or through A A A , and that all derivatives of μ \mu μ of order at least one, and ν \nu ν with all its derivatives, are bounded. For (c), write ord ( f ) \operatorname{ord}(f) ord ( f ) for the order to which f f f vanishes at x x x . Then ord ( f g ) ≥ ord ( f ) + ord ( g ) \operatorname{ord}(fg) \ge\operatorname{ord}(f) + \operatorname{ord}(g) ord ( f g ) ≥ ord ( f ) + ord ( g ) , ord ( ∂ j f ) ≥ ord ( f ) − 1 \operatorname{ord}(\partial_j f) \ge\operatorname{ord}(f) - 1 ord ( ∂ j f ) ≥ ord ( f ) − 1 , and ord ( ν i j − ν 0 , i j ) ≥ 1 \operatorname{ord}(\nu_{ij} - \nu_{0,ij}) \ge1 ord ( ν ij − ν 0 , ij ) ≥ 1 . If ord ( w N , h ) ≥ ( 2 ∣ h ∣ − 3 N ) + \operatorname{ord}(w_{N,h}) \ge(2|h| - 3N)_+ ord ( w N , h ) ≥ ( 2∣ h ∣ − 3 N ) + for all h h h , the three terms of (5) vanish to order at least ( 2 ∣ h ∣ − 3 N ) + − 2 (2|h| - 3N)_+ - 2 ( 2∣ h ∣ − 3 N ) + − 2 , ( 2 ∣ h ∣ − 2 − 3 N ) + − 1 (2|h| - 2 - 3N)_+ - 1 ( 2∣ h ∣ − 2 − 3 N ) + − 1 and 1 + ( 2 ∣ h ∣ − 4 − 3 N ) + 1 + (2|h| - 4 - 3N)_+ 1 + ( 2∣ h ∣ − 4 − 3 N ) + , respectively, and each of these is at least 2 ∣ h ∣ − 3 ( N + 1 ) 2|h| - 3(N + 1) 2∣ h ∣ − 3 ( N + 1 ) . The bound follows from Taylor’s theorem with integral remainder, applied to ∂ a w N , h \partial^a w_{N,h} ∂ a w N , h at x x x , together with (b).
Lemma B.1 holds for every constant centering μ 0 \mu_0 μ 0 , which is what makes Proposition 1 independent of the centering. Part (c) is Lemma A.2 of Yang et al. [54 ] ; the growth bound (b) replaces their use of compactness.
Step 1: the kernel at the starting point. At ( τ , y ) = ( Δ , x ) (\tau,y) = (\Delta,x) ( τ , y ) = ( Δ , x ) we have ς = z \varsigma= z ς = z and F = q F = q F = q , so P J ( Δ , x ) = q ∑ N = 0 J ∑ ∣ h ∣ 1 N ! Δ N − ∣ h ∣ / 2 w N , h ( x ) H h ( z ; ν 0 ) P_J(\Delta,x) = q \sum_{N=0}^{J} \sum_{|h|} \frac{1}{N!}\Delta^{N-|h|/2}w_{N,h}(x)H_h(z;\nu_0) P J ( Δ , x ) = q ∑ N = 0 J ∑ ∣ h ∣ N ! 1 Δ N − ∣ h ∣/2 w N , h ( x ) H h ( z ; ν 0 ) . By Lemma B.1(a,c), w N , h ( x ) ≠ 0 w_{N,h}(x) \ne0 w N , h ( x ) = 0 only if 1 ≤ ∣ h ∣ ≤ 2 N 1 \le|h| \le2N 1 ≤ ∣ h ∣ ≤ 2 N and 2 ∣ h ∣ ≤ 3 N 2|h| \le3N 2∣ h ∣ ≤ 3 N , that is, with k = 2 N − ∣ h ∣ k = 2N - |h| k = 2 N − ∣ h ∣ , only if ⌈ ( k + 1 ) / 2 ⌉ ≤ N ≤ 2 k \lceil(k + 1)/2 \rceil\le N \le2k ⌈( k + 1 ) /2 ⌉ ≤ N ≤ 2 k . Grouping terms by k k k shows that P J ( Δ , x ) = q ( 1 + ∑ k = 1 2 J − 1 Δ k / 2 C k [ J ] ) P_J(\Delta,x) = q(1 + \sum_{k=1}^{2J-1}\Delta^{k/2}C_k^{[J]}) P J ( Δ , x ) = q ( 1 + ∑ k = 1 2 J − 1 Δ k /2 C k [ J ] ) , where C k [ J ] C_k^{[J]} C k [ J ] collects the terms of C k C_k C k with N ≤ J N \le J N ≤ J . Take J = 2 K J = 2K J = 2 K . Then C k [ J ] = C k C_k^{[J]} = C_k C k [ J ] = C k for k ≤ K k \le K k ≤ K , and since ∣ w N , h ( x ) ∣ ≤ C ⟨ x ⟩ N |w_{N,h}(x)| \le C\langle x\rangle^N ∣ w N , h ( x ) ∣ ≤ C ⟨ x ⟩ N by Lemma B.1(b) and sup z φ ( z ; ν 0 ) ∣ H h ( z ; ν 0 ) ∣ ≤ C \sup_z \varphi(z;\nu_0)|H_h(z;\nu_0)| \le C sup z φ ( z ; ν 0 ) ∣ H h ( z ; ν 0 ) ∣ ≤ C ,
∣ P 2 K ( Δ , x ) − p ( K , Δ ) ( x ′ ∣ x ) ∣ ≤ C ⟨ x ⟩ 2 K Δ ( K + 1 − m ) / 2 . (7) |P_{2K}(\Delta,x) - p^{(K,\Delta)}(x'|x)| \le C\langle x\rangle^{2K}\Delta^{(K+1-m)/2}. \tag*{(7)} ∣ P 2 K ( Δ , x ) − p ( K , Δ ) ( x ′ ∣ x ) ∣ ≤ C ⟨ x ⟩ 2 K Δ ( K + 1 − m ) /2 . (7)
Step 2: heat kernel bounds. Let g λ ( t , v ) = t − m / 2 exp ( − λ ∣ v ∣ 2 / t ) g_\lambda(t,v) = t^{-m/2}\exp(-\lambda|v|^2/t) g λ ( t , v ) = t − m /2 exp ( − λ ∣ v ∣ 2 / t ) , and let χ s ( x ) \chi_s(x) χ s ( x ) be the solution of χ ˙ s = μ ( χ s ) \dot{\chi}_s = \mu(\chi_s) χ ˙ s = μ ( χ s ) , χ 0 = x \chi_0 = x χ 0 = x . By Gronwall’s lemma, ∣ χ s ( x ) − x ∣ ≤ C s ⟨ x ⟩ |\chi_s(x) - x| \le Cs\langle x\rangle ∣ χ s ( x ) − x ∣ ≤ C s ⟨ x ⟩ for s ≤ 1 s \le1 s ≤ 1 . Under Assumptions H1–H2, the drift is Lipschitz with linear growth and σ \sigma σ is bounded, uniformly elliptic and smooth with bounded derivatives. Theorem 1.2 of Menozzi et al. [42 ] , items (i) and (iv), with time horizon T = 1 T = 1 T = 1 , then provides λ > 0 \lambda> 0 λ > 0 and C C C , depending only on these bounds, such that for s ∈ ( 0 , 1 ] s \in(0,1] s ∈ ( 0 , 1 ] the transition density is differentiable in the forward variable and
C − 1 g 1 / λ ′ ( s , y − χ s ( x ) ) ≤ p s ( y ∣ x ) ≤ C g 2 λ ( s , y − χ s ( x ) ) , ∣ ∇ y p s ( y ∣ x ) ∣ ≤ C s − 1 / 2 g 2 λ ( s , y − χ s ( x ) ) . (8) C^{-1}g_{1/\lambda'}(s,y-\chi_s(x)) \le p_s(y|x) \le Cg_{2\lambda}(s,y-\chi_s(x)), \qquad|\nabla_y p_s(y|x)| \le Cs^{-1/2}g_{2\lambda}(s,y-\chi_s(x)). \tag*{(8)} C − 1 g 1/ λ ′ ( s , y − χ s ( x )) ≤ p s ( y ∣ x ) ≤ C g 2 λ ( s , y − χ s ( x )) , ∣ ∇ y p s ( y ∣ x ) ∣ ≤ C s − 1/2 g 2 λ ( s , y − χ s ( x )) . (8)
The first pair of bounds is their two-sided estimate (1.15), with λ ′ = λ 0 \lambda' = \lambda_0 λ ′ = λ 0 ; the second is their gradient estimate (1.19) in the forward variable. In what follows, α ′ \alpha' α ′ , β ′ \beta' β ′ and the flow θ ( 1 ) \theta^{(1)} θ ( 1 ) are in the notation of Menozzi et al. [42 ] and are unrelated to our parameters; we write M 0 M_0 M 0 , M 1 M_1 M 1 , M 2 M_2 M 2 for their constants κ 0 \kappa_0 κ 0 , κ 1 \kappa_1 κ 1 , κ 2 \kappa_2 κ 2 , to avoid a clash with the mean-reversion matrix κ \kappa κ of § 5 . Their standing hypotheses are ( H α ′ σ ) (\mathrm{H}_{\alpha'}^\sigma) ( H α ′ σ ) , namely M 2 − 1 ∣ ξ ∣ 2 ≤ ⟨ σ σ ⊤ ( x ) ξ , ξ ⟩ ≤ M 0 ∣ ξ ∣ 2 M_2^{-1}|\xi|^2 \le\langle\sigma\sigma^\top(x)\xi,\xi\rangle\le M_0|\xi|^2 M 2 − 1 ∣ ξ ∣ 2 ≤ ⟨ σ σ ⊤ ( x ) ξ , ξ ⟩ ≤ M 0 ∣ ξ ∣ 2 and ∣ σ ( x ) − σ ( y ) ∣ ≤ M 0 ∣ x − y ∣ α ′ |\sigma(x) - \sigma(y)| \le M_0|x-y|^{\alpha'} ∣ σ ( x ) − σ ( y ) ∣ ≤ M 0 ∣ x − y ∣ α ′ for some α ′ ∈ ( 0 , 1 ) \alpha' \in(0,1) α ′ ∈ ( 0 , 1 ) , and ( H β ′ b ) (\mathrm{H}_{\beta'}^b) ( H β ′ b ) , namely ∣ μ ( 0 ) ∣ ≤ M 1 |\mu(0)| \le M_1 ∣ μ ( 0 ) ∣ ≤ M 1 and ∣ μ ( x ) − μ ( y ) ∣ ≤ M 1 ( ∣ x − y ∣ β ′ ∨ ∣ x − y ∣ ) |\mu(x) - \mu(y)| \le M_1(|x-y|^{\beta'} \vee|x-y|) ∣ μ ( x ) − μ ( y ) ∣ ≤ M 1 ( ∣ x − y ∣ β ′ ∨ ∣ x − y ∣ ) . Item (iv) requires in addition β ′ ∈ ( 0 , 1 ] \beta' \in(0,1] β ′ ∈ ( 0 , 1 ] , ∥ ∇ σ ∥ ∞ ≤ M 2 \|\nabla\sigma\|_\infty\le M_2 ∥∇ σ ∥ ∞ ≤ M 2 and ∣ ∇ σ ( x ) − ∇ σ ( y ) ∣ ≤ M 2 ∣ x − y ∣ α ′ |\nabla\sigma(x) - \nabla\sigma(y)| \le M_2|x-y|^{\alpha'} ∣∇ σ ( x ) − ∇ σ ( y ) ∣ ≤ M 2 ∣ x − y ∣ α ′ . Under Assumptions H1–H2 all of these hold with β ′ = 1 \beta' = 1 β ′ = 1 , any α ′ ∈ ( 0 , 1 ) \alpha' \in(0,1) α ′ ∈ ( 0 , 1 ) and constants uniform in θ \theta θ : σ \sigma σ and ∇ σ \nabla\sigma ∇ σ are bounded with bounded derivatives, hence α ′ \alpha' α ′ -Hölder, and ∣ μ ( 0 ; α ) ∣ ≤ C |\mu(0;\alpha)| \le C ∣ μ ( 0 ; α ) ∣ ≤ C . Their bounds are centered at the flow θ s ( 1 ) ( x ) \theta^{(1)}_s(x) θ s ( 1 ) ( x ) of a mollified drift. Since β ′ = 1 > 0 \beta' = 1 > 0 β ′ = 1 > 0 , their Remark 1.3 allows this flow to be replaced by the exact flow χ s ( x ) \chi_s(x) χ s ( x ) , which only changes the constants. Their constants depend on ( T , α ′ , β ′ , M 0 , M 1 , m ) (T,\alpha',\beta',M_0,M_1,m) ( T , α ′ , β ′ , M 0 , M 1 , m ) and, for (iv), on M 2 M_2 M 2 . For coefficients that are bounded and smooth with bounded derivatives, as for the localized process of Appendix § 15 , Gaussian bounds for the first derivatives of the transition density in both variables also follow from the classical parametrix construction (Friedman, [21 ] ); the flow-centered estimates of Menozzi et al. [42 ] are what allow a drift of linear growth. In particular, p Δ ( ⋅ ∣ x ) p_\Delta(\cdot|x) p Δ ( ⋅ ∣ x ) is continuous. Decreasing λ \lambda λ if necessary, Assumption H2 also gives ∣ ∂ y h F ( τ , y ) ∣ ≤ C τ − ∣ h ∣ / 2 g 2 λ ( τ , x ′ − μ 0 τ − y ) |\partial_y^h F(\tau,y)| \le C\tau^{-|h|/2}g_{2\lambda}(\tau,x'-\mu_0\tau-y) ∣ ∂ y h F ( τ , y ) ∣ ≤ C τ − ∣ h ∣/2 g 2 λ ( τ , x ′ − μ 0 τ − y ) for ∣ h ∣ ≤ 2 J + 2 |h| \le2J+2 ∣ h ∣ ≤ 2 J + 2 . We use two elementary facts: for t ≤ 1 t \le1 t ≤ 1 and k , r ≥ 0 k,r \ge0 k , r ≥ 0 ,
∣ v ∣ k ( 1 + ∣ v ∣ ) r g 2 λ ( t , v ) ≤ C t k / 2 g λ ( t , v ) , ∫ g λ ( τ , a − y ) g λ ( s , y − b ) d y = ( π / λ ) m / 2 g λ ( τ + s , a − b ) . (9) |v|^k(1+|v|)^r g_{2\lambda}(t,v) \le C t^{k/2}g_{\lambda}(t,v), \qquad\int g_{\lambda}(\tau,a-y)g_{\lambda}(s,y-b)\,dy = (\pi/\lambda)^{m/2}g_{\lambda}(\tau+s,a-b). \tag*{(9)} ∣ v ∣ k ( 1 + ∣ v ∣ ) r g 2 λ ( t , v ) ≤ C t k /2 g λ ( t , v ) , ∫ g λ ( τ , a − y ) g λ ( s , y − b ) d y = ( π / λ ) m /2 g λ ( τ + s , a − b ) . (9)
The factor s ( k − ∣ a ∣ ) + / 2 s^{(k-|a|)_+/2} s ( k − ∣ a ∣ ) + /2 below arises as follows: by Lemma B.1(c), ∣ ∂ a w N , h ( y ) ∣ |\partial^a w_{N,h}(y)| ∣ ∂ a w N , h ( y ) ∣ carries a factor ∣ y − x ∣ ( k − ∣ a ∣ ) + |y-x|^{(k-|a|)_+} ∣ y − x ∣ ( k − ∣ a ∣ ) + , and ∣ y − x ∣ j ≤ C ( ∣ y − χ s ( x ) ∣ j + ( s ⟨ x ⟩ ) j ) |y-x|^j \le C(|y-\chi_s(x)|^j+(s\langle x\rangle)^j) ∣ y − x ∣ j ≤ C ( ∣ y − χ s ( x ) ∣ j + ( s ⟨ x ⟩ ) j ) ; the first part is absorbed into the Gaussian by (9) , at the cost of s j / 2 s^{j/2} s j /2 . Combining (8) and (9) with Lemma B.1(c), and using ∣ y − x ∣ ≤ ∣ y − χ s ( x ) ∣ + C s ⟨ x ⟩ |y-x| \le|y-\chi_s(x)|+Cs\langle x\rangle ∣ y − x ∣ ≤ ∣ y − χ s ( x ) ∣ + C s ⟨ x ⟩ and s j ≤ s j / 2 s^j \le s^{j/2} s j ≤ s j /2 for j ≥ 0 j \ge0 j ≥ 0 and s ≤ 1 s \le1 s ≤ 1 , we get for ∣ a ∣ ≤ 1 |a| \le1 ∣ a ∣ ≤ 1 , N = J + 1 N=J+1 N = J + 1 and k = ( 2 ∣ h ∣ − 3 N ) + k=(2|h|-3N)_+ k = ( 2∣ h ∣ − 3 N ) + ,
∣ ∂ a w N , h ( y ) ∣ p s ( y ∣ x ) ≤ C ⟨ x ⟩ r s ( k − ∣ a ∣ ) + / 2 g λ ( s , y − χ s ( x ) ) , |\partial^a w_{N,h}(y)|p_s(y|x) \le C\langle x\rangle^r s^{(k-|a|)_+/2}g_\lambda(s,y-\chi_s(x)), ∣ ∂ a w N , h ( y ) ∣ p s ( y ∣ x ) ≤ C ⟨ x ⟩ r s ( k − ∣ a ∣ ) + /2 g λ ( s , y − χ s ( x )) ,
∣ w N , h ( y ) ∣ ∣ ∇ y p s ( y ∣ x ) ∣ ≤ C ⟨ x ⟩ r s ( k − 1 ) / 2 g λ ( s , y − χ s ( x ) ) , (10) |w_{N,h}(y)||\nabla_y p_s(y|x)| \le C\langle x\rangle^r s^{(k-1)/2}g_\lambda(s,y-\chi_s(x)), \tag*{(10)} ∣ w N , h ( y ) ∣∣ ∇ y p s ( y ∣ x ) ∣ ≤ C ⟨ x ⟩ r s ( k − 1 ) /2 g λ ( s , y − χ s ( x )) , (10)
the second bound for k ≥ 1 k \ge1 k ≥ 1 .
Step 3: Duhamel representation. We claim that, for every x ′ x' x ′ ,
p Δ ( x ′ ∣ x ) − P J ( Δ , x ) = ∫ 0 Δ I ( s ) d s , I ( s ) = ∫ ψ J ( Δ − s , y ) p s ( y ∣ x ) d y , (11) p_\Delta(x'|x)-P_J(\Delta,x)=\int_0^\Delta I(s)\,ds,\qquad I(s)=\int\psi_J(\Delta-s,y)p_s(y|x)\,dy, \tag*{(11)} p Δ ( x ′ ∣ x ) − P J ( Δ , x ) = ∫ 0 Δ I ( s ) d s , I ( s ) = ∫ ψ J ( Δ − s , y ) p s ( y ∣ x ) d y , (11)
where, in the terms of ψ J \psi_J ψ J with ∣ h ∣ = 2 J + 2 |h|=2J+2 ∣ h ∣ = 2 J + 2 , the integral over y y y is understood after one integration by parts. Precisely, for such h h h we pick i i i with h i ≥ 1 h_i\ge1 h i ≥ 1 and use
∫ w J + 1 , h ( y ) ∂ y h F p s ( y ∣ x ) d y = − ∫ ∂ y h − e i F ∂ y i ( w J + 1 , h ( y ) p s ( y ∣ x ) ) d y . \int w_{J+1,h}(y)\partial_y^hF\,p_s(y|x)\,dy=-\int\partial_y^{h-e_i}F\,\partial_{y_i}\bigl(w_{J+1,h}(y)p_s(y|x)\bigr)\,dy. ∫ w J + 1 , h ( y ) ∂ y h F p s ( y ∣ x ) d y = − ∫ ∂ y h − e i F ∂ y i ( w J + 1 , h ( y ) p s ( y ∣ x ) ) d y .
which holds for s ∈ ( 0 , Δ ) s\in(0,\Delta) s ∈ ( 0 , Δ ) because F ( Δ − s , ⋅ ) F(\Delta-s,\cdot) F ( Δ − s , ⋅ ) and its derivatives decay like a Gaussian, while w J + 1 , h w_{J+1,h} w J + 1 , h grows polynomially and p s , ∇ p s p_s,\nabla p_s p s , ∇ p s are bounded by (8) . Step 4 shows that ∫ 0 Δ ∣ I ( s ) ∣ d s < ∞ \int_0^\Delta|I(s)|\,ds<\infty ∫ 0 Δ ∣ I ( s ) ∣ d s < ∞ , with this convention.
To prove (11) , fix η ∈ ( 0 , Δ ) \eta\in(0,\Delta) η ∈ ( 0 , Δ ) and apply Itô’s formula to P J ( Δ − s , X s ) P_J(\Delta-s,X_s) P J ( Δ − s , X s ) for s ∈ [ 0 , Δ − η ] s\in[0,\Delta-\eta] s ∈ [ 0 , Δ − η ] , with X 0 = x X_0=x X 0 = x . On this time interval P J P_J P J is smooth, and it has polynomially bounded derivatives, so the stochastic integral is a martingale. By (6) ,
∫ P J ( η , y ) p Δ − η ( y ∣ x ) d y − P J ( Δ , x ) = ∫ 0 Δ − η I ( s ) d s . (12) \int P_J(\eta,y)p_{\Delta-\eta}(y|x)\,dy-P_J(\Delta,x)=\int_0^{\Delta-\eta}I(s)\,ds. \tag*{(12)} ∫ P J ( η , y ) p Δ − η ( y ∣ x ) d y − P J ( Δ , x ) = ∫ 0 Δ − η I ( s ) d s . (12)
Multiply by g ∈ C c ∞ ( R m ) g\in C^\infty_c(\mathbb{R}^m) g ∈ C c ∞ ( R m ) , viewed as a function of x ′ x' x ′ , and integrate over x ′ x' x ′ . Since F F F depends on ( x ′ , y ) (x',y) ( x ′ , y ) through x ′ − y x'-y x ′ − y , ∂ y h F = ( − 1 ) ∣ h ∣ ∂ x ′ h F \partial_y^hF=(-1)^{|h|}\partial_{x'}^hF ∂ y h F = ( − 1 ) ∣ h ∣ ∂ x ′ h F , and integration by parts in x ′ x' x ′ gives
∫ g ( x ′ ) A N ( η , y ) d x ′ = ∑ h w N , h ( y ) ∫ ∂ h g ( x ′ ) F ( η , y ) d x ′ . \int g(x')A_N(\eta,y)\,dx'=\sum_h w_{N,h}(y)\int\partial^h g(x')F(\eta,y)\,dx'. ∫ g ( x ′ ) A N ( η , y ) d x ′ = h ∑ w N , h ( y ) ∫ ∂ h g ( x ′ ) F ( η , y ) d x ′ .
For N ≥ 1 N\ge1 N ≥ 1 this is bounded by C ( ⟨ x ⟩ + ∣ y − x ∣ ) N C(\langle x\rangle+|y-x|)^N C (⟨ x ⟩ + ∣ y − x ∣ ) N , so after multiplication by η N \eta^N η N and integration against p Δ − η ( y ∣ x ) d y p_{\Delta-\eta}(y|x)\,dy p Δ − η ( y ∣ x ) d y it tends to zero as η → 0 \eta\to0 η → 0 . For N = 0 N=0 N = 0 , ∫ g ( x ′ ) F ( η , y ) d x ′ = E g ( y + μ 0 η + η ν 0 1 / 2 Z ) \int g(x')F(\eta,y)\,dx'=\mathbb{E}g(y+\mu_0\eta+\sqrt{\eta}\nu_0^{1/2}Z) ∫ g ( x ′ ) F ( η , y ) d x ′ = E g ( y + μ 0 η + η ν 0 1/2 Z ) with Z ∼ N ( 0 , I ) Z\sim N(0,I) Z ∼ N ( 0 , I ) , which converges to g ( y ) g(y) g ( y ) uniformly in y y y . Hence the first term of (12) , integrated against g g g , tends to E g ( X Δ ) = ∫ g p Δ ( ⋅ ∣ x ) \mathbb{E}g(X_\Delta)=\int gp_\Delta(\cdot|x) E g ( X Δ ) = ∫ g p Δ ( ⋅ ∣ x ) . The right-hand side converges by Step 4 and dominated convergence. Therefore (11) holds after integration against every g g g . Both sides of (11) are continuous in x ′ x' x ′ : the left by Step 2, the right by the bounds of Step 4 and dominated convergence. So (11) holds for every x ′ x' x ′ .
Step 4: bounding the integral. Let τ = Δ − s \tau= \Delta- s τ = Δ − s . Consider first a term of ψ J \psi_J ψ J with ∣ h ∣ ≤ 2 J + 1 |h| \le2J+1 ∣ h ∣ ≤ 2 J + 1 , and let k = ( 2 ∣ h ∣ − 3 ( J + 1 ) ) + k = (2|h| - 3(J+1))_+ k = ( 2∣ h ∣ − 3 ( J + 1 ) ) + . By Step 2, (10) with a = 0 a=0 a = 0 , and the convolution identity in (9) ,
τ J J ! ∫ ∣ w J + 1 , h ( y ) ∣ ∣ ∂ y r F ( τ , y ) ∣ p s ( y ∣ x ) d y ≤ C ⟨ x ⟩ r τ J − ∣ h ∣ / 2 s k / 2 \frac{\tau^J}{J!}\int|w_{J+1,h}(y)| |\partial_y^r F(\tau,y)|p_s(y|x)\,dy \le C\langle x\rangle^r\tau^{J-|h|/2}s^{k/2} J ! τ J ∫ ∣ w J + 1 , h ( y ) ∣∣ ∂ y r F ( τ , y ) ∣ p s ( y ∣ x ) d y ≤ C ⟨ x ⟩ r τ J − ∣ h ∣/2 s k /2
× ∫ g λ ( τ , x ′ − μ 0 τ − y ) g λ ( s , y − χ s ( x ) ) d y ≤ C ⟨ x ⟩ r Δ − m / 2 τ J − ∣ h ∣ / 2 s k / 2 . \qquad{}\times\int g_\lambda(\tau,x'-\mu_0\tau-y)g_\lambda(s,y-\chi_s(x))\,dy
\le C\langle x\rangle^r\Delta^{-m/2}\tau^{J-|h|/2}s^{k/2}. × ∫ g λ ( τ , x ′ − μ 0 τ − y ) g λ ( s , y − χ s ( x )) d y ≤ C ⟨ x ⟩ r Δ − m /2 τ J − ∣ h ∣/2 s k /2 .
The last step uses the convolution identity with τ + s = Δ \tau+s=\Delta τ + s = Δ and g λ ( Δ , v ) ≤ Δ − m / 2 g_\lambda(\Delta,v)\le\Delta^{-m/2} g λ ( Δ , v ) ≤ Δ − m /2 . Since J − ∣ h ∣ / 2 ≥ − 1 2 J-|h|/2\ge-\frac{1}{2} J − ∣ h ∣/2 ≥ − 2 1 , integration over s ∈ ( 0 , Δ ) s\in(0,\Delta) s ∈ ( 0 , Δ ) gives a beta integral, and the term contributes at most C ⟨ x ⟩ r Δ − m / 2 Δ E h C\langle x\rangle^r\Delta^{-m/2}\Delta^{E_h} C ⟨ x ⟩ r Δ − m /2 Δ E h with E h = J + 1 − ∣ h ∣ / 2 + k / 2 E_h=J+1-|h|/2+k/2 E h = J + 1 − ∣ h ∣/2 + k /2 . For J = 2 K J=2K J = 2 K , if ∣ h ∣ ≤ 3 K + 1 |h|\le3K+1 ∣ h ∣ ≤ 3 K + 1 then E h ≥ 2 K + 1 − ( 3 K + 1 ) / 2 = ( K + 1 ) / 2 E_h\ge2K+1-(3K+1)/2=(K+1)/2 E h ≥ 2 K + 1 − ( 3 K + 1 ) /2 = ( K + 1 ) /2 , and if ∣ h ∣ ≥ 3 K + 2 |h|\ge3K+2 ∣ h ∣ ≥ 3 K + 2 then k = 2 ∣ h ∣ − 6 K − 3 k=2|h|-6K-3 k = 2∣ h ∣ − 6 K − 3 and E h = ∣ h ∣ / 2 − K − 1 2 ≥ ( K + 1 ) / 2 E_h=|h|/2-K-\frac{1}{2}\ge(K+1)/2 E h = ∣ h ∣/2 − K − 2 1 ≥ ( K + 1 ) /2 . For the terms with ∣ h ∣ = 2 J + 2 |h|=2J+2 ∣ h ∣ = 2 J + 2 , after the integration by parts of Step 3, both bounds in (10) , with ∣ a ∣ = 1 |a|=1 ∣ a ∣ = 1 and k = J + 1 k=J+1 k = J + 1 , give the integrand bound C ⟨ x ⟩ r Δ − m / 2 τ J − ( 2 J + 1 ) / 2 s J / 2 = C ⟨ x ⟩ r Δ − m / 2 τ − 1 / 2 s K C\langle x\rangle^r\Delta^{-m/2}\tau^{J-(2J+1)/2}s^{J/2}=C\langle x\rangle^r\Delta^{-m/2}\tau^{-1/2}s^K C ⟨ x ⟩ r Δ − m /2 τ J − ( 2 J + 1 ) /2 s J /2 = C ⟨ x ⟩ r Δ − m /2 τ − 1/2 s K . Integration over s s s gives Δ K + 1 / 2 ≤ Δ ( K + 1 ) / 2 \Delta^{K+1/2}\le\Delta^{(K+1)/2} Δ K + 1/2 ≤ Δ ( K + 1 ) /2 . Summing over the finitely many h h h ,
∣ p Δ ( x ′ ∣ x ) − P 2 K ( Δ , x ) ∣ ≤ C ⟨ x ⟩ r Δ ( K + 1 − m ) / 2 . \left|p_\Delta(x'|x)-P_{2K}(\Delta,x)\right|\le C\langle x\rangle^r\Delta^{(K+1-m)/2}. ∣ p Δ ( x ′ ∣ x ) − P 2 K ( Δ , x ) ∣ ≤ C ⟨ x ⟩ r Δ ( K + 1 − m ) /2 .
Together with (7) , this proves Proposition 1, with r K r_K r K the larger of the two exponents. □
The proof shows where each assumption enters. Uniform ellipticity and bounded, smooth volatility give the Gaussian bounds for the Hermite kernels and, through Menozzi et al. [42 ] , for p s p_s p s and its forward gradient. The Lipschitz drift with linear growth keeps those bounds centered at a flow that moves by O ( s ⟨ x ⟩ ) O(s\langle x\rangle) O ( s ⟨ x ⟩) , and it makes the coefficient functions grow polynomially. The vanishing orders of Lemma B.1(c) do the rest.
Proof of Theorem 3
The proof treats the two time scales separately. Step 1 identifies β \beta β from the contrast normalized by n n n , and Step 2 identifies α \alpha α from the contrast normalized by n Δ n n\Delta_n n Δ n , using the consistency of β ^ n \hat{\beta}_n β ^ n . For K = 0 K=0 K = 0 there is nothing to truncate, and Ω n \Omega_n Ω n is the whole space. For K ≥ 1 K\ge1 K ≥ 1 , Lemma A.2(d) gives P ( Ω n ) → 1 \mathbb{P}(\Omega_n)\to1 P ( Ω n ) → 1 . We work on Ω n \Omega_n Ω n , where ℓ n ( K ) = ∑ i [ log q i + L i ] \ell_n^{(K)}=\sum_i[\log q_i+L_i] ℓ n ( K ) = ∑ i [ log q i + L i ] . Write ν i ( β ) = ν ( X i − 1 ; β ) \nu_i(\beta)=\nu(X_{i-1};\beta) ν i ( β ) = ν ( X i − 1 ; β ) , δ i ( α ) = μ ( X i − 1 ; α ) − μ ( X i − 1 ; α 0 ) \delta_i(\alpha)=\mu(X_{i-1};\alpha)-\mu(X_{i-1};\alpha_0) δ i ( α ) = μ ( X i − 1 ; α ) − μ ( X i − 1 ; α 0 ) and z i = z i ( α 0 ) z_i=z_i(\alpha_0) z i = z i ( α 0 ) , so that z i ( α ) = z i − ε δ i ( α ) z_i(\alpha)=z_i-\varepsilon\delta_i(\alpha) z i ( α ) = z i − ε δ i ( α ) and ∣ δ i ( α ) ∣ ≤ C ⟨ X i − 1 ⟩ |\delta_i(\alpha)|\le C\langle X_{i-1}\rangle ∣ δ i ( α ) ∣ ≤ C ⟨ X i − 1 ⟩ .
Step 1: diffusion parameters. Let Y n ( α , β ) = n − 1 [ ℓ n ( K ) ( α , β ) − ℓ n ( K ) ( α , β 0 ) ] Y_n(\alpha,\beta)=n^{-1}[\ell_n^{(K)}(\alpha,\beta)-\ell_n^{(K)}(\alpha,\beta_0)] Y n ( α , β ) = n − 1 [ ℓ n ( K ) ( α , β ) − ℓ n ( K ) ( α , β 0 )] . By Lemmas A.1(d) and A.3, the corrections contribute at most 2 n − 1 ∑ i sup θ ∣ L i ∣ = O P ( ε ) 2n^{-1}\sum_i\sup_\theta|L_i|=O_{\mathbb{P}}(\varepsilon) 2 n − 1 ∑ i sup θ ∣ L i ∣ = O P ( ε ) , uniformly in θ \theta θ . The Gaussian part is
− 1 2 n ∑ i [ log det ( ν i ( β ) ν i ( β 0 ) − 1 ) + z i ( α ) T ( ν i ( β ) − 1 − ν i ( β 0 ) − 1 ) z i ( α ) ] . -\frac{1}{2n}\sum_i\left[\log\det\left(\nu_i(\beta)\nu_i(\beta_0)^{-1}\right)+z_i(\alpha)^{\mathsf T}\left(\nu_i(\beta)^{-1}-\nu_i(\beta_0)^{-1}\right)z_i(\alpha)\right]. − 2 n 1 i ∑ [ log det ( ν i ( β ) ν i ( β 0 ) − 1 ) + z i ( α ) T ( ν i ( β ) − 1 − ν i ( β 0 ) − 1 ) z i ( α ) ] .
By Lemma A.5 , it converges uniformly in ( α , β ) (\alpha,\beta) ( α , β ) to
U β ( β ) = − 1 2 ∫ [ tr A ( x ) − log det A ( x ) − m ] π ( d x ) , A ( x ) = ν ( x ; β ) − 1 ν ( x ; β 0 ) . U_\beta(\beta)=-\frac{1}{2}\int\left[\operatorname{tr} A(x)-\log\det A(x)-m\right]\pi(dx),\qquad A(x)=\nu(x;\beta)^{-1}\nu(x;\beta_0). U β ( β ) = − 2 1 ∫ [ tr A ( x ) − log det A ( x ) − m ] π ( d x ) , A ( x ) = ν ( x ; β ) − 1 ν ( x ; β 0 ) .
The matrix A ( x ) A(x) A ( x ) is similar to a symmetric positive definite matrix with eigenvalues λ j > 0 \lambda_j>0 λ j > 0 , and tr A − log det A − m = ∑ j ( λ j − 1 − log λ j ) ≥ 0 \operatorname{tr} A-\log\det A-m=\sum_j(\lambda_j-1-\log\lambda_j)\ge0 tr A − log det A − m = ∑ j ( λ j − 1 − log λ j ) ≥ 0 , with equality if and only if A = I A=I A = I . Hence U β ≤ 0 U_\beta\le0 U β ≤ 0 is continuous, and by Assumption H4(a) it vanishes only at β 0 \beta_0 β 0 . Since θ ^ n ( K ) \hat{\theta}_n^{(K)} θ ^ n ( K ) maximizes ℓ n ( K ) \ell_n^{(K)} ℓ n ( K ) , Y n ( α ^ n , β ^ n ) ≥ 0 Y_n(\hat{\alpha}_n,\hat{\beta}_n)\ge0 Y n ( α ^ n , β ^ n ) ≥ 0 . For η > 0 \eta>0 η > 0 let u η = sup ∣ β − β 0 ∣ ≥ η U β ( β ) < 0 u_\eta=\sup_{|\beta-\beta_0|\ge\eta}U_\beta(\beta)<0 u η = sup ∣ β − β 0 ∣ ≥ η U β ( β ) < 0 . Then P ( ∣ β ^ n − β 0 ∣ ≥ η ) ≤ P ( sup θ ∣ Y n − U β ∣ ≥ − u η ) + P ( Ω n c ) → 0 \mathbb{P}(|\hat{\beta}_n-\beta_0|\ge\eta)\le\mathbb{P}(\sup_\theta|Y_n-U_\beta|\ge-u_\eta)+\mathbb{P}(\Omega_n^c)\to0 P ( ∣ β ^ n − β 0 ∣ ≥ η ) ≤ P ( sup θ ∣ Y n − U β ∣ ≥ − u η ) + P ( Ω n c ) → 0 .
Step 2: drift parameters. Let V n ( α ) = ( n Δ ) − 1 [ ℓ n ( K ) ( α , β ^ n ) − ℓ n ( K ) ( α 0 , β ^ n ) ] V_n(\alpha)=(n\Delta)^{-1}[\ell_n^{(K)}(\alpha,\hat{\beta}_n)-\ell_n^{(K)}(\alpha_0,\hat{\beta}_n)] V n ( α ) = ( n Δ ) − 1 [ ℓ n ( K ) ( α , β ^ n ) − ℓ n ( K ) ( α 0 , β ^ n )] . The log-determinants cancel, and the Gaussian part equals
1 n Δ ∑ i δ i ( α ) ⊤ ν i ( β ^ n ) − 1 z i − 1 2 n ∑ i δ i ( α ) ⊤ ν i ( β ^ n ) − 1 δ i ( α ) . \frac{1}{n\Delta}\sum_i\delta_i(\alpha)^\top\nu_i(\hat{\beta}_n)^{-1}z_i-\frac{1}{2n}\sum_i\delta_i(\alpha)^\top\nu_i(\hat{\beta}_n)^{-1}\delta_i(\alpha). n Δ 1 i ∑ δ i ( α ) ⊤ ν i ( β ^ n ) − 1 z i − 2 n 1 i ∑ δ i ( α ) ⊤ ν i ( β ^ n ) − 1 δ i ( α ) .
By Lemma A.6 with g = ν ( ⋅ ; β ) − 1 δ ( ⋅ ; α ) g=\nu(\cdot;\beta)^{-1}\delta(\cdot;\alpha) g = ν ( ⋅ ; β ) − 1 δ ( ⋅ ; α ) , the first sum is o P ( 1 ) o_{\mathbb{P}}(1) o P ( 1 ) uniformly in ( α , β ) (\alpha,\beta) ( α , β ) . By Lemma A.5 , uniform continuity of the limit in β \beta β , and β ^ n → P β 0 \hat{\beta}_n\xrightarrow{\mathbb{P}}\beta_0 β ^ n P β 0 , the second converges uniformly in α \alpha α to
U α ( α ) = − 1 2 ∫ δ ( x ; α ) ⊤ ν ( x ; β 0 ) − 1 δ ( x ; α ) π ( d x ) , δ ( x ; α ) = μ ( x ; α ) − μ ( x ; α 0 ) . U_\alpha(\alpha)=-\frac{1}{2}\int\delta(x;\alpha)^\top\nu(x;\beta_0)^{-1}\delta(x;\alpha)\pi(dx),\qquad\delta(x;\alpha)=\mu(x;\alpha)-\mu(x;\alpha_0). U α ( α ) = − 2 1 ∫ δ ( x ; α ) ⊤ ν ( x ; β 0 ) − 1 δ ( x ; α ) π ( d x ) , δ ( x ; α ) = μ ( x ; α ) − μ ( x ; α 0 ) .
For the corrections, the mean-value theorem and Lemma A.1 (d) give
1 n Δ ∑ i [ L i ( α , β ) − L i ( α 0 , β ) ] = ( α − α 0 ) ⊤ 1 n ∑ i ∫ 0 1 G ( 1 ) ( z i ( α s ) ; X i − 1 , α s , β ) d s + O P ( ε ) , \frac{1}{n\Delta}\sum_i[\mathcal{L}_i(\alpha,\beta)-\mathcal{L}_i(\alpha_0,\beta)]=(\alpha-\alpha_0)^\top\frac{1}{n}\sum_i\int_0^1G^{(1)}(z_i(\alpha_s);X_{i-1},\alpha_s,\beta)\,ds+O_{\mathbb{P}}(\varepsilon), n Δ 1 i ∑ [ L i ( α , β ) − L i ( α 0 , β )] = ( α − α 0 ) ⊤ n 1 i ∑ ∫ 0 1 G ( 1 ) ( z i ( α s ) ; X i − 1 , α s , β ) d s + O P ( ε ) ,
with α s = α 0 + s ( α − α 0 ) \alpha_s=\alpha_0+s(\alpha-\alpha_0) α s = α 0 + s ( α − α 0 ) , uniformly in ( α , β ) (\alpha,\beta) ( α , β ) . Lemma A.5 , applied with ϑ = ( s , α , β ) ∈ [ 0 , 1 ] × Θ \vartheta=(s,\alpha,\beta)\in[0,1]\times\Theta ϑ = ( s , α , β ) ∈ [ 0 , 1 ] × Θ and α ′ = α s \alpha'=\alpha_s α ′ = α s , shows that this converges uniformly to ( α − α 0 ) ⊤ ∫ 0 1 γ ( α s , β ) d s (\alpha-\alpha_0)^\top\int_0^1\gamma(\alpha_s,\beta)\,ds ( α − α 0 ) ⊤ ∫ 0 1 γ ( α s , β ) d s , where
γ ( α , β ) = ∫ E Z ∼ N ( 0 , ν ( x ; β 0 ) ) [ G ( 1 ) ( Z ; x , α , β ) ] π ( d x ) . \gamma(\alpha,\beta)=\int\mathbb{E}_{Z\sim N(0,\nu(x;\beta_0))}[G^{(1)}(Z;x,\alpha,\beta)]\pi(dx). γ ( α , β ) = ∫ E Z ∼ N ( 0 , ν ( x ; β 0 )) [ G ( 1 ) ( Z ; x , α , β )] π ( d x ) .
Because G ( 1 ) ( ⋅ ; x , α , β ) ∈ H + ( x , β ) G^{(1)}(\cdot;x,\alpha,\beta)\in H^+(x,\beta) G ( 1 ) ( ⋅ ; x , α , β ) ∈ H + ( x , β ) , we have γ ( α , β 0 ) = 0 \gamma(\alpha,\beta_0)=0 γ ( α , β 0 ) = 0 for every α \alpha α . By uniform continuity of γ \gamma γ and β ^ n → P β 0 \hat{\beta}_n\xrightarrow{\mathbb{P}}\beta_0 β ^ n P β 0 , the corrections are o P ( 1 ) o_{\mathbb{P}}(1) o P ( 1 ) uniformly in α \alpha α at β = β ^ n \beta=\hat{\beta}_n β = β ^ n . Hence sup α ∣ V n ( α ) − U α ( α ) ∣ → P 0 \sup_\alpha|V_n(\alpha)-U_\alpha(\alpha)|\xrightarrow{\mathbb{P}}0 sup α ∣ V n ( α ) − U α ( α ) ∣ P 0 . Since U α ≤ 0 U_\alpha\le0 U α ≤ 0 is continuous with a unique zero at α 0 \alpha_0 α 0 by Assumption H4(b), and V n ( α ^ n ) ≥ 0 V_n(\hat{\alpha}_n)\ge0 V n ( α ^ n ) ≥ 0 , the argument of Step 1 gives α ^ n → P α 0 \hat{\alpha}_n\xrightarrow{\mathbb{P}}\alpha_0 α ^ n P α 0 .
Remark 3 (near-maximizers). The proof uses the maximizing property only through Y n ( θ ^ n ( K ) ) ≥ 0 Y_n(\hat{\theta}_n^{(K)})\ge0 Y n ( θ ^ n ( K ) ) ≥ 0 and V n ( α ^ n ) ≥ 0 V_n(\hat{\alpha}_n)\ge0 V n ( α ^ n ) ≥ 0 . It therefore applies to any θ ~ n = ( α ~ n , β ~ n ) \tilde{\theta}_n=(\tilde{\alpha}_n,\tilde{\beta}_n) θ ~ n = ( α ~ n , β ~ n ) with ℓ n ( K ) ( θ ~ n ) ≥ sup Θ ℓ n ( K ) − η n \ell_n^{(K)}(\tilde{\theta}_n)\ge\sup_\Theta\ell_n^{(K)}-\eta_n ℓ n ( K ) ( θ ~ n ) ≥ sup Θ ℓ n ( K ) − η n , where η n = o P ( n Δ n ) \eta_n=o_{\mathbb{P}}(n\Delta_n) η n = o P ( n Δ n ) : then Y n ( θ ~ n ) ≥ − η n / n = − o P ( 1 ) Y_n(\tilde{\theta}_n)\ge-\eta_n/n=-o_{\mathbb{P}}(1) Y n ( θ ~ n ) ≥ − η n / n = − o P ( 1 ) and, since ( α 0 , β ~ n ) ∈ Θ (\alpha_0,\tilde{\beta}_n)\in\Theta ( α 0 , β ~ n ) ∈ Θ , V n ( α ~ n ) ≥ − η n / ( n Δ n ) = − o P ( 1 ) V_n(\tilde{\alpha}_n)\ge-\eta_n/(n\Delta_n)=-o_{\mathbb{P}}(1) V n ( α ~ n ) ≥ − η n / ( n Δ n ) = − o P ( 1 ) , which is all the argument needs. We use this in the proofs of Theorems 1 and 2.
Proof of Theorem 4 and Corollary 3
The proof has three parts: an expansion of the conditional bias of the score, a central limit theorem for its martingale part, and uniform convergence of the Hessian. Only the first part involves the expansion error, and it is where the bias vector B ˉ ( K ) \bar{B}^{(K)} B ˉ ( K ) appears. Fix c ≥ 8 m λ max c \ge8m\lambda_{\max} c ≥ 8 m λ m a x and set r n = c log n r_n = \sqrt{c\log n} r n = c log n . Fix also δ 0 ∈ ( 0 , a / 2 ) \delta_0 \in(0,a/2) δ 0 ∈ ( 0 , a /2 ) with δ 0 < a / ( 4 r ) \delta_0 < a/(4r) δ 0 < a / ( 4 r ) , where r r r is the largest of the polynomial state-weight exponents that appear below: that of Proposition 1 at order K + 1 K+1 K + 1 , and those of Lemma A.1 for the score and for the tail term in Lemma D.1. Then ⟨ X i − 1 ⟩ r ≤ C n a / 4 \langle X_{i-1}\rangle^r \le Cn^{a/4} ⟨ X i − 1 ⟩ r ≤ C n a /4 on G i G_i G i , and δ 0 \delta_0 δ 0 does not depend on n n n or on the moment orders used in Appendix F. Let G i = { ∣ X i − 1 ∣ ≤ n δ 0 } G_i = \{|X_{i-1}| \le n^{\delta_0}\} G i = { ∣ X i − 1 ∣ ≤ n δ 0 } , which is F i − 1 \mathcal{F}_{i-1} F i − 1 -measurable, and let B n = { x ′ : ∣ z ∣ ≤ r n } B_n = \{x' : |z| \le r_n\} B n = { x ′ : ∣ z ∣ ≤ r n } , with z z z evaluated at θ 0 \theta_0 θ 0 . By Lemma A.2(b), P ( ∣ z i ∣ > r n ∣ F i − 1 ) ≤ C n − 3 \mathbb{P}(|z_i| > r_n \mid\mathcal{F}_{i-1}) \le Cn^{-3} P ( ∣ z i ∣ > r n ∣ F i − 1 ) ≤ C n − 3 on G i G_i G i , and P ( max i ∣ z i ∣ ≤ r n , max i ∣ X i − 1 ∣ ≤ n δ 0 ) → 1 \mathbb{P}(\max_i |z_i| \le r_n,\ \max_i |X_{i-1}| \le n^{\delta_0}) \to1 P ( max i ∣ z i ∣ ≤ r n , max i ∣ X i − 1 ∣ ≤ n δ 0 ) → 1 . On B n B_n B n and G i G_i G i , Lemma A.1(a) gives ∣ R ∣ ≤ C ε n r δ 0 r n 3 K → 0 |R| \le C\varepsilon n^{r\delta_0}r_n^{3K} \to0 ∣ R ∣ ≤ C ε n r δ 0 r n 3 K → 0 , so p ( K , Δ ) ≥ 3 4 q p^{(K,\Delta)} \ge\frac{3}{4}q p ( K , Δ ) ≥ 4 3 q there for large n n n .
Lemma D.1 (bias of the score). Suppose the assumptions of Theorem 4 hold, and let
s i = ∂ θ log p ( K , Δ ) ( X i ∣ X i − 1 ; θ 0 ) , s ~ i = s i 1 { ∣ z i ∣ ≤ r n } 1 G i . s_i = \partial_\theta\log p^{(K,\Delta)}(X_i\mid X_{i-1};\theta_0),\qquad\tilde{s}_i = s_i\,\mathbf{1}\{|z_i|\le r_n\}\mathbf{1}_{G_i}. s i = ∂ θ log p ( K , Δ ) ( X i ∣ X i − 1 ; θ 0 ) , s ~ i = s i 1 { ∣ z i ∣ ≤ r n } 1 G i . Then, uniformly in i i i , on G i G_i G i ,
∣ ε − 1 E [ s ~ i , α ∣ F i − 1 ] − Δ K + 1 2 b α ( X i − 1 ) ∣ + ∣ E [ s ~ i , β ∣ F i − 1 ] − Δ K + 1 2 b β ( X i − 1 ) ∣ ≤ C Δ K + 2 2 n r δ 0 r n r + C n − 2 . \left|\varepsilon^{-1}\mathbb{E}[\tilde{s}_{i,\alpha}\mid\mathcal{F}_{i-1}] - \Delta^{\frac{K+1}{2}}b_\alpha(X_{i-1})\right| + \left|\mathbb{E}[\tilde{s}_{i,\beta}\mid\mathcal{F}_{i-1}] - \Delta^{\frac{K+1}{2}}b_\beta(X_{i-1})\right| \le C\Delta^{\frac{K+2}{2}}n^{r\delta_0}r_n^r + Cn^{-2}. ε − 1 E [ s ~ i , α ∣ F i − 1 ] − Δ 2 K + 1 b α ( X i − 1 ) + E [ s ~ i , β ∣ F i − 1 ] − Δ 2 K + 1 b β ( X i − 1 ) ≤ C Δ 2 K + 2 n r δ 0 r n r + C n − 2 . Since G i ∈ F i − 1 G_i \in\mathcal{F}_{i-1} G i ∈ F i − 1 and s ~ i \tilde{s}_i s ~ i vanishes off G i G_i G i , the bound holds on the whole probability space once b α b_\alpha b α , b β b_\beta b β and the right-hand side are multiplied by 1 G i \mathbf{1}_{G_i} 1 G i .
Proof. Let x = X i − 1 x = X_{i-1} x = X i − 1 . By Lemma A.1(b), ∫ ∂ θ p ( K , Δ ) d x ′ = ∂ θ 1 = 0 \int\partial_\theta p^{(K,\Delta)}\,dx' = \partial_\theta1 = 0 ∫ ∂ θ p ( K , Δ ) d x ′ = ∂ θ 1 = 0 . Hence
E [ s ~ i ∣ F i − 1 ] = ∫ B n ∂ θ log p ( K , Δ ) ( p Δ − p ( K , Δ ) ) d x ′ − ∫ B n c ∂ θ p ( K , Δ ) d x ′ . \mathbb{E}[\tilde{s}_i\mid\mathcal{F}_{i-1}] = \int_{B_n}\partial_\theta\log p^{(K,\Delta)}(p_\Delta-p^{(K,\Delta)})\,dx' - \int_{B_n^c}\partial_\theta p^{(K,\Delta)}\,dx'. E [ s ~ i ∣ F i − 1 ] = ∫ B n ∂ θ log p ( K , Δ ) ( p Δ − p ( K , Δ ) ) d x ′ − ∫ B n c ∂ θ p ( K , Δ ) d x ′ . We split p Δ − p ( K , Δ ) = q Δ ( K + 1 ) / 2 C K + 1 + ( p Δ − p ( K + 1 , Δ ) ) p_\Delta-p^{(K,\Delta)} = q\Delta^{(K+1)/2}C_{K+1}+(p_\Delta-p^{(K+1,\Delta)}) p Δ − p ( K , Δ ) = q Δ ( K + 1 ) /2 C K + 1 + ( p Δ − p ( K + 1 , Δ ) ) . By Proposition 1 at order K + 1 K+1 K + 1 , the second piece is at most C ⟨ x ⟩ r Δ ( K + 2 − m ) / 2 C\langle x\rangle^r\Delta^{(K+2-m)/2} C ⟨ x ⟩ r Δ ( K + 2 − m ) /2 . On B n B_n B n , Lemma A.1 gives ∣ ∂ β log p ( K , Δ ) ∣ + ε − 1 ∣ ∂ α log p ( K , Δ ) ∣ ≤ C ⟨ x ⟩ r ( 1 + ∣ z ∣ 3 K ) |\partial_\beta\log p^{(K,\Delta)}|+\varepsilon^{-1}|\partial_\alpha\log p^{(K,\Delta)}|\le C\langle x\rangle^r(1+|z|^{3K}) ∣ ∂ β log p ( K , Δ ) ∣ + ε − 1 ∣ ∂ α log p ( K , Δ ) ∣ ≤ C ⟨ x ⟩ r ( 1 + ∣ z ∣ 3 K ) , and the Lebesgue measure of B n B_n B n is C Δ m / 2 r n m C\Delta^{m/2}r_n^m C Δ m /2 r n m . The contribution of the second piece is therefore within the stated bound. For the first piece, change variables to z z z , so that q d x ′ = ϕ ( z ; ν ) d z q\,dx'=\phi(z;\nu)\,dz q d x ′ = ϕ ( z ; ν ) d z with ν = ν ( x ; β 0 ) \nu=\nu(x;\beta_0) ν = ν ( x ; β 0 ) . Since ∣ R ∣ ≤ 1 4 |R|\le\frac14 ∣ R ∣ ≤ 4 1 on B n B_n B n and G i G_i G i (see the beginning of this appendix), Lemma A.1(d) applies there and gives
∂ β log p ( K , Δ ) = S β ( z ; x ) + O ( ε ⟨ x ⟩ r ( 1 + ∣ z ∣ 3 K ) ) , \partial_\beta\log p^{(K,\Delta)} = S_\beta(z;x)+O\bigl(\varepsilon\langle x\rangle^r(1+|z|^{3K})\bigr), ∂ β log p ( K , Δ ) = S β ( z ; x ) + O ( ε ⟨ x ⟩ r ( 1 + ∣ z ∣ 3 K ) ) , ε − 1 ∂ α log p ( K , Δ ) = ( ∂ α μ ) ⊤ ν − 1 z + O ( ε ⟨ x ⟩ r ( 1 + ∣ z ∣ 6 K + 2 ) ) . \varepsilon^{-1}\partial_\alpha\log p^{(K,\Delta)} = (\partial_\alpha\mu)^\top\nu^{-1}z+O\bigl(\varepsilon\langle x\rangle^r(1+|z|^{6K+2})\bigr). ε − 1 ∂ α log p ( K , Δ ) = ( ∂ α μ ) ⊤ ν − 1 z + O ( ε ⟨ x ⟩ r ( 1 + ∣ z ∣ 6 K + 2 ) ) . where S β j ( z ; x ) = 1 2 [ z ⊤ ν − 1 ∂ β j ν ν − 1 z − tr ( ν − 1 ∂ β j ν ) ] S_{\beta_j}(z;x)=\frac12[z^\top\nu^{-1}\partial_{\beta_j}\nu\,\nu^{-1}z-\operatorname{tr}(\nu^{-1}\partial_{\beta_j}\nu)] S β j ( z ; x ) = 2 1 [ z ⊤ ν − 1 ∂ β j ν ν − 1 z − tr ( ν − 1 ∂ β j ν )] is the Euler score. Integrating against C K + 1 ϕ C_{K+1}\phi C K + 1 ϕ , whose coefficients are bounded by C ⟨ x ⟩ r C\langle x\rangle^r C ⟨ x ⟩ r , over { ∣ z ∣ ≤ r n } \{|z|\le r_n\} { ∣ z ∣ ≤ r n } gives Δ ( K + 1 ) / 2 \Delta^{(K+1)/2} Δ ( K + 1 ) /2 times b ( x ) + O ( ε ⟨ x ⟩ r ) b(x)+O(\varepsilon\langle x\rangle^r) b ( x ) + O ( ε ⟨ x ⟩ r ) , up to Gaussian tails of order n − 2 n^{-2} n − 2 . Finally, ∣ ∂ θ p ( K , Δ ) ∣ ≤ q C ⟨ x ⟩ r ( 1 + ∣ z ∣ 3 K + 2 ) |\partial_\theta p^{(K,\Delta)}|\le qC\langle x\rangle^r(1+|z|^{3K+2}) ∣ ∂ θ p ( K , Δ ) ∣ ≤ q C ⟨ x ⟩ r ( 1 + ∣ z ∣ 3 K + 2 ) , with an extra factor ε \varepsilon ε for the α \alpha α -component, so the integral over B n c B_n^c B n c is at most
C ⟨ x ⟩ r ∫ ∣ z ∣ > r n ( 1 + ∣ z ∣ 3 K + 2 ) e − ∣ z ∣ 2 / ( 2 λ max ) d z ≤ C n − 2 C\langle x\rangle^r\int_{|z|>r_n}(1+|z|^{3K+2})e^{-|z|^2/(2\lambda_{\max})}\,dz\le Cn^{-2} C ⟨ x ⟩ r ∫ ∣ z ∣ > r n ( 1 + ∣ z ∣ 3 K + 2 ) e − ∣ z ∣ 2 / ( 2 λ m a x ) d z ≤ C n − 2 on G i G_i G i , by the choice of c c c and δ 0 \delta_0 δ 0 . □ \square □
The lemma shows that the score of the delta-expansion contrast is a martingale up to a drift whose leading term is explicit and of order Δ ( K + 1 ) / 2 \Delta^{(K+1)/2} Δ ( K + 1 ) /2 per observation. The next lemma handles the
martingale part. It also shows that this part does not depend on K K K , up to o P ( 1 ) o_{\mathrm{P}}(1) o P ( 1 ) , which is what makes the different estimators comparable.
Lemma D.2 (central limit theorem for the score). Under the assumptions of Theorem 4 , S n ( K ) : = D n − 1 ∑ i = 1 n ( s ~ i − E [ s ~ i ∣ F i − 1 ] ) → d N ( 0 , Γ ) S_n^{(K)} := D_n^{-1}\sum_{i=1}^{n}(\tilde{s}_i-\mathbb{E}[\tilde{s}_i\mid\mathcal{F}_{i-1}]) \xrightarrow{d} N(0,\Gamma) S n ( K ) := D n − 1 ∑ i = 1 n ( s ~ i − E [ s ~ i ∣ F i − 1 ]) d N ( 0 , Γ ) . Moreover, with S n : = S n ( 0 ) S_n := S_n^{(0)} S n := S n ( 0 ) built from the Euler score, S n ( K ) − S n → P 0 S_n^{(K)}-S_n \xrightarrow{\mathrm{P}} 0 S n ( K ) − S n P 0 for every fixed K K K . In the rest of this appendix, K K K is fixed and we write S n S_n S n also for S n ( K ) S_n^{(K)} S n ( K ) , which is harmless by the second statement.
Proof. Write s ~ i , α = ε a i \tilde{s}_{i,\alpha}=\varepsilon a_i s ~ i , α = ε a i and s ~ i , β = b i \tilde{s}_{i,\beta}=b_i s ~ i , β = b i , so that D n − 1 ∑ i s ~ i = n − 1 / 2 ∑ i ( a i , b i ) D_n^{-1}\sum_i\tilde{s}_i=n^{-1/2}\sum_i(a_i,b_i) D n − 1 ∑ i s ~ i = n − 1/2 ∑ i ( a i , b i ) . By Lemma A.1 , on { ∣ z i ∣ ≤ r n } ∩ G i \{|z_i|\le r_n\}\cap G_i { ∣ z i ∣ ≤ r n } ∩ G i ,
a i = ( ∂ α μ ) T ν − 1 z i + ε P i , b i , j = 1 2 [ z i T ν − 1 ∂ β j ν ν − 1 z i − tr ( ν − 1 ∂ β j ν ) ] + ε P i , j ′ . a_i=(\partial_\alpha\mu)^\mathsf{T}\nu^{-1}z_i+\varepsilon P_i,\qquad b_{i,j}=\frac{1}{2}\left[z_i^\mathsf{T}\nu^{-1}\partial_{\beta_j}\nu\nu^{-1}z_i-\operatorname{tr}(\nu^{-1}\partial_{\beta_j}\nu)\right]+\varepsilon P'_{i,j}. a i = ( ∂ α μ ) T ν − 1 z i + ε P i , b i , j = 2 1 [ z i T ν − 1 ∂ β j ν ν − 1 z i − tr ( ν − 1 ∂ β j ν ) ] + ε P i , j ′ .
with coefficients evaluated at ( X i − 1 ; θ 0 ) (X_{i-1};\theta_0) ( X i − 1 ; θ 0 ) and polynomials P i P_i P i , P i , j ′ P'_{i,j} P i , j ′ with weighted coefficients. By the Cauchy–Schwarz inequality and the conditional tail bound, removing the indicators from these polynomial expressions changes conditional moments of order up to four by O ( ⟨ X i − 1 ⟩ r n − 3 / 2 ) O(\langle X_{i-1}\rangle^r n^{-3/2}) O (⟨ X i − 1 ⟩ r n − 3/2 ) . Lemma A.3 (c) and Gaussian moment identities then give:
E [ a i a i T ∣ F i − 1 ] = ( ∂ α μ ) T ν − 1 ∂ α μ + O ( ε ⟨ X i − 1 ⟩ r ) \mathbb{E}[a_i a_i^\mathsf{T}\mid\mathcal{F}_{i-1}]=(\partial_\alpha\mu)^\mathsf{T}\nu^{-1}\partial_\alpha\mu+O(\varepsilon\langle X_{i-1}\rangle^r) E [ a i a i T ∣ F i − 1 ] = ( ∂ α μ ) T ν − 1 ∂ α μ + O ( ε ⟨ X i − 1 ⟩ r ) ;
E [ b i , j b i , k ∣ F i − 1 ] = 1 2 tr ( ν − 1 ∂ β j ν ν − 1 ∂ β k ν ) + O ( ε ⟨ X i − 1 ⟩ r ) \mathbb{E}[b_{i,j}b_{i,k}\mid\mathcal{F}_{i-1}]=\frac{1}{2}\operatorname{tr}(\nu^{-1}\partial_{\beta_j}\nu\nu^{-1}\partial_{\beta_k}\nu)+O(\varepsilon\langle X_{i-1}\rangle^r) E [ b i , j b i , k ∣ F i − 1 ] = 2 1 tr ( ν − 1 ∂ β j ν ν − 1 ∂ β k ν ) + O ( ε ⟨ X i − 1 ⟩ r ) , using Cov ( 1 2 Z T B Z , 1 2 Z T B ′ Z ) = 1 2 tr ( B ν B ′ ν ) \operatorname{Cov}(\frac{1}{2}Z^\mathsf{T}BZ,\frac{1}{2}Z^\mathsf{T}B'Z)=\frac{1}{2}\operatorname{tr}(B\nu B'\nu) Cov ( 2 1 Z T B Z , 2 1 Z T B ′ Z ) = 2 1 tr ( B ν B ′ ν ) for Z ∼ N ( 0 , ν ) Z\sim N(0,\nu) Z ∼ N ( 0 , ν ) ;
E [ a i b i T ∣ F i − 1 ] = O ( ε ⟨ X i − 1 ⟩ r ) \mathbb{E}[a_i b_i^\mathsf{T}\mid\mathcal{F}_{i-1}]=O(\varepsilon\langle X_{i-1}\rangle^r) E [ a i b i T ∣ F i − 1 ] = O ( ε ⟨ X i − 1 ⟩ r ) , since odd Gaussian moments vanish.
The products of conditional means are O ( Δ ⟨ X i − 1 ⟩ r ) O(\Delta\langle X_{i-1}\rangle^r) O ( Δ ⟨ X i − 1 ⟩ r ) by Lemma D.1, so by Lemma A.4 and Assumption H3(ii) the conditional covariance of S n S_n S n converges to Γ \Gamma Γ . The conditional Lyapunov condition n − 2 ∑ i E [ ∣ ( a i , b i ) ∣ 4 ∣ F i − 1 ] ≤ C n − 2 ∑ i ⟨ X i − 1 ⟩ r = O P ( n − 1 ) n^{-2}\sum_i\mathbb{E}[\lvert(a_i,b_i)\rvert^4\mid\mathcal{F}_{i-1}]\le Cn^{-2}\sum_i\langle X_{i-1}\rangle^r=O_{\mathrm{P}}(n^{-1}) n − 2 ∑ i E [∣( a i , b i ) ∣ 4 ∣ F i − 1 ] ≤ C n − 2 ∑ i ⟨ X i − 1 ⟩ r = O P ( n − 1 ) follows from Lemma A.3 . The martingale central limit theorem (Hall and Heyde, [26 ] ) gives the first claim. For the second, the increments of S n − S n ′ S_n-S'_n S n − S n ′ are n − 1 / 2 ε ( P i , P i ′ ) n^{-1/2}\varepsilon(P_i,P'_i) n − 1/2 ε ( P i , P i ′ ) minus their conditional means, so the conditional variance of S n − S n ′ S_n-S'_n S n − S n ′ is at most C Δ n − 1 ∑ i ⟨ X i − 1 ⟩ r = O P ( Δ ) C\Delta n^{-1}\sum_i\langle X_{i-1}\rangle^r=O_{\mathrm{P}}(\Delta) C Δ n − 1 ∑ i ⟨ X i − 1 ⟩ r = O P ( Δ ) .
It remains to show that the normalized Hessian converges, so that the score equation can be linearized.
Lemma D.3 (Hessian). Under the assumptions of Theorem 3, for any K ≥ 0 K\ge0 K ≥ 0 (for K = 0 K=0 K = 0 , R ≡ 0 R\equiv0 R ≡ 0 and L ≡ 0 \mathcal{L}\equiv0 L ≡ 0 ), let H n ( θ ) = D n − 1 ∂ θ 2 ℓ n ( K ) ( θ ) D n − 1 H_n(\theta)=D_n^{-1}\partial_\theta^2\ell_n^{(K)}(\theta)D_n^{-1} H n ( θ ) = D n − 1 ∂ θ 2 ℓ n ( K ) ( θ ) D n − 1 on Ω n \Omega_n Ω n . There is a continuous function H ( θ ) H(\theta) H ( θ ) with H ( θ 0 ) = − Γ H(\theta_0)=-\Gamma H ( θ 0 ) = − Γ such that sup θ ∈ Θ ∣ H n ( θ ) − H ( θ ) ∣ → P 0 \sup_{\theta\in\Theta}|H_n(\theta)-H(\theta)|\xrightarrow{\mathrm{P}}0 sup θ ∈ Θ ∣ H n ( θ ) − H ( θ ) ∣ P 0 . In particular, sup ∣ θ − θ 0 ∣ ≤ η n ∣ H n ( θ ) + Γ ∣ → P 0 \sup_{|\theta-\theta_0|\le\eta_n}|H_n(\theta)+\Gamma|\xrightarrow{\mathrm{P}}0 sup ∣ θ − θ 0 ∣ ≤ η n ∣ H n ( θ ) + Γ∣ P 0 for every sequence η n → 0 \eta_n\to0 η n → 0 .
Proof. We use z i ( α ) = z i − ε δ i ( α ) z_i(\alpha)=z_i-\varepsilon\delta_i(\alpha) z i ( α ) = z i − ε δ i ( α ) and the derivatives of log q \log q log q , and treat each block separately.
Drift block. From ∂ α 2 log q i = − Δ ( ∂ α μ ) T ν − 1 ∂ α μ + ε ( ∂ α 2 μ ) T ν − 1 z i ( α ) \partial_\alpha^2\log q_i=-\Delta(\partial_\alpha\mu)^\mathsf{T}\nu^{-1}\partial_\alpha\mu+\varepsilon(\partial_\alpha^2\mu)^\mathsf{T}\nu^{-1}z_i(\alpha) ∂ α 2 log q i = − Δ ( ∂ α μ ) T ν − 1 ∂ α μ + ε ( ∂ α 2 μ ) T ν − 1 z i ( α ) and Lemma A.1 (d), ( n Δ ) − 1 ∂ α 2 ℓ n ( K ) (n\Delta)^{-1}\partial_\alpha^2\ell_n^{(K)} ( n Δ ) − 1 ∂ α 2 ℓ n ( K ) equals
− 1 n ∑ ( ∂ α μ ) T ν − 1 ∂ α μ + 1 n ε ∑ ( ∂ α 2 μ ) T ν − 1 z i − 1 n ∑ ( ∂ α 2 μ ) T ν − 1 δ i + 1 n ∑ G i ( 2 ) + O P ( ε ) . -\frac{1}{n}\sum(\partial_\alpha\mu)^\mathsf{T}\nu^{-1}\partial_\alpha\mu+\frac{1}{n\varepsilon}\sum(\partial_\alpha^2\mu)^\mathsf{T}\nu^{-1}z_i-\frac{1}{n}\sum(\partial_\alpha^2\mu)^\mathsf{T}\nu^{-1}\delta_i+\frac{1}{n}\sum G_i^{(2)}+O_{\mathrm{P}}(\varepsilon). − n 1 ∑ ( ∂ α μ ) T ν − 1 ∂ α μ + n ε 1 ∑ ( ∂ α 2 μ ) T ν − 1 z i − n 1 ∑ ( ∂ α 2 μ ) T ν − 1 δ i + n 1 ∑ G i ( 2 ) + O P ( ε ) .
The second term vanishes uniformly by Lemma A.6 . The others converge uniformly by Lemma A.5 . The limit of the G ( 2 ) G^{(2)} G ( 2 ) term vanishes at β = β 0 \beta=\beta_0 β = β 0 because G ( 2 ) ∈ H + G^{(2)}\in\mathcal{H}^+ G ( 2 ) ∈ H + , and the third term vanishes at α 0 \alpha_0 α 0 . The limit at θ 0 \theta_0 θ 0 is − Γ α -\Gamma_\alpha − Γ α .
Diffusion block. We have n − 1 ∂ β 2 ℓ n ( K ) = n − 1 ∑ i ∂ β 2 log q i + O P ( ε ) n^{-1}\partial_{\beta}^{2}\ell_{n}^{(K)}=n^{-1}\sum_i\partial_{\beta}^{2}\log q_i+O_{\mathbb{P}}(\varepsilon) n − 1 ∂ β 2 ℓ n ( K ) = n − 1 ∑ i ∂ β 2 log q i + O P ( ε ) . By Lemma A.5, the first term converges uniformly to the π \pi π -integral of the Gaussian expectation of ∂ β 2 log q \partial_{\beta}^{2}\log q ∂ β 2 log q . A direct computation shows that this equals − Γ β -\Gamma_{\beta} − Γ β at θ 0 \theta_0 θ 0 .
Cross block. Here ( n ε ) − 1 ∂ α ∂ β ℓ n ( K ) = n − 1 ∑ i ( ∂ α μ ) T ∂ β ( ν − 1 ) z i ( α ) + O P ( ε ) (n\varepsilon)^{-1}\partial_{\alpha}\partial_{\beta}\ell_{n}^{(K)}=n^{-1}\sum_i(\partial_{\alpha}\mu)^{\mathsf{T}}\partial_{\beta}(\nu^{-1})z_i(\alpha)+O_{\mathbb{P}}(\varepsilon) ( n ε ) − 1 ∂ α ∂ β ℓ n ( K ) = n − 1 ∑ i ( ∂ α μ ) T ∂ β ( ν − 1 ) z i ( α ) + O P ( ε ) . Since z i ( α ) = z i − ε δ i ( α ) z_i(\alpha)=z_i-\varepsilon\delta_i(\alpha) z i ( α ) = z i − ε δ i ( α ) , Lemma A.6 shows that this tends to zero uniformly in θ \theta θ .
The convergence is uniform over all of Θ \Theta Θ , not only near θ 0 \theta_0 θ 0 . The near-maximizer argument in the proof of Theorem 1 uses this.
Proof of Theorem 4 . Let Σ n = D n − 1 ∂ θ ℓ n ( K ) ( θ 0 ) \Sigma_n=D_n^{-1}\partial_{\theta}\ell_n^{(K)}(\theta_0) Σ n = D n − 1 ∂ θ ℓ n ( K ) ( θ 0 ) be the normalized score. With probability tending to one, the following hold:
we are on Ω n \Omega_n Ω n , and s ~ i = s i \widetilde{s}_i=s_i s i = s i for all i i i (Lemma A.2), so that Σ n = D n − 1 ∑ i s ~ i \Sigma_n=D_n^{-1}\sum_i\widetilde{s}_i Σ n = D n − 1 ∑ i s i ;
θ ^ n ( K ) \widehat{\theta}_n^{(K)} θ n ( K ) lies in the interior of Θ \Theta Θ (Theorem 3, since θ 0 \theta_0 θ 0 is interior), so ∂ θ ℓ n ( K ) ( θ ^ n ( K ) ) = 0 \partial_{\theta}\ell_n^{(K)}(\widehat{\theta}_n^{(K)})=0 ∂ θ ℓ n ( K ) ( θ n ( K ) ) = 0 .
By Lemma D.1, the normalized compensator is
D n − 1 ∑ i E [ s ~ i ∣ F i − 1 ] = ξ n 1 n ∑ i b ( X i − 1 ) 1 G i + O P ( ξ n ε n r δ 0 r n ) + O ( n − 3 / 2 ) . D_n^{-1}\sum_i\mathbb{E}[\widetilde{s}_i\mid\mathcal{F}_{i-1}]=\xi_n\frac{1}{n}\sum_i b(X_{i-1})\mathbf{1}_{G_i}+O_{\mathbb{P}}(\xi_n\varepsilon n^{r\delta_0}r_n)+O(n^{-3/2}). D n − 1 i ∑ E [ s i ∣ F i − 1 ] = ξ n n 1 i ∑ b ( X i − 1 ) 1 G i + O P ( ξ n ε n r δ 0 r n ) + O ( n − 3/2 ) .
Since δ 0 < a / ( 4 r ) \delta_0<a/(4r) δ 0 < a / ( 4 r ) , ε n r δ 0 r n → 0 \varepsilon n^{r\delta_0}r_n\to0 ε n r δ 0 r n → 0 . By Lemma A.4 and Assumption H3(ii), n − 1 ∑ i b ( X i − 1 ) 1 G i → P B ˉ ( K ) n^{-1}\sum_i b(X_{i-1})\mathbf{1}_{G_i}\xrightarrow{\mathbb{P}}\bar{B}^{(K)} n − 1 ∑ i b ( X i − 1 ) 1 G i P B ˉ ( K ) , because b b b is C 1 C^1 C 1 with polynomially bounded gradient. Hence Σ n = S n + ξ n B ˉ ( K ) + o P ( 1 + ξ n ) \Sigma_n=S_n+\xi_n\bar{B}^{(K)}+o_{\mathbb{P}}(1+\xi_n) Σ n = S n + ξ n B ˉ ( K ) + o P ( 1 + ξ n ) . A Taylor expansion of the score gives 0 = Σ n + H ˉ n D n ( θ ^ n ( K ) − θ 0 ) 0=\Sigma_n+\bar{H}_nD_n(\widehat{\theta}_n^{(K)}-\theta_0) 0 = Σ n + H ˉ n D n ( θ n ( K ) − θ 0 ) , with H ˉ n = ∫ 0 1 H n ( θ 0 + u ( θ ^ n ( K ) − θ 0 ) ) d u \bar{H}_n=\int_0^1H_n(\theta_0+u(\widehat{\theta}_n^{(K)}-\theta_0))\,du H ˉ n = ∫ 0 1 H n ( θ 0 + u ( θ n ( K ) − θ 0 )) d u . By Lemma D.3 and consistency, H ˉ n → P − Γ \bar{H}_n\xrightarrow{\mathbb{P}}-\Gamma H ˉ n P − Γ , so D n ( θ ^ n ( K ) − θ 0 ) = Γ − 1 Σ n + o P ( 1 ) Σ n D_n(\widehat{\theta}_n^{(K)}-\theta_0)=\Gamma^{-1}\Sigma_n+o_{\mathbb{P}}(1)\Sigma_n D n ( θ n ( K ) − θ 0 ) = Γ − 1 Σ n + o P ( 1 ) Σ n , which is the stated expansion because S n = O P ( 1 ) S_n=O_{\mathbb{P}}(1) S n = O P ( 1 ) by Lemma D.2.
For the parity statement, recall that H h ( − z ; Σ ) = ( − 1 ) ∣ h ∣ H h ( z ; Σ ) H_h(-z;\Sigma)=(-1)^{\lvert h\rvert}H_h(z;\Sigma) H h ( − z ; Σ ) = ( − 1 ) ∣ h ∣ H h ( z ; Σ ) . In (2) , C K + 1 C_{K+1} C K + 1 involves only ∣ h ∣ = 2 N − K − 1 \lvert h\rvert=2N-K-1 ∣ h ∣ = 2 N − K − 1 , so it is an odd function of z z z if K K K is even and an even function if K K K is odd. The Euler score S β S_{\beta} S β is even in z z z and the drift score ( ∂ α μ ) T ν − 1 z (\partial_{\alpha}\mu)^{\mathsf{T}}\nu^{-1}z ( ∂ α μ ) T ν − 1 z is odd. Since N ( 0 , ν ) N(0,\nu) N ( 0 , ν ) is symmetric, b β ( x ) = 0 b_{\beta}(x)=0 b β ( x ) = 0 for every x x x when K K K is even, and b α ( x ) = 0 b_{\alpha}(x)=0 b α ( x ) = 0 for every x x x when K K K is odd.
Proof of Corollary 3. Parts (a) and (b) follow from Theorem 4 , Lemma D.2 and Slutsky’s lemma, since Γ − 1 Γ Γ − 1 = diag ( Γ α − 1 , Γ β − 1 ) \Gamma^{-1}\Gamma\Gamma^{-1}=\operatorname{diag}(\Gamma_{\alpha}^{-1},\Gamma_{\beta}^{-1}) Γ − 1 Γ Γ − 1 = diag ( Γ α − 1 , Γ β − 1 ) . For (c), divide the expansion by ξ n → ∞ \xi_n\to\infty ξ n → ∞ : D n ( θ ^ n ( K ) − θ 0 ) / ξ n = Γ − 1 B ˉ ( K ) + Γ − 1 S n / ξ n + o P ( 1 ) → P Γ − 1 B ˉ ( K ) D_n(\widehat{\theta}_n^{(K)}-\theta_0)/\xi_n=\Gamma^{-1}\bar{B}^{(K)}+\Gamma^{-1}S_n/\xi_n+o_{\mathbb{P}}(1)\xrightarrow{\mathbb{P}}\Gamma^{-1}\bar{B}^{(K)} D n ( θ n ( K ) − θ 0 ) / ξ n = Γ − 1 B ˉ ( K ) + Γ − 1 S n / ξ n + o P ( 1 ) P Γ − 1 B ˉ ( K ) .
Proof of Theorem 4 for K = 0 K=0 K = 0 . For the Euler contrast, R ≡ 0 R\equiv0 R ≡ 0 and the score is the Euler score itself. In Lemma D.1, split p Δ − q = q ( ε C 1 + Δ C 2 ) + ( p Δ − p ( 2 , Δ ) ) p_{\Delta}-q=q(\varepsilon C_1+\Delta C_2)+(p_{\Delta}-p^{(2,\Delta)}) p Δ − q = q ( ε C 1 + Δ C 2 ) + ( p Δ − p ( 2 , Δ ) ) instead. The term ε C 1 \varepsilon C_1 ε C 1 contributes nothing, because C 1 C_1 C 1 involves only Hermite polynomials of degree three, which are orthogonal to both leading scores. The term Δ C 2 \Delta C_2 Δ C 2 contributes Δ b ( 1 ) \Delta b^{(1)} Δ b ( 1 ) , and the remainder is O ( Δ 3 / 2 ) O(\Delta^{3/2}) O ( Δ 3/2 ) up to factors n r δ 0 r n n^{r\delta_0}r_n n r δ 0 r n . Lemmas D.2 and D.3 hold for K = 0 K=0 K = 0 , and the rest of the proof is unchanged, with ξ n = n Δ n \xi_n=\sqrt{n}\Delta_n ξ n = n Δ n .
Justification of Remark 1. The same computation applies to each block separately. In the block where b ( K ) b^{(K)} b ( K ) vanishes identically, Lemma D.1 leaves a compensator of order n Δ n ( K + 2 ) / 2 \sqrt{n}\Delta_n^{(K+2)/2} n Δ n ( K + 2 ) /2 up to factors n r δ 0 r n n^{r\delta_0}r_n n r δ 0 r n , which can be made smaller than any power of n n n . For K = 0 K=0 K = 0 , expanding one order further, p Δ − q = q ( ε C 1 + Δ C 2 + Δ 3 / 2 C 3 ) + ( p Δ − p ( 3 , Δ ) ) p_{\Delta}-q=q(\varepsilon C_1+\Delta C_2+\Delta^{3/2}C_3)+(p_{\Delta}-p^{(3,\Delta)}) p Δ − q = q ( ε C 1 + Δ C 2 + Δ 3/2 C 3 ) + ( p Δ − p ( 3 , Δ ) ) ; by parity, the score bias is Δ b β ( 1 ) \Delta b_{\beta}^{(1)} Δ b β ( 1 ) in the diffusion block and Δ 3 / 2 b α ( 2 ) \Delta^{3/2}b_{\alpha}^{(2)} Δ 3/2 b α ( 2 ) in the drift block. These block-wise statements about the score bias are proved.
Heuristic: the cross-block effect. The following statements concern the estimator rather than the score and are heuristic, since Theorem 4 controls the non-leading block only up to o P ( ξ n ) o_{\mathbb{P}}(\xi_n) o P ( ξ n ) . We first explain where the cross-block coupling comes from. In the proof of Lemma D.3 , the Euler part of ( n ε ) − 1 ∂ α ∂ β ℓ n ( K ) ( θ 0 ) (n\varepsilon)^{-1}\partial_\alpha\partial_\beta\ell_n^{(K)}(\theta_0) ( n ε ) − 1 ∂ α ∂ β ℓ n ( K ) ( θ 0 ) carries the prefactor n − 1 = ε ( n ε ) − 1 n^{-1}=\varepsilon(n\varepsilon)^{-1} n − 1 = ε ( n ε ) − 1 and is only O P ( n − 1 / 2 + ε Δ ) O_{\mathbb{P}}(n^{-1/2}+\varepsilon\Delta) O P ( n − 1/2 + ε Δ ) . For K ≥ 1 K\ge1 K ≥ 1 , the coupling of order ε \varepsilon ε comes from the correction: by Lemma A.1 (d), ( n ε ) − 1 ∑ i ∂ α ∂ β L i ( θ 0 ) = ε n − 1 ∑ i ∂ β G ( 1 ) ( z i ; X i − 1 , θ 0 ) + O P ( ε 2 ) (n\varepsilon)^{-1}\sum_i\partial_\alpha\partial_\beta L_i(\theta_0)=\varepsilon n^{-1}\sum_i\partial_\beta G^{(1)}(z_i;X_{i-1},\theta_0)+O_{\mathbb{P}}(\varepsilon^2) ( n ε ) − 1 ∑ i ∂ α ∂ β L i ( θ 0 ) = ε n − 1 ∑ i ∂ β G ( 1 ) ( z i ; X i − 1 , θ 0 ) + O P ( ε 2 ) . Although G ( 1 ) ( ⋅ ; x , α , β ) G^{(1)}(\cdot;x,\alpha,\beta) G ( 1 ) ( ⋅ ; x , α , β ) has mean zero under N ( 0 , ν ( x ; β ) ) N(0,\nu(x;\beta)) N ( 0 , ν ( x ; β )) for every β \beta β , differentiating this identity in β \beta β gives E [ ∂ β G ( 1 ) ( Z ; x , θ 0 ) ] = − Cov ( G ( 1 ) ( Z ; x , θ 0 ) , S β ( Z ; x ) ) \mathbb{E}[\partial_\beta G^{(1)}(Z;x,\theta_0)]=-\operatorname{Cov}(G^{(1)}(Z;x,\theta_0),S_\beta(Z;x)) E [ ∂ β G ( 1 ) ( Z ; x , θ 0 )] = − Cov ( G ( 1 ) ( Z ; x , θ 0 ) , S β ( Z ; x )) , which is in general nonzero when C 2 C_2 C 2 depends on α \alpha α (K ≥ 2 K\ge2 K ≥ 2 , including the Ornstein–Uhlenbeck model) or when C 1 ≠ 0 C_1\ne0 C 1 = 0 . This is the term that transmits the leading bias of one block to the other at order n Δ n ( K + 2 ) / 2 \sqrt{n}\Delta_n^{(K+2)/2} n Δ n ( K + 2 ) /2 . For the Euler contrast, by contrast, the normalized cross-block Hessian at θ 0 \theta_0 θ 0 is only O P ( n − 1 / 2 + Δ ) O_{\mathbb{P}}(n^{-1/2}+\Delta) O P ( n − 1/2 + Δ ) , because R ≡ 0 R\equiv0 R ≡ 0 , so the drift bias of the Euler estimator should be the pure score bias Δ 3 / 2 b α ( 2 ) \Delta^{3/2}b_\alpha^{(2)} Δ 3/2 b α ( 2 ) . This explains why the Euler and K = 2 K=2 K = 2 estimators have the same leading drift bias in § 5 . For K = 1 K=1 K = 1 with C 1 ≠ 0 C_1\ne0 C 1 = 0 , the score bias and the cross-block effect combine at order Δ 3 / 2 \Delta^{3/2} Δ 3/2 , which is why that entry of the table in Remark 1 is an upper bound only.
Proofs for Sections 4.2 and 4.3
All proofs in this appendix compare the exact log-likelihood, or an approximate one, with the explicit contrast ℓ n ( K ) \ell_n^{(K)} ℓ n ( K ) of high order, and then use the results of Appendices § 11 and § 12 for that contrast.
Proof of Theorem 1(a). Fix K K K as in (a), and choose δ > 0 \delta>0 δ > 0 so small that a ( K + 1 ) / 2 > 1 + ( 1 + δ ) m Λ + r K δ a(K+1)/2>1+(1+\delta)m\Lambda+r_K\delta a ( K + 1 ) /2 > 1 + ( 1 + δ ) m Λ + r K δ . Work on the intersection of Ω n \Omega_n Ω n , { max i ∣ X i ∣ ≤ n δ } \{\max_i|X_i|\le n^\delta\} { max i ∣ X i ∣ ≤ n δ } and the event of Lemma A.2(c), whose probability tends to one. There, p ( K , Δ ) ≥ 3 4 q p^{(K,\Delta)}\ge\frac{3}{4}q p ( K , Δ ) ≥ 4 3 q , and q ≥ ( 2 π λ max Δ ) − m / 2 exp ( − ∣ z ∣ 2 / ( 2 λ min ) ) q\ge(2\pi\lambda_{\max}\Delta)^{-m/2}\exp(-|z|^2/(2\lambda_{\min})) q ≥ ( 2 π λ m a x Δ ) − m /2 exp ( − ∣ z ∣ 2 / ( 2 λ m i n )) . By Proposition 1, at every observation and for every θ \theta θ ,
∣ p Δ p ( K , Δ ) − 1 ∣ ≤ C ⟨ X i − 1 ⟩ r K Δ ( K + 1 − m ) / 2 q ≤ C n r K δ Δ ( K + 1 ) / 2 exp ( ∣ z i ( α ) ∣ 2 2 λ min ) ≤ C n r K δ Δ ( K + 1 ) / 2 n ( 1 + δ ) m Λ . \left|\frac{p_\Delta}{p^{(K,\Delta)}}-1\right|
\le\frac{C\langle X_{i-1}\rangle^{r_K}\Delta^{(K+1-m)/2}}{q}
\le Cn^{r_K\delta}\Delta^{(K+1)/2}\exp\left(\frac{|z_i(\alpha)|^2}{2\lambda_{\min}}\right)
\le Cn^{r_K\delta}\Delta^{(K+1)/2}n^{(1+\delta)m\Lambda}. p ( K , Δ ) p Δ − 1 ≤ q C ⟨ X i − 1 ⟩ r K Δ ( K + 1 − m ) /2 ≤ C n r K δ Δ ( K + 1 ) /2 exp ( 2 λ m i n ∣ z i ( α ) ∣ 2 ) ≤ C n r K δ Δ ( K + 1 ) /2 n ( 1 + δ ) m Λ .
With Δ n ≤ C n − a \Delta_n\le Cn^{-a} Δ n ≤ C n − a , the right-hand side is o ( n − 1 ) o(n^{-1}) o ( n − 1 ) . Since ∣ log ( 1 + u ) ∣ ≤ 2 ∣ u ∣ |\log(1+u)|\le2|u| ∣ log ( 1 + u ) ∣ ≤ 2∣ u ∣ for ∣ u ∣ ≤ 1 2 |u|\le\frac{1}{2} ∣ u ∣ ≤ 2 1 , summing over i i i gives η n : = sup θ ∣ ℓ n ( θ ) − ℓ n ( K ) ( θ ) ∣ = o P ( 1 ) \eta_n:=\sup_\theta|\ell_n(\theta)-\ell_n^{(K)}(\theta)|=o_{\mathbb{P}}(1) η n := sup θ ∣ ℓ n ( θ ) − ℓ n ( K ) ( θ ) ∣ = o P ( 1 ) .
Proof of Theorem 1(b) and (c). The assumptions of Theorem 4 hold for this K K K , and ξ n 2 = n Δ n K + 1 ≤ C n 1 − a ( K + 1 ) → 0 \xi_n^2=\ n\Delta_n^{K+1}\le Cn^{1-a(K+1)}\to0 ξ n 2 = n Δ n K + 1 ≤ C n 1 − a ( K + 1 ) → 0 . Write ℓ n ( θ ^ n ) ≥ sup Θ ℓ n − ρ n \ell_n(\hat\theta_n)\ge\sup_\Theta\ell_n-\rho_n ℓ n ( θ ^ n ) ≥ sup Θ ℓ n − ρ n with ρ n = o P ( 1 ) \rho_n=o_{\mathbb{P}}(1) ρ n = o P ( 1 ) ; for an exact maximizer, ρ n = 0 \rho_n=0 ρ n = 0 . Then
ℓ n ( K ) ( θ ^ n ) ≥ ℓ n ( θ ^ n ) − η n ≥ ℓ n ( θ ^ n ( K ) ) − η n − ρ n ≥ sup ℓ n ( K ) − 2 η n − ρ n . \ell_n^{(K)}(\hat\theta_n)\ge\ell_n(\hat\theta_n)-\eta_n\ge\ell_n(\hat\theta_n^{(K)})-\eta_n-\rho_n\ge\sup\ell_n^{(K)}-2\eta_n-\rho_n. ℓ n ( K ) ( θ ^ n ) ≥ ℓ n ( θ ^ n ) − η n ≥ ℓ n ( θ ^ n ( K ) ) − η n − ρ n ≥ sup ℓ n ( K ) − 2 η n − ρ n .
By Remark 3, θ ^ n → P θ 0 \hat\theta_n\xrightarrow{\mathbb{P}}\theta_0 θ ^ n P θ 0 . Let u n = D n ( θ ^ n − θ 0 ) u_n=D_n(\hat\theta_n-\theta_0) u n = D n ( θ ^ n − θ 0 ) , let Σ n \Sigma_n Σ n be the normalized score of ℓ n ( K ) \ell_n^{(K)} ℓ n ( K ) at θ 0 \theta_0 θ 0 , and let f n ( u ) = u T Σ n − 1 2 u T Γ u f_n(u)=u^\mathsf{T}\Sigma_n-\frac{1}{2}u^\mathsf{T}\Gamma u f n ( u ) = u T Σ n − 2 1 u T Γ u . By the proof of Theorem 4 , Σ n = S n + o P ( 1 ) \Sigma_n=S_n+o_{\mathbb{P}}(1) Σ n = S n + o P ( 1 ) . A second-order Taylor expansion and Lemma D.3 give, uniformly over { u : ∣ D n − 1 u ∣ ≤ η n ′ } \{u:|D_n^{-1}u|\le\eta'_n\} { u : ∣ D n − 1 u ∣ ≤ η n ′ } for any η n ′ → 0 \eta'_n\to0 η n ′ → 0 ,
ℓ n ( K ) ( θ 0 + D n − 1 u ) − ℓ n ( K ) ( θ 0 ) = u T Σ n − 1 2 u T ( Γ + o P ( 1 ) ) u . (13) \ell_n^{(K)}(\theta_0+D_n^{-1}u)-\ell_n^{(K)}(\theta_0)
=u^\mathsf{T}\Sigma_n-\frac{1}{2}u^\mathsf{T}(\Gamma+o_{\mathbb{P}}(1))u. \tag*{(13)} ℓ n ( K ) ( θ 0 + D n − 1 u ) − ℓ n ( K ) ( θ 0 ) = u T Σ n − 2 1 u T ( Γ + o P ( 1 )) u . (13)
Choose η n ′ → 0 \eta'_n \to0 η n ′ → 0 with P ( ∣ θ ^ n − θ 0 ∣ > η n ′ ) → 0 \mathbb{P}(|\hat{\theta}_n-\theta_0|>\eta'_n)\to0 P ( ∣ θ ^ n − θ 0 ∣ > η n ′ ) → 0 . Evaluating (13) at u n u_n u n and using ℓ n ( K ) ( θ ^ n ) ≥ ℓ n ( K ) ( θ 0 ) − 2 η n − ρ n \ell_n^{(K)}(\hat{\theta}_n)\geq\ell_n^{(K)}(\theta_0)-2\eta_n-\rho_n ℓ n ( K ) ( θ ^ n ) ≥ ℓ n ( K ) ( θ 0 ) − 2 η n − ρ n gives 1 2 u n T ( Γ + o P ( 1 ) ) u n ≤ ∣ u n ∣ ∣ Σ n ∣ + 2 η n + ρ n \frac{1}{2}u_n^{\mathsf{T}}(\Gamma+o_{\mathbb{P}}(1))u_n\leq|u_n||\Sigma_n|+2\eta_n+\rho_n 2 1 u n T ( Γ + o P ( 1 )) u n ≤ ∣ u n ∣∣ Σ n ∣ + 2 η n + ρ n . Hence ∣ u n ∣ = O P ( 1 ) |u_n|=O_{\mathbb{P}}(1) ∣ u n ∣ = O P ( 1 ) . On compact sets of u u u , (13) shows that u n u_n u n is an o P ( 1 ) o_{\mathbb{P}}(1) o P ( 1 ) -maximizer of f n f_n f n . The point Γ − 1 Σ n \Gamma^{-1}\Sigma_n Γ − 1 Σ n is O P ( 1 ) O_{\mathbb{P}}(1) O P ( 1 ) , so it also lies in the region where (13) holds. Strong concavity gives ∣ u − Γ − 1 Σ n ∣ 2 ≤ 2 λ min ( Γ ) − 1 ( max f n − f n ( u ) ) |u-\Gamma^{-1}\Sigma_n|^2\leq2\lambda_{\min}(\Gamma)^{-1}(\max f_n-f_n(u)) ∣ u − Γ − 1 Σ n ∣ 2 ≤ 2 λ m i n ( Γ ) − 1 ( max f n − f n ( u )) , so u n = Γ − 1 Σ n + o P ( 1 ) = Γ − 1 S n + o P ( 1 ) u_n=\Gamma^{-1}\Sigma_n+o_{\mathbb{P}}(1)=\Gamma^{-1}S_n+o_{\mathbb{P}}(1) u n = Γ − 1 Σ n + o P ( 1 ) = Γ − 1 S n + o P ( 1 ) . Lemma D.2 completes the proof of (b). For (c), let K ′ ≥ 1 K'\geq1 K ′ ≥ 1 satisfy n Δ n K ′ + 1 → 0 n\Delta_n^{K'+1}\to0 n Δ n K ′ + 1 → 0 . By Theorem 4, D n ( θ ^ n ( K ′ ) − θ 0 ) = Γ − 1 S n ( K ′ ) + o P ( 1 ) D_n(\hat{\theta}_n^{(K')}-\theta_0)=\Gamma^{-1}S_n^{(K')}+o_{\mathbb{P}}(1) D n ( θ ^ n ( K ′ ) − θ 0 ) = Γ − 1 S n ( K ′ ) + o P ( 1 ) , where S n ( K ′ ) S_n^{(K')} S n ( K ′ ) is the martingale part built from order K ′ K' K ′ . By Lemma D.2, S n ( K ′ ) S_n^{(K')} S n ( K ′ ) and S n S_n S n both differ from the Euler martingale part by o P ( 1 ) o_{\mathbb{P}}(1) o P ( 1 ) . Subtracting the two expansions gives (c).
Proof of Corollary 1. Take K K K as in Theorem 1(a) and let u n u_n u n be bounded. Then ∣ D n − 1 u n ∣ → 0 |D_n^{-1}u_n|\to0 ∣ D n − 1 u n ∣ → 0 , so by part (a) and (13), ℓ n ( θ 0 + D n − 1 u n ) − ℓ n ( θ 0 ) = ℓ n ( K ) ( θ 0 + D n − 1 u n ) − ℓ n ( K ) ( θ 0 ) + o P ( 1 ) = u n T S n − 1 2 u n T Γ u n + o P ( 1 ) \ell_n(\theta_0+D_n^{-1}u_n)-\ell_n(\theta_0)=\ell_n^{(K)}(\theta_0+D_n^{-1}u_n)-\ell_n^{(K)}(\theta_0)+o_{\mathbb{P}}(1)=u_n^{\mathsf{T}}S_n-\frac{1}{2}u_n^{\mathsf{T}}\Gamma u_n+o_{\mathbb{P}}(1) ℓ n ( θ 0 + D n − 1 u n ) − ℓ n ( θ 0 ) = ℓ n ( K ) ( θ 0 + D n − 1 u n ) − ℓ n ( K ) ( θ 0 ) + o P ( 1 ) = u n T S n − 2 1 u n T Γ u n + o P ( 1 ) , and S n → D N ( 0 , Γ ) S_n\xrightarrow{\mathcal{D}}N(0,\Gamma) S n D N ( 0 , Γ ) by Lemma D.2. This is LAN at θ 0 \theta_0 θ 0 with rate matrix D n D_n D n and information Γ \Gamma Γ . By Theorem 1(b,c), the exact MLE and every delta-expansion estimator with n Δ n K ′ + 1 → 0 n\Delta_n^{K'+1}\to0 n Δ n K ′ + 1 → 0 are asymptotically linear in the central sequence S n S_n S n , with influence matrix Γ − 1 \Gamma^{-1} Γ − 1 . In a LAN experiment, estimators of this form are regular by Le Cam’s third lemma, and they attain the bounds of the convolution and local asymptotic minimax theorems. These results hold for LAN experiments with matrix norming such as D n D_n D n ([39 Ch. 6] ; see also Jeganathan [33 ] ).
Proof of Theorem 2(b). We show that sup Θ ∣ ℓ ~ n − ℓ n ∣ → P 0 \sup_{\Theta}|\tilde{\ell}_n-\ell_n|\xrightarrow{\mathbb{P}}0 sup Θ ∣ ℓ ~ n − ℓ n ∣ P 0 under either condition. Fix δ > 0 \delta>0 δ > 0 small, to be chosen below, and work on the intersection E n ′ \mathcal{E}_n' E n ′ of the events { max i ∣ X i ∣ ≤ n δ } \{\max_i|X_i|\leq n^\delta\} { max i ∣ X i ∣ ≤ n δ } , { max i sup α ∣ z i ( α ) ∣ 2 ≤ 2 ( 1 + δ ) m λ max log n } \{\max_i\sup_\alpha|z_i(\alpha)|^2\leq2(1+\delta)m\lambda_{\max}\log n\} { max i sup α ∣ z i ( α ) ∣ 2 ≤ 2 ( 1 + δ ) m λ m a x log n } and Ω n \Omega_n Ω n . Its probability tends to one by Lemma A.2. On E n ′ \mathcal{E}_n' E n ′ we also have max i ∣ X i − X i − 1 ∣ / ε ≤ C log n \max_i|X_i-X_{i-1}|/\varepsilon\leq C\sqrt{\log n} max i ∣ X i − X i − 1 ∣/ ε ≤ C log n , because X i − X i − 1 = ε z i ( α 0 ) + Δ μ ( X i − 1 ; α 0 ) X_i-X_{i-1}=\varepsilon z_i(\alpha_0)+\Delta\mu(X_{i-1};\alpha_0) X i − X i − 1 = ε z i ( α 0 ) + Δ μ ( X i − 1 ; α 0 ) .
Condition (i). Take K K K with K + 1 > 2 ( 1 + m Λ ) / a K+1>2(1+m\Lambda)/a K + 1 > 2 ( 1 + m Λ ) / a , and write p ( K ) = p ( K , Δ ) p^{(K)}=p^{(K,\Delta)} p ( K ) = p ( K , Δ ) . As in the proof of Theorem 1(a), on E n ′ \mathcal{E}_n' E n ′ we have p ( K ) ≥ 3 4 q p^{(K)}\geq\frac{3}{4}q p ( K ) ≥ 4 3 q and 1 / q ≤ C Δ n m / 2 n ( 1 + δ ) m Λ 1/q\leq C\Delta_n^{m/2}n^{(1+\delta)m\Lambda} 1/ q ≤ C Δ n m /2 n ( 1 + δ ) m Λ at every observation and for every θ \theta θ . Hence, by condition (i) and Proposition 1,
∣ p ~ n p ( K ) − 1 ∣ + ∣ p Δ p ( K ) − 1 ∣ ≤ C n r δ ( Δ γ + Δ ( K + 1 ) / 2 ) n ( 1 + δ ) m Λ \left|\frac{\tilde{p}_n}{p^{(K)}}-1\right|+\left|\frac{p_\Delta}{p^{(K)}}-1\right|\leq Cn^{r\delta}\left(\Delta^\gamma+\Delta^{(K+1)/2}\right)n^{(1+\delta)m\Lambda} p ( K ) p ~ n − 1 + p ( K ) p Δ − 1 ≤ C n r δ ( Δ γ + Δ ( K + 1 ) /2 ) n ( 1 + δ ) m Λ
at every observation, uniformly in θ \theta θ . Since Δ n ≤ C n − a \Delta_n\leq Cn^{-a} Δ n ≤ C n − a and both a γ a\gamma aγ and a ( K + 1 ) / 2 a(K+1)/2 a ( K + 1 ) /2 exceed 1 + m Λ 1+m\Lambda 1 + m Λ , the right-hand side is o ( n − 1 ) o(n^{-1}) o ( n − 1 ) for δ \delta δ small. In particular p ~ n > 0 \tilde{p}_n>0 p ~ n > 0 at all observations, and since ∣ log ( 1 + u ) ∣ ≤ 2 ∣ u ∣ |\log(1+u)|\leq2|u| ∣ log ( 1 + u ) ∣ ≤ 2∣ u ∣ for ∣ u ∣ ≤ 1 2 |u|\leq\frac{1}{2} ∣ u ∣ ≤ 2 1 , ∣ log p ~ n − log p Δ ∣ = o ( n − 1 ) |\log\tilde{p}_n-\log p_\Delta|=o(n^{-1}) ∣ log p ~ n − log p Δ ∣ = o ( n − 1 ) at every observation, uniformly in θ \theta θ . Summing over i i i gives sup Θ ∣ ℓ ~ n − ℓ n ∣ → P 0 \sup_{\Theta}|\tilde{\ell}_n-\ell_n|\xrightarrow{\mathbb{P}}0 sup Θ ∣ ℓ ~ n − ℓ n ∣ P 0 .
Condition (ii). On E n ′ \mathcal{E}_n' E n ′ , the right-hand side of condition (ii) is at most C n r δ Δ γ ( log n ) ϱ / 2 Cn^{r\delta}\Delta^\gamma(\log n)^{\varrho/2} C n r δ Δ γ ( log n ) ϱ /2 at every observation, uniformly in θ \theta θ . Summing over i i i gives at most C n 1 + r δ − a γ ( log n ) ϱ / 2 → 0 Cn^{1+r\delta-a\gamma}(\log n)^{\varrho/2}\to0 C n 1 + r δ − aγ ( log n ) ϱ /2 → 0 for δ \delta δ small, because a γ > 1 a\gamma>1 aγ > 1 .
Proof of Theorem 2(a). Take K K K as in Theorem 1(a), so that η n = sup Θ ∣ ℓ n − ℓ n ( K ) ∣ = O P ( 1 ) \eta_n=\sup_{\Theta}|\ell_n-\ell_n^{(K)}|=O_{\mathbb{P}}(1) η n = sup Θ ∣ ℓ n − ℓ n ( K ) ∣ = O P ( 1 ) , and let ρ ~ n = o P ( 1 ) \tilde{\rho}_n=o_{\mathbb{P}}(1) ρ ~ n = o P ( 1 ) be the optimization slack of θ ~ n \tilde{\theta}_n θ ~ n . Write g n = sup Θ ∣ ℓ ~ n − ℓ n ∣ = o P ( n Δ n ) g_n=\sup_{\Theta}|\tilde{\ell}_n-\ell_n|=o_{\mathbb{P}}(n\Delta_n) g n = sup Θ ∣ ℓ ~ n − ℓ n ∣ = o P ( n Δ n ) and h n = sup ∣ θ − θ 0 ∣ ≤ η ∣ ℓ ~ n − ℓ n ∣ = O P ( 1 ) h_n=\sup_{|\theta-\theta_0|\leq\eta}|\tilde{\ell}_n-\ell_n|=O_{\mathbb{P}}(1) h n = sup ∣ θ − θ 0 ∣ ≤ η ∣ ℓ ~ n − ℓ n ∣ = O P ( 1 ) .
Consistency. For every θ \theta θ , ℓ n ( K ) ( θ ~ n ) ≥ ℓ ~ n ( θ ~ n ) − g n − η n ≥ ℓ ~ n ( θ ) − g n − η n − ρ ~ n ≥ ℓ n ( K ) ( θ ) − 2 ( g n + η n ) − ρ ~ n \ell_n^{(K)}(\tilde{\theta}_n)\geq\tilde{\ell}_n(\tilde{\theta}_n)-g_n-\eta_n\geq\tilde{\ell}_n(\theta)-g_n-\eta_n-\tilde{\rho}_n\geq\ell_n^{(K)}(\theta)-2(g_n+\eta_n)-\tilde{\rho}_n ℓ n ( K ) ( θ ~ n ) ≥ ℓ ~ n ( θ ~ n ) − g n − η n ≥ ℓ ~ n ( θ ) − g n − η n − ρ ~ n ≥ ℓ n ( K ) ( θ ) − 2 ( g n + η n ) − ρ ~ n . Hence ℓ n ( K ) ( θ ~ n ) ≥ sup ℓ n ( K ) − o P ( n Δ n ) \ell_n^{(K)}(\tilde{\theta}_n)\geq\sup\ell_n^{(K)}-o_{\mathbb{P}}(n\Delta_n) ℓ n ( K ) ( θ ~ n ) ≥ sup ℓ n ( K ) − o P ( n Δ n ) , and Remark 3 gives θ ~ n → P θ 0 \tilde{\theta}_n\xrightarrow{\mathbb{P}}\theta_0 θ ~ n P θ 0 . Rate and limit. With probability tending to one, θ ~ n \tilde{\theta}_n θ ~ n , θ 0 \theta_0 θ 0 and θ 0 + D n − 1 Γ − 1 Σ n \theta_0+D_n^{-1}\Gamma^{-1}\Sigma_n θ 0 + D n − 1 Γ − 1 Σ n all lie in { ∣ θ − θ 0 ∣ ≤ η } \{|\theta-\theta_0|\le\eta\} { ∣ θ − θ 0 ∣ ≤ η } . For θ \theta θ in this set, the same chain of inequalities with h n h_n h n in place of g n g_n g n gives ℓ n ( K ) ( θ ~ n ) ≥ ℓ n ( K ) ( θ ) − 2 ( h n + η n ) − ρ ~ n \ell_n^{(K)}(\tilde{\theta}_n)\ge\ell_n^{(K)}(\theta)-2(h_n+\eta_n)-\tilde{\rho}_n ℓ n ( K ) ( θ ~ n ) ≥ ℓ n ( K ) ( θ ) − 2 ( h n + η n ) − ρ ~ n . The proof of Theorem 1(b) compares θ ^ n \hat{\theta}_n θ ^ n only with θ 0 \theta_0 θ 0 and with θ 0 + D n − 1 Γ − 1 Σ n \theta_0+D_n^{-1}\Gamma^{-1}\Sigma_n θ 0 + D n − 1 Γ − 1 Σ n . It therefore applies verbatim to θ ~ n \tilde{\theta}_n θ ~ n , with o P ( 1 ) o_{\mathrm{P}}(1) o P ( 1 ) slack, and gives D n ( θ ~ n − θ 0 ) = Γ − 1 S n + o P ( 1 ) D_n(\tilde{\theta}_n-\theta_0)=\Gamma^{-1}S_n+o_{\mathrm{P}}(1) D n ( θ ~ n − θ 0 ) = Γ − 1 S n + o P ( 1 ) . Subtracting the expansion of the exact MLE gives D n ( θ ~ n − θ ^ n ) → P 0 D_n(\tilde{\theta}_n-\hat{\theta}_n)\xrightarrow{\mathrm{P}}0 D n ( θ ~ n − θ ^ n ) P 0 , and efficiency follows as in Corollary 1.
Proof of Corollary 2. (a) Proposition 1 holds for every centering with ∣ μ 0 ( x ; θ ) ∣ ≤ C ⟨ x ⟩ |\mu_0(x;\theta)|\le C\langle x\rangle ∣ μ 0 ( x ; θ ) ∣ ≤ C ⟨ x ⟩ , and it is condition (i) with γ = ( K + 1 ) / 2 \gamma=(K+1)/2 γ = ( K + 1 ) /2 .
(b) For each β \beta β , Y = F ( X ; β ) Y=F(X;\beta) Y = F ( X ; β ) is a diffusion with unit volatility and drift μ Y ( y ; θ ) = ( μ / σ − 1 2 ∂ x σ ) ( F − 1 ( y ; β ) ; θ ) \mu_Y(y;\theta)=(\mu/\sigma-\frac{1}{2}\partial_x\sigma)(F^{-1}(y;\beta);\theta) μ Y ( y ; θ ) = ( μ / σ − 2 1 ∂ x σ ) ( F − 1 ( y ; β ) ; θ ) under P θ P_\theta P θ , and the change-of-variables formula gives p Δ ( x ′ ∣ x ; θ ) = p Y , Δ ( F ( x ′ ; β ) ∣ F ( x ; β ) ; θ ) / σ ( x ′ ; β ) p_\Delta(x'|x;\theta)=p_{Y,\Delta}(F(x';\beta)|F(x;\beta);\theta)/\sigma(x';\beta) p Δ ( x ′ ∣ x ; θ ) = p Y , Δ ( F ( x ′ ; β ) ∣ F ( x ; β ) ; θ ) / σ ( x ′ ; β ) exactly. Hence p ~ n − p Δ = ( p Y L S L − p Y , Δ ) / σ ( x ′ ; β ) \tilde{p}_n-p_\Delta=(p_Y^{\mathrm{LSL}}-p_{Y,\Delta})/\sigma(x';\beta) p ~ n − p Δ = ( p Y LSL − p Y , Δ ) / σ ( x ′ ; β ) , evaluated at y = F ( x ; β ) y=F(x;\beta) y = F ( x ; β ) and y ′ = F ( x ′ ; β ) y'=F(x';\beta) y ′ = F ( x ′ ; β ) . By assumption, p Y L S L p_Y^{\mathrm{LSL}} p Y LSL is the delta expansion of Y Y Y of order 2 K ′ 2K' 2 K ′ with μ 0 = 0 \mu_0=0 μ 0 = 0 , so Proposition 1, applied to Y Y Y with m = 1 m=1 m = 1 , bounds this difference by C ⟨ y ⟩ r Δ K ′ / λ min 1 / 2 C\langle y\rangle^r\Delta^{K'}/\lambda_{\min}^{1/2} C ⟨ y ⟩ r Δ K ′ / λ m i n 1/2 . Since F F F is bi-Lipschitz, ⟨ y ⟩ ≤ C ⟨ x ⟩ \langle y\rangle\le C\langle x\rangle ⟨ y ⟩ ≤ C ⟨ x ⟩ . This is condition (i) with γ = K ′ + 1 2 = ( 2 K ′ + 1 ) / 2 \gamma=K'+\frac{1}{2}=(2K'+1)/2 γ = K ′ + 2 1 = ( 2 K ′ + 1 ) /2 and m = 1 m=1 m = 1 , and γ > ( 1 + Λ ) / a \gamma>(1+\Lambda)/a γ > ( 1 + Λ ) / a is the stated condition on K ′ K' K ′ .
Proof of Theorem 5
Write U n = D n ( θ ~ n − θ 0 ) U_n=D_n(\tilde{\theta}_n-\theta_0) U n = D n ( θ ~ n − θ 0 ) for θ ~ n ∈ { θ ^ n , θ ^ n ( K ) } \tilde{\theta}_n\in\{\hat{\theta}_n,\hat{\theta}_n^{(K)}\} θ ~ n ∈ { θ ^ n , θ ^ n ( K ) } . Since U n → d N U_n\xrightarrow{d}N U n d N by Theorem 1(b) and Corollary 3(a), it suffices to show that sup n E ∣ U n ∣ p < ∞ \sup_n\mathbb{E}|U_n|^p<\infty sup n E ∣ U n ∣ p < ∞ for every p p p , because uniform integrability of f ( U n ) f(U_n) f ( U n ) follows. Because Θ \Theta Θ is bounded, ∣ U n ∣ ≤ C n |U_n|\le C\sqrt{n} ∣ U n ∣ ≤ C n always. It is therefore enough to find, for every L > 0 L>0 L > 0 , events E n \mathcal{E}_n E n with P ( E n ) = O ( n − L ) P(\mathcal{E}_n)=O(n^{-L}) P ( E n ) = O ( n − L ) on which ∣ U n ∣ ≤ C ( 1 + ∣ Σ n ∣ ) |U_n|\le C(1+|\Sigma_n|) ∣ U n ∣ ≤ C ( 1 + ∣ Σ n ∣ ) , where Σ n \Sigma_n Σ n is a normalized score with sup n E ∣ Σ n ∣ p < ∞ \sup_n\mathbb{E}|\Sigma_n|^p<\infty sup n E ∣ Σ n ∣ p < ∞ . Then E ∣ U n ∣ p ≤ C E ( 1 + ∣ Σ n ∣ ) p + C n p / 2 − L \mathbb{E}|U_n|^p\le C\mathbb{E}(1+|\Sigma_n|)^p+Cn^{p/2-L} E ∣ U n ∣ p ≤ C E ( 1 + ∣ Σ n ∣ ) p + C n p /2 − L , which is bounded for L ≥ p / 2 L\ge p/2 L ≥ p /2 . We say that an event holds with overwhelming probability (w.o.p.) if its complement has probability O ( n − L ) O(n^{-L}) O ( n − L ) for every L L L .
Step 1: polynomial deviation bounds. We show that each convergence in probability used in Appendices A–D has a version with overwhelming probability. Three tools suffice.
(T1) Martingales. By Burkholder’s inequality and the Sobolev argument in the proof of Lemma A.6 , normalized martingale sums with weighted increments satisfy
E sup θ ∣ n − 1 / 2 M n ( θ ) ∣ p ≤ C p for every p . \mathbb{E}\sup_{\theta}\left|n^{-1/2}M_n(\theta)\right|^p\le C_p \qquad\text{for every }p. E θ sup n − 1/2 M n ( θ ) p ≤ C p for every p .
(T2) Ergodic averages. For g ( x ; ϑ ) g(x;\vartheta) g ( x ; ϑ ) with ∣ g ∣ + ∣ ∇ x g ∣ + ∣ ∂ ϑ g ∣ + ∣ ∇ x ∂ ϑ g ∣ ≤ C ⟨ x ⟩ r |g|+|\nabla_xg|+|\partial_\vartheta g|+|\nabla_x\partial_\vartheta g|\le C\langle x\rangle^r ∣ g ∣ + ∣ ∇ x g ∣ + ∣ ∂ ϑ g ∣ + ∣ ∇ x ∂ ϑ g ∣ ≤ C ⟨ x ⟩ r , Assumption H5 applied to g ( ⋅ ; ϑ ) g(\cdot;\vartheta) g ( ⋅ ; ϑ ) and ∂ ϑ g ( ⋅ ; ϑ ) \partial_\vartheta g(\cdot;\vartheta) ∂ ϑ g ( ⋅ ; ϑ ) , the discretization bound in the proof of Lemma A.4 taken in L p L^p L p , and the Sobolev embedding in ϑ \vartheta ϑ give
E sup ϑ ∣ n − 1 ∑ i g ( X i − 1 ; ϑ ) − ∫ g d π ∣ p ≤ C p ( ( n Δ n ) − p / 2 + Δ n p / 2 ) . \mathbb{E}\sup_{\vartheta}\left|n^{-1}\sum_i g(X_{i-1};\vartheta)-\int g\,d\pi\right|^p\le C_p\left((n\Delta_n)^{-p/2}+\Delta_n^{p/2}\right). E ϑ sup n − 1 i ∑ g ( X i − 1 ; ϑ ) − ∫ g d π p ≤ C p ( ( n Δ n ) − p /2 + Δ n p /2 ) .
(T3) Remainders. Terms bounded by ε c \varepsilon^c ε c times an average of ⟨ X i − 1 ⟩ r ( 1 + sup α ∣ z i ( α ) ∣ r ) \langle X_{i-1}\rangle^r(1+\sup_\alpha|z_i(\alpha)|^r) ⟨ X i − 1 ⟩ r ( 1 + sup α ∣ z i ( α ) ∣ r ) have L p L^p L p norms O ( ε c ) O(\varepsilon^c) O ( ε c ) by Lemma A.3 (d) and Assumption H3(ii). Terms bounded by powers of ε n r 0 log n \varepsilon n^{r_0}\log n ε n r 0 log n are controlled on the events of Lemma A.2(a,c), which hold with overwhelming probability when c = c ( L ) c=c(L) c = c ( L ) is large in part (c).
Because Δ n ≤ C n − a \Delta_n\le Cn^{-a} Δ n ≤ C n − a and n Δ n ≥ c n 1 − a 1 n\Delta_n\ge cn^{1-a_1} n Δ n ≥ c n 1 − a 1 , every bound in (T1)–(T3) is polynomially small, and Markov’s inequality with p p p large turns it into a statement with overwhelming probability. Lemma by lemma:
Lemma A.2(d), and hence Ω n \Omega_n Ω n : (T3).
Lemma A.4: (T2).
Lemma A.5: the replacement of z i ( α ′ ) z_i(\alpha') z i ( α ′ ) by z i z_i z i and the error in the conditional mean are (T3); the martingale part is (T1); the average of f ˉ ( X i − 1 ; ϑ ) \bar{f}(X_{i-1};\vartheta) f ˉ ( X i − 1 ; ϑ ) is (T2), applied to f ˉ \bar{f} f ˉ and ∂ ϑ f ˉ \partial_\vartheta\bar{f} ∂ ϑ f ˉ , which have polynomially bounded x x x -gradients. In our applications f f f is smooth in ϑ \vartheta ϑ , so the Sobolev argument replaces the η \eta η -net.
Lemma A.6: (T1), plus Lemma A.3(b) for the drift term.
Lemma D.3: a combination of Lemmas A.5 and A.6 and O ( ε ) O(\varepsilon) O ( ε ) remainders of type (T3); the limit H \mathbb{H} H is deterministic and uniformly continuous, so no further probability bound is needed.
Consequently, every statement “sup θ ∣ A n ( θ ) ∣ ⟶ P 0 \sup_\theta|A_n(\theta)| \mathrel{\overset{\mathbb{P}}{\longrightarrow}} 0 sup θ ∣ A n ( θ ) ∣ ⟶ P 0 ” used in the proofs of Theorems 3–1 holds in the form “sup θ ∣ A n ( θ ) ∣ ≤ η \sup_\theta|A_n(\theta)| \leq\eta sup θ ∣ A n ( θ ) ∣ ≤ η with overwhelming probability” for every fixed η > 0 \eta> 0 η > 0 . The lower bound on Δ n \Delta_n Δ n enters only here, but Steps 2–4 rely on it through this step.
Step 2: consistency with overwhelming probability. The proof of Theorem 3 uses only uniform laws of large numbers and Ω n \Omega_n Ω n , so for every η > 0 \eta> 0 η > 0 , ∣ θ ^ n ( K ) − θ 0 ∣ ≤ η |\hat{\theta}_n^{(K)}-\theta_0| \leq\eta ∣ θ ^ n ( K ) − θ 0 ∣ ≤ η w.o.p. For the exact MLE, fix L L L , take c = c ( L ) c=c(L) c = c ( L ) in Lemma A.2(c), and choose K L K_L K L so large that the proof of Theorem 1(a), with c log n c\log n c log n in place of 2 ( 1 + δ ) m λ max log n 2(1+\delta)m\lambda_{\max}\log n 2 ( 1 + δ ) m λ m a x log n , gives sup θ ∣ ℓ n − ℓ n ( K L ) ∣ ≤ 1 \sup_\theta|\ell_n-\ell_n^{(K_L)}| \leq1 sup θ ∣ ℓ n − ℓ n ( K L ) ∣ ≤ 1 outside an event of probability O ( n − L ) O(n^{-L}) O ( n − L ) . Remark 3 with η n = 2 \eta_n=2 η n = 2 then gives ∣ θ ^ n − θ 0 ∣ ≤ η |\hat{\theta}_n-\theta_0| \leq\eta ∣ θ ^ n − θ 0 ∣ ≤ η outside an event of probability O ( n − L ) O(n^{-L}) O ( n − L ) .
Step 3: the bound on U n U_n U n . Let K ∗ = K K^*=K K ∗ = K for the delta-expansion estimator and K ∗ = K L K^*=K_L K ∗ = K L for the exact MLE, let s ~ i \tilde{s}_i s ~ i be as in Lemma D.1 for the contrast ℓ n ( K ∗ ) \ell_n^{(K^*)} ℓ n ( K ∗ ) , with r n = c ( L ) log n r_n=\sqrt{c(L)}\log n r n = c ( L ) log n , let Σ n = D n − 1 ∑ i s ~ i \Sigma_n=D_n^{-1}\sum_i\tilde{s}_i Σ n = D n − 1 ∑ i s ~ i , which equals the normalized score D n − 1 ∂ θ ℓ n ( K ∗ ) ( θ 0 ) D_n^{-1}\partial_\theta\ell_n^{(K^*)}(\theta_0) D n − 1 ∂ θ ℓ n ( K ∗ ) ( θ 0 ) on the event E n E_n E n defined below, and let λ Γ \lambda_\Gamma λ Γ be the smallest eigenvalue of Γ \Gamma Γ . By Lemma D.3, continuity of H \mathbb{H} H and Step 1, there is η > 0 \eta>0 η > 0 such that sup ∣ θ − θ 0 ∣ ≤ η ∣ H n ( θ ) + Γ ∣ ≤ λ Γ / 4 \sup_{|\theta-\theta_0|\leq\eta}|\mathbb{H}_n(\theta)+\Gamma|\leq\lambda_\Gamma/4 sup ∣ θ − θ 0 ∣ ≤ η ∣ H n ( θ ) + Γ∣ ≤ λ Γ /4 w.o.p. Let E n E_n E n be the intersection of this event with the events of Step 2 and Lemma A.2 used above, and with { s ~ i = s i for all i } \{\tilde{s}_i=s_i\text{ for all }i\} { s ~ i = s i for all i } . The exponent δ 0 \delta_0 δ 0 in G i \mathcal{G}_i G i is fixed as in Appendix D, independently of L L L ; the moment order in Lemma A.2(a) is then taken large relative to L / δ 0 L/\delta_0 L / δ 0 , so that P ( ⋂ i G i ) = 1 − O ( n − L ) \mathbb{P}(\bigcap_i\mathcal{G}_i)=1-O(n^{-L}) P ( ⋂ i G i ) = 1 − O ( n − L ) , while ε n r n δ 0 r n → 0 \varepsilon n r_n^{\delta_0}r_n\to0 ε n r n δ 0 r n → 0 for each fixed L L L . On E n E_n E n :
for θ ~ n = θ ^ n ( K ) \tilde{\theta}_n=\hat{\theta}_n^{(K)} θ ~ n = θ ^ n ( K ) , which is then an interior critical point, the Taylor expansion of the proof of Theorem 4 gives ∣ U n ∣ ≤ ( 4 / ( 3 λ Γ ) ) ∣ Σ n ∣ |U_n|\leq(4/(3\lambda_\Gamma))|\Sigma_n| ∣ U n ∣ ≤ ( 4/ ( 3 λ Γ )) ∣ Σ n ∣ ;
for θ ~ n = θ ^ n \tilde{\theta}_n=\hat{\theta}_n θ ~ n = θ ^ n , the inequality ℓ n ( K ∗ ) ( θ ^ n ) ≥ ℓ n ( K ∗ ) ( θ 0 ) − 2 \ell_n^{(K^*)}(\hat{\theta}_n)\geq\ell_n^{(K^*)}(\theta_0)-2 ℓ n ( K ∗ ) ( θ ^ n ) ≥ ℓ n ( K ∗ ) ( θ 0 ) − 2 and the Taylor expansion of ℓ n ( K ∗ ) \ell_n^{(K^*)} ℓ n ( K ∗ ) around θ 0 \theta_0 θ 0 give U n T Σ n − 3 8 λ Γ ∣ U n ∣ 2 ≥ − 2 U_n^\mathsf{T}\Sigma_n-\frac{3}{8}\lambda_\Gamma|U_n|^2\geq-2 U n T Σ n − 8 3 λ Γ ∣ U n ∣ 2 ≥ − 2 , hence ∣ U n ∣ ≤ C ( 1 + ∣ Σ n ∣ ) |U_n|\leq C(1+|\Sigma_n|) ∣ U n ∣ ≤ C ( 1 + ∣ Σ n ∣ ) .
Step 4: moments of the score. Write Σ n = S n + D n − 1 ∑ i E [ s ~ i ∣ F i − 1 ] \Sigma_n=S_n+D_n^{-1}\sum_i\mathbb{E}[\tilde{s}_i\mid\mathcal{F}_{i-1}] Σ n = S n + D n − 1 ∑ i E [ s ~ i ∣ F i − 1 ] , which holds on the whole probability space. Burkholder’s inequality and the conditional moment bounds in the proof of Lemma D.2 give E ∣ S n ∣ p ≤ C p \mathbb{E}|S_n|^p\leq C_p E ∣ S n ∣ p ≤ C p . By Lemma D.1, in the form valid on the whole space, the compensator is bounded by C ξ n n − 1 ∑ i ( X i − 1 ) r + C C\xi_n n^{-1}\sum_i(X_{i-1})^r+C C ξ n n − 1 ∑ i ( X i − 1 ) r + C , whose moments are bounded because ξ n → 0 \xi_n\to0 ξ n → 0 . Hence sup n E ∣ Σ n ∣ p < ∞ \sup_n\mathbb{E}|\Sigma_n|^p<\infty sup n E ∣ Σ n ∣ p < ∞ . □
The argument does not need a polynomial-type large deviation inequality for the contrast, as in the quasi-likelihood analysis of Yoshida [56 ] , because the parameter space is compact and the tail events are controlled directly. The price is the two-sided polynomial condition on Δ n \Delta_n Δ n and Assumption H5.
Two extensions follow from the same argument, and we note them without stating them formally. First, Step 3 for the delta-expansion estimator and Step 4 apply equally to the Euler estimator, K = 0 K = 0 K = 0 , under n Δ n 2 → 0 n\Delta_n^2 \to0 n Δ n 2 → 0 , by the case K = 0 K = 0 K = 0 of Theorem 4 . Second, Steps 2 and 3 for θ ^ n \hat{\theta}_n θ ^ n use only ℓ n ( θ ^ n ) ≥ sup Θ ℓ n \ell_n(\hat{\theta}_n) \ge\sup_{\Theta}\ell_n ℓ n ( θ ^ n ) ≥ sup Θ ℓ n to obtain ℓ n ( K L ) ( θ ^ n ) ≥ sup Θ ℓ n ( K L ) − 2 \ell_n^{(\mathrm{KL})}(\hat{\theta}_n) \ge\sup_{\Theta}\ell_n^{(\mathrm{KL})} - 2 ℓ n ( KL ) ( θ ^ n ) ≥ sup Θ ℓ n ( KL ) − 2 . They therefore also apply to a near-maximizer whose slack ρ n \rho_n ρ n satisfies P ( ρ n > C ) = O ( n − L ) \mathbb{P}(\rho_n > C) = O(n^{-L}) P ( ρ n > C ) = O ( n − L ) for every L L L , with the constant 2 replaced by 2 + C 2 + C 2 + C , such as a maximizer computed to a fixed numerical tolerance.
Proofs for Section 4.6
The proof of Proposition 2 has three steps. We rescale the process around its starting point, so that its coefficients become bounded near the origin, uniformly in the starting point and the parameter (Lemma G.1). We then observe that the delta expansion is equivariant under this rescaling, so that Proposition 1 can be applied to a modified process with globally bounded coefficients. Finally, we show that the modification changes the density only by an exponentially small amount (Lemmas G.2 –G.4 ). Throughout this appendix, Assumption H6 holds. Fix x x x and θ \theta θ , and write ϖ = ⟨ x ⟩ \varpi= \langle x\rangle ϖ = ⟨ x ⟩ for the local scale. All constants are independent of x x x , θ \theta θ and Δ \Delta Δ .
Lemma G.1 (rescaled coefficients). Let Y t = ( X t − x ) / ϖ Y_t = (X_t - x)/\varpi Y t = ( X t − x ) / ϖ , with X 0 = x X_0 = x X 0 = x . Then Y 0 = 0 Y_0 = 0 Y 0 = 0 and d Y t = μ ˉ ( Y t ) d t + σ ˉ ( Y t ) d W t dY_t = \bar{\mu}(Y_t)\,dt + \bar{\sigma}(Y_t)\,dW_t d Y t = μ ˉ ( Y t ) d t + σ ˉ ( Y t ) d W t , where
μ ˉ ( y ) = ϖ − 1 μ ( x + ϖ y ; α ) , σ ˉ ( y ) = ϖ − 1 σ ( x + ϖ y ; β ) . \bar{\mu}(y) = \varpi^{-1}\mu(x + \varpi y; \alpha), \qquad\bar{\sigma}(y) = \varpi^{-1}\sigma(x + \varpi y; \beta). μ ˉ ( y ) = ϖ − 1 μ ( x + ϖ y ; α ) , σ ˉ ( y ) = ϖ − 1 σ ( x + ϖ y ; β ) .
For ∣ y ∣ ≤ 1 2 |y| \le\frac{1}{2} ∣ y ∣ ≤ 2 1 and all multi-indices a a a (in y y y ) and b b b (in θ \theta θ ), ∣ ∂ y a ∂ θ b μ ˉ ( y ) ∣ + ∣ ∂ y a ∂ θ b σ ˉ ( y ) ∣ ≤ C a , b |\partial_y^a\partial_\theta^b\bar{\mu}(y)| + |\partial_y^a\partial_\theta^b\bar{\sigma}(y)| \le C_{a,b} ∣ ∂ y a ∂ θ b μ ˉ ( y ) ∣ + ∣ ∂ y a ∂ θ b σ ˉ ( y ) ∣ ≤ C a , b , and 1 4 λ min I ≤ σ ˉ σ ˉ T ( y ) ≤ 9 4 λ max I \frac{1}{4}\lambda_{\min} I \le\bar{\sigma}\bar{\sigma}^{\mathsf{T}}(y) \le\frac{9}{4}\lambda_{\max} I 4 1 λ m i n I ≤ σ ˉ σ ˉ T ( y ) ≤ 4 9 λ m a x I , with constants that do not depend on x x x or θ \theta θ .
Proof. For ∣ y ∣ ≤ 1 2 |y| \le\frac{1}{2} ∣ y ∣ ≤ 2 1 , the triangle inequality for ⟨ ⋅ ⟩ \langle\cdot\rangle ⟨ ⋅ ⟩ gives 1 2 ϖ ≤ ⟨ x + ϖ y ⟩ ≤ 3 2 ϖ \frac{1}{2}\varpi\le\langle x + \varpi y\rangle\le\frac{3}{2}\varpi 2 1 ϖ ≤ ⟨ x + ϖ y ⟩ ≤ 2 3 ϖ . By the chain rule and Assumption H6, ∣ ∂ y a ∂ θ b μ ˉ ( y ) ∣ = ϖ ∣ a ∣ − 1 ∣ ∂ x a ∂ θ b μ ( x + ϖ y ; α ) ∣ ≤ C a , b ϖ ∣ a ∣ − 1 ⟨ x + ϖ y ⟩ 1 − ∣ a ∣ ≤ C a , b ′ |\partial_y^a\partial_\theta^b\bar{\mu}(y)| = \varpi^{|a|-1}|\partial_x^a\partial_\theta^b\mu(x + \varpi y; \alpha)| \le C_{a,b}\varpi^{|a|-1}\langle x + \varpi y\rangle^{1-|a|} \le C'_{a,b} ∣ ∂ y a ∂ θ b μ ˉ ( y ) ∣ = ϖ ∣ a ∣ − 1 ∣ ∂ x a ∂ θ b μ ( x + ϖ y ; α ) ∣ ≤ C a , b ϖ ∣ a ∣ − 1 ⟨ x + ϖ y ⟩ 1 − ∣ a ∣ ≤ C a , b ′ , and the same holds for σ ˉ \bar{\sigma} σ ˉ . The ellipticity bounds follow from λ min ⟨ x + ϖ y ⟩ 2 ≤ ν ≤ λ max ⟨ x + ϖ y ⟩ 2 \lambda_{\min}\langle x + \varpi y\rangle^2 \le\nu\le\lambda_{\max}\langle x + \varpi y\rangle^2 λ m i n ⟨ x + ϖ y ⟩ 2 ≤ ν ≤ λ m a x ⟨ x + ϖ y ⟩ 2 .
The lemma is where the derivative bounds of Assumption H6 are used: each derivative of a coefficient loses one power of the local scale, and the rescaling restores it.
The localized process. Let Π : R m → R m \Pi: \mathbb{R}^m \to\mathbb{R}^m Π : R m → R m be a fixed smooth map with bounded derivatives, Π ( y ) = y \Pi(y) = y Π ( y ) = y for ∣ y ∣ ≤ 1 4 |y| \le\frac{1}{4} ∣ y ∣ ≤ 4 1 and ∣ Π ( y ) ∣ ≤ 1 2 |\Pi(y)| \le\frac{1}{2} ∣Π ( y ) ∣ ≤ 2 1 for all y y y . Let Y ~ \widetilde{Y} Y solve d Y ~ t = μ ~ ( Y ~ t ) d t + σ ~ ( Y ~ t ) d W t d\widetilde{Y}_t = \widetilde{\mu}(\widetilde{Y}_t)\,dt + \widetilde{\sigma}(\widetilde{Y}_t)\,dW_t d Y t = μ ( Y t ) d t + σ ( Y t ) d W t , Y ~ 0 = 0 \widetilde{Y}_0 = 0 Y 0 = 0 , with μ ~ = μ ˉ ∘ Π \widetilde{\mu} = \bar{\mu}\circ\Pi μ = μ ˉ ∘ Π and σ ~ = σ ˉ ∘ Π \widetilde{\sigma} = \bar{\sigma}\circ\Pi σ = σ ˉ ∘ Π . By Lemma G.1, Y ~ \widetilde{Y} Y satisfies Assumptions H1 and H2, with constants that do not depend on x x x or θ \theta θ , and its coefficients agree with those of Y Y Y on D = { ∣ y ∣ < 1 4 } D = \{|y| < \frac{1}{4}\} D = { ∣ y ∣ < 4 1 } .
Equivariance of the expansion. The delta expansion of X X X from x x x with centering μ 0 \mu_0 μ 0 and the delta expansion of Y ~ \widetilde{Y} Y from 0 with centering μ 0 / ϖ \mu_0/\varpi μ 0 / ϖ satisfy
p X ( K , Δ ) ( x ′ ∣ x ) = ϖ − m p Y ~ ( K , Δ ) ( ( x ′ − x ) / ϖ ∣ 0 ) . (14) p_X^{(K,\Delta)}(x' \mid x) = \varpi^{-m}p_{\widetilde{Y}}^{(K,\Delta)}\left((x' - x)/\varpi\mid0\right). \tag*{(14)} p X ( K , Δ ) ( x ′ ∣ x ) = ϖ − m p Y ( K , Δ ) ( ( x ′ − x ) / ϖ ∣ 0 ) . (14)
To see this, note that the Gaussian kernels satisfy F X = ϖ − m F Y ~ F_X = \varpi^{-m}F_{\widetilde{Y}} F X = ϖ − m F Y under y ↦ x + ϖ y y \mapsto x + \varpi y y ↦ x + ϖ y , and that the generator of X X X becomes the generator of Y Y Y . Hence P J P_J P J of Appendix § 10 transforms in the same way, for every J J J , and so does its regrouping by powers of Δ 1 / 2 \Delta^{1/2} Δ 1/2 . Moreover, P J P_J P J at the starting point involves only the derivatives of the coefficients at the starting point (Lemma B.1 ), and Y ~ \widetilde{Y} Y and Y Y Y have the same derivatives at 0. The same change of variables gives p Δ , X ( x ′ ∣ x ) = ϖ − m p Δ , Y ( ( x ′ − x ) / ϖ ∣ 0 ) p_{\Delta,X}(x' \mid x) = \varpi^{-m}p_{\Delta,Y}((x' - x)/\varpi\mid0) p Δ , X ( x ′ ∣ x ) = ϖ − m p Δ , Y (( x ′ − x ) / ϖ ∣ 0 ) . A by-product of (14) is that the coefficients w N , h ( x ) w_{N,h}(x) w N , h ( x ) of X X X equal ϖ ∣ h ∣ \varpi^{|h|} ϖ ∣ h ∣ times those of Y ~ \widetilde{Y} Y . So, as polynomials in z ~ = z / ϖ \tilde{z}=z/\varpi z ~ = z / ϖ , the corrections C k C_k C k have coefficients that are bounded uniformly in x x x , together with their θ \theta θ -derivatives.
It remains to compare the densities of Y Y Y and Y ~ \widetilde{Y} Y near the origin. They differ only through paths that leave D D D , and the next lemma shows that this is exponentially unlikely, uniformly in the starting point.
Lemma G.2 (exit from the localization region). Let τ D = inf { t ≥ 0 : Y t ∉ D } \tau_D=\inf\{t\ge0:Y_t\notin D\} τ D = inf { t ≥ 0 : Y t ∈ / D } . There is c > 0 c>0 c > 0 , depending only on the constants in Assumption H6, such that P ( τ D ≤ t ) ≤ 2 m e − c / t \mathbb{P}(\tau_D\le t)\le2m e^{-c/t} P ( τ D ≤ t ) ≤ 2 m e − c / t for all t ∈ ( 0 , 1 ] t\in(0,1] t ∈ ( 0 , 1 ] , x x x and θ \theta θ . The same bound holds for the exit time of Y ~ \widetilde{Y} Y , which coincides with τ D \tau_D τ D .
Proof. By Lemma G.1, ∣ μ ˉ ∣ ≤ C 0 |\bar{\mu}|\le C_0 ∣ μ ˉ ∣ ≤ C 0 and σ ˉ σ ˉ T ≤ 9 4 λ max I \bar{\sigma}\bar{\sigma}^{\mathsf T}\le\frac{9}{4}\lambda_{\max}I σ ˉ σ ˉ T ≤ 4 9 λ m a x I on D D D . Let t 0 = 1 / ( 8 C 0 ) t_0=1/(8C_0) t 0 = 1/ ( 8 C 0 ) . For t ≤ t 0 t\le t_0 t ≤ t 0 , the drift moves Y Y Y by at most 1 8 \frac{1}{8} 8 1 before τ D ∧ t \tau_D\wedge t τ D ∧ t , so on { τ D ≤ t } \{\tau_D\le t\} { τ D ≤ t } the stopped martingale M u = ∫ 0 u ∧ τ D σ ˉ ( Y v ) d W v M_u=\int_0^{u\wedge\tau_D}\bar{\sigma}(Y_v)\,dW_v M u = ∫ 0 u ∧ τ D σ ˉ ( Y v ) d W v satisfies sup u ≤ t ∣ M u ∣ ≥ 1 8 \sup_{u\le t}|M_u|\ge\frac{1}{8} sup u ≤ t ∣ M u ∣ ≥ 8 1 , and hence some coordinate exceeds 1 / ( 8 m ) 1/(8\sqrt{m}) 1/ ( 8 m ) . Each coordinate has quadratic variation at most 9 4 λ max t \frac{9}{4}\lambda_{\max}t 4 9 λ m a x t , so the exponential inequality for continuous martingales gives
P ( τ D ≤ t ) ≤ 2 m exp { − 1 288 m λ max t } . \mathbb{P}(\tau_D\le t)\le2m\exp\left\{-\frac{1}{288m\lambda_{\max}t}\right\}. P ( τ D ≤ t ) ≤ 2 m exp { − 288 m λ m a x t 1 } .
For t ∈ ( t 0 , 1 ] t\in(t_0,1] t ∈ ( t 0 , 1 ] , the bound holds trivially after decreasing c c c . Since Y Y Y and Y ~ \widetilde{Y} Y are driven by the same Brownian motion and have the same coefficients on D D D , pathwise uniqueness gives Y t = Y ~ t Y_t=\widetilde{Y}_t Y t = Y t for t ≤ τ D t\le\tau_D t ≤ τ D , so the two exit times coincide. □ \square □
Lemma G.3 (the excursion measure). For Borel sets A ⊂ D A\subset D A ⊂ D let ρ t ( A ) = P ( Y t ∈ A , τ D ≤ t ) \rho_t(A)=\mathbb{P}(Y_t\in A,\tau_D\le t) ρ t ( A ) = P ( Y t ∈ A , τ D ≤ t ) for t > 0 t>0 t > 0 , and ρ t = 0 \rho_t=0 ρ t = 0 for t ≤ 0 t\le0 t ≤ 0 ; define ρ ~ t \widetilde{\rho}_t ρ t in the same way with Y ~ \widetilde{Y} Y . Then:
(a) P ( Y t ∈ A ) − P ( Y ~ t ∈ A ) = ρ t ( A ) − ρ ~ t ( A ) \mathbb{P}(Y_t\in A)-\mathbb{P}(\widetilde{Y}_t\in A)=\rho_t(A)-\widetilde{\rho}_t(A) P ( Y t ∈ A ) − P ( Y t ∈ A ) = ρ t ( A ) − ρ t ( A ) for all Borel A ⊂ D A\subset D A ⊂ D and t > 0 t>0 t > 0 ;
(b) ρ \rho ρ solves ∂ t ρ = A Y ∗ ρ \partial_t\rho=A_Y^*\rho ∂ t ρ = A Y ∗ ρ in the sense of distributions on D × R D\times\mathbb{R} D × R , where A Y A_Y A Y is the generator of Y Y Y , and the same holds for ρ ~ \widetilde{\rho} ρ ;
(c) ρ \rho ρ and ρ ~ \widetilde{\rho} ρ have smooth, nonnegative densities on D × R D\times\mathbb{R} D × R , with ∫ D ρ ( t , y ) d y ≤ 2 m e − c / t \int_D\rho(t,y)\,dy\le2m e^{-c/t} ∫ D ρ ( t , y ) d y ≤ 2 m e − c / t for t ∈ ( 0 , 1 ] t\in(0,1] t ∈ ( 0 , 1 ] and ∫ D ρ ( t , y ) d y ≤ 1 \int_D\rho(t,y)\,dy\le1 ∫ D ρ ( t , y ) d y ≤ 1 for all t > 0 t>0 t > 0 , and likewise for ρ ~ \widetilde{\rho} ρ .
Proof. (a) Since Y t = Y ~ t Y_t=\widetilde{Y}_t Y t = Y t on { t < τ D } \{t<\tau_D\} { t < τ D } by Lemma G.2, P ( Y t ∈ A , τ D > t ) = P ( Y ~ t ∈ A , τ D > t ) \mathbb{P}(Y_t\in A,\tau_D>t)=\mathbb{P}(\widetilde{Y}_t\in A,\tau_D>t) P ( Y t ∈ A , τ D > t ) = P ( Y t ∈ A , τ D > t ) , and (a) follows. (b) For φ ∈ C c ∞ ( D × ( 0 , ∞ ) ) \varphi\in C^\infty_c(D\times(0,\infty)) φ ∈ C c ∞ ( D × ( 0 , ∞ )) , φ ( u , Y u ) = 0 \varphi(u,Y_u)=0 φ ( u , Y u ) = 0 whenever Y u ∉ D Y_u\notin D Y u ∈ / D , in particular at u = τ D u=\tau_D u = τ D . Itô’s formula applied between t ∧ τ D t\wedge\tau_D t ∧ τ D and t t t therefore gives
E [ φ ( t , Y t ) 1 { τ D ≤ t } ] = ∫ 0 t E [ ( ∂ u + A Y ) φ ( u , Y u ) 1 { τ D ≤ u } ] d u . \mathbb{E}[\varphi(t,Y_t)1_{\{\tau_D\le t\}}]=\int_0^t\mathbb{E}[(\partial_u+A_Y)\varphi(u,Y_u)1_{\{\tau_D\le u\}}]\,du. E [ φ ( t , Y t ) 1 { τ D ≤ t } ] = ∫ 0 t E [( ∂ u + A Y ) φ ( u , Y u ) 1 { τ D ≤ u } ] d u .
Taking t t t beyond the time support of φ \varphi φ , so that φ ( t , ⋅ ) = 0 \varphi(t,\cdot)=0 φ ( t , ⋅ ) = 0 , yields
∫ 0 ∞ ρ u ( ( ∂ u + A Y ) φ ( u , ⋅ ) ) d u = 0. \int_0^\infty\rho_u((\partial_u+A_Y)\varphi(u,\cdot))\,du=0. ∫ 0 ∞ ρ u (( ∂ u + A Y ) φ ( u , ⋅ )) d u = 0.
For φ ∈ C c ∞ ( D × R ) \varphi\in C^\infty_c(D\times\mathbb{R}) φ ∈ C c ∞ ( D × R ) whose support meets { t = 0 } \{t=0\} { t = 0 } , apply this to φ ( u , y ) χ ( u / t 0 ) \varphi(u,y)\chi(u/t_0) φ ( u , y ) χ ( u / t 0 ) , where χ \chi χ is smooth, vanishes on ( − ∞ , 1 2 ] (-\infty,\frac{1}{2}] ( − ∞ , 2 1 ] and equals one on [ 1 , ∞ ) [1,\infty) [ 1 , ∞ ) . The extra term is ∫ ρ u ( φ ( u , ⋅ ) ) t 0 − 1 χ ′ ( u / t 0 ) d u \int\rho_u(\varphi(u,\cdot))t_0^{-1}\chi'(u/t_0)\,du ∫ ρ u ( φ ( u , ⋅ )) t 0 − 1 χ ′ ( u / t 0 ) d u , which is at most C sup u ≤ t 0 ρ u ( D ) ≤ 2 m C e − c / t 0 C\sup_{u\le t_0}\rho_u(D)\le2mCe^{-c/t_0} C sup u ≤ t 0 ρ u ( D ) ≤ 2 m C e − c / t 0 by Lemma G.2, and the remaining terms converge as t 0 ↓ 0 t_0\downarrow0 t 0 ↓ 0 by dominated convergence. Since ρ u = 0 \rho_u=0 ρ u = 0 for u ≤ 0 u\le0 u ≤ 0 , this gives the identity for all φ ∈ C c ∞ ( D × R ) . \varphi\in C^\infty_c(D\times\mathbb{R}). φ ∈ C c ∞ ( D × R ) . (c) In D D D , A Y ∗ u = ∂ i ( 1 2 a i j ∂ j u − ( 1 2 ∂ j a i j − μ ˉ i ) u ) A_Y^*u=\partial_i(\frac12 a_{ij}\partial_j u-(\frac12\partial_j a_{ij}-\bar{\mu}_i)u) A Y ∗ u = ∂ i ( 2 1 a ij ∂ j u − ( 2 1 ∂ j a ij − μ ˉ i ) u ) , with a = σ ˉ σ ˉ T a=\bar{\sigma}\bar{\sigma}^{\mathsf T} a = σ ˉ σ ˉ T , is a uniformly parabolic operator in divergence form with smooth, bounded coefficients (Lemma G.1). By parabolic hypoellipticity [28 ] , the distributional solution in (b) has a smooth density; it is nonnegative because ρ t \rho_t ρ t is a nonnegative measure. The first mass bound is Lemma G.2, and the second holds because ρ t ( D ) ≤ P ( Y t ∈ D ) ≤ 1 \rho_t(D)\le\mathbb{P}(Y_t\in D)\le1 ρ t ( D ) ≤ P ( Y t ∈ D ) ≤ 1 . □ \square □
Lemma G.4 (localization). For ∣ y ′ ∣ ≤ 1 8 |y'|\le\frac{1}{8} ∣ y ′ ∣ ≤ 8 1 and Δ ∈ ( 0 , 1 ] \Delta\in(0,1] Δ ∈ ( 0 , 1 ] ,
∣ p Δ , Y ( y ′ ∣ 0 ) − p Δ , Y ~ ( y ′ ∣ 0 ) ∣ ≤ C Δ − m / 2 e − c / ( 3 Δ ) , (15) \left|p_{\Delta,Y}(y'|0)-p_{\Delta,\widetilde{Y}}(y'|0)\right|\le C\Delta^{-m/2}e^{-c/(3\Delta)}, \tag*{(15)} p Δ , Y ( y ′ ∣0 ) − p Δ , Y ( y ′ ∣0 ) ≤ C Δ − m /2 e − c / ( 3Δ ) , (15) with C C C and c c c independent of x x x , θ \theta θ and Δ \Delta Δ .
Proof. By Lemma G.3(a) and continuity of all densities involved, p Δ , Y − p Δ , Y ~ = ρ ( Δ , ⋅ ) − ρ ~ ( Δ , ⋅ ) p_{\Delta,Y}-p_{\Delta,\widetilde{Y}}=\rho(\Delta,\cdot)-\widetilde{\rho}(\Delta,\cdot) p Δ , Y − p Δ , Y = ρ ( Δ , ⋅ ) − ρ ( Δ , ⋅ ) on D D D , so it suffices to bound ρ ( Δ , y ′ ) \rho(\Delta,y') ρ ( Δ , y ′ ) ; the same argument applies to ρ ~ \widetilde{\rho} ρ . Let r = Δ r=\sqrt{\Delta} r = Δ and suppose first that Δ ≤ Δ 0 : = 1 / 2000 \Delta\le\Delta_0 := 1/2000 Δ ≤ Δ 0 := 1/2000 , so that 4 r < 1 8 4r < \frac{1}{8} 4 r < 8 1 and the closed ball B ‾ 4 r ( y ′ ) \overline{B}_{4r}(y') B 4 r ( y ′ ) lies inside D \mathcal{D} D for ∣ y ′ ∣ ≤ 1 8 |y'| \le\frac{1}{8} ∣ y ′ ∣ ≤ 8 1 . The parabolic Harnack inequality for nonnegative solutions of divergence-form equations with bounded lower-order terms ([45 , 46 , 7 ] ), applied on the cylinder B 4 r ( y ′ ) × ( t − 4 r 2 , t + 4 r 2 ) B_{4r}(y') \times(t-4r^2,t+4r^2) B 4 r ( y ′ ) × ( t − 4 r 2 , t + 4 r 2 ) , gives
ρ ( t , y ′ ) ≤ sup B r ( y ′ ) × ( t − r 2 , t ] ρ ≤ C inf B r ( y ′ ) × ( t + r 2 , t + 2 r 2 ) ρ ≤ C ∣ B r ∣ r 2 ∫ t + r 2 t + 2 r 2 ∫ D ρ ≤ C r − m P ( τ D ≤ t + 2 r 2 ) . \rho(t,y') \le\sup_{B_r(y')\times(t-r^2,t]} \rho\le C \inf_{B_r(y')\times(t+r^2,t+2r^2)} \rho\le\frac{C}{|B_r|r^2}\int_{t+r^2}^{t+2r^2}\int_{\mathcal{D}}\rho\le Cr^{-m}\mathbb{P}(\tau_{\mathcal{D}}\le t+2r^2). ρ ( t , y ′ ) ≤ B r ( y ′ ) × ( t − r 2 , t ] sup ρ ≤ C B r ( y ′ ) × ( t + r 2 , t + 2 r 2 ) inf ρ ≤ ∣ B r ∣ r 2 C ∫ t + r 2 t + 2 r 2 ∫ D ρ ≤ C r − m P ( τ D ≤ t + 2 r 2 ) .
The Harnack constant C C C is uniform because the radius is at most 1 1 1 , the lower-order coefficients are bounded, and the ellipticity constants are uniform (Lemma G.1). With t = Δ = r 2 t=\Delta=r^2 t = Δ = r 2 and Lemma G.2 , the right-hand side is at most C Δ − m / 2 e − c / ( 3 Δ ) C\Delta^{-m/2}e^{-c/(3\Delta)} C Δ − m /2 e − c / ( 3Δ ) . For Δ ∈ ( Δ 0 , 1 ] \Delta\in(\Delta_0,1] Δ ∈ ( Δ 0 , 1 ] , the same argument with r = Δ 0 r=\sqrt{\Delta_0} r = Δ 0 and the mass bound ∫ D ρ ( t , y ) d y ≤ 1 \int_{\mathcal{D}}\rho(t,y)\,dy\le1 ∫ D ρ ( t , y ) d y ≤ 1 , valid for all t > 0 t>0 t > 0 by Lemma G.3 (c), shows that ρ \rho ρ and ρ ~ \widetilde{\rho} ρ are bounded by a constant on { ∣ y ′ ∣ ≤ 1 8 } \{|y'|\le\frac{1}{8}\} { ∣ y ′ ∣ ≤ 8 1 } , so (15) holds after enlarging C C C . □
Proof of Proposition 2. Let y ′ = ( x ′ − x ) / ϖ y'=(x'-x)/\varpi y ′ = ( x ′ − x ) / ϖ , so that ∣ y ′ ∣ ≤ 1 8 |y'|\le\frac{1}{8} ∣ y ′ ∣ ≤ 8 1 . By (14), the identity p Δ , X = ϖ − m p Δ , Y p_{\Delta,X}=\varpi^{-m}p_{\Delta,Y} p Δ , X = ϖ − m p Δ , Y , Proposition 1 applied to Y ~ \widetilde{Y} Y at the starting point 0 0 0 , and Lemma G.4 ,
ϖ m ∣ p X ( K , Δ ) ( x ′ ∣ x ) − p Δ , X ( x ′ ∣ x ) ∣ ≤ ∣ p Y ~ ( K , Δ ) ( y ′ ∣ 0 ) − p Δ , Y ~ ( y ′ ∣ 0 ) ∣ + ∣ p Δ , Y ~ ( y ′ ∣ 0 ) − p Δ , Y ( y ′ ∣ 0 ) ∣ ≤ C K Δ ( K + 1 − m ) / 2 + C Δ − m / 2 e − c / ( 3 Δ ) . \begin{aligned}
\varpi^m\left|p_X^{(K,\Delta)}(x'|x)-p_{\Delta,X}(x'|x)\right|\le\left|p_{\widetilde{Y}}^{(K,\Delta)}(y'|0)-p_{\Delta,\widetilde{Y}}(y'|0)\right|+\left|p_{\Delta,\widetilde{Y}}(y'|0)-p_{\Delta,Y}(y'|0)\right| \\
&\le C_K\Delta^{(K+1-m)/2}+C\Delta^{-m/2}e^{-c/(3\Delta)}.
\end{aligned} ϖ m p X ( K , Δ ) ( x ′ ∣ x ) − p Δ , X ( x ′ ∣ x ) ≤ p Y ( K , Δ ) ( y ′ ∣0 ) − p Δ , Y ( y ′ ∣0 ) + p Δ , Y ( y ′ ∣0 ) − p Δ , Y ( y ′ ∣0 ) ≤ C K Δ ( K + 1 − m ) /2 + C Δ − m /2 e − c / ( 3Δ ) .
The constant C K C_K C K is uniform in x x x and θ \theta θ because Proposition 1 depends on Y ~ \widetilde{Y} Y only through the constants in Assumptions H1 and H2, which are uniform by Lemma G.1, and the centering μ 0 / ϖ \mu_0/\varpi μ 0 / ϖ is bounded. The last term is at most C K Δ ( K + 1 − m ) / 2 C_K\Delta^{(K+1-m)/2} C K Δ ( K + 1 − m ) /2 for Δ ≤ 1 \Delta\le1 Δ ≤ 1 . Dividing by ϖ m \varpi^m ϖ m gives the claim. □
Regularity of the exact density. Lemma A.7 remains true under Assumption H6. Local boundedness and a local Lipschitz bound for p Δ ( ⋅ ∣ x ; θ ) p_\Delta(\cdot|x;\theta) p Δ ( ⋅ ∣ x ; θ ) near x ′ x' x ′ , uniform over ( x , θ ) (x,\theta) ( x , θ ) in compact sets, follow in two cases. If ∣ x ′ − x ∣ ≤ ⟨ x ⟩ / 8 |x'-x|\le\langle x\rangle/8 ∣ x ′ − x ∣ ≤ ⟨ x ⟩ /8 , they follow from the decomposition p Δ , Y = p Δ , Y ~ + ρ − ρ ~ p_{\Delta,Y}=p_{\Delta,\widetilde{Y}}+\rho-\widetilde{\rho} p Δ , Y = p Δ , Y + ρ − ρ above, the bounds of Menozzi et al. [42 ] for Y ~ \widetilde{Y} Y , and interior estimates for ρ \rho ρ and ρ ~ \widetilde{\rho} ρ . Otherwise ∣ x ′ − x ∣ > ⟨ x ⟩ / 8 |x'-x|>\langle x\rangle/8 ∣ x ′ − x ∣ > ⟨ x ⟩ /8 , so ⟨ x ⟩ < 8 ∣ x ′ − x ∣ \langle x\rangle<8|x'-x| ⟨ x ⟩ < 8∣ x ′ − x ∣ and hence ⟨ x ′ ⟩ ≤ ⟨ x ⟩ + ∣ x ′ − x ∣ < 9 ∣ x ′ − x ∣ \langle x'\rangle\le\langle x\rangle+|x'-x|<9|x'-x| ⟨ x ′ ⟩ ≤ ⟨ x ⟩ + ∣ x ′ − x ∣ < 9∣ x ′ − x ∣ , that is, ∣ x ′ − x ∣ > ⟨ x ′ ⟩ / 9 |x'-x|>\langle x'\rangle/9 ∣ x ′ − x ∣ > ⟨ x ′ ⟩ /9 . The ball of radius ⟨ x ′ ⟩ / 18 \langle x'\rangle/18 ⟨ x ′ ⟩ /18 around x ′ x' x ′ then excludes x x x , and the law of X t X_t X t , extended by zero for t ≤ 0 t\le0 t ≤ 0 , solves the forward equation on that ball. The Harnack inequality with radius r ≤ min ( ⟨ x ′ ⟩ / 72 , Δ / 2 ) r\le\min(\langle x'\rangle/72,\sqrt{\Delta}/2) r ≤ min (⟨ x ′ ⟩ /72 , Δ /2 ) and total mass at most one then bounds p Δ p_\Delta p Δ near x ′ x' x ′ , and interior estimates give the Lipschitz bound. Weak continuity of the law of X Δ X_\Delta X Δ in ( x , θ ) (x,\theta) ( x , θ ) holds as before, because the coefficients are Lipschitz in x x x , so the mollification argument in the proof of Lemma A.7 applies. The only change is that ∣ σ ( y ; β ) − σ ( y ; β ′ ) ∣ ≤ C ∣ β − β ′ ∣ ⟨ y ⟩ |\sigma(y;\beta)-\sigma(y;\beta')|\le C|\beta-\beta'|\langle y\rangle ∣ σ ( y ; β ) − σ ( y ; β ′ ) ∣ ≤ C ∣ β − β ′ ∣ ⟨ y ⟩ now grows with y y y ; the Gronwall estimate for E ∣ X t x , θ − X t x ′ , θ ′ ∣ 2 \mathbb{E}|X_t^{x,\theta}-X_t^{x',\theta'}|^2 E ∣ X t x , θ − X t x ′ , θ ′ ∣ 2 still applies, since the starting points are deterministic and range over a compact set, so that sup t ≤ Δ E ∣ X t x ′ , θ ′ ∣ 2 \sup_{t\le\Delta}\mathbb{E}|X_t^{x',\theta'}|^2 sup t ≤ Δ E ∣ X t x ′ , θ ′ ∣ 2 is bounded there, by the standard moment estimate for SDEs whose coefficients grow at most linearly. No moment assumption on the data is involved. Strict positivity follows from the support theorem for diffusions with smooth, nondegenerate coefficients ([50 ] ), combined with a Harnack chain.
Proof of Theorem 6. The proofs in Appendices A–F use Assumptions H1–H2 through four facts:
Under Assumption H6, measure increments on the local scale, z ~ i = z i / ⟨ X i − 1 ⟩ \tilde{z}_i = z_i/\langle X_{i-1}\rangle z ~ i = z i / ⟨ X i − 1 ⟩ , and replace each weight ⟨ X i − 1 ⟩ r \langle X_{i-1}\rangle^r ⟨ X i − 1 ⟩ r by a constant. Then:
(i) is replaced by Proposition 2. It is used only at observed transitions, and in Lemma D.1 on { ∣ z ~ ∣ ≤ r n } \{|\tilde{z}| \le r_n\} { ∣ z ~ ∣ ≤ r n } . The observed transitions lie in { ∣ x ′ − x ∣ ≤ ⟨ x ⟩ / 8 } \{|x^\prime-x| \le\langle x\rangle/8\} { ∣ x ′ − x ∣ ≤ ⟨ x ⟩ /8 } with probability tending to one, because max i ∣ z ~ i ∣ = O P ( log n ) \max_i|\tilde{z}_i| = O_{\mathbb{P}}(\sqrt{\log n}) max i ∣ z ~ i ∣ = O P ( log n ) and ε log n → 0 \varepsilon\sqrt{\log n} \to0 ε log n → 0 . The integration domain B n = { x ′ : ∣ z ~ ( α 0 ) ∣ ≤ r n } B_n = \{x^\prime: |\tilde{z}(\alpha_0)| \le r_n\} B n = { x ′ : ∣ z ~ ( α 0 ) ∣ ≤ r n } in Lemma D.1 lies there deterministically once n n n is large: since x ′ − x = ε ⟨ x ⟩ z ~ ( α 0 ) + Δ n μ ( x ; α 0 ) x^\prime-x = \varepsilon\langle x\rangle\tilde{z}(\alpha_0) + \Delta_n\mu(x;\alpha_0) x ′ − x = ε ⟨ x ⟩ z ~ ( α 0 ) + Δ n μ ( x ; α 0 ) and ∣ μ ( x ; α 0 ) ∣ ≤ C ⟨ x ⟩ |\mu(x;\alpha_0)| \le C\langle x\rangle ∣ μ ( x ; α 0 ) ∣ ≤ C ⟨ x ⟩ , every x ′ ∈ B n x^\prime\in B_n x ′ ∈ B n has ∣ x ′ − x ∣ ≤ ⟨ x ⟩ ( ε r n + C Δ n ) ≤ ⟨ x ⟩ / 8 |x^\prime-x| \le\langle x\rangle(\varepsilon r_n+C\Delta_n) \le\langle x\rangle/8 ∣ x ′ − x ∣ ≤ ⟨ x ⟩ ( ε r n + C Δ n ) ≤ ⟨ x ⟩ /8 . The integral over B n c B_n^c B n c in that lemma involves only ∂ θ p Δ \partial_\theta p_{\Delta} ∂ θ p Δ , not p Δ p_{\Delta} p Δ . By (14), and because ϖ = ⟨ x ⟩ \varpi= \langle x\rangle ϖ = ⟨ x ⟩ does not depend on θ \theta θ , the substitution z ~ = z / ⟨ x ⟩ \tilde{z}=z/\langle x\rangle z ~ = z / ⟨ x ⟩ removes all factors of ϖ \varpi ϖ , and the Gaussian tail integral over { ∣ z ~ ∣ > r n } \{|\tilde{z}| > r_n\} { ∣ z ~ ∣ > r n } is at most C n − 2 Cn^{-2} C n − 2 , uniformly in X i − 1 X_{i-1} X i − 1 .
(ii) holds with bounded coefficients in z ~ \tilde{z} z ~ , by the equivariance remark above. Lemma A.1 holds with ⟨ x ⟩ r \langle x\rangle^r ⟨ x ⟩ r replaced by 1 1 1 and z z z by z ~ \tilde{z} z ~ : the Euler scores ε ( ∂ α μ ) ⊤ ν − 1 z \varepsilon(\partial_\alpha\mu)^\top\nu^{-1}z ε ( ∂ α μ ) ⊤ ν − 1 z and 1 2 [ z ⊤ ν − 1 ∂ β j ν ν − 1 z − tr ( ν − 1 ∂ β j ν ) ] \frac{1}{2}[z^\top\nu^{-1}\partial_{\beta_j}\nu\nu^{-1}z-\operatorname{tr}(\nu^{-1}\partial_{\beta_j}\nu)] 2 1 [ z ⊤ ν − 1 ∂ β j ν ν − 1 z − tr ( ν − 1 ∂ β j ν )] are polynomials in z ~ \tilde{z} z ~ with bounded coefficients, since ∣ ν − 1 / 2 ∂ α μ ∣ |\nu^{-1/2}\partial_\alpha\mu| ∣ ν − 1/2 ∂ α μ ∣ , ∣ ν − 1 ∂ β ν ∣ |\nu^{-1}\partial_\beta\nu| ∣ ν − 1 ∂ β ν ∣ and ∣ ν − 1 / 2 ( μ ( x ; α ) − μ ( x ; α 0 ) ) ∣ |\nu^{-1/2}(\mu(x;\alpha)-\mu(x;\alpha_0))| ∣ ν − 1/2 ( μ ( x ; α ) − μ ( x ; α 0 )) ∣ are bounded.
(iii) The conditional moment bounds of Lemma A.3 need no stopping. Under Assumption H6 the coefficients are globally Lipschitz with linear growth, so the Burkholder–Davis–Gundy inequality and Gronwall’s lemma, applied to the unstopped process on [ t i − 1 , t i ] [t_{i-1},t_i] [ t i − 1 , t i ] , give E [ sup s ∈ [ t i − 1 , t i ] ∣ X s − x ∣ p ∣ X i − 1 = x ] ≤ C p Δ p / 2 ⟨ x ⟩ p \mathbb{E}[\sup_{s\in[t_{i-1},t_i]}|X_s-x|^p\mid X_{i-1}=x] \le C_p\Delta^{p/2}\langle x\rangle^p E [ sup s ∈ [ t i − 1 , t i ] ∣ X s − x ∣ p ∣ X i − 1 = x ] ≤ C p Δ p /2 ⟨ x ⟩ p . Dividing by ϖ p = ⟨ x ⟩ p \varpi^p=\langle x\rangle^p ϖ p = ⟨ x ⟩ p yields the bounds of Lemma A.3 for z ~ i \tilde{z}_i z ~ i , uniformly in X i − 1 X_{i-1} X i − 1 and on the whole probability space, including the event that the rescaled process leaves D \mathcal{D} D . In particular, E [ ∣ z ~ i − ϖ − 1 σ ( X i − 1 ) υ i ∣ p ∣ F i − 1 ] ≤ C p Δ p / 2 \mathbb{E}[|\tilde{z}_i-\varpi^{-1}\sigma(X_{i-1})\upsilon_i|^p\mid\mathcal{F}_{i-1}] \le C_p\Delta^{p/2} E [ ∣ z ~ i − ϖ − 1 σ ( X i − 1 ) υ i ∣ p ∣ F i − 1 ] ≤ C p Δ p /2 and ∣ E [ z ~ i ∣ F i − 1 ] ∣ ≤ C Δ 3 / 2 |\mathbb{E}[\tilde{z}_i\mid\mathcal{F}_{i-1}]| \le C\Delta^{3/2} ∣ E [ z ~ i ∣ F i − 1 ] ∣ ≤ C Δ 3/2 , with no weight. For the latter, ∣ A μ ( y ) ∣ ≤ C ⟨ y ⟩ |A_\mu(y)| \le C\langle y\rangle ∣ A μ ( y ) ∣ ≤ C ⟨ y ⟩ , and E [ ⟨ X u ⟩ ∣ X 0 = x ] ≤ C ⟨ x ⟩ \mathbb{E}[\langle X_u\rangle\mid X_0=x] \le C\langle x\rangle E [⟨ X u ⟩ ∣ X 0 = x ] ≤ C ⟨ x ⟩ for u ≤ 1 u \le1 u ≤ 1 . In Lemma A.2(b,c), stop the rescaled process at its exit from { ∣ y ∣ < η } \{|y| < \eta\} { ∣ y ∣ < η } , with η = η ( δ ) \eta=\eta(\delta) η = η ( δ ) small. Before that time, the quadratic variation of the rescaled martingale is at most ( 1 + η ) 2 λ max Δ (1+\eta)^2\lambda_{\max}\Delta ( 1 + η ) 2 λ m a x Δ , and the factor ( 1 + η ) 2 (1+\eta)^2 ( 1 + η ) 2 is absorbed into δ \delta δ , which preserves the constant 2 ( 1 + δ ) m λ max 2(1+\delta)m\lambda_{\max} 2 ( 1 + δ ) m λ m a x . The exit probability is at most 2 m e − c η 2 / Δ 2me^{-c\eta^2/\Delta} 2 m e − c η 2 /Δ , which is super-polynomially small. Lemma A.2(a) is no longer needed, and the term O ( n − L ) O(n^{-L}) O ( n − L ) in Lemma A.2(c) now comes from this exit probability. Stopping is thus used only for the exponential martingale inequality, which needs bounded quadratic variation; all L p L^p L p bounds, including those used to remove truncation indicators by the Cauchy–Schwarz inequality, come from the unstopped estimate.
(iv) is no longer needed. Every function averaged over the sample in Lemmas A.4–A.6, D.2 and D.3 becomes, after the substitution z = ⟨ x ⟩ z ~ z=\langle x\rangle\tilde{z} z = ⟨ x ⟩ z ~ , a function g ( x ) g(x) g ( x ) times a polynomial in z ~ \tilde{z} z ~ , with ∣ g ( x ) ∣ + ⟨ x ⟩ ∣ ∇ g ( x ) ∣ ≤ C |g(x)|+\langle x\rangle|\nabla g(x)|\le C ∣ g ( x ) ∣ + ⟨ x ⟩ ∣∇ g ( x ) ∣ ≤ C . For such g g g , ∣ g ( X s ) − g ( X i − 1 ) ∣ ≤ C min ( 1 , ∣ X s − X i − 1 ∣ / ⟨ X i − 1 ⟩ ) |g(X_s)-g(X_{i-1})|\le C\min(1,|X_s-X_{i-1}|/\langle X_{i-1}\rangle) ∣ g ( X s ) − g ( X i − 1 ) ∣ ≤ C min ( 1 , ∣ X s − X i − 1 ∣/ ⟨ X i − 1 ⟩) : if ∣ X s − X i − 1 ∣ ≤ 1 2 ⟨ X i − 1 ⟩ |X_s-X_{i-1}|\le\frac{1}{2}\langle X_{i-1}\rangle ∣ X s − X i − 1 ∣ ≤ 2 1 ⟨ X i − 1 ⟩ , every point x ξ x^\xi x ξ on the segment has ⟨ x ξ ⟩ ≥ 1 2 ⟨ X i − 1 ⟩ \langle x^\xi\rangle\ge\frac{1}{2}\langle X_{i-1}\rangle ⟨ x ξ ⟩ ≥ 2 1 ⟨ X i − 1 ⟩ , and the mean value theorem applies; otherwise use ∣ g ∣ ≤ C |g|\le C ∣ g ∣ ≤ C . The conditional expectation of the right-hand side given F i − 1 \mathcal{F}_{i-1} F i − 1 is at most C ε C\varepsilon C ε , uniformly in X i − 1 X_{i-1} X i − 1 , by (iii). Taking expectations afterwards, which requires no moments of the initial law, shows that the discretization error in Lemma A.4 is O ( ε ) O(\varepsilon) O ( ε ) , and Assumption H3(i) gives the ergodic averages for bounded g g g . In Lemma A.5, the Gaussian average f ˉ ( x ; ϑ ) = ∫ f ~ ( x , z ~ ; ϑ ) ϕ ( z ~ ; ν ~ ( x ; β 0 ) ) d z ~ \bar{f}(x;\vartheta)=\int\tilde{f}(x,\tilde{z};\vartheta)\phi(\tilde{z};\tilde{\nu}(x;\beta_0))\,d\tilde{z} f ˉ ( x ; ϑ ) = ∫ f ~ ( x , z ~ ; ϑ ) ϕ ( z ~ ; ν ~ ( x ; β 0 )) d z ~ , with ν ~ = ⟨ x ⟩ − 2 ν \tilde{\nu}=\langle x\rangle^{-2}\nu ν ~ = ⟨ x ⟩ − 2 ν , satisfies the same bound ∣ f ˉ ∣ + ⟨ x ⟩ ∣ ∇ f ˉ ∣ ≤ C |\bar{f}|+\langle x\rangle|\nabla\bar{f}|\le C ∣ f ˉ ∣ + ⟨ x ⟩ ∣∇ f ˉ ∣ ≤ C , because ⟨ x ⟩ ∣ ∇ ν ~ ( x ; β 0 ) ∣ ≤ C \langle x\rangle|\nabla\tilde{\nu}(x;\beta_0)|\le C ⟨ x ⟩ ∣∇ ν ~ ( x ; β 0 ) ∣ ≤ C by Assumption H6.
The threshold in Theorem 1(a) is unchanged. Indeed, q ≥ ( 2 π λ max ⟨ x ⟩ 2 Δ ) − m / 2 exp ( − ∣ z ~ ∣ 2 / ( 2 λ min ) ) q\ge(2\pi\lambda_{\max}\langle x\rangle^2\Delta)^{-m/2}\exp(-|\tilde{z}|^2/(2\lambda_{\min})) q ≥ ( 2 π λ m a x ⟨ x ⟩ 2 Δ ) − m /2 exp ( − ∣ z ~ ∣ 2 / ( 2 λ m i n )) , and Proposition 2 carries the same factor ( ⟨ x ⟩ 2 Δ ) − m / 2 \left(\langle x\rangle^{2}\Delta\right)^{-m/2} ( ⟨ x ⟩ 2 Δ ) − m /2 , so the relative error at an observation is at most C Δ ( K + 1 ) / 2 n ( 1 + δ ) m Λ C\Delta^{(K+1)/2}n^{(1+\delta)m\Lambda} C Δ ( K + 1 ) /2 n ( 1 + δ ) m Λ . The proof of Theorem 2(b) uses (i)–(iii) in the same way, which gives part (b). For part (c), Step 1 of Appendix § 14 uses Assumption H5 only for the functions g g g just described, and (T3) needs no moments of X X X .
Expansion coefficients used in Section 5
Ornstein–Uhlenbeck model. With ν = diag ( s 1 2 , s 2 2 ) \nu=\operatorname{diag}(s_{1}^{2},s_{2}^{2}) ν = diag ( s 1 2 , s 2 2 ) constant, C 1 ≡ 0 C_{1}\equiv0 C 1 ≡ 0 . Write E 1 = − 1 2 ( κ ν + ν κ T ) E_{1}=-\frac{1}{2}(\kappa\nu+\nu\kappa^{\mathsf{T}}) E 1 = − 2 1 ( κ ν + ν κ T ) , E 2 = 1 6 ( κ 2 ν + 2 κ ν κ T + ν ( κ T ) 2 ) E_{2}=\frac{1}{6}(\kappa^{2}\nu+2\kappa\nu\kappa^{\mathsf{T}}+\nu(\kappa^{\mathsf{T}})^{2}) E 2 = 6 1 ( κ 2 ν + 2 κ ν κ T + ν ( κ T ) 2 ) , P j = ν − 1 E j P_{j}=\nu^{-1}E_{j} P j = ν − 1 E j and a ( x ) = 1 2 κ 2 x a(x)=\frac{1}{2}\kappa^{2}x a ( x ) = 2 1 κ 2 x . Expanding the exact Gaussian transition density at fixed z z z gives
C 2 = 1 2 [ z T ν − 1 E 1 ν − 1 z − tr P 1 ] , C 3 = a ( x ) T ν − 1 z , C_{2}=\frac{1}{2}\left[z^{\mathsf{T}}\nu^{-1}E_{1}\nu^{-1}z-\operatorname{tr}P_{1}\right],\qquad C_{3}=a(x)^{\mathsf{T}}\nu^{-1}z, C 2 = 2 1 [ z T ν − 1 E 1 ν − 1 z − tr P 1 ] , C 3 = a ( x ) T ν − 1 z ,
C 4 = − 1 2 [ tr P 2 − 1 2 tr P 1 2 ] − 1 2 z T ( ν − 1 E 1 ν − 1 E 1 ν − 1 − ν − 1 E 2 ν − 1 ) z + 1 2 C 2 2 . C_{4}=-\frac{1}{2}\left[\operatorname{tr}P_{2}-\frac{1}{2}\operatorname{tr}P_{1}^{2}\right]-\frac{1}{2}z^{\mathsf{T}}\left(\nu^{-1}E_{1}\nu^{-1}E_{1}\nu^{-1}-\nu^{-1}E_{2}\nu^{-1}\right)z+\frac{1}{2}C_{2}^{2}. C 4 = − 2 1 [ tr P 2 − 2 1 tr P 1 2 ] − 2 1 z T ( ν − 1 E 1 ν − 1 E 1 ν − 1 − ν − 1 E 2 ν − 1 ) z + 2 1 C 2 2 .
The degree-one term C 3 C_{3} C 3 equals 1 2 ∑ i w 2 , e i H e i \frac{1}{2}\sum_{i}w_{2,e_{i}}H_{e_{i}} 2 1 ∑ i w 2 , e i H e i with w 2 , e i ( x ) = ( A μ i ) ( x ) w_{2,e_{i}}(x)=(A\mu_{i})(x) w 2 , e i ( x ) = ( A μ i ) ( x ) . It is responsible for the drift bias of the Euler and K = 2 K=2 K = 2 estimators. In particular, B ˉ α ( 2 ) = ∫ ( ∂ α μ ) T ν − 1 a d π \bar{B}_{\alpha}^{(2)}=\int(\partial_{\alpha}\mu)^{\mathsf{T}}\nu^{-1}a\,d\pi B ˉ α ( 2 ) = ∫ ( ∂ α μ ) T ν − 1 a d π , and B ˉ s j ( 1 ) = E [ S s j ( Z ) C 2 ( Z ) ] = − κ j j / s j \bar{B}_{s_{j}}^{(1)}=\mathbb{E}[S_{s_{j}}(Z)C_{2}(Z)]=-\kappa_{jj}/s_{j} B ˉ s j ( 1 ) = E [ S s j ( Z ) C 2 ( Z )] = − κ j j / s j , where S s j ( z ) = ( z j 2 / s j 2 − 1 ) / s j S_{s_{j}}(z)=(z_{j}^{2}/s_{j}^{2}-1)/s_{j} S s j ( z ) = ( z j 2 / s j 2 − 1 ) / s j is the Euler score for s j s_{j} s j . These are the constants used in Table 4 .
General C 1 C_{1} C 1 and C 2 C_{2} C 2 . Writing the recursion of Yang et al. [54 ] in tensor form, with H I = ( − 1 ) ∣ I ∣ ϕ − 1 ∂ I ϕ H_{I}=(-1)^{|I|}\phi^{-1}\partial_{I}\phi H I = ( − 1 ) ∣ I ∣ ϕ − 1 ∂ I ϕ for ϕ = ϕ ( ⋅ ; ν ( x ) ) \phi=\phi(\cdot;\nu(x)) ϕ = ϕ ( ⋅ ; ν ( x )) and sums over all ordered indices, we obtain
C 1 = 1 4 ∑ ν a b ∂ a ν i j H b i j , C_{1}=\frac{1}{4}\sum\nu_{ab}\partial_{a}\nu_{ij}H_{bij}, C 1 = 4 1 ∑ ν ab ∂ a ν ij H bij ,
C 2 = 1 2 ∑ T b i H b i + 1 6 ∑ ( W i j k l ′ H i j k l + W b d i j ′ ′ H b d i j ) + 1 24 ∑ V b d i j k l H b d i j k l , C_{2}=\frac{1}{2}\sum T_{bi}H_{bi}+\frac{1}{6}\sum\left(W'_{ijkl}H_{ijkl}+W''_{bdij}H_{bdij}\right)+\frac{1}{24}\sum V_{bdijkl}H_{bdijkl}, C 2 = 2 1 ∑ T bi H bi + 6 1 ∑ ( W ij k l ′ H ij k l + W b d ij ′′ H b d ij ) + 24 1 ∑ V b d ij k l H b d ij k l ,
where all coefficients are evaluated at x x x :
T b i = ∑ ν a b ∂ a μ i + 1 2 A ν b i , W i j k l ′ = 1 4 ∑ a , b ν a b ∂ a ν i j ∂ b ν k l , T_{bi}=\sum\nu_{ab}\partial_{a}\mu_{i}+\frac{1}{2}A\nu_{bi},\qquad W'_{ijkl}=\frac{1}{4}\sum_{a,b}\nu_{ab}\partial_{a}\nu_{ij}\partial_{b}\nu_{kl}, T bi = ∑ ν ab ∂ a μ i + 2 1 A ν bi , W ij k l ′ = 4 1 a , b ∑ ν ab ∂ a ν ij ∂ b ν k l ,
W b d i j ′ ′ = 1 2 ∑ a ν a b ∂ a ( ∑ c ν c d ∂ c ν i j ) , W''_{bdij}=\frac{1}{2}\sum_{a}\nu_{ab}\partial_{a}\left(\sum_{c}\nu_{cd}\partial_{c}\nu_{ij}\right), W b d ij ′′ = 2 1 a ∑ ν ab ∂ a ( c ∑ ν c d ∂ c ν ij ) ,
V b d i j k l = 1 4 ∑ a , c ν a b ν c d ( 2 ∂ c ν i j ∂ a ν k l + ∂ a ν i j ∂ c ν k l ) . V_{bdijkl}=\frac{1}{4}\sum_{a,c}\nu_{ab}\nu_{cd}\left(2\partial_{c}\nu_{ij}\partial_{a}\nu_{kl}+\partial_{a}\nu_{ij}\partial_{c}\nu_{kl}\right). V b d ij k l = 4 1 a , c ∑ ν ab ν c d ( 2 ∂ c ν ij ∂ a ν k l + ∂ a ν ij ∂ c ν k l ) .
After symmetrization, 1 24 ∑ V b d i j k l H b d i j k l = 1 32 ∑ ν a b ν c d ∂ a ν i j ∂ c ν k l H b d i j k l \frac{1}{24}\sum V_{bdijkl}H_{bdijkl}=\frac{1}{32}\sum\nu_{ab}\nu_{cd}\partial_{a}\nu_{ij}\partial_{c}\nu_{kl}H_{bdijkl} 24 1 ∑ V b d ij k l H b d ij k l = 32 1 ∑ ν ab ν c d ∂ a ν ij ∂ c ν k l H b d ij k l , so the degree-six part of C 2 C_{2} C 2 equals that of 1 2 C 1 2 \frac{1}{2}C_{1}^{2} 2 1 C 1 2 . We verified these formulas, and those for the Ornstein–Uhlenbeck model up to C 4 C_{4} C 4 , against a direct numerical implementation of the recursion (18)–(20) of Yang et al. [54 ] in truncated Taylor arithmetic, at randomly drawn ( x , z , θ ) (x,z,\theta) ( x , z , θ ) . They agree to machine precision. Replication code for all computations is provided as supplementary material.
References
@page 49/52 starts_mid=1 ends_mid=0 and Proposition 2 carries the same factor ( ⟨ x ⟩ 2 Δ ) − m / 2 \left(\langle x\rangle^{2}\Delta\right)^{-m/2} ( ⟨ x ⟩ 2 Δ ) − m /2 , so the relative error at an observation is at most C Δ ( K + 1 ) / 2 n ( 1 + δ ) m Λ C\Delta^{(K+1)/2}n^{(1+\delta)m\Lambda} C Δ ( K + 1 ) /2 n ( 1 + δ ) m Λ . The proof of Theorem 2(b) uses (i)–(iii) in the same way, which gives part (b). For part (c), Step 1 of Appendix § 14 uses Assumption H5 only for the functions g g g just described, and (T3) needs no moments of X X X .
Expansion coefficients used in Section 5
Ornstein–Uhlenbeck model. With ν = diag ( s 1 2 , s 2 2 ) \nu=\operatorname{diag}(s_{1}^{2},s_{2}^{2}) ν = diag ( s 1 2 , s 2 2 ) constant, C 1 ≡ 0 C_{1}\equiv0 C 1 ≡ 0 . Write E 1 = − 1 2 ( κ ν + ν κ T ) E_{1}=-\frac{1}{2}(\kappa\nu+\nu\kappa^{\mathsf{T}}) E 1 = − 2 1 ( κ ν + ν κ T ) , E 2 = 1 6 ( κ 2 ν + 2 κ ν κ T + ν ( κ T ) 2 ) E_{2}=\frac{1}{6}(\kappa^{2}\nu+2\kappa\nu\kappa^{\mathsf{T}}+\nu(\kappa^{\mathsf{T}})^{2}) E 2 = 6 1 ( κ 2 ν + 2 κ ν κ T + ν ( κ T ) 2 ) , P j = ν − 1 E j P_{j}=\nu^{-1}E_{j} P j = ν − 1 E j and a ( x ) = 1 2 κ 2 x a(x)=\frac{1}{2}\kappa^{2}x a ( x ) = 2 1 κ 2 x . Expanding the exact Gaussian transition density at fixed z z z gives
C 2 = 1 2 [ z T ν − 1 E 1 ν − 1 z − tr P 1 ] , C 3 = a ( x ) T ν − 1 z , C_{2}=\frac{1}{2}\left[z^{\mathsf{T}}\nu^{-1}E_{1}\nu^{-1}z-\operatorname{tr}P_{1}\right],\qquad C_{3}=a(x)^{\mathsf{T}}\nu^{-1}z, C 2 = 2 1 [ z T ν − 1 E 1 ν − 1 z − tr P 1 ] , C 3 = a ( x ) T ν − 1 z ,
C 4 = − 1 2 [ tr P 2 − 1 2 tr P 1 2 ] − 1 2 z T ( ν − 1 E 1 ν − 1 E 1 ν − 1 − ν − 1 E 2 ν − 1 ) z + 1 2 C 2 2 . C_{4}=-\frac{1}{2}\left[\operatorname{tr}P_{2}-\frac{1}{2}\operatorname{tr}P_{1}^{2}\right]-\frac{1}{2}z^{\mathsf{T}}\left(\nu^{-1}E_{1}\nu^{-1}E_{1}\nu^{-1}-\nu^{-1}E_{2}\nu^{-1}\right)z+\frac{1}{2}C_{2}^{2}. C 4 = − 2 1 [ tr P 2 − 2 1 tr P 1 2 ] − 2 1 z T ( ν − 1 E 1 ν − 1 E 1 ν − 1 − ν − 1 E 2 ν − 1 ) z + 2 1 C 2 2 .
The degree-one term C 3 C_{3} C 3 equals 1 2 ∑ i w 2 , e i H e i \frac{1}{2}\sum_{i}w_{2,e_{i}}H_{e_{i}} 2 1 ∑ i w 2 , e i H e i with w 2 , e i ( x ) = ( A μ i ) ( x ) w_{2,e_{i}}(x)=(A\mu_{i})(x) w 2 , e i ( x ) = ( A μ i ) ( x ) . It is responsible for the drift bias of the Euler and K = 2 K=2 K = 2 estimators. In particular, B ˉ α ( 2 ) = ∫ ( ∂ α μ ) T ν − 1 a d π \bar{B}_{\alpha}^{(2)}=\int(\partial_{\alpha}\mu)^{\mathsf{T}}\nu^{-1}a\,d\pi B ˉ α ( 2 ) = ∫ ( ∂ α μ ) T ν − 1 a d π , and B ˉ s j ( 1 ) = E [ S s j ( Z ) C 2 ( Z ) ] = − κ j j / s j \bar{B}_{s_{j}}^{(1)}=\mathbb{E}[S_{s_{j}}(Z)C_{2}(Z)]=-\kappa_{jj}/s_{j} B ˉ s j ( 1 ) = E [ S s j ( Z ) C 2 ( Z )] = − κ j j / s j , where S s j ( z ) = ( z j 2 / s j 2 − 1 ) / s j S_{s_{j}}(z)=(z_{j}^{2}/s_{j}^{2}-1)/s_{j} S s j ( z ) = ( z j 2 / s j 2 − 1 ) / s j is the Euler score for s j s_{j} s j . These are the constants used in Table 4 .
General C 1 C_{1} C 1 and C 2 C_{2} C 2 . Writing the recursion of Yang et al. [54 ] in tensor form, with H I = ( − 1 ) ∣ I ∣ ϕ − 1 ∂ I ϕ H_{I}=(-1)^{|I|}\phi^{-1}\partial_{I}\phi H I = ( − 1 ) ∣ I ∣ ϕ − 1 ∂ I ϕ for ϕ = ϕ ( ⋅ ; ν ( x ) ) \phi=\phi(\cdot;\nu(x)) ϕ = ϕ ( ⋅ ; ν ( x )) and sums over all ordered indices, we obtain
C 1 = 1 4 ∑ ν a b ∂ a ν i j H b i j , C_{1}=\frac{1}{4}\sum\nu_{ab}\partial_{a}\nu_{ij}H_{bij}, C 1 = 4 1 ∑ ν ab ∂ a ν ij H bij ,
C 2 = 1 2 ∑ T b i H b i + 1 6 ∑ ( W i j k l ′ H i j k l + W b d i j ′ ′ H b d i j ) + 1 24 ∑ V b d i j k l H b d i j k l , C_{2}=\frac{1}{2}\sum T_{bi}H_{bi}+\frac{1}{6}\sum\left(W'_{ijkl}H_{ijkl}+W''_{bdij}H_{bdij}\right)+\frac{1}{24}\sum V_{bdijkl}H_{bdijkl}, C 2 = 2 1 ∑ T bi H bi + 6 1 ∑ ( W ij k l ′ H ij k l + W b d ij ′′ H b d ij ) + 24 1 ∑ V b d ij k l H b d ij k l ,
where all coefficients are evaluated at x x x :
T b i = ∑ ν a b ∂ a μ i + 1 2 A ν b i , W i j k l ′ = 1 4 ∑ a , b ν a b ∂ a ν i j ∂ b ν k l , T_{bi}=\sum\nu_{ab}\partial_{a}\mu_{i}+\frac{1}{2}A\nu_{bi},\qquad W'_{ijkl}=\frac{1}{4}\sum_{a,b}\nu_{ab}\partial_{a}\nu_{ij}\partial_{b}\nu_{kl}, T bi = ∑ ν ab ∂ a μ i + 2 1 A ν bi , W ij k l ′ = 4 1 a , b ∑ ν ab ∂ a ν ij ∂ b ν k l ,
W b d i j ′ ′ = 1 2 ∑ a ν a b ∂ a ( ∑ c ν c d ∂ c ν i j ) , W''_{bdij}=\frac{1}{2}\sum_{a}\nu_{ab}\partial_{a}\left(\sum_{c}\nu_{cd}\partial_{c}\nu_{ij}\right), W b d ij ′′ = 2 1 a ∑ ν ab ∂ a ( c ∑ ν c d ∂ c ν ij ) ,
V b d i j k l = 1 4 ∑ a , c ν a b ν c d ( 2 ∂ c ν i j ∂ a ν k l + ∂ a ν i j ∂ c ν k l ) . V_{bdijkl}=\frac{1}{4}\sum_{a,c}\nu_{ab}\nu_{cd}\left(2\partial_{c}\nu_{ij}\partial_{a}\nu_{kl}+\partial_{a}\nu_{ij}\partial_{c}\nu_{kl}\right). V b d ij k l = 4 1 a , c ∑ ν ab ν c d ( 2 ∂ c ν ij ∂ a ν k l + ∂ a ν ij ∂ c ν k l ) .
After symmetrization, 1 24 ∑ V b d i j k l H b d i j k l = 1 32 ∑ ν a b ν c d ∂ a ν i j ∂ c ν k l H b d i j k l \frac{1}{24}\sum V_{bdijkl}H_{bdijkl}=\frac{1}{32}\sum\nu_{ab}\nu_{cd}\partial_{a}\nu_{ij}\partial_{c}\nu_{kl}H_{bdijkl} 24 1 ∑ V b d ij k l H b d ij k l = 32 1 ∑ ν ab ν c d ∂ a ν ij ∂ c ν k l H b d ij k l , so the degree-six part of C 2 C_{2} C 2 equals that of 1 2 C 1 2 \frac{1}{2}C_{1}^{2} 2 1 C 1 2 . We verified these formulas, and those for the Ornstein–Uhlenbeck model up to C 4 C_{4} C 4 , against a direct numerical implementation of the recursion (18)–(20) of Yang et al. [54 ] in truncated Taylor arithmetic, at randomly drawn ( x , z , θ ) (x,z,\theta) ( x , z , θ ) . They agree to machine precision. Replication code for all computations is provided as supplementary material.
References