Scribd
Upload
38 views2 pages

Definition and Properties: Examples

Relaciones binarias visto en clase de matematicas discretas

Uploaded by

Joetan Saldaña
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
38 views2 pages

Definition and Properties: Examples

Relaciones binarias visto en clase de matematicas discretas

Uploaded by

Joetan Saldaña
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/ 2

Discrete Mathematics - Relations

https://www.tutorialspoint.com/discrete_mathematics/discrete_mathematics_relations.htm
Copyright © tutorialspoint.com

Advertisements
Whenever sets are being discussed, the relationship between the elements of the sets is the
next thing that comes up. ​Relations​ may exist between objects of the same set or between
objects of two or more sets.

Definition and Properties


A binary relation R from set x to y
writtenas$xRy$or$R(x,y​writtenas$xRy$or$R(x,y​)isasubsetoftheCartesianproduct​)i
sasubsetoftheCartesianproductx \times y$. If the ordered pair of G is reversed, the relation also
changes.
Generally an n-ary relation R between sets A ​ ​1​,…,​ ​and​ ​A​n​A1,…, and An is a subset of the
n-ary product A ​ ​1​×⋯×A​n​A1×⋯×An. The minimum cardinality of a relation R is Zero and
maximum is n ​ ​2​n2 in this case.
A binary relation R on a single set A is a subset of A ​ ×A​A×A.
For two distinct sets, A and B, having cardinalities ​m​ and ​n​ respectively, the maximum
cardinality of a relation R from A to B is ​mn​.

Domain and Range


If there are two sets A and B, and relation R have order pair ​x,y​x,y, then −
● The ​domain​ of R, Dom​R​R, is the set
{x|(x,y)∈RforsomeyinB}​{x|(x,y)∈RforsomeyinB}
● The ​range​ of R, Ran​R​R, is the set
{y|(x,y)∈RforsomexinA}​{y|(x,y)∈RforsomexinA}

Examples
Let, ​A={1,2,9}​A={1,2,9} and ​B={1,3,7}​B={1,3,7}
● Case 1 − If relation R is 'equal to' then ​R={(1,1),(3,3)}​R={(1,1),(3,3)}
Dom​R​R = {
​ 1,3},Ran(R)={1,3}​{1,3},Ran(R)={1,3}
● Case 2 − If relation R is 'less than' then
R={(1,3),(1,7),(2,3),(2,7)}​R={(1,3),(1,7),(2,3),(2,7)}
Dom​R​R = {​ 1,2},Ran(R)={3,7}​{1,2},Ran(R)={3,7}
● Case 3 − If relation R is 'greater than' then
R={(2,1),(9,1),(9,3),(9,7)}​R={(2,1),(9,1),(9,3),(9,7)}
Dom​R​R = { ​ 2,9},Ran(R)={1,3,7}​{2,9},Ran(R)={1,3,7}
Representation of Relations using Graph
A relation can be represented using a directed graph.
The number of vertices in the graph is equal to the number of elements in the set from which the
relation has been defined. For each ordered pair x ​ ,y​x,y in the relation R, there will be a directed
edge from the vertex ‘x’ to vertex ‘y’. If there is an ordered pair x ​ ,x​x,x, there will be self- loop on
vertex ‘x’.
Suppose, there is a relation R
​ ={(1,1),(1,2),(3,2)}​R={(1,1),(1,2),(3,2)} on set
S={1,2,3}​S={1,2,3}, it can be represented by the following graph −

Types of Relations
● The ​Empty Relation​ between sets X and Y, or on E, is the empty set ​∅​∅
● The ​Full Relation​ between sets X and Y is the set ​X×Y​X×Y
● The ​Identity Relation​ on set X is the set { ​ (x,x)|x∈X}​{(x,x)|x∈X}
● The Inverse Relation R' of a relation R is defined as −
R​′​={(b,a)|(a,b)∈R}​R′={(b,a)|(a,b)∈R}
Example​ − If R ​ ={(1,2),(2,3)}​R={(1,2),(2,3)} then ​R​′​R′ will be
{(2,1),(3,2)}​{(2,1),(3,2)}
● A relation R on set A is called ​Reflexive​ if ∀ ​ a∈A​∀a∈A is related to a
aRaholds​aRaholds
Example​ − The relation R ​ ={(a,a),(b,b)}​R={(a,a),(b,b)} on set X ​ ={a,b}​X={a,b} is
reflexive.
● A relation R on set A is called ​Irreflexive​ if no a ​ ∈A​a∈A is related to a
aRadoesnothold​aRadoesnothold.
Example​ − The relation R ​ ={(a,b),(b,a)}​R={(a,b),(b,a)} on set X ​ ={a,b}​X={a,b} is
irreflexive.
● A relation R on set A is called ​Symmetric​ if x ​ Ry​xRy implies y
​ Rx​yRx, ∀
​ x∈A​∀x∈A
and ∀ ​ y∈A​∀y∈A.
Example​ − The relation R ​ ={(1,2),(2,1),(3,2),(2,3)}​R={(1,2),(2,1),(3,2),(2,3)} on
set A​ ={1,2,3}​A={1,2,3} is symmetric.
● A relation R on set A is called ​Anti-Symmetric​ if x ​ Ry​xRy and y​ Rx​yRx implies
x=y∀x∈A​x=y∀x∈A and ∀ ​ y∈A​∀y∈A.
Example​ − The relation R ​ ={(x,y)→N|x≤y}​R={(x,y)→N|x≤y} is anti-symmetric since
x≤y​x≤y and y ​ ≤x​y≤x implies x ​ =y​x=y.
● A relation R on set A is called ​Transitive​ if x ​ Ry​xRy and y​ Rz​yRz implies
xRz,∀x,y,z∈A​xRz,∀x,y,z∈A.
Example​ − The relation R ​ ={(1,2),(2,3),(1,3)}​R={(1,2),(2,3),(1,3)} on set
A={1,2,3}​A={1,2,3} is transitive.
● A relation is an ​Equivalence Relation​ if it is reflexive, symmetric, and transitive.
Example​ − The relation
R={(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2),(1,3),(3,1)}​R={(1,1),(2,2),(3,3)
,(1,2),(2,1),(2,3),(3,2),(1,3),(3,1)} on set A ​ ={1,2,3}​A={1,2,3} is an equivalence relation
since it is reflexive, symmetric, and transitive.

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