ma1513 2 Flashcards

1
Q

p is a projection of vector v onto the plane

A

v - p is orthogonal to the plane

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

projection p of a vector u onto V where V is a subspace of Rn</sub>

A

u-p is orthogonal to V i.e. dot product of (u-p) with every vector in V is 0

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

T(0)

linear transformation

A

0

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

T(u + v)

A

T(u) + T(v)

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

T(cu)

A

cT(u)

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

If x is an eigenvector associated with the eigenvalue λ, the eigenvalue of kx will be

A

λ

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

Zero vector can be an eigenvector T/F

A

F

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

0 can be an eigenvalue T/F

A

T

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

Eigenvalues of a triangular matrix

A

All diagonal entries

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

Eigenspace

A

Solution space of the homogeneous system (λI - A)x = 0

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

Finding the basis for eigenspace

A
  1. Solve the system (λI - A)x = 0 using GE
  2. Get the general soln and separate the parameters
  3. Write the associated vectors in the span
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Eigenvalue of I3

A

Only one eigenvalue 1

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

Eigenspace of I3

A

R3

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

If A is an n x n matrix, sum of multiplicities of eigenvalues

A

n

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

relation bw dimension of eigenspace and multiplicity

A

dim Eλi <= ri

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

Condition for n x n matrix A to be diagonalizable

A

A has n linearly independent eigenvectors

17
Q

BD
where D is a diagonal matrix

A

BD = (b1d1 b2d2 … bndn)

18
Q

A is an n x n matrix
|S| < n
where S is the total number of basis vectors from all eigenspaces

A

A is not diagonalizable

19
Q

A is an n x n matrix
|S| = n
where S is the total number of basis vectors from all eigenspaces

A

A is diagonalizable

20
Q

Algorithm for diagonalization

A
  1. Solve the characteristic polynomial det(𝜆𝜆I – A) to find all distinct eigenvalues 𝜆1, 𝜆2, …, 𝜆k.
  2. For each 𝜆i, find a basis S𝜆𝑖 for the eigenspace E𝜆𝑖 by solving (𝜆iI – A)x = 0
  3. Let S = S𝜆1 ∪ S𝜆2 ∪ … ∪ S𝜆k . (Then |S| is the total number of basis vectors from all the
    eigespaces)
21
Q

relation bw dimension of eigenspace and multiplicities

A

dim Eλi = |Sλi|

dim Eλi <= ri

22
Q

Condition when A is diagonalizable

in terms of Eλi and multiplicity

A

dim Eλi = ri

then |S| = r1 + r2 + .. + rk = n

23
Q

Condition when A is not diagonalizable

in terms of Eλi and multiplicity

A

dim Eλi < ri

then |S| < r1 + r2 + .. + rk = n

24
Q

remember this

A

when we carry out the diagonalization algorithm, after step 1, if we obtain n distinct eigenvalues, then we can straight away conclude that the matrix is
diagonalizable without going through the remaining steps

25
remember this pt. 2
All diagonal matrices are automatically diagonalizable
26
If A is a diagonalizable matrix with P–1AP = D, then Am =
PDmP–1