Equivalent definitions in linear algebra

HelpNeeder

New member
Joined
Feb 17, 2021
Messages
33
IMG_9740.jpg
These 4 statements are equivalent. However, I do not fully understand why statement 1 is equivalent with the other three statements.
Let's say that the matrix A has a row with only zeros. Why does this mean that Ax = b doesn't have a solution for each b? Could someone explain it to me?

Thank you in advance.
 
Last edited:
When you multiply A by x you are basically computing the dot product of each row of A with x.
What do you get when you dot the row of zeros with x? Does that place a restriction on b?
 
When you multiply A by x you are basically computing the dot product of each row of A with x.
What do you get when you dot the row of zeros with x? Does that place a restriction on b?

Thank you for the answer! It places the restriction that b also needs to have a row of zeros?
 
This excerpt from a Linear Algebra text may help.
1617734995685.png

An earlier theorem
1617735533563.png
 
Thank you for the answer! It places the restriction that b also needs to have a row of zeros?
Technically your answer is not wrong but I just assume that you think that this row of b that has all zeros will be something like (0 0 0 0). This is nonsense as b is a column vector meaning that each row has exactly one entry. So think about it some more.
 
Yes. They could have used any column vector d with a non-zero value in the last entry. That just makes the bottom row of [U d] consist of a set of 0s followed by a non-zero. This is an inconsistent system of equations. They then apply the reverse of the row operations which transformed A into U, to change [U d] to the form [A b] (for some b) and since [U d] is inconsistent then so too is [A b].
The logic of the argument then is: if statement (1) is false, then U, an echelon form of A will have a row of 0s on the bottom row. Augment this with any vector d with a non-zero value on the bottom row. Then [U d] will be an inconsistent system. (Existence and Uniqueness Theorem above). This can then be transformed by row operations into the form [A b] for some b (the result of the row operations on d), and as this was achieved by row operations, this system is also inconsistent. Therefore statement (3) fails.
So they have argued that (1) false [MATH]\implies[/MATH] (3) false which is logically equivalent to (3) [MATH]\implies[/MATH] (1).
 
Top