Is every strictly increasing function onto?

In summary, proving that a function is one-to-one does not necessarily mean it is "onto". Additionally, a strictly increasing function does not guarantee it is "onto", as there are counterexamples. It is possible that the OP may be referring to a bijective function when using the term "one-to-one".
  • #1
Piffo
2
0
If I want to prove that a non specified function f(x) that maps x -->x' is onto could I show that f(x) is one to one and that f(x')^-1 (the inverse function) is also one to one??
Would that be a valid justification to say that thus f(x) must be onto?

More specifically I am looking to prove that every strictly increasing function is onto.

Francesco
 
Physics news on Phys.org
  • #2
Not every strictly increasing function is onto (e.g., f(x)=x+u(x), where u is the Heaviside step function).
 
  • #3
Proving that a function is one-to-one tells you nothing about it being "onto". In particular, you can't use the inverse function because if you don't already know that a function is "onto", you don't know that it has an inverse.

You can stop "looking to prove that every strictly increasing function is onto" because it is not true. The function for R to R defined by y= x if x< 0, y= x+1 if [itex]x\ge 0[/itex] is strictly increasing but is not "onto".
 
  • #4
HallsofIvy said:
Proving that a function is one-to-one tells you nothing about it being "onto". In particular, you can't use the inverse function because if you don't already know that a function is "onto", you don't know that it has an inverse.

You can stop "looking to prove that every strictly increasing function is onto" because it is not true. The function for R to R defined by y= x if x< 0, y= x+1 if [itex]x\ge 0[/itex] is strictly increasing but is not "onto".
Wow. We came up with the same counterexample. :-)
 
  • #5
Perhaps you are trying to prove that every strictly increasing function has an inverse mapping its range back to it's domain or something like that. Or, in other words, that if x<>y, then f(x)<>f(y).
 
  • #6
There is the possibility that the OP meant "bijective" by "1-to-1."
(It should be noted that one-to-one function means one-to-one correspondence (i.e., bijection) to some authors, but injection to others.)
http://en.wikipedia.org/wiki/Bijection
 

1. What is a set?

A set is a collection of distinct objects or elements. These objects can be anything, such as numbers, letters, or even other sets.

2. What makes a set different from a list?

A set is different from a list in that it cannot contain duplicate elements. Additionally, the order of elements in a set does not matter, whereas the order of elements in a list is important.

3. How do you represent a set in mathematics?

A set is typically represented by curly braces { } and a list of its elements separated by commas. For example, the set of even numbers can be represented as {2, 4, 6, 8, ...}.

4. What is the cardinality of a set?

The cardinality of a set is the number of elements it contains. It is denoted by the symbol |S|, where S is the name of the set. For example, the cardinality of the set {1, 2, 3} is 3.

5. How do you determine if an element is in a set?

To determine if an element is in a set, we use the "element of" symbol ∈. If an element is in a set, we say that it is a member of the set. For example, 3 ∈ {1, 2, 3} means that the number 3 is a member of the set containing 1, 2, and 3.

Similar threads

Replies
3
Views
1K
Replies
1
Views
833
Replies
2
Views
935
Replies
24
Views
2K
Replies
4
Views
1K
Replies
1
Views
1K
  • Calculus
Replies
1
Views
959
  • Calculus and Beyond Homework Help
Replies
1
Views
458
Replies
11
Views
2K
Back
Top