Characteristic polynomial
In linear algebra, the characteristic polynomial of a square matrix is a polynomial which is invariant under matrix similarity and has the eigenvalues as roots.
≈ 10 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In linear algebra, the characteristic polynomial of a square matrix is a polynomial which is invariant under matrix similarity and has the eigenvalues as roots. It has the determinant and the trace of the matrix among its coefficients.
The characteristic polynomial of an endomorphism of a finite-dimensional vector space is the characteristic polynomial of the matrix of that endomorphism over any basis (that is, the characteristic polynomial does not depend on the choice of a basis). The characteristic equation, also known as the determinantal equation, is the equation obtained by equating the characteristic polynomial to zero.
In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix.
Motivation
Eigenvalues and eigenvectors play a fundamental role in linear algebra, since, given a linear transformation, an eigenvector is a vector whose direction is not changed by the transformation, and the corresponding eigenvalue is the measure of the resulting change of magnitude of the vector. More precisely, suppose the transformation is represented by a square matrix A. Then an eigenvector \mathbf{v} and the corresponding eigenvalue \lambda must satisfy the equation A \mathbf{v} = \lambda \mathbf{v}, or, equivalently (since \lambda \mathbf{v} = \lambda I \mathbf{v} ), (\lambda I - A) \mathbf{v} =\mathbf 0 where I is the identity matrix, and \mathbf{v}\ne \mathbf{0} (although the zero vector satisfies this equation for every \lambda, it is not considered an eigenvector).
It follows that the matrix (\lambda I - A) must be singular, and its determinant \det(\lambda I - A) = 0 must be zero. In other words, the eigenvalues of are the roots of \det(xI - A), which is a monic polynomial in of degree if is a matrix. This polynomial is the characteristic polynomial of .
Formal definition
Consider an n \times n matrix A. The characteristic polynomial of A, denoted by p_A(t), is the polynomial defined by p_A(t) = \det (t I - A) where I denotes the n \times n identity matrix. Some authors define the characteristic polynomial to be \det(A - t I). That polynomial differs from the one defined here by a sign (-1)^n, so it makes no difference for properties like having as roots the eigenvalues of A ; however the definition above always gives a monic polynomial, whereas the alternative definition is monic only when n is even.
Examples
To compute the characteristic polynomial of the matrix A = \begin{pmatrix} 2 & 1\\ -1& 0 \end{pmatrix}. the determinant of the following is computed: t I-A = \begin{pmatrix} t-2&-1\\ 1&t-0 \end{pmatrix} and found to be (t-2)t - 1(-1) = t^2-2t+1 \,\!, the characteristic polynomial of A. Another example uses hyperbolic functions of a hyperbolic angle φ. For the matrix take A = \begin{pmatrix} \cosh(\varphi) & \sinh(\varphi)\\ \sinh(\varphi)& \cosh(\varphi) \end{pmatrix}.
Its characteristic polynomial is \det (tI - A) = (t - \cosh(\varphi))^2 - \sinh^2(\varphi) = t^2 - 2 t \ \cosh(\varphi) + 1 = (t - e^\varphi) (t - e^{-\varphi}).
Properties
The characteristic polynomial p_A(t) of a n \times n matrix A is monic (its leading coefficient is 1 ) and its degree is n. The most important fact about the characteristic polynomial was already mentioned in the motivational paragraph: the eigenvalues of A are precisely the roots of p_A(t) (this also holds for the minimal polynomial of A, but its degree may be less than n ). All coefficients of the characteristic polynomial are polynomial expressions in the entries of the matrix. In particular its constant coefficient of t^0 is \det(-A) = (-1)^n \det(A), the coefficient of t^n is 1, and the coefficient of t^{n-1} is , where is the trace of A. (The signs given here correspond to the formal definition given in the previous section; for the alternative definition these would instead be \det(A) and respectively. ) For a 2 \times 2 matrix A, the characteristic polynomial is thus given by t^2 - \operatorname{tr}(A) t + \det(A). Using the language of exterior algebra, the characteristic polynomial of an n \times n matrix A may be expressed as p_A (t) = \sum_{k=0}^n t^{n-k} (-1)^k \operatorname{tr}\left(\textstyle\bigwedge^k A\right) where \operatorname{tr}\left(\bigwedge^k A\right) is the trace of the k th exterior power of A, which has dimension \binom {n}{k}.
This trace may be computed as the sum of all principal minors of A of size k. The recursive Faddeev–LeVerrier algorithm computes these coefficients more efficiently . When the characteristic of the field of the coefficients is 0, each such trace may alternatively be computed as a single determinant, that of the k \times k matrix, \operatorname{tr}\left(\textstyle\bigwedge^k A\right) = \frac{1}{k!} \begin{vmatrix} \operatorname{tr}A & k-1 &0&\cdots &0 \\ \operatorname{tr}A^2 &\operatorname{tr}A& k-2 &\cdots &0 \\ \vdots & \vdots & & \ddots & \vdots \\ \operatorname{tr}A^{k-1} &\operatorname{tr}A^{k-2}& & \cdots & 1 \\ \operatorname{tr}A^k &\operatorname{tr}A^{k-1}& & \cdots & \operatorname{tr}A \end{vmatrix} ~.
The Cayley–Hamilton theorem states that replacing t by A in the characteristic polynomial (interpreting the resulting powers as matrix powers, and the constant term c as c times the identity matrix) yields the zero matrix. Informally speaking, every matrix satisfies its own characteristic equation.
This statement is equivalent to saying that the minimal polynomial of A divides the characteristic polynomial of A. Two similar matrices have the same characteristic polynomial. The converse however is not true in general: two matrices with the same characteristic polynomial need not be similar. The matrix A and its transpose have the same characteristic polynomial.
A is similar to a triangular matrix if and only if its characteristic polynomial can be completely factored into linear factors over K (the same is true with the minimal polynomial instead of the characteristic polynomial). In this case A is similar to a matrix in Jordan normal form.
Characteristic polynomial of a product of two matrices
If A and B are two square n \times n matrices then characteristic polynomials of AB and BA coincide: p_{AB}(t)=p_{BA}(t).\, More generally, if A is a matrix of order m \times n and B is a matrix of order n \times m, then AB is m \times m and BA is n \times n matrix, and one has p_{BA}(t) = t^{n-m} p_{AB}(t).\, To prove this, one may suppose n > m, by exchanging, if needed, A and B. Then, by bordering A on the bottom by n - m rows of zeros, and B on the right, by, n - m columns of zeros, one gets two n \times n matrices A^{\prime} and B^{\prime} such that B^{\prime}A^{\prime} = BA and A^{\prime}B^{\prime} is equal to AB bordered by n - m rows and columns of zeros. The result follows from the case of square matrices, by comparing the characteristic polynomials of A^{\prime}B^{\prime} and AB.
Characteristic polynomial of A k
If \lambda is an eigenvalue of a square matrix A with eigenvector \mathbf{v}, then \lambda^k is an eigenvalue of A^k because A^k \textbf{v} = A^{k-1} A \textbf{v} = \lambda A^{k-1} \textbf{v} = \dots = \lambda^k \textbf{v}. The multiplicities can be shown to agree as well, and this generalizes to any polynomial in place of x^k : That is, the algebraic multiplicity of \lambda in f(A) equals the sum of algebraic multiplicities of \lambda' in A over \lambda' such that f(\lambda') = \lambda.
In particular, \operatorname{tr}(f(A)) = \textstyle\sum_{i=1}^n f(\lambda_i) and \operatorname{det}(f(A)) = \textstyle\prod_{i=1}^n f(\lambda_i). Here a polynomial f(t) = t^3+1, for example, is evaluated on a matrix A simply as f(A) = A^3+I. The theorem applies to matrices and polynomials over any field or commutative ring. However, the assumption that p_A(t) has a factorization into linear factors is not always true, unless the matrix is over an algebraically closed field such as the complex numbers.
Secular function
The term secular function has been used for what is now called characteristic polynomial (in some literature the term secular function is still used). The term comes from the fact that the characteristic polynomial was used to calculate secular perturbations (on a time scale of a century, that is, slow compared to annual motion) of planetary orbits, according to Lagrange's theory of oscillations.
Secular equation
Secular equation may have several meanings. In linear algebra it is sometimes used in place of characteristic equation. In astronomy it is the algebraic or numerical expression of the magnitude of the inequalities in a planet's motion that remain after the inequalities of a short period have been allowed for.
In molecular orbital calculations relating to the energy of the electron and its wave function it is also used instead of the characteristic equation.
For general associative algebras
The above definition of the characteristic polynomial of a matrix A \in M_n(F) with entries in a field F generalizes without any changes to the case when F is just a commutative ring. defines the characteristic polynomial for elements of an arbitrary finite-dimensional (associative, but not necessarily commutative) algebra over a field F and proves the standard properties of the characteristic polynomial in this generality.
Theoretical complexity: calculation by fast matrix multiplication
It is possible to calculate the characteristic polynomial in a fast way with the use of fast matrix multiplication algorithms in the time O({n^\omega }) for \omega slightly above 2.37. Respective algorithms is given by .
See also
Characteristic equation (disambiguation) Invariants of tensors such as the coefficients of p_A Companion matrix given a monic polynomial p , a matrix whose characteristic polynomial is p Cayley–Hamilton theorem p_A(A) = 0 Faddeev–LeVerrier algorithm classical algorithm to compute p_A over a field Samuelson–Berkowitz algorithm efficient algorithm to compute p_A over a ring
References
T.S. Blyth & E.F. Robertson (1998) Basic Linear Algebra, p 149, Springer . John B. Fraleigh & Raymond A. Beauregard (1990) Linear Algebra 2nd edition, p 246, Addison-Wesley . Werner Greub (1974) Linear Algebra 4th edition, pp 120–5, Springer, .
Paul C. Shields (1980) Elementary Linear Algebra 3rd edition, p 274, Worth Publishers . Gilbert Strang (1988) Linear Algebra and Its Applications 3rd edition, p 246, Brooks/Cole .
Text derived from https://en.wikipedia.org/w/index.php?oldid=1376246538 under CC BY-SA 4.0; modifications have been made.