Understanding Relations and Functions: A Comprehensive Guide

Introduction

• The session aims to cover the entire chapter on Relations and Functions in a single, concise lesson.
• It is designed for students revising for board exams as well as beginners starting the topic.

Sets and Their Representations

• Set: A well‑defined collection of objects (called elements). In Hindi, it is called समुच्चय.
• Roster (Roster) Form: List elements inside curly braces, e.g., (A = {a, e, i, o, u}).
• Set‑Builder Form: Describe elements by a rule, e.g., ({x \mid x \text{ is a vowel}}).

Ordered Pairs and Cartesian Product

• Ordered Pair: ((a,b)) where the first component is the first element and the second is the second element.
• Equality of ordered pairs: ((a,b) = (c,d)) iff (a=c) and (b=d).
• Cartesian Product of two sets (A) and (B): (A \times B = {(a,b) \mid a \in A,\ b \in B}). The result is a set of ordered pairs.

Relations

• A relation (R) from (A) to (B) is any subset of the Cartesian product (A \times B).
• Domain: Set of all first elements of the ordered pairs in (R).
• Codomain: The whole set (B) (the set from which second elements are taken).
• Range: Set of second elements that actually appear in (R); a subset of the codomain.

Types of Relations

• Reflexive: Every element relates to itself (((a,a)) for all (a \in A)).
• Symmetric: If ((a,b)) is in (R) then ((b,a)) is also in (R).
• Transitive: If ((a,b)) and ((b,c)) are in (R), then ((a,c)) must be in (R).
• Equivalence Relation: A relation that is reflexive, symmetric, and transitive simultaneously.
• Identity Relation: ({(a,a) \mid a \in A}); it is both reflexive and an equivalence relation.
• Universal Relation: The whole Cartesian product (A \times B); every possible ordered pair is present.
• Void (Empty) Relation: The empty set; no ordered pairs at all.

Inverse Relation

• The inverse of (R) (denoted (R^{-1})) swaps each ordered pair: ((a,b) \in R \Rightarrow (b,a) \in R^{-1}).
• If (R) is a relation from (A) to (B), then (R^{-1}) is a relation from (B) to (A).

Functions

• A function (f : A \to B) is a relation where each element of (A) is associated with exactly one element of (B).
• Image (f(x)): The output for a given input (x).
• Pre‑image: The set of inputs that map to a particular output.

Special Types of Functions

• One‑to‑One (Injective): Different elements of (A) map to different elements of (B). Formally, (f(x_1)=f(x_2) \Rightarrow x_1=x_2).
• Onto (Surjective): Every element of (B) is the image of at least one element of (A); i.e., range = codomain.
• Bijective: Both injective and surjective; it has an inverse function.

Function Composition

• Given (f : A \to B) and (g : B \to C), the composition (g \circ f : A \to C) is defined by ((g \circ f)(x) = g(f(x))).
• Notation: (g(f(x))) is often written as (g \circ f).

Inverse Functions

• An inverse function (f^{-1}) exists only if (f) is bijective.
• To find (f^{-1}):
• Write (y = f(x)).
• Solve for (x) in terms of (y).
• Swap the symbols to obtain (f^{-1}(y)).

Counting Relations and Functions

• If (|A| = m) and (|B| = n):
• Number of possible relations from (A) to (B) = (2^{mn}) (each of the (mn) ordered pairs may be present or not).
• Number of reflexive relations on a set of size (n): (2^{n^2-n}).
• Number of symmetric relations on a set of size (n): (2^{\frac{n(n+1)}{2}}).
• Number of functions from (A) to (B) = (n^{m}).
• Number of injective functions (when (m \le n)) = (n!/(n-m)!).
• Number of surjective functions can be computed using inclusion‑exclusion.

Example Problems Discussed

• Solving for (x) and (y) in a relation defined by (x+7 = 10) and (y-4 = 2).
• Constructing the Cartesian product of (A = {1,2,3}) and (B = {5,6}) to obtain (A \times B = {(1,5),(1,6),(2,5),(2,6),(3,5),(3,6)}).
• Determining domain, codomain, and range for a given relation.
• Verifying whether a relation is reflexive, symmetric, transitive, or an equivalence relation.
• Checking if a mapping is a function, and if it is injective, surjective, or bijective.
• Computing the composition (g \circ f) for specific algebraic expressions.
• Finding the inverse of a linear function such as (f(x)=3x+2) → (f^{-1}(x)=\frac{x-2}{3}).

Study Tips

• Write down definitions verbatim; they are frequently asked in exams.
• Practice converting between roster form and set‑builder form.
• Always list the domain, codomain, and range when a relation or function is given.
• Use the properties of ordered pairs to test reflexivity, symmetry, and transitivity.
• For counting questions, remember the power‑set principle ((2^{mn})) and the formulas for special relation types.
• When dealing with functions, verify the vertical line test on graphs: a line parallel to the y‑axis must intersect the curve at most once for the relation to be a function.
• For inverse functions, ensure the original function is bijective before attempting to find (f^{-1}).

Conclusion

Mastering sets, ordered pairs, Cartesian products, and the precise definitions of relations and functions—along with their special types and counting formulas—provides a solid foundation for board exams and higher‑level mathematics. With clear definitions, systematic practice, and the ability to translate between different representations, students can solve any problem on this chapter confidently.