Linear Algebra Final Flashcards

1
Q

What is the definition of Row Echelon Form?

A

1) Any rows consisting entirely of zeros are at the bottom.
2) In each nonzero row, the first entry (called the leading entry) is in the column to the left of any leading entries below it.

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

What is row equivalent matrices?

A

If there is a sequence of row operations that convert one matrix into the other. (If so the two matrices have the same set of solutions)

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

What constitutes a linearly inconsistent system?

A

When there is no set of values for the unknows that satisfies all of the equations. (I.E. no solution) Graphical representation in 2D would be the lines never crossing.

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

What is the Rank of a matrix (Rank(A))?

A

Is the number of nonzero rows in the given matrix A that is in Row Echelon form.

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

What is the bound variable?

A

)

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

What is a free variable?

A

Any variable that is not a bound variable

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

What is the definition of row-reduced echelon form?

A

1) It is in Row Echelon From
2) The first nonzero entry in each row is 1
3) The first nonzero entry in each row is the only nonzero entry in its column

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

What is the definition of a homogenous linear system?

A

A system of linear equations having matrix form Ax = O, where O represents a zero column matrix

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

How to prove that a homogenous linear system has infinite solutions?

A

If this determinant of the system is zero, then the system has an infinite number of solutions. Or if the system has fewer equations then unknowns.

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

When does Ax = b have a solution for all b in R^m if A is an mxn matrix?

A

Only when rank(A) = m

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

What is the definition of span?

A

The span of the vectors (v1,v2,…vn) is the set of all linear combinations of the vector v1 through vn.

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

What does it mean for a linear system to be consistent?

A

A system is consistent if there is at least one set of values for the unknowns that satisfies each equation in the system.

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

When is Ax = b consistent given A is an m x n matrix with column vectors v1, v2, … vn and b is a vector in R^m?

A

It is consistent if and only if b is in the span(v1, v2, … vn)

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

What are the conditions for a matrix to be invertible?

A

1) Matrix must be a square matrix
2) Rank(A) = n
3) The linear system Ax = b has a unique solution for every b in R^n
4) The homogenous linear system Ax = 0 has only the trivial solution x = 0
5) The reduced echelon form of A is A_n ( Columns of A are linearly independents)

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

A set of vectors W in R^m is called a subspace of R^m if?

A

Is a special collection of vectors that satisfies the following. Remember that a span is always a subspace.
1) The vector 0 is in W
2) If you add any 2 vectors in the set together, you get a vector also in the set.
3) If you multiply any vector in the set by any scalar you geta vector also in the set.

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

What is a basis?

A

A basis is for a subspace (W) - it is a set of linearly independent vectors that span W.

17
Q

What is a subset?

A

Any collection of vectors

18
Q

What is the column space of A?

A

It is defined as all the linear combinations of the column vectors of A (also knows as the span (column vectors of A))

19
Q

What is the null space of A?

A

The null(A) is just solutions to Ax = 0. Or in other words the set of x in R^n where Ax = 0 where A is an m x n matrix. Null space is always a span. The vectors of the null space are always linearly independents so they are the basis for null space of A.

20
Q

What is Nullity of A?

A

Nullity(A) = dim(null(A))

21
Q

What is rank nullity theorem state?

A

rank(A) + nullity(A) = n

22
Q

What is an eigenvector and eigenvalue?

A

We call a nonzero vector x an eigenvector of A with corresponding eigenvalue if Ax = λx

23
Q

Is the matrix A - λI invertible?

A

NO

24
Q

What does it mean when a matrix is diagonalizable?

A

There must exist an invertible matrix P and a diagonal matrix D such that A = PDP^-1. It also is only diagonalizable if and only if for every eigenvalue λ of A there is a unique eigenvector…that is to say the algebraic multiplicity of λ is equal to the geometric multiplicity of λ.

25
Q

What are the necessary requirements for A and B to be similar?

A

a) det(A) = det(B)
b) A is invertible if B is invertible
c) rank(A) = rank(B)\
d) A and B have the same characteristic polynomial
e) A and B have the same eigenvalues

26
Q

How do you know if a linear system has only one unique solution?

A

In a set of linear simultaneous equations, a unique solution exists if and only if, (a) the number of unknowns and the number of equations are equal, (b) all equations are consistent, and (c) there is no linear dependence between any two or more equations, that is, all equations are independent.

27
Q

What is projection of y onto x equation?

A

proj_x ^y = ((xy)/(xx)) *x

28
Q

What does an orthogonal set tell you>

A

If the set (S) is an orthogonal set of nonzero vectors then vectors v1,v2…vn are linearly independent. If the set is an orthonormal set then the vectors v1,v1,…vn are linearly independent.

29
Q

When do you have an orthogonal basis?

A

The set S is an orthogonal basis for W if S is orthogonal and S is a basis for W.

30
Q

What is the fastest way to figure our the dimension that a vector set spans?

A

You can put the vectors into a matrix and row-reduce it and however many pivots you get that is the dimension of the span.

31
Q
A