## Unsolvable Inhomogenous Systems

We know that when an inhomogenous system has a solution, it has a whole family of them. Given a particular solution, it defines a coset of the subspace of the solutions to the associated homogenous system. And that subspace is the kernel of a certain linear map.

But must there always be a particular solution to begin with? Clearly not. When we first talked about linear systems we mentioned the example

In our matrix notation, this reads

or in purely algebraic notation.

We saw then that this system has no solutions at all. What’s the problem? Well, we’ve got a linear map . The rank-nullity theorem tells us that the dimension of the image (the rank) plus the dimension of the kernel (the nullity) must equal the dimension of the source. But here this dimension is , and so the rank can be at most , which means there must be some vectors which can’t be written as no matter what vector we pick. And the vector in the example is just such a vector outside the image of .

The upshot is that we can only solve the system if the vector lies in the image of the linear map , and it might be less than obvious what vectors satisfy this requirement. Notice that this is more complicated than the old situation for single equations of single variables. In that case, the target only has one dimension, and the linear transformation “multiply by the number ” only misses this dimension if , which is easy to recognize.