Solveeit Logo

Question

Question: Define a function. What do you mean by Domain and Range of a function? Give examples....

Define a function. What do you mean by Domain and Range of a function? Give examples.

Explanation

Solution

According to Set theory a function is defined as a relation between two sets A and B such that every element of the first set has exactly one image in the second set.

Complete step by step solution: If any element of the first set does not have an image in the second set, or if an element in the first set has more than one image in the second set, then the relation Is not a function from A to B.
The first set which contains the elements x'x' is called the Domain of the function ff while the second set which contains the images defined as per the function ff, that is,f(x)f(x)is called the range of the function ff.
For example:

Now, let us take two sets A and B respectively containing the elements A =\left\\{ {C,D,E,F,G} \right\\}and B = \left\\{ {2,3,5,7,9} \right\\}such that for all elements x'x' of the domain A there exists the image elements f(x)f(x) in B under the function ff, respectively. Such that:
f\left( C \right) = 2 \\\ f\left( D \right) = 5 \\\ f\left( E \right) = 3 \\\ f\left( F \right) = 9 \\\ f\left( G \right) = 7 \\\
However the function ff, will not be a function if any element of the Domain is associated with more than one element in the range. For example,

Now, the function ff is not a function because the element E \inDomain set A, has two images at 3 and 7 in the Range B.
Hence ff is not a function.
Therefore, we conclude by defining a function ffas a rule from one set A to another set B, such that the first set A containing the elements x'x', is called the Domain , while the set B containing the corresponding images f(x)f(x)is called the Range of the function ff.

Note: Functions are of many types. Let us consider two sets A and B. A one-to-one function is one where every element belonging to a set A, that has exactly one unique image in set B. An onto function is one where every element belonging to set B has at least one preimage in the set A. A function which is both one-to-one and onto, is called an injective function. If either of the characteristics is missing, the function will not be an injective function.