Sample Exam Practicals Flashcards

(36 cards)

1
Q

How do I determine linear independence of a set of vectors?

A

No vector can be written as linear combination of the others.

If number of pivots in REF = number of vectors. det != 0

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

How do I determine if it is a spanning set (of e.g. R^3)?

A

Any vector can be reached by a linear combination of the vectors.

If number of pivots in REF = 3.

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

How do I determine if it is a basis (of e.g. R^3)?

A

If it is both linearly independent and a spanning set of R^3.

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

How do I determine the dimension of Span(S)?

A

Number of linearly independent vectors.

The number of pivots in REF. (Rank)

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

How do I determine a basis of the row space of A?

A

Reduce to REF, Put non zero rows, in a set.

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

How do I determine a basis of the column space of A?

A

Reduce to REF, whatever columns contain pivot in REF, put corresponding columns in original matrix in a set.

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

How do I determine a basis of the row space that consists of rows of A?

A

Take A transpose, find column space A^T. This will be basis of row space of A.

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

How do I determine a basis of the null space N(A)?

A

Bring matrix to REF, find general solution. Abstracting free variables leads to basis.

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

How do I find the eigenvalues of A? How do I find their algebraic multiplicity?

A

Solve det(A - lambda * I) = 0

Number of times they appear as solution.

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

How do I find the eigenspaces of each eigenvalue? What are eigenvector and how do I find them? How do I find the geometric multiplicity of the eigenvalues?

A

Nullspace of (A - lambda * I) v = 0.

The set of eigenvectors is the basis of the eigenspace.

Nullity of A - lambda I

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

If nullity of A = 0? What is the nullspace? What is the rowspace of A in terms of the rows of A?

A

Empty set.
All the rows.

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

T or F. If there are more columns than rows, it cannot be linearly independent.

A

True

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

Diagonalizable algorithm.

A
  1. E-values must be in F
  2. E-Values must be distinct or the sum of all algebraic multiplicities equals n and the algebraic = geometric for all.
  3. Get eigenspaces, hence eigenbasis which form into columns of B.
  4. D is eigenvalues placed in order on diagonal appearing as many times as they do in characteristic polynomial.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Distinguish between eigenspace and basis of eigenspace.

A

Eigenspace is the nullspace of (A- lambda * I) v = 0. Basis of eigenspace is when we abstract away free variables and declare as spanning set.

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

f is given function. B is input basis in function is it V or W.

A

V

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

What are the steps when dealing with linear transformation?

A

Convert V and W (v.s. of bases) to be the same using isomorphism if possible.
Call basis 1 B (in V) and basis 2 C (in W)
Map B to E (in V) and map E (in W) to C
Map E (in V) to E (in W) using f.

Assuming we are looking for map from B1 to B2 using f answer is (map from E (in W) to C)* (map from E (in V) to E (in W)) * (map from B to E (in V))

17
Q

Step by step to calculate CBM?

A

M(E -> B) is the given matrix expressed in terms of the standard basis
M(E -> B)^-1 = M(B -> E).

If not easy standard basis. i.e. R2[x] = (1,x,x^2) then b1 = first equation bn = nth equation. Where b1,…,bn are the columns of M(E->B)

18
Q

Me->B, what is it?

A

CBM that takes b and outputs e.

19
Q

mat b,e (id) what is it?

A

CBM that takes b and outputs e.

20
Q

How do I calculate new coefficents in B?

A

[[v]]b (new coefficients)= CBM from old to new (Mb->e, mat e,b (id)) [[v]]g (old coefficients)

21
Q

If we have two bases in matrix form, and want to find Mb1->b2 what can we do? How would this be affected if dimF(b1) != dimF(b2)

A

Put b1 on left b2 on right. Perform ERO’s across both until b1 is I then b2 will be Mb1->b2.

If dimensions not equal there will be zero rows, we make the id as much as we can and then read off answer above zero rows on other side as our answer. The number of zero rows will be precisely the difference between the dimensions.

22
Q

When dealing with turning basis into standard basis, how do rows/columns line up?

A

row 1 = taking set to e1 of E.
row n = taking set to e2 of E.

I.e. If e1 = [1,0
0, 0] then for every 2x2 matrix in set take 1st element as row entries.

23
Q

How do function mapping work between standard basis?

A

Take 1st “column” of E i.e. e1 and insert into function, output is first column of answer. Keep going for all en.

24
Q

In the M form and mat form which one can we not find in linear transformation question directly without finding inverse?

A

M basis -> standard
mat standard,basis(idv)

25
What does det(A) != 0 imply?
A is invertible and Ax = 0 has only the trivial solution.
26
What is the formula for changing co-ordinates?
new co-ordinates = mat old,new(id) * old co-ordinates
27
What is matv,w(f^-1)?
(matv,w(f))^-1
28
Define L(subF)(V, W).
The set of all linear transformations f: V -> W.
29
T or F. The dimension of L(sub F)(V, W) is dimFV * dimFW?
True.
30
T or F. Ker(f) is isomorphic to the null space of matv,w(f).
True.
31
T or F. Im(f) = Column Space of matv,w(f).
False, it is isomorphic
32
Let V and V' be bases of V, and W and W' be bases of W. T or F. Nullity (mat v,w (f)) is isomorphic to column space (mat v'w' (f)). T or F. Nullity (mat v,w (f)) is isomorphic to nullity (mat v',w' (f)). T or F. Column space (mat v,w (f)) is isomorphic to column space (mat v',w' (f)) T or F. Column space (mat v,w (f)) is isomorphic to nullity (mat v,w (f))
False True True False
33
Let f: V -> W be a linear transformation. Define rank of f and nullity of f.
Rank(f) = dim(Im (f)) = rank(mat v,w (f)) Nullity(f) = dim(Ker(f)) = nullity(mat v,w(f))
34
Let f : V -> W be a linear transformation. T or F. dim V = dim Im(f) - dim Ker(f).
False, + not -
35
Let f : V -> W be a linear transformation. T or F. V / Ker(f) is isomorphic to Im(f).
True.
36
Let V be a finite dimensional vector space and let U be a subspace of V. T or F. dim (V / U) = dim V - dim U
True.