This is the Brownian covariance kernel, so its integral operator is a covariance operator. To obtain its eigendecomposition, suppose with . Splitting the integral at gives
Differentiation yields and , with boundary conditions and . Hence the normalized eigenpairs are
The eigenvalues are positive and summable, consistently with positivity and the trace-class operator property of a covariance operator.
The identity operator is positive and self-adjoint, but on the infinite-dimensional Hilbert space it has eigenvalue one with infinite multiplicity. Consequently
A square-integrable Hilbert-space random variable has a trace-class covariance operator with trace . The identity therefore cannot be such a covariance operator.
This symmetric finite-rank integral operator is not positive. For , set . Directly,
The associated quadratic form is
Every covariance operator is a positive operator, so this operator is not a covariance operator.
Write for the rank-one operator . The estimator is the kernel representation of the empirical covariance operator
Since ,
Thus the estimator has the fixed bias of an estimator for .
The fourth-moment assumption makes square-integrable in the Hilbert space of Hilbert-Schmidt operators. The weak law of large numbers therefore gives
Consequently consistency for holds exactly when . More precisely, if , then
The Hilbert-space central limit theorem also yields
where is a centered Gaussian random element in the Hilbert-Schmidt operator space with covariance determined by . Relative to , the same fluctuation is displaced by and hence does not have a finite centered limit when .
Use the test statistic
Under the null hypothesis, the Hilbert-space central limit theorem gives , where is centered Gaussian with covariance . If , its Karhunen–Loève expansion and the continuous mapping theorem give
for independent . Reject for above the quantile of this weighted chi-squared law; replacing the by empirical covariance eigenvalues gives a plug-in estimator of the critical value.
Under every fixed alternative , the weak law of large numbers gives , so and the test is consistent. Under a local alternative , the limit is , which describes its local power.
Let be the leading eigenpairs of the sample covariance operator. For fixed with and , the FPCA mean test uses
Under the null, consistency of the empirical eigenpairs and the multivariate central limit theorem imply
The level- test therefore rejects above the quantile of the chi-squared distribution with degrees of freedom.
For a fixed mean , if at least one leading coordinate , , is nonzero, then in probability and the test is consistent. It has only null-level asymptotic power against means orthogonal to the first principal component functions. Under , the limit is noncentral chi-squared with noncentrality
Assume the null distribution is a centrally symmetric probability distribution, so and have the same law. A sign-flip randomization test draws signs independently and recomputes, for example,
The exact p-value averages over all sign vectors:
With random sign vectors, including the observed configuration, the standard Monte Carlo version is , where is the observed statistic. Joint sign invariance under the null makes this finite-sample valid.
The squared-norm test is omnibus: every fixed nonzero mean eventually changes . Its null law, however, is an infinite weighted chi-squared distribution and requires accurate estimation of enough covariance eigenvalues; noisy low-variance directions can also make calibration inefficient.
The FPCA mean test has the simple limit and standardizes retained directions by their variances. It is effective when the signal lies in the leading principal component subspace, but choosing introduces a tuning decision and truncation makes the test blind to alternatives orthogonal to that subspace. Close or repeated eigenvalues also make individual empirical eigenfunctions unstable.
The sign-flip randomization test can provide finite-sample calibration and avoids estimating a limiting covariance spectrum. Its exactness requires central symmetry, which is stronger than merely having zero mean, and exhaustive enumeration costs evaluations; Monte Carlo sign flips introduce simulation error. Its power still depends on the statistic used inside the randomization scheme.
The minimizer is the arithmetic mean
It remains a positive self-adjoint trace-class operator and hence a covariance operator. The Hilbert-Schmidt inner product gives, for every Hilbert-Schmidt operator ,
because . Thus is the unique minimizer, including when the minimization is restricted to covariance operators.
For factorizations and , the Procrustes distance between covariance operators is the following infimum over unitary operators :
Unitary invariance of the Hilbert-Schmidt norm gives
The polar decomposition of a bounded operator and trace duality imply
where the last equality expresses the trace norm as the sum of the singular values. Taking the infimum proves
The two rank-one operators have orthogonal ranges. Their Hilbert-Schmidt inner product is zero, while , so the Hilbert-Schmidt distance between covariance operators is
For each , the positive square root of an operator is . Orthogonality therefore gives the square-root distance between covariance operators
Finally , so every singular value in the Procrustes cross-term vanishes. Hence
Let be the Hilbert-Schmidt operator with kernel , so the function-on-function linear model is . Independence and centering give . Let
and define the functional principal component scores
The cross-covariance operator identity gives, for every ,
Since is centered, the requested integrated variance is . Applying the Karhunen–Loève expansion to and the Parseval identity in the basis yields
Equivalently, if , the expression is .

Articles by others on the same topic (0)

There are currently no matching articles.