Scribd
Upload
29 views

Subset&Finite

The document summarizes two theorems about finite sets and their proofs: 1) If A is a subset of a finite set B, then A is finite. This is proved by induction on the size of B. 2) If B has n elements and A has m elements where n > m, then there does not exist a function h from A to B that is onto. This is proved by contradiction using previously established results about one-to-one and onto functions. 3) If B has n elements and A has m elements where n > m, then there does not exist a function h from B to A that is one-to-one. This follows from the pigeonhole principle

Uploaded by

Hilmi Nur Ardian
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
29 views

Subset&Finite

The document summarizes two theorems about finite sets and their proofs: 1) If A is a subset of a finite set B, then A is finite. This is proved by induction on the size of B. 2) If B has n elements and A has m elements where n > m, then there does not exist a function h from A to B that is onto. This is proved by contradiction using previously established results about one-to-one and onto functions. 3) If B has n elements and A has m elements where n > m, then there does not exist a function h from B to A that is one-to-one. This follows from the pigeonhole principle

Uploaded by

Hilmi Nur Ardian
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Math 5615,

Fall 99

A subset of a nite set is a nite set

Page 1 of 1

There is nothing in the axioms we have assumed that tells us everyday things such as how many elements a set has! All we have is the denition of nite set in terms of equipotence. So, we have to prove some of these things, just to see that they can be proved. Here are two theorems that are obviously true. The problem is to deduce the theorems from axioms and previously proved theorems. Theorem If A is a subset of a nite set B, then A is nite. Proof: We have to show that, if B Sn for some n N, and A B, then A Sm for some m call this statement P (n). For later use we need to recall that Sn = {k N : k < n}. Let us rst prove this when B = Sn for some n N, using induction. Thus, if n = 0 and A B = S0 = , then A = = S0 hence A is nite, so P (0) is true. Now we suppose our statement P (k) is true for all k < n, where n > 0, and seek to show that it is true for k = n as well. A very easy case occurs when A = Sn , for the set Sn is nite by denition. We dont actually use this case. Another easy case: suppose A Sn and suppose that n 1 A. Then A is a subset of Sn1 so A is nite by / the induction assumption. We will use this case. We have to consider the main case, when A Sn , and n 1 A. We set A := A \ {n 1}. Then n 1 A , so / A is a subset of Sn1 hence A is nite, by the induction assumption. That is, there exists m N and a function g : A Sm that is one-to-one and onto. Since Sm {m } = Sm +1 we can dene a function g : A Sm +1 by adding the ordered pair (n 1, m + 1) to the function g . That is, g := g {(n 1, m + 1)} (this is one of the few instances where it is useful to have dened function as a set of ordered pairs!) It is trivial to show that g maps A = A {n 1} onto Sm +1 in a one-to-one manner. (You should be able to show it in your head) To conclude we set m := m + 1, so P (n) is true when we restrict B to be one of the sets Sn . Having nished the proof when B is one of the Sn , it remains to deal with the case when B is some other nite set. Any function f : B Sn that is one-to-one and onto maps A onto f (A) in a one-to-one and onto manner. Then f (A) is nite since it is a subset of Sn . There is then some m N and a function g : f (A) Sm that is one-to-one and onto. It is trivial to show that the composite mapping g f is the desired equivalence between A and Sm . This completes the proof of the Theorem. We say that a set B has n elements if there exists n N and a function f : B Sn that is one-to-one and onto. In proving the next Theorem we will have occasion to use the result of Special problem 3. Theorem If B has n elements and A has m elements and n > m then there does not exist a function h : A B that is onto. Proof: Suppose, to be contrary, that there exists f : A B that is onto. We are given that there exist one-to-one and onto functions g : A Sm and h : B Sn . Let k denote the composite function hf g 1 , so k : Sm Sn , and because each of our functions h, f and g 1 is onto, so is k. In particular, there exists xo Sm such that k(xo ) = n 1. We recall that k = {(x, k(x)) : x Sm }. Now we construct a new function K : Sn Sn by setting K := k {(x, x) : x Sn \ Sm }. Since k was already onto, so is K. By the theorem proved in Special Problem 3, K is also one-to-one. But K(n 1) = n 1 and K(xo ) = k(xo ) = n 1. Since xo = n 1 and K is one-to-one we have the contradiction K(n 1) = K(xo ). This completes the proof. Here is another theorem I believe this is essentially the pigeonhole principle that you might try to prove now. Theorem If B has n elements and A has m elements and n > m then there does not exist a function h : B A that is one-to-one.

N.

Let us

You might also like