21127 Study Guide - Quiz Guide: Countable Set, Uncountable Set, Bijection

58 views2 pages

Document Summary

In lecture on monday and wednesday, i discussed in nite sets and, speci cally, countably in nite sets. By de nition, n is countably in nite; we found a bijection to show z is countably in nite; the hilbert hotel example showed that a b is countably in nite whenever a and b are both countably in nite; the hilbert. The goal of today"s recitation is to explore countably in nite sets. How can we run over and land in an uncountably in nite set? (1) suppose a, b are nite. Can we guarantee anything about their sizes: a b. It is not necessarily true that |a b| = |a| |b|; this only happens when. Notice that if a b then |a b| = |a| and if b a then |a b| = |b|: a b. We proved in lecture that when a b = , we know that |a b| = |a|+|b|.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers

Related Documents

Related Questions