Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
90 views

Relations and Functions Notes

Notes for class 12

Uploaded by

avneetkulwinder
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
90 views

Relations and Functions Notes

Notes for class 12

Uploaded by

avneetkulwinder
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

RELATIONS AND FUNCTIONS:

Learning Objectives for Relations and Functions:

By the end of this unit, students will be able to:

1. Understand and differentiate between relations and functions.


2. Classify functions into various types (e.g., one-one, onto, many-one,
constant, identity, etc.).
3. Analyze and solve problems related to composition of functions and
invertible functions.

The topics relations and Functions are:

 Introduction
 Types of Relations
 Types of Functions
 Composition of functions and invertible function

Introduction
The concept of the term ‘relation’ in mathematics has been drawn from the
meaning of relation in English language, according to which two objects or
quantities are related if there is a recognizable connection or link between the
two objects or quantities

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 sometimes called
trivial relations.

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 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

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

Into function
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 = IX and fog = IY. 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.

You might also like