What is a Bijective Function?

S3-SA5-0015

Grade Level:

Class 9

AI/ML, Data Science, Physics, Economics, Cryptography, Computer Science, Engineering

Definition

What is it?

A bijective function is a special type of function where every input (from the 'domain') has exactly one unique output (in the 'codomain'), and every possible output is used exactly once. Think of it like a perfect one-to-one pairing without any leftover inputs or outputs.

Simple Example

Quick Example

Imagine you have 3 friends (A, B, C) and 3 unique T-shirts (Red, Blue, Green). If each friend gets exactly one T-shirt, and each T-shirt is given to exactly one friend, then this matching is a bijective function. No friend is left without a T-shirt, and no T-shirt is left without a friend.

Worked Example

Step-by-Step

Let's check if the function f(x) = x + 2, where the input set (domain) is {1, 2, 3} and the output set (codomain) is {3, 4, 5}, is bijective.
---Step 1: Find the output for each input.
f(1) = 1 + 2 = 3
f(2) = 2 + 2 = 4
f(3) = 3 + 2 = 5
---Step 2: Check if each input has a unique output (one-to-one).
Input 1 gives output 3. Input 2 gives output 4. Input 3 gives output 5. All outputs are different, so it's one-to-one.
---Step 3: Check if every output in the codomain is used (onto).
The codomain is {3, 4, 5}. Our outputs are {3, 4, 5}. All outputs in the codomain are used.
---Step 4: Conclude.
Since the function is both one-to-one (injective) and onto (surjective), it is a bijective function.
Answer: Yes, f(x) = x + 2 is a bijective function for the given sets.

Why It Matters

Bijective functions are super important in Computer Science and Data Science for secure data handling and efficient algorithms. They help engineers design systems where every input has a unique result, and vice versa. Understanding them can open doors to careers in AI, Cryptography, and even game development.

Common Mistakes

MISTAKE: Thinking a function is bijective just because every input has an output. | CORRECTION: It must also be true that every output is used, and each output comes from only one input. It needs to be both 'one-to-one' and 'onto'.

MISTAKE: Confusing a bijective function with just a one-to-one function. | CORRECTION: A one-to-one function (injective) only means inputs give unique outputs. A bijective function also needs to be 'onto', meaning all possible outputs are used.

MISTAKE: Not checking the domain and codomain properly. | CORRECTION: The definition of 'onto' depends entirely on what the given codomain is. If the codomain is not explicitly stated, assume it's the set of all real numbers or integers, depending on the context.

Practice Questions

Try It Yourself

QUESTION: Is the function f(x) = x^2, with domain {1, 2} and codomain {1, 4}, a bijective function? | ANSWER: Yes. f(1)=1, f(2)=4. It's one-to-one and onto.

QUESTION: Consider the function g(x) = x - 1, with domain {5, 6, 7} and codomain {4, 5, 6, 7}. Is it bijective? | ANSWER: No. It is one-to-one (g(5)=4, g(6)=5, g(7)=6), but not onto because the output '7' in the codomain is not used.

QUESTION: A function maps students (S1, S2, S3) to their roll numbers (R1, R2, R3). If S1 gets R1, S2 gets R2, and S3 gets R3, is this a bijective mapping? Explain. | ANSWER: Yes. Each student gets a unique roll number (one-to-one), and every roll number is assigned to a student (onto).

MCQ

Quick Quiz

Which of the following describes a bijective function?

Every input has an output, and some outputs might not be used.

Every input has a unique output, and every output is used exactly once.

Multiple inputs can have the same output.

The number of inputs is greater than the number of outputs.

The Correct Answer Is:

Option B correctly defines a bijective function as being both one-to-one (every input has a unique output) and onto (every output is used exactly once). The other options describe functions that are not necessarily bijective.

Real World Connection

In the Real World

Think about your Aadhaar card number. Each Indian citizen has one unique Aadhaar number, and each Aadhaar number belongs to one unique citizen. This is a perfect example of a bijective mapping in real life, ensuring no confusion or duplication. Similarly, in UPI transactions, each transaction ID is unique and corresponds to exactly one payment.

Key Vocabulary

Key Terms

DOMAIN: The set of all possible input values for a function. | CODOMAIN: The set of all possible output values for a function. | ONE-TO-ONE (INJECTIVE): A function where each input maps to a unique output. | ONTO (SURJECTIVE): A function where every element in the codomain is used as an output. | FUNCTION: A rule that assigns each input to exactly one output.

What's Next

What to Learn Next

Great job understanding bijective functions! Next, you should explore 'Inverse Functions'. A function can only have a true inverse if it is bijective, so this concept is your stepping stone to understanding how to 'undo' a function.