Table of Contents
Understanding the concepts of power sets and Cartesian products is fundamental in set theory and mathematics. Both concepts involve combining elements of sets in different ways, and their cardinalities tell us how many elements are in these combined sets.
What is the Cardinality of a Power Set?
The power set of a set A, denoted as 𝒫(A), is the set of all possible subsets of A. If set A has n elements, then its power set has 2^n elements. This is because each element can either be included or excluded from a subset, creating all possible combinations.
Example
For example, if A = {1, 2}, then the power set is 𝒫(A) = {∅, {1}, {2}, {1, 2}}}. The set has 2 elements, so its power set has 2^2 = 4 elements.
How to Find the Cardinality of a Cartesian Product?
The Cartesian product of two sets A and B, denoted as A × B, is the set of all ordered pairs where the first element is from A and the second is from B. If A has m elements and B has n elements, then the cardinality of A × B is m × n.
Example
Suppose A = {1, 2} and B = {x, y, z}. Then, A × B consists of:
- (1, x), (1, y), (1, z)
- (2, x), (2, y), (2, z)
The total number of ordered pairs is 2 × 3 = 6.
Summary of Formulas
- Cardinality of power set of set A with n elements: 2^n
- Cardinality of Cartesian product of sets A with m elements and B with n elements: m × n
Knowing how to calculate these cardinalities helps in understanding the size and structure of sets in various mathematical contexts, from basic set theory to advanced topics like combinatorics and probability.