SOLVER7 Study. Nothing Else.
Chapter 1 Examples Q22

Find the number of all one-one functions from set \(A=\{1, 2, 3\}\) to itself.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

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 \).

📖 Counting One-One Functions from a Set to Itself

Detailed Explanation

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.

Formula Used

Number of one-one functions from a set of \( n \) elements to itself \( = n! \)

Solution

  1. Step 1: Identify the number of elements in the set. Here \( A = \{1, 2, 3\} \), so the number of elements is \( n = 3 \).
  2. Step 2: Recall the condition for a one-one function: distinct inputs must give distinct outputs. So the images of \( 1, 2, 3 \) must all be different elements of \( A \).
  3. Step 3: Count the choices for each element. For \( f(1) \) there are \( 3 \) possible images. Once chosen, \( f(2) \) must differ from \( f(1) \), leaving \( 2 \) choices. Then \( f(3) \) must differ from both, leaving \( 1 \) choice.
  4. Step 4: Multiply the choices using the counting principle. \[ 3 \times 2 \times 1 = 6 \] This is exactly \( 3! \).
  5. Step 5: Apply the formula for confirmation. \[ n! = 3! = 6 \] So there are \( 6 \) one-one functions from \( A \) to itself.

Final Answer

The number of all one-one functions from \( A = \{1, 2, 3\} \) to itself is \( 3! = 6 \).

Common Mistake

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! \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the set and count its elements. Here \( A = \{1, 2, 3\} \), so the number of elements is \( n = 3 \). — Reason: Knowing \( n \) tells us the size of both the domain and the codomain, which controls how many choices we have at each stage.
  2. Step 2: Recall the one-one condition: for any two elements \( a, b \in A \) with \( a \ne b \), we must have \( f(a) \ne f(b) \). — Reason: This injectivity condition means the images of \( 1, 2, \) and \( 3 \) must all be distinct members of \( A \).
  3. Step 3: Count the number of choices for \( f(1) \). Since no image has been used yet, \( f(1) \) can be any of the 3 elements in \( A \), giving 3 choices. — Reason: At the very first assignment there is no restriction, so all 3 elements of the codomain are available.
  4. Step 4: Count the choices for \( f(2) \). Because \( f(2) \) must differ from \( f(1) \), only 2 elements remain available, giving 2 choices. — Reason: One element of the codomain is already taken by \( f(1) \), so the pool of valid images shrinks by one.
  5. Step 5: Count the choices for \( f(3) \). Because \( f(3) \) must differ from both \( f(1) \) and \( f(2) \), only 1 element remains, giving 1 choice. — Reason: Two elements are already used, leaving exactly one unused element in the codomain.
  6. Step 6: Apply the Fundamental Principle of Counting by multiplying the independent choices together: \[ 3 \times 2 \times 1 = 6 \] This product is exactly \( 3! \). — Reason: Since each assignment is independent (subject to the distinctness constraint), the total number of valid functions equals the product of the number of choices at each stage.

Final Answer

The number of all one-one functions from \( A = \{1, 2, 3\} \) to itself is \( 3! = 6 \).

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \( A = \{1, 2, 3\} \), so \( n = 3 \).
  2. Step 2: Choices for images: \( f(1) \) has 3 options, \( f(2) \) has 2, \( f(3) \) has 1.
  3. Step 3: Total one-one functions \( = 3 \times 2 \times 1 = 3! = 6 \).

Answer: The number of all one-one functions from \( A = \{1, 2, 3\} \) to itself is \( 3! = 6 \).

➕ More Examples

More Examples

Example 1

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

Example 2

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

🎯 Try a Similar Question

Try a Similar Question

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.

Solution

  1. Step 1: Understand the problem: We need to count all one-one (injective) functions from \( B = \{a, b, c, d\} \) to itself. Since the domain and codomain have the same number of elements, a one-one function from \( B \) to itself is also onto (surjective), making it a bijection. So we are counting all bijections (permutations) of 4 elements.
  2. Step 2: Count the choices for each element: For the element \( a \), there are 4 possible images to choose from. Once an image is assigned to \( a \), only 3 distinct images remain for \( b \). Then 2 remain for \( c \), and finally only 1 remains for \( d \).
  3. Step 3: Apply the multiplication principle: By the fundamental principle of counting, the total number of one-one functions is: \[ 4 \times 3 \times 2 \times 1 = 4! \]
  4. Step 4: Calculate the result: Evaluating \( 4! \): \[ 4! = 4 \times 3 \times 2 \times 1 = 24 \]

Answer: The number of all one-one functions from \( B = \{a, b, c, d\} \) to itself is \( 4! = 24 \).

Everything you get with Solver7

More questions in Relations and Functions