Find the number of all one-one functions from set \(A=\{1, 2, 3\}\) to itself.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine three friends — Alice, Bob, and Carol — each wanting a different colored hat from a box of exactly three hats. Alice picks first and has 3 choices. Bob picks next and has 2 hats left. Carol gets the only remaining hat. Nobody shares a hat, just like a one-one function where no two people get the same output. Counting all possible ways they can pick gives us \( 3 \times 2 \times 1 = 6 \) arrangements. That is exactly what we are counting here.
Answer: The number of all one-one functions from \( A = \{1, 2, 3\} \) to itself is \( 3! = 6 \).
A function \( f : A \to A \) is called one-one (injective) if different elements of the domain always map to different elements of the codomain. In other words, no two distinct inputs share the same output. When the domain and codomain are the same finite set with \( n \) elements, a one-one function must send the \( n \) elements to \( n \) distinct images. Since there are exactly \( n \) elements available in the codomain and all images must be distinct, each such function is essentially a way of arranging (permuting) the \( n \) elements. This means the number of one-one functions equals the number of permutations of \( n \) objects, which is \( n! \). Here the set \( A = \{1, 2, 3\} \) has \( n = 3 \) elements.
Number of one-one functions from a set of \( n \) elements to itself \( = n! \)
The number of all one-one functions from \( A = \{1, 2, 3\} \) to itself is \( 3! = 6 \).
A common mistake is to compute the total number of all functions instead of only the one-one ones. The total number of functions from \( A \) to \( A \) is \( n^n = 3^3 = 27 \), but only \( 3! = 6 \) of them are one-one. Do not confuse \( n^n \) with \( n! \).
The number of all one-one functions from \( A = \{1, 2, 3\} \) to itself is \( 3! = 6 \).
One common mistake: students confuse the total number of functions from \( A \) to \( A \) (which is \( 3^3 = 27 \)) with the number of one-one functions (which is \( 3! = 6 \)). Remember, for a one-one function every image must be distinct, so repeated outputs are not allowed.
Answer: The number of all one-one functions from \( A = \{1, 2, 3\} \) to itself is \( 3! = 6 \).
Question: Find the number of all one-one functions from the set \( B = \{a, b, c, d\} \) to itself.
Solution: We need to count all one-one (injective) functions from \( B \) to itself, where \( B = \{a, b, c, d\} \). Since the domain and codomain are the same set with \( n = 4 \) elements, every one-one function from \( B \) to itself is a bijection (permutation) of \( B \). For such a function \( f: B \to B \): The element \( a \) can be mapped to any of the 4 elements. So there are 4 choices for \( f(a) \). Once \( f(a) \) is fixed, \( b \) can be mapped to any of the remaining 3 elements. So there are 3 choices for \( f(b) \). Similarly, \( c \) can be mapped to any of the remaining 2 elements. So there are 2 choices for \( f(c) \). Finally, \( d \) must be mapped to the only remaining element. So there is 1 choice for \( f(d) \). By the multiplication principle, the total number of one-one functions is: \[ 4 \times 3 \times 2 \times 1 = 4! = 24 \]
Answer: 24
Question: A set \( C = \{p, q, r, s, t\} \) has 5 elements. How many one-one functions can be defined from \( C \) to itself?
Solution: We need to count all one-one (injective) functions from \( C \) to itself, where \( C = \{p, q, r, s, t\} \). Here \( n = 5 \). Since the domain and codomain are the same finite set, every one-one function from \( C \) to itself must also be onto (surjective), making it a bijection — essentially a permutation of the 5 elements. We assign images to each element one at a time: Element \( p \) can be mapped to any of the 5 elements, giving 5 choices. Element \( q \) can be mapped to any of the remaining 4 elements, giving 4 choices. Element \( r \) can be mapped to any of the remaining 3 elements, giving 3 choices. Element \( s \) can be mapped to any of the remaining 2 elements, giving 2 choices. Element \( t \) must be mapped to the only remaining element, giving 1 choice. By the multiplication principle, the total number of one-one functions is: \[ 5 \times 4 \times 3 \times 2 \times 1 = 5! = 120 \]
Answer: 120
Question: Let \( B = \{a, b, c, d\} \) be a set with 4 elements. Find the number of all one-one functions from \( B \) to itself.
Answer: The number of all one-one functions from \( B = \{a, b, c, d\} \) to itself is \( 4! = 24 \).