Introduction to Cartesian Products
In our daily life, we come across many patterns that characterise relations such as brother and sister, father and son, teacher and student. In mathematics also, we come across many relations such as number m is less than number n, line l is parallel to line m, set A is a subset of set B. In all these, we notice that a relation involves pairs of objects in certain order. In mathematics, a relation pairs objects from different sets in a specific order. To understand relations, we must first learn how to form all possible ordered pairs between two sets. This is known as the Cartesian Product.
An ordered pair is a pair of elements written in small brackets in a specific order, like , where is from a set P and is from a set Q.
Definition of Cartesian Product
Given two non-empty sets A and B, the Cartesian product is the set of all possible ordered pairs where and .
- If either A or B is the null set (), then is also the null set.
Important Properties
Equality of Ordered Pairs: Two ordered pairs are equal if and only if their corresponding first and second elements are equal. That is, if and only if and .
Number of Elements: If set A has p elements and set B has q elements, then their Cartesian product will have pq elements.
Infinite Sets: If either set A or B is an infinite set (and neither is empty), then is also an infinite set.
Ordered Triplets: The concept can be extended to three sets. . The element is called an ordered triplet.
Non-Commutative: In general, because the order of elements in the pairs matters.
Example 1: Equality of Ordered Pairs
Question: If , find the values of x and y.
Solution:
Since the ordered pairs are equal, their corresponding elements must be equal.
So, the values are and .
Example 2: Forming Cartesian Products
Question: If and , find and .
Solution:
By the definition of the Cartesian product:
Note that .
Example 3: Finding Sets from a Product
Question: If , find A and B.
Solution:
Set A is the set of all first elements in the ordered pairs.
Set B is the set of all second elements in the ordered pairs.