Scribd
Upload
3K views3 pages

CBSE Notes Class 12 Chapter 1 - Relations and Functions

This document defines and provides examples of relations and functions. It discusses empty and universal relations, and reflexive, symmetric, and transitive relations that form an equivalence relation. It also defines one-to-one, onto, and bijective functions, and composition and invertible functions. Finally, it defines binary operations on a set as a function from the Cartesian product to the set, and lists properties such as identity elements, inverses, commutativity, and associativity.

Uploaded by

Jeffrish raidn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3K views3 pages

CBSE Notes Class 12 Chapter 1 - Relations and Functions

This document defines and provides examples of relations and functions. It discusses empty and universal relations, and reflexive, symmetric, and transitive relations that form an equivalence relation. It also defines one-to-one, onto, and bijective functions, and composition and invertible functions. Finally, it defines binary operations on a set as a function from the Cartesian product to the set, and lists properties such as identity elements, inverses, commutativity, and associativity.

Uploaded by

Jeffrish raidn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

CBSE Notes Class 12 Chapter 1 – Relations and

Functions
Relations
A relation can be mathematically defined as the linking or connection between two different
objects or quantities.
Examples of relations:
(i) {(a, b) ∈ A × B: a is brother of b},
(ii) {(a, b) ∈ A × B: a is sister of b},
(iii) {(a, b) ∈ A × B: age of a is greater than age of b},
(iv) {(a, b) ∈ A × B: total marks obtained by a in the final examination is less than the
total marks obtained by b in the final examination},
(v) {(a, b) ∈ A × B: a lives in the same locality as b}. However, abstracting from this, we
define mathematically a relation R from A to B as an arbitrary subset of A × B.

Types of Relations
 Empty Relation
 Universal Relation
 Reflexive Relation
 Symmetric relation
 Transitive relation
 Equivalence relation

Empty Relation: A relation R in a set A is called empty relation, if no element of A is related


to any element of A, i.e., R = φ ⊂ A × A.
Universal Relation: A relation R in a set A is called universal relation, if each element of A is
related to every element of A, i.e., R = A × A.

Reflexive Relation: A relation R in a set A is said to be an equivalence relation if R is

https://byjus.com
reflexive, symmetric and transitive.
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.

Functions
Functions are defined as a special kind of relations.

Types of Functions
1) One-one Function
A function f : X → Y is one-one (or injective) if f(x1) = f(x2) ⇒ x1 = x2 ∀ x1 , x2 ∈ X.

2) Onto Function
A function f : X → Y is onto (or surjective) if given any y ∈ Y, ∃ x ∈ X such that f(x) = y.

3) One-One and Onto Function


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

Composition of functions
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.

Invertible Function
A function f : X → Y is invertible if ∃ g : Y → X such that gof = IX and fog = IY .
Condition- A function f : X → Y is invertible if and only if f is one-one and onto.

Binary Operation
A binary operation can be defined as the set of operations such as addition, subtraction,

https://byjus.com
division and multiplication that are usually carried out to an arbitrary set called ‘X’. The
operations that ensue, in order to obtain a result for the following pair of elements such a, b
from X to another element of X is called as a binary operation.

A binary operation ∗ on a set A is a function ∗ from A × A to A.


Properties
 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.

https://byjus.com

You might also like