The Karhunen–Loève expansion has the following Hilbert-space form. Let be a square-integrable random element of a Hilbert space , with mean and covariance operator . There are nonnegative eigenvalues and orthonormal eigenvectors spanning the closure of the range of such that
in . The functional principal component scores
satisfy
If is a Gaussian random element, the scores are independent normal random variables.
For the proof, is positive, self-adjoint, and trace-class, with
It is therefore compact, so the spectral theorem for compact Hermitian operators supplies the eigenpairs. Their score covariance is
For the residual , Parseval identity and the trace formula give
The centered variable's projection onto has zero second moment and is therefore zero almost surely, which completes the mean-square expansion. When has a continuous covariance kernel, Mercer's theorem additionally expands that kernel as .
The stated kernel is the Brownian bridge covariance kernel. Its eigenvalue equation is
The right-hand side vanishes at and , and differentiating it twice gives
Thus the normalized eigenfunctions and eigenvalues are
The Karhunen–Loève expansion is consequently
with convergence in , where and . Covariance alone does not imply that the are independent or normal; they are independent standard normal variables when is Gaussian.
Let be the ordered eigenpairs of the common covariance operator , and write . Estimate by the pooled covariance operator
and denote its first eigenpairs by . The sign ambiguity of each eigenfunction disappears after squaring. Consider the Two-sample FPCA mean statistic
Under , the Hilbert-space central limit theorem gives
where is a centered Gaussian random element with covariance . The assumed eigenvalue gaps give consistency of the estimated eigenvalues and eigenfunctions, so Slutsky's theorem yields
An asymptotic level- test therefore rejects when exceeds the -quantile of the chi-squared distribution with degrees of freedom.
Under a fixed alternative,
The test is consequently consistent whenever the mean difference has a nonzero projection onto one of the retained principal components. A difference orthogonal to their span is invisible to this fixed- test, so alone does not guarantee consistency. Increasing with can recover such alternatives, but requires additional eigenvalue and approximation control.
Because a strictly monotone map fixing both endpoints is increasing, the change of variables formula gives
Assuming , define
The Hilbert-space variance identity then gives
Under the regularity needed to interchange expectation and differentiation, because . Hence
Thus exactly when the integrated covariance in the numerator vanishes. In particular, this holds when the amplitude and the time warp are independent random variables.
For these increasing warps, the square-root velocity function is . The chain rule gives
Therefore
where the last equality again uses the change of variables formula. Taking square roots proves invariance under common right composition by .
For positive trace-class covariance operators , their Procrustes distance between covariance operators is
where is the group of unitary operators on the real Hilbert space . Expanding the square gives the equivalent formula
Convergence in the Hilbert-Schmidt norm implies
Products of two Hilbert-Schmidt operators are trace-class operators, and the Schatten norm Hölder inequality gives
By trace duality, every unitary satisfies
Taking the supremum over shows that the supremum terms in the two Procrustes formulas converge. Combining this with convergence of the squared norms proves
Put
With the by design matrix , the scalar-on-function linear model becomes
The ordinary least squares estimator based on the truncated model is
Thus the omitted tail produces the conditional bias .
Let
The supplied weak law of large numbers and noise limit give
For a general fixed basis, need not vanish, so the retained coefficients are asymptotically biased and the estimator is inconsistent even for . Moreover, with fixed it cannot recover the full slope when .
If the form the eigenbasis of , then
The retained functional principal component scores are therefore uncorrelated with every omitted score, so . The least-squares estimates of are consistent despite truncation. Fixed still estimates only the projection ; consistency for the complete function requires the truncation level to increase and the tail error to vanish.
Let and define the roughness penalty matrix
For , the loss is the quadratic function
Its normal equations are
Whenever is positive definite, the unique minimizer is
For the usual choice , the penalty matrix is positive semidefinite, so full column rank of suffices. Since the question permits arbitrary real , a sufficiently negative value can make the quadratic form indefinite; then the loss is unbounded below and no minimizer exists. In the singular positive-semidefinite case, the Moore-Penrose inverse describes the minimum-norm solution whenever the normal equations are consistent.

Articles by others on the same topic (0)

There are currently no matching articles.