Cardinality

Now we can define cardinality:

Cardinality

Let A be a set. If A is finite then card(A)=|A| is just the number of elements in A. Then:

  • card(N)=0 (here is called aleph, so this is aleph-null)
  • We know that since R is uncountable then card(R)=c where c is the continuum.
  • card(P(N))>card(N).
  • The set A has the same cardinality as B if f:AB exists that is one-to-one and onto.
    For same cardinality sets we write AB.

An example is as follows. The function f(x)=xx21 takes the interval (1,1)R in a one-to-one correspondence, so (1,1)R:

Proof
(injective) Instead suppose f(x1)=f(x2). We'll show x1=x2. Then:

x1x121=x2x221x1(x221)=x2(x121)x1x22+x2x2x12x1=0Solve for x2(x1)x22+(1x12)x2+(x1)1=0x121±(1x12)2+4x122x1=x2x1=0x2=0=x1x121±12x12+x14+4x122x1=x2x121±x14+2x12+12x1=x2x121±(x12+1)22x1=x2x121±|x12+1|2x1=x2

Two cases since |x12+1|0:

  1. (+):
x2=x121+x12+12x1=x1
  1. ():
x2=x121x1212x1=1x1

So just choose the (+) case! We are done.

(surjective): For scratch we are essentially trying to find f1. So try to swap the x's with y's and solve for y:

f(y)=xyy21=xy=x(y21)y=xy2x0=xy2yxy=1±1+4x22x

Pasted image 20241006004540.png

Which ± do we use? We want all x>0 to have y<0 and all x<0 to be y>0. The only choice we could do that is with .

Thus let yR. Choose x(1,1) where:

x={0y=011+4y22yy0

We claim that this is a good choice. Notice:

f(x)=f(11+4y22y)=11+4y22y(11+4y22y)21=11+4y22y1121+4y2+1+4y24y21=11+4y22y1121+4y2+1+4y24y24y2=11+4y22y4y22(11+4y2)=y

Notice too that the non-trivial part of our cases for y0 never has the numerator equal 0, so then we are covered here.