In mathematics, a matrix polynomial is a polynomial with
square matrices as variables. Given an ordinary, scalar-valued polynomial
:
this polynomial evaluated at a matrix ''A'' is
:
where ''I'' is the
identity matrix
In linear algebra, the identity matrix of size n is the n\times n square matrix with ones on the main diagonal and zeros elsewhere.
Terminology and notation
The identity matrix is often denoted by I_n, or simply by I if the size is immaterial o ...
.
A matrix polynomial equation is an equality between two matrix polynomials, which holds for the specific matrices in question. A matrix polynomial identity is a matrix polynomial equation which holds for all matrices ''A'' in a specified
matrix ring
In abstract algebra, a matrix ring is a set of matrices with entries in a ring ''R'' that form a ring under matrix addition and matrix multiplication . The set of all matrices with entries in ''R'' is a matrix ring denoted M''n''(''R'')Lang, ''U ...
''M
n''(''R'').
Characteristic and minimal polynomial
The
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. It has the determinant and the trace of the matrix among its coefficients. The chara ...
of a matrix ''A'' is a scalar-valued polynomial, defined by
. The
Cayley–Hamilton theorem states that if this polynomial is viewed as a matrix polynomial and evaluated at the matrix ''A'' itself, the result is the zero matrix:
. The characteristic polynomial is thus a polynomial which annihilates ''A''.
There is a unique
monic polynomial of minimal degree which annihilates ''A''; this polynomial is the
minimal polynomial. Any polynomial which annihilates ''A'' (such as the characteristic polynomial) is a multiple of the minimal polynomial.
It follows that given two polynomials ''P'' and ''Q'', we have
if and only if
:
where
denotes the ''j''th derivative of ''P'' and
are the
eigenvalues of ''A'' with corresponding indices
(the index of an eigenvalue is the size of its largest
Jordan block).
Matrix geometrical series
Matrix polynomials can be used to sum a matrix geometrical series as one would an ordinary
geometric series,
:
:
:
:
If ''I'' − ''A'' is nonsingular one can evaluate the expression for the sum ''S''.
See also
*
Latimer–MacDuffee theorem
*
Matrix exponential
*
Matrix function
Notes
References
*
* .
* .
{{DEFAULTSORT:Matrix Polynomial
Matrix theory
Polynomials