From: owner-ammf-digest@smoe.org (alt.music.moxy-fruvous digest) To: ammf-digest@smoe.org Subject: alt.music.moxy-fruvous digest V14 #3751 Reply-To: ammf@fruvous.com Sender: owner-ammf-digest@smoe.org Errors-To: owner-ammf-digest@smoe.org Precedence: bulk alt.music.moxy-fruvous digest Sunday, March 15 2020 Volume 14 : Number 3751 Today's Subjects: ----------------- Get it now and itāll be with you with free shipment. ["iHeater" Subject: Get it now and itāll be with you with free shipment. Get it now and itbll be with you with free shipment. http://highshoval.biz/2Q3RqFvA6WimAcCcJydps7OBZEX2yEaS9QpTI4GRn5jF8e7V http://highshoval.biz/0wsrO5Aw5eZzIXfYO56ln8gZUEU0TFqC9YmP2XFUg1Ji-et2 The best known example of an uncountable set is the set R of all real numbers; Cantor's diagonal argument shows that this set is uncountable. The diagonalization proof technique can also be used to show that several other sets are uncountable, such as the set of all infinite sequences of natural numbers and the set of all subsets of the set of natural numbers. The cardinality of R is often called the cardinality of the continuum and denoted by {\displaystyle {\mathfrak {c}}}{\displaystyle {\mathfrak {c}}}, or {\displaystyle 2^{\aleph _{0}}}2^{\aleph _{0}}, or {\displaystyle \beth _{1}}\beth _{1} (beth-one). The Cantor set is an uncountable subset of R. The Cantor set is a fractal and has Hausdorff dimension greater than zero but less than one (R has dimension one). This is an example of the following fact: any subset of R of Hausdorff dimension strictly greater than zero must be uncountable. Another example of an uncountable set is the set of all functions from R to R. This set is even "more uncountable" than R in the sense that the cardinality of this set is {\displaystyle \beth _{2}}\beth _{2} (beth-two), which is larger than {\displaystyle \beth _{1}}\beth _{1}. A more abstract example of an uncountable set is the set of all countable ordinal numbers, denoted by ? or ?1. The cardinality of ? is denoted {\displaystyle \aleph _{1}}\aleph _{1} (aleph-one). It can be shown, using the axiom of choice, that {\displaystyle \aleph _{1}}\aleph _{1} is the smallest uncountable cardinal number. Thus either {\displaystyle \beth _{1}}\beth _{1}, the cardinality of the reals, is equal to {\displaystyle \aleph _{1}}\aleph _{1} or it is strictly larger. Georg Cantor was the first to propose the question of whether {\displaystyle \beth _{1}}\beth _{1} is equal to {\displaystyle \aleph _{1}}\aleph _{1}. In 1900, David Hilbert posed this question as the first of his 23 problems. The statement that {\displaystyle \aleph _{1}=\beth _{1}}\aleph _{1}=\beth _{1} is now called the continuum hypothesis and is known to be independent of the ZermelobFraenkel axioms for set theory (including the axiom of choice). ------------------------------ End of alt.music.moxy-fruvous digest V14 #3751 **********************************************