Matrices: Number of solutions of Ax=c if we know the solutions to Ax=b

  • Thread starter Thread starter humantripod
  • Start date Start date
  • Tags Tags
    Matrices
humantripod
Messages
3
Reaction score
0
Hey guys,

Here is my question.

A is a 4x4 matrix and there are two vectors, b and c, which have 4 real numbers. If we are told that A(vector x)=(vector b) has an unique solution, how many solutions does A(vector x)=(vector c) have?

I honestly have no idea how to do this. I know that for A would be in the following rref form:

1 0 0 0
0 1 0 0 for Ax=b.
0 0 1 0
0 0 0 1
 
Physics news on Phys.org
"A(vector x)=(vector b) has an unique solution" is another way of saying that A has an inverse. How many inverses can a matrix have?
 
Only 1. So does this mean there is no solution for Ax=c?
 
It means there is only one solution for Ax=c:

Inv(A)A x=Inv(A)c → x=Inv(A)c
 
Another way to see it: suppose there is more than one solution to Ax = c.

If Ax1 = c and A x2 = c, then A(x1-x2) = 0

So if Ax = b, would be another solution A(x+x1-x2) = b

But there is only one solution to Ax = b.
 
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