MATHEMATICS IN

THE MODERN WORLD

Last time…
 Sets
 Definition of terms
 Set Representation
 Membership and containment
 Set Operations
 Venn Diagram
 Set theory

Discrete Mathematics copyright©2006 esnatalio

Now…

 Relations
 Relations and properties

Discrete Mathematics copyright©2006 esnatalio

Cartesian Product
René Descartes
(1596-1650)

 Let A and B be non-empty sets.

The Cartesian product (or cross
product) of A and B is defined as
AxB = {(x,y) / xA  xB}

 AxB is the set of all ordered pairs (x,y) such

that x comes from A and y comes from B. x is
called the first component (abscissa) and y is
called the second component (ordinate)

Discrete Mathematics copyright©2006 esnatalio

Cartesian Product
 Example: A={1,2} and B={x,y,z}
AxB = {(1,x), (1,y), (1,z), (2,x), (2,y), (2,z)}
BxA = {(x,1), (x,2), (y,1), (y,2), (z,1), (z,2)}

 Note: x is not commutative, i.e.,

AxB BxA

Discrete Mathematics copyright©2006 esnatalio

Relation
 A relation, R, is a set of ordered
pairs (x,y).

 The set of all first components is

called the domain of R, D(R).
 The set of all second components is
called the range of R, R(R).
 The field of R, F(R) = D(R)  R(R).

Discrete Mathematics copyright©2006 esnatalio

Example 1
 Let A={2,3} and B={3,4,5,6}.

R = {(x,y) / x exactly divides y}

= {(2,4), (2,6), (3,3), (3,6)}

D(R) = {2,3}
R(R) = {3, 4, 6}

Discrete Mathematics copyright©2006 esnatalio

Example 2
 Let R be a relation on A={1,2,3}
defined by
R = { (x,y) / x  y  x,y  A}
then
R = { (1,1), (1,2), (1,3), (2,2), (2,3), (3,3)}
D(R) = {1,2,3}
R(R) = {1,2,3}

Discrete Mathematics copyright©2006 esnatalio

Properties of Relations
 Consider a relation R on A={1,2,3}.

 R is reflexive iff x A, (x,x)  R

R={(1,1), (1,2), (2,2), (3,3), (3,2)} is
reflexive since the ordered pairs (1,1),
(2,2) and (3,3) are in R

 R is irreflexive iff x A, (x,x)  R

R={(1,2), (1,3), (3,2)} is irreflexive since
none of the ordered pairs (1,1), (2,2), (3,3)
are in R.

Discrete Mathematics copyright©2006 esnatalio

Properties of Relations
 Consider a relation R on A={1,2,3}.

 R={(1,1), (1,2), (2,2), (3,2)} is not reflexive

since the ordered pairs (3,3) is not on R
and is not irreflexive since (1,1) is in R.

 R is symmetric iff x,y A, if (x,y)  R

then (y,x)  R.
R={(1,1), (1,2), (2,1), (2,3), (3,2)} is
symmetric since (1,2) and (2,1) are in R,
simililarly (2,3) and (3,2) are in R.

Discrete Mathematics copyright©2006 esnatalio

Properties of Relations
 Consider a relation R on A={1,2,3}.

 R is antisymmetric iff x,y A, if (x,y) 

R then (y,x)  R.

R = {(1,2), (2,3)} is antisymmetric since

(1,2) is in R but (2,1) is not in R, similarly
(2,3) is in R but not (3,2)

Discrete Mathematics copyright©2006 esnatalio

Properties of Relations

 Consider a relation R on A={1,2,3}.

 R is asymmetric iff x,y A, x  y, if

(x,y)  R then (y,x)  R.

R = {(1,1), (1,2), (2,3), (3,3)} is

antisymmetric since (1,2) is in R but not
(2,1), (2,3) are in R but not (3,2).
However, R is not asymmetric since (1,1)
and (3,3) are in R.

Discrete Mathematics copyright©2006 esnatalio

Properties of Relations

 Consider a relation R on A={1,2,3}.

 R is transitive iff x,y,z A, if (x,y) and

(y,z)  R then (x,z)  R.

R = {(1,1), (1,2), (1,3), (2,1), (2,2), (2,3)} is

transitive.

Discrete Mathematics copyright©2006 esnatalio

Properties of Relations
 Consider a relation R on A={1,2,3}.

 R is intransitive iff x,y,z A, if (x,y) and

(y,z)  R then (x,z)  R.

R = {(1,1), (1,2), (2,3)} is intransitive since

(1,3) is not in R.

R = {(1,1), (1,2), (2,1)} is not transitive

since (2,2) is not in R, and not intransitive
since (1,1) is R.

Discrete Mathematics copyright©2006 esnatalio

Properties of Relations
 Consider a relation R on A={1,2,3}.

 R is an equivalence relation iff R is

reflexive, symmetric and transitive.

R = {(1,1), (1,2), (2,1), (2,2), (3,3)} is an

equivalence relation.

Theorem: If a relation is both symmetric

and transitive, then R is reflexive.

Discrete Mathematics copyright©2006 esnatalio