$A$ be an $n \times n$ matrix and suppose that the system $Ax=0$ has the unique solution $x=0$.

Question

I came across the following problem that says:

Let $A$ be an $n \times n$ matrix with real entries and suppose that the system $Ax=0$ has the unique solution $x=0$. Then the mapping $T\colon \mathbb R^n\rightarrow \mathbb R^n$ defined by $Tx=Ax$ is
$1.$ a bijection
$2.$ one-one but not onto
$3.$ onto but not one-one
$4.$ neither one-one nor onto.

I am not sure how to progress with it and in particular how to use the information "$Ax=0$ has the unique solution $x=0.$".Can someone point me in the right direction?Thanks in advance for your time.

Answer 1

What is $\ker T$? By definition is $\ker T=\{x\in\mathbb R^n:Tx=0\}=\{x\in\mathbb R^n:Ax=0\}=\{0\}$ by hypothesis.

Now use that:
A linear map $T:V\longrightarrow V$ ($V$ finite dimensional) is

• one-one iff $\ker T=\{0\}$,
• one-one iff is onto.

Answer 2

When $$Ax=0, ~~\text{and if}~~det(A)\neq 0$$ then $$A^{-1}Ax=A^{-1}0=0\Longrightarrow x=0$$ is our unique solution here. This means that the corresponding transformation $T|_A$ is one-one, so two last options are not true

Answer 3

You already accepted an answer while I was writing this, but I just wanted to give a very elementary answer.

To check whether $T$ is one-to-one:

Suppose $x,y\in V$ with $Tx = Ty$. Then $Ax = Ay$, so $A(x - y) = 0$, so $x - y = 0$ and hence $x=y$. Thus $T$ is one-to-one.

Any one-to-one function from a set to itself is a bijection.

Answer 4

The condition says precisely that the kernel of $T$ is $\{0\}$. For a linear transformation having trivial kernel is equivalent to being injective. For linear transformations between vectors spaces of the same dimension being injective is the same as being surjective is the same as being bijective.

Answer 5

1. A bijection: being one-to-one follows easily from the fact that $Ax=0\iff x=0$, and then conclude that the image of the (standard) basis vectors are linearly independent, so $\dim({\rm im\,} T)=n$.