Proving Invertibility of A^TA with Linearly Independent Columns

eunhye732
Messages
11
Reaction score
0
Linear Algebra PLS HELP!

I need help on this problem and been trying to figure it out for awhile.
Let A be an m x n matrix with linearly independent columns. Show that A^TA is invertible.
anything will help. Thanks
 
Physics news on Phys.org
I assume you meant A^tA? Anyway, consider the size of that matrix to begin with, that's over half the solution right there. Ah and for future reference, maybe you should post questions like this in the other homework help forum since Linear Algebra is typically taught beyond calculus. Maybe there are some people who exclusively look in that thread to answer problems.
 
Last edited by a moderator:
What is the rank of A? What is the rank of A^tA?
 
I'm feeling stupid right now. Disregard my earlier suggestions--while they do work eventually, they are more trouble than they are worth. A good way to approach this problem is by considering what would happen if one of the columns of the product was a linear combination of the other columns, writing out what that would mean, and proceeding to a contradiction.
 
Disregard my earlier suggestions--while they do work eventually, they are more trouble than they are worth.
I don't think they're bad. I think you can make the problem much simpler by doing column operations to write A = A'C where C is the matrix representing the column operations, and A' is of a special form. Of course, it means you have to pick a good special form, but hey! Math is an art. :biggrin:
 
Last edited:
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