Eigenvalues and eigenvectors
In linear algebra, an eigenvector ( ) or characteristic vector is a (nonzero) vector that has its direction unchanged (or reversed) by a given linear transformation.
≈ 28 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, an eigenvector ( ) or characteristic vector is a (nonzero) vector that has its direction unchanged (or reversed) by a given linear transformation. More precisely, an eigenvector \mathbf v of a linear transformation T is scaled by a constant factor \lambda when the linear transformation is applied to it: .
The corresponding eigenvalue, characteristic value, or characteristic root is the multiplying factor \lambda (possibly a negative or complex number). Geometrically, vectors are multi-dimensional quantities with magnitude and direction, often pictured as arrows. A linear transformation rotates, stretches, or shears the vectors upon which it acts.
A linear transformation's eigenvectors are those vectors that are only stretched or shrunk, with neither rotation nor shear. The corresponding eigenvalue is the factor by which an eigenvector is stretched or shrunk. If the eigenvalue is negative, then the eigenvector's direction is reversed.
The eigenvectors and eigenvalues of a linear transformation serve to characterize it, and so they play important roles in all areas where linear algebra is applied, from geology to quantum mechanics. In particular, it is often the case that a system is represented by a linear transformation whose outputs are fed as inputs to the same transformation (feedback).…
In linear algebra, an eigenvector ( ) or characteristic vector is a (nonzero) vector that has its direction unchanged (or reversed) by a given linear transformation. More precisely, an eigenvector \mathbf v of a linear transformation T is scaled by a constant factor \lambda when the linear transformation is applied to it: .
The corresponding eigenvalue, characteristic value, or characteristic root is the multiplying factor \lambda (possibly a negative or complex number). Geometrically, vectors are multi-dimensional quantities with magnitude and direction, often pictured as arrows. A linear transformation rotates, stretches, or shears the vectors upon which it acts.
A linear transformation's eigenvectors are those vectors that are only stretched or shrunk, with neither rotation nor shear. The corresponding eigenvalue is the factor by which an eigenvector is stretched or shrunk. If the eigenvalue is negative, then the eigenvector's direction is reversed.
The eigenvectors and eigenvalues of a linear transformation serve to characterize it, and so they play important roles in all areas where linear algebra is applied, from geology to quantum mechanics. In particular, it is often the case that a system is represented by a linear transformation whose outputs are fed as inputs to the same transformation (feedback).
In such an application, the largest eigenvalue is of particular importance, because it governs the long-term behavior of the system after many applications of the linear transformation, and the associated eigenvector is the steady state of the system. T(\mathbf{v}) = \lambda \mathbf{v}, referred to as the eigenvalue equation or eigenequation. In general, may be any scalar.
For example, may be negative, in which case the eigenvector reverses direction as part of the scaling, or it may be zero, or complex. , the red arrow changes direction but the blue arrow does not. The blue arrow is an eigenvector of this shear mapping because it does not change direction, and since its length is unchanged, its eigenvalue is .]]
The example here, based on the Mona Lisa, provides a simple illustration. Each point on the painting can be represented as a vector pointing from the center of the painting to that point. The linear transformation in this example is called a shear mapping.
Points in the top half are moved to the right, and points in the bottom half are moved to the left, proportional to how far they are from the horizontal axis that goes through the middle of the painting. The vectors pointing to each point in the original image are therefore tilted right or left, and made longer or shorter by the transformation.
Points along the horizontal axis do not move at all when this transformation is applied. Therefore, any vector that points directly to the right or left with no vertical component is an eigenvector of this transformation, because the mapping does not change its direction.
Moreover, these eigenvectors all have an eigenvalue equal to one, because the mapping does not change their length either. Linear transformations can take many different forms, mapping vectors in a variety of vector spaces, so the eigenvectors can also take many forms.
For example, the linear transformation could be a differential operator like , in which case the eigenvectors are functions called eigenfunctions that are scaled by that differential operator, such as \frac{d}{dx} e^{\lambda x} = \lambda e^{\lambda x}. Alternatively, the linear transformation could take the form of an matrix, in which case the eigenvectors are matrices.
If the linear transformation is expressed in the form of an matrix , then the eigenvalue equation for a linear transformation above can be rewritten as the matrix multiplication A \mathbf v = \lambda \mathbf v, where the eigenvector is an matrix. For a matrix, eigenvalues and eigenvectors can be used to decompose the matrix; for example, by diagonalizing it.
Eigenvalues and eigenvectors give rise to many closely related mathematical concepts, and the prefix eigen- is applied liberally when naming them: The set of all eigenvectors of a linear transformation, each paired with its corresponding eigenvalue, is called the eigensystem of that transformation. The set of all eigenvectors of corresponding to the same eigenvalue, together with the zero vector, is called an eigenspace, or the characteristic space of associated with that eigenvalue.
If a set of eigenvectors of forms a basis of the domain of , then this basis is called an eigenbasis. Additional animations of eigenvectors and eigenvalues in two dimensions, including symmetric transformations and transformations with complex eigenvalues, are available at Wikimedia Commons. \mathbf{x} = \begin{bmatrix} 1 \\ -3 \\ 4 \end{bmatrix} \quad \mbox{and} \quad \mathbf{y} = \begin{bmatrix} -20 \\ 60 \\ -80 \end{bmatrix}.
These vectors are said to be scalar multiples of each other, or parallel, or collinear, if there is a scalar such that \mathbf y = \lambda \mathbf x. In this example, . Now consider the linear transformation of -dimensional vectors defined by an matrix : A \mathbf v = \mathbf w, or \begin{bmatrix} A_{11} & A_{12} & \cdots & A_{1n} \\ A_{21} & A_{22} & \cdots & A_{2n} \\ \vdots & \vdots & \ddots & \vdots \\ A_{n1} & A_{n2} & \cdots & A_{nn} \\ \end{bmatrix} \begin{bmatrix} v_1 \\ v_2 \\ \vdots \\ v_n \end{bmatrix} = \begin{bmatrix} w_1 \\ w_2 \\ \vdots \\ w_n \end{bmatrix} where, for each row, w_i = A_{i1} v_1 + A_{i2} v_2 + \cdots + A_{in} v_n = \sum_{j=1}^n A_{ij} v_j. If it occurs that and are scalar multiples, that is, if then is an eigenvector of the linear transformation and the scale factor is the eigenvalue corresponding to that eigenvector.
Equation ( ) is the eigenvalue equation for the matrix . Equation ( ) can be stated equivalently as where is the identity matrix and is the zero vector. A = \begin{bmatrix} 2 & 1\\ 1 & 2 \end{bmatrix}.
Taking the determinant of , the characteristic polynomial of is \det(A - \lambda I) = \begin{vmatrix} 2 - \lambda & 1 \\ 1 & 2 - \lambda \end{vmatrix} = 3 - 4\lambda + \lambda^2. Setting the characteristic polynomial equal to zero, it has roots at and , which are the two eigenvalues of .
The eigenvectors corresponding to each eigenvalue can be found by solving for the components of in the equation . In this example, the eigenvectors are any nonzero scalar multiples of \mathbf{v}_{\lambda=1} = \begin{bmatrix} 1 \\ -1 \end{bmatrix}, \quad \mathbf{v}_{\lambda=3} = \begin{bmatrix} 1 \\ 1 \end{bmatrix}.
If the entries of the matrix are all real numbers, then the coefficients of the characteristic polynomial will also be real numbers, but the eigenvalues may still have nonzero imaginary parts. The entries of the corresponding eigenvectors therefore may also have nonzero imaginary parts.
Similarly, the eigenvalues may be irrational numbers even if all the entries of are rational numbers or even if they are all integers. However, if the entries of are all algebraic numbers, which include the rationals, then the eigenvalues must also be algebraic numbers.
The non-real roots of a real polynomial with real coefficients can be grouped into pairs of complex conjugates, namely with the two members of each pair having imaginary parts that differ only in sign and the same real part. If the degree is odd, then by the intermediate value theorem at least one of the roots is real.
Therefore, any real matrix with odd order has at least one real eigenvalue, whereas a real matrix with even order may not have any real eigenvalues. The eigenvectors associated with these complex eigenvalues are also complex and also appear in complex conjugate pairs. \det(A - \lambda I) = (\lambda_1 - \lambda)^{\mu_A(\lambda_1)}(\lambda_2 - \lambda)^{\mu_A(\lambda_2)} \cdots (\lambda_d - \lambda)^{\mu_A(\lambda_d)}.
If , then the right-hand side is the product of linear terms, and this is the same as equation ( ). The size of each eigenvalue's algebraic multiplicity is related to the dimension as \begin{align} 1 &\leq \mu_A(\lambda_i) \leq n, \\ \mu_A &= \sum_{i=1}^d \mu_A\left(\lambda_i\right) = n. \end{align} If , then is said to be a . If equals the geometric multiplicity of (denoted by and defined in the next section), then is said to be a .
Eigenspaces, geometric multiplicities, and eigenbasis for a matrix
Given a particular eigenvalue of the matrix , define the set to be all vectors that satisfy equation ( ): E = \left\{ \mathbf{v} : \left( A - \lambda I \right) \mathbf{v} = \mathbf{0} \right\}. On one hand, is precisely the kernel or nullspace of the matrix .
On the other hand, by definition, any nonzero vector that satisfies this condition is an eigenvector of associated with ; so is the union of the zero vector with the set of all eigenvectors of associated with . The space is called the eigenspace or characteristic space of associated with . In general, is a complex number and the eigenvectors are complex matrices (column vectors).
Because every nullspace is a linear subspace of the domain, is a linear subspace of . Because the eigenspace is a linear subspace, it is closed under addition. That is, if two vectors and belong to the set , written , then , or equivalently .
This can be checked using the distributive property of matrix multiplication. Similarly, because is a linear subspace, it is closed under scalar multiplication. That is, if and , then , or equivalently .
This can be checked by noting that multiplication of complex matrices by complex numbers is commutative. As long as and are not zero, they are also eigenvectors of associated with .
The dimension of the eigenspace associated with , or equivalently the maximum number of linearly independent eigenvectors associated with , is referred to as the eigenvalue's geometric multiplicity and denoted by . Because is also the nullspace of , the geometric multiplicity of is the dimension of the nullspace of , also called the of .
This quantity is related to the size and rank of by the equation: \gamma_A(\lambda) = n - \operatorname{rank}(A - \lambda I). Because of the definition of eigenvalues and eigenvectors, an eigenvalue's geometric multiplicity must be at least one, that is, each eigenvalue has at least one associated eigenvector. Furthermore, an eigenvalue's geometric multiplicity cannot exceed its algebraic multiplicity.
Additionally, recall that an eigenvalue's algebraic multiplicity cannot exceed . In summary, 1 \le \gamma_A(\lambda) \le \mu_A(\lambda) \le n. Proof of inequality : Let , where is a fixed complex number, and the eigenspace associated with is the nullspace of . Let the dimension of that eigenspace be .
This means that the last rows of the echelon form of are zero. Thus, there is an invertible matrix coming from Gauss-Jordan reduction, such that EB = \begin{bmatrix} * & * \\ \mathbf{0}_{k \times (n-k)} & \mathbf{0}_{k \times k} \end{bmatrix}. Therefore the last rows of are times the last rows of .
Therefore the polynomial evenly divides the polynomial , because of basic properties of determinants (homogeneity). On the other hand, , so divides , and so the algebraic multiplicity of is at least . Q.E.D. Suppose has distinct eigenvalues , where the geometric multiplicity of is .
The total geometric multiplicity of , \gamma_A = \sum_{i=1}^d \gamma_A(\lambda_i), is the dimension of the sum of all the eigenspaces of 's eigenvalues, or equivalently the maximum number of linearly independent eigenvectors of . By construction, . If , then: The direct sum of the eigenspaces of all of 's eigenvalues is the entire vector space .
A basis of \C^n can be formed from linearly independent eigenvectors of ; such a basis is called an eigenbasis. Any vector in \C^n can be written as a linear combination of eigenvectors of .
The trace of , defined as the sum of its diagonal elements, is also the sum of all its eigenvalues: \operatorname{tr}(A) = \sum_{i=1}^n a_{ii} = \sum_{i=1}^n \lambda_i = \lambda_1 + \lambda_2 + \cdots + \lambda_n. The determinant of is the product of all its eigenvalues: \det(A) = \prod_{i=1}^n \lambda_i = \lambda_1 \lambda_2 \cdots \lambda_n. For any positive integer , the eigenvalues of the th power of , that is, , are . The eigenvalues of matrix (where is the identity matrix) are .
Moreover, for any , the eigenvalues of matrix are . More generally, for any polynomial , the eigenvalues of matrix are . is invertible if and only if every eigenvalue is nonzero.
If is invertible, then the eigenvalues of are \frac{1}{\lambda_1}, \ldots, \frac{1}{\lambda_n} and for each pair of corresponding eigenvalues, the geometric multiplicities and \gamma_{A^{-1}}({1 \over \lambda_i}) coincide. Moreover, since the characteristic polynomial of the inverse is the reciprocal polynomial of the original up to a scalar factor, for each pair of corresponding eigenvalues, the algebraic multiplicities and \mu_{A^{-1}}({1 \over \lambda_i}) coincide.
If is equal to its conjugate transpose , that is, is Hermitian, then every eigenvalue is real. The same is true of any symmetric real matrix. If is not only Hermitian but also positive-definite, positive-semidefinite, negative-definite, or negative-semidefinite, then every eigenvalue is positive, non-negative, negative, or non-positive, respectively.
If is unitary, then every eigenvalue has absolute value . A \mathbf{v} = \lambda \mathbf{v}. The eigenvalue and eigenvector problem can also be defined for vectors that multiply matrix .
In this formulation, the defining equation is \mathbf{u} A = \kappa \mathbf{u}, where is a scalar and is a matrix. Any row vector satisfying this equation is called a ' ' of , and is still called its associated eigenvalue. Taking the transpose of this equation, A^\mathsf{T} \mathbf{u}^\mathsf{T} = \kappa \mathbf{u}^\mathsf{T}.
Comparing this equation to equation ( ), it follows immediately that a left eigenvector of is the same as the transpose of a right eigenvector of , with the same eigenvalue. Furthermore, since the characteristic polynomial of is the same as the characteristic polynomial of , the left and right eigenvectors of are associated with the same eigenvalues.
But as column rank = row rank, the rows are also linearly dependent. Hence, there are numbers , not all zero, such that \sum_{i=1}^{i=n} y_i R_i = 0, where the 's are the rows of . Let the row vector ; then .
Taking the transpose, . Moreover, is not the zero vector; so is also an eigenvalue of . Furthermore, this argument shows that the eigenvalues of A and A^\mathsf{T} have the same geometric multiplicity (since column nullity = row nullity).
Q = \begin{bmatrix} \mathbf v_1 & \mathbf v_2 & \cdots & \mathbf v_n \end{bmatrix}. Since each column of is an eigenvector of , right multiplying by scales each column of by its associated eigenvalue: AQ = \begin{bmatrix} \lambda_1 \mathbf v_1 & \lambda_2 \mathbf v_2 & \cdots & \lambda_n \mathbf v_n \end{bmatrix}.
With this in mind, define the diagonal matrix where each diagonal element is the eigenvalue associated with the th column of . Then AQ = Q \varLambda. Because the columns of are linearly independent, is invertible.
Right multiplying both sides of the equation by , A = Q \varLambda Q^{-1}; or instead left multiplying both sides by , Q^{-1}AQ = \varLambda. can therefore be decomposed into a matrix composed of its eigenvectors, a diagonal matrix with its eigenvalues along the diagonal, and the inverse of the matrix of eigenvectors. This is called the eigendecomposition; it is a similarity transformation.
Such a matrix is said to be to the diagonal matrix , or diagonalizable. The matrix is the change of basis matrix of the similarity transformation. Essentially, the matrices and represent the same linear transformation expressed in two different bases.
The eigenvectors are used as the basis when representing the linear transformation as . Conversely, suppose a matrix is diagonalizable. Let be a non-singular square matrix such that is some diagonal matrix .
Left multiplying both by yields . Each column of must therefore be an eigenvector of whose eigenvalue is the corresponding diagonal element of . Since the columns of must be linearly independent for to be invertible, there exist linearly independent eigenvectors of .
In conclusion, the eigenvectors of form a basis of if and only if is diagonalizable. A matrix that is not diagonalizable is said to be defective. For defective matrices, the notion of eigenvectors generalizes to generalized eigenvectors and the diagonal matrix of eigenvalues generalizes to the Jordan normal form.
Over an algebraically closed field, any matrix has a Jordan normal form and therefore admits a basis of generalized eigenvectors and a decomposition into generalized eigenspaces. A = \begin{bmatrix} 2 & 1\\ 1 & 2 \end{bmatrix}. The figure on the right shows the effect of this transformation on point coordinates in the plane.
The eigenvectors of this transformation satisfy equation ( ), and the values of for which the determinant of the matrix equals zero are the eigenvalues. Taking the determinant to find characteristic polynomial of , \begin{align} \det(A - \lambda I) &= \left|\begin{bmatrix} 2 & 1 \\ 1 & 2 \end{bmatrix} - \lambda\begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix}\right| = \begin{vmatrix} 2 - \lambda & 1 \\ 1 & 2 - \lambda \end{vmatrix} \\[6pt] &= 3 - 4\lambda + \lambda^2 \\[6pt] &= (\lambda - 3)(\lambda - 1). \end{align} Setting the characteristic polynomial equal to zero, it has roots at and , which are the two eigenvalues of .
For , equation ( ) becomes, \begin{align} (A - I)\mathbf{v}_{\lambda=1} &= \begin{bmatrix} 1 & 1\\ 1 & 1\end{bmatrix} \begin{bmatrix}v_1 \\ v_2\end{bmatrix} = \begin{bmatrix}0 \\ 0\end{bmatrix} \\ 1v_1 + 1v_2 &= 0 \end{align} Any nonzero vector with solves this equation. Therefore, \mathbf{v}_{\lambda=1} = \begin{bmatrix} v_1 \\ -v_1 \end{bmatrix} = \begin{bmatrix} 1 \\ -1 \end{bmatrix} is an eigenvector of corresponding to , as is any scalar multiple of this vector.
For , equation ( ) becomes \begin{align} (A - 3I)\mathbf{v}_{\lambda=3} &= \begin{bmatrix} -1 & \hphantom{-}1\\ \hphantom{-}1 & -1 \end{bmatrix} \begin{bmatrix} v_1 \\ v_2 \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix} \\ -1v_1 + 1v_2 &= 0;\\ 1v_1 - 1v_2 &= 0 \end{align} Any nonzero vector with solves this equation. Therefore, \mathbf v_{\lambda=3} = \begin{bmatrix} v_1 \\ v_1 \end{bmatrix} = \begin{bmatrix} 1 \\ 1 \end{bmatrix} is an eigenvector of corresponding to , as is any scalar multiple of this vector.
Thus, the vectors and are eigenvectors of associated with the eigenvalues and , respectively. A = \begin{bmatrix} 2 & 0 & 0 \\ 0 & 3 & 4 \\ 0 & 4 & 9 \end{bmatrix}.
The characteristic polynomial of is \begin{align} \det(A - \lambda I) &= \left|\begin{bmatrix} 2 & 0 & 0 \\ 0 & 3 & 4 \\ 0 & 4 & 9 \end{bmatrix} - \lambda\begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}\right| = \begin{vmatrix} 2 - \lambda & 0 & 0 \\ 0 & 3 - \lambda & 4 \\ 0 & 4 & 9 - \lambda \end{vmatrix}, \\[6pt] &= (2 - \lambda)\bigl[(3 - \lambda)(9 - \lambda) - 16\bigr] = -\lambda^3 + 14\lambda^2 - 35\lambda + 22. \end{align} The roots of the characteristic polynomial are 2, 1, and 11, which are the only three eigenvalues of . These eigenvalues correspond to the eigenvectors , , and , or any nonzero multiple thereof.
A = \begin{bmatrix} 0 & 1 & 0\\ 0 & 0 & 1\\ 1 & 0 & 0 \end{bmatrix}. This matrix shifts the coordinates of the vector up by one position and moves the first coordinate to the bottom.
Its characteristic polynomial is , whose roots are \begin{align} \lambda_1 &= 1 \\ \lambda_2 &= -\frac{1}{2} + i \frac{\sqrt{3}}{2} \\ \lambda_3 &= \lambda_2^* = -\frac{1}{2} - i \frac{\sqrt{3}}{2} \end{align} where is an imaginary unit with . For the real eigenvalue , any vector with three equal nonzero entries is an eigenvector.
For example, A \begin{bmatrix} 5\\ 5\\ 5 \end{bmatrix} = \begin{bmatrix} 5\\ 5\\ 5 \end{bmatrix} = 1 \cdot \begin{bmatrix} 5\\ 5\\ 5 \end{bmatrix}. For the complex conjugate pair of imaginary eigenvalues, \lambda_2\lambda_3 = 1, \quad \lambda_2^2 = \lambda_3, \quad \lambda_3^2 = \lambda_2.
Then A \begin{bmatrix} 1 \\ \lambda_2 \\ \lambda_3 \end{bmatrix} = \begin{bmatrix} \lambda_2 \\ \lambda_3 \\ 1 \end{bmatrix} = \lambda_2 \cdot \begin{bmatrix} 1 \\ \lambda_2 \\ \lambda_3 \end{bmatrix}, and A \begin{bmatrix} 1 \\ \lambda_3 \\ \lambda_2 \end{bmatrix} = \begin{bmatrix} \lambda_3 \\ \lambda_2 \\ 1 \end{bmatrix} = \lambda_3 \cdot \begin{bmatrix} 1 \\ \lambda_3 \\ \lambda_2 \end{bmatrix}. Therefore, the other two eigenvectors of are complex and are and with eigenvalues and , respectively.
The two complex eigenvectors also appear in a complex conjugate pair, \mathbf v_{\lambda_2} = \mathbf v_{\lambda_3}^*. A = \begin{bmatrix} 1 & 0 & 0\\ 0 & 2 & 0\\ 0 & 0 & 3\end{bmatrix}. The characteristic polynomial of is \det(A - \lambda I) = (1 - \lambda)(2 - \lambda)(3 - \lambda), which has the roots , , and .
These roots are the diagonal elements as well as the eigenvalues of . Each diagonal element corresponds to an eigenvector whose only nonzero component is in the same row as that diagonal element.
In the example, the eigenvalues correspond to the eigenvectors, \mathbf v_{\lambda_1} = \begin{bmatrix} 1\\ 0\\ 0 \end{bmatrix},\quad \mathbf v_{\lambda_2} = \begin{bmatrix} 0\\ 1\\ 0 \end{bmatrix},\quad \mathbf v_{\lambda_3} = \begin{bmatrix} 0\\ 0\\ 1 \end{bmatrix}, respectively, as well as scalar multiples of these vectors. A = \begin{bmatrix} 1 & 0 & 0\\ 1 & 2 & 0\\ 2 & 3 & 3 \end{bmatrix}.
The characteristic polynomial of is \det(A - \lambda I) = (1 - \lambda)(2 - \lambda)(3 - \lambda), which has the roots , , and . These roots are the diagonal elements as well as the eigenvalues of .
These eigenvalues correspond to the eigenvectors, \mathbf v_{\lambda_1} = \begin{bmatrix} 1\\ -1\\ \frac{1}{2}\end{bmatrix},\quad \mathbf v_{\lambda_2} = \begin{bmatrix} 0\\ 1\\ -3\end{bmatrix},\quad \mathbf v_{\lambda_3} = \begin{bmatrix} 0\\ 0\\ 1\end{bmatrix}, respectively, as well as scalar multiples of these vectors. A = \begin{bmatrix} 2 & 0 & 0 & 0 \\ 1 & 2 & 0 & 0 \\ 0 & 1 & 3 & 0 \\ 0 & 0 & 1 & 3 \end{bmatrix}, has a characteristic polynomial that is the product of its diagonal elements, \det(A - \lambda I) = \begin{vmatrix} 2 - \lambda & 0 & 0 & 0 \\ 1 & 2- \lambda & 0 & 0 \\ 0 & 1 & 3- \lambda & 0 \\ 0 & 0 & 1 & 3- \lambda \end{vmatrix} = (2 - \lambda)^2(3 - \lambda)^2.
The roots of this polynomial, and hence the eigenvalues, are 2 and 3. The of each eigenvalue is 2; in other words they are both double roots. The sum of the algebraic multiplicities of all distinct eigenvalues is , the order of the characteristic polynomial and the dimension of .
On the other hand, the of the eigenvalue 2 is only 1, because its eigenspace is spanned by just one vector and is therefore 1-dimensional. Similarly, the geometric multiplicity of the eigenvalue 3 is 1 because its eigenspace is spanned by just one vector . The total geometric multiplicity is 2, which is the smallest it could be for a matrix with two distinct eigenvalues.
Geometric multiplicities are defined in a later section. |v_{i\alpha}|^2 = \frac{\prod_{k}{(\lambda_i(A)-\lambda_k(A_\alpha))}} {\prod_{k \neq i}{(\lambda_i(A)-\lambda_k(A))}}, where is the submatrix formed by removing the th row and column from the original matrix. This identity also extends to diagonalizable matrices.
It has been discovered in and rediscovered many times in the literature (see, e.g., ). D f(t) = \lambda f(t) The functions that satisfy this equation are eigenvectors of and are commonly called ' '. \frac{d}{dt}f(t) = \lambda f(t). This differential equation can be solved by multiplying both sides by and integrating.
Its solution, the exponential function f(t) = f(0)e^{\lambda t}, is the eigenfunction of the derivative operator. In this case the eigenfunction is itself a function of its associated eigenvalue. In particular, for the eigenfunction is a constant.
T\colon V \to V. We say that a nonzero vector is an ' ' of if and only if there exists a scalar such that This equation is called the eigenvalue equation for , and the scalar is the eigenvalue of corresponding to the eigenvector . is the result of applying the transformation to the vector , while is the product of the scalar with . E = \left\{\mathbf{v} : T(\mathbf{v}) = \lambda \mathbf{v}\right\}, which is the union of the zero vector with the set of all eigenvectors associated with . is called the or of associated with .
It is the kernel of the linear transformation . By definition of a linear transformation, \begin{align} T(\mathbf{x} + \mathbf{y}) &= T(\mathbf{x}) + T(\mathbf{y}),\\ T(\alpha \mathbf{x}) &= \alpha T(\mathbf{x}), \end{align} for and .
Therefore, if and are eigenvectors of associated with eigenvalue , namely , then \begin{align} T(\mathbf{u} + \mathbf{v}) &= \lambda (\mathbf{u} + \mathbf{v}),\\ T(\alpha \mathbf{v}) &= \lambda (\alpha \mathbf{v}). \end{align} So, both and are either zero or eigenvectors of associated with , namely , , and is closed under addition and scalar multiplication. The eigenspace associated with is therefore a linear subspace of .
If that subspace has dimension 1, it is sometimes called an . The of an eigenvalue is the dimension of the eigenspace associated with ; that is, the maximum number of linearly independent eigenvectors associated with that eigenvalue. By the definition of eigenvalues and eigenvectors, because every eigenvalue has at least one eigenvector.
The eigenspaces of always form a direct sum. As a consequence, eigenvectors of eigenvalues are always linearly independent. Therefore, the sum of the dimensions of the eigenspaces cannot exceed the dimension of the vector space on which operates, and there cannot be more than distinct eigenvalues.
Any subspace spanned by eigenvectors of is an invariant subspace of , and the restriction of to such a subspace is diagonalizable. Moreover, if the entire vector space can be spanned by the eigenvectors of , or equivalently if the direct sum of the eigenspaces associated with all the eigenvalues of is the entire vector space , then a basis of called an can be formed from linearly independent eigenvectors of .
When admits an eigenbasis, is diagonalizable. x_t = a_1 x_{t-1} + a_2 x_{t-2} + \cdots + a_k x_{t-k}. The solution of this equation for in terms of is found by using its characteristic equation \lambda^k - a_1\lambda^{k-1} - a_2\lambda^{k-2} - \cdots - a_{k-1}\lambda-a_k = 0, which can be found by stacking into matrix form a set of equations consisting of the above difference equation and the equations , ..., , giving a -dimensional system of the first order in the stacked variable vector in terms of its once-lagged value, and taking the characteristic equation of this system's matrix.
This equation gives characteristic roots , for use in the solution equation x_t = c_1\lambda_1^t + \cdots + c_k\lambda_k^t. A similar procedure is used for solving a differential equation of the form \frac{d^k x}{dt^k} + a_{k-1}\frac{d^{k-1}x}{dt^{k-1}} + \cdots + a_1\frac{dx}{dt} + a_0 x = 0. A = \begin{bmatrix} 4 & 1\\ 6 & 3\end{bmatrix} we can find its eigenvectors by solving the equation , that is \begin{bmatrix} 4 & 1 \\ 6 & 3 \end{bmatrix} \begin{bmatrix} x \\y \end{bmatrix} = 6 \cdot \begin{bmatrix} x \\y \end{bmatrix} This matrix equation is equivalent to two linear equations \left\{ \begin{align} 4x + \hphantom{3}y &= 6x \\ 6x + 3y &= 6y \end{align} \right. that is, \left\{ \begin{align} -2x + \hphantom{3}y &= 0 \\ 6x - 3y &= 0 \end{align} \right.
Both equations reduce to the single linear equation . Therefore, any vector of the form , for any nonzero real number , is an eigenvector of with eigenvalue . The matrix above has another eigenvalue .
A similar calculation shows that the corresponding eigenvectors are the nonzero solutions of , that is, any vector of the form , for any nonzero real number . \lambda = \frac{\mathbf{v}^* A\mathbf{v}}{\mathbf{v}^* \mathbf{v}} where denotes the conjugate transpose of . m\ddot{x} + kx = 0 or m\ddot{x} = -kx That is, acceleration is proportional to position (i.e., we expect to be sinusoidal in time). In dimensions, becomes a mass matrix and a stiffness matrix.
Admissible solutions are then a linear combination of solutions to the generalized eigenvalue problem kx = \omega^2 mx where is the eigenvalue and is the (imaginary) angular frequency. The principal vibration modes are different from the principal compliance modes, which are the eigenvectors of alone.
Furthermore, damped vibration, governed by m\ddot{x} + c\dot{x} + kx = 0 leads to a so-called quadratic eigenvalue problem, \left(\omega^2 m + \omega c + k\right)x = 0. This can be reduced to a generalized eigenvalue problem by algebraic manipulation at the cost of solving a larger system.
The orthogonality properties of the eigenvectors allows decoupling of the differential equations so that the system can be represented as linear summation of the eigenvectors. The eigenvalue problem of complex structures is often solved using finite element analysis, but neatly generalize the solution to scalar-valued vibration problems.
H\psi_E = E\psi_E where the Hamiltonian is a second-order differential operator, and the wavefunction is one of its eigenfunctions corresponding to the eigenvalue , interpreted as its energy. However, in the case where one is interested only in the bound state solutions of the Schrödinger equation, one looks for within the space of square integrable functions.
Since this space is a Hilbert space with a well-defined scalar product, one can introduce a basis set in which and can be represented as a one-dimensional array (i.e., a vector) and a matrix respectively. This allows one to represent the Schrödinger equation in a matrix form. The bra–ket notation is often used in this context.
A vector, which represents a state of the system, in the Hilbert space of square integrable functions is represented by . In this notation, the Schrödinger equation is: H|\Psi_E\rangle = E|\Psi_E\rangle where is an ' ' of , and represents the eigenvalue. is an observable self-adjoint operator, the infinite-dimensional analog of Hermitian matrices.
As in the matrix case, in the equation above is understood to be the vector obtained by application of the transformation to . Introduction to Eigen Vectors and Eigen Values – lecture from Khan Academy Eigenvectors and eigenvalues | Essence of linear algebra, chapter 10 – A visual explanation with 3Blue1Brown Matrix Eigenvectors Calculator from Symbolab (Click on the bottom right button of the 2×12 grid to select a matrix size.
Select an n \times n size (for a square matrix), then fill out the entries numerically and click on the Go button. It can accept complex numbers as well.)
Text derived from https://en.wikipedia.org/w/index.php?oldid=1368844750 under CC BY-SA 4.0; modifications have been made.