Sets
Roster form: {1, 2, 3, 4}
Set-builder form: {x : x ∈ N, x ≤ 5}
- Empty set (∅)
- Singleton set
- Finite / Infinite
- Equal sets (same elements)
- Equivalent sets (same cardinality)
Power Set
Set of all subsets of A → P(A)
If A has n elements → |P(A)| = 2ⁿ
Universal Set (U)
Set containing all objects under consideration.
Venn Diagrams
Graphical representation of sets using circles.
Imagine two overlapping circles representing sets A and B:
- The overlapping region represents A ∩ B
- The total area covered by both circles represents A ∪ B
- The area in A but not in B represents A - B
If A = {1, 2, 3, 4} and B = {3, 4, 5, 6}, find:
- A ∪ B
- A ∩ B
- A - B
1. A ∪ B = {1, 2, 3, 4, 5, 6}
2. A ∩ B = {3, 4}
3. A - B = {1, 2}
Operations on Sets
x ∈ A ∪ B ⇔ x ∈ A or x ∈ B
x ∈ A ∩ B ⇔ x ∈ A and x ∈ B
A – B = {x : x ∈ A, x ∉ B}
A' = U – A = {x ∈ U : x ∉ A}
Important Identities
- A ∪ A = A, A ∩ A = A (Idempotent)
- A ∪ ∅ = A, A ∩ U = A
- De Morgan’s Laws:
(A ∪ B)' = A' ∩ B'
(A ∩ B)' = A' ∪ B' - |A ∪ B| = |A| + |B| – |A ∩ B|
Quick Reference
Relations
If (a, b) ∈ R → a is related to b (a R b)
| Relation | Condition |
|---|---|
| Reflexive | (a,a) ∈ R ∀ a ∈ A |
| Symmetric | If (a,b) ∈ R ⇒ (b,a) ∈ R |
| Transitive | If (a,b), (b,c) ∈ R ⇒ (a,c) ∈ R |
| Equivalence | Reflexive + Symmetric + Transitive |
“Congruence modulo m” on integers
“is parallel to” on lines
“is similar to” on triangles
Think of relations as connections between points:
- Reflexive: Every point has a loop to itself
- Symmetric: If there's an arrow from A to B, there's also one from B to A
- Transitive: If A→B and B→C, then there must be A→C
Functions
- One-One (Injective): f(a) = f(b) ⇒ a = b
- Many-One: Different elements map to same
- Onto (Surjective): Every element in B is image
- Into: Not onto
- Bijective: Both one-one and onto
Identity: f(x) = x
Constant: f(x) = c
Polynomial, Rational
Modulus, Signum, Greatest Integer, Fractional Part
Key Formulas
• Number of injective functions from A to B: ⁿPₘ = n!/(n-m)!
• Number of functions: mⁿ
• Number of bijections (if |A| = |B| = n): n!
Composition of Functions
(f ∘ g)(x) = f(g(x))
Note: f ∘ g ≠ g ∘ f in general
Both are associative
Inverse Function
Exists only if f is bijective
f⁻¹ ∘ f = I, f ∘ f⁻¹ = I
Determine if the function f: R → R defined by f(x) = x² is:
- One-one
- Onto
1. Not one-one because f(2) = f(-2) = 4 but 2 ≠ -2
2. Not onto because negative numbers are not in the range
JEE Main Weightage & Tips
One of the most important and scoring chapters. Usually 3–4 questions appear every year.
Must Remember for JEE
- All properties of equivalence relations
- Injective/Surjective tests (horizontal line, algebraic)
- Number of relations/functions formulas
- Inverse trigonometric functions domain/range (comes later but linked)
- Graph of modulus, signum, greatest integer functions
Quick Reference
- Focus on definitions and properties - these are frequently tested
- Practice problems on finding number of relations/functions
- Master the difference between various types of relations
- Understand function composition and inverse functions thoroughly