Is f: R->R one-to-one and onto?

  • Thread starter relyt
  • Start date
In summary, the function f: R->R is defined by the rule where f(w) is -5 if x is less than 0, 0 if x is equal to 0, and 5 if x is greater than 0. To determine if the function is one-to-one and/or onto, you can use the horizontal line test. If a horizontal line can pass through two points on the graph, then the function is not one-to-one. In this case, the function is not one-to-one because both 3 and 10 map to 5. To show that the function is not onto, you can find an element in the codomain that is not mapped to. In this case, 10 is not
  • #1
relyt
6
0
Define f: R->R by the rule:

[tex]f(w) =
\left\{
\begin{array}{lr}
-5, if x < 0\\
0, if x=0\\
+5, if x > 0
\end{array}
\right.[/tex]


if f onto and/or one-to-one?

These questions always get me. Can someone please help me walk through this problem? What do I look for first, etc?

those should be "if" (if x < 0, if x=0, if x > 0 etc)

Any help would be appreciated.[tex]\bar{}[/tex]
 
Physics news on Phys.org
  • #2
I think I might be able to help you out.

A function is one-to-one if every element in the domain is mapped to a unique element in the range. Another way of saying that is that is that every element in the range is mapped to by at most one element in the domain. An easy way to check for this is to see whether the function passes the horizontal line test.

Your function is not one-to-one because 3 is in R and 10 is in R and f(3) = f(10) = +5. This means both 3 and 10 map to 5, or 5 is mapped to by both 3 and 10. You can draw a horizontal line y = 5 that passes through both points (3,5) and (10,5).


A function is onto if every element in the domain is mapped to by at least one element in the domain. Another way of saying this is that the range of the function is equal to the codomain. One way to show that something is one to one is to find a way to say which element in the domain maps to a given element in the range, and show that the method can find at least one element for any element in the codomain. An easy way of showing a function is not onto is to come up with one example of an element in the codomain which is not mapped to.

For instance, 10 is in R. But there are no x in R for which f(x) = 10. To prove this, note that any real number is positive, negative, or zero. If x is zero, f(x) = 0 =/= 10. If x is negative, x < 0 and f(x) = -5 =/= 10. If x is positive, f(x) = +5 =/= 10. The proof that f is not onto follows from considering these cases.


Does that answer your question?
 

Related to Is f: R->R one-to-one and onto?

1. What is the difference between a one-to-one and onto function?

A one-to-one function is a type of function where each element in the domain maps to a unique element in the range. This means that no two elements in the domain map to the same element in the range. On the other hand, an onto function is a type of function where every element in the range is mapped to by at least one element in the domain. This means that there are no "leftover" elements in the range that are not mapped to by any element in the domain.

2. How can I determine if a function is one-to-one or onto?

To determine if a function is one-to-one, you can use the horizontal line test. If a horizontal line intersects the graph of the function at more than one point, then the function is not one-to-one. To determine if a function is onto, you can use the vertical line test. If a vertical line intersects the graph of the function at more than one point, then the function is not onto.

3. Can a function be both one-to-one and onto?

Yes, a function can be both one-to-one and onto. This type of function is called a bijective function, and it means that every element in the domain maps to a unique element in the range, and every element in the range is mapped to by at least one element in the domain.

4. What is the importance of one-to-one and onto functions?

One-to-one and onto functions are important in various areas of mathematics and science, such as in linear algebra and cryptography. These types of functions allow for easy and efficient manipulation of data, and they can also ensure that information is transmitted accurately and securely.

5. Can a function be one-to-one or onto without being injective or surjective?

No, a function cannot be one-to-one or onto without being injective or surjective, respectively. Injectivity and surjectivity are properties of functions that are necessary for them to be one-to-one and onto. A function must have both of these properties in order to be considered bijective and therefore one-to-one and onto.

Similar threads

  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
4K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
895
  • Advanced Physics Homework Help
Replies
19
Views
977
  • Set Theory, Logic, Probability, Statistics
Replies
9
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
5
Views
978
  • Linear and Abstract Algebra
Replies
19
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
702
  • Linear and Abstract Algebra
Replies
3
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
1K
  • Precalculus Mathematics Homework Help
Replies
11
Views
864
Back
Top