Шексіз кардинал сандары

Infinite cardinal number

In mathematics, particularly in set theory, the aleph numbers are a sequence of numbers used to represent the cardinality (or size) of infinite sets that can be well ordered. They were introduced by the mathematician Georg Cantor and are named after the symbol he used to denote them, the Hebrew letter aleph (ℵ). The cardinality of the natural numbers is ℵ0 (read aleph nought or aleph zero or aleph null), the next larger cardinality of a well ordered set is aleph one ℵ1, then ℵ2 and so on. Continuing in this manner, it is possible to define a cardinal number ℵα for every ordinal number α, as described below. The concept and notation are due to Georg Cantor,
who defined the notion of cardinality and realized that infinite sets can have different cardinalities. The aleph numbers differ from the infinity (∞) commonly found in algebra and calculus, in that the alephs measure the sizes of sets, while infinity is commonly defined either as an extreme limit of the real number line (applied to a function or sequence that "diverges to infinity" or "increases without bound"), or as an extreme point of the extended real number line.

ℵ1 is, by definition, the cardinality of the set of all countable ordinal numbers. This set is denoted by ω1 (or sometimes Ω). The set ω1 is itself an ordinal number larger than all countable ones, so it is an uncountable set. Therefore, ℵ1 is distinct from ℵ0. The definition of ℵ1 implies (in ZF, Zermelo–Fraenkel set theory without the axiom of choice) that no cardinal number is between ℵ0 and ℵ1. If the axiom of choice is used, it can be further proved that the class of cardinal numbers is totally ordered, and thus ℵ1 is the second smallest infinite cardinal number. One can show one of the most useful properties of the set ω1: Any countable subset of ω1 has an upper bound in ω1 (this follows from the fact that the union of a countable number of countable sets is itself countable). This fact is analogous to the situation in ℵ0: Every finite set of natural numbers has a maximum which is also a natural number, and finite unions of finite sets are finite. The ordinal ω1 is actually a useful concept, if somewhat exotic sounding. An example application is "closing" with respect to countable operations; e. g., trying to explicitly describe the σ algebra generated by an arbitrary collection of subsets (see e. g. Borel hierarchy). This is harder than most explicit descriptions of "generation" in algebra (vector spaces, groups, etc.) because in those cases we only have to close with respect to finite operations – sums, products, etc. The process involves defining, for each countable ordinal, via transfinite induction, a set by "throwing in" all possible countable unions and complements, and taking the union of all that over all of ω1.

The cardinality of the set of real numbers (cardinality of the continuum) is 2ℵ0. It cannot be determined from ZFC (Zermelo–Fraenkel set theory augmented with the axiom of choice) where this number fits exactly in the aleph number hierarchy, but it follows from ZFC that the continuum hypothesis (CH) is equivalent to the identity
2ℵ0 = ℵ1. The CH states that there is no set whose cardinality is strictly between that of the integers and the real numbers. CH is independent of ZFC: It can be neither proven nor disproven within the context of that axiom system (provided that ZFC is consistent). That CH is consistent with ZFC was demonstrated by Kurt Gödel in 1940, when he showed that its negation is not a theorem of ZFC. That it is independent of ZFC was demonstrated by Paul Cohen in 1963, when he showed conversely that the CH itself is not a theorem of ZFC – by the (then novel) method of forcing.

The cardinality of any infinite ordinal number is an aleph number. Every aleph is the cardinality of some ordinal. The least of these is its initial ordinal. Any set whose cardinality is an aleph is equinumerous with an ordinal and is thus well orderable. Each finite set is well orderable, but does not have an aleph as its cardinality. Over ZF, the assumption that the cardinality of each infinite set is an aleph number is equivalent to the existence of a well ordering of every set, which in turn is equivalent to the axiom of choice. ZFC set theory, which includes the axiom of choice, implies that every infinite set has an aleph number as its cardinality (i. e. is equinumerous with its initial ordinal), and thus the initial ordinals of the aleph numbers serve as a class of representatives for all possible infinite cardinal numbers. When cardinality is studied in ZF without the axiom of choice, it is no longer possible to prove that each infinite set has some aleph number as its cardinality; the sets whose cardinality is an aleph number are exactly the infinite sets that can be well ordered. The method of Scott's trick is sometimes used as an alternative way to construct representatives for cardinal numbers in the setting of ZF. For example, one can define card(S) to be the set of sets with the same cardinality as S of minimum possible rank. This has the property that card(S) = card(T) if and only if S and T have the same cardinality. (The set card(S) does not have the same cardinality of S in general, but all its elements do.)