Is This Matrix Both Onto and One-to-One?

Click For Summary
SUMMARY

The matrix given in the discussion is a 3x3 matrix defined as follows: [3 -2 1], [1 -4 1], [1 1 0]. It has been established that this matrix is not one-to-one due to the existence of non-trivial solutions in the kernel of the transformation. Consequently, it cannot be onto either, as a linear transformation is onto if and only if it is one-to-one when mapping from a vector space to itself. The discussion emphasizes the importance of understanding the implications of changing the range of a function on its onto and one-to-one properties.

PREREQUISITES
  • Understanding of linear transformations and their properties
  • Familiarity with kernel and image of a transformation
  • Knowledge of matrix row reduction techniques
  • Concept of vector spaces and their dimensions
NEXT STEPS
  • Study the properties of linear transformations in detail
  • Learn about the relationship between kernel and image in linear algebra
  • Explore the implications of changing the range of a function on its properties
  • Investigate examples of one-to-one and onto transformations in different dimensions
USEFUL FOR

Students of linear algebra, educators teaching matrix theory, and anyone interested in the properties of linear transformations and their applications in vector spaces.

Arnoldjavs3
Messages
191
Reaction score
3

Homework Statement


Say I have a matrix:

[3 -2 1]
[1 -4 1]
[1 1 0]

Is this matrix onto? One to one?

Homework Equations

The Attempt at a Solution


I know it's not one to one. In ker(T) there are non trivial solutions to the system. But since I've confirmed there is something in the ker(T), does this indicate that it is also not onto as well? I know that being an onto transformation is the Im(T) where it represents all transformed vectors.

The reduced matrix I got was this:
[ 1 0 1/5 | c-b/5]
[0 1 -1/5 | b/5]
[0 0 0 | a - b ]

Can 0 = a-b ever? If I put in random values for a,b,c the system will be inconsistent usually.
 
Physics news on Phys.org
You should be aware that a linear transformation ##T: V \rightarrow V## is one-to-one if and only if it is onto.
 
JonnyG said:
You should be aware that a linear transformation ##T: V \rightarrow V## is one-to-one if and only if it is onto.

Let's assume that it was from R4 -> R3. What now? It should never be one-to-one in that case, but can it still be onto?
 
Yes it can. Take for example, ##T(x,y,z,w) = T(x,y,z,0)##.

But in any case, your transformation is from ##\mathbb{R}^3## to ##\mathbb{R}^3##
 
Arnoldjavs3 said:
Let's assume that it was from R4 -> R3. What now? It should never be one-to-one in that case, but can it still be onto?

Every function is onto its image, as by definition the "image" is precisely the set mapped to by the function. You have to careful, therefore, when talking about whether a function is onto. Onto refers to whether the function maps to all the "range" of the function. So, you can change a function from onto to not onto or vice versa, simply by changing the nominated range.

A linear transformation from a vector space into itself is onto iff it is one-to-one. But, if you change the nominated range, this is no longer true.

You could, therefore, have phrased your question better. You could have asked:

Say I have a matrix:

[3 -2 1]
[1 -4 1]
[1 1 0]

Does this matrix represent an onto mapping from ##\mathbb{R}^3## to iself?

Note that the property of being "one to one" can also be gained or lost by changing the domain of the function. Most often this is used, for example with trig functions, by restricting a function to a smaller domain to make it one-to-one and hence to have an inverse on that domain.
 

Similar threads

  • · Replies 10 ·
Replies
10
Views
3K
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
Replies
11
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K