“You must expect great things of yourself before you can do them.” –Michael Jordan

# RELATIONS AND FUNCTIONS CLASS 12 MATHS

In this chapter, we studied different types of relations and equivalence relation, composition of functions, invertible functions and binary operations. The main features of this chapter are as follows:Â

Empty relation is the relation R in X given by R = Ï† âŠ‚ X Ã— X.Â

Universal relation is the relation R in X given by R = X Ã— X.Â

Reflexive relation R in X is a relation with (a, a) âˆˆ R âˆ€a âˆˆ X.

Symmetric relation R in X is a relation satisfying (a, b) âˆˆ R implies (b, a) âˆˆ R.

Transitive relation R in X is a relation satisfying (a, b) âˆˆ R and (b, c) âˆˆ R implies that (a, c) âˆˆ R.

Equivalence relation R in X is a relation which is reflexive, symmetric and transitive.

Equivalence class [a] containing a âˆˆ X for an equivalence relation R in X is the subset of X containing all elements b related to a.

A function f : X â†’ Y is one-one (or injective) if f(x_{1}) = f(x_{2} ) â‡’ x_{1} = x_{2} âˆ€ x_{1}, x_{2} âˆˆ X.

A function f : X â†’ Y is onto (or surjective) if given any y âˆˆ Y, âˆƒ x âˆˆ X such that f(x) = y.

A function f : X â†’ Y is one-one and onto (or bijective), if f is both one-one and onto.

The composition of functions f : A â†’ B and g : B â†’ C is the function gof : A â†’ C given by gof(x) = g(f(x))âˆ€ x âˆˆ A.

A function f : X â†’ Y is invertible if âˆƒ g : Y â†’ X such that gof = IX fog = IY

A function f : X â†’ Y is invertible if and only if f is one-one and onto. and

Given a finite set X, a function f : X â†’ X is one-one (respectively onto) if and only if f is onto (respectively one-one). This is the characteristic property of a finite set. This is not true for infinite set

A binary operation âˆ— on a set A is a function âˆ— from A Ã— A to A. î‚® An element e âˆˆ X is the identity element for binary operation âˆ— : X Ã— X â†’ X, if a âˆ— e = a = e âˆ— a âˆ€a âˆˆ X.

An element a âˆˆ X is invertible for binary operation âˆ— : X Ã— X â†’ X, if there exists b âˆˆ X such that a âˆ— b = e = b âˆ— a where, e is the identity for the binary operation âˆ—. The element b is called inverse of a and is denoted by a^{â€“1}.

An operation âˆ— on X is commutative if a âˆ— b = b âˆ— a âˆ€a, b in X.

An operation âˆ— on X is associative if (a âˆ— b) âˆ— c = a âˆ— (b âˆ— c)âˆ€a, b, c in X.

## Select Lecture

- Empty Relations
- Universal Relations
- Trivial Relations
- Reflexive Relations
- Symmetric Relations
- Transitive Relations
- Equivalence Relations
- NCERT Exercise 1.1
- NCERT Examples
- Exemplar Problems
- Boardâ€™s Question Bank

- Reflexive Relations
- Symmetric Relations
- Transitive Relations
- Equivalence Relations
- Equivalence Classes
- Partition of Sets (Basics)
- NCERT Exercise 1.1
- NCERT Examples
- Exemplar Problems
- Boardâ€™s Question Bank

- One â€“ One (Injective Functions)
- Many â€“ One
- Onto (Surjective Functions)
- Into
- Bijective Functions
- NCERT Exercise 1.2
- NCERT Examples
- Boardâ€™s Question Bank

- One â€“ One (Injective Functions)
- Many â€“ One
- Onto (Surjective Functions)
- Into
- Bijective Functions
- NCERT Exercise 1.2
- NCERT Exemplar
- NCERT Examples
- Boardâ€™s Question Bank

- Composite Functions
- NCERT Exercise 1.3
- NCERT Examples
- Exemplar Problems
- Boardâ€™s Question Bank

- Invertible Functions
- NCERT Exercise 1.3
- NCERT Examples
- Exemplar Problems
- Boardâ€™s Question Bank

- Inverse Functions (Invertible Functions)
- NCERT Exercise 1.3
- Boardâ€™s Question Bank