Showing posts with label Cartesian Products of Sets. Show all posts
Showing posts with label Cartesian Products of Sets. Show all posts

Friday

Cartesian Products of Sets


Let me explain about Cartesian Products of Sets,
Suppose A is a set of 2 colours and B is a set of 3 objects, i.e.,
A = {red, blue}and B = {b, c, s},
where b, c and s represent a particular bag, coat and shirt, respectively.
How many pairs of coloured objects can be made from these two sets?
Proceeding in a very orderly manner, we can see that there will be 6
distinct pairs as given below:
(red, b), (red, c), (red, s), (blue, b), (blue, c), (blue, s).
Thus, we get 6 distinct objects (Fig).
Let us recall from our earlier classes that an ordered pair of elements
taken from any two sets P and Q is a pair of elements written in small
brackets and grouped together in a particular order, i.e., (p,q), p ∈ P and q ∈ Q . This
leads to the following definition:
Given two non-empty sets P and Q. The cartesian product P × Q is the
set of all ordered pairs of elements from P and Q, i.e.,
P × Q = { (p,q) : p ∈ P, q ∈ Q }
If either P or Q is the null set, then P × Q will also be empty set, i.e., P × Q = φ
From the illustration given above we note that
A × B = {(red,b), (red,c), (red,s), (blue,b), (blue,c), (blue,s)}.
Again, consider the two sets:
A = {DL, MP, KA}, where DL, MP, KA represent Delhi,
Madhya Pradesh and Karnataka, respectively and B = {01,02,
03}representing codes for the licence plates of vehicles issued
by DL, MP and KA .
Hope the above explanation helped you, now let me explain on Basic property of Cartesian Products.