- #1

- 367

- 0

One part of the theorem states that for an nxn invertible matrix, then there exists at least one solution for each b in Ax=b. Why wouldn't it be "there exists at MOST one solution for each b" since every column/row has a pivot. How would there exist more than one solution for each b if the columns span R_n?