Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

True or False?

Let $A$ be an $m x n$ matrix. If $m \lt n$, then for each $b$ in $\mathbb R^{m}$ the linear system $Ax=b$ is either inconsistent or has infinitely many solutions.

Can anyone explain this only using beginner level linear algebra material (e.g. vector spaces, bases, linear independence/dependence) ?

share|cite|improve this question
up vote 1 down vote accepted

Maybe this is how it works for you. Because of $m <n$ the kernel of $A$ can not be trivial. Because it's not trivial there is $v\in \text{kern}(A)$ with $v\neq 0$. Now let $x$ be a solution of $$A x=b.$$ We can construct infinitely many others solutions from this one, taking $$ A(x+\gamma v)=Ax + A (\gamma v)=Ax+ \gamma A v =Ax=b$$ for any $\gamma \in \mathbb{R}$.

share|cite|improve this answer
by kernel, do you mean null space? – Johnathon Svenkat Feb 14 '13 at 17:22
yeah sry english is a foreign language :( – Dominic Michaelis Feb 14 '13 at 17:23
no worries. thanks for your help! – Johnathon Svenkat Feb 14 '13 at 17:25

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.