Geneseo Math 239 01 Uncountable Sets Prove that the set of all functions from ℕ to ℕ is uncountable. proof outline: show that it is impossible to have a bijection between the set of functions and the naturals. as with many proofs of impossibility, do this by contradiction. Access study documents, get answers to your study questions, and connect with real tutors for math 239 at suny geneseo.
Geneseo Math 239 03 Uncountable Sets The closed interval [0,1] is another uncountable set. the interval contains infinitely many points, and similar to the entire set of real numbers, it cannot be listed in a sequence that covers all its elements. In mathematics, an uncountable set, informally, is an infinite set that contains too many elements to be countable. the uncountability of a set is closely related to its cardinal number: a set is uncountable if its cardinal number is larger than aleph null, the cardinality of the natural numbers. Cantor gave a new proof of this result by showing that every interval of real numbers had strictly larger cardinality than the natural numbers, that is, it was uncountable. This document outlines 4 math assignment questions: 1. sets and subsets: finding the number of subsets of a set, correspondence between subsets containing not containing an element, parity of subsets.
Geneseo Math 239 01 Uncountable Sets 1 Cantor gave a new proof of this result by showing that every interval of real numbers had strictly larger cardinality than the natural numbers, that is, it was uncountable. This document outlines 4 math assignment questions: 1. sets and subsets: finding the number of subsets of a set, correspondence between subsets containing not containing an element, parity of subsets. Let t be the set of semi infinite sequences formed by the digits 0 and 2. an element t ∈ t has the form t = t 1 t 2 t 3 … where t i ∈ {0, 2}. the first step of the proof is to prove that t is uncountable. so suppose it is countable. A k coloring of a graph g = (v; e) is a function from v to a set of size k (whose elements are called colors) so that adjacent vertices are mapped to di erent colors always. Let r′ denote the set of real numbers, between 0 and 1, having decimal expansions that only involve 3s and 7s. (this set r′ is an example of what is called a cantor set.). Definition 7.2.1. a set which is neither finite nor countably infinite is said to be uncountable. before proving any theorems about uncountable sets, we should exhibit an example of the phenomenon.
Geneseo Math 239 01 Uncountable Sets 1 Let t be the set of semi infinite sequences formed by the digits 0 and 2. an element t ∈ t has the form t = t 1 t 2 t 3 … where t i ∈ {0, 2}. the first step of the proof is to prove that t is uncountable. so suppose it is countable. A k coloring of a graph g = (v; e) is a function from v to a set of size k (whose elements are called colors) so that adjacent vertices are mapped to di erent colors always. Let r′ denote the set of real numbers, between 0 and 1, having decimal expansions that only involve 3s and 7s. (this set r′ is an example of what is called a cantor set.). Definition 7.2.1. a set which is neither finite nor countably infinite is said to be uncountable. before proving any theorems about uncountable sets, we should exhibit an example of the phenomenon.
Comments are closed.