RELATIONS AND

CARTESIAN
PRODUCTS
Mathematics in the Modern World
Richard N. Aufmann

Andrew Nathaniel S. Blaza

BSCpE-1A
Learning Outcomes

 Understand the concept of Relation and Cartesian

Products;
 Identify the domain and range of the relation;
 Find a relation from a given set;
 Determine the composition of a given relation;
 Determine the Cartesian Product of given sets.
Relation
 What is Relation?
Relation is the way in which two or more concepts, objects, or
people are connected; a thing's effect on or relevance to another.

According to Merriam-Webster Dictionary, a relation is the way in

which two or more people, groups, countries, talk to, behave toward,
and deal with each other. It is the way in which two or more people or
things are connected.
 Relation
People are abound in daily life.
 Parents and children
 Teachers and students
 Employers and
employees
 Government and citizen
 Relation
 A relation is a rule that relate values from a set of values to a
second set of values.
 The elements of the domain can be imagined as input to a
machine that applies a rule to these inputs to generate one or
more outputs.
 A relation is also a set of ordered pair (x, y).
 Ordered Pair
 An ordered pair is a composition of the x coordinate and the y
coordinate, having two values written in a fixed order within
parentheses.

(2, 4) (3,7) (13, 5) (9, 12)

 Domain and Range
 The domain is the set of all first elements of ordered pairs (x-
coordinates).
  The range is the set of all second elements of ordered pairs (y-
coordinates).
 There is a form of relation wherein each element in the domain
is related to only one value in the range, and we called it a
function.
 Relation as Ordered Pair

Examples:
 N = {(1, 2), (2, 3), (3, 4), (4, 5), (5, 7), (6, 9)}
 A = {(12, 43), (1, 22), (9, 10), (12, 12)}
 T = {(1, 9), (2, 8), (3, 7), (4, 6), (5, 5)}
 O = {(3, 4), (16, 13), (4, 11), (6, 8)}
 Relation in Mapping Diagram
Example:
The numbers on the left side
are the domain (input) and the
numbers on the right side are
the range (output).
So if we will write it in ordered
pairs:
E = {(-2, -1), (-1, 0), (0, 1), (1, 2),
(2, 3), (3, 4)}
 Relation in Table
Examples:
The numbers on the X column
are the domain (input) and the
numbers on the Y column are
the range (output).
So if we will write it in ordered
pairs:
E = {(1, 6), (-3, 2), (5, 0), (-1, -5),
(4, 2)}
 Relation in Graph
Examples:
In a graph, points has x and y
coordinates.
So in this graph, the coordinates
are:
E = {(-2, 4), (-1, 1), (0, 0), (1, 1),
(2, 4)}
Wherein all values of x are the
domain and all values of y are
the range.
 Relation and their Properties
Binary Relation
 The most direct way to express a relationship between elements
of two sets is to use ordered pairs made up of two related
elements
 Binary relation: Let A and B be sets. A binary relation from A to B
is a subset of A×B
 A binary relation from A to B is a set R of ordered pairs where the
1st element comes from A and the 2nd element comes from B
 Binary Relation
 aRb denotes that (a,b)∊R
 When (a,b) belongs to R, a is said to be related to b by R
 Likewise, n-ary relations express relationships among n elements
 Let A1, A2, …, An be sets. An n-ary relation of these sets is a subset
of A1×A2×…×An. The sets A1, A2, ..., An are called the domains of
the relation, and n is called its degree
 Binary Relation
Example
 Let A be the set of students and B be the set of courses
 Let R be the relation that consists of those pairs (a, b) where a∊A and
b∊B
 If Jason is enrolled only in CSE20, and John is enrolled in CSE20 and
CSE21
 The pairs (Jason, CSE20), (John,CSE20), (John, CSE 21) belong to R
 But (Jason, CSE21) does not belong to R
 Binary Relation
Example
 Let A be the set of all province, and let B be the set of the regions in the
Philippines. Define a relation R by specifying (a,b) belongs to R if province a
is in region b
 For instance, (Laguna, Calabarzon), (Mindoro, Mimaropa), (Bataan, Central
Luzon), (Makati, NCR), (Camarines Norte, Bicol), (Cotabato, Soccsksargen),
and (Isabela, Cagayan Valley) are in R
Properties of
Relation
 Reflexive Relations
 A relation R is reflexive if (a, a) ∊ R, for every a ∊ A
Example:
 A = {1, 2, 3, 4}
 R = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 1), (3, 3), (4, 4)}
 Symmetric Relations
 A relation R is symmetric if (a, b) ∊ R implies (b, a) ∊ R
Example:
 B = {1, 2, 3}
 R = {(1, 2), (1, 3), (2, 1), (3, 1)}
 Anti-Symmetric Relations
 A relation R on a set is antisymmetric if (a, b) ∊ A, if (a, b) ∊ R and
(b, a) ∊ R, then a = b
Example:
 A = {1, 2, 3}
 R = {(1, 1), (1, 2), (1, 3), (3, 3)}
 Transitive Relations
 A relation R on a set is transitive if whenever (a, b) ∊ R and (b, c) ∊
R, then(a, c) ∊ R, {a, b, c} ∊ A.
Example:
 A = {1, 2}
 R = {(1, 1), (1, 2), (2, 1), (2, 2)}
 Equivalence Relation
 A relation R is said to be equivalence if it is reflexive, transitive and
symmetric.
Example:
 A = {1, 2, 3, 4}
 R = {(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3),
(4, 4)}
 Partial Order of Relation
 A relation R is said to be partial order if it is reflexive, transitive and
antisymmetric.
Example:
 A = {1, 2, 3, 4}
 R = {(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3),
(4, 4)}
• Reflexive • Antisymmetric • Transitive
(a, a) ∊ R, for every a ∊ A (a, b) ∊ R and (b, a) ∊ R, then a = b (a, b) ∊ R and (b, c) ∊ R, then(a, c) ∊ R, {a, b, c} ∊ A.
Cartesian
Products
Cartesian Product
 Philosopher
 Mathematician
 Scientist

Rene Descartes
(1596–1650)
 Cartesian Product
 
If A and B are two non-empty sets, then their Cartesian product A ×
B is the set of all ordered pair of elements from A and B. An ordered
pair means that two elements are taken from each set.

A × B = {(x, y): x A, y B}
 Cartesian Product
The Cartesian product of sets A and B, denoted A x
B, is

A x B = { ( a, b ) | a  A  b  B }.
 Cartesian Product
Example:
 Let S = { small, medium, large } and
C = { pink, lavender }.
 Enumerate the ordered pairs in S x C.
 Enumerate the ordered pairs in C x S.
 Enumerate the ordered pairs in  x
S.
 |SxC|=
 S x C = {(small, pink), (small, lavender),
(medium, pink), (medium, lavender),
(large, pink), (large lavender),}
 C x S = {(pink, small), (pink, medium),
(pink, large), (lavender, small), (lavender,
medium), (lavender, large)}
xS=
|SxC|=6
 Cartesian Product
Example:  (a) A × B = {(7, 2), (7, 4), (7, 6),
If A = {7, 8} and B = {2, (8, 2), (8, 4), (8, 6)}
4, 6}  (b) B x A = {(2, 7); (2, 8); (4, 7);
find: (a) A × B, and (4, 8), (6, 7), (6, 8)}

(b) B x A.
 Cartesian Product

Definition: The Cartesian Product of sets A and B,

written as A x B, is the set of all ordered pairs (a, b)
where a ∈ A and b ∈ B.
 Cartesian Product
Example:
 Given A = {n, o, e} and B = {1, 2}
Find 1. A x B = {n, o, e} x {1, 2}
2. B x A = {1, 2} x {n, o, e}
3. A x A = {n, o, e} x {n, o, e}
4. B x B = {1, 2} x {1, 2}
 1. {(n, 1), (n, 2), (o, 1), (o, 2), (e, 1),
(e, 2)}
 2. {(1, n), (1, o), (1, e), (2, n), (2, o),
(3, e)}
 3. {(n, n), (n, o), (n, e), (o, n), o, o),
(o, e), (e, n), (e, o), (e, e)}
 4. {(1, 1), (1, 2), (2, 1), (2, 2)}
 Cartesian Product

So we can conclude that A x B ≠ B x A

Because in Cartesian Product, it is not Commutative.
 Cartesian Product in General
Definition: The Cartesian Product of the sets A1 x A2 x A3 x … x An is
the set of ordered n-tuples (a1, a2, a3, …, an) where ai belongs to Ai for i =
1, 2 ,3, …, n.
In other words, A1 x A2 x A3 x … An = {(a1, a2, a3, …, an)l ai ∈ A for i = 1,
2, 3, …, n}.

A x B x C = { ( a, b, c ) | a  A  b  B  c  C }.
 Cartesian Product
Example:
 Let A = {q, w, e}, B = { r, t} and
C = {1, y}
Find: A x B x C = {q, w, e} x { r, t} x {1, y}
: B x C x A = { r, t} x {1, y} x {q, w, e}
 A x B x C = {(q, r, 1), (q, r, y), (q, t, 1), (q,
t, y), (w, r, 1), (w, r, y), (w, t, 1), (w, t, y),
{(e, r, 1), (e, r, y), (e, t, 1), (e, t, y)}
 B x C x A = {(r, 1, q), (r, 1, w), (r, 1, e), (r,
y, q), (r, y, w), (r, y, e), (t, 1, q), (t, 1, w),
(t, 1, e), (t, y, q), (t, y, w)}
 Cardinality of Cartesian Coordinates
 The cardinality of a set is a measure of a set's size, meaning the number
of elements in the set.
Example: • A x B = {(a, 1), (a, 2), (a, 3), (b,
 A = {a, b} and B = {1, 2, 3} 1), (b, 2), (b, 3)}

 |A| = 2 • B X A = {(1, a), (1, b), (2, a), (2, b),

 |B| = 3 (3, a), (3, b)}
 |A x B| = |A| x |B| = 2 x 3 = 6
 |B x A| = |B| x |A| = 3 x 2 = 6
Cardinality of Cartesian Coordinates

 If |A| = a and |B| = b, then |A x B| = a x b

 |A x B| = |B x A|
 For denoting cardinality, we can use “|A|” or
n(A)
 Cardinality of Cartesian Coordinates
 If one or both set is/are empty:
Example:
 A = {1, 2, 3}
 B = {∅}
A x B = ∅
 |A x B| = 0
THANK YOU!
 Sources
 https://byjus.com/jee/cartesian-product-in-set-relations-functions/
 http://web.mnstate.edu/peil/MDEV102/U1/S7/Cartesian4.htm
 https://www.math-only-math.com/Cartesian-Product-of-Two-Sets.html
 https://www.math24.net/cartesian-product-sets
 https://youtu.be/qbyBlZhC8Ds
 https://www.youtube.com/watch?v=u1JIrr_2U_Ihttps://
www.youtube.com/watch?v=qwArgnmbLC4
 https://www.youtube.com/watch?v=T7uSfImqFNs