1 / 11

How can I send VALENTINES? --- Let me count the ways.

How can I send VALENTINES? --- Let me count the ways. SUBSETS. OF MY SET OF FRIENDS. { , , }. { }. { }. { , }. { , }. { }. { , }. S =. { , , }. the POWER SET of S. { }. { , , }. { , , }. { , , }.

mandel
Download Presentation

How can I send VALENTINES? --- Let me count the ways.

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. How can I send VALENTINES? --- Let me count the ways. SUBSETS OF MY SET OF FRIENDS

  2. { , , } { } { } { , } { , } { } { , } S = { , , } the POWER SET of S { }

  3. { , , } { , , } { , , } { , , } { , , } { , , } { , , } { , , } { , , } { , , } { , , } { , , } { , , } { , , } 2 x 2 x 2

  4. If a set S has n members, then S has 2n subsets. ie: the POWER SET of S has 2n members

  5. When S is a finite set, the power set of S contains more members Than S …….. A finite set has more subsets than members. Cantor proved the same for infinite sets … ie: for any set S, The power set of S has a greater cardinal number than S. We will examine the infinite set N = { 1, 2, 3, 4, 5, ……… } and the power set of N

  6. If there is a one to one correspondence between N and P(N) it would look like this:

  7. 2 is NOT a member of S2 3 is NOT a member of S3 5 is NOT a member of S5 7 is NOT a member of S7

  8. 2 is NOT a member of S2 3 is NOT a member of S3 5 is NOT a member of S5 7 is NOT a member of S7 Build a set containing all the numbers that do NOT belong to their paired set

  9. 2 is NOT a member of S2 3 is NOT a member of S3 5 is NOT a member of S5 7 is NOT a member of S7 Build a set containing all the numbers that do NOT belong to their paired set … call this set Sk and include it in the list of subsets … it must correspond to some natural number k.

  10. Is k a member of Sk ? If it is then it isn’t. If it isn’t then it is. = { m / m is NOT a member of Sm

More Related