Is Every Statement Correct in Defining an Onto Function?

  • Context: MHB 
  • Thread starter Thread starter lemonthree
  • Start date Start date
  • Tags Tags
    Definition Function
Click For Summary

Discussion Overview

The discussion revolves around the definitions and characteristics of onto functions, specifically examining various statements to determine which accurately describe an onto function from set A to set B. Participants analyze multiple options and their equivalence to the definition of onto functions, engaging in a detailed exploration of the implications of each statement.

Discussion Character

  • Debate/contested
  • Conceptual clarification

Main Points Raised

  • Some participants propose that the statement "f(A) = B" is correct because it indicates that the range of the function equals the codomain.
  • Others argue that the statement "∀y∈B ∃x∈A such that f(x)=y" is also valid as it asserts that every element in B is mapped from some element in A.
  • A participant notes that "f^{-1}(B) = A" is true for any function, not just onto functions, suggesting it may not be a defining characteristic of onto functions.
  • Some participants express uncertainty about whether the definition of a function itself, "∀x∈A ∃y∈B such that f(x)=y", qualifies as a statement that defines an onto function.
  • There is a discussion about the implications of the statement "Every element of A has a corresponding image in B," with some participants indicating it does not necessarily pertain to onto functions.
  • Several participants confirm that "Every element of B has at least one preimage" is a correct statement regarding onto functions.

Areas of Agreement / Disagreement

Participants generally do not reach a consensus on which statements correctly define an onto function, with multiple competing views on the validity of each statement presented.

Contextual Notes

Participants highlight the distinction between the range and codomain of a function, indicating that some statements may apply to functions in general rather than specifically to onto functions. There is also uncertainty regarding the implications of certain definitions and their relevance to the concept of onto functions.

Who May Find This Useful

This discussion may be useful for students and educators in mathematics, particularly those exploring the properties of functions and the concept of onto functions in set theory.

lemonthree
Messages
47
Reaction score
0
Which of the following statements is equivalent to saying that a function f:A→B is onto? There are 8 options, select all that are correct.
xf(A)=B
xIn the arrow diagram representing f, every point in B has an arrow pointing at it.
x∀y∈B ∃x∈A such that f(x)=y
xf−1(B)=A
xEvery element of B is the image of some element in A
∀x∈A ∃y∈B such that f(x)=y
Every element of A has a corresponding image in B
xEvery element of B has at least one preimage.

I have marked with an "x" those that I believe are correct. However, I am not entirely sure.
Let me explain my selection.
1. f(A) = B is true, because B is the whole set B where A is mapped to B, so it is onto? (range = codomain)
2. Valid, because it shows that the range = codomain.
3. Similar to point 2, it shows that range = codomain.
4. In this case, it is similar to 1? It seems to say that the whole set of B can be mapped back to A.
5. Yes, every element of B (codomain) is the image of some x in A.
6. Not true for onto function, because it does not cover all of B, only some in B.
7. Not true for onto function, because it does not talk about covering all options in B.
8. True because every element of B is covered.

Please point out if I have made any mistakes in my explanation, thank you!
 
Physics news on Phys.org
The definition of "function from A to B", whether "onto" or not, requires that
"∀x∈A ∃y∈B such that f(x)=y".
 
Last edited:
Indeed, I agree with you. However, I did not select it because the question asks "Which of the following statements is equivalent to saying that a function f:A→B is onto?". So I'm guessing that a normal function won't make the cut?
 
Regarding point 4, $f^{-1}(B) = \{x \in A \mid f(x)\in B\}$. Since B is the co-domain, this is true for any function $f:A\to B$.
 
f(A)=B
xIn the arrow diagram representing f, every point in B has an arrow pointing at it.
x∀y∈B ∃x∈A such that f(x)=y
f−1(B)=A
xEvery element of B is the image of some element in A
∀x∈A ∃y∈B such that f(x)=y
Every element of A has a corresponding image in B
xEvery element of B has at least one preimage.

Thank you very much @castor28 for pointing that out. Following that logic, I should also not select f(A)=B because B is the codomain (and it doesn't mention that the range = codomain?)

So I guess there are only 4 sentences that describe an onto function here
 
Point 1 was correct.

$f(A)$ is the range, $B$ is the co-domain. $f$ is onto if the range equals the co-domain, i.e., if $f(A) = B$.
 
castor28 said:
Point 1 was correct.

$f(A)$ is the range, $B$ is the co-domain. $f$ is onto if the range equals the co-domain, i.e., if $f(A) = B$.

I see, thank you for your explanation.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 8 ·
Replies
8
Views
5K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 6 ·
Replies
6
Views
5K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K