Show that an onto function is always one-one.
Answer: An onto function is always one-one because for the range to cover all elements of the codomain, each distinct element in the domain must map to a distinct element in the codomain.
Step-by-step solution
Step 1: Understand the Definitions
We are given a function from set to set . We need to show that if is onto, it must also be one-one. Let's recall the definitions of onto and one-one functions.
Step 2: Definition of Onto Function
An onto (or surjective) function means that every element in the codomain (set ) has at least one corresponding element in the domain (set ) that maps to it. In simpler terms, the range of the function is equal to its codomain.
Step 3: Apply Onto Condition to the Given Sets
Since is an onto function from to , every element in must be an image of some element in . This means that the set of images must be exactly .
Step 4: Definition of One-One Function
A one-one (or injective) function means that distinct elements in the domain map to distinct elements in the codomain. In other words, if two elements in the domain have the same image, then they must be the same element.
Step 5: Prove One-One using Onto Property
We know that the range of is . This means that , , and must take on the values , , and in some order. For this to happen, , , and must all be distinct values. If any two of them were the same (e.g., ), then the range would contain only two distinct values, which contradicts the fact that the range is . Since , , and are distinct, it implies that distinct elements in the domain map to distinct elements in the codomain, thus is one-one.
More from this chapter
- Let A=-2,-1,0,1,2,3. Define a relation R on A by xRy if and only if y=max(x,1). If l is the number of elements in R, and m and n are the minimum numbers of orde
- 32. Show that f: R -> R defined as f(x) = x / sqrt(1 + x²) is one-one but not onto. (function, one-one, onto, real numbers, domain, codomain, range)
- Let A be the set of all students of a boys school. Show that the relation R in A given by R=(a, b): a is sister of b is the empty relation and R^()=(a, b): the
- Consider the identity function I_N: N → N defined as I_N(x)=x x N. Show that although I_N is onto but I_N+I_N: N → N defined as (I_N+I_N)(x)=I_N(x)+I_N(x)=x+x=2
- Prove that the relation R in the set A = 1, 2, 3, 4, 5 given by R = (a, b): |a - b| is even is an equivalence relation.
- Let f(x) = log_e x and g(x) = (x^4 - 2x³ + 3x² - 2x + 2)/(2x² - 2x + 1). Then the domain of f ° g is
- Let the domain of the function f(x) = cos^(-1) ( (4x + 5)/(3x - 7)) be [α, β] and the domain of g(x) = log_2(2 - 6log_7(2x + 5)) be [, ]. Then |7(α + β) + 4( +)
- Let A = 1, 2, 3,, 10 and R be a relation on A such that R = (a, b): a = 2b + 1. Let (a_1, a_2), (a_2, a_3), (a_3, a_4),, (a_k, a_k+1) be a sequence of k element