Linear Algebra and Its Applications (5th Edition)

Published by Pearson
ISBN 10: 032198238X
ISBN 13: 978-0-32198-238-4

Chapter 2 - Matrix Algebra - 2.3 Exercises - Page 117: 21

Answer

No, due to theorems 5 and 8.

Work Step by Step

Th.5. states: If $A$ is an invertible $n\times n$ matrix, then for each $\mathrm{b}$ in $\mathbb{R}^{n}$, the equation $A\mathrm{x}=\mathrm{b}$ has the unique solution $\mathrm{x}=A^{-1}\mathrm{b}$. It is in form $p\rightarrow q$. The contrapositive (which is equivalent to it ) is $(\neg q)\rightarrow(\neg p)$ So, if it is not true that $G\mathrm{x}=\mathrm{y}$ has exactly one solution for every y, then G is not invertible. Then, using the IMT (Th.8), $\mathrm{a}. \quad A$ is an invertible matrix and $\mathrm{h}.\ \quad $The columns of $A$ span $\mathbb{R}^{n}$. are both false (when A=G).
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.