0
$\begingroup$

How can I prove that the transformation $$ T: R^3 \to R^2 : \ T(a_1, a_2, a_3) = (a_1-a_2, 2a_3)$$ is one-to-one and/or onto?

  • 3
    What is the image of $(x,0,y/2)$? And of $(x,x,z)$?2012-10-16
  • 1
    @Sigur: perhaps $(x+z,z,y/2)$ might have been another educational example2012-10-16
  • 0
    To see it is not one to one, just check the image of the two points $(1,1,1)\,,(-1,-1,1)$. These two points shares the same image $ (0,1) \,,$ which implies that the map is not one to one.2012-10-17

1 Answers 1

0

For one-to-one you need to show that if two points in $\mathbb R^3$ are mapped to the same point, they are the same. So let $x=(x_1,x_2,x_3)$ and similarly for $y$. Then assume $T(x)=T(y)$, insert the definition of $T$ and see if you can prove that $x_1=y_1$ and so on.

For onto, you need to show that all points in $\mathbb R^2$ can be reached. So let $x=(x_1,x_2)$ and see if you can find a $y$ such that $T(y)=x$. You should be able to find many of them. If you do this part first, it answers the other as well.

  • 0
    Is there a general way to prove it, i.e. for $R^n \to R^m$?2012-10-16
  • 1
    @Imray: If $n \gt m$, it cannot be one-to-one. If $n \lt m$, it cannot be onto. You should soon learn a theorem about the sum of the dimensions of the kernel and image adding to the dimension of the domain.2012-10-16
  • 0
    I can see from the dimension theorem how you would prove when n < m, but how do you prove it cannot be 1-to-1 when n > m? In the equation $rank(T)+Nullity(T) = dim(V)$, Nullity can be equal to zero.2012-10-17
  • 0
    @Imray: Because the rank(T) can't be greater than dim(range), not dim(domain)2012-10-17
  • 0
    I still dont understand. By the dimension theorem, for $T: V \to W, \ R^n \to R^m, \ \ rank(T)+nullity(T)=dim(v)$. So when $n < m $, I can clearly see for the formula to add up (with $rank(T) = m$) that $nullity(T) > 0$ which means the transformation cannot be one-to-one. But what about when $n>m$?2012-10-17
  • 0
    @Imray: I think you mean $n \gt m$ in the first. When $n \lt m$, the rank of $T$ can't be greater than $n$, so it cannot be onto.2012-10-17