Vector Spaces Associated to Matrices Flashcards

1
Q

Define column space.

A

Let A be a m × n matrix. Then, the Column Space (AKA the Image of A – Im(A)) is Col(A) := Span{c1, · · · , cn},
where c1, · · · , cn are m × 1 columns of A (or vectors in R^m).
Recall from matrix multiplication that if x ∈ R^n, then Ax is a linear combination of the columns of A. So, Col(A) = {Ax | x∈R^n}.
Col(A) is a subspace of R^m.

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

Define row space.

A

The Row Space of a m × n matrix A is
Row(A) = Span{r1, · · · ,rm},
where r1, · · · ,rm are 1 × n rows of A (or vectors in R^n). Therefore, Row(A) is a subspace of R^n.

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

What is another term for nullspace?

A

Kernel

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

Define nullspace.

A

The nullspace of A (AKA as the kernel of A – ker(A)) is
ker(A) = {x ∈ R^n | Ax = 0}, or
The kernel is the general solution to the homogeneous linear system Ax = 0. ker(A) is a subspace of R^n.

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

Explain how basic solutions form a basis of kernel.

A

The spanning set of ker(A) obtained from the RREF of [A|0] (or the set of basic solutions of Ax = 0) is a basis for ker(A).

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

Define rank-nullity theorem.

A

Let A be a m × n matrix. The dimension of ker(A) is equal to the number of non-leading variables in [A|0], or
dim (ker(A)) + rank(A) = n (or # columns of A)

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

Describe the relationship between solving inhomogeneous systems and kernel.

A

Suppose Ax = b is a consistent linear system. Then,
1. If x=v is a solution to Ax=b and x=u is any
solution to Ax=0, then u+v is a solution to Ax=b.
2. If v and w are two particular solutions to Ax=b, then x=w−v is a solution to Ax = 0, or x=w−v belongs to ker(A).

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

What are 3 facts of linear combinations relevant here?

A
  1. If Ax = 0 has a unique solution, so does any consistent Ax = b,
  2. If Ax = 0 has infinitely many solutions with k parameters in the general solution, then any consistent Ax = b will also have infinitely many solutions with k parameters in the general solution,
  3. If b ∈/ Col(A), then Ax = b is inconsistent.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Give a Summary of Consistency of Linear Systems

A

Suppose A is a m × n matrix. The linear system Ax = b is consistent if and only if

  1. b is a linear combination of the columns of A,
  2. or b ∈ Col(A),
  3. or rank(A) = rank([A|b])
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

The system Ax = b is consistent for all b ∈ R

m if and only if: (5)

A
  1. Every b ∈ R^m is a linear combination of the columns of A, or
  2. there are no zero rows in the RREF of A, or
  3. Col(A) = R^m, or
  4. dim(Col(A)) = m, or
  5. rank(A) = m.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

A consistent system Ax = b has a unique solution ⇔ (7)

A
  1. Every variable is a leading variable, or
  2. there is leading 1 in every column of the RREF of A, or
  3. Ax = 0 has a unique solution, or
  4. the columns of A are Linearly Independent, or
  5. ker(A) = {0}, or
  6. dim(ker(A)) = 0, or
  7. rank(A) = n.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What are 2 ways to describe a subspace W of R^n?

A
  1. W = ker(A), for some m×n matrix A,

2. W = Span{u1, · · · , um}.

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