Sylvester's formula

Formula in matrix theory From Wikipedia, the free encyclopedia

In matrix theory, Sylvester's formula or Sylvester's matrix theorem (named after J. J. Sylvester) or Lagrange−Sylvester interpolation expresses an analytic function f(A) of a matrix A as a polynomial in A, in terms of the eigenvalues and eigenvectors of A.[1][2] It states that[3]

where the λi are the eigenvalues of A, and the matrices

are the corresponding Frobenius covariants of A, which are (projection) matrix Lagrange polynomials of A.

Conditions

Sylvester's formula applies for any diagonalizable matrix A 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

Summarize
Perspective

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

Generalization

Summarize
Perspective

Sylvester's formula is only valid for diagonalizable matrices; an extension due to Arthur Buchheim, based on Hermite interpolating polynomials, covers the general case:[4]

,

where .

A concise form is further given by Hans Schwerdtfeger,[5]

,

where Ai are the corresponding Frobenius covariants of A

Special case

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,

In particular, and .

See also

References

Loading related searches...

Wikiwand - on

Seamless Wikipedia browsing. On steroids.