Class 12 PCM . Mathematics . Mathematics Part I . Relations and Functions

Chapter 1: Relations And Functions

Ch 1

Mathematics

Class 12 PCM

Lecture 1

Introduction

Reference video · Lecture 1Introduction

Relations

Definition

Relation from A to B — A relation from AA to BB is any subset of the Cartesian product A×BA\times B.

Key Points

  • Relation in A: A relation on a set AA is a subset of A×AA\times A.
  • Related notation: If (a,b)∈R(a,b)\in R, write aRbaRb; no real-world connection between aa and bb is required.
  • Functions: A function is a special kind of relation.
  • Examples: Relations can describe sibling links, age or marks comparisons, or living in the same locality.
Relation from A to B
R⊆A×BR\subseteq A\times B

The first coordinate is chosen from AA and the second from BB.

Writing a Relation as Ordered Pairs

  1. Identify the sets from which the first and second elements are chosen.
    a∈A,b∈Ba\in A,\quad b\in B
  2. Apply the stated condition to each possible pair.
    (a,b)∈R(a,b)\in R
  3. List exactly the pairs satisfying the condition.
    R={(a,b):condition holds}R=\{(a,b):\text{condition holds}\}
Worked example

List the relation on A={1,2,3,4}A=\{1,2,3,4\} defined by b=a+1b=a+1.

  1. For A={1,2,3,4}A=\{1,2,3,4\}, use the condition that the second element is one greater than the first.
    R={(a,b)∈A×A:b=a+1}R=\{(a,b)\in A\times A:b=a+1\}
  2. Test each first element and keep pairs that belong to A×AA\times A.
    1+1=2,2+1=3,3+1=41+1=2,\quad 2+1=3,\quad 3+1=4
  3. The value required for a=4a=4 is outside AA, so it gives no pair.
    4+1=5∉A4+1=5\notin A
Answer: R={(1,2),(2,3),(3,4)}R=\{(1,2),(2,3),(3,4)\}.

Empty and Universal Relations

Definition

Empty relation — An empty relation on AA contains no ordered pairs, so no element of AA is related to any element of AA.

Definition

Universal relation — A universal relation on AA contains every possible ordered pair from A×AA\times A.

Extreme Relations on A
R=∅orR=A×AR=\varnothing\quad\text{or}\quad R=A\times A

The empty and universal relations are also called trivial relations.

Worked example

Classify the relations “is sister of” and “has a height difference of less than 33 metres” on the students of a boys' school.

  1. In a boys' school, no student is the sister of any student.
    R=∅R=\varnothing
  2. The height difference of any two students is less than 33 metres, so every pair satisfies the condition.
    R′=A×AR'=A\times A
Answer: The sister relation is empty; the height relation is universal.

Reflexive, Symmetric and Transitive Relations

Definition

Reflexive relation — A relation on AA is reflexive if every element is related to itself.

Definition

Symmetric relation — A relation on AA is symmetric if whenever aa is related to bb, bb is related to aa.

Definition

Transitive relation — A relation on AA is transitive if aRbaRb and bRcbRc together imply aRcaRc.

Tests for Relation Properties
∀a∈A:(a,a)∈R;(a,b)∈R⇒(b,a)∈R;(a,b),(b,c)∈R⇒(a,c)∈R\forall a\in A:(a,a)\in R;\quad (a,b)\in R\Rightarrow(b,a)\in R;\quad (a,b),(b,c)\in R\Rightarrow(a,c)\in R

How to Check

  • Reflexive: Check every diagonal pair (a,a)(a,a).
  • Symmetric: Check that each pair (a,b)(a,b) has its reverse (b,a)(b,a).
  • Transitive: Whenever (a,b)(a,b) and (b,c)(b,c) are in RR, check that (a,c)(a,c) is also in RR.
  • Disprove a property: One counterexample is enough.
Lines L_1 and L_3 are both perpendicular to L_2, so they are parallel rather than perpendicular to each other.
Lines L1L_1 and L3L_3 are both perpendicular to L2L_2, so they are parallel rather than perpendicular to each other.
Worked example

For the relation “is perpendicular to” on all lines in a plane, determine whether it is reflexive, symmetric and transitive.

  1. Perpendicularity is symmetric: if one line is perpendicular to another, the reverse is also true.
    L1⊥L2⇒L2⊥L1L_1\perp L_2\Rightarrow L_2\perp L_1
  2. A line is not perpendicular to itself, so the relation is not reflexive.
    L1⊥̸L1L_1\not\perp L_1
  3. Two lines perpendicular to the same line are parallel, so the relation is not transitive.
    L1⊥L2,L2⊥L3⇒L1∥L3L_1\perp L_2,\quad L_2\perp L_3\Rightarrow L_1\parallel L_3
Answer: It is symmetric, but neither reflexive nor transitive.
⚠ Common mistake

Do not infer transitivity just because two links hold; the required pair (a,c)(a,c) must also be in RR.

Equivalence Relations, Classes and Partitions

Definition

Equivalence relation — A relation is an equivalence relation if it is reflexive, symmetric and transitive.

Definition

Equivalence class — For an equivalence relation on XX, the class [a][a] consists of all elements of XX related to aa.

Equivalence Class
[a]={x∈X:xRa}[a]=\{x\in X:xRa\}
Equivalence classes form a partition

An equivalence relation divides XX into nonempty, mutually disjoint classes that cover XX. Elements in the same class are related; elements in different classes are not. Distinct classes are disjoint.

⋃iAi=X,Ai∩Aj=∅ (i≠j)\bigcup_i A_i=X,\quad A_i\cap A_j=\varnothing\ (i\ne j)
A partition defines an equivalence relation

Conversely, any partition of XX defines an equivalence relation by declaring aRbaRb exactly when aa and bb belong to the same block. This relation is reflexive, symmetric and transitive.

Important Equivalence Examples

  • Triangle congruence: Congruence is reflexive, symmetric and transitive; hence it is an equivalence relation.
  • Parity on integers: aRbaRb when 2∣(a−b)2\mid(a-b) groups all even integers together and all odd integers together.
  • Modulo 3: aRbaRb when 3∣(a−b)3\mid(a-b) has three classes, corresponding to remainders 00, 11 and 22.
  • Finite parity: On {1,2,3,4,5,6,7}\{1,2,3,4,5,6,7\}, the two classes are {1,3,5,7}\{1,3,5,7\} and {2,4,6}\{2,4,6\}.
Parity Equivalence Classes
[0]={2r:r∈Z},[1]={2r+1:r∈Z},r∈Z[0]=\{2r:r\in\mathbb Z\},\quad [1]=\{2r+1:r\in\mathbb Z\},\quad r\in\mathbb Z

For the relation aRbaRb if 2∣(a−b)2\mid(a-b), the classes are the even and odd integers.

Equivalence Classes Modulo 3
[0]={3r:r∈Z},[1]={3r+1:r∈Z},[2]={3r+2:r∈Z},r∈Z[0]=\{3r:r\in\mathbb Z\},\quad [1]=\{3r+1:r\in\mathbb Z\},\quad [2]=\{3r+2:r\in\mathbb Z\},\quad r\in\mathbb Z

Integers are related exactly when they have the same remainder upon division by 33.

Proving an Equivalence Relation and Finding Its Classes

  1. Check reflexivity, symmetry and transitivity separately.
    (a,a)∈R;(a,b)∈R⇒(b,a)∈R;(a,b),(b,c)∈R⇒(a,c)∈R(a,a)\in R;\quad (a,b)\in R\Rightarrow(b,a)\in R;\quad (a,b),(b,c)\in R\Rightarrow(a,c)\in R
  2. If all three properties hold, collect the elements related to each representative.
    [a]={x∈X:xRa}[a]=\{x\in X:xRa\}
  3. List distinct classes and check that they are disjoint and cover the set.
    ⋃iAi=X,Ai∩Aj=∅ (i≠j)\bigcup_i A_i=X,\quad A_i\cap A_j=\varnothing\ (i\ne j)
Worked example

Show that the relation on Z\mathbb Z defined by aRbaRb if 2∣(a−b)2\mid(a-b) is an equivalence relation, and find its classes.

  1. On Z\mathbb Z, define aRbaRb when 22 divides a−ba-b. Since every integer differs from itself by zero, the relation is reflexive.
    2∣(a−a)2\mid(a-a)
  2. If 22 divides a−ba-b, it also divides its negative, so the relation is symmetric.
    2∣(a−b)⇒2∣(b−a)2\mid(a-b)\Rightarrow 2\mid(b-a)
  3. If 22 divides both differences, it divides their sum, so the relation is transitive.
    2∣(a−b),2∣(b−c)⇒2∣(a−c)2\mid(a-b),\quad 2\mid(b-c)\Rightarrow 2\mid(a-c)
  4. The equivalence classes are the even integers and the odd integers; these form a partition of Z\mathbb Z.
    [0]={2r:r∈Z},[1]={2r+1:r∈Z},r∈Z[0]=\{2r:r\in\mathbb Z\},\quad [1]=\{2r+1:r\in\mathbb Z\},\quad r\in\mathbb Z
Answer: It is an equivalence relation. Its classes are [0][0], the even integers, and [1][1], the odd integers.
Practice

On A={1,2,3}A=\{1,2,3\}, let R={(1,1),(2,2),(3,3),(1,2),(2,3)}R=\{(1,1),(2,2),(3,3),(1,2),(2,3)\}. Which of reflexivity, symmetry and transitivity does RR satisfy?

Hint: Check all diagonal pairs, reversed pairs and pairs required by linked pairs.
Key step: The missing pairs (2,1)(2,1) and (1,3)(1,3) disprove symmetry and transitivity.
Solution: It is reflexive because all diagonal pairs are present. It is not symmetric since (1,2)∈R(1,2)\in R but (2,1)∉R(2,1)\notin R. It is not transitive since (1,2),(2,3)∈R(1,2),(2,3)\in R but (1,3)∉R(1,3)\notin R.
Practice

Show that congruence of triangles in a plane is an equivalence relation.

Hint: Use self-congruence, reversibility and chaining of congruence.
Key step: Verify reflexivity, symmetry and transitivity in that order.
Solution: Every triangle is congruent to itself (reflexive). If T1T_1 is congruent to T2T_2, then T2T_2 is congruent to T1T_1 (symmetric). If T1T_1 is congruent to T2T_2 and T2T_2 to T3T_3, then T1T_1 is congruent to T3T_3 (transitive). Therefore, triangle congruence is an equivalence relation.
Practice

For the relation on Z\mathbb Z defined by aRbaRb if 4∣(a−b)4\mid(a-b), state its equivalence classes.

Hint: Group integers by their remainders upon division by 44.
Key step: Two integers are related exactly when their remainders modulo 44 are the same.
Solution: There are four classes: [0]={4r:r∈Z}[0]=\{4r:r\in\mathbb Z\}, [1]={4r+1:r∈Z}[1]=\{4r+1:r\in\mathbb Z\}, [2]={4r+2:r∈Z}[2]=\{4r+2:r\in\mathbb Z\} and [3]={4r+3:r∈Z}[3]=\{4r+3:r\in\mathbb Z\}, where r∈Zr\in\mathbb Z.

Quick recap

  • A relation from AA to BB is any subset of A×BA\times B; a relation on AA is a subset of A×AA\times A.
  • The empty relation is ∅\varnothing; the universal relation is A×AA\times A.
  • Reflexive means every element relates to itself; symmetric means pairs reverse; transitive means linked pairs compose.
  • An equivalence relation is reflexive, symmetric and transitive.
  • Equivalence classes partition a set into disjoint subsets that cover it; a partition also defines an equivalence relation by same-block membership.
  • Divisibility of a−ba-b by nn groups integers according to their remainders modulo nn; parity gives the even and odd classes.
Lecture 2

Types Of Functions

Reference video · Lecture 2Types Of Functions

One-One (Injective) Functions

Definition

One-one (injective) function — A function f:X→Yf:X\to Y is one-one if distinct inputs have distinct images.

Injectivity test

If f(x1)=f(x2)f(x_1)=f(x_2) implies x1=x2x_1=x_2 for all x1,x2∈Xx_1,x_2\in X, then ff is one-one. Otherwise, it is many-one.

f(x1)=f(x2)⇒x1=x2f(x_1)=f(x_2)\Rightarrow x_1=x_2
Mapping diagrams: f_1 and f_4 are one-one; f_2 and f_3 are many-one. The range of f_1 misses codomain elements.
Mapping diagrams: f1f_1 and f4f_4 are one-one; f2f_2 and f3f_3 are many-one. The range of f1f_1 misses codomain elements.

Key points and examples

  • One-one: No two distinct domain elements have the same image.
  • Many-one: At least two distinct domain elements share an image.
  • Roll numbers: Mapping 50 students to their unique roll numbers is one-one, but as a map into N\mathbb N it is not onto.
  • Natural-number doubling: f:N→Nf:\mathbb N\to\mathbb N, f(x)=2xf(x)=2x, is one-one; it misses odd natural numbers.
  • Square function: f:R→Rf:\mathbb R\to\mathbb R, f(x)=x2f(x)=x^2, is not one-one because f(−1)=f(1)=1f(-1)=f(1)=1.

Test whether a function is one-one

  1. Assume two domain inputs have equal images.
    f(x1)=f(x2)f(x_1)=f(x_2)
  2. Apply the function rule and simplify the equality.
  3. If this forces equal inputs, the function is one-one; otherwise, give distinct inputs with equal images.
    x1=x2x_1=x_2
Worked example

Show that f:N→Nf:\mathbb N\to\mathbb N, f(x)=2xf(x)=2x, is one-one but not onto.

  1. Let f:N→Nf:\mathbb N\to\mathbb N be defined by f(x)=2xf(x)=2x. Equate two images.
    f(x1)=f(x2)f(x_1)=f(x_2)
  2. Cancel the common factor to obtain equal inputs.
    2x1=2x2⇒x1=x22x_1=2x_2\Rightarrow x_1=x_2
  3. Thus, ff is one-one. It is not onto because no natural input maps to 11.
    2x=1 has no solution in N2x=1\text{ has no solution in }\mathbb N
Answer: The function is one-one but not onto.

Onto (Surjective) Functions

Definition

Onto (surjective) function — A function f:X→Yf:X\to Y is onto if every element of the codomain YY is the image of at least one element of XX.

Range criterion for onto

A function is onto exactly when its range equals its codomain.

Range⁡(f)=Y\operatorname{Range}(f)=Y

Key points and examples

  • Onto: Every codomain element has a preimage; different domain elements may share an image.
  • Not onto: At least one codomain element is not reached.
  • Mapping diagrams: f3f_3 and f4f_4 are onto; f1f_1 is not onto because some codomain elements are not images.
  • Roll numbers: The map from 50 students to N\mathbb N by roll number is not onto; for example, 5151 is not an image.
  • Square function: f:R→Rf:\mathbb R\to\mathbb R, f(x)=x2f(x)=x^2, is not onto because no negative real number is in its range.

Test whether a function is onto

  1. Take an arbitrary element of the codomain.
    y∈Yy\in Y
  2. Solve for an input whose image is that element.
    f(x)=yf(x)=y
  3. If a domain input exists for every yy, the function is onto; otherwise, identify an unreachable codomain element.
Worked example

Show that f:N→Nf:\mathbb N\to\mathbb N, where f(1)=f(2)=1f(1)=f(2)=1 and f(x)=x−1f(x)=x-1 for x>2x>2, is onto but not one-one.

  1. Define f:N→Nf:\mathbb N\to\mathbb N by the following rule.
    f(x)={1,x=1,2x−1,x>2f(x)=\begin{cases}1,&x=1,2\\x-1,&x>2\end{cases}
  2. The value 11 is reached from input 11; each y≥2y\ge2 is reached from input y+1y+1.
    f(1)=1,f(y+1)=y(y≥2)f(1)=1,\qquad f(y+1)=y\quad(y\ge2)
  3. Every natural number is reached, but inputs 11 and 22 share an image.
    f(1)=f(2)=1f(1)=f(2)=1
Answer: The function is onto but not one-one.

Bijective Functions

Definition

Bijective function — A function is bijective if it is both one-one and onto.

Bijectivity

A bijection assigns each domain element a unique codomain element, and every codomain element is reached.

Prove a function is bijective

  1. Prove injectivity by showing equal outputs force equal inputs.
    f(x1)=f(x2)⇒x1=x2f(x_1)=f(x_2)\Rightarrow x_1=x_2
  2. Prove surjectivity by finding a preimage for an arbitrary codomain element.
    y∈Y⇒∃x∈X:f(x)=yy\in Y\Rightarrow \exists x\in X:f(x)=y
  3. Conclude that the function is bijective when both properties hold.
The graph of y=2x is a straight line through the origin.
The graph of y=2xy=2x is a straight line through the origin.
Worked example

Prove that f:R→Rf:\mathbb R\to\mathbb R, f(x)=2xf(x)=2x, is bijective.

  1. For f:R→Rf:\mathbb R\to\mathbb R, f(x)=2xf(x)=2x, equal images force equal inputs.
    f(x1)=f(x2)⇒2x1=2x2⇒x1=x2f(x_1)=f(x_2)\Rightarrow 2x_1=2x_2\Rightarrow x_1=x_2
  2. For any real codomain value yy, choose the real input y/2y/2.
    f(y2)=2(y2)=yf\left(\frac{y}{2}\right)=2\left(\frac{y}{2}\right)=y
  3. Thus, the function is both one-one and onto.
Answer: The function is bijective.

Functions on Finite and Infinite Sets

Functions from a finite set to itself

For every finite set XX, a one-one function f:X→Xf:X\to X is onto, and an onto function f:X→Xf:X\to X is one-one. These implications need not hold for infinite sets.

Why the finite-set result holds

  • One-one on a finite set: ∣X∣|X| inputs give ∣X∣|X| distinct images, so every element of XX is reached.
  • Onto on a finite set: If two inputs shared an image, fewer than ∣X∣|X| distinct images would remain, contradicting onto-ness.
  • Infinite sets: Injectivity need not imply surjectivity, and surjectivity need not imply injectivity; f(n)=2nf(n)=2n and the piecewise map above illustrate these failures.

Additional examples

  • Parity rule: The function f:N→Nf:\mathbb N\to\mathbb N given by f(x)=x+1f(x)=x+1 for odd xx and f(x)=x−1f(x)=x-1 for even xx is bijective; it swaps adjacent natural numbers.
  • Parity rule—onto: Each odd output 2r+12r+1 comes from input 2r+22r+2, and each even output 2r2r comes from input 2r−12r-1.
  • Parity rule—one-one: Inputs of different parity cannot have equal outputs; within either parity, equal outputs force equal inputs.
  • Finite example: An onto function f:{1,2,3}→{1,2,3}f:\{1,2,3\}\to\{1,2,3\} must be one-one: if two inputs shared an image, at most two codomain elements would be reached.
  • Finite example: A one-one function f:{1,2,3}→{1,2,3}f:\{1,2,3\}\to\{1,2,3\} must be onto because its three inputs have three distinct images.
The graph of f(x)=x² shows that distinct inputs -1 and 1 have the same image.
The graph of f(x)=x2f(x)=x^2 shows that distinct inputs −1-1 and 11 have the same image.
Practice

Classify f:R→Rf:\mathbb R\to\mathbb R, f(x)=x2f(x)=x^2, as one-one and/or onto.

Hint: Compare f(1)f(1) and f(−1)f(-1); check whether a negative real can be an output.
Key step: Use f(1)=f(−1)f(1)=f(-1) and x2≥0x^2\ge0 for all x∈Rx\in\mathbb R.
Solution: Neither one-one nor onto.
Practice

Show that f:N→Nf:\mathbb N\to\mathbb N, with f(x)=x+1f(x)=x+1 for odd xx and f(x)=x−1f(x)=x-1 for even xx, is bijective.

Hint: The rule swaps each consecutive pair of natural numbers.
Key step: Odd output 2r+12r+1 comes from 2r+22r+2; even output 2r2r comes from 2r−12r-1. Equal outputs also force equal inputs.
Solution: The function is one-one and onto, hence bijective.
Practice

For a finite set XX, explain why an onto function f:X→Xf:X\to X must be one-one.

Hint: Assume two inputs have the same image and count the maximum number of distinct images.
Key step: If two inputs share an image, fewer than ∣X∣|X| distinct images can be reached.
Solution: This contradicts onto-ness, which requires all ∣X∣|X| elements to be reached. Therefore, ff is one-one.

Quick recap

  • One-one means equal outputs force equal inputs; otherwise, the function is many-one.
  • Onto means every codomain element is reached; equivalently, Range⁡(f)=Y\operatorname{Range}(f)=Y.
  • A bijection is both one-one and onto.
  • On a finite set mapped to itself, one-one and onto each imply the other.
  • These finite-set implications may fail on infinite sets: f(n)=2nf(n)=2n is one-one but not onto, while the piecewise natural-number example is onto but not one-one.
  • The real function f(x)=x2f(x)=x^2 is neither one-one nor onto.
Lecture 3

Composition Of Functions And Invertible Function

Reference video · Lecture 3Composition Of Functions And Invertible Function

Composition of Functions

Definition

Composition of functions — For functions f:A→Bf:A\to B and g:B→Cg:B\to C, the composition g∘f:A→Cg\circ f:A\to C applies ff first, then gg.

Key properties

  • Order: In (g∘f)(x)(g\circ f)(x), evaluate f(x)f(x) first, then apply gg.
  • Compatibility: The outputs of ff must belong to the domain of gg.
  • Non-commutative: In general, g∘f≠f∘gg\circ f\ne f\circ g.
  • Associative: When all compositions are defined, (h∘g)∘f=h∘(g∘f)(h\circ g)\circ f=h\circ(g\circ f).
Composition rule
(g∘f)(x)=g(f(x))(g\circ f)(x)=g(f(x))

Use this rule to evaluate a composition at input xx.

Evaluating a composition

  1. Find the output of the inner function.
    u=f(x)u=f(x)
  2. Substitute that output into the outer function.
    (g∘f)(x)=g(u)(g\circ f)(x)=g(u)
  3. Simplify and check that each function is defined.
Worked example

Let f(2)=3f(2)=3, f(3)=4f(3)=4, f(4)=f(5)=5f(4)=f(5)=5 and g(3)=g(4)=7g(3)=g(4)=7, g(5)=g(9)=11g(5)=g(9)=11. Find g∘fg\circ f.

  1. Apply gg to the output of ff at input 22.
    (g∘f)(2)=g(f(2))=g(3)=7(g\circ f)(2)=g(f(2))=g(3)=7
  2. Evaluate the composition at input 33.
    (g∘f)(3)=g(f(3))=g(4)=7(g\circ f)(3)=g(f(3))=g(4)=7
  3. Evaluate the composition at inputs 44 and 55.
    (g∘f)(4)=g(f(4))=g(5)=11,(g∘f)(5)=g(f(5))=g(5)=11(g\circ f)(4)=g(f(4))=g(5)=11,\qquad (g\circ f)(5)=g(f(5))=g(5)=11
Answer: (g∘f)(2)=7(g\circ f)(2)=7, (g∘f)(3)=7(g\circ f)(3)=7, (g∘f)(4)=11(g\circ f)(4)=11, and (g∘f)(5)=11(g\circ f)(5)=11.

Composition need not commute

  • Example: If f(x)=cos⁡xf(x)=\cos x and g(x)=3x2g(x)=3x^2, then (g∘f)(x)=3cos⁡2x(g\circ f)(x)=3\cos^2x while (f∘g)(x)=cos⁡(3x2)(f\circ g)(x)=\cos(3x^2).
  • Check: At x=0x=0, the values are 33 and 11, respectively; hence g∘f≠f∘gg\circ f\ne f\circ g.
Composition maps from A to C by applying f:A→ B first and g:B→ C second.
Composition maps from AA to CC by applying f:A→Bf:A\to B first and g:B→Cg:B\to C second.
⚠ Common mistake

Do not reverse the order: g∘fg\circ f means g(f(x))g(f(x)), not f(g(x))f(g(x)).

Invertible Functions

Definition

Invertible function — A function f:X→Yf:X\to Y is invertible if there is a function g:Y→Xg:Y\to X such that g∘f=IXg\circ f=I_X and f∘g=IYf\circ g=I_Y.

Key properties

  • Inverse notation: The inverse function gg is denoted by f−1f^{-1}.
  • Bijection test: A function is invertible if and only if it is both one-one and onto.
  • One-one: f(x1)=f(x2)f(x_1)=f(x_2) implies x1=x2x_1=x_2.
  • Onto: For every y∈Yy\in Y, there is some x∈Xx\in X such that f(x)=yf(x)=y.
Inverse identities

For an invertible f:X→Yf:X\to Y, the inverse reverses the mapping: f−1(f(x))=xf^{-1}(f(x))=x for each x∈Xx\in X and f(f−1(y))=yf(f^{-1}(y))=y for each y∈Yy\in Y.

f−1∘f=IX,f∘f−1=IYf^{-1}\circ f=I_X,\qquad f\circ f^{-1}=I_Y

Finding an inverse

  1. Show that the function is one-one and onto, or set the output equal to yy and solve for the input.
    y=f(x)y=f(x)
  2. Express the input in terms of the output; this gives the inverse rule.
    x=f−1(y)x=f^{-1}(y)
  3. State the inverse's domain and codomain, then verify both identity compositions.
    f−1∘f=IX,f∘f−1=IYf^{-1}\circ f=I_X,\qquad f\circ f^{-1}=I_Y
Worked example

Let f:N→Yf:\mathbb{N}\to Y be given by f(x)=4x+3f(x)=4x+3, where Y={4n+3:n∈N}Y=\{4n+3:n\in\mathbb{N}\}. Find its inverse.

  1. Solve the rule for the input in terms of the output yy.
    y=4x+3⟹x=y−34y=4x+3\quad\Longrightarrow\quad x=\frac{y-3}{4}
  2. Define the inverse on YY; by the definition of YY, its values lie in N\mathbb{N}.
    f−1:Y→N,f−1(y)=y−34f^{-1}:Y\to\mathbb{N},\qquad f^{-1}(y)=\frac{y-3}{4}
  3. Verify the composition on the domain.
    (f−1∘f)(x)=(4x+3)−34=x(f^{-1}\circ f)(x)=\frac{(4x+3)-3}{4}=x
  4. Verify the composition on the codomain.
    (f∘f−1)(y)=4(y−34)+3=y(f\circ f^{-1})(y)=4\left(\frac{y-3}{4}\right)+3=y
Answer: f−1(y)=y−34f^{-1}(y)=\frac{y-3}{4} for y∈Yy\in Y.
⚠ Common mistake

For f(x)=4x+3f(x)=4x+3, remember to divide by 44: f−1(y)=y−34f^{-1}(y)=\frac{y-3}{4}, not y−3y-3.

Relations and Equivalence Relations

Definition

Relation on a set — A relation RR on XX is any subset of X×XX\times X.

Basic relation types
TypeDefinition
Empty relationR=∅R=\varnothing on XX.
Universal relationR=X×XR=X\times X.
Reflexive(a,a)∈R(a,a)\in R for every a∈Xa\in X.
Symmetric(a,b)∈R(a,b)\in R implies (b,a)∈R(b,a)\in R.
Transitive(a,b),(b,c)∈R(a,b),(b,c)\in R implies (a,c)∈R(a,c)\in R.
Equivalence relationA relation that is reflexive, symmetric and transitive.
Definition

Equivalence class — For an equivalence relation RR on XX, the class [a][a] consists of all elements of XX related to aa: [a]={b∈X:(a,b)∈R}[a]=\{b\in X:(a,b)\in R\}.

Intersection of equivalence relations

If R1R_1 and R2R_2 are equivalence relations on XX, then R1∩R2R_1\cap R_2 is also an equivalence relation: each property (reflexivity, symmetry and transitivity) holds in both relations and therefore in their intersection.

Useful equivalence-relation examples

  • Proportional pairs: On ordered pairs of positive integers, (x,y)R(u,v)(x,y)R(u,v) when xv=yuxv=yu; this is equality of ratios xy=uv\frac{x}{y}=\frac{u}{v}, so it is reflexive, symmetric and transitive.
  • Congruence classes: On X={1,2,…,9}X=\{1,2,\ldots,9\}, the relation x−yx-y divisible by 33 has classes {1,4,7}\{1,4,7\}, {2,5,8}\{2,5,8\} and {3,6,9}\{3,6,9\}.
  • Relation from a function: For any function f:X→Yf:X\to Y, defining aRbaRb when f(a)=f(b)f(a)=f(b) gives an equivalence relation.
Worked example

For a function f:X→Yf:X\to Y, define aRbaRb if and only if f(a)=f(b)f(a)=f(b). Show that RR is an equivalence relation.

  1. Every element is related to itself because its function value equals itself.
    f(a)=f(a)⟹(a,a)∈Rf(a)=f(a)\quad\Longrightarrow\quad (a,a)\in R
  2. Equality of function values is symmetric.
    f(a)=f(b)⟹f(b)=f(a)⟹(b,a)∈Rf(a)=f(b)\quad\Longrightarrow\quad f(b)=f(a)\quad\Longrightarrow\quad (b,a)\in R
  3. Equality of function values is transitive.
    f(a)=f(b), f(b)=f(c)⟹f(a)=f(c)⟹(a,c)∈Rf(a)=f(b),\ f(b)=f(c)\quad\Longrightarrow\quad f(a)=f(c)\quad\Longrightarrow\quad (a,c)\in R
Answer: The relation is reflexive, symmetric and transitive; hence it is an equivalence relation.

Counting relations and functions

  • One-one maps: An injective function from a finite set of nn elements to itself is a permutation; there are n!n! such functions. For {1,2,3}\{1,2,3\}, the number is 3!=63!=6.
  • Finite-set property: For a function from a finite set to itself, one-one is equivalent to onto. This equivalence need not hold for infinite sets.
  • Reflexive, transitive but not symmetric: On {1,2,3}\{1,2,3\}, a relation containing (1,2)(1,2) and (2,3)(2,3) must also contain (1,1),(2,2),(3,3),(1,3)(1,1),(2,2),(3,3),(1,3). Exactly three such relations are not symmetric: add neither reverse pair, add (2,1)(2,1) only, or add (3,2)(3,2) only.
  • Equivalence relations containing (1,2),(2,1)(1,2),(2,1): On {1,2,3}\{1,2,3\} there are exactly two: the classes can be {1,2},{3}\{1,2\},\{3\} or the single class {1,2,3}\{1,2,3\}.

Operations on Functions

Sums need not preserve function properties

  • Onto example: The identity IN(x)=xI_{\mathbb N}(x)=x is onto, but (IN+IN)(x)=2x(I_{\mathbb N}+I_{\mathbb N})(x)=2x is not onto N\mathbb N, since odd natural numbers are not outputs.
  • One-one example: On [0,π2][0,\frac{\pi}{2}], both f(x)=sin⁡xf(x)=\sin x and g(x)=cos⁡xg(x)=\cos x are one-one, but their sum is not: (f+g)(0)=(f+g)(π2)=1(f+g)(0)=(f+g)(\frac{\pi}{2})=1.
Practice

For f(x)=cos⁡xf(x)=\cos x and g(x)=3x2g(x)=3x^2, find g∘fg\circ f and f∘gf\circ g. Are they equal?

Hint: Substitute the output of the inner function into the outer function.
Key step: (g∘f)(x)=g(cos⁡x)(g\circ f)(x)=g(\cos x) and (f∘g)(x)=f(3x2)(f\circ g)(x)=f(3x^2).
Solution: (g∘f)(x)=3cos⁡2x(g\circ f)(x)=3\cos^2x and (f∘g)(x)=cos⁡(3x2)(f\circ g)(x)=\cos(3x^2). They are unequal; at x=0x=0, their values are 33 and 11.
Practice

Show that f:R→Rf:\mathbb{R}\to\mathbb{R}, defined by f(x)=x3f(x)=x^3, is invertible and find its inverse.

Hint: The cubic function is strictly increasing; solve y=x3y=x^3 for xx.
Key step: y=x3⟹x=y3y=x^3\Longrightarrow x=\sqrt[3]{y}.
Solution: ff is one-one and onto on R\mathbb{R}, so it is invertible, with f−1(y)=y3f^{-1}(y)=\sqrt[3]{y}.
Practice

On [0,π2][0,\frac{\pi}{2}], f(x)=sin⁡xf(x)=\sin x and g(x)=cos⁡xg(x)=\cos x. Are ff, gg, and f+gf+g one-one?

Hint: Compare the values of f+gf+g at the endpoints.
Key step: (f+g)(0)=1(f+g)(0)=1 and (f+g)(π2)=1(f+g)(\frac{\pi}{2})=1.
Solution: ff and gg are each one-one, but f+gf+g is not one-one because it takes the same value at the distinct inputs 00 and π2\frac{\pi}{2}.

Quick recap

  • For f:A→Bf:A\to B and g:B→Cg:B\to C, g∘f:A→Cg\circ f:A\to C and (g∘f)(x)=g(f(x))(g\circ f)(x)=g(f(x)).
  • Composition is associative when defined, but generally not commutative.
  • A function is invertible exactly when it is one-one and onto; its inverse composes to identity maps.
  • An equivalence relation is reflexive, symmetric and transitive; the intersection of two equivalence relations is also an equivalence relation.
  • The relation aRbaRb defined by f(a)=f(b)f(a)=f(b) is an equivalence relation.
  • For a finite set mapped to itself, one-one and onto are equivalent; there are n!n! bijections on an nn-element set.
  • Adding functions need not preserve onto or one-one properties.

Formula sheet

Relation from A to B
R⊆A×BR\subseteq A\times B
Extreme Relations on A
R=∅orR=A×AR=\varnothing\quad\text{or}\quad R=A\times A
Tests for Relation Properties
∀a∈A:(a,a)∈R;(a,b)∈R⇒(b,a)∈R;(a,b),(b,c)∈R⇒(a,c)∈R\forall a\in A:(a,a)\in R;\quad (a,b)\in R\Rightarrow(b,a)\in R;\quad (a,b),(b,c)\in R\Rightarrow(a,c)\in R
Equivalence Class
[a]={x∈X:xRa}[a]=\{x\in X:xRa\}
Parity Equivalence Classes
[0]={2r:r∈Z},[1]={2r+1:r∈Z},r∈Z[0]=\{2r:r\in\mathbb Z\},\quad [1]=\{2r+1:r\in\mathbb Z\},\quad r\in\mathbb Z
Equivalence Classes Modulo 3
[0]={3r:r∈Z},[1]={3r+1:r∈Z},[2]={3r+2:r∈Z},r∈Z[0]=\{3r:r\in\mathbb Z\},\quad [1]=\{3r+1:r\in\mathbb Z\},\quad [2]=\{3r+2:r\in\mathbb Z\},\quad r\in\mathbb Z
Composition rule
(g∘f)(x)=g(f(x))(g\circ f)(x)=g(f(x))

Mathematics — ALL CHAPTERS

1

Relations And Functions

View

2

Inverse Trigonometric Functions

View

3

Matrices

View

4

DETERMINANTS 

View

5

Continuity And Differentiability

View

6

Application Of Derivatives

View

7

Integrals

View

8

APPLICATION OF INTEGRALS

View

9

DIFFERENTIAL EQUATIONS

View

10

VECTOR ALGEBRA

View

11

Three Dimensional Geometry

View

12

Linear Programming

View

13

Probability

View

14

Proofs In Mathematics

View

15

Mathematical Modelling

View