 # Relations And Functions For Class 12

Relations and Functions Class 12 chapter 1 recalls the notion of relations and functions, range, domain and co-domain have been introduced in class 11 along with the different types of specific real-valued functions and graphs. In class 12 Maths, we will learn about the different types of relations and functions 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 operation.

Let us discuss the concept of relation and function in detail

## Relation

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

### Types of Relations

A relation in set A is a subset of A × A. Thus, A × A is two extreme relations.

Empty Relation

If no element of A is related to any element of A, i.e. R = φ ⊂ A ×A, then the relation in a set 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 is said to be universal relation.

A relation R in a set A is called-

Reflexive- if (a,a) ∈ R, for every a ∈ A.

Symmetric- if (a1,a2) ∈ R implies that (a2,a1) ∈ R , for all a1,a2∈ A.

Transitive- if (a1,a2) ∈ R and (a2,a3) ∈ R  implies that (a1,a3) ∈ R  for all a1,a2,a3 ∈ A.

Equivalence Relation- A relation in a set A is 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 X-value should be connected to only one y-value.

### Types of Functions

1. 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 x1 , x2 ∈ X, f(x1 ) = f(x2 ) implies x1 = x2 . Otherwise, f is called many-one.
2. 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.
3. One-one 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 and Invertible Function

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

### Binary Operations

A binary operation ∗ on a set A is a function ∗ : A × A → A. We denote ∗ (a, b) by a ∗ b.

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

Solution: R × R → R, given by (a, b) → a – b, is not binary operation, as the image of (3, 5) under ‘–’ is 3 – 5 = – 2 ∉ R.

Similarly, ÷: R × R → R, given by (a, b) → a ÷ b is not a binary operation, as the image of (3, 5) under ÷ is 3 ÷ 5 = 3 5 ∉ R.

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