基数的比较（Comparison of cardinal numbers）.docVIP

基数的比较（Comparison of cardinal numbers） Comparison of sixth cardinal numbers The size of the 1 Radix In the last section, we discussed the cardinal concepts of countable sets and some non - countable sets. To prove that the cardinality of the two sets is equal, we must construct a pair of functions between two sets, which is often very difficult work. The following describes a simpler method of proving base equality, and first explains how the cardinality is the size of the comparison. From the definition of 4-6.1 set A to set B there is an incident, called A base is not more than B of the base, denoted as K[A] = K[B]. If there is an incident from A to B, but there is no double shot, then the cardinality of the A is less than B, and it is denoted as K[A]K[B]. 2 nature The following two theorems are limited to space but not to be proved, but they can be illustrated by a wide range of applications. Theorem 4-6.1 (Zermelo theorem) makes A and B be arbitrary sets, and one of the following three sets holds. A) K[A]K[B] B) K[B]K[A] O) K[A] = K[B] Theorem 4-6.2 (Cantor-Schroder-Bernstein theorem) let A and B be set, if K[A] = K[B], K[B] = K[A], then K[A] = K[B] The proof of theorem sets have the same cardinality and provides an effective method, if we can construct an incident f:A function to B, indicating that K[A] is less than or equal to K[B], in addition, such as the ability to construct the incident function g:B to A, that is K[B] = K [A], according to the theorem of K[A] = K[B]. Example 1 proves that [0 and 1] have the same cardinality as (0, 1). The incident function is proved: F: (0, 1) - [0, 1], f (x) = x G:[0, 1] (0, 1). G (x) = x/2+1/4 Example 2 let A = N, B = (0, 1), K[A] =, K[B] =, verify K[A * B] = The proof defines a function f from A * B to the positive real number. F:A * B, {x|x, R+} F (n, x) = n+x Because f is a function of incidence, and K[R+] =. So K[A * B]. In addition, mapping g: (0, 1) B A G (x) = 0, x Because G is the incident, it is less than K[A * B