Q.Let and . Find whether the following subsets of are functions from to or not.
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →A function from to must assign exactly one element of to every element of . Checking each subset: (i) fails because has two outputs;
(ii) works;
(iii) works;
(iv) fails because has no output.
The Core Idea: What Makes a Relation a Function?
A function from set to set is a special kind of relation — a subset of — with two ironclad rules:
- Every element of must appear as a first coordinate (no element left behind).
- Each element of must pair with exactly one element of (no splitting).
Think of it like a vending machine: for every button you press (an ), you must get one and only one snack (a ). If a button gives two different snacks, or if a button gives nothing, it’s broken — not a function.
Here, has three elements, and has two. So a valid function will have exactly three ordered pairs — one for each — and the second coordinate can be or .
Checking Each Subset
1.
Look at : it appears twice — once with and once with . That violates rule 2: one input cannot map to two different outputs.
Also, has four pairs, but has only three elements — a red flag that some is repeated.
A common mistake: thinking a function can have multiple pairs with the same first element as long as the second elements are different. That’s exactly what disqualifies .
Conclusion: is not a function.
2.
Every element of appears exactly once: , , . …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.