21-127: Concepts of Mathematics

Aung, Maung Z. Lecture 02/29/12

DISCLAIMER: these notes are guaranteed to have an accuracy level of somewhere between 0 and 100 percent. The monetary value of these notes is 2 cents, but they are also exchangable for cookies and friendship.

Prove that (0,1) is uncountable. Well do it by contridiction. Suppose that there exists a bijection f : N (0, 1) Discussion: 0.23787700000.... followed by an innite tail of zero, normally 0.20000000000.... equals 0.1999999999.... yes, really! Thus, we ban innite tails of 9s so that there are no two ways to write the same number in (0,1). f (1) = 0.a11 a12 a13 ... f (2) = 0.a21 a22 a23 ... ...and so on. We will show that f is not surjective. Dene the sequence {bi } where i goes from 1 to innity by f (x) = 2 if aii = 1 1 if aii = 1

Then b = 0.b1 b2 b3 ... and so forth. ASIDE: THIS IS CANTORS DIAGONALIZATION. Since b does not match any number in the array of f (x), the particular number b is not contained in the array although b is indeed in the interval (0,1). b = 0 = 0.000... b = 1 = 0.999... Thus b (0, 1) but b = f (n) for all n N Therefore f is not surjective and so there is no bijection from N to (0,1).

Theorem The cardinalities of (0,1) and R are the same. Proof Dene f : (0, 1) R2 in the following way: 1 x 2 x f (x) = x 1 2 1x if 0 < x if 1 2

1 <x<1 2

Note that: x 1 if 0 < x < , f (x) = 2 x if

1 2

<0

x 1 1 2 < x < 1, f (x) = >0 2 1x

CASE ONE y = f (x) < 0 x 1 2 y= yx = x 1 2 x 1 x(y 1) = 2 1 x= 2(1 y) 1 ,y < 0 f 1 (y) = 2(1 y) Lets prove that 0 < f 1 (y) < 1 Since y < 0, > 0. 2(1 y)
1 2

y < 0 y > 0 1 y > 1 Thus 0 < 1 < 2(1 y)

1 2

1 < 1y

1 1

1 < 2(1 y)

1 2

CASE TWO y = f (x) > 0 x+ 1 2 y= 1x y yx = x y+1 2 y+1 y+1 2 ,y > 0 y+1

1 2 1 2

x(1 + y) = y + x=

f 1 (y) =

Lets prove that if y > 0 then 1/2 < f 1 (y) < 1 y+

1 2

<y+1

y+1 2 <1 y+1

The amount of ys is too damn high. Simplify like below using algebra. 1 y+2 1 =1 y+1 2(y + 1)

Then we do all this trivial work: 1 1 <1 < y >0y+1>1 1 y+1 2(y + 1) 1 1 >1 2(y + 1)
1 2

1 2

1 > 1 2 2(y + 1)

1 2

y+1 1 2 =1 y+1 2(y + 1) Thus

1 2

<

y+1 2 <1 y+1

Now, we simply put all this work together: 1 2(1 y) 1 1 y+2 f (x) = y+1 1
2

if y < 0 if y > 0 if y = 0

Combinatorics
n factorial... n N then n! = n(n 1)(n 2)... 2 1 Convention: 0! = 1 Denition: a partition of a set A is a collection of pairwise disjoint subsets of A whose union is A. So this means that the set A is split cleanly into dierent subsets that all form A when put back together. Example: {1,2,3,4,5} may be split into {1}, {2,3}, {4,5} and such.

END OF LECTURE