SETS AND FUNCTIONS (UNIT 5)
SETS & RELATIONS
Set: A set is a well-defined collection of distinct objects or elements. Example: A = {1, 2, 3, 4}
represents a set of numbers.
Union of Sets (A ∪ B): The union of two sets A and B is the set containing all elements that belong to A
or B or both. Example: A = {1,2,3}, B = {3,4,5} → A ∪ B = {1,2,3,4,5}.
Intersection of Sets (A ∩ B): The intersection of A and B is the set of elements common to both sets.
Example: A = {1,2,3}, B = {3,4,5} → A ∩ B = {3}.
Difference of Sets (A − B): The difference of two sets is the set of elements that belong to A but not to
B. Example: A = {1,2,3}, B = {3,4} → A − B = {1,2}.
Complement of a Set (A′): The complement of A is the set of all elements in the universal set that are
not in A. Example: U = {1,2,3,4,5}, A = {1,2} → A′ = {3,4,5}.
Ordered Pair (a, b): An ordered pair represents two elements in a specific order, where the position
matters. (2,3) ≠ (3,2), because order is important.
Cartesian Product (A × B): The Cartesian product of A and B is the set of all ordered pairs (a, b) where
a ∈ A and b ∈ B. Example: A = {1,2}, B = {x,y} → A × B = {(1,x),(1,y),(2,x),(2,y)}.
Binary Relation: A binary relation from A to B is any subset of the Cartesian product A × B that shows
a relation between elements of A and B. Example: R = {(1,2),(2,3)}.
Domain of a Relation: The domain is the set of all first elements of the ordered pairs in a relation.
Example: R = {(1,2),(2,3)} → Domain = {1,2}.
Range of a Relation: The range is the set of all second elements of the ordered pairs in a relation.
Example: R = {(1,2),(2,3)} → Range = {2,3}.
FUNCTIONS
Function: A function is a relation in which each element of the domain is related to exactly one element
of the codomain. Example: f = {(1,2),(2,3),(3,4)}.
Into Function: A function is into if some elements of the codomain are not mapped by any element of
the domain. Example: f : A → B, A = {1,2}, B = {a,b,c}, f = {(1,a),(2,b)} → Into.
One-One Function (Injective): A function is one-one if different elements of the domain have different
images in the codomain. Example: f = {(1,a),(2,b),(3,c)} is one-one.
Onto Function (Surjective): A function is onto if every element of the codomain is mapped by at least
one element of the domain, i.e., range = codomain.
Bijective Function: A function is bijective if it is both one-one and onto — each element of A has a
unique image in B, and all of B is covered.
One-to-One Correspondence: A one-to-one correspondence is a bijective function where every
element of A matches exactly one element of B and vice versa.
■ Explanation of Functions:
A function connects every element of a set (called the domain) with exactly one element of another set
(called the codomain).
If one element of A connects to two or more elements of B, it is not a function. The set of all outputs of a
function is called its range.
In simple words, a function is a rule that gives each input one unique output.