Linear Algebra part B Flashcards
Memorize All Definitions
Invariant Subspace
Suppose T ∈ L(V).
A subspace U of V is invariant under T
if u ∈ U implies T(u) ∈ U
Eigenvalue
Suppose T ∈ L(V).
A number lamda ∈ F is called an eigenvalue of T
if there exists v ∈ V
such that v ≠ 0 and Tv = lamda v
Eigenvector
Suppose T ∈ L(V) and lamda ∈ F is an eigenvalue of T .
A vector v ∈ V is called an eigenvector of T
corresponding to lamda
if v ≠ 0 and Tv = lamda v
Equivalent conditions to be an eigenvalue
Suppose V is finite dimensional T ∈ L(V) and lamda ∈ F Then the following are equivalent: (a) lamda is an eigenvalue of T; (b) T-lamda(I) is not injective; (c) T-lamda(I) is not surjective; (d) T-lamda(I) is not invertible;
Linearly Independent Eigenvectors
Let T ∈ L(V)
Suppose lamda_(1),…,lamda_(m) are
distinct eigenvalues of T
and v_(1),…,v_(m) are corresponding eigenvectors.
Then v_(1),…,v_(m) is linearly independent
Number of Eigenvalues
Suppose V is finite-dimensional
Then each operator on V has
at most dim V distinct eigenvalues
Ex- if dim V= 3 then each operator on V has at most 3 distinct eigenvalues
Restriction Operator
T | _(U )
Suppose T ∈ L(V) and U is a subspace of V
invariant under T
The restrictive operator T | (U ) ∈ L(U) is defined by
T|(U)(u) = Tu
for u ∈ U
Operator on complex vector spaces have an eigenvalue
Every operator on a finite-dimensional, nonzero, complex vector space has an eigenvalue
Diagonal of a Matrix
The diagonal of a square matrix consists of the entries along the line from the upper left corner to the bottom right corner
Upper Triangular Matrix
A matrix is called upper triangular if all the entries below the diagonal are equal to zero
Determining of eigenvalues from upper triangular matrix
Suppose T ∈ L(V) has an upper triangular matrix with respect to some basis of V. Then the eigenvalues of T are precisely the entries on the diagonal of the upper triangular matrix
Diagonal Matrix
A diagonal matrix is a square matrix that is 0 everywhere except possibly along the diagonal