Infinite Sets

by George E. Hrabovsky, President, MAST

Where We Have Been

We have been continuing our focus on the foundations of mathematics. We have discussed the basic ideas of set theory and logic, proof techniques, quantifiers, and have begun to develop the number system. We have laid the groundwork for discussing the real numbers by exploring sequences. Last column we discussed functions and relations.

Where Will We Go in This Column

In this column we will discuss the concept and some ramifications of infinite sets.

Cardinals of Power Sets

Recall from the column. "Setting up for the Future," that the set of all subsets is called the power set. Recall too that the power set of any set of n elements will have 2^n elements. It seems as though the cardinal number of a set is less than the cardinal number of the power set. Thus for the set A we have,

÷r(A) < ÷r(÷(A)) .

Assume we are dealing with the empty set ∅, then ÷r(∅) = 0 and ÷r(÷(∅)) = 1. Clearly, in this case, ÷r(∅) < ÷r(÷(∅)). If A is finite with n elements, we have,

÷r(A) = n < ÷r(÷(A)) = 2^n .

On the other hand, if A is infinite we need to look at this carefully. We can be sure that,

÷r(A) !> ÷r(÷(A))

because the cardinal number of A is equal to the cardinal number of the set of singleton subsets of A.
    Suppose that

÷r(A) = ÷r(÷(A)) .

Then there has to be some function,

A Overscript[-->, f] ÷(A)

such that, given two elements x, y of A,

f(x) = f(y) ==> x = y .

An additional requirement is that

f^(-1) = ÷(A) .

If this is the case, f(x) and f(y) are distinct subsets of A. Then, given the subset B of A, there is a unique element y of A such that f(y) = B. We can define B as,

B = {x | x ∉ f(x)} .

Now, since y is an element of A and f(y) = B, then we have to ask where y is? It must either be in B or in A\B. This is an absurd situation, this implies that

y ∈ B ==> y ∉ B = f(y),

an absurd result, and

y ∈ A \ B ==> y ∉ f(y) = B ==> y ∈ B,

another absurd result. The only possible conclusion is that there is no element y of A such that f(y) = B, thus

÷r(A) != ÷r(÷(A)) .

The only remaining possibility is that

÷r(A) < ÷r(÷(A)) .

This is valid for any non-empty set.

Aleph-Null

The last section makes an implication that given an infinite set A we can form an infinite sequence of sets,

{A, ÷(A), ÷(÷(A)), ...} .

This sequence is increasing and composed of infinite cardinal numbers. This being the case it seems reasonable to think that there might be a smallest infinite cardinal. It turns out that there is such a cardinal, we call it ℵ _ 0 aleph-null.
    Given an infinite set A we choose an element x _ 1 ∈ A. We choose a subset A _ 1 = A \ {x _ 1}. We next choose x _ 2 ∈ A _ 1 and A _ 2 = A _ 1 \ {x _ 2} = A \ {x _ 1, x _ 2}. We can continue this process endlessly since A is infinite till we get {x _ 1, x _ 2, x _ 3, ..., x _ n}. We next get x _ (n + 1)from A _ n = A \ {x _ 1, x _ 2, x _ 3, ..., x _ n}. If we define A _ 0 = {x _ 1, x _ 2, x _ 3, ...}. This inductively leads us to the conclusion that

A _ 0 = ÷± .

We can also see that A _ 0 ⊂ A. If we think about it long enough, it will become apparent that a set is infinite only if it is equivalent to a proper subset of itself.
    It is interesting to think that the cardinal number of the set of natural numbers is the same as that of the set of integers. This implies that

ℵ _ 0 + ℵ _ 0 = ℵ _ 0 .

Suggested Practice Problems

1. Prove that a set is infinite only if it is equivalent to a proper subset of itself.
2. Show that ℵ _ 0 + ℵ _ 0 = ℵ _ 0 .


Converted by Mathematica  (January 30, 2003)