Describing Cardinality
- Cardinality is the number of elements within a set
- Cardinality is also referred to as the length of a set
- We can represent a set of all ordered pairs of elements as the cartesian product of two sets
- In other words, a cartesian product of two sets is the set of all ordered pairs of the elements within the two sets
- For example, if A and B are sets, then A×B is denoted as the cartesian product of A and B
- Specifically, the cartesian product of A and B consists of the set of all ordered pairs of elements (a,b) where a∈A and b∈B
Some Examples of Cardinality
- Let's say we have the set {}, then the cardinality of the set is the following:
∣{}∣=0
- Let's say we have the set {{1},{1,2,3,4}}, then the cardinality of the set is the following:
∣{{1},{1,2,3,4}}∣=2
- Let's say we have the set {{},{2,{1,{}}}}, then the cardinality of the set is the following:
∣{{},{2,{1,{}}}}∣=2
An Example of Cartesian Products
- A very familiar example of a cartesian product is the xy-plane
- In this case, we have ordered pairs of coordinates, where each coordinate is a real number
- We can describe this as the cartesian product R×R
- Since we essentialy multiply R by itself, we typically write this as R2 for short
- Similarly, R3 or Rn represent ordered triples or ordered n-tuples of real numbers, corresponding to a 3-dimensional and n-dimensional space, respectively
- Specifically, R2 is the set {(1.222,4),(3,5),(7.9,109),...}
- More specifically, R2 doesn't contain elements (1) or (2,5,6) in its set
Another Example of Cartesian Products
- Let's say we have the set {0,1}∞ contains every unique element that is an infinitely long ordered pair of coordinates
- Specifically, {0,1}∞ is the set {(0,1,1,0,0,...),(1,1,1,1,...),...}
- Therefore, this would be considered an infinite set
Describing Countable Sets
- A set is countable if its cardinality is no greater than the cardinality of the natural numbers
- Specifically, a set is countable if there is a bijection between the given set and the set of all natural numbers
Examples of Countable Sets
N
- This is the set of all natural numbers
- Specifically, N is the set {1,2,3,4,5,6,...}
W
- This is the set of all whole numbers
- Specifically, W is the set {0,1,2,3,4,5,6,...}
Z
- This is the set of all integers
- Specifically, Z is the set {...,−2,−1,0,1,2,...}
Q
- This is the set of all rational numbers
- Specifically, Q is the set {...,−31,.12,87,216.836ˉ,...}
Examples of Uncountable Sets
C
- This is the set of all complex numbers
- Specifically, C is the set {...,3i+5,4i−8,...}
R−Q
- This is the set of all irrational numbers
- Specifically, R−Q is any number that cannot be expressed using a fraction
R
- This is the set of all real numbers
- Specifically, this is an uncountable set because it contains the set of all irrational numbers
{The set of all real numbers between 0 and 1}
Finite Sets
- Roughly speaking, a finite set is a set in which one could in principle count and finish counting
- The following are some examples of finite sets:
{1,2,3,4,...,1000}
{−100,−99,−98,...,1000000000000}
{A set with a cardinality of 2478}
{A set with a cardinality of 1000000000000000000000000000}
- The following are some examples of infinite sets:
{The set of all even numbers}
{The set of all odd numbers}
More on Countability
- A finite set is a subset of a countable set
- In other words, all finite sets are countable, but not all countable sets are finite
- There are countably finite and countable infinite sets, but there are no such thing as uncountable finite sets
- A countable infinite set is the smallest infinite set
Power Sets
- The Cartesian product consists of ordered pairs of elements where the length of each pair is determined by the power raised (or the dimension)
- The ordered pairs in this case are technically considered sets
- The power set consists of subsets of some set S
- Again, we can denote cartesian products as S×S or S2 if S is some set
- Let's say we have the following set:
S={1,2,3}
- Then, we can define a catesian product and powerset of this set as the following:
S×S={(1,1),(1,2),(1,3),(2,1),(2,2),(2,3),(3,1),(3,2),(3,3)}
PowerSet(S)={{∅},{1},{2},{3},{1,2},{1,3},{2,3},{1,2,3}}
References