Theorems basic+eigen Flashcards
For A ∈ C^n×n
the following conditions are equivalent to A being nonsingular:
- null(A) = {0} (i.e, there is no nonzero y ∈ C^n such that Ay = 0 ).
- rank(A) = n (i.e., the rows or columns of A are linearly independent).
- det(A) not equal to 0.
- None of A’s eigenvalues is zero.
Let the columns of X ∈ C^n×p, p ≤ n, form a basis for a subspace X! of C^n
Then X! is an invariant subspace for A if and only if
AX = XB for some B ∈ C^p×p
When the latter equation holds, the spectrum of B is contained within that of A
Let A and B be similar, say B = P−1AP.
Then A and B have the same eigenvalues, and x is an eigenvector of A with associated eigenvalue λ if and only if
P−1x is an eigenvector of B with associated eigenvalue λ.
Schur Theorem
Let A ∈ C^n×n
There exists a unitary matrix U and
an upper triangular matrix T such that
T = U−1AU = U*AU
Spectral theorem
Let A ∈ C^n×n
A is normal if and only if there is:
Unitary matrix U and a diagonal matrix Λ such that
A = UΛU*
A ∈ C^n×n is normal if and only if it has
n orthogonal eigenvectors
Let A be an n×n matrix
A is diagonalizable if and only if
A has n linearly independent eigenvectors.
A matrix with distinct eigenvalues is
diagonalizable
Jordan canonical form
Any matrix A ∈ C^n×n can be expressed in the Jordan canonical form: X−1AX=
[J1(λ1) J2(λ2) . . . Jp(λp)]
Jk = Jk(λk) = [λk 1 λk . . 1 λk] ∈ C^mk×mk
where X is nonsingular and m1 + m2 + · · · + mp = n
Cayley–Hamilton theorem
If p is the characteristic polynomial of an n × n matrix A, then p(A) = 0.
Minimal polynomial
Let A be an n × n matrix with s distinct eigenvalues λ1, . . . , λs. The minimal polynomial of A is
q(λ) = PROD^s_i=1 : (λ − λi)^ni
where ni is the dimension of the largest Jordan block in which λi appears