No CrossRef data available.
Published online by Cambridge University Press: 31 January 2003
In this paper, two competing types of multistep predictors, i.e., plug-in and direct predictors, are considered in autoregressive (AR) processes. When a working model AR(k) is used for the h-step prediction with h > 1, the plug-in predictor is obtained from repeatedly using the fitted (by least squares) AR(k) model with an unknown future value replaced by their own forecasts, and the direct predictor is obtained by estimating the h-step prediction model's coefficients directly by linear least squares. Under rather mild conditions, asymptotic expressions for the mean-squared prediction errors (MSPEs) of these two predictors are obtained in stationary cases. In addition, we also extend these results to models with deterministic time trends. Based on these expressions, performances of the plug-in and direct predictors are compared. Finally, two examples are given to illustrate that some stationary case results on these MSPEs can not be generalized to the nonstationary case.The author is deeply grateful to the co-editor Pentti Saikkonen and two referees for their helpful suggestions and comments on a previous version of this paper.
Assume that observations x1,…,xn are generated from the following stationary autoregressive (AR) process:

where 1 ≤ p < ∞ is some unknown positive integer, ap ≠ 0, {εt} is a sequence of (unobservable) independent and identically distributed (i.i.d.) random noises, each with mean 0 and variance σ2, and the polynomial A(z) = 1 − a1 z − ··· − ap zp ≠ 0, for |z| ≤ 1. These assumptions ensure that (see Brockwell and Davis, 1987, Theorem 3.1.1) xt has a one-sided infinite moving-average representation:

where b0 + b1 z + b2 z2 + ··· = A−1(z), b0 = 1, and bk2 ≤ νe−βk for some ν,β > 0. When a working model AR (k) is used for multistep prediction, a natural predictor of xn+h, h ≥ 1, can be obtained as follows. First, the parameters in the working model are estimated by least squares. Then, the predictor,

, is given by repeatedly using the fitted model with an unknown future value replaced by their own forecasts. In the following,

will be referred to as the plug-in predictor (see also Kunitomo and Yamamoto, 1985; Bhansali, 1997). More specifically, let

denote the least-squares estimators of the AR parameters in the working model, where

satisfies

with xj(k) = (xj,…,xj−k+1)′ for j ≥ k. Then, for h ≥ 1, the plug-in predictor is given by

where, with Im and 0m, respectively, denoting an identity matrix and a vector of zeros of dimension m,

and

.
When k ≥ p and {xt} is a Gaussian process, it can be shown that (e.g., Brockwell and Davis, 1987, Chs. 8 and 10)

is asymptotically equivalent to the maximum likelihood estimator (MLE) of (a1,…,ak)′ with ai = 0 for i > p. (Note that for k ≥ p, the coefficient vector (a1,…,ak)′ equals a(1,k) = R−1(k)(γ1,…,γk)′, where R(k) = E {[xt(k) − E(xt(k))][xt(k) − E(xt(k))]′} and γj = E {[xt − E(xt)][xt−j − E(xt−j)]}.) Therefore, by the invariance property of the MLE, the plug-in estimator,

is asymptotically equivalent to the MLE of

Observe that a(h,k) with k ≥ p is also the coefficient vector of the h-step prediction formula corresponding to model (1), namely,

These facts suggest that when {xt} is Gaussian,

with k ≥ p may perform well compared to the other predictors of the same AR order. However, because it is difficult for the practitioner to know whether k ≥ p, or {xt} is Gaussian, the advantage of

can not be guaranteed. In this situation, the direct predictor, suggested by Findley (1984), is also frequently used as an alternative. The direct predictor,

, is obtained through a linear least-squares regression of xt+h on xt,…,xt−k+1, i.e.,

Viewing the preceding two predictors, it is natural to ask which one is better. When h = 1, it is obvious that these two predictors are identical. But for h ≥ 2, this question has not been completely resolved. Recently, Bhansali (1997) has assumed that the process used in estimation and that for prediction are independent (we call this independent-realization prediction), and has compared the mean-squared prediction errors (MSPEs) of the plug-in and direct predictors under non-Gaussian settings. He shows that the plug-in predictor has a smaller MSPE, provided k ≥ p and the terms of order op(1/n) are ignored. Although independent-realization prediction is considered in most related literature (e.g., Shibata, 1980; Bhansali, 1996), it is not a natural assumption for time series analysis, because when new observations of a time series become available, they are not independent of the previous data. Although it would seem to be more convincing to have a theoretical comparison between these two multistep predictors obtained without this unnatural assumption, to the author's knowledge, no conclusive results have been given in the existing literature.
To compare the performances of the plug-in and direct predictors, in Section 2, we consider the following (same-realization) multistep MSPEs:

and

for h ≥ 1. Under rather mild conditions, expressions for MSPEPh(k) and MSPEDh(k), up to terms of order 1/n, are obtained in the situation where k ≥ p (see Theorems 1 and 2, which follows). These expressions show that for h ≥ 2,

a conclusion that coincides with that of Bhansali (1997) for the independent-realization setting. In addition, we also show in Section 2 that when k ≥ p is fixed, the advantage of the plug-in predictor with respect to the direct predictor increases with h.
Theorem 3 in Section 2 considers the difference between MSPEPh(k) and MSPEPh(k + 1) and that between MSPEDh(k) and MSPEDh(k + 1) for k ≥ p. When k ≥ p, it is shown in Theorem 3 that

Therefore, the (strict) parsimony principle (Findley and Wei, 2002, Sect. 3), which asserts that if two competing models are both correctly specified, then the larger estimated model has a larger limiting (second-order) MSPE, still holds for multistep predictions. It is also worth noting that although these differences are of order 1/n, and are often ignored by the practitioner, they play important roles in order selection problems (see the discussion following Theorem 3 for more details). At the end of Section 2, attention is focused on the misspecified case. In contrast to the result obtained in (7), if k < p, then except on a zero-volume subset of the parameter space,

see Theorem 4 in Section 2 for more details.
In Section 3, asymptotic expressions for the MSPEs of the plug-in and direct predictors are obtained in the situation where a deterministic time trend is included in model (1) (see Corollaries 1 and 2). Various comparisons of these MSPEs are also performed at the end of Section 3. In Section 4, two examples are presented illustrating some interesting phenomena associated with the plug-in and direct predictors with nonstationary AR models. The first example shows that the left-hand side of (7) (with k = 1 and h ≥ 2) will converge to 0 in the random walk case. Therefore, the advantage of the plug-in predictor vanishes even when k ≥ p. The second example shows that the strict parsimony principle mentioned previously does not hold for the plug-in predictor in certain nonstationary AR (2) models. Proofs for the results in Sections 2 and 3 are deferred to Appendixes A and B, respectively.
In the discussion that follows, we shall frequently use the following condition on the distribution function of ε1,F(·). For some positive numbers α, η, and M,

provided |x − y| < η. Condition (8) is fulfilled by any distribution function with bounded density. Some distribution functions with unbounded density also satisfy (8). For more details on this condition, see Findley and Wei (2002, Sect. 4). When data are generated from model (1), Theorems 1 and 2 deal with asymptotic expressions for MSPEPh(k) and MSPEDh(k) when k ≥ p, respectively. Their proofs are given in Appendix A.
THEOREM 1. Assume that observations x1,…,xn are generated from model (1) with ε1 satisfying (8) and

where θh = max{8,2(h + 1)} + δ for some δ > 0. Then, for k ≥ p and h ≥ 1,
Remark 1. Condition (8) is used to ensure that for any q > 0,

holds for n sufficiently large, where

and ∥G∥ = sup∥z∥≤1∥Gz∥ for matrix G (see Lemma A.1 in Appendix A for more details). Equality (11) was first proven by Fuller and Hasza (1981) for stationary Gaussian processes. For various generalizations of their result, see Bhansali and Papangelou (1991), Papangelou (1994), Ing and Wei (2002), and Findley and Wei (2002). By directly assuming that (11) holds, Kunitomo and Yamamoto (1985, Corollary 6) have established (10) with θh in (9) replaced by max{32,16h}. Obviously, their assumptions are more stringent than those used in Theorem 1.
THEOREM 2. Let the assumptions of Theorem 1 hold with θh in (9) replaced by 8 + δ, for some δ > 0. Then, for k ≥ p and h ≥ 1,
and for random vector z, cov(z) = E[(z − E(z))(z − E(z))′].
A comparison between the first terms on the right-hand side of (10) and (12), f1,h(k) and f2,h(k), respectively, is given as Proposition 3.2 by Bhansali (1997), which shows that for k ≥ p ≥ 1 and h ≥ 2,

This result and Theorems 1 and 2 together imply that when the model is correctly specified, the plug-in predictor has an advantage over the direct predictor, provided the terms of order O(n−3/2) are ignored. For example, assume h = 2 and k ≥ p ≥ 1. Then,

and

(Recall that ak = 0 for k > p and that |ap| < 1 in the stationary case.) Hence, for k ≥ p,

Moreover, let k ≥ p ≥ 1 be fixed. Then, it can be shown that f2,h(k) − f1,h(k) is a nondecreasing function of h. Therefore, the advantage of the plug-in predictor with respect to the direct predictor becomes more significant as h increases. To see this, observe that
where the third equality follows from A′(k)R(k)A(k) = R(k) − σ2ekek′, with k-dimensional vector ek = (1,0k−1′)′. In addition, one also has

As a result,

which gives the asserted property.
The following result establishes that the second-order terms of MSPEPh(k) and MSPEDh(k) are strictly increasing functions of k in the correctly specified case.
THEOREM 3.
(i) Assume h ≥ 1 and k ≥ p. Then,

provided

or

where with the convention that

is a (k + 1)-dimensional vector.
(ii) Assume h ≥ 1 and k ≥ p. Then,

Remark 2. When 1 ≤ h ≤ 5, it can be shown that either (19) or (20) holds for all k ≥ p. In addition, if h − 1 ≤ k, then the (k + 2 − h)th entry of l* is b02 = 1. In these cases, (18) holds without extra constraints on the parameter space. In general, (19) (with h ≥ 2) and (20) only exclude at most a zero-volume subset in the parameter space.
Under the assumptions of Theorem 1 and (20) (or (19)), we conclude from (10) and (18) that for h ≥ 1 and k ≥ p,

Similarly, when the assumptions of Theorem 2 hold, (12) and (21) also yield

for h ≥ 1 and k ≥ p.
Kunitomo and Yamamoto (1985, Theorem 4) obtain that f1,h(k + 1) ≥ f1,h(k) when k ≥ p and h ≥ 2 (see also (A.26)). However, from the order selection point of view, Kunitomo and Yamamoto's result is not sharp enough. To see this, first consider the following multistep generalizations of accumulated prediction errors (APEs) based on sequential plug-in and direct predictors:

respectively, where m is the smallest positive number such that

are well defined for all i ≥ m. Note that the APE with h = 1 was first proposed by Rissanen (1986) for the purpose of use for determining p. For h = 1, Hemerly and Davis (1989), under certain conditions, prove that

is a strongly consistent estimator of p in the sense that

Here, K is a prescribed upper bound of p. Under the conditions similar to those used in Hemerly and Davis (1989), Ing (2002) further shows that for h > 1

and

as k ≥ p. As is clear from (24) (or (25)), without the strict inequality, (18) (or (21)), it does not seem possible for

with h ≥ 2 to be strongly consistent. For more details on the statistical properties of APEPn,h(k) and APEDn,h(k), see Ing (2002).
The following theorem compares MSPEPh(k) and MSPEDh(k) in the situation where k < p.
THEOREM 4. Assume that observations x1,…,xn are generated from model (1) with 1 ≤ p ≤ ∞. (Here, p = ∞ means that {xt} is truly an AR(∞) process. In this case,

is assumed instead of ap ≠ 0.) Also assume that ε1 satisfies (8) and E(|ε1|4h+2+δ) < ∞, for some δ > 0. Then, for h ≥ 2 and 1 ≤ k < p,

where aD(h,k) = R−1(k)(γh,…,γh+k−1)′ and a(h,k) is defined in Section 1. Moreover, if

for at least one positive integer s satisfying h ≤ s ≤ k + h − 1, then for h ≥ 2 and 1 ≤ k < p,

where γj* = γj for 1 ≤ j ≤ k and γj* = aD(1,k)′(γj−1*,…,γj−k*)′ for j ≥ k + 1.
Remark 3. Because p is allowed to be infinite, Theorem 4 covers the causal and invertible autoregressive moving average (ARMA) process as a special case. When (27) is violated, γmax{h,k+1},…,γk+h−1 must be functions of γ0,…,γk. Therefore, (27) only excludes at most a zero-volume subset in the parameter space. In particular, (27) holds automatically in the situation where p ≤ k + h − 1 and h ≤ k + 1 (e.g., h = 2 and k = p − 1), because if (27) is violated in this situation, then ak+1 = ··· = ap = 0, which contradicts the assumption that ap ≠ 0.
Theorem 4 and Remark 3 assert that in the misspecified case, the direct predictor is superior to the plug-in predictor for almost all points in the parameter space. On the other hand, we have found examples showing that when (27) is violated, the plug-in predictor can be better than the direct predictor in the sense of (7). However, to obtain a more conclusive result for the situation where (27) does not hold, it is necessary to compare MSPEPh(k) and MSPEDh(k), up to terms of order 1/n. Because this comparison is quite complicated, we do not pursue these details in this paper. For a related result on an asymptotic expression for MSPEPh(k), up to terms of order 1/n, in the misspecified case, see Kunitomo and Yamamoto (1985, Theorem 3).
This section investigates performances of the plug-in and direct predictors in stationary AR models around deterministic time trends. Assume that observations x1,…,xn come from the following model:

where q0 is a nonnegative integer, βi's are unknown real numbers, and p, ai's and εt are defined in model (1). We also assume that q0 in model (29) is known to simplify the discussion. With an argument similar to that used in Theorem 3.1.1 of Brockwell and Davis (1987) and some algebraic manipulations, xt can be expressed as

where βi*'s are functions of βi's and ai's and

with bi's defined in Section 1, is a stationary AR(p) process satisfying model (1). For example, if q0 = 1 (linear time trend), then

Under model (29), the plug-in predictor of

, has the following representation:

where

is a (q0 + 1 + k)-dimensional vector,

,
is a (q0 + 1 + k) × (q0 + 1 + k) matrix. Here,

is a (q0 + 1) × (q0 + 1) upper triangular matrix with Clr = r!/(l!(r − l)!), 0 ≤ l ≤ r,

is a (q0 + 1) × k matrix, 0k×(q0+1) is a k × (q0 + 1) matrix of zeros, and

is the matrix

(see Section 1) with

replaced by

. The corresponding direct predictor,

, is

Corollary 1 establishes an asymptotic expression for the MSPE of

, k ≥ p, under non-Gaussian settings.
COROLLARY 1. Assume that in model (29) ε1 satisfies (8) and for any q > 0,

Then, for k ≥ p and h ≥ 1,

where

with 1q0+1 denoting a vector of 1's of dimensional q0 + 1 and

being a (q0 + 1) × (q0 + 1) matrix.
Remark 4. As observed in (34), the (second-order) MSPE of the plug-in predictor is the sum of two terms. By comparing (34) with (10), the first term, Cq0,h, can be viewed as the loss due to forecasting the deterministic time trend,

, in (30), and the second term, f1,h(k), can be viewed as the loss due to forecasting the stationary process, yt, in (30). Equality (34) considerably extends (2.5) of Fuller and Hasza (1981), which provides an asymptotic expression for

in the situation where q0 = 0 (constant time trend) and εi's are independent Gaussian random variables, each with mean 0 and variance σ2.
Corollary 2 provides an asymptotic expression for the MSPE of

with k ≥ p.
COROLLARY 2. Let the assumptions of Corollary 1 hold. Then, for k ≥ p and h ≥ 1,

The (second-order) MSPE of the direct predictor is also the sum of two different losses due to forecasting two different components in model (30), and the loss due to forecasting the deterministic time trend is exactly the same as that of the plug-in predictor. To illustrate the preceding theoretical results, assume that q0 = 1 and h = 2. In this case, Cq0,h = 4(1 + a1)2σ2. Hence, for k ≥ p,
In general, one has for k ≥ p and h ≥ 2,

Therefore, the plug-in predictor is still better than the direct predictor in the sense of (36). In addition, by Corollaries 1 and 2 and Theorem 3, when k ≥ p and h ≥ 1, the strict parsimony principle still holds for the plug-in and direct predictors in stationary AR models with deterministic time trends.
The following corollary (Corollary 3) compares the performances of

and

with k < p. It shows that if (27) holds, then for h > 1 and k < p, the direct predictor is better than the plug-in predictor, a conclusion that coincides with that of Theorem 4 for the zero mean process. Like Theorem 4, Corollary 3 also allows p in model (29) to equal ∞. In this case,

is assumed instead of ap ≠ 0.
COROLLARY 3. Assume that in model (29) 1 ≤ p ≤ ∞ and ε1 satisfies (8) and (33). Then, for h ≥ 2 and 1 ≤ k < p,

Moreover, if (27) holds, then for h ≥ 2 and 1 ≤ k < p,

Although the advantage of the plug-in predictor with respect to the direct predictor is guaranteed in the situation where the underlying process is stationary and k ≥ p, this is not the case for the random walk model,

even if the assumed model is correctly specified. Throughout this section, we assume that {εt} is a sequence of independent Gaussian random variables, each with mean 0 and variance σ2.
PROPOSITION 1. Let observations x1,…,xn come from model (37) with the initial condition x0 = 0. Then for h ≥ 1,

Consequently,

The proof of Proposition 1 is similar to that of Corollary 1 of Ing (2001). We omit the details. In the rest of this section, we consider the following nonstationary AR(2) model:

Proposition 2, which follows, shows that under model (38) the plug-in two-step-ahead predictor obtained from the AR(2) model and that obtained from the AR(3) model have the same prediction efficiency. (Recall that in the stationary AR(2) model, Remark 2 and (22) show that the plug-in two-step-ahead predictor obtained from the AR(2) model is strictly better than that obtained from the AR(3) model.)
PROPOSITION 2. Let observations x1,…,xn come from model (38) with the initial condition xi = 0 for i = 0,−1. Then,
Remark 5. A complete verification of Proposition 2, which requires a rather subtle argument, is not presented in this paper, but it is available from the author. We also note that the ambiguity encountered with plug-in predictors stated in Proposition 2 does not exist for their corresponding direct predictors because it can be shown that

The main purpose of this section is to show that some stationary case results on MSPEs of the plug-in and direct predictors can not be generalized to nonstationary cases. However, to gain a deeper understanding of these predictors' performances in nonstationary cases, extensions of Proposition 1 (or 2) to more general nonstationary AR models are needed. Further investigation into this question would be interesting.
In the following, we use C to denote a generic positive constant independent of the sample size n. To verify Theorems 1 and 2, we begin with the following three lemmas, Lemmas A.1, A.2, and A.3, which are immediate consequences of Lemma 1, Theorem 2, and Lemma 4 of Ing and Wei (2002), respectively.
LEMMA A.1. Let the assumptions of Theorem 1 hold with θh in (9) replaced by 2. Then, for any positive integer k and any q > 0,

holds for sufficiently large n.
LEMMA A.2. Let the assumptions of Theorem 1 hold with θh in (9) replaced by max{2q1,4}, for some q1 > 0. Then, for any positive integer k and any 0 < q < q1,

holds for sufficiently large n.
LEMMA A.3. Assume that {xt} satisfies model (1) with E(|ε1|q) < ∞ for some q ≥ 2. Then, for any positive integer k,

holds for n ≥ k + 1, where for vector

.
Proof of Theorem 1. In view of (2) and (3),

Some algebraic manipulations yield

where

and cn = 0 for h = 1 and

for h ≥ 2. By Lemmas A.1 and A.3, Hölder's inequality, and (9), one has for h ≥ 2 and all l = 2,…,h,

where q ≥ [lfloor ]2(h + 1)/δ[rfloor ] + 1, and for real number a, [lfloor ]a[rfloor ] denotes the largest integer ≤ a. Moreover, because xt can be expressed as

with bj satisfying bj2 ≤ νe−βj for some ν,β > 0, by Lemma 2 of Wei (1987),

for l ≤ h. Now by (A.3)–(A.5) and Hölder's inequality,

for h ≥ 2.
To deal with Ph(k), first define

and gn = n − (2/β)log n − 2k − 2. If one can show that

and

then the desired result (10) follows from (A.1), (A.2), (A.6), (A.8), (A.9), and the Cauchy–Schwarz inequality.
To obtain (A.8), first observe that

where R*(k) = E(xn*(k)xn*′(k)). Simple algebra gives

Because

, (A.8) follows from this, (A.10), and (A.11).
For the proof of (A.9), write
By Hölder's inequality, Lemmas A.1 and A.2, an analogy with Lemma A.3, Lemma 2 of Wei (1987), and (9), the following equalities hold:


and

These equalities and (A.8) further imply that

and

In view of (A.13)–(A.17), (A.9) is guaranteed if we can show that

Rewrite (III) as
where vn = n − (1/β)log n − k − 1. By an analogy with Lemma A.3 and Lemma 2 of Wei (1987),

This and the Cauchy–Schwarz inequality yield

and hence

By independence, one also has

Consequently, (A.18) follows from (A.19)–(A.21). █
Proof of Theorem 2. Rearranging the order of summation, we have
Note that in this proof, xj(k) is set to 0k, provided j < k or j > n − h. By arguments similar to those used for verifying (A.8) and (A.9),

Consequently, (12) follows from (A.22) and (A.23). █
Proof of Theorem 3. We first prove (18). By (D.3) of Kunitomo and Yamamoto (1985),

where l′ = (ak,…,a1,−1) is a (k + 1)-dimensional vector. Also observe that

where

is a k-dimensional vector. Equalities (A.24) and (A.25) yield

Therefore, if (19) (bh−1 ≠ 0) holds, then (18) follows from (A.26), Lh(k + 1)l ≠ 0k+1, and the positive definiteness of R(k + 1).
On the other hand, assume that (20) (l* ≠ 0k+1) holds. Notice that for j ≥ 0,

One also has

for j ≥ 0. These in turn imply that the second term on the right-hand side of (A.26) equals σ4l*′R−1(k + 1)l*, which is positive according to (20) and the positive definiteness of R−1(k + 1). As a result, (18) follows.
To show (21), first observe that

where the second equality is ensured by (A.27). Because tr(Aj(k + 1)) = tr(Aj(k)) for j ≥ 1 (see also Kunitomo and Yamamoto, 1985), (D.1), this fact and (A.28) give

as asserted. █
The following technical lemma is needed for verifying Theorem 4. Its proof can be found in Ing and Wei (2002, Lemma 3).
LEMMA A.4. Assume that {xt} satisfies model (1) with E(|ε1|2q) < ∞ for some q ≥ 2. Then, for any pair of positive integers (h,k) with h ≥ 1 and k < p,

holds for sufficiently large n, where aD(h,k), defined in Theorem 4, is now viewed as a p-dimensional vector with undefined entries set to 0.
Proof of Theorem 4. For k < p,

where a(h,p) is defined in Section 1 and aD(h,k) in this proof is sometimes viewed as a p-dimensional vector with undefined entries set to 0. Express the last term on the right-hand side of (A.29) as

According to Hölder's inequality, the expectation of the square of (A.30) is bounded by
where dn = (n − h − k − 1)−1 and q > 1 + (6/δ). By Lemma A.4 and an analogy with Lemma A.3, the first component of (A.31) is of order O(1/n), provided

Moreover, by Lemma 2 of Wei (1987) and Lemma A.1, the remaining components of (A.31) are both of order O(1) if (A.32) holds. Consequently, (A.31) is of order O(1/n) because (A.32) is guaranteed by the assumption that E {|ε1|4h+2+δ} < ∞ for some δ > 0. This fact, the Cauchy–Schwarz inequality, and (A.29) further yield

For MSPEPh(k), we have

By arguments similar to those used for proving (A.6) and (A.33), the expectation of the square of the last term on the right-hand side of (A.34) is of order O(1/n). This result and the fact that the first three terms on the right-hand side of (A.34) are pairwise uncorrelated imply that
In view of (A.33) and (A.35), (26) follows. To show (28), first observe that for k < p,

This identity, the definition of aD(h,k), condition (27), and the positive definiteness of R−1(k) yield the desired property. █
Remark A.1. By an argument similar to that used for verifying Theorem 3 of Ing and Wei (2002),

in (A.33) and (A.35) can be weakened to O(1/n) under a slightly stronger moment condition. However, because the main concern of Theorem 4 is with the terms of order O(1), pursuing this more delicate result does not seem necessary.
The h-step prediction model corresponding to model (29) is
B2(k) with k ≥ p is the matrix

replaced by βi for i = 0,…,q0 (note that for k < p, the definition of B2(k) is slightly different; see the proof of Corollary 3, which follows, for details), and b(h,k) = Bh−1(k)(β0,…,βq0,a1,…,ak)′ for k ≥ p. Inspired by Chapter 16 of Hamilton (1994), which deals with parameter estimation and hypothesis testing problems under model (29) with q0 = 1, we consider a linear transformation of

. Here,

is a (q0 + 1 + k) × (q0 + 1 + k) matrix, and

is a k × (q0 + 1) matrix with

being defined in (30). Observe that

where yt is defined in (30), and that

for k ≥ p.
Define the normalized sample covariance matrix

as
with Dn = diag(1,(n + 1)−1,…,(n + 1)−q0) being a diagonal matrix of dimension q0 + 1. The following two lemmas deal with moment properties of

.
LEMMA B.1. Let the assumptions of Corollary 1 hold. Then, for any positive integer k and any q > 0,

holds for sufficiently large n.
LEMMA B.2. Let the assumptions of Corollary 1 hold. Then, for any positive integer k and any q > 0,

holds for sufficiently large n, where

with Cq0* defined in Corollary 1 and R(k) defined in Section 1.
Lemmas B.1 and B.2 can be shown by arguments similar to those used for verifying Lemma 1 and Theorem 2 of Ing and Wei (2002), respectively. We omit the details to save space. By analogy with Lemma A.3, Lemma B.3 is obtained as follows.
LEMMA B.3. Assume that {xt} satisfies model (29) with E(|ε1|q) < ∞ for some q ≥ 2. Then, for any positive integer k,

holds for n ≥ k + 1.
Based on (B.2) and some tedious calculations, we obtain the following results, which play important roles in proving Corollary 1.
LEMMA B.4. For k ≥ p,

Hence, for k ≥ p and h ≥ 1,
Proof of Corollary 1. By (31), (B.1), Lemma B.4, and some algebraic manipulations, one has

where

for h = 1, and

for h ≥ 2. Because

by Lemmas B.1 and B.3, (B.4), and Hölder's inequality,

According to Lemmas B.1–B.3 and arguments similar to those used for verifying (A.8) and (A.9), one has
and

. By Lemma B.4, it can be shown that

This fact, the definition of

, and (B.6) yield

Consequently, (34) follows from (B.3), (B.5), and (B.7). █
Proof of Corollary 2. Equality (35) can be shown by arguments similar to those used for proving Theorem 2 and Corollary 1. The details are omitted. █
Proof of Corollary 3. For the plug-in predictor, one has for k < p,

where the definition of B(k) with k < p and that with k ≥ p are the same, but the first column of B2(k), the upper-right (q0 + 1) × k submatrix of B(k), in the case of k < p is (β0*,…,βq0*)′ + T′(k)a(1,k) instead of (β0,…,βq0)′, and b(1,k) with k < p is a (q0 + 1 + k)-dimensional vector defined by ((β0*,…,βq0*) + a′(1,k)T(k),a′(1,k))′. Because it can be shown that Lemma B.4 still holds with k < p, one has

where yj(l) = (yj,…,yj−l+1)′. Moreover, by Lemmas A.4, B.1, and B.3 and an argument similar to that used for showing (B.5),

As a result,
follows from (B.8)–(B.10) and an analogy with (A.35).
Similarly, it also can be shown that

Consequently, Corollary 3 follows from (B.11), (B.12), and an argument similar to that used for verifying (28). █