Maths 1: Sets, Relations, and Functions
This guide provides a comprehensive overview of Sets, Relations, and Functions, tailored to the IIT Madras Qualifier exam pattern.
1. Core Concepts
1.1. Sets
A set is a well-defined collection of distinct objects. The objects in a set are called its elements.
A subset (written as A β B) is a set where all the elements of set A are also elements of set B.
- Natural Numbers (β): {1, 2, 3, 4, β¦} - The counting numbers.
- Whole Numbers (W): {0, 1, 2, 3, β¦} - Natural numbers plus zero.
- Integers (β€): {β¦, -3, -2, -1, 0, 1, 2, 3, β¦} - Whole numbers and their opposites.
- Rational Numbers (β): Numbers that can be expressed as a fraction p/q of two integers, where q β 0. (e.g., 1/2, -3/4, 7).
- Irrational Numbers: Numbers that cannot be expressed as a simple fraction (e.g., Ο, β2).
- Real Numbers (β): All rational and irrational numbers
- Notation: Sets are usually denoted by capital letters, and their elements are enclosed in curly braces
{}. - Example: is a set of the first four natural numbers.
- Cardinality: The number of elements in a set is called its cardinality, denoted by . For the set above, .
- Subset: A set is a subset of a set (denoted ) if every element of is also in .
- Power Set: The set of all subsets of a set is called the power set of , denoted by . If , then .
- Set Operations:
- Union (): The set of all elements that are in , or in , or in both.
- Intersection (): The set of all elements that are in both and .
- Difference (): The set of all elements that are in but not in .
- Complement ( or ): The set of all elements in the universal set that are not in .
1.2. Relations
A relation from a set to a set is a subset of the Cartesian product . If , we say is a relation on .
- Properties of Relations on a Set A:
- Reflexive: A relation is reflexive if for every element , .
- Symmetric: A relation is symmetric if for every , we also have .
- Transitive: A relation is transitive if for every and , we also have .
- Equivalence Relation: A relation that is reflexive, symmetric, and transitive is called an equivalence relation.
1.3. Functions
A function from a set to a set (denoted ) is a special type of relation where every element in is associated with exactly one element in .
-
Domain: The set is the domain of the function.
-
Codomain: The set is the codomain of the function.
-
Range: The set of all images of the elements of under . The range is a subset of the codomain.
-
Types of Functions:
- Injective (One-to-One): A function is injective if no two elements in the domain map to the same element in the codomain.
- Surjective (Onto): A function is surjective if every element in the codomain is an image of at least one element in the domain. (i.e., range = codomain).
- Bijective: A function is bijective if it is both injective and surjective.
2. Problem Patterns and Solved Examples
Pattern 1: Identifying Properties of Relations
Analysis: These questions provide a relation defined on a set and ask you to identify if itβs reflexive, symmetric, transitive, or an equivalence relation.
Solved Example (from PYQ):
Consider the relation . Is this an equivalence relation?
Solution:
- Reflexive: For any integer , . Since 5 divides 0, . So, is reflexive.
- Symmetric: If , then is divisible by 5. This means for some integer . Then, , which is also divisible by 5. So, . Thus, is symmetric.
- Transitive: If and , then and for some integers . Adding these two equations, we get , which simplifies to . This means is divisible by 5, so . Thus, is transitive.
Since is reflexive, symmetric, and transitive, it is an equivalence relation.
Pattern 2: Cardinality of Sets from Word Problems
Analysis: These questions involve Venn diagrams and the principle of inclusion-exclusion. You are given information about overlapping sets and asked to find the cardinality of a specific region.
Solved Example (from PYQ):
In a survey of 500 people, 49% liked comedy, 53% liked thriller, and 62% liked romantic. 27% liked comedy and thriller, 29% liked thriller and romantic, and 28% liked comedy and romantic. 5% liked none. How many people like all three?
Solution:
Let C, T, and R be the sets of people who like comedy, thriller, and romantic movies, respectively.
- People who liked at least one movie = . So, .
Using the Principle of Inclusion-Exclusion:
Answer: 75 people like all three genres.
Pattern 3: Determining Function Properties
Analysis: Youβll be given a function and its domain/codomain, and you need to determine if itβs one-to-one, onto, or both.
Solved Example (from Assignments):
Define a function , such that , where . Is this function one-to-one, onto, or bijective?
Solution:
-
One-to-One (Injective)? Letβs take two different rational numbers and see if they map to the same integer. Consider . Consider . Since two different inputs (3/2 and 4/3) produce the same output (1), the function is not one-to-one.
-
Onto (Surjective)? Can we generate any integer ? Let be any integer. We need to find a rational number (with ) such that . We can choose and . Then is a rational number. is always true. . Since we can find a rational number that maps to any integer , the function is onto.
Conclusion: The function is onto but not one-to-one.
3. Practice Problems
-
Relation Properties: Let . A relation on is defined as . Determine if is reflexive, symmetric, and/or transitive.
-
Set Cardinality: A class has 100 students. 60 students passed in Physics, 50 passed in Chemistry, and 30 passed in both. Find the number of students who passed in exactly one of the two subjects.
-
Function Properties: Let be defined by . Is this function injective, surjective, or bijective?
4. Solutions to Practice Problems
-
Solution:
- Reflexive: Yes, because are all in .
- Symmetric: Yes. For , we have . For , we have .
- Transitive: No. We have and , but .
-
Solution: Let P be the set of students who passed in Physics and C be the set of students who passed in Chemistry.
- Number of students who passed only in Physics = . Number of students who passed only in Chemistry = . Total students who passed in exactly one subject = .
-
Solution:
- Injective: No. For example, and . Different inputs give the same output.
- Surjective: No. The range of is , because is always non-negative. Therefore, there is no such that (or any other number less than 1). The range is not equal to the codomain .
- Bijective: No, because it is neither injective nor surjective.