Scribd
Upload
21 views2 pages

Relations and Functions

The document provides an overview of relations and functions, defining key concepts such as relations from one set to another, types of relations (identity, reflexive, symmetric, transitive, equivalence, antisymmetric), and functions including their definitions, domains, ranges, and types (one-one, onto, bijective). It also discusses the composition of functions, invertible functions, and binary operations along with their properties (commutative, associative, distributive, identity, and invertibility). Overall, it serves as a foundational guide to understanding relations and functions in mathematics.

Uploaded by

mathipraba79
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
21 views2 pages

Relations and Functions

The document provides an overview of relations and functions, defining key concepts such as relations from one set to another, types of relations (identity, reflexive, symmetric, transitive, equivalence, antisymmetric), and functions including their definitions, domains, ranges, and types (one-one, onto, bijective). It also discusses the composition of functions, invertible functions, and binary operations along with their properties (commutative, associative, distributive, identity, and invertibility). Overall, it serves as a foundational guide to understanding relations and functions in mathematics.

Uploaded by

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

Relations and functions

1. Introduction to relations

(i) A relation from a set AA to a set BB is a subset of A×BA×B.

(ii) Total number of relations from a set consisting of mm elements to a set


consisting of nn elements are 2mn2mn.

(iii) A relation on a set AA is a subset of A×AA×A

2. Types of relations

(i) The identity relation, if every element of AA is related to itself only.

(ii) Reflexive, if (a,a)∈R(a,a)∈R for all a∈Aa∈A

(iii) Symmetric, if (a,b)∈R⇒(b, a)∈R(a,b)∈R⇒(b, a)∈R for all a,b∈Aa,b∈A

(iv) Transitive, if (a,b)∈R(a,b)∈R and (b, c)∈R⇒(a,c)∈R(b, c)∈R⇒(a,c)∈R for


all a,b,c∈Aa,b,c∈A

(v) An equivalence relation, if it is reflexive, symmetric and transitive.

(vi) Antisymmetric, if (a,b)∈R(a,b)∈R and (b,a)∈R⇒a=b(b,a)∈R⇒a=b

(vii) The empty relation, if R=ϕR=ϕ

(viii) The universal ration, if R=A × AR=A × A

3. Functions- Definition, domain, range and its types.

(i) Let AA and BB be two non-empty sets. Then, a


function ff from AA to BB associates every element of AA to a unique element
of BB.
(ii) The set AA is called the domain of ff and the set BB is known as its co-domain.
The set of images of elements of set AA is known as the range of ff.

(iii) A function f:A→Bf:A→B is a one-one function or an injection,


if f(x)=f(y)⇒x=yf(x)=f(y)⇒x=y for
all x,y∈Ax,y∈A or, x≠y⇒f(x)≠f(y)x≠y⇒f(x)≠f(y) for all x,y∈Ax,y∈A.
(iv) A function f:A→Bf:A→B is an onto function or a surjection, if range (f)=(f)= co-
domain(f).(f).

Note: A function which is both one-one and onto function is called bijective function.

4. Composition of functions and Invertible functions

(i) If f:A→Bf:A→B is a bijection, then g:B→Ag:B→A is inverse


of ff if f(x)=y⇒g(y)=xf(x)=y⇒g(y)=x or gof=IAgof=IA and fog=IBfog=IB

(ii) Let f:A→Bf:A→B and g:B→Ag:B→A be two


functions, If gof=IAgof=IA and ff is an injection, then gg is a surjection.
And if fog=IBfog=IB and ff is a surjection, then gg is an injection.

(iii) Let f:A→Bf:A→B and g:B→Cg:B→C be two functions,


If gof: A→Cgof: A→C is onto, then g:B→Cg:B→C is onto And
if gof:A→Cgof:A→C is one-one, then f: A→Bf: A→B is one-one.

5. Binary operation and its properties

(i) A binary operation ** on a set SS associates any two elements a,b∈Sa,b∈S to


a unique element a*b∈Sa*b∈S.

(ii) Commutative, if a*b=b*aa*b=b*a for all a,b∈Sa,b∈S

(iii) Associative, if (a*b)*c=a*(b*c)(a*b)*c=a*(b*c) for all a,b,c∈Sa,b,c∈S

(iv) Distributive over a binary operation ∘∘on SS,


if a*(b∘c)=(a*b)∘(a*c)a*(b∘c)=(a*b)∘(a*c) and (b∘c)*a=(b*a)∘(c*a)
(b∘c)*a=(b*a)∘(c*a) for all a,b∈Sa,b∈S

(v) Let ** be a binary operation on a set S.S. An element e∈Se∈S is said to be


identity element for the binary operation **, if a*e=a=e*aa*e=a=e*a for
all a∈S.a∈S.

(vi) Let ** be a binary operation on a set SS and e∈Se∈S be the identity element.
An element aa in SS is said to be invertible if there exists an
element b∈Sb∈S such that a*b=e=b*a

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy