Linear Algebra: Proving A+A' Has Infinite Solutions

ThankYou
Messages
21
Reaction score
0
linear algebra A' is A when two of A lines switched,A Invertible prove (A+A')x=0...

Homework Statement


A is a n*n matrix
A' is the matrix A when two two lines i,j are switched.
(switch two random lines is A and you get A')
If A Invertible Prove that the system (A+A')x=0 has infinite solutions

Homework Equations


linear algebra including Determinant


The Attempt at a Solution



Well I know that A+A' has two identical lines so when subtracting them I get a line of 0 and then Because I know there is a line of 0 I know that there are infinite solutions...
But I did not used the fact that A is Invertible...
How do I solve it while using this fact? , I try to use Determinant but I do not mange to.
Thank you.
 
Physics news on Phys.org


let Det(A)=k
then Det(A')=-k (two rows are switched)

Det(A+A')=?
 


Thank you very much
 


sakodo said:
let Det(A)=k
then Det(A')=-k (two rows are switched)

Det(A+A')=?

That logic doesn't work because det(A+A') is not equal to det(A)+det(A'). You need to think of something else ThankYou. Might it be that A+A' has two identical rows? How can you use that? You don't need the premise that A is invertible.
 


Dick said:
That logic doesn't work because det(A+A') is not equal to det(A)+det(A'). You need to think of something else ThankYou. Might it be that A+A' has two identical rows? How can you use that? You don't need the premise that A is invertible.

My bad.
 


Ha...
I've just got the Homework result back...
88
I got -6 for this question..
I know about the two identical lines but it did not used the fact that A is invertible...

Actually they just put the invertible fact to confuse because the teacher solution was the same as Dick without using the invertible Fact

Thanks anyway.
 
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