Is a function onto if there are 4 domains {a, b, c, d} with 3 codomains {x, y, z} where:
a > x
b > y
c > z
d (does nothing)
?
My notes state that every element in in domain must point to an element in the codomain, but my classmate told me that this is still onto or a surjection since d maps onto, or points to, the empty/null set.
Discrete Math: Onto
Page 1 of 12 Replies  261 Views  Last Post: 05 October 2014  10:34 PM
Replies To: Discrete Math: Onto
#2
Re: Discrete Math: Onto
Posted 05 October 2014  07:17 PM
Your terminology needs a bit of work. Let X = {a, b, c, d}. Then the set X is the domain. You don't have multiple domains. The elements a, b, c, and d are all in the domain. Similarly, Y = {x, y, z} is the codomain (singular).
A function f: X > Y is defined as such. For every g in X, there exists a k in Y such that f(x) = k. So f(d) must be defined. That is, d cannot map to nothing.
An onto function is a function such that every element in Y is "hit" on the mapping. So the following is a surjection:
f(a) = f(b) = x
f© = y
f(d) = z
If f(g) = x for every g in X, then the function is not onto.
I actually have a tutorial on functions you may find helpful.
A function f: X > Y is defined as such. For every g in X, there exists a k in Y such that f(x) = k. So f(d) must be defined. That is, d cannot map to nothing.
An onto function is a function such that every element in Y is "hit" on the mapping. So the following is a surjection:
f(a) = f(b) = x
f© = y
f(d) = z
If f(g) = x for every g in X, then the function is not onto.
I actually have a tutorial on functions you may find helpful.
#3
Re: Discrete Math: Onto
Posted 05 October 2014  10:34 PM
macosxnerd101, on 05 October 2014  07:17 PM, said:
Your terminology needs a bit of work. Let X = {a, b, c, d}. Then the set X is the domain. You don't have multiple domains. The elements a, b, c, and d are all in the domain. Similarly, Y = {x, y, z} is the codomain (singular).
A function f: X > Y is defined as such. For every g in X, there exists a k in Y such that f(x) = k. So f(d) must be defined. That is, d cannot map to nothing.
An onto function is a function such that every element in Y is "hit" on the mapping. So the following is a surjection:
f(a) = f( = x
f© = y
f(d) = z
If f(g) = x for every g in X, then the function is not onto.
I actually have a tutorial on functions you may find helpful.
A function f: X > Y is defined as such. For every g in X, there exists a k in Y such that f(x) = k. So f(d) must be defined. That is, d cannot map to nothing.
An onto function is a function such that every element in Y is "hit" on the mapping. So the following is a surjection:
f(a) = f( = x
f© = y
f(d) = z
If f(g) = x for every g in X, then the function is not onto.
I actually have a tutorial on functions you may find helpful.
Okay thank you, that helped. I also check out your link and will refer to it if I have anymore questions.
Page 1 of 1
