**Relations and Functions Class 12**Â Chapter 1 stats with the revision of general notation of relations and functions. Students have already learned about domain, codomain and range in class 11 along with the various types of specific real-valued functions and the respective graphs. In class 12 Maths Chapter 1, students will learn about different types of relations and functions, the composition of functions, etc., in detail.

## Relations and Functions For Class 12 Concepts

The topics and subtopics covered in relations and Functions for class 12 are:

- Introduction
- Types of Relations
- Types of Functions
- Composition of functions and invertible functions
- Binary operations

Let us discuss the concept of relation and function in detail here.

## Relation

The concept of relation is used in relating two objects or quantities with each other. Suppose two sets are considered, the relationship between them will be established if there is a connection between the elements of two or more non-empty sets.

Mathematically, “aÂ relation R from a set A to a set B is a subset of the cartesian product A Ã— B obtained by describing a relationship between the first element x and the second element y of the ordered pairs in A Ã— B”.

**Types of Relations**

A relation R from A to A is also stated as a relation on A, and it can be said that the relation in a set A is a subset of A Ã— A. Thus, the empty set Ï† and A Ã— A are two extreme relations. Below are the definitions of types of relations:

**Empty Relation**

If no element of A is related to any element of A, i.e. R = Ï† âŠ‚ A **Ã— **A**,**Â then the relation R in a set A is called empty relation.

**Universal Relation**

If each element of A is related to every element of A, i.e. R = AÂ **Ã—** A, then the relation R in set A is said to be universal relation.

Both the empty relation and the universal relation are some times called trivial relations.

A relation R in a set A is called-

**Reflexive- **if (a, a) âˆˆ R, for every aÂ âˆˆ A,

**Symmetric- **if (a_{1}, a_{2}) âˆˆ RÂ implies thatÂ (a_{2}, a_{1}) âˆˆ R , for all a_{1}, a_{2}âˆˆ A,

**Transitive- **if (a_{1}, a_{2}) âˆˆ RÂ and (a_{2}, a_{3}) âˆˆ R Â implies that (a_{1}, a_{3}) âˆˆ RÂ Â for all a_{1}, a_{2}, a_{3} âˆˆ A.

**Equivalence Relation- **A relation R in a set A is an equivalence relation if R is reflexive, symmetric and transitive.

## Functions

A function is a relationship which explains that there should be only one output for each input. It is a special kind of relation(a set of ordered pairs) which obeys a rule, i.e. every y-value should be connected to only one y-value.

Mathematically, “aÂ relation f from a set A to a set B is said to be a function if every element of set A has one and only one image in set B”.

In other words, a function f is a relation from a set A to set B such that the domain of f is A and no two distinct ordered pairs in f have the same first element. Also, A and B are two non-empty sets.

### Types of Functions

**One to one Function:**A function f : X â†’ Y is defined to be one-one (or injective), if the images of distinct elements of X under f are distinct, i.e., for every x_{1}, x_{2}âˆˆ X, f(x_{1}Â ) = f(x_{2}Â ) implies x_{1}Â = x_{2}Â . Otherwise, f is called many-one.**Onto Function:**A function f: X â†’ Y is said to be onto (or surjective), if every element of Y is the image of some element of X under f, i.e., for every y âˆˆ Y, there exists an element x in X such that f(x) = y.**One-one and Onto Function:**A function f: X â†’ Y is said to be one-one and onto (or bijective), if f is both one-one and onto.

### Composition of Functions

Let f: A â†’ B and g: B â†’ C be two functions. Then the composition of f and g, denoted by **gof**, is defined as the function gof: A â†’ C given by;

** gof (x) = g(f (x)), âˆ€ x âˆˆ A**

### Invertible Functions

A function f : X â†’ Y is defined to be invertible if there exists a function g : Y â†’ X such that gof = I_{X} and fog = I_{Y}. The function g is called the inverse of f and is denoted by f^{â€“1}.

An important note is that, if f is invertible, then f must be one-one and onto and conversely if f is one-one and onto, then f must be invertible.

### Binary Operations

A binary operation âˆ— on a set A is a function âˆ— : A Ã— A â†’ A. We denote âˆ— (a, b) by a âˆ— b.

### Example Problems

**Example 1:Â **Show that subtraction and division are not binary operations on R.

**Solution:**Â N Ã— N â†’ N, given by (a, b) â†’ a â€“ b, is not binary operation, as the image of (2, 5) under â€˜â€“â€™ is 2 â€“ 5 = â€“ 3 âˆ‰ N.

Similarly, Ã·: N Ã— N â†’ N, given by (a, b) â†’ a Ã· b is not a binary operation, as the image of (2, 5) under Ã· is 2 Ã· 5 = 2/5 âˆ‰ N.

**Example 2:**Â Let f : {2, 3, 4, 5} â†’ {3, 4, 5, 9} and g : {3, 4, 5, 9} â†’ {7, 11, 15} be functions defined as f(2) = 3, f(3) = 4, f(4) = f(5) = 5 and g (3) = g (4) = 7 and g (5) = g (9) = 11. Find gof.

**Solution:** From the given, we have:

gof(2) = g (f(2)) = g (3) = 7

gof (3) = g (f(3)) = g (4) = 7

gof(4) = g (f(4)) = g (5) = 11

gof(5) = g (5) = 11

**Example 3:**Â Show that the relation R in the set Z of integers given by R = {(a, b) : 2 divides a â€“ b} is an equivalence relation.

**Solution:**Â R is reflexive, as 2 divides (a â€“ a) for all a âˆˆ Z.

Further, if (a, b) âˆˆ R, then 2 divides a â€“ b.

Therefore, 2 divides b â€“ a.

Hence, (b, a) âˆˆ R, which shows that R is symmetric.

Similarly, if (a, b) âˆˆ R and (b, c) âˆˆ R, then (a â€“ b) and (b â€“ c) are divisible by 2.

Now, a â€“ c = (a â€“ b) + (b â€“ c) is even. (from the above statements)

From this,

(a â€“ c) is divisible by 2.

This shows that R is transitive.

Thus, R is an equivalence relation in Z.

Download BYJU’S – The Learning App and have fun learning with us.