Extracted main text — title through conclusion, appendix excluded. This is what our citation measures are computed over, published so the extraction can be checked by eye.
Rendered from LaTeX for readability, not typeset faithfully. Citation keys are highlighted; maths is left as source; figures, tables and equation environments are summarised rather than reproduced; unrecognised commands are greyed out so nothing is silently dropped. Email addresses are removed.
This text was truncated for display. The citation measures were computed over the complete text.
A general randomized test for Alpha
\address{\textsuperscript{1}King's Business School, King's College London, UK
}
\address{\textsuperscript{2}Cambridge Judge Business School and Girton
College, University of Cambridge, UK; and Centre for Economic Policy
Research (CEPR)}
\address{\textsuperscript{3}Universita' di Pavia, Italy}
\address{\textsuperscript{4}University of
Leicester, UK}
\address{\textsuperscript{5}Institute of Finance, Universita' della
Svizzera Italiana (USI Lugano), Switzerland}
adjustwidth{-10pt}{-10pt}
\begin{abstract}
We propose a methodology to test for the null hypothesis that the alphas of a panel of asset returns are jointly equal to zero in a linear factor pricing model with observable and tradable factors --- that is, the
null of \textquotedblleft zero alpha{\textquotedblright}. The test is based on equation-by-equation estimation, using a randomized version of the estimated alphas, which only requires rates of convergence. The distinct features of the proposed methodology are that it does not require the estimation of any covariance matrix, and that it allows for both $N$ and $T$ to pass to infinity, with the former possibly faster than the latter. Further, unlike extant approaches, the procedure can accommodate conditional heteroskedasticity, non-Gaussianity, and strong cross-sectional dependence in the error terms. We also propose a derandomized decision rule to choose in favor or against the correct specification of a linear factor pricing model. Monte Carlo simulations show that the test has satisfactory properties and it compares favorably
to several existing tests. The usefulness of the testing procedure is illustrated through an application of linear factor pricing models to the constituents of the S{&}P 500.
\end{abstract}
\doublespacing
Introduction
Testing for \textquotedblleft alpha\textquotedblright\ -
i.e. the component of expected returns that cannot be explained by a linear factor model - is central in asset pricing, and yet
poses a number of issues. Available testing procedures are often marred by
low power or poor size control, hinge on strong assumptions on the data
generating process (DGP), and generally involve the estimation or inversion
of (often large) covariance matrices giglio2022factor. \newline
In this paper, we propose a general methodology to test for
\textquotedblleft zero alpha\textquotedblright\ - that is the null that for each test asset, on average, realized excess returns equal those implied by a linear factor pricing model. In order to make the presentation easier to follow, we mainly
focus on the following linear factor pricing model with tradable
and observable factors
equation[equation omitted — 285 chars of source]
where: $y_{i,t}$ is the excess return on the $i$-th security at time $t$; $
f_{t}$ is a $K$-dimensional vector of pricing factors; $
{\Greekmath 010C} _{i}$ is a $K$-dimensional vector of factor loadings; and $u_{i,t}$ is
a zero mean error term. Equation ((ref)) is the workhorse model
employed in asset pricing, and it encompasses several popular specifications
such as the Capital Asset Pricing Model (CAPM; see sharpe1964capital), and the three- and five-factors models (fama1993common; and fama2015five).\footnote{In Sections (ref) and (ref) in the Supplement, we study the extension to the cases of non-tradable and of latent factors respectively.} In the context of ((ref)), we propose a novel approach to test for the null hypothesis
that all the ${\Greekmath 010B} _{i}$s are jointly equal to zero versus the alternative
that at least one ${\Greekmath 010B} _{i}$ is nonzero, viz.
eqnarray[eqnarray omitted — 340 chars of source]
We base our analysis on the equivalent version of ((ref))
equation[equation omitted — 185 chars of source]
Testing for ((ref)) is interesting per se. In the
context of asset pricing, ((ref)) implies $\mathbb{E}
\left( y_{i,t}\right) ={\Greekmath 010B} _{i}+{\Greekmath 010C} _{i}^{\prime }\mathbb{E}\left(
f_{t}\right) $; hence, ${\Greekmath 010B} _{i}$ represents the excess return on the $i$-th test asset not explained by the $K$ factors. When no relevant pricing factor is omitted from (ref), a non-zero ${\Greekmath 010B}_i$ can still appear due, for example, to market rigidities that prevent security prices from reaching their theoretical fair values and that are not allowed for in the factor pricing model. As these securities are misspriced, this ${\Greekmath 010B}_{i}$ is often called pricing error. However, a non-zero ${\Greekmath 010B} _{i}$ can originate from multiple other sources of model misspecification, such as the omission of one or more pricing factors and/or non-linear pricing relations. Hence, depending on the nature of model misspecification, ${\Greekmath 010B} _{i}\neq0$ is not necessarily a pure pricing error but rather a signal that the model in (1.1) is misspecified from an asset pricing perspective.\footnote{In the case of testing for alpha in fund returns, rather than security returns, alpha can also capture skill of the fund manager giglio2021thousands.}
comment\footnote{
The null in ((ref)) differs from that of e.g.
giglio2021thousands, who test $N$ times whether the $i$-th
cross-sectional unit has non-positive ${\Greekmath 010B} _{i}$. Further, from
a methodological viewpoint, the paper by giglio2021thousands deals with handling a multiple testing problem, while our
procedure considers a one-shot test.}
commentIndeed, under the null hypothesis the risk-return
tradeoff is fully captured by the model in ((ref)), hence being
also equivalent to a test of Mean-Variance Efficiency conditional on the set
of pricing factors $\left\{ f_{t},1\leq t\leq T\right\} $ - see
sentana2009econometrics, and the references therein.
Arguably, the first contribution to propose a test for \textquotedblleft
zero alpha\textquotedblright\ in linear pricing models is the
paper by gibbons1989test, where an $F$-test is
proposed for the joint null hypothesis that ${\Greekmath 010B} _{1}={\Greekmath 010B}
_{2}=...={\Greekmath 010B} _{N}=0$. Such an approach is entirely natural, but - as well as needing several restrictions on the error terms $u_{i,t}$ - it requires the restriction that $N$ is fixed with $
N<T$, because the test uses a (consistent) estimate of the $N\times N$
covariance matrix of the regression residuals, which subsequently needs to
be inverted. Hence, the case $N>T$, often encountered in
applied work, cannot be addressed with the GRS test. fan2015power,
gagliardini2016time and pesaran2023testing propose several
solutions towards this technical difficulty by developing average-type alpha
tests - i.e.\ tests where individual statistics on each of the ${\Greekmath 010B} _{i}$
s are averaged - for the joint
asymptotics case $\min \left\{ N,T\right\}
\rightarrow \infty $. All these tests can deal with cross-sectional
dependence among the errors (in essence, allowing for
cross-sectional dependence as long as a Central Limit Theory holds for
cross-sectional averages). However, their implementation still hinges on
estimating a large dimensional, $N\times N$ covariance matrix, which
requires several restrictions on the covariance structure of the errors, and
which can become computationally intensive when certain estimators are
considered (this is e.g.\ the case for the threshold estimator of
bickel2008regularized, used by gagliardini2016time). Further, all the tests mentioned above are based on the
assumption of serially independent errors, which is bound to cause problems
in the presence of conditional heteroskedasticity, and the approaches by
fan2015power and gagliardini2016time further require
Gaussian errors. In a recent contribution, feng2022high propose a
max-type test for the null that $\max_{1\leq i\leq N}\left\vert {\Greekmath 010B}
_{i}\right\vert =0$; their test is based on using the maximal t-statistic, and therefore its asymptotics hinges on an
Extreme-Value-type argument, rather than a \textquotedblleft
central\textquotedblright\ one like average-type tests. As we also discuss in greater detail in Section (ref), their
asymptotics requires weak cross-sectional dependence (and serial independence). ardia2024robust test the null hypothesis in ((ref)) whether all alphas are zero by combining $p$-values from asset-specific
tests using the Cauchy combination approach proposed
by liu2020cauchy. While their test can be applied under quite
general assumptions, its implementation hinges on several tuning parameters
which significantly impact the outcome of the procedure. Finally,
chernov2025test directly generalize the GRS test to the
high-dimensional case by considering a ridge-regularized estimator of the $
N\times N$ covariance matrix of the residuals, still resting on similar assumptions to those of the average-type tests discussed above.\footnote{
Other relevant references include gungor2016multivariate,
ma2020testing, and raponi2020testing. Further, the correct
specification of linear factor pricing models can also be assessed by
testing whether they imply a pricing kernel with zero Hansen-Jagannathan
distance (see e.g., hansen1997assessing,
hodrick2001evaluating, and carrasco2022hansen).}
Testing methodology and the contribution of this paper
In this paper, we fill the gaps mentioned above, by proposing a test for (
(ref)) which allows for the errors to have:
(i) (weak) serial dependence, including conditional
heteroskedasticity such as volatility clustering, or the
\textquotedblleft leverage effect\textquotedblright\ (
black1976studies); (ii) non-Gaussianity, such as
skewness and excess kurtosis, indeed relaxing some of the moment assumptions in the aforementioned papers; (iii) strong cross-sectional dependence;
and also (iv) allowing for $N>T$. Importantly, as we further explain in Section (ref), our test statistic
only requires a consistent estimator (and its rate of convergence) for the individual ${\Greekmath 010B} _{i}$s, whereas no second order property (such as asymptotic Gaussianity, or asymptotic efficiency) is needed. This allows to ignore the cross-sectional structure of the data, and therefore the test
does not require the estimation of any $N\times N$ covariance matrices, and
needs virtually no tuning. \\
The technical details are described in the next sections; here we
offer a preview of the main arguments, which are based on the construction
of a randomized test statistic. In order to construct the test
statistic, we estimate the ${\Greekmath 010B} _{i}$s from $N$ separate time series
regressions, unit by unit: at no stage do we require joint estimation.
Although any consistent estimator can be employed, here we use OLS,
obtaining, say, $\widehat{{\Greekmath 010B} }_{i}$. Under our assumptions, it can be
expected that $\widehat{{\Greekmath 010B} }_{i}$ will converge to ${\Greekmath 010B} _{i}$ at a
rate $T^{-1/2}$. We then pre-multiply each $\left\vert \widehat{{\Greekmath 010B} }
_{i}\right\vert $ by a function of $T$ which diverges as $T\rightarrow
\infty $, but at a rate slower than $O\left( T^{1/2}\right)$. Hence, we
obtain $N$ statistics which drift to zero when ${\Greekmath 010B}
_{i}=0$, and diverge to positive infinity whenever ${\Greekmath 010B} _{i}\neq 0$. We
then perturb the resulting $N$ statistics by adding to each of them a $
\mathcal{N}\left( 0,1\right) $ shock, with the $N$ shocks forming an
i.i.d. sequence. As a consequence, we obtain an $N$-dimensional sequence
which, under $\mathbb{H}_{0}$, is (roughly) \textit{i.i.d.}$\mathcal{N}
\left( 0,1\right) $ conditionally on the sample. Finally, we take the
largest of these perturbed statistics as a test statistic for $\mathbb{H}_{0}
$ in ((ref)): conditionally on the sample, this
is distributed as a Gumbel under $\mathbb{H}_{0}$, whereas it diverges under the alternative that
at least one asset is mis-priced. This methodology has, at least
conceptually, some similarities with the one proposed in fan2015power
, where a sequence is added to a test statistic, constructed so as to drift
to zero under the null (thus introducing no distortion in the asymptotics
under the null), and diverging under the alternative (so as to boost the
power). However, unlike fan2015power, we do not need to estimate at
any stage the asymptotic covariance matrix of the estimated $\mathbf{{\Greekmath 010B} }
=\left( {\Greekmath 010B} _{1},...,{\Greekmath 010B} _{N}\right) ^{\prime }$, or define a
high-dimensional weight matrix: only the individual, unit-by-unit, estimates
of the ${\Greekmath 010B} _{i}$s are required. Moreover, we only require a rate of
convergence for the estimate $\widehat{{\Greekmath 010B} }_{i}$. Hence, the assumptions
on serial dependence and moment existence can be relatively mild.
To the best of our knowledge, our contribution is the first application to asset pricing of
tests based on randomizing a function of the data, i.e.\ a statistic. While novel to this setting, this type of randomized tests have been
used in econometrics and statistics, particularly where a limiting
distribution is unavailable or non-pivotal, or where its derivation requires
excessively restrictive assumptions; although a comprehensive literature
review goes beyond the scope of this paper, we refer to corradi2006
for a first application of these randomized tests in econometrics, and
to the paper by he2023one for references.\footnote{We emphasize that this paper is not, in general, the first alpha testing procedure based on a randomization. The literature has considered bootstrap-based tests for alpha; see, for example, sullivan1999data, white2000reality, kosowski2006can and fama2010luck. While bootstrap and randomization are both based on an added source of randomness, their core statistical mechanisms are very different, and we extensively discuss similarities and differences between bootstrap and randomized tests in Section (ref).
}
We make at least four contributions to the current literature. First, whilst
we focus on the specific case of \textquotedblleft testing for
alpha\textquotedblright , we propose a novel methodology to construct tests
involving a growing number of parameters with no need for joint estimation
and, in essence, no need to take the dimensionality of the problem into
account. In a similar spirit, although in ((ref)) we assume
that the common factors $f_{t}$ are the same across all units, our approach
can be readily extended e.g.\ to the case where pricing factors are
heterogeneous across assets. Indeed, the factor structure could be so
heterogeneous that no factor influences all the assets, which makes our
testing procedure robust to the presence of weak and semi-strong pricing
factors, and
we do not need any factor to be \textquotedblleft strong\textquotedblright\
in our model.\footnote{
Following chudik2011weak, the $k$-th pricing factor is strong if ${\Greekmath 010C}
_{i,k}\neq 0$ for all $i=1,\dots ,N$; and it is weak (resp. semi-strong) when ${\Greekmath 010C}
_{i,k}\neq 0$ for $\lfloor N^{{\Greekmath 010D} }\rfloor $ of the assets with $0<{\Greekmath 010D}
<1/2$ (resp. $1/2\leq {\Greekmath 010D} <1)$.
} Second, we relax several
technical conditions required in the extant literature, allowing for
serial and cross-sectional dependence, conditional
heteroskedasticity, thicker tails and a larger $N/T$ ratio than allowed for
in other contributions. Third, we enhance the randomized test by
proposing a decision rule which shows excellent control for Type I and Type
II errors in simulations. Fourth and last, our methodology is flexible and can be readily extended to other frameworks.
The remainder of the paper is organized as follows. We discuss our set-up
and assumptions in Section (ref). The hypotheses of interest and the
randomized testing approach are discussed in Section (ref); we offer a heuristic description of the core statistical mechanism of our methodology, and its relationship with other randomization methods, in Section (ref); we report
the derandomized decision rule in Section (ref); and, in Section
(ref), we offer guidelines for the practical implementation of our
procedure. Simulations are in Section (ref), while Section
(ref) contains an empirical illustration. Conclusions and further
lines of research are in Section (ref). Further Monte Carlo and empirical
evidence, extensions, technical lemmas and proofs are in the Supplement.
NOTATION. We define the probability space $\left( \Omega ,\boldsymbol{B},
\mathbb{P}\right) $, where $\Omega $ is the sample space with elements $
{\Greekmath 0121} \in \Omega $, $\boldsymbol{B}$ the space of events, and $\mathbb{P}
$ the probability function. Given a random
variable $X$, $\mathbb{E}\left( X\right) $ is the mean and $\mathcal{V}
\left( X\right) $ is the covariance viz. $\mathcal{V}\left( X\right) =
\mathbb{E}\left[ \left( X-\mathbb{E}\left( X\right) \right) \left( X-\mathbb{
E}\left( X\right) \right) ^{\prime }\right] $; further, given $r>0$, we
denote the $\mathcal{L}_{r}$-norm of $X$ as $\left\vert X\right\vert
_{r}=\left( \mathbb{E}\left\vert X\right\vert ^{r}\right) ^{1/r}$. The
indicator function of a set $\mathcal{A}$ is denoted as $\mathbb{I}\left(
\mathcal{A}\right) $. We use: \textquotedblleft a.s\textquotedblright\ for
\textquotedblleft almost sure(ly)\textquotedblright ; \textquotedblleft $
\rightarrow $\textquotedblright\ to denote the ordinary limit; and
\textquotedblleft $\overset{a.s.}{\rightarrow }$\textquotedblright\ to
denote almost sure convergence. Orders of magnitude for an almost surely
convergent sequence with multiparameter index $\Pi $, say $s_{\Pi }$ are
denoted as $O_{a.s.}\left( b_{\Pi }\right) $\ and $o_{a.s.}\left( b_{\Pi
}\right) $\ when, respectively, $\mathbb{P}\left( \limsup_{\Pi \rightarrow
\infty }\left\vert b_{\Pi }^{-1}s_{\Pi }\right\vert <\infty \right) $ $=$ $1$
, and $b_{\Pi }^{-1}s_{\Pi }\overset{a.s.}{\rightarrow }0$, as $\Pi
\rightarrow \infty $. Positive, finite constants are denoted as $c_{0}$, $
c_{1}$, ... and their value may change from line to line. Other, relevant
notation is introduced later on in the paper.
Model and assumptions
Recall our workhorse model ((ref))
equation*[equation* omitted — 96 chars of source]
We begin with a definition of weak dependence which we use throughout the
paper.
definitionThe sequence $\left\{ m_{t},-\infty <t<\infty \right\} $
forms an $\mathcal{L}_{{\Greekmath 0117} }$-decomposable Bernoulli shift if and only if it
holds that $m_{t}=g\left( {\Greekmath 0111} _{t},{\Greekmath 0111} _{t-1},...\right) $, where: (i) $
g:S^{\infty }\rightarrow \mathbb{R}^{k}$ is a non random measurable
function; (ii) $\left\{ {\Greekmath 0111} _{t},-\infty <t<\infty \right\} $ is an
i.i.d. sequence with values in a measurable space $S$; (iii) $\left\vert
m_{t}\right\vert _{{\Greekmath 0117} }<\infty $; and (iv) $\left\vert m_{t}-m_{t,\ell
}^{\ast }\right\vert _{{\Greekmath 0117} }\leq c_{0}\ell ^{-a}$, for some $c_{0}>0$ and $
a>0$, where $m_{t,\ell }^{\ast }=g\left( {\Greekmath 0111} _{t},...,{\Greekmath 0111} _{t-\ell
+1},{\Greekmath 0111} _{t-\ell ,t,\ell }^{\ast },{\Greekmath 0111} _{t-\ell -1,t,\ell }^{\ast
}...\right) $, with $\left\{ {\Greekmath 0111} _{s,t,\ell }^{\ast },-\infty <s,\ell
,t<\infty \right\} $ i.i.d. copies of ${\Greekmath 0111} _{0}$ independent of $
\left\{ {\Greekmath 0111} _{t},-\infty <t<\infty \right\} $.
Decomposable Bernoulli shifts (ibragimov1962some) are a convenient way to model stationary,
dependent time series. Virtually
all the most common DGPs in econometrics and statistics satisfy Definition (ref). liu2009strong provide various theoretical results, and numerous examples including ARMA-GARCH sequences, and other nonlinear time series models (e.g. Random Coefficient AutoRegressive and threshold models).
We are now ready to present our assumptions.
assumptionFor all $1\leq i\leq N$ and some ${\Greekmath 0117} \geq 4$, $\left\{
u_{i,t},-\infty <t<\infty \right\} $ is an $\mathcal{L}_{{\Greekmath 0117} }$-decomposable
Bernoulli shift, with $a>\left( {\Greekmath 0117} -1\right) /\left( {\Greekmath 0117} -2\right) $, $
\mathbb{E}u_{i,t}=0$, and $\min_{1\leq i\leq N}\mathbb{E}u_{i,t}^{2}>0$.
assumptionFor some ${\Greekmath 0117} \geq 4$, $\left\{ f_{t},-\infty <t<\infty
\right\} $ is an $\mathcal{L}_{{\Greekmath 0117} }$-decomposable, $K$-dimensional
Bernoulli shift, with $a>\left( {\Greekmath 0117} -1\right) /\left( {\Greekmath 0117} -2\right) $ and
positive definite covariance matrix $\mathcal{V}\left( f_{t}\right) $.
assumptionIt holds that $\mathbb{E}\left( f_{t}u_{i,t}\right) =0$,
for all $1\leq i\leq N$.
Assumptions (ref) and (ref) allow for (weak) serial dependence in $u_{i,t}$ and $f_{t}$, e.g. due to nonlinear phenomena such as conditional heteroskedasticity. In
contrast, the tests by fan2015power
, gagliardini2016time, feng2022high and pesaran2023testing all assume
independence over time of $u_{i,t}$, thus being unable to accommodate idiosyncratic
conditional heteroskedasticity in asset returns. The assumptions imply that the unconditional variances of errors and
pricing factors are constant over time, similarly to Assumptions A1 and A2
in feng2022high. However, as we also discuss in Section (ref), we can extend our set-up to the case of unconditional heteroskedasticity, allowing for different regimes along
similar lines as Assumption 2.2 in horvath2025detecting.\footnote{That is, assuming $
\left\{ f_{t},1\leq t\leq T\right\} =\bigcup_{\ell =1}^{q}\left\{
f_{\ell ,t},t_{\ell -1}<t\leq t_{\ell }\right\} $ with $t_{0}=1$\ and $
t_{q}=T$\, and $\left\{ f_{\ell ,t},-\infty <t<\infty \right\} $\ satisfying Assumption (ref) for each segment $1\leq \ell \leq q$\
(and similarly for $u_{i,t}$).} Our assumptions also require error terms to have four finite moments, as opposed to
the Gaussianity assumption in fan2015power. Similarly,
Assumption (ref) is substantially milder than the sub-exponential tails
constraint on $f_t$ in fan2015power and feng2022high.\\
Assumption (ref) also allows for more general forms of
cross-sectional dependence in the errors, compared with the extant literature. For instance, existing max-type tests such as the one by feng2022high require some restrictions on the covariance matrix of the error term.\footnote{In particular, Assumption 3 in feng2022high implies that the covariance matrix of the error term be invertible and that cross-covariances are absolutely summable. In turn, this is required in order for the individual t-statistics associated with the ${\Greekmath 010B}_i$s to be weakly correlated, thus being able to apply standard Extreme Value Theory when deriving the asymptotic distribution of their maximum.} We do not impose any such requirement and, in principle, our methodology can also deal with strong cross-sectional dependence in $u_{i,t}$ as long as the maintained zero-mean assumption is satisfied. However, in the context of asset pricing such a case requires attention. Indeed, a possible cause of cross-sectional dependence could be the omission of strong or semi-strong factors, which then show up in the error term $u_{i,t}$. If these omitted tradable factors are priced - thus having a non-zero risk-premium (mean) - then ${\Greekmath 010B}_i$ captures both the pure pricing error and the risk premium of the omitted factors, regardless of their correlation with the factors included in the model giglio2021thousands. However, ${\Greekmath 010B}_i$ remains a pure pricing error when there are {\textquotedblleft time series factors\textquotedblright} in $u_{i,t}$, that is tradable factors $g_t$ which have zero mean $\mathbb{E}\left(
g_{t}\right) =0$ -- and hence do not contribute to the pricing of the assets -- and are orthogonal to $f_t$, $\mathbb{E}\left(
f_{t}g_{t}^{\prime }\right) =0$. Omitting $g_t$ results in $u_{i,t}={\Greekmath 010D} _{i}^{\prime
}g_{t}+{\Greekmath 0118} _{i,t}$, where ${\Greekmath 0118} _{i,t}$ is a purely idiosyncratic component. This, in turn, renders all the existing procedures invalid, but it is allowed under our Assumptions (ref) - (ref).
commentIndeed,
are in order. \textcolor{blue}{In turn,
this ensures that our approach can be employed even when strong and
semi-strong pricing factors have been omitted from (ref), as
long as these are zero-mean time-series factors that conform to $\mathbb{E}u_{i,t}=0$, and $\min_{1\leq i\leq N}\mathbb{E}u_{i,t}^{2}>0$, and are uncorrelated with the pricing factors used in the model.} \textcolor{red}{Consider adding a note to directly address R2 concern. The idea is that if the omitted pricing factor has mean zero, than it is only a time series factor and not a cross-section once. As such, it does not carry a risk premium and therefore does not enter the pricing error/alpha.}
Assumption (ref) is a weak exogeneity requirement, less restrictive than the independence assumption in
fan2015power, feng2022high, and pesaran2023testing.
The test
Recall the null hypothesis of ((ref)), i.e. $
\mathbb{H}_{0}:\max_{1\leq i\leq N}\left\vert {\Greekmath 010B} _{i}\right\vert =0$. As mentioned in the introduction, any consistent estimator of ${\Greekmath 010B}_i$ could be employed to construct our test statistics. Here, we focus on the unit-by-unit OLS estimator,\footnote{We note that the $1 \leq i \leq N$ equations in ((ref)) share the same set of regressors; hence, the OLS estimator coincides with a system-based (Feasible) GLS estimation.} viz.
equation[equation omitted — 147 chars of source]
for $\overline{y}_{i}=T^{-1}\sum_{t=1}^{T}y_{i,t}$, $\overline{f}
=T^{-1}\sum_{t=1}^{T}f_{t} $, and
$
\widehat{{\Greekmath 010C} }_{i,T}=\left[ \sum_{t=1}^{T}\left( f_{t}-\overline{f}\right)
\left( f_{t}-\overline{f}\right) ^{\prime }\right] ^{-1}\left[
\sum_{t=1}^{T}\left( f_{t}-\overline{f}\right) y_{i,t}\right]
$.
Recall that the data admit at least ${\Greekmath 0117} \geq 4$ moments. We use the
transformation
equation[equation omitted — 189 chars of source]
where the rescaling sequence is based on the squared OLS residuals $\widehat{
u}_{i,t}^{2}$:
equation[equation omitted — 117 chars of source]
As we only work with rates of convergence -- requiring ${\Greekmath 0120} _{i,NT}$
to drift to zero under the null and diverge under the alternative -- in principle any rescaling sequence which removes the measurement unit
from $\widehat{{\Greekmath 010B} }_{i,T}$ can be used in ((ref)).
For example, one
may use an estimate of the variance of the individual $\widehat{{\Greekmath 010B} }
_{i,T}$, and indeed such estimate does not even need to be consistent. We
propose $\widehat{s}_{NT}$ because the cross-sectional averaging smooths away any potentially problematic behavior such as the presence of spikes in the unit specific variances; this choice also turns out to deliver the best performance in simulations, and to help in the empirics (see the discussion in Section (ref)).
We now explain the construction of the test statistic. Heuristically, under our assumptions it should hold that $\widehat{
{\Greekmath 010B} }_{i,T}-{\Greekmath 010B} _{i}=O_{a.s.}\left( T^{-1/2}\right) $. Hence, under
the null of ((ref)), ${\Greekmath 0120} _{i,NT}
\overset{a.s.}{\rightarrow }0$ by construction; conversely, under the alternative, ${\Greekmath 0120} _{i,NT}\overset{a.s.}{\rightarrow }\infty $. In order to
have a statistic to test for $\mathbb{H}_{0}$, we now perturb the ${\Greekmath 0120}
_{i,NT}$s by adding a sequence of i.i.d. Gaussian variables
equation[equation omitted — 84 chars of source]
where ${\Greekmath 0121} _{i}\overset{i.i.d.}{\sim }\mathcal{N}\left( 0,1\right) $,
generated independently of the sample $\left\{ \left( u_{i,t},f_{t}^{\prime
}\right) ^{\prime },1\leq i\leq N,1\leq t\leq T\right\} $. Thus,
under the null $z_{i,NT}$ should be an i.i.d. sequence of standard
normals; under the alternative, there should be (at least) one spike due to
the fact that ${\Greekmath 010B} _{i}\neq 0$ for some $i$. Hence, we base our test on
the maximally selected $z_{i,NT}$:
equation*[equation* omitted — 54 chars of source]
In order to study the asymptotics of $Z_{N,T}$, let
equation*[equation* omitted — 226 chars of source]
and consider the following restriction:
assumptionIt holds that $N=O\left( T^{\frac{1}{2}\left(\frac{{\Greekmath 0117}}{2}
-1\right)-{\Greekmath 0122} }\right) $ for some ${\Greekmath 0122} >0$.
Assumption (ref) poses a constraint on the relative rate of
divergence of $N$ and $T$ as they pass to infinity: the more
moments the data admit, the larger $N$ can be relative to $T$. A comparison
with the similar Assumption A1(iii) in feng2022high may
shed further light: if, similarly to feng2022high, we assumed independence
between $f_{t}$ and $u_{i,t}$, then Assumption (ref) would
become $N=O\left( T^{{\Greekmath 0117} /2-1-{\Greekmath 0122} }\right) $ for some (arbitrarily
small) ${\Greekmath 0122} >0$, which coincides with Assumption A1(iii) in
feng2022high. Similarly, the asymptotics in
pesaran2023testing requires $N=o\left( T^{2}\right) $, under the
assumptions of deterministic regressors and at least eight finite moments
for the errors. In our case, as long as ${\Greekmath 0117} \geq 6$, the condition that $
N=o\left( T^{2}\right) $ is satisfied, and therefore we have either the same
asymptotic regime with a milder moment condition, or, with the same moment
condition, a larger $N$ relative to $T$. In Section (ref) in
the Supplement, we discuss the possibility of relaxing -- given ${\Greekmath 0117} $ --
Assumption (ref) to allow for a broader set of combinations of $
N $ and $T$.
Let $\mathbb{P}^{\ast }$ denote the probability conditional on the sample $\left\{ \left( u_{i,t},f_{t}^{\prime }\right) ^{\prime },1\leq i\leq
N,1\leq t\leq T\right\} $.
theoremLet Assumptions (ref)-(ref) hold. Then, under $\mathbb{H}_{0}$ of ((ref)), it holds that
\begin{equation}
\lim_{\min \left\{ N,T\right\} \rightarrow \infty }\mathbb{P}^{\ast }\left[ a_{N}^{-1} \left( Z_{N,T}-b_{N} \right) \leq x \right] =\exp \left( -\exp \left( -x\right)
\right) ,
\end{equation}
for almost all realizations of $\left\{ \left( u_{i,t},f_{t}^{\prime
}\right) ^{\prime },1\leq i\leq N,1\leq t\leq T\right\} $, and all $-\infty
<x<\infty $. Under $\mathbb{H}_{A}$ of ((ref)), it holds that
\begin{equation}
\lim_{\min \left\{ N,T\right\} \rightarrow \infty }\mathbb{P}^{\ast }\left[ a_{N}^{-1} \left( Z_{N,T}-b_{N} \right) \leq x \right] =0,
\end{equation}
for almost all realizations of $\left\{ \left( u_{i,t},f_{t}^{\prime
}\right) ^{\prime },1\leq i\leq N,1\leq t\leq T\right\} $, and all $-\infty
<x<\infty $.
Theorem (ref) describes the limiting behavior of the test statistic $
Z_{N,T}$ both under the null and under the alternative hypotheses. By ((ref)) the suitably normed version of $Z_{N,T}$ converges (in
distribution, a.s.\ conditionally on the sample) to a Gumbel distribution.\footnote{In Section (ref) in the Supplement, we also propose an alternative, fixed $N$ version of the critical values. As discussed in Section (ref), these alternative critical values return better finite sample results when $T$ grows larger for a fixed $N$.}
Equation ((ref)) implies that asymptotic critical values at nominal
level ${\Greekmath 011C} $ are given by
equation[equation omitted — 128 chars of source]
Similarly, ((ref)) roughly states that under the alternative (the
suitably normed version of) $Z_{N,T}$ diverges to positive infinity in
probability, a.s.\ conditional on the sample.\footnote{Following the proof of the theorem, it can be readily shown that a sufficient condition to have asymptotic unit power is that, as $\min \{N,T\} \rightarrow \infty$, it holds that $\sqrt{T/\log N} \max_{1 \leq i \leq N} |{\Greekmath 010B}_i| \rightarrow \infty$. This entails that our test has power as long as one alpha is (mildly) larger than zero. The same result can be shown to hold, a fortiori, in the case of a \textquotedblleft small\textquotedblright , pervasive alternative whereby $|{\Greekmath 010B}_i|=|{\Greekmath 010B}|$ for all $i$, with $\sqrt{T/\log N}|{\Greekmath 010B}| \rightarrow \infty$ - a case known in the literature as the \textquotedblleft diffuse alpha\textquotedblright\ case (chernov2025test).}
commentThe following decision rule applies
\begin{equation}
\left\{
\begin{array}{ll}
Z_{N,T}\leq c_{{\Greekmath 011C} }^{\left( 1\right) } & \Rightarrow \relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{ do not reject }
\mathbb{H}_{0}, \\
Z_{N,T}>c_{{\Greekmath 011C} }^{\left( 1\right) } & \Rightarrow \relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{ reject }\mathbb{H}
_{0}.
\end{array}
\right.
\end{equation}
so that, as is typical, rejection takes place whenever $Z_{N,T}>c_{{\Greekmath 011C}}^{
\left( 1\right) }$, i.e. for large values of the test statistic $Z_{N,T}$.
Discussion
We now discuss how and why
randomization works in our case, and what relationship it has with other
approaches based on \textquotedblleft adding randomness\textquotedblright\
such as the bootstrap. As zhang2023randomization put it, \textquotedblleft [t]he meaning of randomization tests has become obscure in statistics education and practice over the last century \textquotedblright\ (p.\ 2928). Hence, some clarifications on the core statistical mechanism underpinning our randomized test are in order. As we expound hereafter, the main feature of our approach is that our randomization is based on adding randomness to the test statistic, rather than to the data.
commentas hemerik2024term puts it,
\textquotedblleft there is no consensus on the meaning of the term
`randomization test'\textquotedblright\ (p. 327). Therefore,
Our approach works as follows. To start, we construct the statistic ${\Greekmath 0120} _{i,NT}$ defined in ((ref)),
based on the data, as in any \textquotedblleft
traditional\textquotedblright\ testing approach. However, we do not require its second order properties (that is, its limiting distribution and/or asymptotic efficiency),
and use only its first order properties (that is, its rate of
convergence). Being able to focus only on rates requires simpler arguments and milder assumptions; furthermore, at no stage do we require the estimation of asymptotic variances.\footnote{Indeed, this entails that our approach, by its very nature, places more emphasis on the robustness of the estimator employed.} In the construction of ${\Greekmath 0120}_{i,NT}$, we pre-multiply $\widehat{{\Greekmath 010B} }_{i}$\ by the scaling factor $T^{1/{\Greekmath 0117} }$, which - heuristically - is designed to \textquotedblleft wash out\textquotedblright\ the estimation error $\widehat{{\Greekmath 010B}}_i-{\Greekmath 010B}_i$, and therefore the randomness
coming from the data. Our theory uses almost sure rates for the statistic ${\Greekmath 0120} _{i,NT}$; the results in Lemma (ref) in the Supplement yield that, for each $i$
equation[equation omitted — 244 chars of source]
so that, in our proofs, we can work with the premise that (under the
null) $\lim_{\min \left\{ N,T\right\} \rightarrow \infty}{\Greekmath 0120} _{i,NT}=0$.\footnote{Similarly, the
theory also entails that, for each $i$, $\mathbb{P}\left( {\Greekmath 0121} :\lim_{\min \left\{ N,T\right\} \rightarrow \infty }{\Greekmath 0120} _{i,NT}=\infty
\right) =1\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{, under }\mathbb{H}_{A}$; hence, in our proofs, we can work with the premise that (under the
alternative) $\lim_{\min \left\{ N,T\right\} \rightarrow \infty }{\Greekmath 0120} _{i,NT}=\infty$. }
Seeing as the randomness of the data has been washed out by pre-multiplying $\widehat{{\Greekmath 010B} }_{i}$\ by $T^{1/{\Greekmath 0117} }$, in order to construct a test, we add randomness in the form of (i.i.d. and
Gaussian) noise to each ${\Greekmath 0120} _{i,NT}$, thus constructing the sequence $
\left\{ z_{i,NT},1\leq i\leq N\right\} $\ defined in ((ref)). By (
(ref)), we can derive the limiting law of $Z_{N,T} = \max_{1\leq i\leq N}z_{i,NT}$
, and - crucially - show that this depends solely on the probability measure of the added randomness. Given that this is the only driver of the asymptotic behavior of $Z_{N,T}$, and that it is fully under the researcher's control, it can be studied
straightforwardly, with no need for further assumptions on the data apart
from the ones required to derive the rates of ${\Greekmath 0120} _{i,NT}$. This is the key
argument whereby our test can be employed, among other things, under arbitrary levels of
cross-sectional dependence: the only cross-sectional dependence that matters for the asymptotics of $Z_{N,T}$ is the one in the
added random noise - which can be forced to equal zero by the researcher. Considering as a leading term of comparison the max-type test by feng2022high, in that case the asymptotic behavior of the test statistic is determined by the probability measure of the data, and therefore it is affected by the presence and extent of cross-sectional dependence across $i$. By the same token, in ((ref)) we do not require a consistent estimator of the variance of the estimated ${\Greekmath 010B}_i$, but merely a rescaling factor such as $\widehat{s}_{NT}$, designed to make ${\Greekmath 0120}_{i,NT}$ adimensional. An immediate consequence is that - as mentioned in Section (ref) - in our set-up we can readily allow for unconditional heteroskedasticity in both factors and errors. Seeing as we rely only on rates of convergence for $\widehat{{\Greekmath 010B}}_i$, and no estimation of the asymptotic variance of the estimators is required, our results would hold even in this case, without requiring any modifications or even prior knowledge as to the presence of heteroskedasticity. Conversely, feng2022high use a sequence of t-statistics across $i$, and thus a consistent estimator of the variance of $\widehat{{\Greekmath 010B}}_i$ is required - which, especially in the presence of heteroskedasticity, is well known to be fraught with difficulties (see e.g. the review, and the proposed solution, in casini2024fixed).
Further light on our approach can be shed by comparing it with approaches where the randomness is added to the data, a prime example being the bootstrap. The
mode of convergence in Theorem (ref) - where, under the null, $
Z_{N,T}$ converges \textquotedblleft in distribution,
almost surely conditional on the sample\textquotedblright\ - is the same as
one would find in the case of the bootstrap (bickelfreedman).
Notwithstanding this analogy, the way in which randomness is added, the
way in which the theory works, and the assumptions required on the data are
profoundly different to the randomization method proposed herein. In the bootstrap, randomness is added by resampling the data
multiple times, and constructing a (pseudo) version of the test statistic at
each resampling: the randomness of the data is not washed away. Hence, the asymptotic behavior of the
resampled statistic is still affected by the features of the data -
e.g., by serial and/or cross-sectional dependence.\footnote{E.g. in a \textquotedblleft traditional\textquotedblright\ resampling scheme, given data $\left\{ y_{i},1\leq i\leq n\right\} $, at each iteration $
1\leq b\leq B$ the pseudosample $\left\{ y_{i,b}^{\ast },1\leq i\leq
n\right\} $ is constructed such that $\mathbb{P}\left( y_{i,b}^{\ast
}=y_{j}|\left\{ y_{i},1\leq i\leq n\right\} \right) =1/n$. Hence, the
(conditional) law of $y_{i,b}^{\ast }$ is
$\mathbb{P}_{n}\left( y\right) =n^{-1}\sum_{i=1}^{n}\mathbb{I}\left(
y_{i}\leq y\right)$,
where $\mathbb{I}\left( \cdot \right) $ denotes the indicator function, which clearly depends on the features of the data $\left\{
y_{i},1\leq i\leq n\right\} $.} Furthermore, a typical way of proving the
validity of the bootstrap is to show that the distribution of the resampled
test statistic, conditional on the sample, converges in some sense (e.g., in
distribution a.s. conditional on the sample) to the asymptotic distribution of
the original test statistic.
comment\footnote{
See however radulovic1998can.}
This, however, requires deriving such asymptotic distribution, which is likely to be more complicated and to require stronger assumptions than simply deriving its convergence rate.\footnote{Similar considerations also hold for other approaches based on adding randomness to the data. For example, the randomized tests studied in canay2017randomization require that the distribution of the data be \textquotedblleft approximately symmetric\textquotedblright\ - that is, invariant under certain transformations. Such shape restrictions are not required by our approach. } Moreover, applying the bootstrap in our context is fraught with
difficulties: Huang2023 show that the approaches proposed
by kosowski2006can and fama2010luck may suffer from (even
severe) undersizing and low power, especially when the data exhibit features that are typical of financial returns (e.g., skewed unconditional distributions and large cross-sectional sizes). The bootstrap corrections suggested in Huang2023 ameliorate
these issues, but still require weak cross-sectional dependence.
\\
Finally, a crucial difference between our approach and approaches based on adding randomness to the data is that, in the latter case, the added randomness vanishes in the
limit, and thus it does not affect the limiting behavior of the resulting test statistic. Conversely, the randomness added in our method does not
vanish asymptotically, which is a
well-known feature of this type of randomized tests (see e.g.
corradi2006). We propose a solution in
the next section.
Derandomized inference
The discussion above indicates that the results in Theorem (ref) are different to \textquotedblleft
standard\textquotedblright\ inferential theory. In particular, ((ref)
) entails $\lim_{\min \left\{ N,T\right\} \rightarrow \infty }$ $\mathbb{P}^{\ast }\left(
Z_{N,T}\geq c_{{\Greekmath 011C} }|\mathbb{H}_{A}\right) =1$,
which corresponds to the notion of power. The
result under the null is more delicate: whilst it holds that $\lim_{\min \left\{ N,T\right\} \rightarrow \infty }\mathbb{P}^{\ast }\left(
Z_{N,T}\geq c_{{\Greekmath 011C} }|\mathbb{H}_{0}\right) ={\Greekmath 011C}$,
this result is not the standard notion of size. The fact that the added randomness in the construction of $Z_{N,T}$ does not vanish asymptotically entails that, under
the null, different researchers using the same data will obtain different
values of $Z_{N,T}$, and thus different p-values. \newline
We propose a decision rule to discern between $\mathbb{H}_{0}$ and $
\mathbb{H}_{A}$ which is not driven by the added randomness, and is
therefore the same across all researchers using the same dataset. Following
HT2019, each researcher will compute $Z_{N,T}$ over $B$
replications, at each replication $1\leq b\leq B$ constructing a statistic $
Z_{N,T}^{\left( b\right) }$ using a random sequence ${\Greekmath 0121} _{i}^{\left(
b\right) }\overset{i.i.d.}{\sim }\mathcal{N}\left( 0,1\right) $ for $1\leq
i\leq N$, independent across $1\leq b\leq B$ and of the sample. Let
equation[equation omitted — 169 chars of source]
be the percentage of times that the researcher does not reject the null
at nominal significance level ${\Greekmath 011C} $. An immediate consequence of Theorem (ref) is that, as $\min \left\{ N,T,B\right\} \rightarrow \infty$
equation[equation omitted — 329 chars of source]
for almost all realizations of $\left\{ \left( u_{i,t},f_{t}^{\prime
}\right) ^{\prime },1\leq i\leq N,1\leq t\leq T\right\} $. This result holds
for all different researchers, and therefore averaging across the
replications $1\leq b\leq B$ removes the added randomness in $
Q_{N,T,B}\left( {\Greekmath 011C} \right) $: hence, all researchers will
obtain the same value of $Q_{N,T,B}\left( {\Greekmath 011C} \right) $. As noted in
he2023one, $Q_{N,T,B}\left( {\Greekmath 011C} \right) $ corresponds to (the
complement to one of) the \textquotedblleft fuzzy decision\textquotedblright\ in equation (1.1a) in geyer. This notion can be illustrated
by considering a random variable, say $\mathcal{D}$, which takes two values:
\textquotedblleft do not reject $\mathbb{H}_{0}$\textquotedblright
\thinspace\ with probability $Q_{N,T,B}({\Greekmath 011C} )$, and \textquotedblleft
reject $\mathbb{H}_{0}$\textquotedblright . According to ((ref)),
asymptotically it holds that, a.s. conditionally on the sample $\mathbb{P}
^{\ast }\left( {\Greekmath 0121} :\mathcal{D}=\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{\textquotedblleft reject }\mathbb{H}
_{0}\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{\textquotedblright }|\mathbb{H}_{0}\right) ={\Greekmath 011C} $, across all
researchers, which reconciles the procedure with the notion of size
of a test. Similarly, ((ref)) states that, asymptotically, $\mathbb{P}
^{\ast }\left( {\Greekmath 0121} :\mathcal{D}=\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{\textquotedblleft reject }\mathbb{H}
_{0}\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{\textquotedblright }|\mathbb{H}_{A}\right) =1$ a.s. conditionally
on the sample, which corresponds to the notion of power of a test.
theoremLet Assumptions {(ref)-(ref)
} hold, and $B=O\left( \left(\log N\right)^2 \right) $. Then it holds that
\begin{equation}
\limsup_{\min \left\{ N,T,B\right\} \rightarrow \infty }\sqrt{\frac{B}{2\log
\log B}} \left\vert \frac{Q_{{\Greekmath 011C} }-\left( 1-{\Greekmath 011C} \right) }{\sqrt{{\Greekmath 011C}
\left( 1-{\Greekmath 011C} \right) }}\right\vert =1\relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{ a.s.},
\end{equation}
under $\mathbb{H}_{0}$, for almost all realizations of $\left\{ \left(
u_{i,t},f_{t}^{\prime }\right) ^{\prime },1\leq i\leq N,1\leq t\leq
T\right\} $. Under $\mathbb{H}_{A}$, it holds that $Q_{N,T,B}\left( {\Greekmath 011C} \right)
=o_{a.s.}\left( 1\right) $, for almost all realizations of $\left\{ \left(
u_{i,t},f_{t}^{\prime }\right) ^{\prime },1\leq i\leq N,1\leq t\leq
T\right\} $.
Building on Theorem (ref), a \textquotedblleft
derandomized\textquotedblright\ decision rule can be proposed. By ((ref)
), under $\mathbb{H}_{0}$ there exists a triplet of random variables $\left(
N_{0},T_{0},B_{0}\right) $ such that
equation[equation omitted — 229 chars of source]
for all $\left( N,T,B\right) $ with $N\geq N_{0}$, $T\geq T_{0}$, and $B\geq
B_{0}$. Similarly, under $\mathbb{H}_{A}$ there exists a triplet of random
variables $\left( N_{0},T_{0},B_{0}\right) $ such that $Q_{N,T,B}\left( {\Greekmath 011C}
\right) \leq {\Greekmath 010F} $, for all ${\Greekmath 010F} >0$ and $\left( N,T,B\right) $
with $N\geq N_{0}$, $T\geq T_{0}$, and $B\geq B_{0}$. This dichotomous
behavior can be exploited to construct a decision rule based on $
Q_{N,T,B}\left( {\Greekmath 011C} \right) $, in a way that is more akin to information criteria than tests: $\mathbb{H}_{0}$ is not rejected when $
Q_{N,T,B}\left( {\Greekmath 011C} \right) $ exceeds a threshold, whereas it is rejected
otherwise. In theory, one could use the threshold based on the Law of the Iterated Logarithm (LIL) in ((ref)); under $\mathbb{H}_0$, it follows that $\mathbb{P}^{*}\left[ Q_{N,T,B} < \ell_{{\Greekmath 011C}} \right]=0$ as $\min\{N,T,B\} \rightarrow \infty$. Albeit valid asymptotically, this criterion turns out to be biased against $\mathbb{H}_0$ in simulations, especially in small samples; this is not entirely surprising, since the bound induced by the LIL is not likely to \textquotedblleft bite\textquotedblright\ unless $B$ is large (which, in light of the restriction $B=O((\log N)^2)$, requires $N$ to be \textquotedblleft very large\textquotedblright). A decision rule that is more favorable towards the null
could be
equation[equation omitted — 138 chars of source]
with $f\left( B\right) $ a user-specified, non-increasing function of $B$
such that $\lim_{B\rightarrow \infty }f\left( B\right) =0$, and $\limsup_{B\rightarrow \infty }\left( f\left( B\right) \right) ^{-1}\sqrt{
2 \log \log B /B}=0$.
From theory to practice: guidelines and recommendations
The procedure proposed in Section (ref) depends on the nuisance
parameter ${\Greekmath 0117}$ and on the
tuning quantities $B$
and $f\left( B\right) $, i.e.\ the number of trials and the threshold in the derandomized approach. We offer
a set of guidelines/suggestions which could inform the practical application
of these procedures.\\
There are at least two ways in
which ${\Greekmath 0117} $ in ((ref)) can be determined:
enumerate• A direct approach, based on using a tail index estimator for the largest moment ${\Greekmath 0117}$ admitted by the data.
This approach would offer a consistent estimator, but its properties may be rather poor in finite samples (
embrechts).
• An indirect approach, based upon noting that a lower bound (as opposed to an exact value) for
${\Greekmath 0117} $ would suffice. In order to find such a bound, e.g. the tests by
trapani16 and degiannakis2023superkurtosis could be employed
to test for the null hypothesis $\mathbb{H}_{0}:\mathbb{E}\left\vert
y_{i,t}\right\vert ^{{\Greekmath 0117} _{0}}=\infty $. Upon rejecting, it follows
that ${\Greekmath 0117} \geq {\Greekmath 0117} _{0}$, and therefore ${\Greekmath 0117} _{0}$ can be used in ((ref)).
In addition --- as we do in our empirical illustration --- one can use ${\Greekmath 0117}_0
=4$ when constructing ${\Greekmath 0120}_{i,NT}$, i.e. the smallest finite moment prescribed by our theory, which
we would recommend when the sample size $T$ does not afford reliable
inference.
Turning to the specifics of the derandomization, we note that:
enumerate• The choice of $B$ is constrained by the condition $B=O\left( \left( \log
N\right)^2\right) $; in
our simulations, we employ $B=\lfloor\left(\mathrm{\log }\,N\right)^{2}\rfloor$, which we
recommend as a guideline.\footnote{In the proof of Theorem (ref), we show that the rate of approximation of ((ref)) is very fast in $B$ (see equations ((ref)), ((ref)) and ((ref)) in the Supplement), which guarantees that the lower bound in ((ref)) is accurate even when using a \textquotedblleft small\textquotedblright\ value of $B$.}
• The choice of $f\left( B\right) $ is based on ((ref)); he2023one show that the derandomized decision
rule is relatively robust to the specification of $f\left( B\right) $. We recommend $f\left( B\right) =B^{-1/4}$, which is also found
to deliver the best results in he2023one.
comment\section{Extensions: non-tradable and latent factors}
As mentioned in the introduction, the main contribution of this paper is a
methodology to test for no pricing errors; we have focused on ((ref)) and assumed factors are observable and tradable only for
simplicity. In this section, we show that our methods can be readily
extended to more complex settings, provided that a consistent estimator of
the ${\Greekmath 010B} _{i}$s is available. As illustrative examples, we consider the
case of non-tradable factors based on Fama-MacBeth estimation, and the case
of latent factors, based on principal component analysis (PCA). These
extensions are not considered, to the best of our knowledge, in any
contribution in the current literature; conversely, our methodology can
readily accommodate for them, in essence obtaining the same results as in
the case of observable and tradable factors. We only report the main results
on the \textquotedblleft one shot\textquotedblright\ tests; assumptions and
technicalities are relegated to Section (ref) in the
Supplement, and the extension to derandomization can be done by following
verbatim Section (ref). We note, however, that strong
factors are required in these cases. Henceforth, we define $\mathbb{M}
_{1_{N}}=\mathbb{I}_{N}-N^{-1}\mathbf{{\Greekmath 0113} }_{N}\mathbf{{\Greekmath 0113} }_{N}^{\prime
}$, where $\mathbf{{\Greekmath 0113} }_{N} $ is an $N\times 1$ vector of ones.
\subsection{Non-tradable factors and Fama-MacBeth estimation}
Consider the case of a linear factor pricing model based on $K$ observable,
non-tradable factors
\begin{equation}
y_{i,t}={\Greekmath 010B} _{i}+{\Greekmath 010C} _{i}^{\prime }{\Greekmath 0115} +{\Greekmath 010C} _{i}^{\prime
}v_{t}+u_{i,t},
\end{equation}
where $v_{t}=f_{t}-\mathbb{E}\left( f_{t}\right) $ and ${\Greekmath 0115} \in \mathbb{R
}^{K}$ is the vector of risk premia for the $K$ factors $f_{t}$. Estimation
of ${\Greekmath 010B} _{i}$ is based on Algorithm 3 in giglio2021thousands.
\begin{description}
• Estimate ${\Greekmath 010C} _{i}$ by OLS in the time-series regressions $
y_{i,t}={\Greekmath 010B} _{i}+{\Greekmath 010C} _{i}f_{t}+u_{i,t}$,
\begin{equation}
\widehat{{\Greekmath 010C} }_{i}=\left[ \sum_{t=1}^{T}\left( f_{t}-\overline{f}\right)
\left( f_{t}-\overline{f}\right) ^{\prime }\right] ^{-1}\left[
\sum_{t=1}^{T}\left( f_{t}-\overline{f}\right) \left( y_{i,t}-\overline{y}
_{i}\right) \right] ,
\end{equation}
with $\overline{y}_{i}=T^{-1}\sum_{t=1}^{T}y_{i,t}$, and define $\widehat{
\mathbf{{\Greekmath 010C} }}=\left( \widehat{{\Greekmath 010C} }_{1},...,\widehat{{\Greekmath 010C} }_{N}\right)
^{\prime }$.
• Define $\widehat{{\Greekmath 0115} }$ as the OLS estimates of a
regression of $\overline{\mathbf{y}}=\left( \overline{y}_{1},...,\overline{y}
_{N}\right) ^{\prime }$ onto a vector of ones and $\widehat{\mathbf{{\Greekmath 010C} }}$
\begin{equation}
\widehat{{\Greekmath 0115} }=\left( \widehat{\mathbf{{\Greekmath 010C} }}^{\prime }\mathbb{M}
_{1_{N}}\widehat{\mathbf{{\Greekmath 010C} }}\right) ^{-1}\left( \widehat{\mathbf{{\Greekmath 010C} }
}^{\prime }\mathbb{M}_{1_{N}}\bar{\mathbf{y}}\right) .
\end{equation}
• The estimator of ${\Greekmath 010B} _{i}$ is given by
\begin{equation}
\widehat{{\Greekmath 010B} }_{i}^{FM}=\overline{y}_{i}-\widehat{{\Greekmath 010C} }_{i}^{\prime }
\widehat{{\Greekmath 0115} }.
\end{equation}
\end{description}
Based on $\widehat{{\Greekmath 010B} }_{i}^{FM}$ defined in ((ref)), we can
construct the same test statistic as before, based on
\begin{equation*}
{\Greekmath 0120} _{i,NT}^{FM}=\left\vert \frac{T^{1/{\Greekmath 0117} }\widehat{{\Greekmath 010B} }_{i}^{FM}}{
\widehat{s}_{NT}^{FM}}\right\vert ^{{\Greekmath 0117} /2},
\end{equation*}
where the rescaling sequence $\widehat{s}_{NT}^{FM}$ is constructed as in (
(ref)), using the residuals $\widehat{u}_{i,t}^{FM}=y_{i,t}-\left(
\widehat{{\Greekmath 010B} }_{i}^{FM}+\widehat{{\Greekmath 010C} }_{i}^{\prime }f_{t}\right) $.
Defining $z_{i,NT}^{FM}={\Greekmath 0120} _{i,NT}^{FM}+{\Greekmath 0121} _{i}$,\footnote{
As before, ${\Greekmath 0121} _{i}\overset{i.i.d.}{\sim }\mathcal{N}\left( 0,1\right) $
generated independently of the sample $\left\{ \left( u_{i,t},f_{t}^{\prime
}\right) ^{\prime },1\leq i\leq N,1\leq t\leq T\right\} $.} our test can be
based on
\begin{equation}
Z_{N,T}^{FM}=\max_{1\leq i\leq N}z_{i,NT}^{FM}.
\end{equation}
\begin{theorem}
We assume that the assumptions of Theorem (ref) are
satisfied, and that Assumptions (ref) and (ref) in
Section (ref) of the Supplement also hold. Then, the same
result as in Theorem (ref) holds.
\end{theorem}
\subsection{Latent factors}
Consider a linear factor pricing model based on $K$ latent factors
\begin{equation}
y_{i,t}={\Greekmath 010B} _{i}+{\Greekmath 010C} _{i}^{\prime }{\Greekmath 0115} +{\Greekmath 010C} _{i}^{\prime
}v_{t}+u_{i,t},
\end{equation}
where $v_{t}=f_{t}-\mathbb{E}\left( f_{t}\right) $ is not observable
, ${\Greekmath 010C} _{i}$ is a $K\times 1$ vector of loadings and, as above, ${\Greekmath 0115} $
is the vector of risk premia for the $K$ latent factors $f_{t}$.
Write $\widetilde{\mathbf{y}}_{t}=\mathbf{{\Greekmath 010C} }\widetilde{v}_{t}+
\widetilde{\mathbf{u}}_{t}$, where $\widetilde{\mathbf{y}}_{t}=\mathbf{y}
_{t}-\overline{\mathbf{y}}$ with $\mathbf{y}_{t}=\left(
y_{1,t},...,y_{N,t}\right) ^{\prime }$, $\widetilde{v}_{t}=v_{t}-\left(
T^{-1}\sum_{t=1}^{T}v_{t}\right) $, $\widetilde{\mathbf{u}}_{t}$ is defined
analogously, and $\mathbf{{\Greekmath 010C} }=\left( {\Greekmath 010C} _{1},...,{\Greekmath 010C} _{N}\right)
^{\prime }$. Define also the $N\times N$ sample second moment matrix
\begin{equation}
\widehat{\mathbf{\Sigma }}_{y}=\frac{1}{NT}\sum_{t=1}^{T}\widetilde{\mathbf{y
}}_{t}\widetilde{\mathbf{y}}_{t}^{\prime }.
\end{equation}
The estimation of ${\Greekmath 010B} _{i}$ follows Algorithm 4 in
giglio2021thousands.
\begin{description}
• Estimate $\mathbf{{\Greekmath 010C} }$ using PCA, with estimator $\widehat{
\mathbf{{\Greekmath 010C} }}^{PC}$ given by the eigenvectors corresponding to the first $
K$ eigenvalues of $\widehat{\mathbf{\Sigma }}_{y}$ under the constraint $
\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}\right) ^{\prime }\widehat{\mathbf{
{\Greekmath 010C} }}^{PC}=N\mathbb{I}_{K}$.\footnote{
Our discussion implicitly assumes that $K$ is known. Of course, this is not
the case in practice, where $K$ has to be determined by the user. This is
ordinarily done using consistent estimators such as those of baing02,
ahnhorenstein13, and trapani2018randomized. Note that the
result in Theorem (ref) holds unchanged when $K$ is estimated using
these consistent estimators.}
• These steps are the same as in the previous section,
with $\widehat{{\Greekmath 0115} }^{PC}=\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }
\mathbb{M}_{1_{N}}\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\right) ^{-1}\left( \widehat{
\mathbf{{\Greekmath 010C} }}^{PC\prime }\mathbb{M}_{1_{N}}\bar{\mathbf{y}}\right) $, and
\begin{equation}
\widehat{{\Greekmath 010B} }_{i}^{PC}=\overline{y}_{i}-\left( \widehat{{\Greekmath 010C} }
_{i}^{PC}\right) ^{\prime }\widehat{{\Greekmath 0115} }^{PC}.
\end{equation}
\end{description}
Let $C_{N,T}=\min \left\{ N,T\right\} $. Based on $\widehat{{\Greekmath 010B} }
_{i}^{PC} $ defined in ((ref)), we define
\begin{equation*}
{\Greekmath 0120} _{i,NT}^{PC}=\left\vert \frac{C_{N,T}^{1/{\Greekmath 0117} }\widehat{{\Greekmath 010B} }_{i}^{PC}
}{\widehat{s}_{NT}^{PC}}\right\vert ^{{\Greekmath 0117} /2},
\end{equation*}
where $\widehat{s}_{NT}^{PC}$ is constructed as in ((ref)), using $
\widehat{u}_{i,t}^{PC}=y_{i,t}-\left( \widehat{{\Greekmath 010B} }_{i}^{PC}+\widehat{
{\Greekmath 010C} }_{i}^{PC\prime }\widehat{f}_{t}^{PC}\right) $ and $\widehat{f}
_{t}^{PC}=N^{-1}\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\widetilde{\mathbf{y}}
_{t}$. Letting $z_{i,NT}^{PC}={\Greekmath 0120} _{i,NT}^{PC}+{\Greekmath 0121} _{i},$ with ${\Greekmath 0121}
_{i}$ defined as above, the test is based on
\begin{equation}
Z_{N,T}^{PC}=\max_{1\leq i\leq N}z_{i,NT}^{PC}.
\end{equation}
\begin{theorem}
We assume that the assumptions of Theorem (ref) are
satisfied, and that Assumptions (ref)-(ref) in Section
(ref) of the Supplement also hold. Then, the same result as in
Theorem (ref) holds.
\end{theorem}
As a final remark, we conjecture that Theorem (ref) holds with
minor modifications to Assumptions (ref)-(ref) when one
estimates factors and loadings with the Risk-Premium PCA (RP-PCA) approach
of lettau2020estimating, lettau2020factors. In fact, just like our
Theorem (ref), their theory for the strong factors case relies on
conditions that are extremely similar to those of bai03. Similar
considerations also hold for the Projected PCA approach of fan2016projected, which is increasingly being used in asset pricing
studies (see kim2021arbitrage and hong2025dynamic, among
others).
Simulations
We use a similar DGP to feng2022high:
equation[equation omitted — 260 chars of source]
where $f_{t}=(f_{1,t},f_{2,t},f_{3,t})^{\prime }$, $\overline{f}
=(0.53,0.19,0.19)^{\prime }$, $\Phi =\mathrm{diag}\left\{
-0.1,0.2,-0.2\right\} $ and ${\Greekmath 0110} _{t}\overset{i.i.d.}{\sim }\mathcal{N}
_{3}(0,I_{3})$. Loadings are generated as ${\Greekmath 010C} _{i,1}\overset{i.i.d.}{\sim
}\mathcal{U}(0.3,1.8)$, ${\Greekmath 010C} _{i,2}\overset{i.i.d.}{\sim }\mathcal{U}
(-1,1) $, and ${\Greekmath 010C} _{i,3}\overset{i.i.d.}{\sim }\mathcal{U}(-0.6,0.9)$ for
all $i$. We allow for strong cross-sectional dependence in the innovations $
\mathbf{u}_{t}=(u_{1,t},\dots ,u_{N,t})^{\prime }$ via a factor model:
equation[equation omitted — 263 chars of source]
where $\boldsymbol{{\Greekmath 010D} }=({\Greekmath 010D} _{1},\dots ,{\Greekmath 010D} _{N})^{\prime }$ for $
{\Greekmath 010D} _{i}\overset{i.i.d.}{\sim }\mathcal{U}(0.7,0.9)$, ${\Greekmath 011E} _{g}=0.4$,
and ${\Greekmath 011F} _{t}\overset{i.i.d.}{\sim }\mathcal{N}(0,1)$, with $\left\{ {\Greekmath 011F}
_{t},1\leq t\leq T\right\} $ generated independently of $\left\{ {\Greekmath 0110}
_{t},1\leq t\leq T\right\} $. In ((ref)), the $N$-dimensional random vectors $\left\{ \boldsymbol{{\Greekmath 0118} }
_{t},1\leq t\leq T\right\} $ are generated independently of $\left\{ \left({\Greekmath 0110}
_{t}, {\Greekmath 011F}_t\right),1\leq t\leq T\right\} $
under the following three set-ups (all with mean zero and covariance matrix $\Sigma
_{{\Greekmath 0118} }$):
enumerate• The Gaussian case: $\boldsymbol{{\Greekmath 0118} }_{t}\overset{i.i.d.}{
\sim }\mathcal{N}_{N}(0,I_{N})$.
• The Student's $t$ case: where ${\Greekmath 0118} _{i,t}$ follows a
Students's $t$ distribution with $d=5.5$ degrees of freedom, zero mean and
unit scale, independent across $i$. In this case, ${\Greekmath 0118} _{i,t}$ and $y_{i,t}$
have regularly varying tails;
• The GARCH case: we generate $\boldsymbol{{\Greekmath 0118} }_{t}=\mathbf{H}
_{t}\boldsymbol{z}_{t}$, with: $\boldsymbol{z}_{t}=\left(
z_{1,t},...,z_{N,t}\right) ^{\prime }$ and $z_{i,t}\overset{i.i.d.}{\sim }
\mathcal{N}(0,1)$; and $\mathbf{H}_{t}=\mathrm{diag}\left\{ h_{1,t},\dots
,h_{N,t}\right\} $ with $h_{i,t}^{2}={\Greekmath 0121} _{i}+{\Greekmath 0119}_{i}{\Greekmath 0118}
_{i,t-1}^{2}+{\Greekmath 010C} _{i}h_{i,t-1}^{2}$, with ${\Greekmath 0121} _{i}\overset{i.i.d.}{\sim }
\mathcal{U}(0.01,0.05)$, ${\Greekmath 0119}_{i}\overset{i.i.d.}{\sim }\mathcal{U}
(0.01,0.04)$ and ${\Greekmath 010C} _{i}\overset{i.i.d.}{\sim }\mathcal{U}(0.85,0.95)$.
\footnote{
These parameter values imply that ${\Greekmath 0118} _{i,t}$ has finite sixth moment for
any $i$.}
In all scenarios, we report rejection frequencies under the null
and under the alternative, for nominal level ${\Greekmath 011C} =5\%$, using $N\in
\left\{ 100,200,500\right\} $ and $T\in \left\{ 100,200,300,500, 1000, 2000\right\} $. As far as the alternative hypothesis is concerned, we consider a rather
sparse alternative where ${\Greekmath 010B} _{i}\overset{i.i.d.}{\sim }\mathcal{N}(0,1)$
for $5\%$ percent of the cross-sectional units $1\leq i\leq N$. We construct
the test statistic using a notional value of ${\Greekmath 0117} =5$ in ((ref)), and
consider both the \textquotedblleft one-shot\textquotedblright\ test in
Section (ref), and the derandomized version in Section (ref)
. For the latter, we examine results using both (ref) and (ref) with $f(B)=B^{-1/4}$. We
compare our test with the tests by feng2022high,
pesaran2023testing, and ardia2024robust.\footnote{We set tuning parameters of the AS test as
suggested in their Monte Carlo exercise (in particular, using their
notation, we set $L=0$ and ${\Greekmath 0120} =1/3$). When applicable, i.e.\ when $N<T$, we also check performances of the test by gibbons1989test
Moreover, Monte Carlo results in feng2022high and
pesaran2023testing show that their tests consistently outperform
that of gungor2016multivariate. Hence, we omit comparisons with this
last approach. The comparison with the approaches of fan2015power and gagliardini2016time is reported in Section (ref) of the Supplement.}
We start from the Gaussian case; results using the one-shot test are in
Table (ref), whereas in Table (ref) we
report rejection frequencies from the derandomization approach. Our test is
the best one at controlling the size
for all combinations of $N$ and $T$, whereas the other tests are
consistently oversized. Our test becomes slightly undersized, and subsequently plateaus, as $T$ increases. This is not accompanied by any loss of power; further, the alternative critical values presented in Section (ref) of the Supplement yield empirical rejection frequencies that are extremely close to the nominal size when $T\geq 500$. Table (ref) suggest that the
derandomization procedure based on $f(B)=B^{-1/4}$ also works very well.
Indeed, as predicted by the theory, the empirical rejection frequencies are extremely close to zero under
the null and quickly converge to one under the alternative; the latter is
particularly true when $N$ gets large, thus showing that our approach is
particularly suitable when $N>T$. As expected, the
threshold based on the LIL
leads to higher empirical rejection frequencies under both the null and the
alternative. As far as power is concerned, the right panels of the table
show that our tests performs satisfactorily, whilst at the same time
guaranteeing size control. We note that the test by FLLM outperforms ours in
terms of power in most cases, but it is also oversized. Turning to the case
of data with heavier tails, Tables (ref) and (ref)
report empirical rejection frequencies for the Student's $t$ case. Results
for the randomized test are in line with those of Table (ref). As in the Gaussian case, the other tests are oversized, while ours becomes slighlty undersized when $T$ grows large. Again, this can be solved by using the alternative critical values from Section (ref).
The derandomized procedure works as expected also in the case of heavier
tails. Similar considerations hold for power as for the Gaussian case.
Finally, results under the GARCH case are in Tables (ref) and
(ref); size and power of all tests behave as in the other
cases, and so does the decision rule based on Theorem (ref). Our test is slighlty oversized when $N=500$ and $T=100$, but still outperforms all the others when sizes and powers are considered. The use of the alternative critical values still improves the (slight) under-rejection for large values of $T$. Notably, GRS performs very well whenever applicable, exhibiting good finite sample properties even when the DGP violates its assumption of i.i.d. Gaussian errors. However, the fact that the test requires $T>N$ makes it inapplicable whenever one deals with a rather large number of test assets.\footnote{For instance, using the GRS with monthly data on $N=200$ test assets implicitly assumes that assets' ${\Greekmath 010C}$s are constant over more than 16 years. This is at odds with all the available empirical findings.}
table[table omitted — 2,507 chars of source]
table[table omitted — 1,737 chars of source]
table[table omitted — 2,473 chars of source]
table[table omitted — 1,591 chars of source]
table[table omitted — 2,353 chars of source]
table[table omitted — 1,608 chars of source]
We conclude this section with a further experiment, where we allow for cross-sectional heteroskedasticity. We simulate assets with higher variance, the higher ${\Greekmath 010B}_i$. The tendency of severely misspriced assets to exhibit large variances is a clear feature of the data employed in our empirical analysis (see Section (ref)), especially for the most severely misspriced assets. Hence, we consider the case where ${\Greekmath 011B}^{2}_{{\Greekmath 0118}_i} = Var\left({\Greekmath 0118}_{i,t}\right)$. In the Gaussian and Student's $t$ DGP, we simulate $\bf{{\Greekmath 0118}}_t$ so that ${\Greekmath 011B}_{{\Greekmath 0118}_i} = 1+{\Greekmath 0123}|{\Greekmath 010B}_{i}|$, while for the GARCH case set ${\Greekmath 0121}_{i} = (1+{\Greekmath 0123}|{\Greekmath 010B}_{i}|)(1-{\Greekmath 010C}_i-{\Greekmath 0119}_i)$ so that $Var\left({\Greekmath 0118}_{i,t}\right) = \left(1+{\Greekmath 0123}|{\Greekmath 010B}_{i}|\right)^2$ under all DGPs, and we consider ten equally spaced values of ${\Greekmath 0123}$ between one and five percent. Results are in Figure (ref), showing that our test has unit power for all levels of asset specific variance. Conversely, the power of all the other tests decreases, with the test by feng2022high exhibiting the largest loss of power under all DGPs. This makes sense since the test by feng2022high is a max-$t^{2}$ test, hence being driven by both the alpha and the asset-specific variance.\footnote{Further results are in Section (ref) of the Supplement, where we report results for: the
case ${\Greekmath 011E} _{g}=0$ (Section (ref)); the cases where $g_{t}$ is a weak or semi-strong
omitted factor (Section (ref)); additional power analyses for different levels of sparsity under the alternative (Section (ref)); the case when only one factor is strong,
while the others are at most semi-strong (Section (ref)); the cases of non-tradable
factors (studied in Section (ref)) and latent factors (studied
in Section (ref)) (Sections (ref) and (ref) respectively); using alternative critical values in the rejection rule based on Theorem (ref) (Section (ref)).}
figure[figure omitted — 1,303 chars of source]
Empirical illustration
commentPricing
individual stocks is challenging, as their returns are known to have
non-normal distributions, display substantial heteroskedasticity and
correlation structures that could lead to inaccurate inference using extant asset pricing tests. Our procedure, however, is well suited for this task, given the
generality of its assumptions.
\subsection{Data, models of interest, and estimation procedure}
We illustrate our procedure by testing whether several linear factor pricing
models correctly price the constituents of the S{&}P 500 index. We collect monthly data on all stocks that were part of the S&P 500 for at
least five years between January 1985 and December 2024, using
simple percentage returns on the $i$-th stock gross of dividend yield
equation[equation omitted — 98 chars of source]
where $P_{i,t}$ is the end of the month stock price and $DY_{i,t}$ is the percent
per annum dividend yield.\footnote{
To ensure that the index accurately represents the US stock market, S{&}P
regularly updates its composition. We account for these changes by revising
the set of included assets every month. Security data are sourced from
Datastream, while we obtain those on the pricing factors (and on the
risk-free rate) from the website of Professor French.} We define the excess returns as $y_{i,t}$, and test six linear factor pricing models
that are all encompassed by the following regression
equation[equation omitted — 685 chars of source]
where: $\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{MKT}_{t}$ is the excess return on the market, $\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{SMB}_{t}$
the size factor, $\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{HML}_{t}$ the book-to-market factor, $
\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{RMW}_{t}$ the profitability factor, $\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{CMA}_{t}$ the
investment strategy factor, and $\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{MOM}_{t}$ the momentum factor.
\footnote{
All factors are observable and tradable; see the website
of Professor French for their description.} Both the excess return $y_{i,t}$
and the market factor use the one-month Treasury bill rate as risk-free
rate. The first model that we test is the CAPM, which is obtained when only
the market factor is considered. We then consider a two-factor (FF2
henceforth) model based on the market and momentum factors, as well as the
usual three- and five-factors models of fama1993common and
fama2015five, which we also augment with
momentum to obtain a four- (FF4) and a six-factors (FF6) model. In line with fan2015power and pesaran2023testing, we mitigate the impact of possible time variation in the factor loadings by running our inferential procedure on 5-years rolling windows.\footnote{We use $T=60$ (i.e. $
5 $ years) in estimation, while $N$ ranges between $437$ and $568$. Within each window, we discard securities with at least one missing
observation. In Section (ref) in the Supplement, we show that using the derandomized confidence function as suggested in Section (ref) allows to control for the family-wise rejection frequency even when the number of windows passes to infinity, with no changes or corrections required to the nominal level of the individual tests.}
Results
Table (ref) reports the percentage of windows for which we
can reject the null that a pricing model is correctly specified. These
empirical rejection frequencies are computed using our derandomized
procedure based on $B=(\log N)^2$, at $5\%$ nominal significance level. We calculate ${\Greekmath 0120} _{i,NT}$ using both ${\Greekmath 0117}=5$ (in the light of the very good finite sample results found in Section (ref)), and ${\Greekmath 0117}=4$ (by way of robustness check, as suggested in our guidelines in Section (ref)). We also report results obtained with the test by feng2022high, as our closest benchmark.
commentAll these $B$ trials are run at the $5\%$ significance level and using both ${\Greekmath 0117} =4$ and ${\Greekmath 0117}=5$ in the calculation of ${\Greekmath 0120} _{i,NT}$. The use of ${\Greekmath 0117}=5 $ is motivated by the very good finite sample results of our Monte Carlo analysis. Repeating the analysis with ${\Greekmath 0117}=4$ acts as a robustness check for our findings in the case where ${\Greekmath 0117}$ is fixed to the lowest possible value such that our inference is valid.\footnote{
While our inference requires ${\Greekmath 0117} \geq 4$ to be valid, it is worth recalling
that other tests typically impose stricter moment requirements.
The only exception is that of feng2022high, which also requires four
finite moments. Hence, no alternative test is available when our inference
is invalid due to the tail behavior of the stocks.}
table[table omitted — 2,813 chars of source]
The first sub-panel of Table (ref) shows rejection
frequencies for the whole sample. Results suggest that the most parsimonious models - the CAPM and FF2 - are
the least rejected models (i.e.\ the ones that produce the lowest percentage
of rejections of the null of zero alphas).\footnote{This result is somewhat surprising in that, if the true model was a larger model that nests the CAPM or FF2, then underconditioning would entail a bias in the alpha estimates of the more parsimonious models. However, moskowitz2025 show that, in the absence of mispricing, the CAPM performs better in terms of alpha tests than several prominent multifactor models. This is because, while multifactor betas can help capture mispricing, persistence in those betas leads the multifactor models to distort expected returns well after that information gets priced correctly. Also, it is well known that individual stocks have poorly estimated betas, with the estimation error acting both as a source of downward bias due to an errors-in-variables problem blume1975betas and as a driver of the aforementioned persistence. However,
ang2020using argue that, although the measurement errors in the
betas are larger in individual stocks relative to e.g. portfolio returns,
the larger cross-sectional spread in the betas of individual stocks more
than offsets this error, leading to a more accurate estimate of the market
risk premium.}
Results using the approach of feng2022high also generally favor the use of more parsimonious models, i.e.\ CAPM and FF2. However, the rejection frequencies appear unrealistically small, as they suggest that a linear model based on market and momentum correctly prices large cap US stocks for almost 90% of the sample, which comprises several periods of market turmoil.
The next four sub-panels of Table (ref) show rejection
frequencies over four periods of market turmoil: the Asian financial crisis,
the Burst of the Dot-com Bubble, the Global Financial Crisis, and the
COVID-19 pandemic.\footnote{
For the COVID-19 pandemic, we consider rolling windows between January 2020
and May 2021, where the end date corresponds to the termination of lockdown
policies in most of the world. The dates for the other periods of market
turmoil are set as in pesaran2023testing.} Our procedure suggests that these models almost never price large cap US stocks during the Asian and the Global Financial Crisis. The picture is only slightly more positive during the early 2000s crisis. Finally, we see that the size and book-to-market factors play an important
role during the COVID-19 pandemic, as the three-factor model is the best
over this period.\footnote{
To interpret this result note that, while the COVID-19 period shares with
other crises the fact that the stock market yielded low returns and was
characterized by high volatility and low liquidity, it also has features
that make it very distinct. Indeed, during the COVID-19 pandemic households
were required to stay home to slow the spread of the virus and a variety of
firms were severely restricted in producing their goods and services,
essentially constraining output production and limiting consumption
decisions. This distinctive feature of the COVID-19 period implies that,
while uncertainty about the end of the pandemic was very high, in the short
term recession fears and low growth expectations strongly characterize that
period gormsen2023financial. It is not surprising, therefore, that
value stocks --- generally considered long-horizon investments --- came
under huge pressure as economic uncertainty prompted investors to shorten
their time horizons, and indeed we find that the value factor contributes to the slightly better performance of larger models during this
period (further results are available upon request). This is consistent with
the evidence in campbell2025drives, who document that value
experienced a historically striking drop in performance during the pandemic.
}
This sub-periods analysis also indicates that some of the results using the approach of feng2022high may be overly optimistic. Indeed, their test suggests that the FF2 model perfectly explains the cross-section of expected excess returns on large cap US stocks during the Dot-com Bubble and the COVID pandemic. More generally, and also looking at the last two sub-panels, their procedure tells us that FF2 almost always prices all large cap US stocks, no matter whether the market is experiencing a period of distress or stability. While possible, this result does not seem plausible, and we argue that it is likely due to the loss of power suffered by the test of feng2022high when the asset-specific variance of the misspriced assets increases, as highlighted in the earlier simulation section. We study this presumption starting from Figure (ref). Its upper panels present the time-series of the three largest estimated alphas for model FF2 (each point of the series represents the absolute value of the largest estimate of ${\Greekmath 010B}_i$ for a given window). We see that these are maximal between January 1999 and June 2009, which is the period corresponding to the red shaded areas. The lower panels report the time series of asset-specific standard deviation for the assets whose estimated alpha is reported in panels (a) - (c). These standard deviations are strongly associated with the estimated alphas during the highlighted period, suggesting that, over this period, we are in a setting which is very similar to that of our Monte Carlo results in Figure (ref), where we would expect the test by feng2022high to display low power. Indeed, their test rejects the FF2 model for 14% of the windows between January 1999 and June 2006, while our procedure based on ${\Greekmath 0117}=4$ (${\Greekmath 0117}=5$, respectively) rejects 92% (74%, respectively) of the times. The results in Table (ref) and Figure (ref) suggest a similar conclusion when looking at the Asian financial crisis and the outbreak of the COVID pandemic. These empirical findings highlight the usefulness of our testing procedure particularly when asset specific variances are highly associated with the size of absolute pricing errors, as seems to be the case for US stocks during periods of market turmoil.
figure[figure omitted — 1,871 chars of source]
comment\section{A brief note on model comparison}
Our max-type randomized procedure can be naturally extended to particular types of model comparison. In particular, a very straightforward extension can test the null that
\[
\mathbb{H}_0:\, \left|{\Greekmath 010B}_{i,1}\right| = \left|{\Greekmath 010B}_{i,2}\right|,\qquad \relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{ for all } i=1,\dots, N,
\]
where we use absolute values since we only care about the magnitude, not the sign, of the pricing errors. The above says that a straightforward extension of our approach can test the null that two models produce statistically indistinguishable pricing errors for all assets. This null can be written in max terms as
\[
\mathbb{H}_0:\, \max_{i=1,\dots,N}\left|\left|{\Greekmath 010B}_{i,1}\right| - \left|{\Greekmath 010B}_{i,2}\right|\right| = 0.
\]
The alternative is that pricing errors differ, in magnitude, for at least one asset. To be clear, note that this straightforward extension cannot rank different models: it only tells us whether the set of pricing errors is different. Testing this null may start from randomizing the statistic
\[
{\Greekmath 0120}_{i,NT}^{(1,2)} := \sqrt{T}\left|\frac{|\hat{\Greekmath 010B}_{i,1}| - |\hat{{\Greekmath 010B}}_{i,2}|}{s_{NT}^{(12)}}\right|^{{\Greekmath 0117}/2},
\]
where
\[
s_{NT}^{(12)}:= \sqrt{\frac{v_{NT}^{(1)} + v_{NT}^{(2)}}{2NT}},\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{ with }v_{NT}^{(m)} = \sum_{i=1}^N\sum_{t=1}^{T}\left(\hat{u}_{i,t}^{(m)}\right)^{2}.
\]
While the above is the simplest way in which our approach can be extended, other max-type testing strategies can be considered. For instance, we could introduce the $N$-dimensional vector of pricing errors based on model $m$ ${\Greekmath 010B}_m = \left({\Greekmath 010B}_{1,m},\dots, {\Greekmath 010B}_{N,m}\right)$, with mean ${\Greekmath 0116}_m\in\mathbb{R}^{N}$ having $i$-th entry ${\Greekmath 0116}^{(m)}_{i,m}$. Then we could test the null
\[
\mathbb{H}_{0}^{(m,j)}:\, \max_{i}\left|{\Greekmath 0116}_{i,m}\right| = \max_i \left|{\Greekmath 0116}_{i,j}\right|,
\]
which, roughly speaking, says that models $m$ and $j$ deliver the same largest pricing errors, on average. If the null is rejected, one would have to check which one is the largest ($\max_{i}\left|{\Greekmath 0116}_{i,m}\right|$ or $\max_i \left|{\Greekmath 0116}_{i,j}\right|$). Per se, this is not particularly conclusive to rank models: a model that prices all assets but one should be preferable to another that missprices half of the assets, even if the former implies a maximal expected pricing error much larger than the other.
Non max type tests may also be considered. We may test whether the average (in the cross-section) pricing error is the same across two models. This is more interesting than tests based on the maximal pricing error, as we would consider a central tendency of misspricing, not an extreme one. However, this test is a more substantial departure from the theory of this paper.
Model comparison may also be approached as a multiple testing problem in the cross-section. In particular, we may consider the $N$-dimensional sequence of pair-wise null hypotheses $\left\{\mathbb{H}^{(m,j)}_{0,1},\dots,\mathbb{H}_{0,N}^{(m,j)}\right\}$ with generic entry
\[
\mathbb{H}^{(m,j)}_{0,i}\,:\, |{\Greekmath 010B}_{i,m}| = |{\Greekmath 010B}_{i,j}|
\]
and test it against the one-sided alternative $|{\Greekmath 010B}_{i,1}|>|{\Greekmath 010B}_{i,2}|$. Studying the set of assets for which the null is rejected would allow a much more interesting comparison of two different pricing models. This kind of model comparison may also shed some light on whether a pricing factor is strong/weak for a given cross-section (e.g. assume that model $m$ is based on two factors and model $j$ on those two factors plus another). Rejecting the null for $\lfloor N^{1-{\Greekmath 010D}}\rfloor$ test assets could mean that the extra pricing factors is a pricing factor only for the remaining $\lfloor N^{{\Greekmath 010D}} \rfloor$ assets). This is the most informative way of comparing models starting from tests assets, and it would lend itself to a number of applications in finance, such as testing for skills versus luck in the literature on funds performance.
Conclusions
We propose a novel, general methodology to test for
\textquotedblleft zero alpha\textquotedblright\ in linear factor pricing
models, with observable or latent, tradable or non-tradable pricing factors. Our proposed test relies on a randomization scheme and can be used even when residuals exhibit
conditional heteroskedasticity, strong cross-sectional
dependence and non-Gaussianity, and allows for the number
of assets, $N$, to pass to infinity, also at a faster rate than the sample
size $T$. Extensive Monte Carlo analysis shows that the test has very good
power properties, and that it is - compared to other extant approaches -
the one that better controls the Type I Error probability in all scenarios.
commentThe proposed methodology requires, in essence, only a consistent estimator
of the ${\Greekmath 010B} _{i}$s, and its rate of convergence. Hence, several
adaptations of this methodology can be readily proposed based on alternative
estimation techniques including high-dimensional regression estimators such as LASSO.
comment, including LASSO-based estimation - for example, when factors are selected from the
\textquotedblleft factors zoo\textquotedblright , a linear factor pricing
model can be specified after an initial factor-screening procedure based on
variable selection algorithms such as the LASSO or the OCMT procedure of
chudik2018one. As long as a consistent estimator for the ${\Greekmath 010B}
_{i} $s exists in this context, a test for the null of ((ref)) can be
developed.\\.
We discuss two possible extensions which are under investigation by the authors. First, building on the theory developed herein, a randomized
test could be developed to test for the null hypotheses $\mathbb{H}
_{0,i}\,:\,{\Greekmath 010B} _{i}=0$ for $i=1,\dots ,N$, while controlling for
multiple testing.\footnote{By the same token, the test statistic could be constructed also when the equality is replaced by an inequality, such as $\mathbb{H}_{0,i}\,:\,{\Greekmath 010B} _{i}\leq 0$, as in
giglio2021thousands.} Indeed, the individual test statistics would be
perturbed by adding randomness independently across $i$, thus making the
randomized statistics (conditionally) independent across $i$, which would
facilitate the application of customarily employed procedures for size control under multiple testing. This would find a natural application in testing
mutual/hedge-funds performances, as well as assessing trading
strategies. \\
A second extension/application of randomized tests based on rates of convergence is model comparison. Consider two models for $y_{i,t}$, which will be denoted
henceforth using the superscripts $^{\left( 1\right) }$ and $^{\left(
2\right) }$, with ${\Greekmath 010B} _{i}^{\left( 1\right)
} $ and ${\Greekmath 010B} _{i}^{\left( 2\right) } $ respectively. The two models can be
compared to check whether ${\Greekmath 010B} _{i}^{\left( 1\right)
} $ and ${\Greekmath 010B} _{i}^{\left( 2\right) } $ differ in some
sense; in the spirit of the max-type test proposed in this paper, one can test whether the maximally
selected difference of absolute alphas is zero, viz.
equation[equation omitted — 231 chars of source]
Under ((ref)), the worst-case scenario discrepancy between
the alphas of the two models is zero, indicating a comparable
performance. A test can be constructed - adapting our methodology - by defining $
{\Greekmath 0120} _{i,NT}^{\left( 1,2\right) }=\left\vert T^{1/{\Greekmath 0117} }\left[ \left\vert
\widehat{{\Greekmath 010B} }_{i}^{\left( 1\right) }\right\vert -\left\vert \widehat{
{\Greekmath 010B} }_{i}^{\left( 2\right) }\right\vert \right] /\widehat{s}_{NT}^{\left(
1,2\right) }\right\vert ^{{\Greekmath 0117} /2}, $
where $\widehat{s}_{NT}^{\left( 1,2\right) }$ denotes a scaling factor.
\footnote{
Even in this case, any scaling factor which is bounded away from zero and
infinity, and which renders the estimators $\widehat{{\Greekmath 010B} }_{i}^{\left(
1\right) }$ and $\widehat{{\Greekmath 010B} }_{i}^{\left( 2\right) }$ scale free, can
be used e.g., $
\widehat{s}_{NT}^{\left( 1,2\right) }=\sqrt{\sum_{i=1}^{N}\left( \left(
\widehat{u}_{i,t}^{\left( 1\right) }\right) ^{2}+\left( \widehat{u}
_{i,t}^{\left( 2\right) }\right) ^{2}\right) /NT,}$
where $\widehat{u}_{i,t}^{\left( 1\right) }$ and $\widehat{u}_{i,t}^{\left(
2\right) }$\ are the residuals from models $^{\left( 1\right) }$ and $
^{\left( 2\right) }$ respectively, by adapting the definition of $\widehat{s}
_{NT}$ in ((ref)).} It is immediate to see that, under the null, ${\Greekmath 0120}
_{i,NT}^{\left( 1,2\right) }=o_{a.s.}\left( 1\right) $, whereas it would
diverge at a rate $T^{1/2}$ as long as $\left\vert {\Greekmath 010B} _{i}^{\left(
1\right) }\right\vert \neq \left\vert {\Greekmath 010B} _{i}^{\left( 2\right)
}\right\vert $\ for at least one $i$. Hence, our approach can be applied
verbatim to ${\Greekmath 0120} _{i,NT}^{\left( 1,2\right) }$, perturbing each $
{\Greekmath 0120} _{i,NT}^{\left( 1,2\right) }$ by an i.i.d. standard Gaussian
shock ${\Greekmath 0121} _{i}$ and using $
Z_{NT}^{\left( 1,2\right) }=\max_{1\leq i\leq N}\left\vert {\Greekmath 0120}
_{i,NT}^{\left( 1,2\right) }+{\Greekmath 0121} _{i}\right\vert$. This test could be applied to compare two non-nested models, but also to compare a nested and a nesting model - in the latter case, upon not
rejecting $\mathbb{H}_{0}$ of ((ref)), the applied user can
conclude that the nested, \textquotedblleft smaller\textquotedblright\ model
does not result in any worsening. Building on the previous paragraph, model comparison may also be approached as a multiple testing problem in the cross-section. In particular, we may consider the $N$-dimensional sequence of pair-wise null hypotheses $\left\{\mathbb{H}^{(m,j)}_{0,1},\dots,\mathbb{H}_{0,N}^{(m,j)}\right\}$ with generic entry $
\mathbb{H}^{(m,j)}_{0,i}\,:\, |{\Greekmath 010B}_{i,m}| = |{\Greekmath 010B}_{i,j}|
$, and test it against the one-sided alternative $|{\Greekmath 010B}_{i,j}|>|{\Greekmath 010B}_{i,m}|$. \\
In conclusion, we would like to note that our approach - whilst focused here on the issue of testing for alpha in asset pricing models - can be exported to other set-ups. Using essentially the same arguments as in this paper, for example, one could test for the two sample problem in high dimension, or for the equality of intercept and slope in a high-dimensional regression model, or for \textquotedblleft pooling versus not pooling\textquotedblright\ in a large panel data model. In all cases, our approach would be applicable even in the presence of a whole world of misspecification for the errors - thus, being a viable alternative to other, more standard, methodologies when these fail due to their underlying assumptions not being satisfied or due to the need for a robust estimator of the long-run covariance, or for a large covariance matrix estimation.
commentA second extension/application of randomised tests based on rates of convergence is model
comparison.\footnote{We are indebted to an anonymous Referee for pointing us towards this extension.} Consider two models for $y_{i,t}$, which will be denoted
henceforth using the superscripts $^{\left( 1\right) }$ and $^{\left(
2\right) }$, with pricing errors $\left\{ {\Greekmath 010B} _{i}^{\left( 1\right)
},1\leq i\leq N\right\} $ and $\left\{ {\Greekmath 010B} _{i}^{\left( 2\right) },1\leq
i\leq N\right\} $ respectively, and let $\left( \widehat{{\Greekmath 010B} }
_{1}^{\left( 1\right) },...,\widehat{{\Greekmath 010B} }_{N}^{\left( 1\right) }\right)
^{\prime }$ and $\left( \widehat{{\Greekmath 010B} }_{1}^{\left( 2\right) },...,
\widehat{{\Greekmath 010B} }_{N}^{\left( 2\right) }\right) ^{\prime }$ be the $N$
-dimensional vectors of the estimated alphas. Then the two models can be
compared to check whether the vectors of pricing errors differ in some
sense; a possible metric can be based on comparing whether the maximally
selected difference of absolute prices is zero, viz. testing for
\begin{equation}
\mathbb{H}_{0}:\max_{1\leq i\leq N}\left\vert \left\vert {\Greekmath 010B} _{i}^{\left(
1\right) }\right\vert -\left\vert {\Greekmath 010B} _{i}^{\left( 2\right) }\right\vert
\right\vert =0.
\end{equation}
Under ((ref)), the worst-case scenario discrepancy between
the pricing errors of the two models is zero, indicating a comparable
performance. A test can be constructed by adapting our methodology as
follows; define
\begin{equation}
{\Greekmath 0120} _{i,NT}^{\left( 1,2\right) }=\left\vert T^{1/{\Greekmath 0117} }\frac{\left\vert
\widehat{{\Greekmath 010B} }_{i}^{\left( 1\right) }\right\vert -\left\vert \widehat{
{\Greekmath 010B} }_{i}^{\left( 2\right) }\right\vert }{\widehat{s}_{NT}^{\left(
1,2\right) }}\right\vert ^{{\Greekmath 0117} /2},
\end{equation}
where $\widehat{s}_{NT}^{\left( 1,2\right) }$ denotes a scaling factor.
\footnote{
Even in this case, any scaling factor which is bounded away from zero and
infinity, and which renders the estimators $\widehat{{\Greekmath 010B} }_{i}^{\left(
1\right) }$ and $\widehat{{\Greekmath 010B} }_{i}^{\left( 2\right) }$ scale free, can
be used. As an example, one could use
$
\widehat{s}_{NT}^{\left( 1,2\right) }=\sqrt{\sum_{i=1}^{N}\left( \left(
\widehat{u}_{i,t}^{\left( 1\right) }\right) ^{2}+\left( \widehat{u}
_{i,t}^{\left( 2\right) }\right) ^{2}\right) /NT,}$
where $\widehat{u}_{i,t}^{\left( 1\right) }$ and $\widehat{u}_{i,t}^{\left(
2\right) }$\ are the residuals from models $^{\left( 1\right) }$ and $
^{\left( 2\right) }$ respectively, by adapting the definition of $\widehat{s}
_{NT}$ in ((ref)).} It is immediate to see that, under the null, ${\Greekmath 0120}
_{i,NT}^{\left( 1,2\right) }=o_{a.s.}\left( 1\right) $, whereas it would
diverge at a rate $T^{1/2}$ as long as $\left\vert {\Greekmath 010B} _{i}^{\left(
1\right) }\right\vert \neq \left\vert {\Greekmath 010B} _{i}^{\left( 2\right)
}\right\vert $\ for at least one $i$. Hence, our approach can be applied
verbatim to ${\Greekmath 0120} _{i,NT}^{\left( 1,2\right) }$, perturbing each $
{\Greekmath 0120} _{i,NT}^{\left( 1,2\right) }$ by an i.i.d. standard Gaussian
shock ${\Greekmath 0121} _{i}$ and using $
Z_{NT}^{\left( 1,2\right) }=\max_{1\leq i\leq N}\left\vert {\Greekmath 0120}
_{i,NT}^{\left( 1,2\right) }+{\Greekmath 0121} _{i}\right\vert .
$
This test could be applied to compare two non-nested models, but also to
compare a nested and a nesting model - in the latter case, upon not
rejecting $\mathbb{H}_{0}$ of ((ref)), the applied user can
conclude that the nested, \textquotedblleft smaller\textquotedblright\ model
does not result in any worsening.\footnote{
Other metrics can also be considered, such as average-type ones, e.g. based
on $
\mathbb{H}_{0}:N^{-1}\sum_{i=1}^{N}\left\vert {\Greekmath 010B} _{i}^{\left(
1\right) }\right\vert =N^{-1}\sum_{i=1}^{N}\left\vert {\Greekmath 010B}
_{i}^{\left( 2\right) }\right\vert .
$
}
Indeed, building on the previous paragraph, model comparison may also be approached as a multiple testing problem in the cross-section. In particular, we may consider the $N$-dimensional sequence of pair-wise null hypotheses $\left\{\mathbb{H}^{(m,j)}_{0,1},\dots,\mathbb{H}_{0,N}^{(m,j)}\right\}$ with generic entry $
\mathbb{H}^{(m,j)}_{0,i}\,:\, |{\Greekmath 010B}_{i,m}| = |{\Greekmath 010B}_{i,j}|
$, and test it against the one-sided alternative $|{\Greekmath 010B}_{i,1}|>|{\Greekmath 010B}_{i,2}|$. Studying the set of assets for which the null is rejected would allow a much more interesting comparison of two different pricing models. This kind of model comparison may also shed some light on whether a pricing factor is strong/weak for a given cross-section (e.g. assume that model $m$ is based on two factors and model $j$ on those two factors plus another). Rejecting the null for $\lfloor N^{1-{\Greekmath 010D}}\rfloor$ test assets could mean that the extra pricing factors is a pricing factor only for the remaining $\lfloor N^{{\Greekmath 010D}} \rfloor$ assets). This is the most informative way of comparing models starting from tests assets, and it would lend itself to a number of applications in finance, such as testing for skills versus luck in the literature on funds performance.
comment\textcolor{red}{add value of multiple testing also for model comparison}
commentAs discussed in the introduction, factor pricing models can also be tested
by looking at the Hansen-Jagannathan distance of their implied pricing
kernel; this is another specification test for which we could develop a
randomized approach when both $N$ and $T$ diverge. Finally, a randomized
testing strategy could be devised to test the null hypotheses $\mathbb{H}
_{0,i}\,:\,{\Greekmath 010B} _{i}=0$ for $i=1,\dots ,N$ while controlling for the well
known multiple testing problem (with the equality eventually replaced by an
inequality as in giglio2021thousands). Such an extension would be
particularly valuable for testing mutual/hedge-funds performances, as well
as for assessing trading strategies in general.
Fourth, building on such methodology, we also propose a test for
\textquotedblleft relevant alphas\textquotedblright , where the null
hypothesis is not that $\max_{1\leq i\leq N}$ $\left\vert {\Greekmath 010B}
_{i}\right\vert =0$, but that $\max_{1\leq i\leq N}$ $\left\vert {\Greekmath 010B}
_{i}\right\vert $ is greater than a pre-specified threshold which is deemed
economically significant by the applier user.
We apply the derandomized procedure to the constituents of the S{&}P 500
index over multiple five-years rolling windows. The CAPM and the Fama-French
three-factors are rejected for a similar number of rolling windows, while
rejections of the Fama-French five-factors model are more frequent. For all
LFPMS, rejection frequencies of our derandomized procedure are substantially
smaller than those based on competing tests. Based on Monte Carlo results
and robustness checks using individual alpha tests, we conclude that extant
approaches may falsely reject correct specification of several LFPMs. An
extensive investigation of this empirical claim is left for future research.
We also find that none of these models can consistently price large cap US
stocks during periods of market turmoil. Results on the Fama-French three
factors model suggest that some degree of market efficiency is restored
after policy-makers' intervention, both during the Dot-com bubble and the
Global Financial Crisis. For the latter, similar results hold also with the CAPM.
adjustwidth{-5pt}{-5pt}
{ {\
} }
comment\setcounter{section}{0}
\setcounter{equation}{0} \setcounter{lemma}{0} \setcounter{theorem}{0}
\section{Technical lemmas}
Henceforth, we denote the distribution function of the standard normal
calculated at $-\infty <x<\infty $ as $\Phi \left( x\right) $.
We begin with a Baum-Katz-type theorem which is also in massacci2022.
\begin{lemma}
Consider a multi-index partial sum process $U_{S_{1},..,S_{h}}=
\sum_{i_{2}=1}^{S_{2}}\cdot \cdot \cdot \sum_{i_{h}=1}^{S_{h}}{\Greekmath 0118}
_{i_{1},...,i_{h}}$, and assume that, for some $q\geq 1$
\begin{equation*}
\mathbb{E}\sum_{i_{1}=1}^{S_{1}}\left\vert U_{S_{1},..,S_{h}}\right\vert
^{q}\leq c_{0}S_{1}\prod\limits_{j=2}^{h}S_{j}^{d_{j}},
\end{equation*}
where $d_{j}\geq 1$ for all $1\leq j\leq h$. Then it holds that
\begin{equation*}
\limsup_{\min \left\{ S_{1},...,S_{h}\right\} \rightarrow \infty }\frac{
\sum_{i_{1}=1}^{S_{1}}\left\vert U_{S_{1},..,S_{h}}\right\vert ^{q}}{
S_{1}\prod\limits_{j=2}^{h}S_{j}^{d_{j}}\left( \prod\limits_{j=1}^{h}\log
S_{j}\right) ^{2+{\Greekmath 010F} }}=0\relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{ a.s.,}
\end{equation*}
for all ${\Greekmath 010F} >0$.
\begin{proof}
We begin by noting that the function
\begin{equation*}
g\left( x_{1},....,x_{h}\right) =x_{1}\prod\limits_{j=2}^{h}x_{j}^{d_{j}},
\end{equation*}
is superadditive. Consider the vector $\left( y_{1},....,y_{h}\right) $ such
that $y_{i}\geq x_{i}$ for all $1\leq i\leq h$. Then, for any two $s$ and $t$
such that $x_{1}+s\leq y_{1}+t$
\begin{eqnarray*}
\frac{1}{s}\left[ g\left( x_{1}+s,....,x_{h}\right) -g\left(
x_{1},....,x_{h}\right) \right] &=&\prod\limits_{j=2}^{h}x_{j}^{d_{j}}, \\
\frac{1}{t}\left[ g\left( y_{1}+t,....,y_{h}\right) -g\left(
y_{1},....,y_{h}\right) \right] &=&\prod\limits_{j=2}^{h}x_{j}^{d_{j}},
\end{eqnarray*}
whence it trivially follows that
\begin{equation*}
\frac{1}{s}\left[ g\left( x_{1}+s,....,x_{h}\right) -g\left(
x_{1},....,x_{h}\right) \right] =\frac{1}{t}\left[ g\left(
y_{1}+t,....,y_{h}\right) -g\left( y_{1},....,y_{h}\right) \right] .
\end{equation*}
he2023one also showed that, for any two nonzero $s$ and $t$ such
that $x_{i}+s\leq y_{i}+t$, $2\leq i\leq h$
\begin{equation*}
\frac{1}{s}\left[ g\left( x_{1}+s,....,x_{h}\right) -g\left(
x_{1},....,x_{h}\right) \right] \leq \frac{1}{t}\left[ g\left(
y_{1}+t,....,y_{h}\right) -g\left( y_{1},....,y_{h}\right) \right] .
\end{equation*}
Thus, $g\left( x_{1},....,x_{h}\right) $ is an S-convex function (see
Definition 2.1 and Proposition 2.3 in potra), and therefore it is
superadditive (by Proposition 2.9 in potra). Hence we can apply
the maximal inequality in Corollary 4 in moricz1983 with - (in his
notation) $f\left( R\right) =S_{1}\prod\limits_{j=2}^{h}S_{j}^{d_{j}}$ and $
{\Greekmath 011E} \left( \cdot \right) =c_{0}$. Letting
\begin{equation*}
V_{i_{1},...,i_{h}}=\sum_{j_{1}=1}^{i_{1}}\left\vert
\sum_{j_{2}=1}^{i_{2}}\cdot \cdot \cdot \sum_{j_{h}=1}^{i_{h}}{\Greekmath 0118}
_{j_{1},...,j_{h}}\right\vert ^{q},
\end{equation*}
it follows that
\begin{equation*}
\mathbb{E}\max_{1\leq i_{1}\leq S_{1},....,1\leq i_{h}\leq
S_{h}}V_{i_{1},...,i_{h}}\leq
c_{0}S_{1}\prod\limits_{j=2}^{h}S_{j}^{d_{j}}\left(
\prod\limits_{j=1}^{h}\log S_{j}\right) .
\end{equation*}
Hence we have
\begin{eqnarray*}
&&\sum_{S_{1}=1}^{\infty }\cdot \cdot \cdot \sum_{S_{h}=1}^{\infty }\frac{1}{
\prod\limits_{j=1}^{h}S_{j}}\mathbb{P}\left( \max_{1\leq i_{1}\leq
S_{1},....,1\leq i_{h}\leq S_{h}}V_{i_{1},...,i_{h}}\geq {\Greekmath 0122}
S_{1}\prod\limits_{j=2}^{h}S_{j}^{d_{j}}\left( \prod\limits_{j=1}^{h}\log
S_{j}\right) ^{2+{\Greekmath 010F} }\right) \\
&\leq &{\Greekmath 0122} ^{-1}\sum_{S_{1}=1}^{\infty }\cdot \cdot \cdot
\sum_{S_{h}=1}^{\infty }\frac{1}{S_{1}^{2}\prod
\limits_{j=2}^{h}S_{j}^{d_{j}+1}\left( \prod\limits_{j=1}^{h}\log
S_{j}\right) ^{2+{\Greekmath 010F} }}\mathbb{E}\max_{1\leq i_{1}\leq S_{1},....,1\leq
i_{h}\leq S_{h}}V_{i_{1},...,i_{h}} \\
&\leq &c_{0}{\Greekmath 0122} ^{-1}\sum_{S_{1}=1}^{\infty }\cdot \cdot \cdot
\sum_{S_{h}=1}^{\infty }\frac{1}{\prod\limits_{j=1}^{h}S_{j}\left(
\prod\limits_{j=1}^{h}\log S_{j}\right) ^{1+{\Greekmath 010F} }}\leq c_{1}{\Greekmath 0122}
^{-1}.
\end{eqnarray*}
The desired result now follows by repeating the proof of Lemma A.1 in
BT2.
\end{proof}
\end{lemma}
The following estimate on the growth rate of moments of partial sums will be
used throughout the paper, and it can be contrasted with Proposition 4.1 in
berkeshormann.
\begin{lemma}
Let $w_{t}$ be an $L_{{\Greekmath 0117} }$-decomposable Bernoulli shift
with ${\Greekmath 0117} >2$ and $a>3/2$. Then it holds that
\begin{equation}
E\left( \sum_{t=1}^{m}w_{t}\right) ^{p}\leq c_{0}m^{p/2},
\end{equation}
for all $p\leq {\Greekmath 0117} $.
\begin{proof}
We begin by showing that
\begin{equation}
E\left( \sum_{t=1}^{m}w_{t}\right) ^{2}\leq c_{0}m.
\end{equation}
By stationarity, we can write
\begin{eqnarray*}
E\left( \sum_{t=1}^{m}w_{t}\right) ^{2} &=&E\left(
\sum_{t=1}^{m}\sum_{s=1}^{m}w_{t}w_{s}\right) =mE\left( w_{0}^{2}\right)
+2\sum_{t=1}^{m}\left( m-t\right) E\left( w_{t}w_{0}\right) \\
&\leq &mE\left( w_{0}^{2}\right) +2\sum_{t=1}^{m}\left\vert E\left(
w_{t}w_{0}\right) \right\vert .
\end{eqnarray*}
Consider now the costruction $\widetilde{w}_{t,t}$, and note that
\begin{equation*}
E\left( w_{t}w_{0}\right) =E\left( \left( w_{t}-\widetilde{w}_{t,t}\right)
w_{0}\right) +E\left( \widetilde{w}_{t,t}w_{0}\right) =E\left( \left( w_{t}-
\widetilde{w}_{t,t}\right) w_{0}\right) ,
\end{equation*}
on account of the independence between $\widetilde{w}_{t,t}$ and $w_{0}$.
Further
\begin{equation*}
\left\vert E\left( \left( w_{t}-\widetilde{w}_{t,t}\right) w_{0}\right)
\right\vert \leq \left\vert w_{0}\right\vert _{2}\left\vert w_{t}-\widetilde{
w}_{t,t}\right\vert _{2}\leq c_{0}t^{-a}.
\end{equation*}
The desired result now follows by putting everything together. We now show
the main result. Define the coupling construction $\widetilde{w}_{t,\ell }$
with $\ell =\left\lfloor m^{{\Greekmath 0126} }\right\rfloor $, where
\begin{equation}
1/\left( 2a\right) <{\Greekmath 0126} <1/3.
\end{equation}
It holds that
\begin{eqnarray*}
E\left( \sum_{t=1}^{m}w_{t}\right) ^{p} &\leq &2^{p-1}\left( E\left(
\sum_{t=1}^{m}\widetilde{w}_{t,\ell }\right) ^{p}+E\left(
\sum_{t=1}^{m}\left( w_{t}-\widetilde{w}_{t,\ell }\right) \right) ^{p}\right)
\\
&\leq &2^{p-1}\left( E\left( \sum_{t=1}^{m}\widetilde{w}_{t,\ell }\right)
^{p}+E\left( \sum_{t=1}^{m}\left\vert w_{t}-\widetilde{w}_{t,\ell
}\right\vert \right) ^{p}\right) .
\end{eqnarray*}
We have
\begin{equation*}
E\left( \sum_{t=1}^{m}\left\vert w_{t}-\widetilde{w}_{t,{\Greekmath 0126}
}\right\vert \right) ^{p}\leq m^{p-1}\sum_{t=1}^{m}E\left\vert w_{t}-
\widetilde{w}_{t,{\Greekmath 0126} }\right\vert ^{p}\leq c_{0}m^{p-1}m\ell
^{-pa}\leq c_{1}m^{p/2},
\end{equation*}
on account of ((ref)). We now estimate $E\left( \sum_{t=1}^{m}
\widetilde{w}_{t,\ell }\right) ^{p}$; consider the $\left\lfloor m/\ell
\right\rfloor +1$ blocks
\begin{equation*}
\mathcal{B}_{i}=\sum_{t=\ell \left( i-1\right) +1}^{\ell i}\widetilde{w}
_{t,\ell }\relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{, }1\leq i\leq \left\lfloor m/\ell \right\rfloor \relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{ \ \
and \ \ }\mathcal{B}_{\left\lfloor m/\ell \right\rfloor
+1}=\sum_{t=\left\lfloor m/\ell \right\rfloor +1}^{m}\widetilde{w}_{t,\ell }.
\end{equation*}
Note that, by construction, the sequence of blocks $\mathcal{B}_{i}$ with $i$
even is an independent sequence, and so is the sequence of the $\mathcal{B}
_{i}$s with odd $i$. Hence we can write
\begin{equation*}
\sum_{t=1}^{m}\widetilde{w}_{t,\ell }=\sum_{i=1}^{\left\lfloor m/\ell
\right\rfloor /2}\mathcal{B}_{2i}+\sum_{i=1}^{\left\lfloor m/\ell
\right\rfloor /2}\mathcal{B}_{2\left( i-1\right) +1}+\mathcal{B}
_{\left\lfloor m/\ell \right\rfloor +1}.
\end{equation*}
Thus
\begin{eqnarray*}
E\left( \sum_{t=1}^{m}w_{t}\right) ^{p} &\leq &3^{p-1}\left( E\left(
\sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}\mathcal{B}_{2i}\right)
^{p}+E\left( \sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}\mathcal{B}
_{2\left( i-1\right) +1}\right) ^{p}+E\left( \mathcal{B}_{\left\lfloor
m/\ell \right\rfloor +1}\right) ^{p}\right) \\
&\leq &3^{p-1}\left( E\left\vert \sum_{i=1}^{\left\lfloor m/\ell
\right\rfloor /2}\mathcal{B}_{2i}\right\vert ^{p}+E\left\vert
\sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}\mathcal{B}_{2\left(
i-1\right) +1}\right\vert ^{p}+E\left\vert \mathcal{B}_{\left\lfloor m/\ell
\right\rfloor +1}\right\vert ^{p}\right)
\end{eqnarray*}
On account of the independence of the $\mathcal{B}_{2i}$s across $i$, we can
use Rosenthal's inequality (see e.g. Theorem 2.9 in petrov1995limit
), whence
\begin{equation}
E\left\vert \sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}\mathcal{B}
_{2i}\right\vert ^{p}\leq c\left( p\right) \left( E\sum_{i=1}^{\left\lfloor
m/\ell \right\rfloor /2}\left\vert \mathcal{B}_{2i}\right\vert
^{p}+\left\vert \sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}E\left(
\mathcal{B}_{2i}^{2}\right) \right\vert ^{p/2}\right) ,
\end{equation}
where $c\left( p\right) $ is a positive, finite constant that depends only
on $p$. We already know from ((ref)) that
\begin{equation*}
E\left( \mathcal{B}_{2i}^{2}\right) \leq c_{0}\ell ,
\end{equation*}
and therefore
\begin{equation*}
\left\vert \sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}E\left( \mathcal{
B}_{2i}^{2}\right) \right\vert ^{p/2}\leq c_{0}m^{p/2},
\end{equation*}
for some $c_{0}$. Further
\begin{eqnarray*}
&&E\sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}\left\vert \mathcal{B}
_{2i}\right\vert ^{p} \\
&=&E\sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}\left\vert \sum_{t=\ell
\left( 2i-1\right) +1}^{2\ell i}\widetilde{w}_{t,\ell }\right\vert ^{p}\leq
c_{0}\left\lfloor \frac{m}{\ell }\right\rfloor \ell ^{p-1}\sum_{t=\ell
\left( 2i-1\right) +1}^{2\ell i}E\left\vert \widetilde{w}_{t,\ell
}\right\vert ^{p} \\
&\leq &c_{1}\frac{m}{\ell }\ell ^{p}\leq c_{2}m^{{\Greekmath 0126} \left( p-1\right)
+1}\leq c_{3}m^{p/2},
\end{eqnarray*}
by the definition of ${\Greekmath 0126} $\ in ((ref)). Putting all
together, ((ref)) now yields
\begin{equation*}
E\left\vert \sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}\mathcal{B}
_{2i}\right\vert ^{p}\leq c_{0}m^{p/2},
\end{equation*}
and the same holds for the odd blocks $\mathcal{B}_{2\left( i-1\right) +1}$,
and, similarly, for $E\left\vert \mathcal{B}_{\left\lfloor m/\ell
\right\rfloor +1}\right\vert ^{p}$. Hence the final result follows.
\end{proof}
\end{lemma}
We now report a series of lemmas containing estimates of the growth rate of
moments of sums involving $f_{t}$ and $u_{i,t}$.
\begin{lemma}
We assume that Assumption (ref) is satisfied.
Then it holds that
\begin{equation*}
\overline{f}=\frac{1}{T}\sum_{t=1}^{T}f_{t}=\mathbb{E}f_{t}+o_{a.s.}\left(
1\right) .
\end{equation*}
\begin{proof}
We report the proof for the case $d=1$, for simplicity and without loss of
generality. The proof follows from standard arguments; indeed
\begin{equation*}
\frac{1}{T}\sum_{t=1}^{T}f_{t}=\mathbb{E}f_{t}+\frac{1}{T}
\sum_{t=1}^{T}\left( f_{t}-\mathbb{E}f_{t}\right) .
\end{equation*}
Recall that, by Assumption (ref), $f_{t}-\mathbb{E}f_{t}$ is a
centered, $\mathcal{L}_{{\Greekmath 0117} }$-decomposable Bernoulli shift; thus, by Lemma
(ref)
\begin{equation*}
\mathbb{E}\left\vert \sum_{t=1}^{T}\left( f_{t}-\mathbb{E}f_{t}\right)
\right\vert ^{{\Greekmath 0117} }\leq c_{0}T^{{\Greekmath 0117} /2},
\end{equation*}
whence Lemma (ref) readily entails that
\begin{equation*}
\frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-\mathbb{E}f_{t}\right) =o_{a.s.}\left(
1\right) .
\end{equation*}
\end{proof}
\end{lemma}
\begin{lemma}
We assume that Assumption (ref) is satisfied.
Then it holds that
\begin{equation*}
\sum_{i=1}^{N}\left\vert \sum_{t=1}^{T}u_{i,t}\right\vert ^{{\Greekmath 010D}
}=o_{a.s.}\left( NT^{{\Greekmath 010D} /2}\left( \log N\log T\right) ^{2+{\Greekmath 010F}
}\right) ,
\end{equation*}
for all ${\Greekmath 010F} >0$ and all ${\Greekmath 010D} \leq {\Greekmath 0117} $.
\begin{proof}
We estimate convergence rate of
\begin{equation*}
\sum_{i=1}^{N}\mathbb{E}\left\vert \sum_{t=1}^{T}u_{i,t}\right\vert ^{{\Greekmath 010D}
}.
\end{equation*}
By Assumption (ref), we can use Lemma (ref), which entails
that, for all $1\leq i\leq N$
\begin{equation*}
\mathbb{E}\left\vert \sum_{t=1}^{T}u_{i,t}\right\vert ^{{\Greekmath 010D} }\leq c_{{\Greekmath 0117}
}T^{{\Greekmath 010D} /2},
\end{equation*}
where $c_{{\Greekmath 0117} }$ is a positive, finite constant which depends only on ${\Greekmath 0117} $
, whence
\begin{equation*}
\sum_{i=1}^{N}\mathbb{E}\left\vert \sum_{t=1}^{T}u_{i,t}\right\vert ^{{\Greekmath 010D}
}\leq c_{0}NT^{{\Greekmath 010D} /2}.
\end{equation*}
The desired result now readily obtains from Lemma (ref).
\end{proof}
\end{lemma}
\begin{lemma}
We assume that Assumption (ref) is
satisfied. Then it holds that
\begin{equation*}
\frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-\overline{f}\right) \left( f_{t}-
\overline{f}\right) ^{\prime }=\mathcal{V}\left( f\right) +o_{a.s.}\left(
1\right) .
\end{equation*}
\begin{proof}
As above, we report the proof for the case $d=1$, for simplicity and without
loss of generality. It holds that
\begin{equation*}
\frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-\overline{f}\right) ^{2}=\frac{1}{T}
\sum_{t=1}^{T}f_{t}^{2}-\overline{f}^{2}.
\end{equation*}
Consider $f_{t}^{2}$; Assumption (ref)(i) immediately
entails that $\left\{ f_{t}^{2},-\infty <t<\infty \right\} $ is an $\mathcal{
L}_{{\Greekmath 0117} /2}$-decomposable Bernoulli shift with rate $a>1$. Indeed, letting
\begin{equation*}
f_{t}=g^{\left( f\right) }\left( {\Greekmath 0111} _{t}^{\left( f\right) },{\Greekmath 0111}
_{t-1}^{\left( f\right) },...\right) ,
\end{equation*}
where $g^{\left( f\right) }:S^{\infty }\rightarrow
\mathbb{R}
^{d}$ is a non random measurable function and $\left\{ {\Greekmath 0111} _{t}^{\left(
f\right) },-\infty <t<\infty \right\} $ is an i.i.d. sequence with
values in a measurable space $S$, and consider the coupling construction
\begin{equation*}
f_{t}^{\prime }=g^{\left( f\right) }\left( {\Greekmath 0111} _{t}^{\left( f\right)
},...,{\Greekmath 0111} _{t-\ell +1}^{\left( f\right) },{\Greekmath 0111} _{t-\ell ,t,\ell }^{\ast
\left( f\right) },{\Greekmath 0111} _{t-\ell -1,t,\ell }^{\ast \left( f\right)
}...\right) ,
\end{equation*}
with $\left\{ {\Greekmath 0111} _{s,t,\ell }^{\ast \left( f\right) },-\infty <s,\ell
,t<\infty \right\} $ i.i.d. copies of ${\Greekmath 0111} _{0}^{\left( f\right) }$
independent of $\left\{ {\Greekmath 0111} _{t}^{\left( f\right) },-\infty <t<\infty
\right\} $. Then we have
\begin{eqnarray*}
&&\left\vert f_{t}^{2}-\left( f_{t}^{\prime }\right) ^{2}\right\vert _{{\Greekmath 0117}
/2} \\
&=&\left\vert \left( f_{t}+f_{t}^{\prime }\right) \left( f_{t}-f_{t}^{\prime
}\right) \right\vert _{{\Greekmath 0117} /2}\leq \left\vert f_{t}+f_{t}^{\prime
}\right\vert _{{\Greekmath 0117} }\left\vert f_{t}-f_{t}^{\prime }\right\vert _{{\Greekmath 0117} } \\
&\leq &2\left\vert f_{t}\right\vert _{{\Greekmath 0117} }\left\vert f_{t}-f_{t}^{\prime
}\right\vert _{{\Greekmath 0117} }\leq c_{0}\ell ^{-a},
\end{eqnarray*}
having used the Cauchy-Schwartz inequality, Minkowski's inequality, and the
facts that - by Assumption (ref) - $\left\vert f_{t}\right\vert
_{{\Greekmath 0117} }=\left\vert f_{t}^{\prime }\right\vert _{{\Greekmath 0117} }<\infty $ and $
\left\vert f_{t}-f_{t}^{\prime }\right\vert _{{\Greekmath 0117} }\leq c_{0}\ell ^{-a}$,
with $a>1$. Hence
\begin{equation*}
T^{-{\Greekmath 0117} /2}\mathbb{E}\left\vert \sum_{t=1}^{T}\left( f_{t}^{2}-\mathbb{E}
f_{t}^{2}\right) \right\vert ^{{\Greekmath 0117} /2}\leq c_{{\Greekmath 0117} /2}T^{-{\Greekmath 0117} /4},
\end{equation*}
by Lemma (ref), from which it follows from standard arguments
that
\begin{equation*}
\frac{1}{T}\sum_{t=1}^{T}f_{t}^{2}=\mathbb{E}f_{t}^{2}+o_{a.s.}\left(
1\right) .
\end{equation*}
By the same token, it is not hard to see that
\begin{equation*}
\overline{f}=\mathbb{E}\left( f_{t}\right) +o_{a.s.}\left( 1\right) .
\end{equation*}
Thus we have
\begin{equation*}
\frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-\overline{f}\right) ^{2}=\mathbb{E}
f_{t}^{2}-\left( \mathbb{E}f_{t}\right) ^{2}+o_{a.s.}\left( 1\right) ,
\end{equation*}
and the desired result obtains from Assumption (ref)(ii).
\end{proof}
\end{lemma}
\begin{lemma}
We assume that Assumptions (ref)-(ref)
are satisfied. Then it holds that
\begin{equation*}
\sum_{i=1}^{N}\left\vert \sum_{t=1}^{T}f_{t}u_{i,t}\right\vert ^{{\Greekmath 010D}
}=o_{a.s.}\left( NT^{{\Greekmath 010D} /2}\left( \log N\log T\right) ^{2+{\Greekmath 010F}
}\right) ,
\end{equation*}
for every ${\Greekmath 010F} >0$ and ${\Greekmath 010D} \leq {\Greekmath 0117} /2$.
\begin{proof}
We begin by showing that $\left\{ f_{t}u_{i,t},-\infty <t<\infty \right\} $
is an $\mathcal{L}_{{\Greekmath 0117} /2}$-decomposable Bernoulli shift with rate $a>1$.
Recall that, by Assumption (ref), $E\left( f_{t}u_{i,t}\right) =0$
, and
\begin{eqnarray*}
f_{t} &=&g^{\left( f\right) }\left( {\Greekmath 0111} _{t}^{\left( f\right) },{\Greekmath 0111}
_{t-1}^{\left( f\right) },...\right) , \\
u_{i,t} &=&g^{\left( u_{i}\right) }\left( {\Greekmath 0111} _{t}^{\left( i\right) },{\Greekmath 0111}
_{t-1}^{\left( i\right) },...\right) ,
\end{eqnarray*}
where $g^{\left( f\right) }:S^{\infty }\rightarrow
\mathbb{R}
^{d}$ and $g^{\left( u_{i}\right) }:S^{\infty }\rightarrow
\mathbb{R}
$, $1\leq i\leq N$, are non random measurable function and $\left\{ {\Greekmath 0111}
_{t}^{\left( f\right) },-\infty <t<\infty \right\} $ and $\left\{ {\Greekmath 0111}
_{t}^{\left( i\right) },-\infty <t<\infty \right\} $\ are i.i.d.
sequences with values in a measurable space $S$, and consider the coupling
constructions
\begin{eqnarray*}
f_{t}^{\prime } &=&g^{\left( f\right) }\left( {\Greekmath 0111} _{t}^{\left( f\right)
},...,{\Greekmath 0111} _{t-\ell +1}^{\left( f\right) },{\Greekmath 0111} _{t-\ell ,t,\ell }^{\ast
\left( f\right) },{\Greekmath 0111} _{t-\ell -1,t,\ell }^{\ast \left( f\right)
}...\right) , \\
u_{i,t}^{\prime } &=&g^{\left( u_{i}\right) }\left( {\Greekmath 0111} _{t}^{\left(
i\right) },...,{\Greekmath 0111} _{t-\ell +1}^{\left( i\right) },{\Greekmath 0111} _{t-\ell ,t,\ell
}^{\ast \left( i\right) },{\Greekmath 0111} _{t-\ell -1,t,\ell }^{\ast \left( i\right)
}...\right) ,
\end{eqnarray*}
where $\left\{ {\Greekmath 0111} _{s,t,\ell }^{\ast \left( f\right) },-\infty <s,\ell
,t<\infty \right\} $ and $\left\{ {\Greekmath 0111} _{s,t,\ell }^{\ast \left( i\right)
},-\infty <s,\ell ,t<\infty \right\} $\ are i.i.d. copies of ${\Greekmath 0111}
_{0}^{\left( f\right) }$ and ${\Greekmath 0111} _{0}^{\left( i\right) }$\ respectively,
independent of $\left\{ {\Greekmath 0111} _{t}^{\left( f\right) },-\infty <t<\infty
\right\} $ and $\left\{ {\Greekmath 0111} _{t}^{\left( i\right) },-\infty <t<\infty
\right\} $. Then we have, by elementary arguments
\begin{eqnarray*}
&&\left\vert f_{t}u_{i,t}-f_{t}^{\prime }u_{i,t}^{\prime }\right\vert
_{{\Greekmath 010D} } \\
&\leq &\left\vert \left( f_{t}-f_{t}^{\prime }\right) u_{i,t}^{\prime
}\right\vert _{{\Greekmath 010D} }+\left\vert f_{t}^{\prime }\left(
u_{i,t}-u_{i,t}^{\prime }\right) \right\vert _{{\Greekmath 010D} }+\left\vert \left(
f_{t}-f_{t}^{\prime }\right) \left( u_{i,t}-u_{i,t}^{\prime }\right)
\right\vert _{{\Greekmath 010D} } \\
&\leq &\left\vert u_{i,t}\right\vert _{2{\Greekmath 010D} }\left\vert
f_{t}-f_{t}^{\prime }\right\vert _{2{\Greekmath 010D} }+\left\vert f_{t}\right\vert
_{2{\Greekmath 010D} }\left\vert u_{i,t}-u_{i,t}^{\prime }\right\vert _{2{\Greekmath 010D}
}+\left\vert f_{t}-f_{t}^{\prime }\right\vert _{2{\Greekmath 010D} }\left\vert
u_{i,t}-u_{i,t}^{\prime }\right\vert _{2{\Greekmath 010D} } \\
&\leq &\left\vert u_{i,t}\right\vert _{{\Greekmath 0117} }\left\vert f_{t}-f_{t}^{\prime
}\right\vert _{{\Greekmath 0117} }+\left\vert f_{t}\right\vert _{{\Greekmath 0117} }\left\vert
u_{i,t}-u_{i,t}^{\prime }\right\vert _{{\Greekmath 0117} }+\left\vert f_{t}-f_{t}^{\prime
}\right\vert _{{\Greekmath 0117} }\left\vert u_{i,t}-u_{i,t}^{\prime }\right\vert _{{\Greekmath 0117} }
\\
&\leq &c_{0}\ell ^{-a}+c_{1}\ell ^{-a}+c_{2}\ell ^{-2a}\leq c_{3}\ell ^{-a}.
\end{eqnarray*}
Then it holds that
\begin{equation*}
\sum_{i=1}^{N}\mathbb{E}\left\vert \sum_{t=1}^{T}f_{t}u_{i,t}\right\vert
^{{\Greekmath 010D} }\leq c_{0}NT^{{\Greekmath 010D} /2},
\end{equation*}
having used Lemma (ref). The desired result now follows from
Lemma (ref).
\end{proof}
\end{lemma}
\begin{lemma}
We assume that Assumption (ref) is satisfied. Then
it holds that
\begin{eqnarray*}
\liminf_{\min \left\{ N,T\right\} \rightarrow \infty }\frac{1}{NT}
\sum_{i=1}^{N}\sum_{t=1}^{T}\widehat{u}_{i,t}^{2} &>&0, \\
\limsup_{\min \left\{ N,T\right\} \rightarrow \infty }\frac{1}{NT}
\sum_{i=1}^{N}\sum_{t=1}^{T}\widehat{u}_{i,t}^{2} &<&\infty .
\end{eqnarray*}
\begin{proof}
The proof uses several arguments used also elsewhere, so we omit passages
when possible to avoid repetitions. It holds that
\begin{eqnarray*}
&&\frac{1}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}\widehat{u}_{i,t}^{2} \\
&=&\frac{1}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}u_{i,t}^{2}+\frac{1}{NT}
\sum_{i=1}^{N}\sum_{t=1}^{T}\left( \widehat{{\Greekmath 010B} }_{i}-{\Greekmath 010B} _{i}\right)
^{2}+\frac{1}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}\left( \widehat{{\Greekmath 010C} }
_{i}-{\Greekmath 010C} _{i}\right) ^{2}f_{t}^{2} \\
&&+\frac{2}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}\left( \widehat{{\Greekmath 010B} }
_{i}-{\Greekmath 010B} _{i}\right) u_{i,t}+\frac{2}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}
\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right) f_{t}u_{i,t} \\
&&+\frac{2}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}\left( \widehat{{\Greekmath 010B} }
_{i}-{\Greekmath 010B} _{i}\right) \left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right) f_{t}
\\
&=&I+II+III+IV+V+VI.
\end{eqnarray*}
It holds that
\begin{equation*}
I=\frac{1}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}\mathbb{E}u_{i,t}^{2}+\frac{1}{NT}
\sum_{i=1}^{N}\sum_{t=1}^{T}\left( u_{i,t}^{2}-\mathbb{E}u_{i,t}^{2}\right)
=I_{a}+I_{b}.
\end{equation*}
By Assumption (ref), it follows immediately that $0<I_{a}<\infty $;
also, it is easy to see that $u_{i,t}^{2}-\mathbb{E}u_{i,t}^{2}$ is a
centered, $\mathcal{L}_{{\Greekmath 0117} /2}$-decomposable Bernoulli shift (see the
arguments in the proof of Lemma (ref)), and therefore, by
Lemma (ref)
\begin{eqnarray*}
&&\mathbb{E}\left\vert \frac{1}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}\left(
u_{i,t}^{2}-\mathbb{E}u_{i,t}^{2}\right) \right\vert ^{2} \\
&\leq &\frac{1}{NT^{2}}\sum_{i=1}^{N}\mathbb{E}\left\vert
\sum_{t=1}^{T}\left( u_{i,t}^{2}-\mathbb{E}u_{i,t}^{2}\right) \right\vert
^{2}\leq c_{0}T^{-1},
\end{eqnarray*}
whence Lemma (ref) yields $I_{b}=o_{a.s.}\left( 1\right) $. Note also
that
\begin{equation*}
\frac{1}{N}\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right)
^{2}\left( \frac{1}{T}\sum_{t=1}^{T}f_{t}^{2}\right) ,
\end{equation*}
with $T^{-1}\sum_{t=1}^{T}f_{t}^{2}=O_{a.s.}\left( 1\right) $ by Lemma (ref) and
\begin{equation*}
\frac{1}{N}\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right) ^{2}=
\frac{\frac{1}{N}\sum_{i=1}^{N}\left( \frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-
\overline{f}\right) u_{i,t}\right) ^{2}}{\left( \frac{1}{T}
\sum_{t=1}^{T}\left( f_{t}-\overline{f}\right) ^{2}\right) ^{2}}.
\end{equation*}
We know from Lemma (ref) that
\begin{equation*}
\frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-\overline{f}\right)
^{2}=c_{0}+o_{a.s.}\left( 1\right) ,
\end{equation*}
with $c_{0}>0$. Further, using Lemma (ref), it follows that
\begin{equation*}
\frac{1}{N}\sum_{i=1}^{N}\left\vert \frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-
\overline{f}\right) u_{i,t}\right\vert ^{2}=o_{a.s.}\left( 1\right) ,
\end{equation*}
whence $II=o_{a.s.}\left( 1\right) $. The same arguments as in the proof of
Lemma (ref) entail that $III=o_{a.s.}\left( 1\right) $. Finally, a
routine application of H\"{o}lder's inequality yields that $
IV-VI=o_{a.s.}\left( 1\right) $.
\end{proof}
\end{lemma}
\begin{lemma}
We assume that Assumptions (ref)-(ref) are
satisfied. Then, under the null in (ref) it holds that
\begin{equation*}
\sum_{i=1}^{N}{\Greekmath 0120}_{i,NT}=o_{a.s.}\left( 1\right) .
\end{equation*}
\begin{proof}
Let - for simplicity and with no loss of generality - $d=1$. Recall ((ref)), whence also
\begin{equation*}
\widehat{{\Greekmath 010B} }_{i}={\Greekmath 010B} _{i}-\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C}
_{i}\right) \overline{f}+\overline{u}_{i}=-\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C}
_{i}\right) \overline{f}+\overline{u}_{i},
\end{equation*}
under $\mathbb{H}_{0}$. Hence we have
\begin{eqnarray*}
\sum_{i=1}^{N}{\Greekmath 0120}_{i,NT} &=&\frac{T^{1/2}}{\left\vert \hat{s}
_{NT}\right\vert ^{{\Greekmath 0117} /2}}\sum_{i=1}^{N}\left\vert \widehat{{\Greekmath 010B} }
_{i}\right\vert ^{{\Greekmath 0117} /2} \\
&\leq &\frac{T^{1/2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}
\sum_{i=1}^{N}\left\vert \overline{u}_{i}\right\vert ^{{\Greekmath 0117} /2} +\frac{T^{1/2}
}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}\sum_{i=1}^{N}\left\vert
\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right)\overline{f}\right\vert ^{{\Greekmath 0117}
/2} \\
&=&\frac{T^{1/2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}
\sum_{i=1}^{N}\left\vert \overline{u}_{i}\right\vert ^{{\Greekmath 0117} /2}+\frac{T^{1/2}
}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}\sum_{i=1}^{N}\left\vert
\frac{\sum_{t=1}^{T}\left( f_{t}\overline{f}-\overline{f}^{2}\right) u_{i,t}
}{\sum_{t=1}^{T}\left( f_{t}-\overline{f}\right) ^{2}}\right\vert ^{{\Greekmath 0117} /2},
\end{eqnarray*}
We know from Lemma (ref) that there exists a positive, finite
constant $c_{0}$ and a couple of random variables $\left(N_{0},T_{0}\right) $
such that, for all $N\geq N_{0}$ and $T\geq T_{0}$
\begin{equation*}
\frac{T^{1 /2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}
\sum_{i=1}^{N}\left\vert \overline{u}_{i}\right\vert ^{{\Greekmath 0117} /2}\leq c_{0}T^{1
/2}\sum_{i=1}^{N}\left\vert \overline{u}_{i}\right\vert ^{{\Greekmath 0117} /2};
\end{equation*}
using Lemma (ref), it follows that
\begin{equation*}
\frac{T^{1 /2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}
\sum_{i=1}^{N}\left\vert \overline{u}_{i}\right\vert ^{{\Greekmath 0117}
/2}=o_{a.s.}\left( NT^{1 /2}T^{-{\Greekmath 0117} /4}\left( \log N\log T\right)
^{2+{\Greekmath 010F} }\right) =o_{a.s.}\left( 1\right) ,
\end{equation*}
by Assumption (ref). Also
\begin{eqnarray*}
&&\frac{T^{1 /2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}
\sum_{i=1}^{N}\left\vert \frac{\sum_{t=1}^{T}\left( f_{t}\overline{f}-
\overline{f}^{2}\right) u_{i,t}}{\sum_{t=1}^{T}\left( f_{t}-\overline{f}
\right) ^{2}}\right\vert ^{{\Greekmath 0117} /2} \\
&\leq &\frac{T^{1 /2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}\frac{
\sum_{i=1}^{N}\left\vert \overline{f}\frac{1}{T}\sum_{t=1}^{T}f_{t}u_{i,t}
\right\vert ^{{\Greekmath 0117} /2}}{\left\vert \frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-
\overline{f}\right) ^{2}\right\vert ^{{\Greekmath 0117} /2}}+\frac{T^{1 /2}}{\left\vert
\hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}\frac{\sum_{i=1}^{N}\left\vert \overline{f}
^{2}\frac{1}{T}\sum_{t=1}^{T}u_{i,t}\right\vert ^{{\Greekmath 0117} /2}}{\left\vert \frac{1
}{T}\sum_{t=1}^{T}\left( f_{t}-\overline{f}\right) ^{2}\right\vert ^{{\Greekmath 0117} /2}}
.
\end{eqnarray*}
Lemmas (ref), (ref) and (ref) entail
that there exists a positive, finite constant $c_{0}$ and a random variable $
T_{0}$ such that, for all $T\geq T_{0}$
\begin{eqnarray*}
\frac{T^{1 /2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}\frac{
\sum_{i=1}^{N}\left\vert \overline{f}\frac{1}{T}\sum_{t=1}^{T}f_{t}u_{i,t}
\right\vert ^{{\Greekmath 0117} /2}}{\left\vert \frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-
\overline{f}\right) ^{2}\right\vert ^{{\Greekmath 0117} /2}} &\leq &c_{0}T^{1
/2}\sum_{i=1}^{N}\left\vert \frac{1}{T}\sum_{t=1}^{T}f_{t}u_{i,t}\right\vert
^{{\Greekmath 0117} /2}, \\
\frac{T^{1 /2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}\frac{
\sum_{i=1}^{N}\left\vert \overline{f}^{2}\frac{1}{T}\sum_{t=1}^{T}u_{i,t}
\right\vert ^{{\Greekmath 0117} /2}}{\left\vert \frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-
\overline{f}\right) ^{2}\right\vert ^{{\Greekmath 0117} /2}} &\leq &c_{0}T^{1
/2}\sum_{i=1}^{N}\left\vert \frac{1}{T}\sum_{t=1}^{T}u_{i,t}\right\vert
^{{\Greekmath 0117} /2}.
\end{eqnarray*}
We already know from the above that the second term is $o_{a.s.}\left(
1\right) $. Using Lemma (ref), it finally follows that
\begin{equation*}
\frac{T^{1/2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}\frac{
\sum_{i=1}^{N}\left\vert \overline{f}\frac{1}{T}\sum_{t=1}^{T}f_{t}u_{i,t}
\right\vert ^{{\Greekmath 0117} /2}}{\left\vert \frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-
\overline{f}\right) ^{2}\right\vert ^{{\Greekmath 0117} /2}}=o_{a.s.}\left( NT^{1
/2}T^{-{\Greekmath 0117} /4}\left( \log N\log T\right) ^{2+{\Greekmath 010F} }\right),
\end{equation*}
which converges to zero almost surely under Assumption (ref).
The desired result now obtains by putting all together.
\end{proof}
\end{lemma}
\begin{remark}
Lemma (ref) holds also for the general
statistic in equation (ref) as long as we replace Assumption (ref) with the condition $N = O\left(T^{{\Greekmath 0117}/4 - {\Greekmath 010F}}\right)$,
where ${\Greekmath 010F}$ is positive and such that ${\Greekmath 010F}> \frac{{\Greekmath 010E}{\Greekmath 0117}}{2}$.
\end{remark}
\setcounter{equation}{0} \setcounter{lemma}{0} \setcounter{theorem}{0}
\section{Proofs}
\begin{proof}[Proof of Theorem (ref)]
We begin by proving ((ref)). The proof follows a similar approach to
the proof of Theorem 3 in he2024online, which we refine.
To begin with, note that, for all $-\infty <x<\infty $
\begin{equation*}
\mathbb{P}^{\ast }\left( \frac{Z_{N,T}-b_{N}}{a_{N}}\leq x\right) =P^{\ast
}\left( Z_{N,T}\leq a_{N}x+b_{N}\right) ,
\end{equation*}
where recall that $z_{i,NT}={\Greekmath 0120} _{i,NT}+{\Greekmath 0121} _{i}$. Seeing as ${\Greekmath 0121}
_{i} $ is, by construction, independent across $i$ and independent of the
sample, it follows that
\begin{equation*}
\mathbb{P}^{\ast }\left( Z_{N,T}\leq a_{N}x+b_{N}\right)
=\mathop{ \prod }\limits_{i=1}^{N}\mathbb{P}^{\ast }\left( z_{i,NT}\leq
a_{N}x+b_{N}\right) =\mathop{ \prod }\limits_{i=1}^{N}\mathbb{P}^{\ast }\left( {\Greekmath 0121}
_{i}\leq a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right) .
\end{equation*}
Let $\Phi \left( \cdot \right) $ denote the standard normal distribution; we
have
\begin{equation}
\mathop{ \prod }\limits_{i=1}^{N}\mathbb{P}^{\ast }\left( {\Greekmath 0121} _{i}\leq
a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right) =\exp \left( \sum_{i=1}^{N}\log \Phi \left(
a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right) \right) .
\end{equation}
Note now that
\begin{equation}
\log \Phi \left( a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right) =\log \Phi \left(
a_{N}x+b_{N}\right) +\log \frac{\Phi \left( a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right)
}{\Phi \left( a_{N}x+b_{N}\right) };
\end{equation}
using Lagrange's theorem, there exists an $a_{i}^{\ast }\in \left(
a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT},a_{N}x+b_{N}\right) $ such that $\Phi \left(
a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right) $ $=$ $\Phi \left( a_{N}x+b_{N}\right) $ $-$
${\Greekmath 0127} \left( a_{i}^{\ast }\right) {\Greekmath 0120}_{i,NT}$, where ${\Greekmath 0127} \left(
\cdot \right) $ denotes the density function of the standard normal, so that
ultimately
\begin{equation*}
\log \frac{\Phi \left( a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right) }{\Phi \left(
a_{N}x+b_{N}\right) }=\log \left( 1-\frac{{\Greekmath 0127} \left( a_{i}^{\ast
}\right) }{\Phi \left( a_{N}x+b_{N}\right) }{\Greekmath 0120} _{i,NT}\right) =\log \left(
1-c_{i}{\Greekmath 0120} _{i,NT}\right) .
\end{equation*}
By elementary arguments, it follows that
\begin{eqnarray*}
&&\exp \left( \sum_{i=1}^{N}\log \frac{\Phi \left( a_{N}x+b_{N}-{\Greekmath 0120}
_{i,NT}\right) }{\Phi \left( a_{N}x+b_{N}\right) }\right) \\
&=&\exp \left( \sum_{i=1}^{N}\log \left( 1-c_{i}{\Greekmath 0120}_{i,NT}\right) \right) =
\exp \left(\frac{N}{N}\log\left(\mathop{ \prod }_{i=1}^{N}\left(1 -
c_{i}{\Greekmath 0120}_{i,NT}\right)\right)\right) \\
&\leq &\exp \left( N\log \left( \frac{1}{N}\sum_{i=1}^{N}\left(1-c_{i}
{\Greekmath 0120}_{i,T}\right) \right) \right)=\exp \left( N\log \left( 1-\left( \frac{1}{
N}\sum_{i=1}^{N}c_{i}{\Greekmath 0120}_{i,NT}\right) \right) \right) \\
&=&\exp \left( \sum_{h=1}^{\infty }N^{-h+1}\frac{\left(-1\right) ^{h}\left(
\sum_{i=1}^{N}c_{i}{\Greekmath 0120} _{i,NT}\right) ^{h}}{h}\right),
\end{eqnarray*}
having used the arithmetic/geometric mean inequality to move from the second
to the third line, and a Taylor expansion of $\log(1+x)$ around $x=0$ in the
last line. Since $c_{i}\leq \left( 2{\Greekmath 0119} \right) ^{-1/2}\left[ \Phi
\left(a_{N}x+b_{N}\right) \right] ^{-1}\leq \overline{c}$, and, by Lemma (ref),
\begin{equation*}
\mathbb{P}\left( {\Greekmath 0121} :\lim_{\min \left\{ N,T\right\} \rightarrow \infty
}\sum_{i=1}^{N}{\Greekmath 0120} _{i,NT}=0\right) =1,
\end{equation*}
we can assume that $\lim_{\min \left\{ N,T\right\} \rightarrow \infty
}\sum_{i=1}^{N}{\Greekmath 0120} _{i,NT}=0$, it follows from elementary arguments that
\begin{equation}
\lim_{\min \left\{ N,T\right\} \rightarrow \infty }\exp \left(
\sum_{i=1}^{N}\log \frac{\Phi \left( a_{N}x+b_{N}-{\Greekmath 0120}_{i,NT}\right) }{\Phi
\left( a_{N}x+b_{N}\right) }\right) =1.
\end{equation}
Thus we have
\begin{eqnarray*}
&&\lim_{\min \left\{ N,T\right\} \rightarrow \infty
}\mathop{ \prod }\limits_{i=1}^{N}P^{\ast }\left( {\Greekmath 0121} _{i}\leq
a_{N}x+b_{N}-{\Greekmath 0120}_{i,NT}\right) \\
&=&\left( \lim_{N\rightarrow \infty }\Phi ^{N}\left( a_{N}x+b_{N}\right)
\right) \times \left( \lim_{\min \left\{ N,T\right\} \rightarrow \infty
}\exp \left( \sum_{i=1}^{N}\log \frac{\Phi \left( a_{N}x+b_{N}-{\Greekmath 0120}
_{i,T}\right) }{\Phi \left( a_{N}x+b_{N}\right) }\right) \right) \\
&=&\exp \left( -\exp \left( -x\right) \right) ,
\end{eqnarray*}
using the relations in (ref) - (ref) to move
from the first to the second line, and the Fisher- “Tippett\^{a}\hbox{\rm\rlap C=}
“Gnedenko Theorem (see Theorem 3.2.3 in embrechts2013modelling,
among others) along with the limit in ((ref)) to obtain the
final result.
We now turn to showing ((ref)). Under the alternative, there exists a
set of $1\leq m\leq N$ indices $\mathcal{I}=\left\{ i_{1},\dots
,i_{m}\right\} \subseteq \left\{ 1,\dots ,N\right\} $ such that $\left\vert
{\Greekmath 010B} _{i}\right\vert >0$ whenever $i\in \mathcal{I}$; in these cases, $
{\Greekmath 0120}_{i,NT}$ diverges almost surely at the rate $T^{1/2}$, i.e.
\begin{equation*}
T^{-1/2}{\Greekmath 0120}_{i,NT}\overset{a.s.}{\rightarrow }c>0\relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{ whenever }i\in
\mathcal{I}\relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{.}
\end{equation*}
Hence, we can assume that
\begin{equation*}
\lim_{T\rightarrow \infty }T^{-1 /2}{\Greekmath 0120}_{i,NT}=c>0,
\end{equation*}
whenever $i\in \mathcal{I}$. Note now that, for any $-\infty <x<\infty $ we
have
\begin{equation*}
\begin{aligned} P^{\ast }\left( Z_{N,T}\leq a_{N}x+b_{N}\right)&
=\mathop{ \prod }\limits_{i=1}^{N}P^{\ast }\left( z_{i,T}\leq
a_{N}x+b_{N}\right)\leq\mathop{ \prod }\limits_{i\in\mathcal{I}}P^{\ast }\left( {\Greekmath 0121}
_{i}\leq a_{N}x+b_{N}-{\Greekmath 0120}_{i,NT}\right)\\ & =
\mathop{ \prod }_{i\in\mathcal{I}}\Phi\left(a_{N}x+b_{N} - {\Greekmath 0120}_{i,NT} \right).
\end{aligned}
\end{equation*}
Equation (5) in borjesson1979simple entails that
\begin{equation}
\Phi \left( a_{N}x+b_{N}-{\Greekmath 0120}_{i,NT}\right) \leq \frac{\mathrm{exp}\left( -
\frac{1}{2}\left( a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right) ^{2}\right) }{\sqrt{2{\Greekmath 0119} }
\left\vert a_{N}x+b_{N}-{\Greekmath 0120}_{i,NT}\right\vert }.
\end{equation}
Seeing as, by construction, $a_{N}x+b_{N}=O(\sqrt{2\log N})$\ for each $
-\infty <x<\infty $, by Assumption (ref) it follows that $
a_{N}x+b_{N}-{\Greekmath 0120}_{i,NT}\overset{a.s.}{\rightarrow }-\infty $ whenever $i\in
\mathcal{I}$. Hence, as $\min \left\{ N,T\right\} \rightarrow \infty $ it
holds that
\begin{equation*}
0\leq \Phi \left( a_{N}x+b_{N}-{\Greekmath 0120}_{i,NT}\right) \leq \frac{\mathrm{exp}
\left( -\frac{1}{2}\left( a_{N}x+b_{N}-{\Greekmath 0120}_{i,NT}\right) ^{2}\right) }{
\sqrt{2{\Greekmath 0119} }\left\vert a_{N}x+b_{N}-{\Greekmath 0120}_{i,NT}\right\vert }\overset{a.s.}{
\rightarrow }0,
\end{equation*}
which, by dominated convergence, entails that $\Phi \left( a_{N}x+b_{N}-{\Greekmath 0120}
_{i,T}\right) =o_{a.s.}(1)$. As long as $\mathcal{I}$ is not empty, this
immediately entails that
\begin{equation*}
\lim_{\min \left\{ N,T\right\} \rightarrow \infty }\mathbb{P}^{\ast }\left(
Z_{N,T}\leq a_{N}x+b_{N}\right) =0,
\end{equation*}
for almost all realizations of $\left\{ \left( u_{i,t},f_{t}^{\prime
}\right) ^{\prime },1\leq i\leq N,1\leq t\leq T\right\} $.
\end{proof}
\begin{remark}
The proof of Theorem 1 holds almost unchanged for the more general statistic
in (ref). The only difference consists in replacing $T^{-1/2}$
with $T^{-{\Greekmath 010E}{\Greekmath 0117}/2}$ when discussing the behavior under the alternative.
No further calculations or arguments are required with respect to the
current proof.
\end{remark}
\begin{proof}[Proof of Theorem (ref)]
Write, for short, $Q_{N,T,B}\left( {\Greekmath 011C} \right) =Q_{{\Greekmath 011C} }$. Recall
\begin{equation*}
Q_{{\Greekmath 011C} }=\frac{1}{B}\sum_{b=1}^{B}\mathbb{I}\left( Z_{N,T}^{\left( b\right)
}\leq c_{{\Greekmath 011C} }\right) ,
\end{equation*}
and let $X_{N,T}^{\left( b\right) }=\mathbb{I}\left( Z_{N,T}^{\left(
b\right) }\leq c_{{\Greekmath 011C} }\right) $ for short. Note that, by similar passages
as in the proof of Theorem (ref)
\begin{eqnarray}
&&\mathbb{E}^{\ast }\left( X_{N,T}^{\left( b\right) }\right) \\
&=&\mathbb{P}^{\ast }\left( Z_{N,T}^{\left( b\right) }\leq c_{{\Greekmath 011C} }\right)
\notag \\
&=&\mathop{ \prod }\limits_{i=1}^{N}\mathbb{P}^{\ast }\left( {\Greekmath 0121}_{i}^{\left(
b\right) }\leq c_{{\Greekmath 011C} }-{\Greekmath 0120}_{i,NT}\right) \notag \\
&=&\exp \left( \sum_{i=1}^{N}\log \mathbb{P}^{\ast }\left(
{\Greekmath 0121}_{i}^{\left( b\right) }\leq c_{{\Greekmath 011C} }-{\Greekmath 0120}_{i,NT}\right) \right)
\notag \\
&=&\exp \left( \sum_{i=1}^{N}\log \left[ \mathbb{P}^{\ast }\left( {\Greekmath 0121}
_{i}^{\left( b\right) }\leq c_{{\Greekmath 011C} }\right) \left( 1-\frac{\mathbb{P}^{\ast
}\left(c_{{\Greekmath 011C} }-{\Greekmath 0120}_{i,NT}\leq {\Greekmath 0121} _{i}^{\left( b\right)}\leq c_{{\Greekmath 011C}
}\right) }{\mathbb{P}^{\ast }\left( {\Greekmath 0121} _{i}^{\left( b\right) }\leq
c_{{\Greekmath 011C} }\right) }\right) \right] \right) \notag \\
&=&\exp \left( \sum_{i=1}^{N}\log \mathbb{P}^{\ast }\left( {\Greekmath 0121}
_{i}^{\left( b\right) }\leq c_{{\Greekmath 011C} }\right) -c_{0}\sum_{i=1}^{N}\mathbb{P}
^{\ast }\left( c_{{\Greekmath 011C} }-{\Greekmath 0120}_{i,NT}\leq {\Greekmath 0121} _{i}^{\left( b\right) }\leq
c_{{\Greekmath 011C} }\right) \right) \notag \\
&=&\exp \left( \sum_{i=1}^{N}\log \mathbb{P}^{\ast }\left({\Greekmath 0121}_{i}^{\left(
b\right) }\leq c_{{\Greekmath 011C} }\right) \right) \exp
\left(-c_{1}\sum_{i=1}^{N}{\Greekmath 0120}_{i,NT}\right) \notag
\end{eqnarray}
for some positive, finite constants $c_{0}$ and $c_{1}$, and having used the
fact that ${\Greekmath 0120}_{i, NT}$ implies $\mathbb{P}^{\ast}\left({\Greekmath 0121}_{i}^{\left(b
\right)}\leq c_{{\Greekmath 011C}}-{\Greekmath 0120}_{i,NT}\right) = \mathbb{P}^{\ast
}\left({\Greekmath 0121}_{i}^{\left( b\right) }\leq c_{{\Greekmath 011C}}\right) - \mathbb{P}
^{\ast}\left(c_{{\Greekmath 011C} }-{\Greekmath 0120}_{i,NT}\leq {\Greekmath 0121}_{i}^{\left( b\right)}\leq
c_{{\Greekmath 011C} }\right)$ to move from the fourth to the fifth line.
We now start by showing ((ref)). It holds that
\begin{eqnarray}
\frac{Q_{{\Greekmath 011C} }-\left( 1-{\Greekmath 011C} \right) }{\sqrt{{\Greekmath 011C} \left( 1-{\Greekmath 011C} \right) }}
&=&\frac{Q_{{\Greekmath 011C} }-\left( 1-{\Greekmath 011C} \right) }{\left( \mathcal{V}^{\ast }\left(
Q_{{\Greekmath 011C} }\right) \right) ^{1/2}}\frac{\left( \mathcal{V}^{\ast }\left(
Q_{{\Greekmath 011C} }\right) \right) ^{1/2}}{\sqrt{{\Greekmath 011C} \left( 1-{\Greekmath 011C} \right) }}
\\
&=&\frac{Q_{{\Greekmath 011C} }-\mathbb{E}^{\ast }\left( Q_{{\Greekmath 011C} }\right) }{\left(
\mathcal{V}^{\ast }\left( Q_{{\Greekmath 011C} }\right) \right) ^{1/2}}\frac{\left(
\mathcal{V}^{\ast }\left( Q_{{\Greekmath 011C} }\right) \right) ^{1/2}}{\sqrt{{\Greekmath 011C} \left(
1-{\Greekmath 011C} \right) }}+\frac{\mathbb{E}^{\ast }\left( Q_{{\Greekmath 011C} }\right) -\left(
1-{\Greekmath 011C} \right) }{\left( \mathcal{V}^{\ast }\left( Q_{{\Greekmath 011C} }\right) \right)
^{1/2}}\frac{\left( \mathcal{V}^{\ast }\left( Q_{{\Greekmath 011C} }\right) \right) ^{1/2}
}{\sqrt{{\Greekmath 011C} \left( 1-{\Greekmath 011C} \right) }} \notag \\
&=&I+II, \notag
\end{eqnarray}
where $\mathcal{V}^{\ast }\left( Q_{{\Greekmath 011C} }\right) $ denotes the variance of $
Q_{{\Greekmath 011C} }$ conditional on the sample, with
\begin{equation*}
\mathcal{V}^{\ast }\left( Q_{{\Greekmath 011C} }\right) =\mathbb{E}^{\ast }\left(
X_{N,T}^{\left( b\right) }\right) \left[ 1-\mathbb{E}^{\ast }\left(
X_{N,T}^{\left( b\right) }\right) \right] .
\end{equation*}
On account of ((ref)), it follows that $\mathbb{E}^{\ast }\left(
X_{N,T}^{\left( b\right) }\right) =\left( 1-{\Greekmath 011C} \right) +o_{a.s.}\left(
1\right) $, and therefore it also follows that $\mathcal{V}^{\ast }\left(
Q_{{\Greekmath 011C} }\right) ={\Greekmath 011C} \left( 1-{\Greekmath 011C} \right) +o_{a.s.}\left( 1\right) $,
whence the Law of the Iterated Logarithm ultimately yields that, as far as $
I $ in ((ref)) is concerned
\begin{equation*}
\left\vert \frac{Q_{{\Greekmath 011C} }-\mathbb{E}^{\ast }\left( Q_{{\Greekmath 011C} }\right) }{
\left( \mathcal{V}^{\ast }\left( Q_{{\Greekmath 011C} }\right) \right) ^{1/2}}\frac{
\left( \mathcal{V}^{\ast }\left( Q_{{\Greekmath 011C} }\right) \right) ^{1/2}}{\sqrt{{\Greekmath 011C}
\left( 1-{\Greekmath 011C} \right) }}\right\vert =O_{a.s.}\left( \sqrt{\frac{2\log \log B
}{B}}\right) .
\end{equation*}
We now turn to studying $II$ in ((ref)). We start by establishing
that:
\begin{equation*}
\mathbb{E}^{\ast }\left( Q_{{\Greekmath 011C} }\right) -\left( 1-{\Greekmath 011C} \right)
=o_{a.s.}\left( \sqrt{\frac{2\log \log B}{B}}\right).
\end{equation*}
Using ((ref)), we receive
\begin{eqnarray*}
\mathbb{E}^{\ast }\left( Q_{{\Greekmath 011C} }\right) &=&\mathbb{E}^{\ast }\left( \frac{1
}{B}\sum_{b=1}^{B}X_{N,T}^{\left( b\right) }\right) =\mathbb{E}^{\ast
}\left( X_{N,T}^{\left( b\right) }\right) \\
&=&\exp \left( \sum_{i=1}^{N}\log \mathbb{P}^{\ast}\left( {\Greekmath 0121}
_{i}^{\left( b\right) }\leq c_{{\Greekmath 011C} }\right) \right) \exp \left(
-c_{1}\sum_{i=1}^{N}{\Greekmath 0120}_{i,NT}\right) \\
&=&\left( \mathbb{P}^{\ast}\left( {\Greekmath 0121} _{i}^{\left( b\right) }\leq c_{{\Greekmath 011C}
}\right) \right) ^{N}\exp \left( -c_{1}\sum_{i=1}^{N}{\Greekmath 0120}_{i,NT}\right) .
\end{eqnarray*}
Note now that
\begin{eqnarray*}
&&\sqrt{\frac{B}{\log \log B}}\left\vert \mathbb{E}^{\ast }\left( Q_{{\Greekmath 011C}
}\right) -\left( 1-{\Greekmath 011C} \right) \right\vert \\
&\leq &\sqrt{\frac{B}{\log \log B}}\left\vert \left( \mathbb{P}^{\ast}\left(
{\Greekmath 0121} _{i}^{\left( b\right) }\leq c_{{\Greekmath 011C} }\right) \right) ^{N}-\left(
1-{\Greekmath 011C} \right) \right\vert \\
&&+\left( 1-{\Greekmath 011C} \right) \sqrt{\frac{B}{\log \log B}}\left\vert \exp \left(
-c_{1}\sum_{i=1}^{N}{\Greekmath 0120} _{i,NT}\right) -1\right\vert =II_{a}+II_{b}.
\end{eqnarray*}
Using equation (10) in hall1979rate - with, in his notation, $
x=-\log \left( -\log \left( 1-{\Greekmath 011C} \right) \right) $ - it holds that
\begin{equation*}
II_{a}\leq c_{0}\sqrt{\frac{B}{\log \log B}}\frac{1}{\log N}=o\left(
1\right) ,
\end{equation*}
having used the fact that $B=O\left( \left( \log N\right) ^{2}\right) $.
Further, by a standard application of the Mean Value Theorem
\begin{equation*}
II_{b}\leq c_{0}\sqrt{\frac{B}{\log \log B}}\left\vert \sum_{i=1}^{N}{\Greekmath 0120}
_{i,T}\right\vert =o_{a.s}\left( 1\right) ,
\end{equation*}
by Assumption (ref). Hence we have
\begin{equation*}
\sqrt{\frac{B}{\log \log B}}\left\vert \mathbb{E}^{\ast }\left( Q_{{\Greekmath 011C}
}\right) -\left( 1-{\Greekmath 011C} \right) \right\vert =o_{a.s}\left( 1\right) ,
\end{equation*}
which immediately yields the desired result.
Under the alternative, we write
\begin{eqnarray*}
Q_{{\Greekmath 011C} } &=&\mathbb{E}^{\ast }\left( Q_{{\Greekmath 011C} }\right) +Q_{{\Greekmath 011C} }-\mathbb{E}
^{\ast }\left( Q_{{\Greekmath 011C} }\right) \\
&=&\frac{1}{B}\sum_{b=1}^{B}\mathbb{E}^{\ast }\left( X_{N,T}^{\left(
b\right) }\right) +\frac{1}{B}\sum_{b=1}^{B}\left( X_{N,T}^{\left( b\right)
}-\mathbb{E}^{\ast }\left( X_{N,T}^{\left( b\right) }\right) \right) \\
&=&\mathbb{E}^{\ast }\left( X_{N,T}^{\left( 1\right) }\right) +\frac{1}{B}
\sum_{b=1}^{B}\left( X_{N,T}^{\left( b\right) }-\mathbb{E}^{\ast }\left(
X_{N,T}^{\left( b\right) }\right) \right) =I+II.
\end{eqnarray*}
We know from the proof of Theorem (ref) that, under $\mathbb{H}_{A}$
, $I=o_{a.s.}\left( 1\right) $. Moreover, note that, due to $X_{N,T}^{\left(
b\right) }$ being \textit{i.i.d.} across $1\leq b\leq B$
\begin{equation*}
\mathcal{V}^{\ast }\left( \frac{1}{B}\sum_{b=1}^{B}\left( X_{N,T}^{\left(
b\right) }-\mathbb{E}^{\ast }\left( X_{N,T}^{\left( b\right) }\right)
\right) \right) =B^{-1}\mathcal{V}^{\ast }\left( X_{N,T}^{\left( 1\right)
}\right) \leq c_{0}B^{-1},
\end{equation*}
a.s., and therefore, by the Law of the Total Variance, it also holds that
\begin{equation*}
\mathcal{V}\left( \frac{1}{B}\sum_{b=1}^{B}\left( X_{N,T}^{\left( b\right) }-
\mathbb{E}^{\ast }\left( X_{N,T}^{\left( b\right) }\right) \right) \right)
\leq c_{0}B^{-1};
\end{equation*}
Lemma (ref) then entails that $II=o_{a.s.}\left( 1\right) $. The
desired result now follows automatically.
\end{proof}
\section{Further Monte Carlo analyses}
This section extends the Monte Carlo analysis of
Section (ref) by studying finite sample properties of the test
based on Theorem (ref) under different data generating processes. In
particular, Section (ref) is concerned with the
factor structure for the residuals of the pricing models, i.e.\ $\boldsymbol{
u}_{t}$, while Section (ref) discusses the
implications of changes in the strength of the pricing factors $\mathbf{f}
_{t} = (f_{1,t}, f_{2,t},f_{3,t})^{\prime }$.
\subsubsection{Different strengths of the omitted factor}
We consider the same three-factor
pricing model of Section (ref), that we here report for
completeness
\begin{equation*}
\begin{aligned} &y_{i,t} ={\Greekmath 010B} _{i}+\sum_{p=1}^{3}{\Greekmath 010C} _{i,p}f_{p,t}+u
_{i,t}, \\ &\boldsymbol{f}_{t} =\overline{\boldsymbol{f}}+\Phi
\boldsymbol{f}_{t-1}+\boldsymbol{{\Greekmath 0110} }_{t},\\ &\mathbf{u}_{t}
=\boldsymbol{{\Greekmath 010D} }{\Greekmath 0117} _{t}+\boldsymbol{{\Greekmath 0118} }_{t},\\ &{\Greekmath 0117} _{t} ={\Greekmath 011E} _{{\Greekmath 0117}
}{\Greekmath 0117} _{t-1}+{\Greekmath 011F} _{t},\\ &\boldsymbol{{\Greekmath 0110} }_{t}\overset{i.i.d.}{\sim
}\mathcal{N}_{3}(0,I_{3}),\qquad\boldsymbol{{\Greekmath 0118}
}_{t}\overset{i.i.d.}{\sim}t_{5,5}\qquad {\Greekmath 011F}_{t}\overset{i.i.d.}{\sim}
\mathcal{N}(0,1)\\ \end{aligned}
\end{equation*}
and we refer to reader to Section (ref) for values of the
parameters. In the main body, ${\Greekmath 010D}_i\overset{i.i.d.}{\sim}\mathcal{U}
(0.7,0.9)$ which implies that ${\Greekmath 010D}_i>0$ for any cross-sectional entity.
We now depart from that assumption in two ways: first, we consider the case
where only $\lfloor N^{0.4}\rfloor$ assets have a non-zero loading on ${\Greekmath 0117}_t$
; secondly, we look at a situation where $\lfloor N^{0.8}\rfloor$
cross-sectional units have a non-zero loading on ${\Greekmath 0117}_t$. These two
experiments correspond to the case of a weak and of a semi-strong omitted
pricing factors, respectively. Notably, the largest eigenvalue of the
covariance matrix of $\mathbf{u}_t$ will be bounded in the weak factor case,
while it will explode to plus infinity in the semi-strong one. We consider
the same sample sizes and alternative hypothesis as in Section (ref)
Empirical rejection frequencies for the weak factor case are in Table (ref). Results for our test and for that of feng2022high are very similar to those in the main body (Table (ref)) both under both the null and the alternative hypothesis.
Actual sizes of the GOS and PY tests are much closer to the nominal one,
suggesting that strong-cross sectional dependence in the residuals was the
driver of their overrejections. Their powers are substantially unaltered.
The test of ardia2024robust performs well in terms of size, but still
exhibits a lack of power when $T$ is small. All previous considerations hold
unchanged with respect to the value of ${\Greekmath 011E}_{g}$.
Table (ref) shows results for the semi-strong.
We would like to point out the importance of this data generating process,
as bailey2021measurement described tens of semi-strong pricing factor
for the cross-section of US excess returns. Empirical rejection frequencies
are very close to those of the main body, as the tests by gagliardini2016time, pesaran2023testing, and feng2022high
all become oversized when ${\Greekmath 011E}_{g} = 0.4$. This is most likely an effect of
strong cross-sectional dependence in the residuals, as implied by a
diverging eigenvalue in their covariance matrix. Results on the test by of
ardia2024robust are equivalent to those of Tables (ref)
and (ref).
\begin{table}[h!]
\captionsetup{font=small}
\caption{Empirical rejection frequencies for the test in Theorem (ref), Student's $t$ innovations with weak omitted common factor.}
\begin{center}
{\scriptsize
\begin{tabular}{ll|
S S S S S S
c
S S S S S S}
\toprule
&&\multicolumn{6}{c}{${\Greekmath 011E}_g=0$; ${\Greekmath 010B}_i=0$ for all $i$}&&
\multicolumn{6}{c}{${\Greekmath 011E}_g=0$; ${\Greekmath 010B}_i\sim N(0,1)$ for 5% of units} \\
\midrule
$N$&$\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{Test }\backslash T$
&{100}&{200}&{300}&{500}&{1000}&{2000}&&
{100}&{200}&{300}&{500}&{1000}&{2000}\\
\midrule
100&Thm.\ 1
&4.0&2.7&3.5&3.3&3.2&3.2&&
94.1&95.9&96.8&98.0&99.4&99.7\\
&FLLM
&4.8&5.7&4.4&3.4&4.4&5.3&&
98.4&99.8&99.9&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&4.5&4.7&3.4&3.6&2.7&&
\multicolumn{1}{c}{--}&98.5&99.7&99.9&100.0&100.0\\
&FLY
&27.9&16.8&11.4&7.4&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
99.0&99.8&99.9&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&8.4&6.9&6.3&5.7&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
98.3&99.4&99.8&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&6.3&5.3&5.8&5.3&5.5&5.9&&
98.1&99.4&99.7&100.0&100.0&100.0\\
&AS
&5.0&5.3&6.4&5.9&5.2&5.5&&
15.3&51.3&88.1&98.5&100.0&100.0\\
\midrule
200&Thm.\ 1
&5.1&3.5&4.0&3.0&4.2&4.0&&
99.6&99.9&100.0&100.0&100.0&100.0\\
&FLLM
&6.1&4.6&3.2&5.4&4.6&4.4&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&3.9&4.6&3.8&3.8&&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&100.0&100.0&100.0&100.0\\
&FLY
&32.5&14.6&10.7&8.5&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
100.0&100.0&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&9.3&7.4&6.0&6.6&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
99.6&100.0&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&6.1&5.7&5.2&5.9&6.4&4.9&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&AS
&6.2&5.8&5.5&5.9&5.9&6.1&&
16.3&64.3&96.5&99.9&100.0&100.0\\
\midrule
500&Thm.\ 1
&3.0&5.4&3.1&3.1&4.2&3.9&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&FLLM
&7.1&5.1&4.9&4.3&3.6&2.6&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&4.5&5.1&&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&100.0&100.0\\
&FLY
&43.1&17.3&12.2&8.4&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
100.0&100.0&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&9.9&6.4&6.2&5.3&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
99.3&100.0&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&4.4&4.6&5.0&4.8&4.8&4.2&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&AS
&4.6&4.3&5.0&5.4&4.8&5.4&&
17.7&80.7&99.4&100.0&100.0&100.0\\
\midrule
&&\multicolumn{6}{c}{${\Greekmath 011E}_g=0.4$; ${\Greekmath 010B}_i=0$ for all $i$}&&
\multicolumn{6}{c}{${\Greekmath 011E}_g=0.4$; ${\Greekmath 010B}_i\sim N(0,1)$ for 5% of units} \\
\midrule
$N$&$\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{Test }\backslash T$
&{100}&{200}&{300}&{500}&{1000}&{2000}&&
{100}&{200}&{300}&{500}&{1000}&{2000}\\
\midrule
100&Thm.\ 1
&4.8&3.6&2.8&3.5&3.2&3.2&&
94.4&96.3&97.1&97.8&99.4&99.7\\
&FLLM
&5.5&6.8&5.6&4.6&6.1&7.0&&
98.4&99.9&100.0&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&5.1&4.9&4.0&4.3&3.6&&
\multicolumn{1}{c}{--}&98.4&99.7&99.9&100.0&100.0\\
&FLY
&31.3&19.0&13.3&8.5&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
99.0&99.9&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&12.0&11.0&8.9&8.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
98.4&99.5&99.7&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&8.8&8.9&8.2&7.4&7.8&9.3&&
98.3&99.4&99.7&100.0&100.0&100.0\\
&AS
&4.5&5.6&6.5&5.9&5.4&5.5&&
15.3&51.2&87.4&98.4&100.0&100.0\\
\midrule
200&Thm.\ 1
&3.8&4.0&3.5&4.0&4.2&4.0&&
99.7&99.9&100.0&100.0&100.0&100.0\\
&FLLM
&7.0&5.3&4.4&6.3&5.3&5.3&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&4.7&4.7&4.5&4.4&&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&100.0&100.0&100.0&100.0\\
&FLY
&34.6&17.0&12.3&10.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
100.0&100.0&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&12.0&9.7&8.8&9.6&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
99.6&100.0&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&8.2&8.0&7.9&9.1&8.2&7.0&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&AS
&6.4&5.8&5.5&5.8&5.9&6.0&&
17.0&64.8&96.3&99.9&100.0&100.0\\
\midrule
500&Thm.\ 1
&5.1&5.0&3.6&3.0&4.2&3.9&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&FLLM
&7.3&5.9&5.0&4.5&4.4&3.2&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&4.9&5.5&&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&100.0&100.0\\
&FLY
&46.9&19.2&14.1&9.6&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
100.0&100.0&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&12.2&8.8&7.9&7.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
99.3&100.0&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&6.5&5.9&6.1&6.5&7.4&6.7&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&AS
&4.9&4.2&4.9&5.2&4.9&5.5&&
17.8&80.9&99.4&100.0&100.0&100.0\\
\bottomrule
\end{tabular}
}
\end{center}
{ \justifying
\textbf{Note: }{The nominal size is 5% and powers are assessed at 5% level
of significance; frequencies are computed across $M=1000$ Monte Carlo
samples and we set ${\Greekmath 0117}=5$ when computing ${\Greekmath 0120}_{i,NT}$. Only $\lfloor
N^{0.4}\rfloor$ cross-sectional entities have a non-zero loading on the
omitted common factor.} }
\end{table}
\begin{table}[h!]
\captionsetup{font=small}
\caption{Empirical rejection frequencies for the test in Theorem (ref); Student's $t$ innovations with semi-strong omitted common factor.}
\begin{center}
{\scriptsize
\begin{tabular}{ll|
S S S S S S
c
S S S S S S}
\toprule
&&\multicolumn{6}{c}{${\Greekmath 011E}_g=0$; ${\Greekmath 010B}_i=0$ for all $i$}&&
\multicolumn{6}{c}{${\Greekmath 011E}_g=0$; ${\Greekmath 010B}_i\sim N(0,1)$ for 5% of units} \\
\midrule
$N$&$\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{Test }\backslash T$
&{100}&{200}&{300}&{500}&{1000}&{2000}&&
{100}&{200}&{300}&{500}&{1000}&{2000}\\
\midrule
100&Thm.\ 1
&3.8&2.9&3.7&3.3&3.2&3.2&&
94.0&95.7&96.8&98.3&99.0&99.5\\
&FLLM
&4.6&4.4&4.1&4.4&4.3&4.2&&
98.6&99.6&99.9&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&4.9&3.7&3.2&2.9&3.0&&
\multicolumn{1}{c}{--}&98.8&99.5&99.9&100.0&100.0\\
&FLY
&26.7&14.7&11.4&8.1&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
99.6&99.8&99.9&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&8.7&6.3&6.0&6.4&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
97.9&99.0&99.6&99.9&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&7.3&5.8&5.8&6.1&7.9&6.4&&
97.3&99.0&99.6&99.9&100.0&100.0\\
&AS
&5.2&6.4&6.6&4.9&5.2&5.5&&
13.9&55.1&87.9&98.4&100.0&100.0\\
\midrule
200&Thm.\ 1
&5.1&3.7&4.1&3.0&4.2&4.0&&
99.5&99.8&99.8&99.9&100.0&100.0\\
&FLLM
&5.3&4.8&4.2&4.6&5.1&4.8&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&6.4&3.9&2.9&4.3&&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&100.0&100.0&100.0&100.0\\
&FLY
&32.6&16.1&12.3&7.5&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
100.0&100.0&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&11.9&7.8&5.6&5.4&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
99.5&100.0&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&9.1&6.9&4.8&5.3&5.6&5.0&&
99.8&100.0&100.0&100.0&100.0&100.0\\
&AS
&4.2&4.6&4.5&5.8&5.9&6.1&&
15.4&65.3&96.5&99.9&100.0&100.0\\
\midrule
500&Thm.\ 1
&3.7&5.2&3.7&3.2&4.2&4.0&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&FLLM
&4.3&5.6&3.7&3.7&4.0&3.9&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&4.2&4.8&&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&100.0&100.0\\
&FLY
&41.3&17.0&14.0&9.9&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
100.0&100.0&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&13.6&8.6&6.7&7.1&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
99.1&100.0&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&9.4&6.5&5.8&6.7&6.2&6.7&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&AS
&4.6&5.5&5.0&6.5&4.8&5.4&&
16.8&79.4&99.2&100.0&100.0&100.0\\
\midrule
&&\multicolumn{6}{c}{${\Greekmath 011E}_g=0.4$; ${\Greekmath 010B}_i=0$ for all $i$}&&
\multicolumn{6}{c}{${\Greekmath 011E}_g=0.4$; ${\Greekmath 010B}_i\sim N(0,1)$ for 5% of units} \\
\midrule
$N$&$\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{Test }\backslash T$
&{100}&{200}&{300}&{500}&{1000}&{2000}&&
{100}&{200}&{300}&{500}&{1000}&{2000}\\
\midrule
100&Thm.\ 1
&5.0&3.8&3.2&3.4&3.3&3.3&&
93.1&95.8&97.0&98.2&98.9&99.4\\
&FLLM
&8.1&6.9&6.9&7.0&9.2&9.2&&
98.5&99.8&99.9&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&5.2&4.5&3.7&3.6&3.8&&
\multicolumn{1}{c}{--}&98.8&99.5&99.9&100.0&100.0\\
&FLY
&33.2&18.3&14.0&10.9&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
99.5&99.9&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&18.3&17.9&16.6&16.2&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
97.8&99.0&99.6&99.9&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&16.8&16.8&15.9&15.8&19.1&17.7&&
97.5&99.0&99.6&99.9&100.0&100.0\\
&AS
&5.1&6.6&6.9&4.6&5.4&5.5&&
13.3&52.1&87.0&98.2&100.0&100.0\\
\midrule
200&Thm.\ 1
&4.6&4.2&3.3&4.0&4.2&4.1&&
99.5&99.7&100.0&100.0&100.0&100.0\\
&FLLM
&8.3&8.6&8.6&7.0&8.8&7.2&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&6.7&4.4&3.0&4.3&&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&100.0&100.0&100.0&100.0\\
&FLY
&39.0&19.4&15.2&9.4&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
100.0&100.0&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&21.4&18.8&16.9&16.2&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
99.2&100.0&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&19.7&18.2&16.3&15.8&17.7&17.8&&
99.7&100.0&100.0&100.0&100.0&100.0\\
&AS
&4.1&6.0&5.6&6.0&5.9&6.0&&
14.2&63.1&95.8&99.8&100.0&100.0\\
\midrule
500&Thm.\ 1
&6.2&5.3&3.7&3.1&4.0&3.9&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&FLLM
&8.3&8.7&7.8&7.2&8.5&9.2&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&4.6&5.1&&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&100.0&100.0\\
&FLY
&48.0&21.3&16.3&11.6&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
100.0&100.0&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&26.3&21.3&19.0&20.5&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
98.8&100.0&100.0&100.0&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&22.0&19.2&17.8&20.2&19.3&18.7&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&AS
&6.4&5.5&5.5&6.9&4.9&5.5&&
16.8&76.0&99.1&100.0&100.0&100.0\\
\bottomrule
\end{tabular}
}
\end{center}
{ \justifying
\textbf{Note: }{The nominal size is 5% and powers are assessed at 5% level
of significance; frequencies are computed across $M=1000$ Monte Carlo
samples and we set ${\Greekmath 0117}=5$ when computing ${\Greekmath 0120}_{i,NT}$. Only $\lfloor
N^{0.8}\rfloor$ cross-sectional entities have a non-zero loading on the
omitted common factor.} }
\end{table}
\subsubsection{Strong and semi-strong pricing factors}
We now consider the same data generating process of Section (ref) but assuming that the omitted factor ${\Greekmath 0117}_t$
is strong. This time, however, we assume that ${\Greekmath 010C}_{i,2} = {\Greekmath 010C}_{i,3} = 0$
for $N - \lfloor N^{0.8} \rfloor$ randomly chosen assets. Empirical
rejection frequencies for this data generating process are reported in Table
(ref). Results on all tests are substantially
equivalent to those of Table (ref), thus validating results of
the main body also in the case where only one pricing factor is strong. This
holds true irrespectively of the value of ${\Greekmath 011E}_{g}$.
\begin{table}[h!]
\captionsetup{font=small}
\caption{Empirical rejection frequencies for the test in Theorem (ref); Student's $t$ innovations with one strong and two semi-strong
pricing factors.}
\begin{center}
{\scriptsize
\begin{tabular}{ll|
S S S S S S
c
S S S S S S}
\toprule
&&\multicolumn{6}{c}{${\Greekmath 011E}_g=0$; ${\Greekmath 010B}_i=0$}&&
\multicolumn{6}{c}{${\Greekmath 011E}_g=0$; ${\Greekmath 010B}_i\sim N(0,1)$ (5%)}\\
\midrule
$N$&Test$\backslash T$
&100&200&300&500&1000&2000&&
100&200&300&500&1000&2000\\
\midrule
100&Thm.\ 1
&3.6&2.9&3.8&3.4&3.3&3.2&&
89.3&93.2&95.1&96.9&98.5&99.2\\
&FLLM
&4.1&3.3&2.8&4.1&3.8&3.4&&
98.0&99.5&100.0&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&5.3&5.5&3.6&2.9&3.0&&
\multicolumn{1}{c}{--}&98.9&99.6&100.0&100.0&100.0\\
&FLY
&23.2&15.4&11.5&10.1&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
99.4&99.9&100.0&100.0&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&6.9&7.1&7.4&7.4&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
79.4&94.7&97.3&98.8&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&8.7&7.2&7.2&7.2&7.3&8.0&&
85.0&94.9&97.3&98.7&99.9&99.9\\
&AS
&6.8&5.7&6.6&6.5&5.2&5.6&&
14.8&55.2&87.2&98.2&99.9&100.0\\
\midrule
200&Thm.\ 1
&4.6&3.9&3.9&3.1&4.1&4.0&&
98.4&99.6&99.8&99.8&100.0&100.0\\
&FLLM
&4.7&4.2&3.2&3.5&3.3&3.3&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&6.2&4.0&2.9&4.3&&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&100.0&100.0&100.0&100.0\\
&FLY
&28.4&14.4&11.4&8.5&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
100.0&100.0&100.0&100.0&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&6.5&7.1&5.9&7.0&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
89.2&98.6&99.8&100.0&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&10.0&8.1&5.7&7.0&5.2&5.5&&
93.4&98.8&99.8&100.0&100.0&100.0\\
&AS
&6.9&7.3&6.4&7.4&4.9&4.7&&
18.6&64.4&96.6&99.9&100.0&100.0\\
\midrule
500&Thm.\ 1
&3.4&5.3&3.3&3.2&4.2&4.0&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&FLLM
&4.9&3.7&2.8&3.2&2.6&3.4&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&4.2&4.8&&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&100.0&100.0\\
&FLY
&38.5&19.3&13.8&8.6&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
100.0&100.0&100.0&100.0&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&9.7&6.0&6.1&6.7&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
97.2&99.9&100.0&100.0&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&12.7&7.0&6.2&6.5&6.9&7.5&&
99.2&100.0&100.0&100.0&100.0&100.0\\
&AS
&7.5&6.8&8.3&8.4&5.3&6.9&&
21.5&78.2&99.7&100.0&100.0&100.0\\
\midrule
&&\multicolumn{6}{c}{${\Greekmath 011E}_g=0.4$; ${\Greekmath 010B}_i=0$}&&
\multicolumn{6}{c}{${\Greekmath 011E}_g=0.4$; ${\Greekmath 010B}_i\sim N(0,1)$ (5%)}\\
\midrule
$N$&$\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{Test }\backslash T$
&{100}&{200}&{300}&{500}&{1000}&{2000}&&
{100}&{200}&{300}&{500}&{1000}&{2000}\\
\midrule
100&Thm.\ 1
&5.3&3.9&3.2&3.6&3.3&3.2&&
88.9&93.4&94.5&97.3&98.3&99.1\\
&FLLM
&11.6&9.0&10.1&9.5&11.5&11.1&&
97.8&99.4&100.0&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&5.6&6.1&4.5&3.6&3.8&&
\multicolumn{1}{c}{--}&100.0&100.0&100.0&100.0&100.0\\
&FLY
&33.2&18.3&14.0&10.9&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
99.4&100.0&100.0&100.0&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&20.5&17.4&19.0&19.8&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
80.4&93.8&97.7&98.9&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&23.3&17.4&18.6&19.5&21.4&20.9&&
84.5&93.4&97.4&98.7&99.9&100.0\\
&AS
&7.3&7.7&8.0&8.5&6.1&6.2&&
15.9&46.7&79.9&96.9&99.7&100.0\\
\midrule
200&Thm.\ 1
&5.0&4.5&3.9&4.3&4.2&4.0&&
98.4&99.4&99.8&100.0&99.9&100.0\\
&FLLM
&12.1&10.5&9.5&10.3&10.1&9.1&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&6.4&4.6&3.0&4.3&&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&100.0&100.0&100.0&100.0\\
&FLY
&39.0&19.4&15.2&9.4&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
100.0&100.0&100.0&100.0&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&19.3&20.2&17.9&20.2&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
87.7&98.4&99.6&100.0&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&24.0&20.1&17.8&20.0&18.5&18.7&&
90.9&98.4&99.6&100.0&100.0&100.0\\
&AS
&8.7&9.4&9.0&10.9&5.1&5.6&&
18.5&56.5&91.4&99.4&100.0&100.0\\
\midrule
500&Thm.\ 1
&6.0&5.4&4.0&3.4&4.2&4.1&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&FLLM
&13.7&10.2&10.5&9.4&9.1&10.5&&
100.0&100.0&100.0&100.0&100.0&100.0\\
&GRS
&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&4.6&5.1&&
\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&100.0&100.0\\
&FLY
&48.0&21.3&16.3&11.6&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
100.0&100.0&100.0&100.0&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&GOS
&21.6&17.6&18.2&18.4&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}&&
94.6&99.9&100.0&100.0&\multicolumn{1}{c}{--}&\multicolumn{1}{c}{--}\\
&PY
&24.6&18.1&18.1&18.2&20.8&19.7&&
97.7&99.9&100.0&100.0&100.0&100.0\\
&AS
&9.4&7.8&8.4&9.1&6.2&7.3&&
21.1&65.3&96.1&99.9&100.0&100.0\\
\bottomrule
\end{tabular}
}
\end{center}
{ \justifying
\textbf{Note: }{The nominal size is 5% and powers are assessed at 5% level
of significance; frequencies are computed across $M=1000$ Monte Carlo
samples and we set ${\Greekmath 0117}=5$ when computing ${\Greekmath 0120}_{i,NT}$. All the assets are
exposed to the first three pricing factor, while only $\lfloor
N^{0.8}\rfloor $ cross-sectional entities have a non-zero loading on the
remaining ones.} }
\end{table}
\doublespacing
\setcounter{section}{0}
\setcounter{equation}{0} \setcounter{lemma}{0} \setcounter{theorem}{0}
Further simulations
This section extends the Monte Carlo analysis of the main body by studying
the finite sample performances of the test based on Theorem (ref)
under different data generating processes. Specifically, Section (ref) displays empirical rejection frequencies for other
competing approaches that were not included in the main body; Sections (ref) and (ref) modify the persistence
and factor structure for the error terms of the pricing models $u_{i,t}$,
while Section (ref) discusses the implications of
changes in the strength of the pricing factors $
f_{t}=(f_{1,t},f_{2,t},f_{3,t})^{\prime }$. Section (ref) studies how the power of the tests varies as a function of the percentage of assets that are misspriced under the alternative. Sections (ref) and (ref) present finite results when pricing factors are non-tradable and latent, respectively. Section (ref) contains size and power results for the test in Theorem (ref) using alternative critical values.
Further competing tests
Tables (ref) to (ref) report
empirical rejection frequencies for the tests of fan2015power, gagliardini2016time under the DGPs
of the main body.\footnote{
The test of FLY is based on estimating the covariance matrix of $u_{t}$ with
the POET method of fan2013large. As in fan2015power, we
consider the soft thresholding function; results based on hard and
SCAD thresholding fan2001variable are numerically identical and
available upon request.} Here and in what follows, we do not report results for sample sizes $T=1000$ and $T=2000$ as the computational cost of both approaches was excessively demanding. Finally, for completeness, we also repeat the results of our
testing procedure based on Theorem (ref). As for the average-type
test of pesaran2023testing, these approaches substantially
over-reject the null under $\mathbb{H}_0$. Estimation of a large dimensional
covariance matrix in the presence of strongly cross-sectionally correlated
and mildly persistent residuals drives these over-rejections.
table[table omitted — 512 chars of source]
table[table omitted — 2,165 chars of source]
table[table omitted — 2,176 chars of source]
No persistence in the omitted factor
We complement the results of Section (ref) under ${\Greekmath 011E} _{g}=0$
in ((ref)) - that is, the omitted (strong) common factor has no
persistence.
Tables (ref), (ref) and (ref) contain the empirical rejection frequencies under the
null (left panels) and the alternative (right panels) for our one-shot test.
For average type tests (FLY, GOS and PY) results are in line with those of
the main body, though the degree of over-rejection under $\mathbb{H}_{0}$ is
smaller. The $p$-value combination of AS is still mildly oversized, while
the max-type approach of FLLM performs on par with ours.
Results for the \textquotedblleft strong\textquotedblright\ decision rule of
Theorem (ref) are in Tables (ref), (ref) and (ref). As desired, empirical
rejection frequencies quickly converge to zero under the null and for all
cases considered. As in the main body, convergence is faster when using $
f(B)=B^{-1/4}$. Similarly good results hold under the alternative, where the
rejection frequencies always converge to one.
table[table omitted — 3,254 chars of source]
table[table omitted — 1,622 chars of source]
table[table omitted — 3,226 chars of source]
table[table omitted — 1,617 chars of source]
table[table omitted — 3,227 chars of source]
table[table omitted — 1,619 chars of source]
Different strengths of the omitted factor
We consider the same three-factor pricing model of Section (ref)
. In the main body, ${\Greekmath 010D} _{i}\overset{i.i.d.}{\sim }\mathcal{U}(0.7,0.9)$
which implies that ${\Greekmath 010D} _{i}>0$ for any cross-sectional unit. We now
depart from that assumption in two ways: first, we consider the case where
only $\lfloor N^{0.4}\rfloor $ assets have a non-zero loading on $g_{t}$;
secondly, we look at a situation where $\lfloor N^{0.8}\rfloor $
cross-sectional units have a non-zero loading on $g_{t}$. These two
experiments correspond to the case of a weak and of a semi-strong omitted
pricing factors, respectively. Notably, the largest eigenvalue of the
covariance matrix of $\mathbf{u}_{t}$ is bounded in the weak factor case,
while it diverges to infinity in the semi-strong one. We consider the same
sample sizes and alternative hypothesis as in Section (ref).
Empirical rejection frequencies for the weak factor case are in Table (ref). Results for our test and for those of feng2022high and fan2015power are very similar to those in the main
body (Table (ref)) both under both the null and the alternative
hypothesis. Actual sizes of the GOS and PY tests are much closer to the
nominal one, suggesting that strong-cross sectional dependence in the
residuals was the driver of their overrejections. Their powers are
substantially unaltered. The test of ardia2024robust performs well in
terms of size, but still exhibits a lack of power when $T$ is small. All
previous considerations hold unchanged with respect to the value of ${\Greekmath 011E}_g$.
Table (ref) shows results for the semi-strong
case. We would like to point out the importance of this data generating
process, as bailey2021measurement described tens of semi-strong
pricing factor for the cross-section of US excess returns. Empirical
rejection frequencies are very close to those of the main body, as the FLY,
GOS, PY, and FLLM tests all become oversized when ${\Greekmath 011E}_g = 0.4$. This is
most likely an effect of strong cross-sectional dependence in the residuals,
as implied by a diverging eigenvalue in their covariance matrix. Results on
the test by of ardia2024robust are equivalent to those of Tables (ref) and (ref).
table[table omitted — 5,971 chars of source]
table[table omitted — 637 chars of source]
Different levels of sparsity under the alternative
In this section, we consider power under twelve different
alternatives, each based on a different percentage of mis-priced assets: $1\%,$ $2\%,$ $3\%,$ $\dots ,$ $9\%,$ $10\%,$ $15\%$ and $20\%$. For brevity, we only focus on sample sizes $T=100$ and $N=500$, which are the most relevant for the empirical analysis of Section (ref). Figure (ref) reports the empirical rejection frequencies for the twelve
levels of sparsity (the horizontal axis reports the percentage of mis-priced
assets) across all DGPs. The upper panels consider ${\Greekmath 011E}_g = 0$, while the case ${\Greekmath 011E}_g = 0.40$ is in the lower ones. Tests by FLY and FLLM always achieve unit power, while our approach performs almost equally well (and better than the other
tests), as its power converges to one almost immediately.
figure[figure omitted — 2,180 chars of source]
Strong and semi-strong pricing factors
We now consider the same data generating process of Section (ref) but assuming that the omitted factor $g_{t}$
is strong. This time, however, we assume that ${\Greekmath 010C} _{i,2}={\Greekmath 010C} _{i,3}=0$
for $N-\lfloor N^{0.8}\rfloor $ randomly chosen assets (cf.
bailey2021measurement, who found that only the market factor is
strong, while other $140$ factors are at most semi-strong). Empirical
rejection frequencies for this data generating process are reported in Table
(ref). Results on all tests are substantially
equivalent to those of Table (ref), thus validating results of
the main body also in the case where only one pricing factor is strong. This
holds true irrespectively of the value of ${\Greekmath 011E} _{g }$.
table[table omitted — 688 chars of source]
Non-tradable factors
We now study the finite sample properties of the testing procedure described
in Theorem (ref). To do it, we consider a three-factor pricing model
similar to that of Section (ref) but with no
factor structure in $u_{i,t}$, viz.
equation*[equation* omitted — 227 chars of source]
where we have constructed the DGP in terms of $v_{t}$ for coherence with
Section (ref) (see equation (ref), in
particular). Similarly to the main body, $\mathbf{u}_{t}=\left(
u_{1,t},\dots ,u_{N,t}\right) ^{\prime }$ follows one of the following three
specifications:
enumerate• The Gaussian case: $\mathbf{u}_{t}\overset{i.i.d.}{\sim }
\mathcal{N}_{N}(0,I_{N})$.
• The Student's $t$ case: $u_{i,t}$ follows a Students's $t$
distribution with $d=5.5$ degrees of freedom, zero mean and unit scale,
independent across $i$. In this case, $u_{i,t}$ and $y_{i,t}$ have regularly
varying tails;
• The GARCH case: we generate $\mathbf{u}_{t}=\mathbf{H}_{t}
\mathbf{z}_{t}$, with: $\mathbf{z}_{t}=\left( z_{1,t},...,z_{N,t}\right)
^{\prime }$ and $z_{i,t}\overset{i.i.d.}{\sim }\mathcal{N}(0,1)$; and $
\mathbf{H}_{t}=\mathrm{diag}\left\{ h_{1,t},\dots ,h_{N,t}\right\} $ with $
h_{i,t}^{2}={\Greekmath 0121} _{i}+{\Greekmath 010B} _{i}{\Greekmath 0118} _{i,t}^{2}+{\Greekmath 010C} _{i}h_{i,t-1}^{2}$.
Values of $\Phi$, ${\Greekmath 010C} = \left({\Greekmath 010C}_1,{\Greekmath 010C}_2,{\Greekmath 010C}_3\right)^{\prime}$,
and of GARCH parameters are set as in Section (ref), while $
{\Greekmath 0115}_p \overset{i.i.d.}{\sim}\mathcal{U}(0,1/2)$ for $p=1,2,3$.
Table (ref) reports empirical rejection frequencies under the
null (left panels) and under the alternative (right panel) for the test in
Theorem (ref). As in Section (ref), we set the nominal
size to ${\Greekmath 011C} = 5\%$ and study powers for the same significance level.
Because our test is the only one with a fully-fledged asymptotic theory for
non-tradabale factors, we do not report rejection frequencies for other
approaches. Our procedure satisfactorily controls the size for any sample
size and specification of the residuals $u_{i,t}$. Empirical powers are
consistently one. Table (ref) presents rejection frequencies
for a derandomized procedure similar to that of Theorem (ref)
but based on Theorem (ref) rather than (ref). No matter the
residuals' properties, empirical rejection frequencies always converge to
zero as the sample size increases. As for the analysis in Section (ref), this convergence is much faster using critical values based
on $f(B) = B^{-1/4}$.
table[table omitted — 1,851 chars of source]
table[table omitted — 2,917 chars of source]
Latent factors
We now investigate the finite sample properties of the test in Theorem (ref) when considering the DGP of Section (ref) with unobserved
factors. Again, size and power are studied for nominal level ${\Greekmath 011C} = 5\%$.
Results for empirical rejections frequencies under the null (left panels)
and under the alternative (right panels) are reported in Table (ref). Again, the testing procedure exhibits satisfactory size
control and excellent power properties. The test is a bit oversized in the
GARCH case, particularly when $T=100$. Given the results on the other
estimators (standard OLS and Fama-MacBeth), this over-rejection seem to be
due to problems in PCA-based estimation of factors and loadings under this
particular GARCH DGP. Similar conclusions hold when we look at results on
the derandomized procedure in Table (ref), where we see
that the approach works fine up to some over-rejection of the null in the
GARCH case.
table[table omitted — 1,859 chars of source]
table[table omitted — 3,019 chars of source]
Alternative critical values
The results in Section (ref) suggest that a test based on $c_{\Greekmath 011C}$ becomes slightly undersized as $T$ grows large (for any given $N$). In this section, we consider an alternative, fixed $N$ family of critical values
equation[equation omitted — 117 chars of source]
These critical values are theoretically supported by the fact that the Gumbel cumulative distribution function appears as the limit of the term $\Phi^{N}\left(a_{n}x +b_{n}\right)$ in the proof of Theorem (ref). Hence, these Gaussian quantiles area a natural finite sample counterpart to the Gumbel ones.
commentWe now consider what happens to the size and power of the test in Theorem (ref) when considering finite sample adjustments to the critical values of the asymptotic Gumbel distribution. In particular, we consider critical values $c_{{\Greekmath 011C}}^{(1)} = \Phi^{-1}\left(\left(1-{\Greekmath 010B}\right)^{1/N}\right)$ for $\Phi^{-1}(\cdot)$ the quantile function of a standard Gaussian random variable.
Results for the DGPs of the main body, even when ${\Greekmath 011E}_g = 0$, are in Table (ref). Empirical rejection frequencies are always larger than those based on asymptotic critical values. This is beneficial when $T$ gets larger, where asymptotic critical values returned empirical sizes lower than the nominal one (i.e.\ 5%). Notably, large $T$ results (say, $T$ at most 300), are now on par with, if not better than, those for the GRS approach. Hence, we suggest using our test with asymptotic critical values when $T$ is small. When $T$ is larger, the user should employ either our test with adjusted critical values or, if the sample size permits it, the GRS one.
table[table omitted — 3,886 chars of source]
\setcounter{equation}{0} \setcounter{lemma}{0} \setcounter{theorem}{0}
Extensions
As mentioned in the introduction to the main paper, our main contribution is
a methodology to test for no pricing errors, and we have primarily
focused on ((ref)) and assumed factors are observable and
tradable only for simplicity.
In this extension, we show that our methods can be readily extended to more
complex settings. In essence, we show that - as long as a consistent
estimator of the ${\Greekmath 010B} _{i}$s is available - our methodology can be
applied even to the case of latent or non-tradable, obtaining the same results as in the case of observable and tradable ones. As illustrative examples, we consider Fama-MacBeth estimation for the case of observable but non-tradable factors (Section (ref)), and principal component analysis (PCA) estimation for latent factors (Section (ref)); in both
cases, we directly use the estimation techniques proposed by
giglio2021thousands for the ${\Greekmath 010B} _{i}$s. We only report the main
results on the \textquotedblleft one shot\textquotedblright\ tests; the extension to derandomization can be done by
following verbatim Section (ref). We note, however, that
strong factors are required in these cases. \\
We also consider the extension of the derandomized decision rule in the case of multiple testing (Section (ref)), and of Assumption (ref) (Section (ref)).
Henceforth, we define $\mathbb{M}_{1_{N}}=\mathbb{I}_{N}-N^{-1}\mathbf{{\Greekmath 0113}
}_{N}\mathbf{{\Greekmath 0113} }_{N}^{\prime }$, where $\mathbf{{\Greekmath 0113} }_{N}$ is an $
N\times 1$ vector of ones.
Non-tradable factors and Fama-MacBeth estimation
Consider first the case of a linear factor pricing model based on $K$
observable, non-tradable factors
equation[equation omitted — 170 chars of source]
where $v_{t}=f_{t}-\mathbb{E}\left( f_{t}\right) $ and ${\Greekmath 0115} \in \mathbb{R
}^{K}$ is the vector of risk premia for the $K$ factors $f_{t}$.
Estimation of ${\Greekmath 010B} _{i}$ is based on Algorithm 3 in
giglio2021thousands.
description• Estimate ${\Greekmath 010C} _{i}$ by OLS in the time-series regressions $
y_{i,t}={\Greekmath 0119} _{i}+{\Greekmath 010C} _{i}'f_{t}+u_{i,t}$,
\begin{equation}
\widehat{{\Greekmath 010C} }_{i}=\left[ \sum_{t=1}^{T}\left( f_{t}-\overline{f}\right)
\left( f_{t}-\overline{f}\right) ^{\prime }\right] ^{-1}\left[
\sum_{t=1}^{T}\left( f_{t}-\overline{f}\right) \left( y_{i,t}-\overline{y}
_{i}\right) \right] ,
\end{equation}
with $\overline{y}_{i}=T^{-1}\sum_{t=1}^{T}y_{i,t}$, and define $\widehat{
\mathbf{{\Greekmath 010C} }}=\left( \widehat{{\Greekmath 010C} }_{1},...,\widehat{{\Greekmath 010C} }_{N}\right)
^{\prime }$.
• Define $\widehat{{\Greekmath 0115} }$ as the OLS estimates of a
regression of $\overline{\mathbf{y}}=\left( \overline{y}_{1},...,\overline{y}
_{N}\right) ^{\prime }$ onto a vector of ones and $\widehat{\mathbf{{\Greekmath 010C} }}$
\begin{equation}
\widehat{{\Greekmath 0115} }=\left( \widehat{\mathbf{{\Greekmath 010C} }}^{\prime }\mathbb{M}
_{1_{N}}\widehat{\mathbf{{\Greekmath 010C} }}\right) ^{-1}\left( \widehat{\mathbf{{\Greekmath 010C} }
}^{\prime }\mathbb{M}_{1_{N}}\bar{\mathbf{y}}\right) .
\end{equation}
• The estimator of ${\Greekmath 010B} _{i}$ is given by
\begin{equation}
\widehat{{\Greekmath 010B} }_{i}^{FM}=\overline{y}_{i}-\widehat{{\Greekmath 010C} }_{i}^{\prime }
\widehat{{\Greekmath 0115} }.
\end{equation}
Based on $\widehat{{\Greekmath 010B} }_{i}^{FM}$ defined in ((ref)), we can
construct the same test statistic as before, based on
equation*[equation* omitted — 187 chars of source]
where the rescaling sequence $\widehat{s}_{NT}^{FM}$ is constructed as in (
(ref)), using the residuals $\widehat{u}_{i,t}^{FM}=y_{i,t}-\left(
\widehat{{\Greekmath 010B} }_{i}^{FM}+\widehat{{\Greekmath 010C} }_{i}^{\prime }f_{t}\right) $.
Defining $z_{i,NT}^{FM}={\Greekmath 0120} _{i,NT}^{FM}+{\Greekmath 0121} _{i}$,\footnote{
As before, ${\Greekmath 0121} _{i}\overset{i.i.d.}{\sim }\mathcal{N}\left( 0,1\right) $
generated independently of the sample $\left\{ \left( u_{i,t},f_{t}^{\prime
}\right) ^{\prime },1\leq i\leq N,1\leq t\leq T\right\} $.} our test can be
based on
equation[equation omitted — 77 chars of source]
In order to derive our asymptotic theory, we consider the following
assumptions. Let
equation[equation omitted — 234 chars of source]
where we define
equation[equation omitted — 112 chars of source]
assumptionIt holds that: (i) ${\Greekmath 0115} $ and ${\Greekmath 010C} _{i}$ are
fixed with $\left\Vert {\Greekmath 0115} \right\Vert <\infty $ and $\max_{1\leq i\leq
N}\left\Vert {\Greekmath 010C} _{i}\right\Vert <\infty $; and (ii) $\mathbf{S}
_{{\Greekmath 010C} }$ is positive definite for all values of $N$.
assumptionIt holds that: (i) $\left\{ u_{i,t},1\leq t\leq
T\right\} $ and $\left\{ f_{t},1\leq t\leq T\right\} $ are two mutually
independent groups; and (ii) $\sum_{i=1}^{N}\sum_{j=1}^{N}
\sum_{s=1}^{T}\sum_{t=1}^{T}\left\vert \mathbb{E}\left(
u_{i,t}u_{j,s}\right) \right\vert \leq c_{0}NT$.
It holds that
theoremWe assume that the assumptions of Theorem (ref) are
satisfied, and that Assumptions (ref) and (ref) also hold. Then, the same
result as in Theorem (ref) holds.
Latent factors
Consider now a linear factor pricing model based on $K$ latent factors
equation[equation omitted — 162 chars of source]
where $v_{t}=f_{t}-\mathbb{E}\left( f_{t}\right) $ is not observable
, ${\Greekmath 010C} _{i}$ is a $K\times 1$ vector of loadings and, as above, ${\Greekmath 0115} $
is the vector of risk premia for the $K$ latent factors $f_{t}$.
Write $\widetilde{\mathbf{y}}_{t}=\mathbf{{\Greekmath 010C} }\widetilde{v}_{t}+
\widetilde{\mathbf{u}}_{t}$, where $\widetilde{\mathbf{y}}_{t}=\mathbf{y}
_{t}-\overline{\mathbf{y}}$ with $\mathbf{y}_{t}=\left(
y_{1,t},...,y_{N,t}\right) ^{\prime }$, $\widetilde{v}_{t}=v_{t}-\left(
T^{-1}\sum_{t=1}^{T}v_{t}\right) $, $\widetilde{\mathbf{u}}_{t}$ is defined
analogously, and $\mathbf{{\Greekmath 010C} }=\left( {\Greekmath 010C} _{1},...,{\Greekmath 010C} _{N}\right)
^{\prime }$. Define also the $N\times N$ sample second moment matrix
equation[equation omitted — 152 chars of source]
The estimation of ${\Greekmath 010B} _{i}$ follows Algorithm 4 in
giglio2021thousands.
description• Estimate $\mathbf{{\Greekmath 010C} }$ using PCA, with estimator $\widehat{
\mathbf{{\Greekmath 010C} }}^{PC}$ given by the eigenvectors corresponding to the first $
K$ eigenvalues of $\widehat{\mathbf{\Sigma }}_{y}$ under the constraint $
\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}\right) ^{\prime }\widehat{\mathbf{
{\Greekmath 010C} }}^{PC}=N\mathbb{I}_{K}$.\footnote{
Our discussion implicitly assumes that $K$ is known. Of course, this is not
the case in practice, where $K$ has to be determined by the user. This is
ordinarily done using consistent estimators such as those of baing02,
ahnhorenstein13, and trapani2018randomized. Note that the
result in Theorem (ref) holds unchanged when $K$ is estimated using
these consistent estimators.}
• These steps are the same as in the previous section,
with $\widehat{{\Greekmath 0115} }^{PC}=\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }
\mathbb{M}_{1_{N}}\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\right) ^{-1}\left( \widehat{
\mathbf{{\Greekmath 010C} }}^{PC\prime }\mathbb{M}_{1_{N}}\bar{\mathbf{y}}\right) $, and
\begin{equation}
\widehat{{\Greekmath 010B} }_{i}^{PC}=\overline{y}_{i}-\left( \widehat{{\Greekmath 010C} }
_{i}^{PC}\right) ^{\prime }\widehat{{\Greekmath 0115} }^{PC}.
\end{equation}
Let $C_{N,T}=\min \left\{ N,T\right\} $. Based on $\widehat{{\Greekmath 010B} }_{i}^{PC}
$ defined in ((ref)), we define
equation*[equation* omitted — 193 chars of source]
where $\widehat{s}_{NT}^{PC}$ is constructed as in ((ref)), using $
\widehat{u}_{i,t}^{PC}=y_{i,t}-\left( \widehat{{\Greekmath 010B} }_{i}^{PC}+\widehat{
{\Greekmath 010C} }_{i}^{PC\prime }\widehat{f}_{t}^{PC}\right) $ and $\widehat{f}
_{t}^{PC}=N^{-1}\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\widetilde{\mathbf{y}}
_{t}$. Letting $z_{i,NT}^{PC}={\Greekmath 0120} _{i,NT}^{PC}+{\Greekmath 0121} _{i},$ with ${\Greekmath 0121}
_{i}$ defined as above, the test is based on
equation[equation omitted — 77 chars of source]
We consider the following assumptions - which complement and extend the
assumptions in the main paper - for the case of latent factors.
assumptionIt holds that: (i) ${\Greekmath 0115}$ and $\mathbf{{\Greekmath 010C} }$
are nonrandom with $\left\Vert{\Greekmath 0115}\right\Vert <\infty$ and $\left\Vert
\mathbf{{\Greekmath 010C} }\right\Vert <\infty $; (ii) $\mathbf{{\Greekmath 010C} }^{\prime
}\mathbf{{\Greekmath 010C} }=N\mathbb{I}_{K}$; and (iii) $\mathbf{S}_{{\Greekmath 010C} }$
is positive definite for all values of $N$.
assumptionIt holds that $\mathbb{E}\left( \widetilde{v}_{t}\widetilde{v
}_{t}^{\prime }\right) $ is a positive definite matrix.
assumptionLet ${\Greekmath 010D} _{s,t}=\sum_{i=1}^{N}\mathbb{E}\left(
u_{i,t}u_{i,s}\right) /N$. It holds that: (i) $\sum_{s=1}^{T}\left
\vert {\Greekmath 010D} _{s,t}\right\vert <c_{0}$ for $1\leq t\leq T$; (ii) $
\mathbb{E}\left\vert \sum_{i=1}^{N}\left( u_{i,s}u_{i,t}-{\Greekmath 010D}
_{s,t}\right) \right\vert ^{2}<c_{0}N$ for $1\leq s,t\leq T$; (iii)
$\mathbb{E}\left\Vert \sum_{i=1}^{N}{\Greekmath 010C} _{i}u_{i,t}\right\Vert
^{4}<c_{0}N^{2}$ for $1\leq t\leq T$; (iv) $\sum_{i=1}^{N}\left
\vert \mathbb{E}\left( u_{i,t}u_{j,s}\right) \right\vert \leq c_{0}$ for all
$1\leq t,s\leq T$ and $1\leq j\leq N$; (v) $\sum_{i=1}^{N}
\sum_{s=1}^{T}\left\vert \mathbb{E}\left( u_{i,t}u_{j,s}\right) \right\vert
\leq c_{0}$ for all $1\leq t\leq T$ and $1\leq j\leq N$; (vi)
\begin{equation*}
\mathbb{E}\left\Vert \sum_{t=1}^{T}w^{\prime }\left( \mathbf{u}_{t}u_{i,t}-
\mathbb{E}\left( \mathbf{u}_{0}u_{i,0}\right) \right) \right\Vert ^{{\Greekmath 0117}
/2}\leq c_{0}\left( NT\right) ^{{\Greekmath 0117} /4},
\end{equation*}
for any $w$ such that $\left\Vert w\right\Vert =O\left( N^{1/2}\right) $.
assumptionIt holds that $\left\{ v_{t},1\leq t\leq T\right\} $ and $
\left\{ u_{i,t},1\leq t\leq T\right\} $ are two mutually independent groups,
for $1\leq i\leq N$.
It holds that
theoremWe assume that the assumptions of Theorem (ref) are
satisfied, and that Assumptions (ref)-(ref) also hold. Then, the same result as in
Theorem (ref) holds.
We conjecture that Theorem (ref) holds with minor modifications to
Assumptions (ref)-(ref) when one estimates factors and
loadings with the Risk-Premium PCA (RP-PCA) approach of lettau2020estimating, lettau2020factors. In fact, just like our Theorem
(ref), their theory for the strong factors case relies on
conditions that are extremely similar to those of bai03. Similar
considerations also hold for the Projected PCA approach of fan2016projected, which is increasingly being used in asset pricing
studies (see kim2021arbitrage and hong2025dynamic, among
others).
On multiple testing and the derandomized confidence function
We consider the use of the derandomized rule discussed in Section (ref) in
the main paper in the presence of multiple testing. Whilst this extension is
specifically designed to address the presence of multiple tests carried out
across multiple windows as in Section (ref), it can be extended beyond this
specific case.
Consider the case where the test is repeated across $1\leq v\leq W$ windows,
whose data may overlap fully, partly, or not at all, for the null hypotheses
that
\[
\mathbb{H}_{0}^{\left( v\right) }:\max_{1\leq i\leq N}\left\vert {\Greekmath 010B}
_{i}^{\left( v\right) }\right\vert =0,
\]
where ${\Greekmath 010B} _{i}^{\left( v\right) }$ is the intercept estimated for unit $i
$ with the dataset pertaining to window $v$. A natural question is how
frequently - in the case whereby $\mathbb{H}_{0}^{\left( v\right) }$ is
satisfied across all $1\leq v\leq W$ - can one null $\mathbb{H}_{0}^{\left(
v\right) }$ be rejected. This question corresponds to the idea of
family-wise size control.
Suppose that, at each window $v$, the test is carried out using the
randomized confidence function defined in equation ((ref)), which we denote with
the short-hand notation $Q_{v}\left( {\Greekmath 011C} \right) $. At each $v$, the
randomness added to the statistic ${\Greekmath 0120} _{i,NT}^{\left( v\right) }$, say $
{\Greekmath 0121} _{i}^{\left( b\right) ,\left( v\right) }$, is independent across $
1\leq b\leq B$ and across $v$. Then, conditional on the whole sample, $
Q_{v}\left( {\Greekmath 011C} \right) $ is independent across $v$. Our question can now
be formalised by calculating
\[
\mathbb{P}^{\ast }\left[ \relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{reject any null hypothesis}|\left\{ \mathbb{H}
_{0}^{\left( v\right) }\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{ is true, }1\leq v\leq W\right\} \right] .
\]
The following theorem stipulates that, in essence, family-wise rejection
probability is controlled, as long as there are not too many windows.
theoremWe assume that Assumptions (ref)-(ref) are satisfied. Then, if
\begin{equation}
\log W-{\Greekmath 011C} ^{-1}B\left\vert f\left( B\right) \right\vert ^{2}-{\Greekmath 011C}
^{-3/2}B\left\vert f\left( B\right) \right\vert ^{3}\rightarrow -\infty ,
\end{equation}
it holds that, as $\min \left\{ N,T,B\right\} \rightarrow \infty $ with $
B=O\left( \left( \log N\right) ^{2}\right) $
\[
\mathbb{P}^{\ast }\left[ \relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{reject any null hypothesis}|\left\{ \mathbb{H}
_{0}^{\left( v\right) }\relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{ is true, }1\leq v\leq W\right\} \right] =0,
\]
a.s. conditionally on the sample.
The theorem states that family-wise size control is guaranteed, with the
probability of rejecting any null tending to zero. This requires the
condition in ((ref)), which is stated generally, and in which,
for example, one could choose a sample size-adjusted nominal level ${\Greekmath 011C} $,
akin to a Bonferroni condition. On the other hand, keeping ${\Greekmath 011C} $ fixed, as
we do in Section (ref), and using, as suggested in Section (ref), $f\left(
B\right) =B^{-1/4}$, ((ref)) would be satisfied as long as
\[
\log W-B^{1/2}\rightarrow -\infty ;
\]
seeing as we recommend using $B=\left\lfloor \left( \log N\right)
^{2}\right\rfloor $, the above would be equivalent to
\[
W=o\left( N\right) .
\]
Extension of the asymptotic regime in Assumption (ref)
Here and henceforth, the Euclidean norm of a vector is denoted as $
\left\Vert \mathbf{\cdot }\right\Vert $. Given an $m\times n$ matrix $
\mathbf{A}$ with element $a_{ij}$\ we use the following notation for its
norms: $\left\Vert \mathbf{A}\right\Vert $ is the Euclidean/spectral norm,
defined as $\left\Vert \mathbf{A}\right\Vert \leq \sqrt{{\Greekmath 0115} _{\max
}\left( \mathbf{A}^{\prime }\mathbf{A}\right) }$; $\left\Vert \mathbf{A}
\right\Vert_{F}$ is the Frobenious norm; $\left\Vert \mathbf{A}
\right\Vert_{1}$ is the $\mathcal{L}_{1}$-norm defined as $\left\Vert
\mathbf{A}\right\Vert _{1}=\max_{1\leq j\leq n}\sum_{i=1}^{m}\left\vert
a_{ij}\right\vert $; the $\mathcal{L}_{\infty }$-norm$\ \left\Vert \mathbf{A}
\right\Vert _{\infty \relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{ }}$is defined as $\left\Vert \mathbf{A}
\right\Vert _{\infty \relax\protect\ifmmode\expandafter\text@\else\expandafter\mbox\fi{ }}=\max_{1\leq i\leq m}\sum_{j=1}^{n}\left\vert
a_{ij}\right\vert $.
We discuss how to extend the asymptotic regime required in Assumption (ref). In particular, we show how we can further relax the
assumption to $N=O\left( T^{{\Greekmath 0117} /4-{\Greekmath 0122} }\right) $, which allows for
larger values of $N$ compared to Assumption (ref), and to the
corresponding Assumption A1(iii) in feng2022high. In such a case, we
would need to redefine ${\Greekmath 0120} _{i,NT}$ as
equation[equation omitted — 190 chars of source]
where ${\Greekmath 010E} $ is a user-chosen quantity such that
equation[equation omitted — 118 chars of source]
Equation ((ref)) does not suggest a decision rule per se, but
only an upper bound for ${\Greekmath 010E} $, which is a tuning parameter. The
rationale underpinning ((ref)) is based on the fact that - upon
inspecting the proofs of Theorem (ref) and Lemma (ref) - we
require that, under the null, $\sum_{i=1}^{N}{\Greekmath 0120} _{i,NT}=o_{a.s.}\left(
1\right) $. In turn, this follows as long as $N\left\vert T^{{\Greekmath 010E} }
\widehat{{\Greekmath 010B} }_{i,T}\right\vert ^{{\Greekmath 0117} /2}$ drifts to zero; intuitively,
under the null $\widehat{{\Greekmath 010B} }_{i,T}$ drifts to zero at a rate $
O_{a.s.}\left( T^{-1/2}\right) $, and therefore $N\left\vert T^{{\Greekmath 010E} }
\widehat{{\Greekmath 010B} }_{i,T}\right\vert ^{{\Greekmath 0117} /2}=O_{a.s.}\left( NT^{\left(
{\Greekmath 010E} -1/2\right) {\Greekmath 0117} /2}\right) =o_{a.s.}\left( 1\right) $ by the
definition of ${\Greekmath 010E} $\ in ((ref)).
The same arguments hold in the case of nontradable and latent factors, upon
replacing $T^{1/{\Greekmath 0117} }$ with $T^{{\Greekmath 010E} }$ in the definition of ${\Greekmath 0120}
_{i,NT}^{FM}$, and $C_{NT}^{1/{\Greekmath 0117} }$ with $C_{NT}^{{\Greekmath 010E} }$\ in the
definition of ${\Greekmath 0120} _{i,NT}^{PC}$, respectively.
comment\footnote{
See also Remark (ref) in the Supplement.} Whenever $
N=O\left( T^{{\Greekmath 0117} /4-{\Greekmath 0122} }\right) $, it holds that $\frac{1}{2}-\frac{
2}{{\Greekmath 0117} }\frac{\log N}{\log T}>0$, and therefore the set containing ${\Greekmath 010E} $
is not empty. Contrary to the above, however, the test is no longer
tuning-free, and the choice of ${\Greekmath 010E} $ is naturally bound to impact on
power and size.
\setcounter{equation}{0} \setcounter{lemma}{0} \setcounter{theorem}{0}
Technical lemmas
Henceforth, we denote the distribution function of the standard normal
calculated at $-\infty <x<\infty $ as $\Phi \left( x\right) $.
Preliminary lemmas
We begin with a Baum-Katz-type theorem which is also reported in
massacci2022.
lemmaConsider a multi-index partial sum process $U_{S_{1},..,S_{h}}=
\sum_{i_{2}=1}^{S_{2}}\cdot \cdot \cdot \sum_{i_{h}=1}^{S_{h}}{\Greekmath 0118}
_{i_{1},...,i_{h}}$, and assume that, for some $q\geq 1$
\begin{equation*}
\mathbb{E}\sum_{i_{1}=1}^{S_{1}}\left\vert U_{S_{1},..,S_{h}}\right\vert
^{q}\leq c_{0}S_{1}\prod\limits_{j=2}^{h}S_{j}^{d_{j}},
\end{equation*}
where $d_{j}\geq 1$ for all $1\leq j\leq h$. Then it holds that
\begin{equation*}
\limsup_{\min \left\{ S_{1},...,S_{h}\right\} \rightarrow \infty }\frac{
\sum_{i_{1}=1}^{S_{1}}\left\vert U_{S_{1},..,S_{h}}\right\vert ^{q}}{
S_{1}\prod\limits_{j=2}^{h}S_{j}^{d_{j}}\left( \prod\limits_{j=1}^{h}\log
S_{j}\right) ^{2+{\Greekmath 010F} }}=0\relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{ a.s.,}
\end{equation*}
for all ${\Greekmath 010F} >0$.
\begin{proof}
We begin by noting that the function
\begin{equation*}
g\left( x_{1},....,x_{h}\right) =x_{1}\prod\limits_{j=2}^{h}x_{j}^{d_{j}},
\end{equation*}
is superadditive. Consider the vector $\left( y_{1},....,y_{h}\right) $ such
that $y_{i}\geq x_{i}$ for all $1\leq i\leq h$. Then, for any two $s$ and $t$
such that $x_{1}+s\leq y_{1}+t$
\begin{eqnarray*}
\frac{1}{s}\left[ g\left( x_{1}+s,....,x_{h}\right) -g\left(
x_{1},....,x_{h}\right) \right] &=&\prod\limits_{j=2}^{h}x_{j}^{d_{j}}, \\
\frac{1}{t}\left[ g\left( y_{1}+t,....,y_{h}\right) -g\left(
y_{1},....,y_{h}\right) \right] &=&\prod\limits_{j=2}^{h}x_{j}^{d_{j}},
\end{eqnarray*}
whence it trivially follows that
\begin{equation*}
\frac{1}{s}\left[ g\left( x_{1}+s,....,x_{h}\right) -g\left(
x_{1},....,x_{h}\right) \right] =\frac{1}{t}\left[ g\left(
y_{1}+t,....,y_{h}\right) -g\left( y_{1},....,y_{h}\right) \right] .
\end{equation*}
he2023one also showed that, for any two nonzero $s$ and $t$ such
that $x_{i}+s\leq y_{i}+t$, $2\leq i\leq h$
\begin{equation*}
\frac{1}{s}\left[ g\left( x_{1}+s,....,x_{h}\right) -g\left(
x_{1},....,x_{h}\right) \right] \leq \frac{1}{t}\left[ g\left(
y_{1}+t,....,y_{h}\right) -g\left( y_{1},....,y_{h}\right) \right] .
\end{equation*}
Thus, $g\left( x_{1},....,x_{h}\right) $ is an S-convex function (see
Definition 2.1 and Proposition 2.3 in potra), and therefore it is
superadditive (by Proposition 2.9 in potra). Hence we can apply
the maximal inequality in Corollary 4 in moricz1983 with - (in his
notation) $f\left( R\right) =S_{1}\prod\limits_{j=2}^{h}S_{j}^{d_{j}}$ and $
{\Greekmath 011E} \left( \cdot \right) =c_{0}$. Letting
\begin{equation*}
V_{i_{1},...,i_{h}}=\sum_{j_{1}=1}^{i_{1}}\left\vert
\sum_{j_{2}=1}^{i_{2}}\cdot \cdot \cdot \sum_{j_{h}=1}^{i_{h}}{\Greekmath 0118}
_{j_{1},...,j_{h}}\right\vert ^{q},
\end{equation*}
it follows that
\begin{equation*}
\mathbb{E}\max_{1\leq i_{1}\leq S_{1},....,1\leq i_{h}\leq
S_{h}}V_{i_{1},...,i_{h}}\leq
c_{0}S_{1}\prod\limits_{j=2}^{h}S_{j}^{d_{j}}\left(
\prod\limits_{j=1}^{h}\log S_{j}\right) .
\end{equation*}
Hence we have
\begin{eqnarray*}
&&\sum_{S_{1}=1}^{\infty }\cdot \cdot \cdot \sum_{S_{h}=1}^{\infty }\frac{1}{
\prod\limits_{j=1}^{h}S_{j}}\mathbb{P}\left( \max_{1\leq i_{1}\leq
S_{1},....,1\leq i_{h}\leq S_{h}}V_{i_{1},...,i_{h}}\geq {\Greekmath 0122}
S_{1}\prod\limits_{j=2}^{h}S_{j}^{d_{j}}\left( \prod\limits_{j=1}^{h}\log
S_{j}\right) ^{2+{\Greekmath 010F} }\right) \\
&\leq &{\Greekmath 0122} ^{-1}\sum_{S_{1}=1}^{\infty }\cdot \cdot \cdot
\sum_{S_{h}=1}^{\infty }\frac{1}{S_{1}^{2}\prod
\limits_{j=2}^{h}S_{j}^{d_{j}+1}\left( \prod\limits_{j=1}^{h}\log
S_{j}\right) ^{2+{\Greekmath 010F} }}\mathbb{E}\max_{1\leq i_{1}\leq S_{1},....,1\leq
i_{h}\leq S_{h}}V_{i_{1},...,i_{h}} \\
&\leq &c_{0}{\Greekmath 0122} ^{-1}\sum_{S_{1}=1}^{\infty }\cdot \cdot \cdot
\sum_{S_{h}=1}^{\infty }\frac{1}{\prod\limits_{j=1}^{h}S_{j}\left(
\prod\limits_{j=1}^{h}\log S_{j}\right) ^{1+{\Greekmath 010F} }}\leq c_{1}{\Greekmath 0122}
^{-1}.
\end{eqnarray*}
The desired result now follows by repeating the proof of Lemma A.1 in
BT2.
\end{proof}
The following estimate on the growth rate of moments of partial sums will be
used throughout the paper, and it can be contrasted with Proposition 4.1 in
berkeshormann.
lemmaLet $w_{t}$ be a centered, $\mathcal{L}_{q}$-decomposable
Bernoulli shift with $q\geq 2$. Then, if $a>1$, it holds that
\begin{equation}
E\left( \sum_{t=1}^{m}w_{t}\right) ^{2}\leq c_{0}m,
\end{equation}
Further, for all $2<p\leq q$, if $a>\left( q-1\right) /\left( q-2\right) $,
it holds that
\begin{equation}
E\left( \sum_{t=1}^{m}w_{t}\right) ^{p}\leq c_{0}m^{p/2}.
\end{equation}
\begin{proof}
We begin by showing ((ref))
\begin{equation}
E\left( \sum_{t=1}^{m}w_{t}\right) ^{2}\leq c_{0}m.
\end{equation}
By stationarity, we can write
\begin{eqnarray*}
E\left( \sum_{t=1}^{m}w_{t}\right) ^{2} &=&E\left(
\sum_{t=1}^{m}\sum_{s=1}^{m}w_{t}w_{s}\right) =mE\left( w_{0}^{2}\right)
+2\sum_{t=1}^{m}\left( m-t\right) E\left( w_{t}w_{0}\right) \\
&\leq &mE\left( w_{0}^{2}\right) +2\sum_{t=1}^{m}\left\vert E\left(
w_{t}w_{0}\right) \right\vert .
\end{eqnarray*}
Consider now the coupling $\widetilde{w}_{t,t}$, and note that
\begin{equation*}
E\left( w_{t}w_{0}\right) =E\left( \left( w_{t}-\widetilde{w}_{t,t}\right)
w_{0}\right) +E\left( \widetilde{w}_{t,t}w_{0}\right) =E\left( \left( w_{t}-
\widetilde{w}_{t,t}\right) w_{0}\right) ,
\end{equation*}
on account of the independence between $\widetilde{w}_{t,t}$ and $w_{0}$.
Further
\begin{equation*}
\left\vert E\left( \left( w_{t}-\widetilde{w}_{t,t}\right) w_{0}\right)
\right\vert \leq \left\vert w_{0}\right\vert _{2}\left\vert w_{t}-\widetilde{
w}_{t,t}\right\vert _{2}\leq c_{0}t^{-a},
\end{equation*}
and therefore
\begin{equation*}
\sum_{t=1}^{m}\left\vert E\left( w_{t}w_{0}\right) \right\vert =O\left(
m\right) .
\end{equation*}
The desired result now follows by putting everything together. We now show
that
\begin{equation*}
E\left( \sum_{t=1}^{m}w_{t}\right) ^{q}\leq c_{0}m^{q/2}.
\end{equation*}
Define $\widetilde{w}_{t,\ell }$ with $\ell =\left\lfloor m^{{\Greekmath 0126}
}\right\rfloor $, where
\begin{equation}
\frac{1}{2a}<{\Greekmath 0126} <\frac{q-2}{2\left( q-1\right) }.
\end{equation}
It holds that
\begin{eqnarray*}
E\left( \sum_{t=1}^{m}w_{t}\right) ^{q} &\leq &2^{q-1}\left( E\left(
\sum_{t=1}^{m}\widetilde{w}_{t,\ell }\right) ^{q}+E\left(
\sum_{t=1}^{m}\left( w_{t}-\widetilde{w}_{t,\ell }\right) \right)
^{q}\right) \\
&\leq &2^{q-1}\left( E\left( \sum_{t=1}^{m}\widetilde{w}_{t,\ell }\right)
^{q}+E\left( \sum_{t=1}^{m}\left\vert w_{t}-\widetilde{w}_{t,\ell
}\right\vert \right) ^{q}\right) .
\end{eqnarray*}
We have
\begin{equation*}
E\left( \sum_{t=1}^{m}\left\vert w_{t}-\widetilde{w}_{t,{\Greekmath 0126}
}\right\vert \right) ^{q}\leq m^{q-1}\sum_{t=1}^{m}E\left\vert w_{t}-
\widetilde{w}_{t,{\Greekmath 0126} }\right\vert ^{q}\leq c_{0}m^{q-1}m\ell
^{-qa}\leq c_{1}m^{q/2},
\end{equation*}
on account of ((ref)). We now estimate $E\left( \sum_{t=1}^{m}
\widetilde{w}_{t,\ell }\right) ^{q}$; consider the $\left\lfloor m/\ell
\right\rfloor +1$ blocks
\begin{equation*}
\mathcal{B}_{i}=\sum_{t=\ell \left( i-1\right) +1}^{\ell i}\widetilde{w}
_{t,\ell }\relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{, }1\leq i\leq \left\lfloor m/\ell \right\rfloor \relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{ \ \
and \ \ }\mathcal{B}_{\left\lfloor m/\ell \right\rfloor
+1}=\sum_{t=\left\lfloor m/\ell \right\rfloor +1}^{m}\widetilde{w}_{t,\ell }.
\end{equation*}
Note that, by construction, the sequence of blocks $\mathcal{B}_{i}$ with $i$
even is an independent sequence, and so is the sequence of the $\mathcal{B}
_{i}$s with odd $i$. Hence we can write
\begin{equation*}
\sum_{t=1}^{m}\widetilde{w}_{t,\ell }=\sum_{i=1}^{\left\lfloor m/\ell
\right\rfloor /2}\mathcal{B}_{2i}+\sum_{i=1}^{\left\lfloor m/\ell
\right\rfloor /2}\mathcal{B}_{2\left( i-1\right) +1}+\mathcal{B}
_{\left\lfloor m/\ell \right\rfloor +1}.
\end{equation*}
Thus
\begin{eqnarray*}
E\left( \sum_{t=1}^{m}w_{t}\right) ^{q} &\leq &3^{q-1}\left( E\left(
\sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}\mathcal{B}_{2i}\right)
^{q}+E\left( \sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}\mathcal{B}
_{2\left( i-1\right) +1}\right) ^{q}+E\left( \mathcal{B}_{\left\lfloor
m/\ell \right\rfloor +1}\right) ^{q}\right) \\
&\leq &3^{p-1}\left( E\left\vert \sum_{i=1}^{\left\lfloor m/\ell
\right\rfloor /2}\mathcal{B}_{2i}\right\vert ^{q}+E\left\vert
\sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}\mathcal{B}_{2\left(
i-1\right) +1}\right\vert ^{q}+E\left\vert \mathcal{B}_{\left\lfloor m/\ell
\right\rfloor +1}\right\vert ^{q}\right)
\end{eqnarray*}
On account of the independence of the $\mathcal{B}_{2i}$s across $i$, we can
use Rosenthal's inequality (see e.g. Theorem 2.9 in petrov1995),
whence
\begin{equation}
E\left\vert \sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}\mathcal{B}
_{2i}\right\vert ^{q}\leq c\left( q\right) \left( E\sum_{i=1}^{\left\lfloor
m/\ell \right\rfloor /2}\left\vert \mathcal{B}_{2i}\right\vert
^{q}+\left\vert \sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}E\left(
\mathcal{B}_{2i}^{2}\right) \right\vert ^{q/2}\right) ,
\end{equation}
where $c\left( q\right) $ is a positive, finite constant that depends only
on $p$. We already know from ((ref)) that
\begin{equation*}
E\left( \mathcal{B}_{2i}^{2}\right) \leq c_{0}\ell ,
\end{equation*}
and therefore
\begin{equation*}
\left\vert \sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}E\left( \mathcal{
B}_{2i}^{2}\right) \right\vert ^{q/2}\leq c_{0}m^{q/2},
\end{equation*}
for some $c_{0}$. Further
\begin{eqnarray*}
&&E\sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}\left\vert \mathcal{B}
_{2i}\right\vert ^{q} \\
&=&E\sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}\left\vert \sum_{t=\ell
\left( 2i-1\right) +1}^{2\ell i}\widetilde{w}_{t,\ell }\right\vert ^{q}\leq
c_{0}\left\lfloor \frac{m}{\ell }\right\rfloor \ell ^{q-1}\sum_{t=\ell
\left( 2i-1\right) +1}^{2\ell i}E\left\vert \widetilde{w}_{t,\ell
}\right\vert ^{q} \\
&\leq &c_{1}\frac{m}{\ell }\ell ^{q}\leq c_{2}m^{{\Greekmath 0126} \left( q-1\right)
+1}\leq c_{3}m^{q/2},
\end{eqnarray*}
by the definition of ${\Greekmath 0126} $\ in ((ref)). Putting all
together, ((ref)) now yields
\begin{equation*}
E\left\vert \sum_{i=1}^{\left\lfloor m/\ell \right\rfloor /2}\mathcal{B}
_{2i}\right\vert ^{q}\leq c_{0}m^{q/2},
\end{equation*}
and the same holds for the odd blocks $\mathcal{B}_{2\left( i-1\right) +1}$,
and, similarly, for $E\left\vert \mathcal{B}_{\left\lfloor m/\ell
\right\rfloor +1}\right\vert ^{q}$. Equation ((ref)) now follows from
Lyapunov's inequality.
\end{proof}
Lemmas for Section (ref)
lemmaWe assume that Assumption (ref) is satisfied.
Then it holds that
\begin{equation*}
\overline{f}=\frac{1}{T}\sum_{t=1}^{T}f_{t}=\mathbb{E}f_{t}+o_{a.s.}\left(
1\right) .
\end{equation*}
\begin{proof}
We report the proof for the case $K=1$, for simplicity and without loss of
generality. The proof follows from standard arguments; indeed
\begin{equation*}
\frac{1}{T}\sum_{t=1}^{T}f_{t}=\mathbb{E}f_{t}+\frac{1}{T}
\sum_{t=1}^{T}\left( f_{t}-\mathbb{E}f_{t}\right) .
\end{equation*}
Recall that, by Assumption (ref), $f_{t}-\mathbb{E}f_{t}$ is a
centered, $\mathcal{L}_{{\Greekmath 0117} }$-decomposable Bernoulli shift; thus, by Lemma
(ref)
\begin{equation*}
\mathbb{E}\left\vert \sum_{t=1}^{T}\left( f_{t}-\mathbb{E}f_{t}\right)
\right\vert ^{p}\leq c_{0}T^{p/2},
\end{equation*}
for all $2\leq p\leq {\Greekmath 0117} $, whence Lemma (ref) readily entails that
\begin{equation*}
\frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-\mathbb{E}f_{t}\right) =o_{a.s.}\left(
1\right) .
\end{equation*}
\end{proof}
lemmaWe assume that Assumption (ref) is satisfied.
Then it holds that
\begin{equation*}
\sum_{i=1}^{N}\left\vert \sum_{t=1}^{T}u_{i,t}\right\vert ^{{\Greekmath 010D}
}=o_{a.s.}\left( NT^{{\Greekmath 010D} /2}\left( \log N\log T\right) ^{2+{\Greekmath 010F}
}\right) ,
\end{equation*}
for all ${\Greekmath 010F} >0$ and all $2\leq {\Greekmath 010D} \leq {\Greekmath 0117} $.
\begin{proof}
We estimate convergence rate of
\begin{equation*}
\sum_{i=1}^{N}\mathbb{E}\left\vert \sum_{t=1}^{T}u_{i,t}\right\vert ^{{\Greekmath 010D}
}.
\end{equation*}
By Assumption (ref), we can use Lemma (ref), which entails
that, for all $1\leq i\leq N$
\begin{equation*}
\mathbb{E}\left\vert \sum_{t=1}^{T}u_{i,t}\right\vert ^{{\Greekmath 010D} }\leq c_{{\Greekmath 0117}
}T^{{\Greekmath 010D} /2},
\end{equation*}
where $c_{{\Greekmath 0117} }$ is a positive, finite constant which depends only on ${\Greekmath 0117} $
, whence
\begin{equation*}
\sum_{i=1}^{N}\mathbb{E}\left\vert \sum_{t=1}^{T}u_{i,t}\right\vert ^{{\Greekmath 010D}
}\leq c_{0}NT^{{\Greekmath 010D} /2}.
\end{equation*}
The desired result now readily obtains from Lemma (ref).
\end{proof}
lemmaWe assume that Assumption (ref) is
satisfied. Then it holds that
\begin{equation*}
\frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-\overline{f}\right) \left( f_{t}-
\overline{f}\right) ^{\prime }=\mathcal{V}\left( f\right) +o_{a.s.}\left(
1\right) .
\end{equation*}
\begin{proof}
As above, we report the proof for the case $K=1$, for simplicity and without
loss of generality. It holds that
\begin{equation*}
\frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-\overline{f}\right) ^{2}=\frac{1}{T}
\sum_{t=1}^{T}f_{t}^{2}-\overline{f}^{2}.
\end{equation*}
Consider $f_{t}^{2}$; Assumption (ref)(i) immediately
entails that $\left\{ f_{t}^{2},-\infty <t<\infty \right\} $ is an $\mathcal{
L}_{{\Greekmath 0117} /2}$-decomposable Bernoulli shift with rate $a>\left( {\Greekmath 0117} -1\right)
/\left( {\Greekmath 0117} -2\right) $. Indeed, letting
\begin{equation*}
f_{t}=g^{\left( f\right) }\left( {\Greekmath 0111} _{t}^{\left( f\right) },{\Greekmath 0111}
_{t-1}^{\left( f\right) },...\right) ,
\end{equation*}
where $g^{\left( f\right) }:S^{\infty }\rightarrow
\mathbb{R}
^{K}$ is a non random measurable function and $\left\{ {\Greekmath 0111} _{t}^{\left(
f\right) },-\infty <t<\infty \right\} $ is an i.i.d. sequence with
values in a measurable space $S$, and consider the coupling construction
\begin{equation*}
f_{t}^{\prime }=g^{\left( f\right) }\left( {\Greekmath 0111} _{t}^{\left( f\right)
},...,{\Greekmath 0111} _{t-\ell +1}^{\left( f\right) },{\Greekmath 0111} _{t-\ell ,t,\ell }^{\ast
\left( f\right) },{\Greekmath 0111} _{t-\ell -1,t,\ell }^{\ast \left( f\right)
}...\right) ,
\end{equation*}
with $\left\{ {\Greekmath 0111} _{s,t,\ell }^{\ast \left( f\right) },-\infty <s,\ell
,t<\infty \right\} $ i.i.d. copies of ${\Greekmath 0111} _{0}^{\left( f\right) }$
independent of $\left\{ {\Greekmath 0111} _{t}^{\left( f\right) },-\infty <t<\infty
\right\} $. Then we have
\begin{eqnarray*}
&&\left\vert f_{t}^{2}-\left( f_{t}^{\prime }\right) ^{2}\right\vert _{{\Greekmath 0117}
/2} \\
&=&\left\vert \left( f_{t}+f_{t}^{\prime }\right) \left( f_{t}-f_{t}^{\prime
}\right) \right\vert _{{\Greekmath 0117} /2}\leq \left\vert f_{t}+f_{t}^{\prime
}\right\vert _{{\Greekmath 0117} }\left\vert f_{t}-f_{t}^{\prime }\right\vert _{{\Greekmath 0117} } \\
&\leq &2\left\vert f_{t}\right\vert _{{\Greekmath 0117} }\left\vert f_{t}-f_{t}^{\prime
}\right\vert _{{\Greekmath 0117} }\leq c_{0}\ell ^{-a},
\end{eqnarray*}
having used the Cauchy-Schwartz inequality, Minkowski's inequality, and the
facts that - by Assumption (ref) - $\left\vert f_{t}\right\vert
_{{\Greekmath 0117} }=\left\vert f_{t}^{\prime }\right\vert _{{\Greekmath 0117} }<\infty $ and $
\left\vert f_{t}-f_{t}^{\prime }\right\vert _{{\Greekmath 0117} }\leq c_{0}\ell ^{-a}$,
with $a>\left( {\Greekmath 0117} -1\right) /\left( {\Greekmath 0117} -2\right) $. Hence
\begin{equation*}
T^{-{\Greekmath 0117} /2}\mathbb{E}\left\vert \sum_{t=1}^{T}\left( f_{t}^{2}-\mathbb{E}
f_{t}^{2}\right) \right\vert ^{{\Greekmath 0117} /2}\leq c_{{\Greekmath 0117} /2}T^{-{\Greekmath 0117} /4},
\end{equation*}
by Lemma (ref), from which it follows from standard arguments
that
\begin{equation*}
\frac{1}{T}\sum_{t=1}^{T}f_{t}^{2}=\mathbb{E}f_{t}^{2}+o_{a.s.}\left(
1\right) .
\end{equation*}
By the same token, it is not hard to see that
\begin{equation*}
\overline{f}=\mathbb{E}\left( f_{t}\right) +o_{a.s.}\left( 1\right) .
\end{equation*}
Thus we have
\begin{equation*}
\frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-\overline{f}\right) ^{2}=\mathbb{E}
f_{t}^{2}-\left( \mathbb{E}f_{t}\right) ^{2}+o_{a.s.}\left( 1\right) ,
\end{equation*}
and the desired result obtains from Assumption (ref)(ii).
\end{proof}
lemmaWe assume that Assumptions (ref)-(ref)
are satisfied. Then it holds that
\begin{equation*}
\sum_{i=1}^{N}\left\Vert \sum_{t=1}^{T}f_{t}u_{i,t}\right\Vert ^{{\Greekmath 010D}
}=o_{a.s.}\left( NT^{{\Greekmath 010D} /2}\left( \log N\log T\right) ^{2+{\Greekmath 010F}
}\right) ,
\end{equation*}
for every ${\Greekmath 010F} >0$ and $2\leq {\Greekmath 010D} \leq {\Greekmath 0117} /2$.
\begin{proof}
Let $K=1$ with no loss of generality. We begin by showing that $\left\{
f_{t}u_{i,t},-\infty <t<\infty \right\} $ is an $\mathcal{L}_{{\Greekmath 0117} /2}$
-decomposable Bernoulli shift with rate $a>\left( {\Greekmath 0117} -1\right) /\left( {\Greekmath 0117}
-2\right) $. Recall that, by Assumption (ref), $E\left(
f_{t}u_{i,t}\right) =0$, and
\begin{eqnarray*}
f_{t} &=&g^{\left( f\right) }\left( {\Greekmath 0111} _{t}^{\left( f\right) },{\Greekmath 0111}
_{t-1}^{\left( f\right) },...\right) , \\
u_{i,t} &=&g^{\left( u_{i}\right) }\left( {\Greekmath 0111} _{t}^{\left( i\right) },{\Greekmath 0111}
_{t-1}^{\left( i\right) },...\right) ,
\end{eqnarray*}
where $g^{\left( f\right) }:S^{\infty }\rightarrow
\mathbb{R}
^{K}$ and $g^{\left( u_{i}\right) }:S^{\infty }\rightarrow
\mathbb{R}
$, $1\leq i\leq N$, are non random measurable function and $\left\{ {\Greekmath 0111}
_{t}^{\left( f\right) },-\infty <t<\infty \right\} $ and $\left\{ {\Greekmath 0111}
_{t}^{\left( i\right) },-\infty <t<\infty \right\} $\ are i.i.d.
sequences with values in a measurable space $S$, and consider the coupling
constructions
\begin{eqnarray*}
f_{t}^{\prime } &=&g^{\left( f\right) }\left( {\Greekmath 0111} _{t}^{\left( f\right)
},...,{\Greekmath 0111} _{t-\ell +1}^{\left( f\right) },{\Greekmath 0111} _{t-\ell ,t,\ell }^{\ast
\left( f\right) },{\Greekmath 0111} _{t-\ell -1,t,\ell }^{\ast \left( f\right)
}...\right) , \\
u_{i,t}^{\prime } &=&g^{\left( u_{i}\right) }\left( {\Greekmath 0111} _{t}^{\left(
i\right) },...,{\Greekmath 0111} _{t-\ell +1}^{\left( i\right) },{\Greekmath 0111} _{t-\ell ,t,\ell
}^{\ast \left( i\right) },{\Greekmath 0111} _{t-\ell -1,t,\ell }^{\ast \left( i\right)
}...\right) ,
\end{eqnarray*}
where $\left\{ {\Greekmath 0111} _{s,t,\ell }^{\ast \left( f\right) },-\infty <s,\ell
,t<\infty \right\} $ and $\left\{ {\Greekmath 0111} _{s,t,\ell }^{\ast \left( i\right)
},-\infty <s,\ell ,t<\infty \right\} $\ are i.i.d. copies of ${\Greekmath 0111}
_{0}^{\left( f\right) }$ and ${\Greekmath 0111} _{0}^{\left( i\right) }$\ respectively,
independent of $\left\{ {\Greekmath 0111} _{t}^{\left( f\right) },-\infty <t<\infty
\right\} $ and $\left\{ {\Greekmath 0111} _{t}^{\left( i\right) },-\infty <t<\infty
\right\} $. Then we have, by elementary arguments
\begin{eqnarray*}
&&\left\vert f_{t}u_{i,t}-f_{t}^{\prime }u_{i,t}^{\prime }\right\vert
_{{\Greekmath 010D} } \\
&\leq &\left\vert \left( f_{t}-f_{t}^{\prime }\right) u_{i,t}^{\prime
}\right\vert _{{\Greekmath 010D} }+\left\vert f_{t}^{\prime }\left(
u_{i,t}-u_{i,t}^{\prime }\right) \right\vert _{{\Greekmath 010D} }+\left\vert \left(
f_{t}-f_{t}^{\prime }\right) \left( u_{i,t}-u_{i,t}^{\prime }\right)
\right\vert _{{\Greekmath 010D} } \\
&\leq &\left\vert u_{i,t}\right\vert _{2{\Greekmath 010D} }\left\vert
f_{t}-f_{t}^{\prime }\right\vert _{2{\Greekmath 010D} }+\left\vert f_{t}\right\vert
_{2{\Greekmath 010D} }\left\vert u_{i,t}-u_{i,t}^{\prime }\right\vert _{2{\Greekmath 010D}
}+\left\vert f_{t}-f_{t}^{\prime }\right\vert _{2{\Greekmath 010D} }\left\vert
u_{i,t}-u_{i,t}^{\prime }\right\vert _{2{\Greekmath 010D} } \\
&\leq &\left\vert u_{i,t}\right\vert _{{\Greekmath 0117} }\left\vert f_{t}-f_{t}^{\prime
}\right\vert _{{\Greekmath 0117} }+\left\vert f_{t}\right\vert _{{\Greekmath 0117} }\left\vert
u_{i,t}-u_{i,t}^{\prime }\right\vert _{{\Greekmath 0117} }+\left\vert f_{t}-f_{t}^{\prime
}\right\vert _{{\Greekmath 0117} }\left\vert u_{i,t}-u_{i,t}^{\prime }\right\vert _{{\Greekmath 0117} }
\\
&\leq &c_{0}\ell ^{-a}+c_{1}\ell ^{-a}+c_{2}\ell ^{-2a}\leq c_{3}\ell ^{-a}.
\end{eqnarray*}
Then it holds that
\begin{equation*}
\sum_{i=1}^{N}\mathbb{E}\left\vert \sum_{t=1}^{T}f_{t}u_{i,t}\right\vert
^{{\Greekmath 010D} }\leq c_{0}NT^{{\Greekmath 010D} /2},
\end{equation*}
having used Lemma (ref). The desired result now follows from
Lemma (ref).
\end{proof}
lemmaWe assume that Assumptions (ref)-(ref)
are satisfied. Then it holds that
\begin{eqnarray*}
\liminf_{\min \left\{ N,T\right\} \rightarrow \infty }\frac{1}{NT}
\sum_{i=1}^{N}\sum_{t=1}^{T}\widehat{u}_{i,t}^{2} &>&0, \\
\limsup_{\min \left\{ N,T\right\} \rightarrow \infty }\frac{1}{NT}
\sum_{i=1}^{N}\sum_{t=1}^{T}\widehat{u}_{i,t}^{2} &<&\infty .
\end{eqnarray*}
\begin{proof}
The proof uses several arguments used also elsewhere, so we omit passages
when possible to avoid repetitions. It holds that
\begin{eqnarray*}
&&\frac{1}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}\widehat{u}_{i,t}^{2} \\
&=&\frac{1}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}u_{i,t}^{2}+\frac{1}{NT}
\sum_{i=1}^{N}\sum_{t=1}^{T}\left( \widehat{{\Greekmath 010B} }_{i}-{\Greekmath 010B} _{i}\right)
^{2}+\frac{1}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}\left( \widehat{{\Greekmath 010C} }
_{i}-{\Greekmath 010C} _{i}\right) ^{2}f_{t}^{2} \\
&&+\frac{2}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}\left( \widehat{{\Greekmath 010B} }
_{i}-{\Greekmath 010B} _{i}\right) u_{i,t}+\frac{2}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}
\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right) f_{t}u_{i,t} \\
&&+\frac{2}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}\left( \widehat{{\Greekmath 010B} }
_{i}-{\Greekmath 010B} _{i}\right) \left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right) f_{t}
\\
&=&I+II+III+IV+V+VI.
\end{eqnarray*}
It holds that
\begin{equation*}
I=\frac{1}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}\mathbb{E}u_{i,t}^{2}+\frac{1}{NT}
\sum_{i=1}^{N}\sum_{t=1}^{T}\left( u_{i,t}^{2}-\mathbb{E}u_{i,t}^{2}\right)
=I_{a}+I_{b}.
\end{equation*}
By Assumption (ref), it follows immediately that $0<I_{a}<\infty $;
also, it is easy to see that $u_{i,t}^{2}-\mathbb{E}u_{i,t}^{2}$ is a
centered, $\mathcal{L}_{{\Greekmath 0117} /2}$-decomposable Bernoulli shift (see the
arguments in the proof of Lemma (ref)), and therefore, by
Lemma (ref)
\begin{eqnarray*}
&&\mathbb{E}\left\vert \frac{1}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}\left(
u_{i,t}^{2}-\mathbb{E}u_{i,t}^{2}\right) \right\vert ^{2} \\
&\leq &\frac{1}{NT^{2}}\sum_{i=1}^{N}\mathbb{E}\left\vert
\sum_{t=1}^{T}\left( u_{i,t}^{2}-\mathbb{E}u_{i,t}^{2}\right) \right\vert
^{2}\leq c_{0}T^{-1},
\end{eqnarray*}
whence Lemma (ref) yields $I_{b}=o_{a.s.}\left( 1\right) $. Note also
that
\begin{equation*}
\frac{1}{N}\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right)
^{2}\left( \frac{1}{T}\sum_{t=1}^{T}f_{t}^{2}\right) ,
\end{equation*}
with $T^{-1}\sum_{t=1}^{T}f_{t}^{2}=O_{a.s.}\left( 1\right) $ by Lemma (ref) and
\begin{equation*}
\frac{1}{N}\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right) ^{2}=
\frac{\frac{1}{N}\sum_{i=1}^{N}\left( \frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-
\overline{f}\right) u_{i,t}\right) ^{2}}{\left( \frac{1}{T}
\sum_{t=1}^{T}\left( f_{t}-\overline{f}\right) ^{2}\right) ^{2}}.
\end{equation*}
We know from Lemma (ref) that
\begin{equation*}
\frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-\overline{f}\right)
^{2}=c_{0}+o_{a.s.}\left( 1\right) ,
\end{equation*}
with $c_{0}>0$. Further, using Lemma (ref), it follows that
\begin{equation*}
\frac{1}{N}\sum_{i=1}^{N}\left\Vert \frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-
\overline{f}\right) u_{i,t}\right\Vert ^{2}=o_{a.s.}\left( 1\right) ,
\end{equation*}
whence $III=o_{a.s.}\left( 1\right) $. The same arguments as in the proof of
Lemma (ref) entail that $II=o_{a.s.}\left( 1\right) $. Finally, a
routine application of H\"{o}lder's inequality yields that $
IV-VI=o_{a.s.}\left( 1\right) $.
\end{proof}
lemmaWe assume that Assumptions (ref)-(ref) are
satisfied. Then, under the null in (ref) it holds that
\begin{equation*}
\sum_{i=1}^{N}{\Greekmath 0120}_{i,NT}=o_{a.s.}\left( 1\right) .
\end{equation*}
\begin{proof}
Let - for simplicity and with no loss of generality - $K=1$. Recall ((ref)), whence also
\begin{equation*}
\widehat{{\Greekmath 010B} }_{i}={\Greekmath 010B} _{i}-\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C}
_{i}\right) \overline{f}+\overline{u}_{i}=-\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C}
_{i}\right) \overline{f}+\overline{u}_{i},
\end{equation*}
under $\mathbb{H}_{0}$. Hence we have
\begin{eqnarray*}
\sum_{i=1}^{N}{\Greekmath 0120} _{i,NT} &=&\frac{T^{1/2}}{\left\vert \hat{s}
_{NT}\right\vert ^{{\Greekmath 0117} /2}}\sum_{i=1}^{N}\left\vert \widehat{{\Greekmath 010B} }
_{i}\right\vert ^{{\Greekmath 0117} /2} \\
&\leq &\frac{T^{1/2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}
\sum_{i=1}^{N}\left\vert \overline{u}_{i}\right\vert ^{{\Greekmath 0117} /2}+\frac{T^{1/2}
}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}\sum_{i=1}^{N}\left\vert
\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right) \overline{f}\right\vert ^{{\Greekmath 0117}
/2} \\
&=&\frac{T^{1/2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}
\sum_{i=1}^{N}\left\vert \overline{u}_{i}\right\vert ^{{\Greekmath 0117} /2}+\frac{T^{1/2}
}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}\sum_{i=1}^{N}\left\vert
\frac{\sum_{t=1}^{T}\left( f_{t}\overline{f}-\overline{f}^{2}\right) u_{i,t}
}{\sum_{t=1}^{T}\left( f_{t}-\overline{f}\right) ^{2}}\right\vert ^{{\Greekmath 0117} /2},
\end{eqnarray*}
We know from Lemma (ref) that there exists a positive, finite
constant $c_{0}$ and a couple of random variables $\left( N_{0},T_{0}\right)
$ such that, for all $N\geq N_{0}$ and $T\geq T_{0}$
\begin{equation*}
\frac{T^{1/2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}
\sum_{i=1}^{N}\left\vert \overline{u}_{i}\right\vert ^{{\Greekmath 0117} /2}\leq
c_{0}T^{1/2}\sum_{i=1}^{N}\left\vert \overline{u}_{i}\right\vert ^{{\Greekmath 0117} /2};
\end{equation*}
using Lemma (ref), it follows that
\begin{equation*}
\frac{T^{1/2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}
\sum_{i=1}^{N}\left\vert \overline{u}_{i}\right\vert ^{{\Greekmath 0117}
/2}=o_{a.s.}\left( NT^{1/2}T^{-{\Greekmath 0117} /4}\left( \log N\log T\right)
^{2+{\Greekmath 010F} }\right) .
\end{equation*}
Also
\begin{eqnarray*}
&&\frac{T^{1/2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}
\sum_{i=1}^{N}\left\vert \frac{\sum_{t=1}^{T}\left( f_{t}\overline{f}-
\overline{f}^{2}\right) u_{i,t}}{\sum_{t=1}^{T}\left( f_{t}-\overline{f}
\right) ^{2}}\right\vert ^{{\Greekmath 0117} /2} \\
&\leq &\frac{T^{1/2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}\frac{
\sum_{i=1}^{N}\left\vert \overline{f}\frac{1}{T}\sum_{t=1}^{T}f_{t}u_{i,t}
\right\vert ^{{\Greekmath 0117} /2}}{\left\vert \frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-
\overline{f}\right) ^{2}\right\vert ^{{\Greekmath 0117} /2}}+\frac{T^{1/2}}{\left\vert
\hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}\frac{\sum_{i=1}^{N}\left\vert \overline{f}
^{2}\frac{1}{T}\sum_{t=1}^{T}u_{i,t}\right\vert ^{{\Greekmath 0117} /2}}{\left\vert \frac{1
}{T}\sum_{t=1}^{T}\left( f_{t}-\overline{f}\right) ^{2}\right\vert ^{{\Greekmath 0117} /2}}
.
\end{eqnarray*}
Lemmas (ref), (ref) and (ref) entail
that there exists a positive, finite constant $c_{0}$ and a random variable $
T_{0}$ such that, for all $T\geq T_{0}$
\begin{eqnarray*}
\frac{T^{1/2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}\frac{
\sum_{i=1}^{N}\left\vert \overline{f}\frac{1}{T}\sum_{t=1}^{T}f_{t}u_{i,t}
\right\vert ^{{\Greekmath 0117} /2}}{\left\vert \frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-
\overline{f}\right) ^{2}\right\vert ^{{\Greekmath 0117} /2}} &\leq
&c_{0}T^{1/2}\sum_{i=1}^{N}\left\vert \frac{1}{T}\sum_{t=1}^{T}f_{t}u_{i,t}
\right\vert ^{{\Greekmath 0117} /2}, \\
\frac{T^{1/2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}\frac{
\sum_{i=1}^{N}\left\vert \overline{f}^{2}\frac{1}{T}\sum_{t=1}^{T}u_{i,t}
\right\vert ^{{\Greekmath 0117} /2}}{\left\vert \frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-
\overline{f}\right) ^{2}\right\vert ^{{\Greekmath 0117} /2}} &\leq
&c_{0}T^{1/2}\sum_{i=1}^{N}\left\vert \frac{1}{T}\sum_{t=1}^{T}u_{i,t}\right
\vert ^{{\Greekmath 0117} /2}.
\end{eqnarray*}
We already know from the above that the second term is $o_{a.s.}\left(
1\right) $. Using Lemma (ref), it finally follows that
\begin{equation*}
\frac{T^{1/2}}{\left\vert \hat{s}_{NT}\right\vert ^{{\Greekmath 0117} /2}}\frac{
\sum_{i=1}^{N}\left\vert \overline{f}\frac{1}{T}\sum_{t=1}^{T}f_{t}u_{i,t}
\right\vert ^{{\Greekmath 0117} /2}}{\left\vert \frac{1}{T}\sum_{t=1}^{T}\left( f_{t}-
\overline{f}\right) ^{2}\right\vert ^{{\Greekmath 0117} /2}}=o_{a.s.}\left(
NT^{1/2}T^{-{\Greekmath 0117} /4}\left( \log N\log T\right) ^{2+{\Greekmath 010F} }\right) .
\end{equation*}
By combining the results above, we receive
\begin{equation}
\sum_{i=1}^{N}{\Greekmath 0120} _{i,NT}=o_{a.s.}\left( NT^{1/2}T^{-{\Greekmath 0117} /4}\left( \log
N\log T\right) ^{2+{\Greekmath 010F} }\right) .
\end{equation}
The desired result now obtains by Assumption (ref).
\end{proof}
comment\begin{remark}
Lemma (ref) holds also for the general
statistic in equation (ref) as long as we replace Assumption (ref) with the condition $N=O\left( T^{{\Greekmath 0117} /4-{\Greekmath 010F} }\right) $,
where ${\Greekmath 010F} $ is positive and such that ${\Greekmath 010F} >\frac{{\Greekmath 010E} {\Greekmath 0117} }{2}$
.
\end{remark}
Lemmas for Section (ref)
We now report a series of lemmas for the case, discussed in Section (ref), of nontradable factors. In order for the notation not to be
overly burdensome, we will assume - unless otherwise stated - $K=1$ whenever
possible and with no loss of generality.
Recall the short-hand notation $\mathbf{S}_{{\Greekmath 010C} }$ defined in ((ref)
), let $\mathbf{{\Greekmath 010B} }=\left( {\Greekmath 010B} _{1},...,{\Greekmath 010B} _{N}\right) ^{\prime
} $ and
equation[equation omitted — 324 chars of source]
and
equation[equation omitted — 146 chars of source]
and note that, after standard passages
eqnarray[eqnarray omitted — 1,441 chars of source]
Finally, under both $\mathbb{H}_{0}$ and $\mathbb{H}_{A}$ we have
equation[equation omitted — 496 chars of source]
lemmaWe assume that Assumptions (ref)-(ref)
and (ref) and (ref) are satisfied. Then it holds that
\begin{eqnarray}
N^{-1}\left\Vert \widehat{\mathbf{{\Greekmath 010C} }}-\mathbf{{\Greekmath 010C} }\right\Vert ^{2}
&=&o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{2+{\Greekmath 010F} }}{T}\right)
, \\
\left\Vert \widehat{\mathbf{S}}_{{\Greekmath 010C} }-\mathbf{S}_{{\Greekmath 010C} }\right\Vert
&=&o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{2+{\Greekmath 010F} }}{T}\right)
+o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{1+{\Greekmath 010F} }}{\sqrt{NT}}
\right) ,
\end{eqnarray}
for all ${\Greekmath 010F} >0$.
\begin{proof}
Recall that we use $K=1$, and note that
\begin{equation*}
\widehat{\mathbf{{\Greekmath 010C} }}-\mathbf{{\Greekmath 010C} =S}_{f}^{-1}\left( \frac{1}{T}
\sum_{t=1}^{T}\mathbf{u}_{t}\left( v_{t}-\overline{v}\right) \right) ,
\end{equation*}
having defined $\mathbf{u}_{t}=\left( u_{1,t},...,u_{N,t}\right) ^{\prime }$
and $\overline{v}=T^{-1}\sum_{t=1}^{T}v_{t}$, whence also
\begin{equation*}
\widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\mathbf{=S}_{f}^{-1}\left( \frac{1}{T}
\sum_{t=1}^{T}\left( v_{t}-\overline{v}\right) u_{i,t}\right) .
\end{equation*}
Note that
\begin{eqnarray*}
&&N^{-1}\left\Vert \widehat{\mathbf{{\Greekmath 010C} }}-\mathbf{{\Greekmath 010C} }\right\Vert ^{2}
\\
&\leq &N^{-1}\sum_{i=1}^{N}\left\vert \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C}
_{i}\right\vert ^{2}=\mathbf{S}_{f}^{-2}\times N^{-1}\sum_{i=1}^{N}\left(
\frac{1}{T}\sum_{t=1}^{T}\left( v_{t}-\overline{v}\right) u_{i,t}\right)
^{2},
\end{eqnarray*}
and
\begin{eqnarray*}
&&\mathbb{E}\left[ N^{-1}\sum_{i=1}^{N}\left( \frac{1}{T}\sum_{t=1}^{T}
\left( v_{t}-\overline{v}\right) u_{i,t}\right) ^{2}\right] \\
&=&\frac{1}{N}\sum_{i=1}^{N}\frac{1}{T^{2}}\sum_{t=1}^{T}\sum_{s=1}^{T}
\mathbb{E}\left[ \left( v_{t}-\overline{v}\right) \left( v_{s}-\overline{v}
\right) \right] E\left( u_{i,t}u_{i,s}\right) \\
&\leq &\frac{1}{N}\sum_{i=1}^{N}\frac{1}{T^{2}}\sum_{t=1}^{T}\sum_{s=1}^{T}
\left( \mathbb{E}\left\vert v_{t}-\overline{v}\right\vert ^{2}\right)
\left\vert E\left( u_{i,t}u_{i,s}\right) \right\vert \leq c_{0}T,
\end{eqnarray*}
now the desired result follows by using Lemma (ref). Turning
to ((ref)), note that
\begin{equation*}
\widehat{\mathbf{S}}_{{\Greekmath 010C} }=\frac{1}{N}\sum_{i=1}^{N}\widehat{{\Greekmath 010C} }
_{i}^{2}-\left( \frac{1}{N}\sum_{i=1}^{N}\widehat{{\Greekmath 010C} }_{i}\right)
^{2},\qquad \mathbf{S}_{{\Greekmath 010C} }=\frac{1}{N}\sum_{i=1}^{N}{\Greekmath 010C}
_{i}^{2}-\left( \frac{1}{N}\sum_{i=1}^{N}{\Greekmath 010C} _{i}\right) ^{2}
\end{equation*}
with
\begin{equation}
\widehat{{\Greekmath 010C} }_{i}^{2}=\left( {\Greekmath 010C} _{i}+\mathbf{S}_{f}^{-1}\frac{1}{T}
\sum_{t=1}^{T}u_{i,t}(v_{t}-\overline{v})\right) ^{2}.
\end{equation}
Hence
\begin{eqnarray*}
\left\Vert \widehat{\mathbf{S}}_{{\Greekmath 010C} }-\mathbf{S}_{{\Greekmath 010C} }\right\Vert
&\leq &\left\Vert \frac{1}{N}\sum_{i=1}^{N}\widehat{{\Greekmath 010C} }_{i}^{2}-\frac{1}{
N}\sum_{i=1}^{N}{\Greekmath 010C} _{i}^{2}\right\Vert +\left\Vert \frac{1}{N}
\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }_{i}+{\Greekmath 010C} _{i}\right) \right\Vert
\left\Vert \frac{1}{N}\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C}
_{i}\right) \right\Vert \\
&=&I+II.
\end{eqnarray*}
Using ((ref))
\begin{eqnarray*}
\frac{1}{N}\sum_{i=1}^{N}\widehat{{\Greekmath 010C} }_{i}^{2} &=&\frac{1}{N}
\sum_{i=1}^{N}{\Greekmath 010C} _{i}^{2}+\frac{1}{NT^{2}}\sum_{i=1}^{N}\mathbf{S}
_{f}^{-2}\left( \sum_{t=1}^{T}u_{i,t}\left( v_{t}-\overline{v}\right)
\right) ^{2}+\mathbf{S}_{f}^{-1}\frac{2}{NT}\sum_{i=1}^{N}{\Greekmath 010C}
_{i}\sum_{t=1}^{T}u_{i,t}\left( v_{t}-\overline{v}\right) \\
&=&I_{a}+I_{b}+I_{c};
\end{eqnarray*}
the same passages as above readily yield
\begin{equation*}
I_{b}=o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{2+{\Greekmath 010F} }}{T}
\right) ;
\end{equation*}
also, using Assumptions (ref) and (ref)
\begin{eqnarray*}
&&\mathbb{E}\left( \frac{1}{NT}\sum_{i=1}^{N}{\Greekmath 010C}
_{i}\sum_{t=1}^{T}u_{i,t}\left( v_{t}-\overline{v}\right) \right) ^{2} \\
&=&\frac{1}{N^{2}T^{2}}\mathbb{E}\left( \sum_{i=1}^{N}\sum_{j=1}^{N}{\Greekmath 010C}
_{i}{\Greekmath 010C} _{j}\sum_{t=1}^{T}\sum_{s=1}^{T}\left( v_{t}-\overline{v}\right)
\left( v_{s}-\overline{v}\right) u_{i,t}u_{j,s}\right) \\
&\leq &\frac{1}{N^{2}T^{2}}\sum_{i=1}^{N}\sum_{j=1}^{N}\sum_{t=1}^{T}
\sum_{s=1}^{T}\left( \mathbb{E}\left( v_{t}-\overline{v}\right) ^{2}\right)
\left\vert \mathbb{E}\left( u_{i,t}u_{j,s}\right) \right\vert \leq
c_{0}\left( NT\right) ^{-1},
\end{eqnarray*}
so that
\begin{equation*}
I_{c}=o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{1+{\Greekmath 010F} }}{\left(
NT\right) ^{1/2}}\right) .
\end{equation*}
By the same token, turning to $II$ we have
\begin{equation*}
\frac{1}{N}\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right) =
\mathbf{S}_{f}^{-1}\frac{1}{N}\sum_{i=1}^{N}\left( \frac{1}{T}
\sum_{t=1}^{T}\left( v_{t}-\overline{v}\right) u_{i,t}\right) ,
\end{equation*}
where, by the same logic as above, it follows that
\begin{equation*}
\left\Vert \frac{1}{N}\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C}
_{i}\right) \right\Vert =o_{a.s.}\left( \frac{\left( \log N\log T\right)
^{1+{\Greekmath 010F} }}{\left( NT\right) ^{1/2}}\right) .
\end{equation*}
The desired result follows from noting
\begin{equation*}
\left\Vert \frac{1}{N}\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }_{i}+{\Greekmath 010C}
_{i}\right) \right\Vert \leq \left\Vert \frac{2}{N}\sum_{i=1}^{N}{\Greekmath 010C}
_{i}\right\Vert +\left\Vert \frac{1}{N}\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }
_{i}-{\Greekmath 010C} _{i}\right) \right\Vert .
\end{equation*}
\end{proof}
lemmaWe assume that Assumptions (ref)-(ref) and
(ref) and (ref) are satisfied. Then it holds that
\begin{equation*}
\sum_{i=1}^{N}\left\Vert \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right\Vert ^{{\Greekmath 0117}
/2}=o_{a.s.}\left( NT^{-{\Greekmath 0117} /4}\left( \log N\log T\right) ^{2+{\Greekmath 010F}
}\right) ,
\end{equation*}
for all ${\Greekmath 010F} >0$.
\begin{proof}
Recall that
\begin{equation*}
\widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\mathbf{=S}_{f}^{-1}\left( \frac{1}{T}
\sum_{t=1}^{T}\left( v_{t}-\overline{v}\right) u_{i,t}\right) .
\end{equation*}
Then
\begin{equation*}
\sum_{i=1}^{N}\left\Vert \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right\Vert ^{{\Greekmath 0117}
/2}\leq c_{0}\left( \sum_{i=1}^{N}\left\Vert \frac{1}{T}
\sum_{t=1}^{T}v_{t}u_{i,t}\right\Vert ^{{\Greekmath 0117} /2}+\sum_{i=1}^{N}\left\Vert
\frac{1}{T}\sum_{t=1}^{T}\overline{v}u_{i,t}\right\Vert ^{{\Greekmath 0117} /2}\right) ,
\end{equation*}
and we can readily show - by following the arguments above - that
\begin{equation*}
\mathbb{E}\sum_{i=1}^{N}\left\Vert \frac{1}{T}\sum_{t=1}^{T}v_{t}u_{i,t}
\right\Vert ^{{\Greekmath 0117} /2}\leq c_{0}NT^{-{\Greekmath 0117} /4},
\end{equation*}
so that
\begin{equation*}
\sum_{i=1}^{N}\left\Vert \frac{1}{T}\sum_{t=1}^{T}v_{t}u_{i,t}\right\Vert
^{{\Greekmath 0117} /2}=o_{a.s.}\left( NT^{-{\Greekmath 0117} /4}\left( \log N\log T\right) ^{2+{\Greekmath 010F}
}\right) .
\end{equation*}
Recall that $\overline{v}=o_{a.s.}T^{-1/2}\left( \log T\right) ^{1+{\Greekmath 010F}
} $, and note
\begin{equation*}
\mathbb{E}\sum_{i=1}^{N}\left\Vert \frac{1}{T}\sum_{t=1}^{T}u_{i,t}\right
\Vert ^{{\Greekmath 0117} /2}\leq c_{0}NT^{-{\Greekmath 0117} /4},
\end{equation*}
so that ultimately we receive the desired result by putting all together.
\end{proof}
We now report two lemmas on the rates of $\widehat{{\Greekmath 0115} }-{\Greekmath 0115} $ under
the null and under the alternative.
lemmaWe assume that $\mathbb{H}_{0}$ of ((ref)) holds, and
that Assumptions (ref)-(ref) and (ref) and (ref) are satisfied. Then it holds that
\begin{equation*}
\widehat{{\Greekmath 0115} }-{\Greekmath 0115} =o_{a.s.}\left( T^{-1/2}\left( \log T\right)
^{1+{\Greekmath 010F} }\right) ,
\end{equation*}
for all ${\Greekmath 010F} >0$.
\begin{proof}
Recall ((ref)). Under $\mathbb{H}_{0}$, it holds that $
\mathbf{{\Greekmath 010B} }=0$ and therefore
\begin{eqnarray*}
\widehat{{\Greekmath 0115} } &=&{\Greekmath 0115} \mathbf{+}\overline{v}+\frac{1}{N}\widehat{
\mathbf{S}}_{{\Greekmath 010C} }^{-1}\widehat{\mathbf{{\Greekmath 010C} }}^{\prime }\mathbb{M}
_{1_{N}}\left( \widehat{\mathbf{{\Greekmath 010C} }}\mathbf{-{\Greekmath 010C} }\right) {\Greekmath 0115} \\
&&+\frac{1}{N}\widehat{\mathbf{S}}_{{\Greekmath 010C} }^{-1}\widehat{\mathbf{{\Greekmath 010C} }}
^{\prime }\mathbb{M}_{1_{N}}\left( \mathbf{{\Greekmath 010C} -}\widehat{\mathbf{{\Greekmath 010C} }}
\right) \overline{v}+\frac{1}{N}\widehat{\mathbf{S}}_{{\Greekmath 010C} }^{-1}\mathbf{
{\Greekmath 010C} }^{\prime }\mathbb{M}_{1_{N}}\overline{\mathbf{u}} \\
&&+\frac{1}{N}\widehat{\mathbf{S}}_{{\Greekmath 010C} }^{-1}\left( \widehat{\mathbf{
{\Greekmath 010C} }}-\mathbf{{\Greekmath 010C} }\right) ^{\prime }\mathbb{M}_{1_{N}}\overline{
\mathbf{u}} \\
&=&{\Greekmath 0115} +I+II+III+IV+V.
\end{eqnarray*}
We begin by noting that, from standard passages, $I=o_{a.s.}\left(
T^{-1/2}\left( \log T\right) ^{1+{\Greekmath 010F} }\right) $. Note that, combining (
(ref)) and Assumption (ref)(ii)
\begin{eqnarray*}
\left\Vert \widehat{\mathbf{S}}_{{\Greekmath 010C} }^{-1}-\mathbf{S}_{{\Greekmath 010C}
}^{-1}\right\Vert &\leq &\left\Vert \left( \widehat{\mathbf{S}}_{{\Greekmath 010C} }\pm
\mathbf{S}_{{\Greekmath 010C} }\right) ^{-1}\right\Vert \left\Vert \mathbf{S}_{{\Greekmath 010C}
}^{-1}\right\Vert \left\Vert \widehat{\mathbf{S}}_{{\Greekmath 010C} }-\mathbf{S}_{{\Greekmath 010C}
}\right\Vert \\
&=&o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{2+{\Greekmath 010F} }}{T}\right)
+o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{1+{\Greekmath 010F} }}{\sqrt{NT}}
\right) ,
\end{eqnarray*}
and therefore we have
\begin{equation*}
\left\Vert \widehat{\mathbf{S}}_{{\Greekmath 010C} }^{-1}\right\Vert =O_{a.s.}\left(
1\right) .
\end{equation*}
Consider now
\begin{eqnarray*}
&&\left\Vert \frac{1}{N}\widehat{\mathbf{S}}_{{\Greekmath 010C} }^{-1}\widehat{\mathbf{
{\Greekmath 010C} }}^{\prime }\mathbb{M}_{1_{N}}\left( \widehat{\mathbf{{\Greekmath 010C} }}\mathbf{
-{\Greekmath 010C} }\right) {\Greekmath 0115} \right\Vert \\
&\leq &\frac{1}{N}\left\Vert \widehat{\mathbf{S}}_{{\Greekmath 010C} }^{-1}\pm \mathbf{S}
_{{\Greekmath 010C} }^{-1}\right\Vert \left\Vert \left( \widehat{\mathbf{{\Greekmath 010C} }}\pm
\mathbf{{\Greekmath 010C} }\right) ^{\prime }\mathbb{M}_{1_{N}}\left( \widehat{\mathbf{
{\Greekmath 010C} }}\mathbf{-{\Greekmath 010C} }\right) \right\Vert \left\Vert {\Greekmath 0115} \right\Vert .
\end{eqnarray*}
We have
\begin{eqnarray*}
&&\left\Vert \left( \widehat{\mathbf{{\Greekmath 010C} }}\pm \mathbf{{\Greekmath 010C} }\right)
^{\prime }\mathbb{M}_{1_{N}}\left( \widehat{\mathbf{{\Greekmath 010C} }}\mathbf{-{\Greekmath 010C} }
\right) \right\Vert \\
&\leq &\left\Vert \mathbf{{\Greekmath 010C} }^{\prime }\mathbb{M}_{1_{N}}\left( \widehat{
\mathbf{{\Greekmath 010C} }}\mathbf{-{\Greekmath 010C} }\right) \right\Vert +\left\Vert \left(
\widehat{\mathbf{{\Greekmath 010C} }}-\mathbf{{\Greekmath 010C} }\right) ^{\prime }\mathbb{M}
_{1_{N}}\left( \widehat{\mathbf{{\Greekmath 010C} }}\mathbf{-{\Greekmath 010C} }\right) \right\Vert
\\
&=&a+b.
\end{eqnarray*}
Consider $a$, and let $\mathbf{{\Greekmath 010C} }^{\prime }\mathbb{M}_{1_{N}}=\mathbf{w}
^{\prime }$ for short; we have
\begin{equation*}
\frac{1}{N}\mathbf{w}^{\prime }\left( \widehat{\mathbf{{\Greekmath 010C} }}\mathbf{
-{\Greekmath 010C} }\right) =\frac{1}{N}\sum_{i=1}^{N}w_{i}\left( \widehat{{\Greekmath 010C} }
_{i}-{\Greekmath 010C} _{i}\right) =\frac{1}{N}\sum_{i=1}^{N}w_{i}\frac{1}{T\mathbf{S}
_{f}}\sum_{t=1}^{T}u_{i,t}\left( v_{t}-\overline{v}\right) ,
\end{equation*}
and therefore
\begin{eqnarray*}
&&\mathbb{E}\left\vert \frac{1}{N}\mathbf{w}^{\prime }\left( \widehat{
\mathbf{{\Greekmath 010C} }}\mathbf{-{\Greekmath 010C} }\right) \right\vert ^{2} \\
&=&\frac{1}{N^{2}T^{2}\mathbf{S}_{f}^{2}}\sum_{i=1}^{N}
\sum_{j=1}^{N}w_{i}w_{j}\mathbb{E}\left[ \sum_{t=1}^{T}
\sum_{s=1}^{T}u_{i,t}u_{i,s}\left( v_{t}-\overline{v}\right) \left( v_{s}-
\overline{v}\right) \right] \\
&\leq &c_{0}\frac{1}{N^{2}T^{2}\mathbf{S}_{f}^{2}}\mathbb{E}\left[ \left(
v_{t}-\overline{v}\right) ^{2}\right] \sum_{i=1}^{N}\sum_{j=1}^{N}
\sum_{t=1}^{T}\sum_{s=1}^{T}\left\vert \mathbb{E}\left(
u_{i,t}u_{i,s}\right) \right\vert \leq c_{1}\frac{1}{NT},
\end{eqnarray*}
so that
\begin{equation*}
a=o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{1+{\Greekmath 010F} }}{\sqrt{NT}}
\right) .
\end{equation*}
Also
\begin{eqnarray*}
\frac{1}{N}\left\Vert \left( \widehat{\mathbf{{\Greekmath 010C} }}-\mathbf{{\Greekmath 010C} }
\right) ^{\prime }\mathbb{M}_{1_{N}}\left( \widehat{\mathbf{{\Greekmath 010C} }}\mathbf{
-{\Greekmath 010C} }\right) \right\Vert &\leq &\frac{1}{N}\left\Vert \widehat{\mathbf{
{\Greekmath 010C} }}-\mathbf{{\Greekmath 010C} }\right\Vert ^{2}+\frac{1}{N^{2}}\left[
\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right) \right] ^{2} \\
&=&o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{2+{\Greekmath 010F} }}{T}\right)
,
\end{eqnarray*}
following the proof of Lemma (ref). Hence, we obtain that
\begin{equation*}
II=o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{1+{\Greekmath 010F} }}{\sqrt{NT}}
\right) +o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{2+{\Greekmath 010F} }}{T}
\right) .
\end{equation*}
The same logic yields that $III$ is dominated by $II$. Turning to $IV$, it
holds that
\begin{equation*}
\frac{1}{N}\mathbf{{\Greekmath 010C} }^{\prime }\mathbb{M}_{1_{N}}\overline{\mathbf{u}}=
\frac{1}{N}\sum_{i=1}^{N}{\Greekmath 010C} _{i}\frac{1}{T}\sum_{t=1}^{T}u_{i,t}-\frac{1}{
N}\sum_{i=1}^{N}{\Greekmath 010C} _{i}\frac{1}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}u_{i,t};
\end{equation*}
we have
\begin{eqnarray*}
&&\mathbb{E}\left[ \left( \frac{1}{N}\sum_{i=1}^{N}{\Greekmath 010C} _{i}\frac{1}{T}
\sum_{t=1}^{T}u_{i,t}\right) ^{2}\right] \\
&=&\frac{1}{N^{2}T^{2}}\sum_{i=1}^{N}\sum_{i=1}^{N}{\Greekmath 010C} _{i}{\Greekmath 010C}
_{j}\sum_{t=1}^{T}\sum_{t=1}^{T}\mathbb{E}\left( u_{i,t}u_{j,s}\right) \\
&\leq &\frac{1}{N^{2}T^{2}}\sum_{i=1}^{N}\sum_{i=1}^{N}\sum_{t=1}^{T}
\sum_{t=1}^{T}\left\vert \mathbb{E}\left( u_{i,t}u_{j,s}\right) \right\vert
\leq c_{0}\frac{1}{NT},
\end{eqnarray*}
and
\begin{eqnarray*}
&&\mathbb{E}\left[ \left( \frac{1}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}u_{i,t}
\right) ^{2}\right] \\
&\leq &\frac{1}{N^{2}T^{2}}\sum_{i,j=1}^{N}\sum_{t,s=1}^{T}\mathbb{E}\left(
u_{i,t}u_{j,s}\right) \leq c_{0}\frac{1}{NT},
\end{eqnarray*}
by Assumption (ref)(ii), so that
\begin{equation}
IV=o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{1+{\Greekmath 010F} }}{\sqrt{NT}}
\right) .
\end{equation}
We conclude by only sketching the arguments for $V$; seeing as
\begin{eqnarray*}
&&\frac{1}{N}\left( \widehat{\mathbf{{\Greekmath 010C} }}-\mathbf{{\Greekmath 010C} }\right)
^{\prime }\mathbb{M}_{1_{N}}\overline{\mathbf{u}} \\
&=&\frac{1}{N}\left( \widehat{\mathbf{{\Greekmath 010C} }}-\mathbf{{\Greekmath 010C} }\right)
^{\prime }\overline{\mathbf{u}}=\frac{1}{N}\sum_{i=1}^{N}\left( \widehat{
{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right) \frac{1}{T}\sum_{t=1}^{T}u_{i,t} \\
&\leq &\left( \frac{1}{N}\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C}
_{i}\right) ^{2}\right) ^{1/2}\left( \frac{1}{N}\sum_{i=1}^{N}\left( \frac{1
}{T}\sum_{t=1}^{T}u_{i,t}\right) ^{2}\right) ^{1/2},
\end{eqnarray*}
and noting
\begin{equation*}
\mathbb{E}\left[ \frac{1}{N}\sum_{i=1}^{N}\left( \frac{1}{T}
\sum_{t=1}^{T}u_{i,t}\right) ^{2}\right] \leq c_{0}T^{-1},
\end{equation*}
using Lemma (ref) it follows that
\begin{equation*}
V=o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{2+{\Greekmath 010F} }}{T}\right) .
\end{equation*}
The desired result now follows.
\end{proof}
lemmaWe assume that $\mathbb{H}_{A}$ of ((ref)) holds, and
that Assumptions (ref)-(ref) and (ref) and (ref) are satisfied. Then it holds that
\begin{equation*}
\widehat{{\Greekmath 0115} }-{\Greekmath 0115} =\frac{1}{N}\mathbf{S}_{{\Greekmath 010C} }^{-1}\mathbf{{\Greekmath 010C}
}^{\prime }\mathbb{M}_{1_{N}}\mathbf{{\Greekmath 010B} }+o_{a.s.}\left( T^{-1/2}\left(
\log T\right) ^{1+{\Greekmath 010F} }\right) ,
\end{equation*}
for all ${\Greekmath 010F} >0$.
\begin{proof}
Considering
\begin{eqnarray*}
\widehat{{\Greekmath 0115} } &=&{\Greekmath 0115} +\frac{1}{N}\mathbf{S}_{{\Greekmath 010C} }^{-1}\mathbf{
{\Greekmath 010C} }^{\prime }\mathbb{M}_{1_{N}}\mathbf{{\Greekmath 010B} +}\overline{v}\mathbf{+}
\frac{1}{N}\left( \widehat{\mathbf{S}}_{{\Greekmath 010C} }^{-1}-\mathbf{S}_{{\Greekmath 010C}
}^{-1}\right) \mathbf{{\Greekmath 010C} }^{\prime }\mathbb{M}_{1_{N}}\mathbf{{\Greekmath 010B} } \\
&&+\frac{1}{N}\widehat{\mathbf{S}}_{{\Greekmath 010C} }^{-1}\left( \widehat{\mathbf{
{\Greekmath 010C} }}\mathbf{-{\Greekmath 010C} }\right) ^{\prime }\mathbb{M}_{1_{N}}\mathbf{{\Greekmath 010B} +}
\frac{1}{N}\widehat{\mathbf{S}}_{{\Greekmath 010C} }^{-1}\widehat{\mathbf{{\Greekmath 010C} }}
^{\prime }\mathbb{M}_{1_{N}}\left( \widehat{\mathbf{{\Greekmath 010C} }}\mathbf{-{\Greekmath 010C} }
\right) {\Greekmath 0115} \\
&&+\frac{1}{N}\widehat{\mathbf{S}}_{{\Greekmath 010C} }^{-1}\widehat{\mathbf{{\Greekmath 010C} }}
^{\prime }\mathbb{M}_{1_{N}}\left( \mathbf{{\Greekmath 010C} -}\widehat{\mathbf{{\Greekmath 010C} }}
\right) \overline{v}+\frac{1}{N}\widehat{\mathbf{S}}_{{\Greekmath 010C} }^{-1}\mathbf{
{\Greekmath 010C} }^{\prime }\mathbb{M}_{1_{N}}\overline{\mathbf{u}} \\
&&+\frac{1}{N}\widehat{\mathbf{S}}_{{\Greekmath 010C} }^{-1}\left( \widehat{\mathbf{
{\Greekmath 010C} }}-\mathbf{{\Greekmath 010C} }\right) ^{\prime }\mathbb{M}_{1_{N}}\overline{
\mathbf{u}} \\
&=&{\Greekmath 0115} +I+II+III+IV+V+VI+VII+VIII,
\end{eqnarray*}
the only terms that require some analysis are $III$ and $IV$. However, we
already know that
\begin{equation*}
\left\Vert \widehat{\mathbf{S}}_{{\Greekmath 010C} }^{-1}-\mathbf{S}_{{\Greekmath 010C}
}^{-1}\right\Vert =o_{a.s.}\left( \frac{\left( \log N\log T\right)
^{2+{\Greekmath 010F} }}{T}\right) +o_{a.s.}\left( \frac{\left( \log N\log T\right)
^{1+{\Greekmath 010F} }}{\sqrt{NT}}\right) ;
\end{equation*}
further
\begin{eqnarray*}
&&\frac{1}{N}\left( \widehat{\mathbf{{\Greekmath 010C} }}\mathbf{-{\Greekmath 010C} }\right)
^{\prime }\mathbb{M}_{1_{N}}\mathbf{{\Greekmath 010B} } \\
&\mathbf{=}&\frac{1}{N}\sum_{i=1}^{N}\left( {\Greekmath 010B} _{i}-\frac{1}{N}
\sum_{i=1}^{N}{\Greekmath 010B} _{i}\right) \left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C}
_{i}\right) =\frac{1}{N}\sum_{i=1}^{N}\widetilde{w}_{i}\frac{1}{T}
\sum_{t=1}^{T}\left( v_{t}-\overline{v}\right) u_{i,t},
\end{eqnarray*}
which can be shown to be $o_{a.s.}\left( \left( NT\right) ^{-1/2}\left( \log
N\log T\right) ^{1+{\Greekmath 010F} }\right) $.
\end{proof}
lemmaWe assume that Assumptions (ref)-(ref), (ref) and (ref) are satisfied. Then it
holds that
\begin{eqnarray*}
\liminf_{\min \left\{ N,T\right\} \rightarrow \infty }\frac{1}{NT}
\sum_{i=1}^{N}\sum_{t=1}^{T}\left( \widehat{u}_{i,t}^{FM}\right) ^{2} &>&0,
\\
\limsup_{\min \left\{ N,T\right\} \rightarrow \infty }\frac{1}{NT}
\sum_{i=1}^{N}\sum_{t=1}^{T}\left( \widehat{u}_{i,t}^{FM}\right) ^{2}
&<&\infty .
\end{eqnarray*}
\begin{proof}
The proof is very similat to that of Lemma (ref), and we report
only the main passages to save space. It holds that
\begin{eqnarray*}
&&\frac{1}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}\left( \widehat{u}
_{i,t}^{FM}\right) ^{2} \\
&=&\frac{1}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}u_{i,t}^{2}+\frac{1}{N}
\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010B} }_{i}^{FM}-{\Greekmath 010B} _{i}\right) ^{2}+
\frac{1}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C}
_{i}\right) ^{2}f_{t}^{2} \\
&&+\frac{2}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}\left( \widehat{{\Greekmath 010B} }
_{i}^{FM}-{\Greekmath 010B} _{i}\right) u_{i,t}+\frac{2}{NT}\sum_{i=1}^{N}
\sum_{t=1}^{T}\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right) f_{t}u_{i,t} \\
&&+\frac{2}{NT}\sum_{i=1}^{N}\sum_{t=1}^{T}\left( \widehat{{\Greekmath 010B} }
_{i}^{FM}-{\Greekmath 010B} _{i}\right) \left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right)
f_{t} \\
&=&I+II+III+IV+V+VI.
\end{eqnarray*}
The rates of terms $I$, $III$ and $V$ are the same as in the proof of Lemma
(ref). Note that $II\geq 0$; we derive an upper bound for it
using ((ref)). Noting that
\begin{eqnarray*}
&&\frac{1}{N}\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010B} }_{i}^{FM}-{\Greekmath 010B}
_{i}\right) ^{2} \\
&\leq &c_{0}\left[ \frac{1}{N}\sum_{i=1}^{N}{\Greekmath 010C} _{i}^{2}\overline{v}^{2}+
\frac{1}{N}\sum_{i=1}^{N}\overline{u}_{i}^{2}+\left( \frac{1}{N}
\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right) ^{2}\right)
{\Greekmath 0115} ^{2}\right. \\
&&\left. \left( \frac{1}{N}\sum_{i=1}^{N}{\Greekmath 010C} _{i}^{2}\right) \left(
\widehat{{\Greekmath 0115} }-{\Greekmath 0115} \right) ^{2}+\left( \frac{1}{N}
\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right) ^{2}\right)
\left( \widehat{{\Greekmath 0115} }-{\Greekmath 0115} \right) ^{2}\right] ,
\end{eqnarray*}
the results above readily entail that $II=o_{a.s.}\left( 1\right) $.
Similarly
\begin{eqnarray*}
IV &=&\frac{2}{NT}\left( \sum_{i=1}^{N}\sum_{t=1}^{T}{\Greekmath 010C}
_{i}u_{i,t}\right) \overline{v}+\frac{2}{N}\sum_{i=1}^{N}\overline{u}
_{i}\left( \frac{1}{T}\sum_{t=1}^{T}u_{i,t}\right) -\frac{2}{NT}\left(
\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right)
\sum_{t=1}^{T}u_{i,t}\right) {\Greekmath 0115} \\
&&-\frac{2}{NT}\left( \sum_{i=1}^{N}\sum_{t=1}^{T}{\Greekmath 010C} _{i}u_{i,t}\right)
\left( \widehat{{\Greekmath 0115} }-{\Greekmath 0115} \right) -\frac{2}{NT}\left(
\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right) \left(
\sum_{t=1}^{T}u_{i,t}\right) \right) \left( \widehat{{\Greekmath 0115} }-{\Greekmath 0115}
\right) \\
&=&IV_{a}+IV_{b}+IV_{c}+IV_{d}+IV_{e}.
\end{eqnarray*}
Since it is immediate to see that
\begin{equation*}
\mathbb{E}\left( \sum_{i=1}^{N}\sum_{t=1}^{T}{\Greekmath 010C} _{i}u_{i,t}\right)
^{2}\leq c_{0}NT,
\end{equation*}
we have
\begin{equation*}
IV_{a}=o_{a.s.}\left( \frac{\left( \log N\log ^{2}T\right) ^{1+{\Greekmath 010F} }}{
N^{1/2}T}\right) ;
\end{equation*}
by the same arguments
\begin{equation*}
\mathbb{E}\left( \frac{2}{N}\sum_{i=1}^{N}\overline{u}_{i}\left( \frac{1}{T}
\sum_{t=1}^{T}u_{i,t}\right) \right) =\frac{2}{N}\sum_{i=1}^{N}\mathbb{E}
\left( \overline{u}_{i}^{2}\right) \leq c_{0}T^{-1},
\end{equation*}
and therefore
\begin{equation*}
IV_{b}=o_{a.s.}\left( \frac{\left( \log T\right) ^{2+{\Greekmath 010F} }}{T}\right) .
\end{equation*}
The other terms can be shown to be dominated by using the arguments above.
Noting that
\begin{equation*}
\frac{1}{N}\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right)
\left( \frac{1}{T}\sum_{t=1}^{T}u_{i,t}\right) \leq \left( \frac{1}{N}
\sum_{i=1}^{N}\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right) ^{2}\right)
^{1/2}\left( \frac{1}{N}\sum_{i=1}^{N}\left( \frac{1}{T}
\sum_{t=1}^{T}u_{i,t}\right) ^{2}\right) ^{1/2},
\end{equation*}
it is easy to see that $VI=o_{a.s.}\left( 1\right) $. The desired result now
follows.
\end{proof}
lemmaWe assume that Assumptions (ref)-(ref), (ref) and (ref) are satisfied. Then it holds that, under $
\mathbb{H}_{0}$
\begin{equation*}
\sum_{i=1}^{N}{\Greekmath 0120} _{i,NT}^{FM}=o_{a.s.}\left( 1\right) .
\end{equation*}
\begin{proof}
Consider the case $K=1$, and recall ((ref)), which under $\mathbb{H}
_{0}$ becomes
\begin{equation*}
\widehat{{\Greekmath 010B} }_{i}^{FM}={\Greekmath 010C} _{i}\overline{v}+\overline{u}_{i}-\left(
\widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right) {\Greekmath 0115} -{\Greekmath 010C} _{i}\left( \widehat{
{\Greekmath 0115} }-{\Greekmath 0115} \right) -\left( \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right)
\left( \widehat{{\Greekmath 0115} }-{\Greekmath 0115} \right) .
\end{equation*}
Hence we have
\begin{eqnarray*}
&&\sum_{i=1}^{N}{\Greekmath 0120} _{i,NT}^{FM} \\
&=&\frac{T^{1/2}}{\left\vert \widehat{s}_{NT}^{FM}\right\vert ^{{\Greekmath 0117} /2}}
\sum_{i=1}^{N}\left\vert \widehat{{\Greekmath 010B} }_{i}^{FM}\right\vert ^{{\Greekmath 0117} /2} \\
&\leq &c_{0}\left[ \frac{T^{1/2}}{\left\vert \widehat{s}_{NT}^{FM}\right
\vert ^{{\Greekmath 0117} /2}}\left( \sum_{i=1}^{N}\left\vert {\Greekmath 010C} _{i}\right\vert ^{{\Greekmath 0117}
/2}\right) \left\vert \overline{v}\right\vert ^{{\Greekmath 0117} /2}+\frac{T^{1/2}}{
\left\vert \widehat{s}_{NT}^{FM}\right\vert ^{{\Greekmath 0117} /2}}\sum_{i=1}^{N}\left
\vert \overline{u}_{i}\right\vert ^{{\Greekmath 0117} /2}+\frac{T^{1/2}}{\left\vert
\widehat{s}_{NT}^{FM}\right\vert ^{{\Greekmath 0117} /2}}\left( \sum_{i=1}^{N}\left\vert
\widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right\vert ^{{\Greekmath 0117} /2}\right) \left\vert
{\Greekmath 0115} \right\vert ^{{\Greekmath 0117} /2}\right. \\
&&\left. +\frac{T^{1/2}}{\left\vert \widehat{s}_{NT}^{FM}\right\vert ^{{\Greekmath 0117}
/2}}\left( \sum_{i=1}^{N}\left\vert {\Greekmath 010C} _{i}\right\vert ^{{\Greekmath 0117} /2}\right)
\left\vert \widehat{{\Greekmath 0115} }-{\Greekmath 0115} \right\vert ^{{\Greekmath 0117} /2}+\frac{T^{1/2}}{
\left\vert \widehat{s}_{NT}^{FM}\right\vert ^{{\Greekmath 0117} /2}}\left(
\sum_{i=1}^{N}\left\vert \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right\vert ^{{\Greekmath 0117}
/2}\right) \left\vert \widehat{{\Greekmath 0115} }-{\Greekmath 0115} \right\vert ^{{\Greekmath 0117} /2}\right]
\\
&=&I+II+III+IV+V.
\end{eqnarray*}
By Assumption (ref)(i), $\sum_{i=1}^{N}\left\vert {\Greekmath 010C}
_{i}\right\vert ^{{\Greekmath 0117} /2}=O(N) $, so that
\begin{equation*}
I=o_{a.s.}\left(NT^{1/2-{\Greekmath 0117} /4}\left( \log T\right) ^{\left( 1+{\Greekmath 010F}
\right) {\Greekmath 0117} /2}\right) =o_{a.s.}\left( 1\right) ,
\end{equation*}
seeing as ${\Greekmath 0117} \geq 4$. Also, we have already shown in the proof of Lemma (ref) that $II=o_{a.s.}\left( 1\right) $. Moreover, Lemma (ref)
yields
\begin{equation*}
\frac{T^{1/2}}{\left\vert \widehat{s}_{NT}^{FM}\right\vert ^{{\Greekmath 0117} /2}}\left(
\sum_{i=1}^{N}\left\vert \widehat{{\Greekmath 010C} }_{i}-{\Greekmath 010C} _{i}\right\vert ^{{\Greekmath 0117}
/2}\right) \left\vert {\Greekmath 0115} \right\vert ^{{\Greekmath 0117} /2}=o_{a.s.}\left(
NT^{1/2}T^{-{\Greekmath 0117} /4}\left( \log N\log T\right) ^{2+{\Greekmath 010F} }\right)
=o_{a.s.}\left( 1\right) .
\end{equation*}
Finally, by Assumption (ref)(i) and Lemma (ref)
entail
\begin{equation*}
IV=o_{a.s.}\left( NT^{1/2-{\Greekmath 0117} /4}\left( \log T\right) ^{\left( 1+{\Greekmath 010F}
\right) {\Greekmath 0117} /2}\right) =o_{a.s.}\left( 1\right) .
\end{equation*}
Finally, it is easy to see that $V$ is dominated by $III$. The desired
result now follows by putting all together.
\end{proof}
Lemmas for Section (ref)
We now report a series of lemmas for the case, discussed in Section (ref), of latent factors. As in the previous subsection, in the proofs we
will assume $K=1$ whenever possible.
Recall that - with reference to ((ref)) - $\mathbf{{\Greekmath 010C} }=\left(
{\Greekmath 010C} _{1},...,{\Greekmath 010C} _{N}\right) ^{\prime }$. Let $\widehat{\Phi }$ be the
diagonal matrix containing, in descending order, the $K$ largest eigenvalues
of $\widehat{\mathbf{\Sigma }}_{y}$. Then, by definition
equation*[equation* omitted — 149 chars of source]
which implies the following expansion
eqnarray[eqnarray omitted — 1,105 chars of source]
with the constraint $\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}\right) ^{\prime }
\widehat{\mathbf{{\Greekmath 010C} }}^{PC}=N\times \mathbb{I}_{K}$ and having defined
equation*[equation* omitted — 224 chars of source]
Similarly, we have also the unit-by-unit version of ((ref))
eqnarray[eqnarray omitted — 657 chars of source]
Then, considering
equation*[equation* omitted — 281 chars of source]
we have
align[align omitted — 1,310 chars of source]
lemmaWe assume that Assumptions (ref)-(ref),
and (ref)-(ref) are satisfied. Then it holds that $
\left\Vert \widehat{\Phi }^{-1}\right\Vert =O_{a.s.}\left( 1\right) $.
\begin{proof}
Let $\Phi =diag\left\{ \Phi _{1},...,\Phi _{K}\right\} $ denote the diagonal
matrix containing the $K$ largest eigenvalues of $\mathbf{{\Greekmath 010C} }\mathbb{E}
\left( \widetilde{v}_{t}\widetilde{v}_{t}^{\prime }\right) \mathbf{{\Greekmath 010C} }
^{\prime }/N$. Then, it is immediate to verify that the assumptions of Lemma
2.2 in trapani2018randomized hold, and
\begin{equation*}
\widehat{\Phi }_{j}=\Phi _{j}+o_{a.s.}\left( 1\right) ,
\end{equation*}
for all $1\leq j\leq K$. Seeing as, using the multiplicative Weyl's
inequality (theorem 7 in merikoski2004inequalities), and
Assumptions (ref) and (ref)
\begin{equation*}
\Phi _{K}\geq {\Greekmath 011A} _{K}\left( \mathbf{{\Greekmath 010C} }^{\prime }\mathbf{{\Greekmath 010C} }
/N\right) {\Greekmath 011A} _{\min }\left( \mathbb{E}\left( \widetilde{v}_{t}\widetilde{v}
_{t}^{\prime }\right) \right) \geq c_{0}>0,
\end{equation*}
where ${\Greekmath 011A} _{k}\left( A\right) $ denotes the $k$-th largest eigenvalue of
matrix $A$, the desired result follows.
\end{proof}
lemmaWe assume that Assumptions (ref)-(ref), and
(ref)-(ref) are satisfied. Then it holds that
\begin{equation*}
\frac{1}{N}\left\Vert \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}
\right\Vert ^{2}=o_{a.s.}\left( \frac{\left( \log N\log T\right)
^{2+{\Greekmath 010F} }}{T}\right) +O\left( \frac{1}{N^{2}}\right) .
\end{equation*}
\begin{proof}
By ((ref)), we have
\begin{eqnarray*}
&&\left\Vert \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right\Vert ^{2}
\\
&\leq &c_{0}\left( \frac{1}{N^{2}}\left\Vert \mathbf{{\Greekmath 010C} }\left( \frac{1}{T
}\sum_{t=1}^{T}\widetilde{v}_{t}\widetilde{\mathbf{u}}_{t}^{\prime }\right)
\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\widehat{\Phi }^{-1}\right\Vert ^{2}+\frac{1}{
N^{2}}\left\Vert \left( \frac{1}{T}\sum_{t=1}^{T}\widetilde{\mathbf{u}}_{t}
\widetilde{v}_{t}^{\prime }\right) \mathbf{{\Greekmath 010C} }^{\prime }\widehat{\mathbf{
{\Greekmath 010C} }}^{PC}\widehat{\Phi }^{-1}\right\Vert ^{2}\right. \\
&&\qquad +\left. \left\Vert \left( \frac{1}{NT}\sum_{t=1}^{T}\widetilde{
\mathbf{u}}_{t}\widetilde{\mathbf{u}}_{t}^{\prime }\right) \widehat{\mathbf{
{\Greekmath 010C} }}^{PC}\widehat{\Phi }^{-1}\right\Vert ^{2}\right) \\
&=&I+I^{\prime }+II.
\end{eqnarray*}
It holds that
\begin{equation*}
I\leq \frac{1}{N^{2}}\left\Vert \mathbf{{\Greekmath 010C} }\right\Vert ^{2}\left\Vert
\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\right\Vert ^{2}\left\Vert \widehat{\Phi }
^{-1}\right\Vert ^{2}\left\Vert \frac{1}{T}\sum_{t=1}^{T}\widetilde{v}_{t}
\widetilde{\mathbf{u}}_{t}^{\prime }\right\Vert ^{2}\leq c_{0}\left\Vert
\frac{1}{T}\sum_{t=1}^{T}\widetilde{v}_{t}\widetilde{\mathbf{u}}_{t}^{\prime
}\right\Vert ^{2},
\end{equation*}
on account of Assumption (ref) and Lemma (ref). Also note
that
\begin{equation*}
\left\Vert \frac{1}{T}\sum_{t=1}^{T}\widetilde{v}_{t}\widetilde{\mathbf{u}}
_{t}^{\prime }\right\Vert ^{2}\leq \left\Vert \frac{1}{T}\sum_{t=1}^{T}v_{t}
\mathbf{u}_{t}^{\prime }\right\Vert ^{2}+\left\Vert \overline{v}\right\Vert
^{2}\left\Vert \overline{\mathbf{u}}\right\Vert ^{2}.
\end{equation*}
It holds that
\begin{equation*}
\left\Vert \frac{1}{T}\sum_{t=1}^{T}v_{t}\mathbf{u}_{t}^{\prime }\right\Vert
^{2}=\sum_{i=1}^{N}\left( \frac{1}{T}\sum_{t=1}^{T}v_{t}u_{i,t}\right) ^{2},
\end{equation*}
and
\begin{eqnarray*}
&&\mathbb{E}\left[ \sum_{i=1}^{N}\left( \frac{1}{T}
\sum_{t=1}^{T}v_{t}u_{i,t}\right) ^{2}\right] \\
&=&\frac{1}{T^{2}}\sum_{i=1}^{N}\sum_{t,s=1}^{T}\mathbb{E}\left(
v_{t}v_{s}u_{i,t}u_{i,s}\right) \leq \frac{1}{T^{2}}\sum_{i=1}^{N}
\sum_{t,s=1}^{T}\mathbb{E}\left( v_{t}v_{s}\right) \mathbb{E}\left(
u_{i,t}u_{i,s}\right) \\
&\leq &\frac{1}{T^{2}}\mathbb{E}\left( v_{0}^{2}\right)
\sum_{i=1}^{N}\sum_{t,s=1}^{T}\left\vert \mathbb{E}\left(
u_{i,t}u_{i,s}\right) \right\vert \leq c_{0}\frac{N}{T}.
\end{eqnarray*}
Also, we know that $\left\Vert \overline{v}\right\Vert =o_{a.s.}\left(
T^{-1/2}\left( \log T\right) ^{1+{\Greekmath 010F} }\right) $, and
\begin{equation*}
\left\Vert \overline{\mathbf{u}}\right\Vert ^{2}=\sum_{i=1}^{N}\left( \frac{1
}{T}\sum_{t=1}^{T}u_{i,t}\right) ^{2}=\frac{1}{T^{2}}\sum_{i=1}^{N}
\sum_{t,s=1}^{T}u_{i,t}u_{i,s},
\end{equation*}
with
\begin{equation*}
\mathbb{E}\left( \frac{1}{T^{2}}\sum_{i=1}^{N}\sum_{t,s=1}^{T}u_{i,t}u_{i,s}
\right) \leq \frac{1}{T^{2}}\sum_{i=1}^{N}\sum_{t,s=1}^{T}\left\vert \mathbb{
E}\left( u_{i,t}u_{i,s}\right) \right\vert \leq c_{0}\frac{N}{T},
\end{equation*}
so that $\left\Vert \overline{\mathbf{u}}\right\Vert =o_{a.s.}\left(
N^{1/2}T^{-1/2}\left( \log T\log N\right) ^{1+{\Greekmath 010F} }\right) $. Putting
all together, we ultimately receive
\begin{equation*}
I=o_{a.s.}\left( \frac{N}{T}\left( \log N\log T\right) ^{2+{\Greekmath 010F} }\right)
.
\end{equation*}
Turning to $II$, note
\begin{eqnarray*}
&&\left\Vert \left( \frac{1}{NT}\sum_{t=1}^{T}\widetilde{\mathbf{u}}_{t}
\widetilde{\mathbf{u}}_{t}^{\prime }\right) \widehat{\mathbf{{\Greekmath 010C} }}^{PC}
\widehat{\Phi }^{-1}\right\Vert ^{2} \\
&\leq &c_{0}\left\Vert \left( \frac{1}{NT}\sum_{t=1}^{T}\mathbf{u}_{t}
\mathbf{u}_{t}^{\prime }-\mathbb{E}\left( \mathbf{u}_{0}\mathbf{u}
_{0}^{\prime }\right) \right) \widehat{\mathbf{{\Greekmath 010C} }}^{PC}\widehat{\Phi }
^{-1}\right\Vert ^{2}+c_{0}\left\Vert \frac{1}{N}\mathbb{E}\left( \mathbf{u}
_{0}\mathbf{u}_{0}^{\prime }\right) \widehat{\mathbf{{\Greekmath 010C} }}^{PC}\widehat{
\Phi }^{-1}\right\Vert ^{2}+c_{0}\left\Vert \frac{1}{N}\overline{\mathbf{u}}
\overline{\mathbf{u}}^{\prime }\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\widehat{\Phi }
^{-1}\right\Vert ^{2} \\
&=&II_{a}+II_{b}+II_{c}.
\end{eqnarray*}
We already know from the above that $\left\Vert \overline{\mathbf{u}}
\right\Vert ^{2}=o_{a.s.}\left( NT^{-1}\left( \log N\log T\right)
^{2+{\Greekmath 010F} }\right) $, which readily yields
\begin{equation*}
II_{c}=o_{a.s.}\left( NT^{-2}\left( \log N\log T\right) ^{4+{\Greekmath 010F}
}\right) .
\end{equation*}
Also
\begin{equation*}
\left\Vert \mathbb{E}\left( \mathbf{u}_{0}\mathbf{u}_{0}^{\prime }\right)
\right\Vert ^{2}\leq \left\Vert \mathbb{E}\left( \mathbf{u}_{0}\mathbf{u}
_{0}^{\prime }\right) \right\Vert _{1}^{2}=\left( \max_{1\leq i\leq
N}\sum_{j=1}^{N}\left\vert \mathbb{E}\left( u_{i,0}u_{j,0}\right)
\right\vert \right) ^{2}\leq c_{0},
\end{equation*}
so that
\begin{equation*}
II_{b}=O\left( \frac{1}{N}\right) .
\end{equation*}
Finally
\begin{equation*}
\left\Vert \frac{1}{NT}\sum_{t=1}^{T}\mathbf{u}_{t}\mathbf{u}_{t}^{\prime }-
\mathbb{E}\left( \mathbf{u}_{0}\mathbf{u}_{0}^{\prime }\right) \right\Vert
_{F}^{2}=\frac{1}{N^{2}T^{2}}\sum_{i,j=1}^{N}\left(
\sum_{t,s=1}^{T}Cov\left( u_{i,t}u_{j,t},u_{i,s}u_{j,s}\right) \right) \leq
c_{0}\frac{1}{T},
\end{equation*}
and therefore
\begin{equation*}
II_{a}=o_{a.s.}\left( \frac{N}{T}\left( \log N\log T\right) ^{2+{\Greekmath 010F}
}\right) .
\end{equation*}
The desired result obtains by putting all together.
\end{proof}
lemmaWe assume that Assumptions (ref)-(ref), and
(ref)-(ref) are satisfied. Then it holds that $
\left\Vert \mathbf{H}\right\Vert =O_{a.s.}\left( 1\right) $, and $\left\Vert
\mathbf{H}^{-1}\right\Vert =O_{a.s.}\left( 1\right) $.
\begin{proof}
Note
\begin{equation*}
\left\Vert \mathbf{H}\right\Vert \leq \left\Vert \frac{1}{T}\sum_{t=1}^{T}
\widetilde{v}_{t}\widetilde{v}_{t}^{\prime }\right\Vert \frac{\left\Vert
\mathbf{{\Greekmath 010C} }\right\Vert \left\Vert \widehat{\mathbf{{\Greekmath 010C} }}
^{PC}\right\Vert }{N}\left\Vert \widehat{\Phi }^{-1}\right\Vert .
\end{equation*}
Standard arguments yield $\left\Vert T^{-1}\sum_{t=1}^{T}\widetilde{v}_{t}
\widetilde{v}_{t}^{\prime }\right\Vert =O_{a.s.}\left( 1\right) $; further, $
\left\Vert \widehat{\mathbf{{\Greekmath 010C} }}^{PC}\right\Vert =N^{1/2}$ by
construction, and $\left\Vert \mathbf{{\Greekmath 010C} }\right\Vert =N^{1/2}$ by
Assumption (ref). The desired result now follows by Lemma (ref). As far as the second part of the lemma is concerned, recall the
identification restriction $\mathbf{{\Greekmath 010C} }^{\prime }\mathbf{{\Greekmath 010C} }=N
\mathbb{I}_{K}$, and that, by construction $\left( \widehat{\mathbf{{\Greekmath 010C} }}
^{PC}\right) ^{\prime }\widehat{\mathbf{{\Greekmath 010C} }}^{PC}=N\mathbb{I}_{K}$. Then
we have
\begin{eqnarray*}
\mathbb{I}_{K} &=&\frac{1}{N}\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}\right)
^{\prime }\widehat{\mathbf{{\Greekmath 010C} }}^{PC} \\
&=&\frac{1}{N}\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H+{\Greekmath 010C} H}
\right) ^{\prime }\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C}
H+{\Greekmath 010C} H}\right) \\
&=&\mathbf{H}^{\prime }\left( \frac{1}{N}\mathbf{{\Greekmath 010C} }^{\prime }\mathbf{
{\Greekmath 010C} }\right) \mathbf{H}+\mathbf{H}^{\prime }\frac{1}{N}\mathbf{{\Greekmath 010C} }
^{\prime }\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right) +
\left[ \mathbf{H}^{\prime }\frac{1}{N}\mathbf{{\Greekmath 010C} }^{\prime }\left(
\widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right) \right] ^{\prime } \\
&&+\frac{1}{N}\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right)
^{\prime }\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right) \\
&=&\mathbf{H}^{\prime }\mathbf{H}+\mathbf{H}^{\prime }\frac{1}{N}\mathbf{
{\Greekmath 010C} }^{\prime }\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}
\right) +\left[ \mathbf{H}^{\prime }\frac{1}{N}\mathbf{{\Greekmath 010C} }^{\prime
}\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right) \right]
^{\prime } \\
&&+\frac{1}{N}\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right)
^{\prime }\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right) .
\end{eqnarray*}
Using Lemma (ref) repeatedly, it is easy to see that
\begin{equation*}
\mathbf{H}^{\prime }\frac{1}{N}\mathbf{{\Greekmath 010C} }^{\prime }\left( \widehat{
\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right) +\left[ \mathbf{H}^{\prime }
\frac{1}{N}\mathbf{{\Greekmath 010C} }^{\prime }\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-
\mathbf{{\Greekmath 010C} H}\right) \right] ^{\prime }+\frac{1}{N}\left( \widehat{
\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right) ^{\prime }\left( \widehat{
\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right) =o_{a.s.}\left( 1\right) ,
\end{equation*}
and therefore
\begin{equation*}
\mathbf{H}^{\prime }\mathbf{H=}\mathbb{I}_{K}+o_{a.s.}\left( 1\right) ,
\end{equation*}
so that $\mathbf{H}^{-1}=\mathbf{H}^{\prime }$. This proves that $\mathbf{H}$
is invertible.
\end{proof}
lemmaWe assume that Assumptions (ref)-(ref)
, and (ref)-(ref) are satisfied. Then it holds that,
under $\mathbb{H}_{0}$
\begin{equation*}
\widehat{{\Greekmath 0115} }^{PC}-\mathbf{H}^{-1}{\Greekmath 0115} =o_{a.s.}\left( \frac{\left(
\log T\log N\right) ^{1+{\Greekmath 010F} }}{T^{1/2}}\right) +O\left( \frac{1}{N}
\right) ,
\end{equation*}
for all ${\Greekmath 010F} >0$.
\begin{proof}
By ((ref)), under the null it holds that
\begin{eqnarray}
\widehat{{\Greekmath 0115} }^{PC} &=&\left( \frac{\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }
\mathbb{M}_{1_{N}}\widehat{\mathbf{{\Greekmath 010C} }}^{PC}}{N}\right) ^{-1}\left(
\frac{\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\mathbb{M}_{1_{N}}\mathbf{{\Greekmath 010C} }
}{N}\right) {\Greekmath 0115} \\
&&+\left( \frac{\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\mathbb{M}_{1_{N}}
\widehat{\mathbf{{\Greekmath 010C} }}^{PC}}{N}\right) ^{-1}\left( \frac{\widehat{\mathbf{
{\Greekmath 010C} }}^{PC\prime }\mathbb{M}_{1_{N}}\mathbf{{\Greekmath 010C} }}{N}\right) \overline{v}
\notag \\
&&+\left( \frac{\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\mathbb{M}_{1_{N}}
\widehat{\mathbf{{\Greekmath 010C} }}^{PC}}{N}\right) ^{-1}\left( \frac{\widehat{\mathbf{
{\Greekmath 010C} }}^{PC\prime }\mathbb{M}_{1_{N}}\overline{\mathbf{u}}}{N}\right)
\notag \\
&=&I+II+III. \notag
\end{eqnarray}
Note, to begin with, that
\begin{eqnarray*}
&&\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\mathbb{M}_{1_{N}}\widehat{\mathbf{
{\Greekmath 010C} }}^{PC} \\
&=&\mathbf{H}^{\prime }\mathbf{S}_{{\Greekmath 010C} }\mathbf{H}+\mathbf{H}^{\prime }
\mathbf{{\Greekmath 010C} }^{\prime }\mathbb{M}_{1_{N}}\left( \widehat{\mathbf{{\Greekmath 010C} }}
^{PC}-\mathbf{{\Greekmath 010C} H}\right) +\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{
{\Greekmath 010C} H}\right) ^{\prime }\mathbb{M}_{1_{N}}\mathbf{{\Greekmath 010C} H} \\
&&+\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right) ^{\prime }
\mathbb{M}_{1_{N}}\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}
\right) ;
\end{eqnarray*}
thus, using Lemma (ref), it is easy to see that
\begin{equation*}
\frac{1}{N}\left\Vert \widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\mathbb{M}_{1_{N}}
\widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{H}^{\prime }\mathbf{S}_{{\Greekmath 010C} }
\mathbf{H}\right\Vert =o_{a.s.}\left( \frac{\left( \log N\log T\right)
^{1+{\Greekmath 010F} }}{T^{1/2}}\right) +O\left( \frac{1}{N}\right) .
\end{equation*}
Assumption (ref)(iii) and Lemma (ref) guarantee
that $\mathbf{H}^{\prime }\mathbf{S}_{{\Greekmath 010C} }\mathbf{H}$ is invertible, and
therefore we may write
\begin{equation}
\left\Vert \left( \frac{1}{N}\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\mathbb{M}
_{1_{N}}\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\right) ^{-1}\right\Vert
=O_{a.s.}\left( 1\right) .
\end{equation}
Note now that, using ((ref)) \textquotedblleft in
reverse\textquotedblright , viz.
\begin{eqnarray}
\mathbf{{\Greekmath 010C} } &=&\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\mathbf{H}^{-1}\mathbf{-}
\frac{1}{N}\mathbf{{\Greekmath 010C} }\left( \frac{1}{T}\sum_{t=1}^{T}\widetilde{v}_{t}
\widetilde{\mathbf{u}}_{t}^{\prime }\right) \widehat{\mathbf{{\Greekmath 010C} }}^{PC}
\widehat{\Phi }^{-1}\mathbf{H}^{-1} \\
&&-\frac{1}{N}\left( \frac{1}{T}\sum_{t=1}^{T}\widetilde{\mathbf{u}}_{t}
\widetilde{v}_{t}^{\prime }\right) \mathbf{{\Greekmath 010C} }^{\prime }\widehat{\mathbf{
{\Greekmath 010C} }}^{PC}\widehat{\Phi }^{-1}\mathbf{H}^{-1} \notag \\
&&-\left[ \frac{1}{NT}\sum_{t=1}^{T}\widetilde{\mathbf{u}}_{t}\widetilde{
\mathbf{u}}_{t}^{\prime }\right] \widehat{\mathbf{{\Greekmath 010C} }}^{PC}\widehat{\Phi
}^{-1}\mathbf{H}^{-1}, \notag
\end{eqnarray}
we have
\begin{eqnarray*}
&&\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\mathbb{M}_{1_{N}}\mathbf{{\Greekmath 010C} } \\
&\mathbf{=}&\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\mathbb{M}_{1_{N}}\widehat{
\mathbf{{\Greekmath 010C} }}^{PC}\mathbf{H}^{-1}-\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }
\mathbb{M}_{1_{N}}\frac{1}{N}\mathbf{{\Greekmath 010C} }\left( \frac{1}{T}\sum_{t=1}^{T}
\widetilde{v}_{t}\widetilde{\mathbf{u}}_{t}^{\prime }\right) \widehat{
\mathbf{{\Greekmath 010C} }}^{PC}\widehat{\Phi }^{-1}\mathbf{H}^{-1} \\
&&-\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\mathbb{M}_{1_{N}}\frac{1}{N}\left(
\frac{1}{T}\sum_{t=1}^{T}\widetilde{\mathbf{u}}_{t}\widetilde{v}_{t}^{\prime
}\right) \mathbf{{\Greekmath 010C} }^{\prime }\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\widehat{
\Phi }^{-1}\mathbf{H}^{-1}-\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\mathbb{M}
_{1_{N}}\left[ \frac{1}{NT}\sum_{t=1}^{T}\widetilde{\mathbf{u}}_{t}
\widetilde{\mathbf{u}}_{t}^{\prime }\right] \widehat{\mathbf{{\Greekmath 010C} }}^{PC}
\widehat{\Phi }^{-1}\mathbf{H}^{-1}.
\end{eqnarray*}
Following exactly the same steps as in the proof of Lemma (ref), it
can be shown that
\begin{equation}
\frac{\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\mathbb{M}_{1_{N}}\mathbf{{\Greekmath 010C} }
}{N}\mathbf{=}\frac{\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\mathbb{M}_{1_{N}}
\widehat{\mathbf{{\Greekmath 010C} }}^{PC}}{N}\mathbf{H}^{-1}+o_{a.s.}\left( \frac{
\left( \log N\log T\right) ^{1+{\Greekmath 010F} }}{T^{1/2}}\right) +O\left( \frac{1}{
N}\right) ,
\end{equation}
so that, in ((ref))
\begin{equation*}
I=\mathbf{H}^{-1}{\Greekmath 0115} +o_{a.s.}\left( \frac{\left( \log N\log T\right)
^{1+{\Greekmath 010F} }}{T^{1/2}}\right) +O\left( \frac{1}{N}\right) .
\end{equation*}
Indeed, by the same token it also holds that
\begin{equation}
\frac{\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\mathbb{M}_{1_{N}}\mathbf{{\Greekmath 010C} }
}{N}\mathbf{=H}^{\prime }\mathbf{S}_{{\Greekmath 010C} }+o_{a.s.}\left( \frac{\left(
\log N\log T\right) ^{1+{\Greekmath 010F} }}{T^{1/2}}\right) +O\left( \frac{1}{N}
\right) =O_{a.s.}\left( 1\right) .
\end{equation}
Recalling that $\overline{v}=o_{a.s.}\left( T^{-1/2}\left( \log T\right)
^{1+{\Greekmath 010F} }\right) $, using ((ref)) and ((ref)
) it follows that
\begin{equation*}
II=o_{a.s.}\left( T^{-1/2}\left( \log T\right) ^{1+{\Greekmath 010F} }\right) .
\end{equation*}
Finally, we study
\begin{equation*}
\frac{\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\mathbb{M}_{1_{N}}\overline{
\mathbf{u}}}{N}=\mathbf{H}^{\prime }\frac{\mathbf{{\Greekmath 010C} }\mathbb{M}_{1_{N}}
\overline{\mathbf{u}}}{N}+\frac{\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-
\mathbf{{\Greekmath 010C} H}\right) ^{\prime }\mathbb{M}_{1_{N}}\overline{\mathbf{u}}}{N}
.
\end{equation*}
We already know from the proof of ((ref)) that
\begin{equation*}
\left\Vert \frac{\mathbf{{\Greekmath 010C} }^{\prime }\mathbb{M}_{1_{N}}\overline{
\mathbf{u}}}{N}\right\Vert =o_{a.s.}\left( \frac{\left( \log N\log T\right)
^{1+{\Greekmath 010F} }}{\sqrt{NT}}\right) .
\end{equation*}
Also, note that
\begin{equation*}
\left\vert \frac{\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}
\right) ^{\prime }\mathbb{M}_{1_{N}}\overline{\mathbf{u}}}{N}\right\vert
\leq \left\Vert \frac{\widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}}{
N^{1/2}}\right\Vert \left\Vert \frac{\mathbb{M}_{1_{N}}\overline{\mathbf{u}}
}{N^{1/2}}\right\Vert ;
\end{equation*}
we know from Lemma (ref) that
\begin{equation*}
\left\Vert \frac{\widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}}{N^{1/2}}
\right\Vert =o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{1+{\Greekmath 010F} }}{
T^{1/2}}\right) +O\left( \frac{1}{N}\right) ,
\end{equation*}
and, by standard passages
\begin{eqnarray*}
\left\Vert \frac{\mathbb{M}_{1_{N}}\overline{\mathbf{u}}}{N^{1/2}}
\right\Vert &\leq &\left\Vert \frac{\overline{\mathbf{u}}}{N^{1/2}}
\right\Vert +\frac{1}{N}N^{1/2}\left\vert \frac{\sum_{i=1}^{N}\overline{u}
_{i}}{N^{1/2}}\right\vert \\
&=&\frac{1}{N^{1/2}}\left( \sum_{i=1}^{N}\left( \frac{1}{T}
\sum_{t=1}^{T}u_{i,t}\right) ^{2}\right) ^{1/2}+\left\vert \frac{1}{NT}
\sum_{i=1}^{N}\sum_{t=1}^{T}u_{i,t}\right\vert \\
&=&o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{1+{\Greekmath 010F} }}{\sqrt{T}}
\right) +o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{1+{\Greekmath 010F} }}{
\sqrt{NT}}\right) .
\end{eqnarray*}
The final result follows by putting all together.
\end{proof}
lemmaWe assume that Assumptions (ref)-(ref),
and (ref)-(ref) are satisfied. Then it holds that, under
$\mathbb{H}_{A}$
\begin{equation*}
\widehat{{\Greekmath 0115} }^{PC}-\mathbf{H}^{-1}{\Greekmath 0115} =\frac{1}{N}\left( \mathbf{H}
^{\prime }\mathbf{S}_{{\Greekmath 010C} }\mathbf{H}\right) ^{-1}\mathbf{H}^{\prime }
\mathbf{{\Greekmath 010C} }^{\prime }\mathbb{M}_{1_{N}}\mathbf{{\Greekmath 010B} }+o_{a.s.}\left(
\frac{\left( \log T\log N\right) ^{1+{\Greekmath 010F} }}{T^{1/2}}\right) +O\left(
\frac{1}{N}\right) ,
\end{equation*}
for all ${\Greekmath 010F} >0$.
\begin{proof}
The proof follows by combining the arguments in Lemmas (ref) and
(ref).
\end{proof}
lemmaWe assume that Assumptions (ref)-(ref)
, and (ref)-(ref) are satisfied. Then it holds that
\begin{equation*}
\sum_{i=1}^{N}\left\Vert \widehat{{\Greekmath 010C} }_{i}^{PC}-\mathbf{H}^{\prime }{\Greekmath 010C}
_{i}\right\Vert ^{{\Greekmath 0117} /2}=o_{a.s.}\left( NT^{-{\Greekmath 0117} /4}\left( \log N\log
T\right) ^{\left( 1+{\Greekmath 010F} \right) {\Greekmath 0117} /2}\right) +O\left( N^{1-{\Greekmath 0117}
/2}\right) ,
\end{equation*}
for all ${\Greekmath 010F} >0$.
\begin{proof}
Using ((ref)), it holds that
\begin{eqnarray*}
&&\sum_{i=1}^{N}\left\Vert \widehat{{\Greekmath 010C} }_{i}^{PC}-\mathbf{H}^{\prime
}{\Greekmath 010C} _{i}\right\Vert ^{{\Greekmath 0117} /2} \\
&\leq &c_{0}\left\Vert \widehat{\Phi }^{-1}\right\Vert ^{{\Greekmath 0117} /2}\left\Vert
\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\right\Vert ^{{\Greekmath 0117} /2}\left\Vert \frac{1}{NT}
\sum_{t=1}^{T}\widetilde{\mathbf{u}}_{t}\widetilde{v}_{t}^{\prime
}\right\Vert ^{{\Greekmath 0117} /2}\sum_{i=1}^{N}\left\Vert {\Greekmath 010C} _{i}\right\Vert ^{{\Greekmath 0117}
/2} \\
&&+c_{0}\left\Vert \widehat{\Phi }^{-1}\right\Vert ^{{\Greekmath 0117} /2}\left\Vert
\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\right\Vert ^{{\Greekmath 0117} /2}\left\Vert \mathbf{{\Greekmath 010C} }
\right\Vert ^{{\Greekmath 0117} /2}\sum_{i=1}^{N}\left\Vert \frac{1}{NT}\sum_{t=1}^{T}
\widetilde{v}_{t}\widetilde{u}_{i,t}\right\Vert ^{{\Greekmath 0117} /2} \\
&&+c_{0}\left\Vert \widehat{\Phi }^{-1}\right\Vert ^{{\Greekmath 0117}
/2}\sum_{i=1}^{N}\left\Vert \frac{1}{NT}\sum_{t=1}^{T}\left( \widehat{
\mathbf{{\Greekmath 010C} }}^{PC}\right) ^{\prime }\widetilde{\mathbf{u}}_{t}\widetilde{u
}_{i,t}\right\Vert ^{{\Greekmath 0117} /2} \\
&=&I+II+III.
\end{eqnarray*}
We begin by noting that, by Lemma (ref), $\left\Vert \widehat{\Phi
}^{-1}\right\Vert ^{{\Greekmath 0117} /2}=O_{a.s.}\left( 1\right) $; further, $\left\Vert
\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\right\Vert ^{{\Greekmath 0117} /2}=c_{0}N^{{\Greekmath 0117} /4}$ by
construction, and $\left\Vert \mathbf{{\Greekmath 010C} }\right\Vert ^{{\Greekmath 0117}
/2}=c_{0}N^{{\Greekmath 0117} /4}$ by the identification restriction $\mathbf{{\Greekmath 010C} }
^{\prime }\mathbf{{\Greekmath 010C} }=N\mathbb{I}_{K}$. Finally, Assumption (ref) entails $\sum_{i=1}^{N}\left\Vert {\Greekmath 010C} _{i}\right\Vert ^{{\Greekmath 0117}
/2}=O\left( N\right) $. Consider now
\begin{equation*}
\left\Vert \frac{1}{NT}\sum_{t=1}^{T}\widetilde{\mathbf{u}}_{t}\widetilde{v}
_{t}^{\prime }\right\Vert ^{{\Greekmath 0117} /2}\leq \left\Vert \frac{1}{NT}\sum_{t=1}^{T}
\mathbf{u}_{t}v_{t}^{\prime }\right\Vert ^{{\Greekmath 0117} /2}+\left\Vert \frac{1}{N}
\overline{\mathbf{u}}\overline{v}\right\Vert ^{{\Greekmath 0117} /2}.
\end{equation*}
We know from the above that
\begin{equation*}
\left\Vert \frac{1}{NT}\sum_{t=1}^{T}\mathbf{u}_{t}v_{t}^{\prime
}\right\Vert =o_{a.s.}\left( N^{-1/2}T^{-1/2}\left( \log T\log N\right)
^{1+{\Greekmath 010F} }\right) ,
\end{equation*}
and therefore
\begin{equation*}
\left\Vert \frac{1}{NT}\sum_{t=1}^{T}\mathbf{u}_{t}v_{t}^{\prime
}\right\Vert ^{{\Greekmath 0117} /2}=o_{a.s.}\left( T^{-{\Greekmath 0117} /4}N^{-{\Greekmath 0117} /4}\left( \log
T\log N\right) ^{\left( 1+{\Greekmath 010F} \right) {\Greekmath 0117} /2}\right) .
\end{equation*}
Also, seeing as (as shown above) it holds that $\overline{v}=o_{a.s.}\left(
T^{-1/2}\left( \log T\right) ^{1+{\Greekmath 010F} }\right) $ and $\left\Vert
\overline{\mathbf{u}}\right\Vert =o_{a.s.}\left( N^{1/2}T^{-1/2}\left( \log
T\log N\right) ^{1+{\Greekmath 010F} }\right) $, we have
\begin{equation*}
\left\Vert \frac{1}{N}\overline{\mathbf{u}}\overline{v}\right\Vert ^{{\Greekmath 0117}
/2}=o_{a.s.}\left( T^{-{\Greekmath 0117} /2}N^{-{\Greekmath 0117} /4}\left( \log T\log N\right) ^{\left(
1+{\Greekmath 010F} \right) {\Greekmath 0117} /2}\right) .
\end{equation*}
Hence, combining all the results above, it follows that
\begin{equation*}
I=o_{a.s.}\left( NT^{-{\Greekmath 0117} /4}\left( \log T\log N\right) ^{\left( 1+{\Greekmath 010F}
\right) {\Greekmath 0117} /2}\right) .
\end{equation*}
Turning to $II$, note that
\begin{equation*}
\sum_{i=1}^{N}\left\Vert \frac{1}{NT}\sum_{t=1}^{T}\widetilde{v}_{t}
\widetilde{u}_{i,t}\right\Vert ^{{\Greekmath 0117} /2}\leq \sum_{i=1}^{N}\left\Vert \frac{1
}{NT}\sum_{t=1}^{T}v_{t}u_{i,t}\right\Vert ^{{\Greekmath 0117}
/2}+\sum_{i=1}^{N}\left\Vert \frac{1}{N}\overline{v}\overline{u}
_{i}\right\Vert ^{{\Greekmath 0117} /2}
\end{equation*}
with
\begin{equation*}
\sum_{i=1}^{N}\mathbb{E}\left\Vert \frac{1}{NT}\sum_{t=1}^{T}v_{t}u_{i,t}
\right\Vert ^{{\Greekmath 0117} /2}=c_{0}N^{1-{\Greekmath 0117} /2}T^{-{\Greekmath 0117} /4},
\end{equation*}
using Lemma (ref). Hence
\begin{equation*}
\sum_{i=1}^{N}\left\Vert \frac{1}{NT}\sum_{t=1}^{T}v_{t}u_{i,t}\right\Vert
^{{\Greekmath 0117} /2}=o_{a.s.}\left( N^{1-{\Greekmath 0117} /2}T^{-{\Greekmath 0117} /4}\left( \log N\log T\right)
^{2+{\Greekmath 010F} }\right) ,
\end{equation*}
and
\begin{equation*}
II=o_{a.s.}\left( NT^{-{\Greekmath 0117} /4}\left( \log N\log T\right) ^{2+{\Greekmath 010F}
}\right) .
\end{equation*}
Also, by exactly the same passages
\begin{equation*}
\mathbb{E}\sum_{i=1}^{N}\left\Vert \frac{1}{N}\overline{u}_{i}\right\Vert
^{{\Greekmath 0117} /2}=c_{0}N^{1-{\Greekmath 0117} /2}T^{-{\Greekmath 0117} /4},
\end{equation*}
and therefore
\begin{equation*}
II=o_{a.s.}\left( NT^{-{\Greekmath 0117} /4}\left( \log N\log T\right) ^{2+{\Greekmath 010F}
}\right) ,
\end{equation*}
so that $I$ dominated $II$. Finally, considering $III$ it holds that
\begin{equation*}
\sum_{i=1}^{N}\left\Vert \frac{1}{NT}\sum_{t=1}^{T}\left( \widehat{\mathbf{
{\Greekmath 010C} }}^{PC}\right) ^{\prime }\widetilde{\mathbf{u}}_{t}\widetilde{u}
_{i,t}\right\Vert ^{{\Greekmath 0117} /2}\leq \sum_{i=1}^{N}\left\Vert \frac{1}{NT}
\sum_{t=1}^{T}\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}\right) ^{\prime }\mathbf{
u}_{t}u_{i,t}\right\Vert ^{{\Greekmath 0117} /2}+\sum_{i=1}^{N}\left\Vert \frac{1}{NT}
\sum_{t=1}^{T}\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}\right) ^{\prime }
\overline{\mathbf{u}}\overline{u}_{i}\right\Vert ^{{\Greekmath 0117} /2}.
\end{equation*}
Consider
\begin{equation*}
\sum_{i=1}^{N}\left\Vert \frac{1}{NT}\sum_{t=1}^{T}\left( \widehat{\mathbf{
{\Greekmath 010C} }}^{PC}\right) ^{\prime }\widetilde{\mathbf{u}}_{t}u_{i,t}\right\Vert
^{{\Greekmath 0117} /2}\leq \sum_{i=1}^{N}\left\Vert \frac{1}{NT}\sum_{t=1}^{T}\left(
\widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right) ^{\prime }\mathbf{u}
_{t}u_{i,t}\right\Vert ^{{\Greekmath 0117} /2}+\sum_{i=1}^{N}\left\Vert \frac{1}{NT}
\sum_{t=1}^{T}\mathbf{H}^{\prime }\mathbf{{\Greekmath 010C} }^{\prime }\mathbf{u}
_{t}u_{i,t}\right\Vert ^{{\Greekmath 0117} /2}.
\end{equation*}
We have
\begin{equation*}
\sum_{i=1}^{N}\left\Vert \frac{1}{NT}\sum_{t=1}^{T}\left( \widehat{\mathbf{
{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right) ^{\prime }\mathbf{u}
_{t}u_{i,t}\right\Vert ^{{\Greekmath 0117} /2}\leq \left\Vert \widehat{\mathbf{{\Greekmath 010C} }}
^{PC}-\mathbf{{\Greekmath 010C} H}\right\Vert ^{{\Greekmath 0117} /2}\sum_{i=1}^{N}\left\Vert \frac{1}{
NT}\sum_{t=1}^{T}\mathbf{u}_{t}u_{i,t}\right\Vert ^{{\Greekmath 0117} /2}
\end{equation*}
with
\begin{equation*}
\sum_{i=1}^{N}\left\Vert \frac{1}{NT}\sum_{t=1}^{T}\mathbf{u}
_{t}u_{i,t}\right\Vert ^{{\Greekmath 0117} /2}\leq \sum_{i=1}^{N}\left\Vert \frac{1}{NT}
\sum_{t=1}^{T}\left( \mathbf{u}_{t}u_{i,t}-\mathbb{E}\left( \mathbf{u}
_{0}u_{i,0}\right) \right) \right\Vert ^{{\Greekmath 0117} /2}+\sum_{i=1}^{N}\left\Vert
\frac{1}{N}\mathbb{E}\left( \mathbf{u}_{0}u_{i,0}\right) \right\Vert ^{{\Greekmath 0117}
/2}.
\end{equation*}
It holds that
\begin{eqnarray*}
&&\left( NT\right) ^{-{\Greekmath 0117} /2}\sum_{i=1}^{N}\mathbb{E}\left\Vert
\sum_{t=1}^{T}\left( \mathbf{u}_{t}u_{i,t}-\mathbb{E}\left( \mathbf{u}
_{0}u_{i,0}\right) \right) \right\Vert ^{{\Greekmath 0117} /2} \\
&=&\left( NT\right) ^{-{\Greekmath 0117} /2}\sum_{i=1}^{N}\mathbb{E}\left(
\sum_{j=1}^{N}\left( \sum_{t=1}^{T}\left( u_{j,t}u_{i,t}-\mathbb{E}\left(
u_{j,0}u_{i,0}\right) \right) \right) ^{2}\right) ^{{\Greekmath 0117} /4} \\
&\leq &c_{0}\left( NT\right) ^{-{\Greekmath 0117} /2}N^{{\Greekmath 0117}
/4-1}\sum_{i=1}^{N}\sum_{j=1}^{N}\mathbb{E}\left( \sum_{t=1}^{T}\left(
u_{j,t}u_{i,t}-\mathbb{E}\left( u_{j,0}u_{i,0}\right) \right) \right) ^{{\Greekmath 0117}
/2}\leq c_{0}T^{-{\Greekmath 0117} /4}N^{1-{\Greekmath 0117} /4},
\end{eqnarray*}
and, since $\left\Vert \mathbb{E}\left( \mathbf{u}_{0}u_{i,0}\right)
\right\Vert \leq \left\Vert \mathbb{E}\left( \mathbf{u}_{0}u_{i,0}\right)
\right\Vert _{1}\leq c_{0}$
\begin{equation*}
\sum_{i=1}^{N}\left\Vert \frac{1}{N}\mathbb{E}\left( \mathbf{u}
_{0}u_{i,0}\right) \right\Vert ^{{\Greekmath 0117} /2}=O\left( N^{1-{\Greekmath 0117} /2}\right) .
\end{equation*}
Combining these results with Lemma (ref), it follows that
\begin{eqnarray*}
&&\sum_{i=1}^{N}\left\Vert \frac{1}{NT}\sum_{t=1}^{T}\left( \widehat{\mathbf{
{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right) ^{\prime }\mathbf{u}
_{t}u_{i,t}\right\Vert ^{{\Greekmath 0117} /2} \\
&=&o_{a.s.}\left[ \left( N^{{\Greekmath 0117} /4}T^{-{\Greekmath 0117} /4}\left( \log N\log T\right)
^{(1+{\Greekmath 010F} ){\Greekmath 0117} /2}+N^{-{\Greekmath 0117} /4}\right) \left( \left( T^{-{\Greekmath 0117} /4}N^{1-{\Greekmath 0117}
/4}\left( \log N\log T\right) ^{1+{\Greekmath 010F} }\right) +N^{1-{\Greekmath 0117} /2}\right)
\right] .
\end{eqnarray*}
Also note that
\begin{equation*}
\sum_{i=1}^{N}\left\Vert \frac{1}{NT}\sum_{t=1}^{T}\mathbf{H}^{\prime }
\mathbf{{\Greekmath 010C} }^{\prime }\mathbf{u}_{t}u_{i,t}\right\Vert ^{{\Greekmath 0117}
/2}=O_{a.s.}\left( 1\right) \sum_{i=1}^{N}\left\Vert \frac{1}{NT}
\sum_{t=1}^{T}\mathbf{{\Greekmath 010C} }^{\prime }\mathbf{u}_{t}u_{i,t}\right\Vert
^{{\Greekmath 0117} /2},
\end{equation*}
and
\begin{equation*}
\sum_{i=1}^{N}\left\Vert \frac{1}{NT}\sum_{t=1}^{T}\mathbf{{\Greekmath 010C} }^{\prime }
\mathbf{u}_{t}u_{i,t}\right\Vert ^{{\Greekmath 0117} /2}\leq \sum_{i=1}^{N}\left\Vert
\frac{1}{NT}\sum_{t=1}^{T}\mathbf{{\Greekmath 010C} }^{\prime }\left( \mathbf{u}
_{t}u_{i,t}-\mathbb{E}\left( \mathbf{u}_{0}u_{i,0}\right) \right)
\right\Vert ^{{\Greekmath 0117} /2}+\sum_{i=1}^{N}\left\Vert \frac{1}{NT}\sum_{t=1}^{T}
\mathbf{{\Greekmath 010C} }^{\prime }\mathbb{E}\left( \mathbf{u}_{0}u_{i,0}\right)
\right\Vert ^{{\Greekmath 0117} /2}
\end{equation*}
It is immediate to see that, by Assumption (ref)(vi)
\begin{equation*}
\sum_{i=1}^{N}\mathbb{E}\left\Vert \frac{1}{NT}\sum_{t=1}^{T}\mathbf{{\Greekmath 010C} }
^{\prime }\left( \mathbf{u}_{t}u_{i,t}-\mathbb{E}\left( \mathbf{u}
_{0}u_{i,0}\right) \right) \right\Vert ^{{\Greekmath 0117} /2}\leq c_{0}N\left( NT\right)
^{-{\Greekmath 0117} /4}.
\end{equation*}
Also
\begin{eqnarray*}
&&\sum_{i=1}^{N}\left\Vert \frac{1}{NT}\sum_{t=1}^{T}\mathbf{{\Greekmath 010C} }^{\prime
}\mathbb{E}\left( \mathbf{u}_{0}u_{i,0}\right) \right\Vert ^{{\Greekmath 0117} /2} \\
&=&\sum_{i=1}^{N}\left\Vert \frac{1}{N}\mathbf{{\Greekmath 010C} }^{\prime }\mathbb{E}
\left( \mathbf{u}_{0}u_{i,0}\right) \right\Vert ^{{\Greekmath 0117}
/2}=\sum_{i=1}^{N}\left\Vert \frac{1}{N}\sum_{j=1}^{N}{\Greekmath 010C} _{j}\mathbb{E}
\left( u_{j,0}u_{i,0}\right) \right\Vert ^{{\Greekmath 0117} /2} \\
&\leq &\sum_{i=1}^{N}\left\Vert \max_{1\leq j\leq N}\left\vert {\Greekmath 010C}
_{j}\right\vert \frac{1}{N}\sum_{j=1}^{N}\left\vert \mathbb{E}\left(
u_{j,0}u_{i,0}\right) \right\vert \right\Vert ^{{\Greekmath 0117} /2}\leq c_{0}N^{1-{\Greekmath 0117}
/2},
\end{eqnarray*}
by virtue of Assumption (ref)(iv). By the same logic
as above, it can be shown that the term $\sum_{i=1}^{N}\left\Vert \left(
NT\right) ^{-1}\sum_{t=1}^{T}\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}\right)
^{\prime }\overline{\mathbf{u}}\overline{u}_{i}\right\Vert ^{{\Greekmath 0117} /2}$\ is
dominated. Putting all together, the final result obtains.
\end{proof}
lemmaWe assume that Assumptions (ref)-(ref), and (ref)-(ref) are satisfied. Then it
holds that
\begin{eqnarray*}
\liminf_{\min \left\{ N,T\right\} \rightarrow \infty }\frac{1}{NT}
\sum_{i=1}^{N}\sum_{t=1}^{T}\left( \widehat{u}_{i,t}^{PC}\right) ^{2} &>&0,
\\
\limsup_{\min \left\{ N,T\right\} \rightarrow \infty }\frac{1}{NT}
\sum_{i=1}^{N}\sum_{t=1}^{T}\left( \widehat{u}_{i,t}^{PC}\right) ^{2}
&<&\infty .
\end{eqnarray*}
\begin{proof}
We let $K=1$ for simplicity and without loss of generality. Let $\widehat{
\mathbf{u}}_{t}^{PC}=\left( \widehat{u}_{1,t}^{PC},...,\widehat{u}
_{N,t}^{PC}\right) ^{\prime }$. It holds that
\begin{eqnarray*}
&&\widehat{\mathbf{u}}_{t}^{PC} \\
&=&\widetilde{\mathbf{y}}_{t}-\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\widehat{f}
_{t}^{PC}=\mathbf{{\Greekmath 010C} }\widetilde{v}_{t}+\widetilde{\mathbf{u}}_{t}-
\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\widehat{f}_{t}^{PC} \\
&=&\mathbf{{\Greekmath 010C} }\widetilde{v}_{t}+\widetilde{\mathbf{u}}_{t}-\frac{1}{N}
\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\left(
\mathbf{{\Greekmath 010C} }\widetilde{v}_{t}+\widetilde{\mathbf{u}}_{t}\right) \\
&=&\mathbf{{\Greekmath 010C} }\widetilde{v}_{t}+\widetilde{\mathbf{u}}_{t}-\frac{1}{N}
\left[ \mathbf{{\Greekmath 010C} H+}\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H
}\right) \right] \widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\left[ \widehat{
\mathbf{{\Greekmath 010C} }}^{PC}\mathbf{H}^{-1}+\mathbf{{\Greekmath 010C} -}\widehat{\mathbf{{\Greekmath 010C} }
}^{PC}\mathbf{H}^{-1}\right] \widetilde{v}_{t} \\
&&-\frac{1}{N}\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\mathbf{H}^{\prime }\mathbf{
{\Greekmath 010C} }^{\prime }\widetilde{\mathbf{u}}_{t}-\frac{1}{N}\widehat{\mathbf{
{\Greekmath 010C} }}^{PC}\left[ \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right]
^{\prime }\widetilde{\mathbf{u}}_{t} \\
&=&\widetilde{\mathbf{u}}_{t}-\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{
{\Greekmath 010C} H}\right) \mathbf{H}^{-1}\widetilde{v}_{t}-\frac{1}{N}\mathbf{{\Greekmath 010C} H}
\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\left( \mathbf{{\Greekmath 010C} -}\widehat{\mathbf{
{\Greekmath 010C} }}^{PC}\mathbf{H}^{-1}\right) \widetilde{v}_{t} \\
&&-\frac{1}{N}\left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right)
\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\left( \mathbf{{\Greekmath 010C} -}\widehat{\mathbf{
{\Greekmath 010C} }}^{PC}\mathbf{H}^{-1}\right) \widetilde{v}_{t}-\frac{1}{N}\widehat{
\mathbf{{\Greekmath 010C} }}^{PC}\mathbf{H}^{\prime }\mathbf{{\Greekmath 010C} }^{\prime }\widetilde{
\mathbf{u}}_{t} \\
&&-\frac{1}{N}\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\left[ \widehat{\mathbf{{\Greekmath 010C} }}
^{PC}-\mathbf{{\Greekmath 010C} H}\right] ^{\prime }\widetilde{\mathbf{u}}_{t}.
\end{eqnarray*}
We bound the following terms:
\begin{eqnarray*}
&&\frac{1}{NT}\sum_{t=1}^{T}\left\Vert \left( \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-
\mathbf{{\Greekmath 010C} H}\right) \mathbf{H}^{-1}\widetilde{v}_{t}\right\Vert ^{2} \\
&\leq &c_{0}\left( \frac{1}{T}\sum_{t=1}^{T}\widetilde{v}_{t}^{2}\right)
\frac{\left\Vert \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right\Vert
^{2}}{N}=o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{2+{\Greekmath 010F} }}{T}
\right) +O\left( \frac{1}{N^{2}}\right) ,
\end{eqnarray*}
by Lemma (ref);
\begin{eqnarray*}
&&\frac{1}{NT}\sum_{t=1}^{T}\left\Vert \frac{1}{N}\mathbf{{\Greekmath 010C} H}\widehat{
\mathbf{{\Greekmath 010C} }}^{PC\prime }\left( \mathbf{{\Greekmath 010C} -}\widehat{\mathbf{{\Greekmath 010C} }}
^{PC}\mathbf{H}^{-1}\right) \widetilde{v}_{t}\right\Vert ^{2} \\
&\leq &c_{0}\left( \frac{1}{T}\sum_{t=1}^{T}\widetilde{v}_{t}^{2}\right)
\frac{\left\Vert \mathbf{{\Greekmath 010C} }\right\Vert ^{2}}{N}\frac{\left\Vert
\widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime }\right\Vert ^{2}}{N}\frac{\left\Vert
\mathbf{{\Greekmath 010C} -}\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\mathbf{H}^{-1}\right\Vert ^{2}
}{N} \\
&=&o_{a.s.}\left( \frac{\left( \log N\log T\right) ^{2+{\Greekmath 010F} }}{T}\right)
+O\left( \frac{1}{N^{2}}\right) ,
\end{eqnarray*}
again using Lemma (ref);
\begin{eqnarray*}
&&\frac{1}{NT}\sum_{t=1}^{T}\left\Vert \frac{1}{N}\left( \widehat{\mathbf{
{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right) \widehat{\mathbf{{\Greekmath 010C} }}^{PC\prime
}\left( \mathbf{{\Greekmath 010C} -}\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\mathbf{H}^{-1}\right)
\widetilde{v}_{t}\right\Vert ^{2} \\
&\leq &c_{0}\left( \frac{1}{T}\sum_{t=1}^{T}\widetilde{v}_{t}^{2}\right)
\left( \frac{\left\Vert \mathbf{{\Greekmath 010C} -}\widehat{\mathbf{{\Greekmath 010C} }}^{PC}
\mathbf{H}^{-1}\right\Vert ^{2}}{N}\right) ^{2}\frac{\left\Vert \widehat{
\mathbf{{\Greekmath 010C} }}^{PC\prime }\right\Vert ^{2}}{N},
\end{eqnarray*}
and therefore it is dominated by the previous terms;
\begin{equation*}
\mathbb{E}\frac{1}{NT}\sum_{t=1}^{T}\left\Vert \frac{1}{N}\widehat{\mathbf{
{\Greekmath 010C} }}^{PC}\mathbf{H}^{\prime }\mathbf{{\Greekmath 010C} }^{\prime }\widetilde{\mathbf{
u}}_{t}\right\Vert ^{2}\leq c_{0}\frac{1}{N^{2}T}\sum_{t=1}^{T}\mathbb{E}
\left( \sum_{j=1}^{N}{\Greekmath 010C} _{j}\widetilde{u}_{j,t}\right) ^{2}\leq
c_{1}N^{-1},
\end{equation*}
so that this term is bounded by $o_{a.s.}\left( N^{-1}\left( \log T\log
^{2}N\right) ^{2+{\Greekmath 010F} }\right) $;
\begin{eqnarray*}
&&\frac{1}{NT}\sum_{t=1}^{T}\left\Vert \frac{1}{N}\widehat{\mathbf{{\Greekmath 010C} }}
^{PC}\left[ \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right] ^{\prime }
\widetilde{\mathbf{u}}_{t}\right\Vert ^{2} \\
&=&\frac{1}{N^{3}T}\sum_{t=1}^{T}\widetilde{\mathbf{u}}_{t}^{\prime }\left[
\widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right] \widehat{\mathbf{
{\Greekmath 010C} }}^{PC\prime }\widehat{\mathbf{{\Greekmath 010C} }}^{PC}\left[ \widehat{\mathbf{
{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right] ^{\prime }\widetilde{\mathbf{u}}_{t} \\
&=&\frac{1}{N^{2}T}\sum_{t=1}^{T}\widetilde{\mathbf{u}}_{t}^{\prime }\left[
\widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right] \left[ \widehat{
\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right] ^{\prime }\widetilde{\mathbf{u}
}_{t} \\
&\leq &\left( \frac{1}{NT}\sum_{t=1}^{T}\left\Vert \widetilde{\mathbf{u}}
_{t}\right\Vert ^{2}\right) \frac{\left\Vert \mathbf{{\Greekmath 010C} -}\widehat{
\mathbf{{\Greekmath 010C} }}^{PC}\mathbf{H}^{-1}\right\Vert ^{2}}{N};
\end{eqnarray*}
it is not hard to see that
\begin{equation*}
\frac{1}{NT}\sum_{t=1}^{T}\left\Vert \widetilde{\mathbf{u}}_{t}\right\Vert
^{2}=\frac{1}{NT}\sum_{t=1}^{T}\mathbb{E}\left( \sum_{i=1}^{N}\widetilde{u}
_{i,t}^{2}\right) =O_{a.s.}\left( 1\right) ,
\end{equation*}
and therefore
\begin{equation*}
\frac{1}{NT}\sum_{t=1}^{T}\left\Vert \frac{1}{N}\widehat{\mathbf{{\Greekmath 010C} }}
^{PC}\left[ \widehat{\mathbf{{\Greekmath 010C} }}^{PC}-\mathbf{{\Greekmath 010C} H}\right] ^{\prime }
\widetilde{\mathbf{u}}_{t}\right\Vert ^{2}=o_{a.s.}\left( \frac{\left( \log
N\log T\right) ^{2+{\Greekmath 010F} }}{T}\right) +o_{a.s.}\left( \frac{\left( \log
T\log ^{2}N\right) ^{2+{\Greekmath 010F} }}{N}\right) .
\end{equation*}
After some algebra and repeated use of the Cauchy-Schwartz inequality, the
above entails that
\begin{equation*}
\widehat{s}_{NT}^{PC}=\frac{1}{NT}\sum_{t=1}^{T}\left\Vert \widehat{\mathbf{u
}}_{t}^{PC}\right\Vert ^{2}=\frac{1}{NT}\sum_{t=1}^{T}\left\Vert \widetilde{
\mathbf{u}}_{t}\right\Vert ^{2}+o_{a.s.}\left( \frac{\left( \log N\log
T\right) ^{2+{\Greekmath 010F} }}{T}\right) +O\left( \frac{1}{N^{2}}\right) .
\end{equation*}
From hereon, the proof follows by similar arguments as above.
\end{proof}
lemmaWe assume that Assumptions (ref)-(ref), and
(ref)-(ref) are satisfied. Then it holds that
\begin{equation*}
\sum_{i=1}^{N}{\Greekmath 0120} _{i,NT}^{PC}=o_{a.s.}\left( 1\right) .
\end{equation*}
\begin{proof}
The proof is essentially the same as the proof of Lemmas (ref) and (ref), and we simply discuss the different parts.
Under both $\mathbb{H}_{0}$ and $\mathbb{H}_{A}$, it holds that
\begin{equation}
\widehat{{\Greekmath 010B} }_{i}^{PC}={\Greekmath 010B} _{i}+{\Greekmath 010C} _{i}^{\prime }\overline{v}+
\overline{u}_{i}-\left( \widehat{{\Greekmath 010C} }_{i}-\mathbf{H}^{\prime }{\Greekmath 010C}
_{i}\right) ^{\prime }{\Greekmath 0115} -{\Greekmath 010C} _{i}^{\prime }\mathbf{H}\left( \widehat{
{\Greekmath 0115} }-\mathbf{H}^{-1}{\Greekmath 0115} \right) -\left( \widehat{{\Greekmath 010C} }_{i}-
\mathbf{H}^{\prime }{\Greekmath 010C} _{i}\right) ^{\prime }\left( \widehat{{\Greekmath 0115} }-
\mathbf{H}^{-1}{\Greekmath 0115} \right) .
\end{equation}
Under $\mathbb{H}_{0}$ we have
\begin{eqnarray*}
&&\sum_{i=1}^{N}{\Greekmath 0120} _{i,NT}^{PC} \\
&=&\frac{C_{NT}^{1/2}}{\left\vert \widehat{s}_{NT}^{PC}\right\vert ^{{\Greekmath 0117} /2}}
\sum_{i=1}^{N}\left\vert \widehat{{\Greekmath 010B} }_{i}^{PC}\right\vert ^{{\Greekmath 0117} /2} \\
&\leq &c_{0}\left[ \frac{C _{NT}^{1/2}}{\left\vert \widehat{s}
_{NT}^{PC}\right\vert ^{{\Greekmath 0117} /2}}\left( \sum_{i=1}^{N}\left\Vert {\Greekmath 010C}
_{i}\right\Vert ^{{\Greekmath 0117} /2}\right) \left\Vert \overline{v}\right\Vert ^{{\Greekmath 0117}
/2}+\frac{C _{NT}^{1/2}}{\left\vert \widehat{s}_{NT}^{PC}\right\vert ^{{\Greekmath 0117}
/2}}\sum_{i=1}^{N}\left\vert \overline{u}_{i}\right\vert ^{{\Greekmath 0117} /2}+\frac{
C_{NT}^{1/2}}{\left\vert \widehat{s}_{NT}^{PC}\right\vert ^{{\Greekmath 0117} /2}}\left(
\sum_{i=1}^{N}\left\Vert \widehat{{\Greekmath 010C} }_{i}-\mathbf{H}^{\prime }{\Greekmath 010C}
_{i}\right\Vert ^{{\Greekmath 0117} /2}\right) \left\Vert {\Greekmath 0115} \right\Vert ^{{\Greekmath 0117}
/2}\right. \\
&&\left. +\frac{C _{NT}^{1/2}}{\left\vert \widehat{s}_{NT}^{PC}\right\vert
^{{\Greekmath 0117} /2}}\left( \sum_{i=1}^{N}\left\Vert {\Greekmath 010C} _{i}\right\Vert ^{{\Greekmath 0117}
/2}\right) \left\Vert \widehat{{\Greekmath 0115} }-\mathbf{H}^{-1}{\Greekmath 0115} \right\Vert
^{{\Greekmath 0117} /2}+\frac{C _{NT}^{1/2}}{\left\vert \widehat{s}_{NT}^{PC}\right\vert
^{{\Greekmath 0117} /2}}\left( \sum_{i=1}^{N}\left\Vert \widehat{{\Greekmath 010C} }_{i}-\mathbf{H}
^{\prime }{\Greekmath 010C} _{i}\right\Vert ^{{\Greekmath 0117} /2}\right) \left\Vert \widehat{{\Greekmath 0115}
}-\mathbf{H}^{-1}{\Greekmath 0115} \right\Vert ^{{\Greekmath 0117} /2}\right] \\
&=&I+II+III+IV+V.
\end{eqnarray*}
Starting from Lemmas (ref) and (ref), we can
show that $I$, $II$ and $IV$ are $o_{a.s.}(1)$ proceeding as in the proof of
Lemma (ref) - indeed, on account of Lemma (ref) $IV$ contains
the extra term
\begin{equation*}
\frac{C_{NT}^{1/2}}{\left\vert \widehat{s}_{NT}^{PC}\right\vert ^{{\Greekmath 0117} /2}}
\left( \sum_{i=1}^{N}\left\Vert {\Greekmath 010C} _{i}\right\Vert ^{{\Greekmath 0117} /2}\right)
O\left( N^{-{\Greekmath 0117} /2}\right) =O\left(C _{NT}N^{1-{\Greekmath 0117} /2}\right) ,
\end{equation*}
but this can be shown to be $o(1)$ by routine calculations. As far as $III$
is concerned, Assumption (ref), and Lemmas (ref)-(ref) imply, after some algebra
\begin{equation*}
III=C _{NT}^{1/2}\left\{ o_{a.s.}\left( NT^{-{\Greekmath 0117} /4}\left( \log N\log
T\right) ^{\left( 1+{\Greekmath 010F} \right) {\Greekmath 0117} /2}\right) +O\left( N^{1-{\Greekmath 0117}
/2}\right) \right\} =o_{a.s.}(1),
\end{equation*}
where recall ${\Greekmath 0117} \geq 4$. That $V=o_{a.s.}(1)$ readily follows from Lemma (ref) and the result on $III$.
\end{proof}
\setcounter{equation}{0} \setcounter{lemma}{0} \setcounter{theorem}{0}
Proofs
proof[Proof of Theorem (ref)]
We begin by proving ((ref)). The proof follows a similar approach to
the proof of Theorem 3 in he2024online, which we refine.
To begin with, note that, for all $-\infty <x<\infty $
\begin{equation*}
\mathbb{P}^{\ast }\left( \frac{Z_{N,T}-b_{N}}{a_{N}}\leq x\right) =P^{\ast
}\left( Z_{N,T}\leq a_{N}x+b_{N}\right) ,
\end{equation*}
where recall that $z_{i,NT}={\Greekmath 0120} _{i,NT}+{\Greekmath 0121} _{i}$. Seeing as ${\Greekmath 0121}
_{i} $ is, by construction, independent across $i$ and independent of the
sample, it follows that
\begin{equation*}
\mathbb{P}^{\ast }\left( Z_{N,T}\leq a_{N}x+b_{N}\right)
=\mathop{ \prod }\limits_{i=1}^{N}\mathbb{P}^{\ast }\left( z_{i,NT}\leq
a_{N}x+b_{N}\right) =\mathop{ \prod }\limits_{i=1}^{N}\mathbb{P}^{\ast }\left( {\Greekmath 0121}
_{i}\leq a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right) .
\end{equation*}
Let $\Phi \left( \cdot \right) $ denote the standard normal distribution; we
have
\begin{equation}
\mathop{ \prod }\limits_{i=1}^{N}\mathbb{P}^{\ast }\left( {\Greekmath 0121} _{i}\leq
a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right) =\exp \left( \sum_{i=1}^{N}\log \Phi \left(
a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right) \right) .
\end{equation}
Note now that
\begin{equation}
\log \Phi \left( a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right) =\log \Phi \left(
a_{N}x+b_{N}\right) +\log \frac{\Phi \left( a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right)
}{\Phi \left( a_{N}x+b_{N}\right) };
\end{equation}
using Lagrange's theorem, there exists an $a_{i}^{\ast }\in \left(
a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT},a_{N}x+b_{N}\right) $ such that $\Phi \left(
a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right) $ $=$ $\Phi \left( a_{N}x+b_{N}\right) $ $-$
${\Greekmath 0127} \left( a_{i}^{\ast }\right) {\Greekmath 0120}_{i,NT}$, where ${\Greekmath 0127} \left(
\cdot \right) $ denotes the density function of the standard normal, so that
ultimately
\begin{equation*}
\log \frac{\Phi \left( a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right) }{\Phi \left(
a_{N}x+b_{N}\right) }=\log \left( 1-\frac{{\Greekmath 0127} \left( a_{i}^{\ast
}\right) }{\Phi \left( a_{N}x+b_{N}\right) }{\Greekmath 0120} _{i,NT}\right) =\log \left(
1-c_{i}{\Greekmath 0120} _{i,NT}\right) .
\end{equation*}
By elementary arguments, it follows that
\begin{eqnarray*}
&&\exp \left( \sum_{i=1}^{N}\log \frac{\Phi \left( a_{N}x+b_{N}-{\Greekmath 0120}
_{i,NT}\right) }{\Phi \left( a_{N}x+b_{N}\right) }\right) \\
&=&\exp \left( \sum_{i=1}^{N}\log \left( 1-c_{i}{\Greekmath 0120}_{i,NT}\right) \right) =
\exp \left(\frac{N}{N}\log\left(\mathop{ \prod }_{i=1}^{N}\left(1 -
c_{i}{\Greekmath 0120}_{i,NT}\right)\right)\right) \\
&\leq &\exp \left( N\log \left( \frac{1}{N}\sum_{i=1}^{N}\left(1-c_{i}
{\Greekmath 0120}_{i,T}\right) \right) \right)=\exp \left( N\log \left( 1-\left( \frac{1}{
N}\sum_{i=1}^{N}c_{i}{\Greekmath 0120}_{i,NT}\right) \right) \right) \\
&=&\exp \left( \sum_{h=1}^{\infty }N^{-h+1}\frac{\left(-1\right) ^{h}\left(
\sum_{i=1}^{N}c_{i}{\Greekmath 0120} _{i,NT}\right) ^{h}}{h}\right),
\end{eqnarray*}
having used the arithmetic/geometric mean inequality to move from the second
to the third line, and a Taylor expansion of $\log(1+x)$ around $x=0$ in the
last line. Since $c_{i}\leq \left( 2{\Greekmath 0119} \right) ^{-1/2}\left[ \Phi
\left(a_{N}x+b_{N}\right) \right] ^{-1}\leq \overline{c}$, and, by Lemma (ref),
\begin{equation*}
\mathbb{P}\left( {\Greekmath 0121} :\lim_{\min \left\{ N,T\right\} \rightarrow \infty
}\sum_{i=1}^{N}{\Greekmath 0120} _{i,NT}=0\right) =1,
\end{equation*}
we can assume that $\lim_{\min \left\{ N,T\right\} \rightarrow \infty
}\sum_{i=1}^{N}{\Greekmath 0120} _{i,NT}=0$, it follows from elementary arguments that
\begin{equation}
\lim_{\min \left\{ N,T\right\} \rightarrow \infty }\exp \left(
\sum_{i=1}^{N}\log \frac{\Phi \left( a_{N}x+b_{N}-{\Greekmath 0120}_{i,NT}\right) }{\Phi
\left( a_{N}x+b_{N}\right) }\right) =1.
\end{equation}
Thus we have
\begin{eqnarray}
&&\lim_{\min \left\{ N,T\right\} \rightarrow \infty
}\mathop{ \prod }\limits_{i=1}^{N}P^{\ast }\left( {\Greekmath 0121} _{i}\leq
a_{N}x+b_{N}-{\Greekmath 0120}_{i,NT}\right) \\
&=&\left( \lim_{N\rightarrow \infty }\Phi ^{N}\left( a_{N}x+b_{N}\right)
\right) \times \left( \lim_{\min \left\{ N,T\right\} \rightarrow \infty
}\exp \left( \sum_{i=1}^{N}\log \frac{\Phi \left( a_{N}x+b_{N}-{\Greekmath 0120}
_{i,T}\right) }{\Phi \left( a_{N}x+b_{N}\right) }\right) \right) \\
&=&\exp \left( -\exp \left( -x\right) \right) ,
\end{eqnarray}
using the relations in (ref) - (ref) to move
from the first to the second line, and the Fisher--Tippett--Gnedenko Theorem
(see Theorem 3.2.3 in embrechts2013modelling, among others) along
with the limit in ((ref)) to obtain the final result.
We now turn to showing ((ref)). Under the alternative, there exists a
set of $1\leq m\leq N$ indices $\mathcal{I}=\left\{ i_{1},\dots
,i_{m}\right\} \subseteq \left\{ 1,\dots ,N\right\} $ such that $\left\vert
{\Greekmath 010B} _{i}\right\vert >0$ whenever $i\in \mathcal{I}$; in these cases, $
{\Greekmath 0120} _{i,NT}$ diverges almost surely at the rate $T^{1/2}$, i.e.
\begin{equation*}
T^{-1/2}{\Greekmath 0120} _{i,NT}\overset{a.s.}{\rightarrow }c>0\relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{ whenever }i\in
\mathcal{I}\relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{.}
\end{equation*}
Hence, we can assume that
\begin{equation*}
\lim_{T\rightarrow \infty }T^{-1/2}{\Greekmath 0120} _{i,NT}=c>0,
\end{equation*}
whenever $i\in \mathcal{I}$. Note now that, for any $-\infty <x<\infty $ we
have
\begin{equation*}
\begin{aligned} P^{\ast }\left( Z_{N,T}\leq a_{N}x+b_{N}\right)&
=\mathop{ \prod }\limits_{i=1}^{N}P^{\ast }\left( z_{i,T}\leq
a_{N}x+b_{N}\right)\leq\mathop{ \prod }\limits_{i\in\mathcal{I}}P^{\ast }\left( {\Greekmath 0121}
_{i}\leq a_{N}x+b_{N}-{\Greekmath 0120}_{i,NT}\right)\\ & =
\mathop{ \prod }_{i\in\mathcal{I}}\Phi\left(a_{N}x+b_{N} - {\Greekmath 0120}_{i,NT} \right).
\end{aligned}
\end{equation*}
Equation (5) in borjesson1979simple entails that
\begin{equation}
\Phi \left( a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right) \leq \frac{\mathrm{exp}\left( -
\frac{1}{2}\left( a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right) ^{2}\right) }{\sqrt{2{\Greekmath 0119} }
\left\vert a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right\vert }.
\end{equation}
Seeing as, by construction, $a_{N}x+b_{N}=O(\sqrt{2\log N})$\ for each $
-\infty <x<\infty $, by Assumption (ref) it follows that $
a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\overset{a.s.}{\rightarrow }-\infty $ whenever $
i\in \mathcal{I}$. Hence, as $\min \left\{ N,T\right\} \rightarrow \infty $
it holds that
\begin{equation*}
0\leq \Phi \left( a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right) \leq \frac{\mathrm{exp}
\left( -\frac{1}{2}\left( a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right) ^{2}\right) }{
\sqrt{2{\Greekmath 0119} }\left\vert a_{N}x+b_{N}-{\Greekmath 0120} _{i,NT}\right\vert }\overset{a.s.}{
\rightarrow }0,
\end{equation*}
which, by dominated convergence, entails that $\Phi \left( a_{N}x+b_{N}-{\Greekmath 0120}
_{i,T}\right) =o_{a.s.}(1)$. As long as $\mathcal{I}$ is not empty, this
immediately entails that
\begin{equation*}
\lim_{\min \left\{ N,T\right\} \rightarrow \infty }\mathbb{P}^{\ast }\left(
Z_{N,T}\leq a_{N}x+b_{N}\right) =0,
\end{equation*}
for almost all realisations of $\left\{ \left( u_{i,t},f_{t}^{\prime
}\right) ^{\prime },1\leq i\leq N,1\leq t\leq T\right\} $.
In conclusion, we note that the theorem still holds, with the proof
virtually unchanged for the more general statistic in (ref). The
only difference consists in replacing $T^{-1/2}$ with $T^{-{\Greekmath 010E} {\Greekmath 0117} /2}$
when discussing the behavior under the alternative. No further calculations
or arguments are required with respect to the current proof.
proof[Proof of Theorem (ref)]
Write, for short, $Q_{N,T,B}\left( {\Greekmath 011C} \right) =Q_{{\Greekmath 011C} }$. Recall
\begin{equation*}
Q_{{\Greekmath 011C} }=\frac{1}{B}\sum_{b=1}^{B}\mathbb{I}\left( Z_{N,T}^{\left( b\right)
}\leq c_{{\Greekmath 011C} }\right) ,
\end{equation*}
and let $X_{N,T}^{\left( b\right) }=\mathbb{I}\left( Z_{N,T}^{\left(
b\right) }\leq c_{{\Greekmath 011C} }\right) $ for short. Note that, by similar passages
as in the proof of Theorem (ref)
\begin{eqnarray}
&&\mathbb{E}^{\ast }\left( X_{N,T}^{\left( b\right) }\right) \\
&=&\mathbb{P}^{\ast }\left( Z_{N,T}^{\left( b\right) }\leq c_{{\Greekmath 011C} }\right)
=\mathop{ \prod }\limits_{i=1}^{N}\mathbb{P}^{\ast }\left( {\Greekmath 0121} _{i}^{\left(
b\right) }\leq c_{{\Greekmath 011C} }-{\Greekmath 0120} _{i,NT}\right) \notag \\
&=&\exp \left( \sum_{i=1}^{N}\log \mathbb{P}^{\ast }\left( {\Greekmath 0121}
_{i}^{\left( b\right) }\leq c_{{\Greekmath 011C} }-{\Greekmath 0120} _{i,NT}\right) \right) \notag \\
&=&\exp \left( \sum_{i=1}^{N}\log \left[ \mathbb{P}^{\ast }\left( {\Greekmath 0121}
_{i}^{\left( b\right) }\leq c_{{\Greekmath 011C} }\right) \left( 1-\frac{\mathbb{P}^{\ast
}\left( c_{{\Greekmath 011C} }-{\Greekmath 0120} _{i,NT}\leq {\Greekmath 0121} _{i}^{\left( b\right) }\leq
c_{{\Greekmath 011C} }\right) }{\mathbb{P}^{\ast }\left( {\Greekmath 0121} _{i}^{\left( b\right)
}\leq c_{{\Greekmath 011C} }\right) }\right) \right] \right) \notag \\
&=&\exp \left( \sum_{i=1}^{N}\log \mathbb{P}^{\ast }\left( {\Greekmath 0121}
_{i}^{\left( b\right) }\leq c_{{\Greekmath 011C} }\right) -c_{0}\sum_{i=1}^{N}\mathbb{P}
^{\ast }\left( c_{{\Greekmath 011C} }-{\Greekmath 0120} _{i,NT}\leq {\Greekmath 0121} _{i}^{\left( b\right) }\leq
c_{{\Greekmath 011C} }\right) \right) \notag \\
&=&\exp \left( \sum_{i=1}^{N}\log \mathbb{P}^{\ast }\left( {\Greekmath 0121}
_{i}^{\left( b\right) }\leq c_{{\Greekmath 011C} }\right) \right) \exp \left(
-c_{1}\sum_{i=1}^{N}{\Greekmath 0120} _{i,NT}\right) \notag
\end{eqnarray}
for some positive, finite constants $c_{0}$ and $c_{1}$, and having used the
fact that ${\Greekmath 0120} _{i,NT}$ implies $\mathbb{P}^{\ast }\left( {\Greekmath 0121}
_{i}^{\left( b\right) }\leq c_{{\Greekmath 011C} }-{\Greekmath 0120} _{i,NT}\right) =\mathbb{P}^{\ast
}\left( {\Greekmath 0121} _{i}^{\left( b\right) }\leq c_{{\Greekmath 011C} }\right) -\mathbb{P}
^{\ast }\left( c_{{\Greekmath 011C} }-{\Greekmath 0120} _{i,NT}\leq {\Greekmath 0121} _{i}^{\left( b\right) }\leq
c_{{\Greekmath 011C} }\right) $ to move from the fourth to the fifth line.
We now start by showing ((ref)). It holds that
\begin{eqnarray}
\left\vert \frac{Q_{{\Greekmath 011C} }-\left( 1-{\Greekmath 011C} \right) }{\sqrt{{\Greekmath 011C} \left( 1-{\Greekmath 011C}
\right) }}\right\vert &=&\left\vert \frac{Q_{{\Greekmath 011C} }-\left( 1-{\Greekmath 011C} \right) }{
\left( \mathcal{V}^{\ast }\left( Q_{{\Greekmath 011C} }\right) \right) ^{1/2}}\right\vert
\frac{\left( \mathcal{V}^{\ast }\left( Q_{{\Greekmath 011C} }\right) \right) ^{1/2}}{
\sqrt{{\Greekmath 011C} \left( 1-{\Greekmath 011C} \right) }} \\
&=&\left\vert \frac{Q_{{\Greekmath 011C} }-\mathbb{E}^{\ast }\left( Q_{{\Greekmath 011C} }\right) }{
\left( \mathcal{V}^{\ast }\left( Q_{{\Greekmath 011C} }\right) \right) ^{1/2}}\right\vert
\frac{\left( \mathcal{V}^{\ast }\left( Q_{{\Greekmath 011C} }\right) \right) ^{1/2}}{
\sqrt{{\Greekmath 011C} \left( 1-{\Greekmath 011C} \right) }}+\left\vert \frac{\mathbb{E}^{\ast
}\left( Q_{{\Greekmath 011C} }\right) -\left( 1-{\Greekmath 011C} \right) }{\left( \mathcal{V}^{\ast
}\left( Q_{{\Greekmath 011C} }\right) \right) ^{1/2}}\right\vert \frac{\left( \mathcal{V}
^{\ast }\left( Q_{{\Greekmath 011C} }\right) \right) ^{1/2}}{\sqrt{{\Greekmath 011C} \left( 1-{\Greekmath 011C}
\right) }} \notag \\
&=&I+II, \notag
\end{eqnarray}
where $\mathcal{V}^{\ast }\left( Q_{{\Greekmath 011C} }\right) $ denotes the variance of $
Q_{{\Greekmath 011C} }$ conditional on the sample, with
\begin{equation*}
\mathcal{V}^{\ast }\left( Q_{{\Greekmath 011C} }\right) =\mathbb{E}^{\ast }\left(
X_{N,T}^{\left( b\right) }\right) \left[ 1-\mathbb{E}^{\ast }\left(
X_{N,T}^{\left( b\right) }\right) \right] .
\end{equation*}
Let
\begin{equation*}
B\frac{Q_{{\Greekmath 011C} }-\mathbb{E}^{\ast }\left( Q_{{\Greekmath 011C} }\right) }{\left( \mathcal{
V}^{\ast }\left( Q_{{\Greekmath 011C} }\right) \right) ^{1/2}}=\sum_{b=1}^{B}\frac{
X_{N,T}^{\left( b\right) }-\mathbb{E}^{\ast }\left( Q_{{\Greekmath 011C} }\right) }{
\left( \mathcal{V}^{\ast }\left( Q_{{\Greekmath 011C} }\right) \right) ^{1/2}}
=\sum_{b=1}^{B}{\Greekmath 011F} _{b},
\end{equation*}
where ${\Greekmath 011F} _{b}$, conditionally on the sample, is i.i.d. with zero
mean and unit variance and - being uniformly distributed - has a finite
moment generating function in a neighborhood of zero. Therefore, by the Koml
\'{o}s-Major-Tusn\'{a}dy approximation (see e.g. Theorem 2.6.1 in csorgo2014strong)
yields that, for each $B$, on a suitably enlarged probability space there
exists a standard Wiener process $\left\{ W_{B}\left( \left\lfloor
Bu\right\rfloor \right) ,0\leq u\leq 1\right\} $ whose distribution does not
depend on $B$ such that (conditional on the data)
\begin{equation}
\sup_{0\l