Linear Algebra - Basis of column space

tg22542
Messages
79
Reaction score
0

Homework Statement


Let A be the matrix
A =
1 −3 −1 2
0 1 −4 1
1 −4 5 1
2 −5 −6 5

(a) Find basis of the column space. Find the coordinates of the dependent columns relative
to this basis.
(b) What is the rank of A?
(c) Use the calculations in part (a) to find a basis for the row space.


Homework Equations


---

The Attempt at a Solution



I used Gauss-Jordan operations on the matrix to solve it down to :

1 0 -13 5
0 1 -4 1
0 0 1 0
0 0 0 0

From here we can see which columns are linearly independent and which are dependent. But I don't understand what they want me to write for a solution for the coordinates.

Would they simply be:

(1,0,-13)
(0,1,-4)
(0,0,1)

??

b) Not sure exactly what this means even after researching, how do I determine the rank ?

c) I feel I can do after I complete a)

Thanks
 
Physics news on Phys.org
For part 1, by definition, ##Col(A) = span\{a_1, ... a_n\}## where ##a_1, ... a_n## are the linearly independent columns of ##A##.

The basis happens to be the set ##\{a_1, ... a_n\}## (without the "span" portion).

Also, do you know about coordinate vectors?
 
Your given matrix has 4 numbers in each column. That is each column is in R^4. So how can the span of {(1,0,-13), (0,1,-4), (0,0,1)} be subset of R^4?. You need to get your definitions done perfectly before you can solve these problems.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top