This article needs attention from an expert in mathematics. The specific problem is: The discussion of eigenvalues with multiplicities greater than one seems to be unnecessary, as the matrix is assumed to have distinct eigenvalues.WikiProject Mathematics may be able to help recruit an expert.(June 2023)
Sylvester's formula applies for any diagonalizable matrixA with k distinct eigenvalues, λ1, ..., λk, and any function f defined on some subset of the complex numbers such that f(A) is well defined. The last condition means that every eigenvalue λi is in the domain of f, and that every eigenvalue λi with multiplicity mi > 1 is in the interior of the domain, with f being (mi - 1) times differentiable at λi.[1]: Def.6.4
Example
Consider the two-by-two matrix:
This matrix has two eigenvalues, 5 and −2. Its Frobenius covariants are
Sylvester's formula then amounts to
For instance, if f is defined by f(x) = x−1, then Sylvester's formula expresses the matrix inverse f(A) = A−1 as
If a matrix A is both Hermitian and unitary, then it can only have eigenvalues of , and therefore , where is the projector onto the subspace with eigenvalue +1, and is the projector onto the subspace with eigenvalue ; By the completeness of the eigenbasis, . Therefore, for any analytic function f,
^ ab/
Roger A. Horn and Charles R. Johnson (1991), Topics in Matrix Analysis. Cambridge University Press, ISBN978-0-521-46713-1
^Jon F. Claerbout (1976), Sylvester's matrix theorem, a section of Fundamentals of Geophysical Data Processing. Online version at sepwww.stanford.edu, accessed on 2010-03-14.
Higham, Nicholas J. (2008). Functions of matrices: theory and computation. Philadelphia: Society for Industrial and Applied Mathematics (SIAM). ISBN9780898717778. OCLC693957820.