Test 3 Flashcards

1
Q

If Ax = $x for some vector x, then $ is an eigenvalue of A

A

TRUE - by definition

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

If Ax = $x for some scalar $, then x is an eigenvector of A

A

TRUE - by definition

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

A matrix A is invertible if and only if 0 is an eigenvalue of A

A

FALSE - not enough info, eigenvalue can be 0 does not mean invertible

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Finding an Eigenvector of A may be difficult, but checking whether a given vector is in fact an eigenvector is easy

A

TRUE - there should be a scalar associated with said vector resulted in A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

To find eigenvalues of A, reduce A to echelon form

A

FALSE - not necessarily

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

If v1 and v2 are linearly independent eigenvectors, then they correspond to distinct eigenvalues

A

TRUE - eigenvectors associate with their own eigenvalues

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

If v is an eigenvector with eigenvalue 2, then 2v is an eigenvector with eigenvalue 4.

A

TRUE - eigenvalue gets scaled by the same scalar factor (2) used to multiply the eigenvector

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

If 0 is an eigenvalue of A, then A is invertible

A

FALSE - but if A is non-invertible (meaning it doesn’t have an inverse), then 0 must be an eigenvalue of A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

The matrices A and B-1.A.B have the same sets of eigenvalues for every invertible matrix B

A

TRUE - pre-multiplying and post-multiplying a matrix by the inverse of another invertible matrix doesn’t change the eigenvalues because the transformation properties are preserved by the similarity relation.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

A is diagonalizable if A =PDP-1 for some matrix D and some invertible matrix P

A

TRUE - by definition

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

A is diagonalizable if and only if A has n eigenvalues, counting multiplicities

A

FALSE - missing condition: A needs to have n linearly independent eigenvectors (where n is the dimension of the matrix) AND The n eigenvectors must also span the entire vector space that A operates on

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

A is diagonalizable if A has n eigenvectors

A

FALSE - missing condition

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Similar matrices have the same eigenvalues

A

TRUE - the similarity relation between matrices preserves the eigenvalues because it only changes the representation of the transformation, not the underlying scaling properties captured by the eigenvalues.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Similar matrices have the same eigenvectors

A

FALSE -while similar matrices share the same “stretching factors” (eigenvalues), the specific directions along which this stretching occurs (eigenvectors

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Only linear transformation on finite vectors spaces have eigenvectors

A

FALSE - if the eigenvalues turn out to be complex and the scalars are restricted to real numbers), the concept itself is not limited to finite dimensions.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

If there is a non zero vector in the kernel of a linear transformation of T, then 0 is an eigenvalue of T

A

TRUE - u is a non zero vector, T(u) is in kernel of A , A.0 = u.0 so 0 is an eigenvalue of T

17
Q
A