Question

Given sets A and B, what is the function f: A->B?

Given sets A and B, what is the function f: A->B?

Homework Answers

Answer #1

f: A→B be a function.

If each element in the codomain ‘ B‘ has at least one pre-image in the domain A that is, for every b ∈B there exists at least one element a ∈ A such that f(a) = b, then f is onto.

In other words range of f = B , for onto functions.

On the other hand if there exists at least one element in the codomain B which is not an image of any element in the domain A, then f is into.

Onto function is also called Surjective function and a function which is both one-one and onto is called Bijective function.

e.g. f : R->R where f(x) = sinx is into.

f : R−>R where f(x) = ax3 + b is onto where a ≠ 0 , b∈ R.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Given two sets A and B, the intersection of these sets, denoted A ∩ B, is...
Given two sets A and B, the intersection of these sets, denoted A ∩ B, is the set containing the elements that are in both A and B. That is, A ∩ B = {x : x ∈ A and x ∈ B}. Two sets A and B are disjoint if they have no elements in common. That is, if A ∩ B = ∅. Given two sets A and B, the union of these sets, denoted A ∪ B,...
Consider two sets A and B and a function f: A to B between them. Find...
Consider two sets A and B and a function f: A to B between them. Find a bijection from the half-open interval [0,1) to the closed interval [0,1] and show that it is bijective, or else show why it is impossible.
For the given grammar below, find the first and follow function sets. Then, construct the parsing...
For the given grammar below, find the first and follow function sets. Then, construct the parsing table. By using the LL(1) parser and the parsing table, find if the given string “acfh” is accepted or rejected. S → aBDh B → cC | ε C → bC | ε D → EF E → g | ε F → f | ε
Let A and B be nonempty sets. Prove that if f is an injection, then f(A...
Let A and B be nonempty sets. Prove that if f is an injection, then f(A − B) = f(A) − f(B)
Let A and B be nonempty sets. Prove that if f is an injection, then f(A...
Let A and B be nonempty sets. Prove that if f is an injection, then f(A − B) = f(A) − f(B)
X,Y be sets and f:X->Y is a function there's a function g:Y->X such that g(f(x))=x for...
X,Y be sets and f:X->Y is a function there's a function g:Y->X such that g(f(x))=x for all x∈X Prove or disprove: f is a bijection   
Discrete Math In this assignment, A, B and C represent sets, g is a function from...
Discrete Math In this assignment, A, B and C represent sets, g is a function from A to B, and f is a function from B to C, and h stands for f composed with g, which goes from A to C. a). Prove that if the first stage of this pipeline, g, fails to be 1-1, then the entire pipeline, h can also not be 1-1. You can prove this directly or contrapositively. b). Prove that if the second...
Let A, B, C be sets and let f : A → B and g :...
Let A, B, C be sets and let f : A → B and g : f (A) → C be one-to-one functions. Prove that their composition g ◦ f , defined by g ◦ f (x) = g(f (x)), is also one-to-one.
Let X, Y and Z be sets. Let f : X → Y and g :...
Let X, Y and Z be sets. Let f : X → Y and g : Y → Z functions. (a) (3 Pts.) Show that if g ◦ f is an injective function, then f is an injective function. (b) (2 Pts.) Find examples of sets X, Y and Z and functions f : X → Y and g : Y → Z such that g ◦ f is injective but g is not injective. (c) (3 Pts.) Show that...
2) Given sets A, B. Two sets are equivalent if there is a bijection between them....
2) Given sets A, B. Two sets are equivalent if there is a bijection between them. Prove A x B is equivalent to B x A using bijection