View source for Set theory

{{MSC|03Exx}}
{{TEX|done}}


''naive''

Set theory is the study of the properties of sets (cf. [[Set|Set]]) by themselves, disregarding the properties of their elements. It is especially concerned with the study of sets with infinite elements. The idea of a set is one of the primitive mathematical ideas and can only be explained by means of examples or analogies. Intuitively, a set is just a collection of objects. One can speak of the set of people living on our planet at a given time, of the set of points of a given geometric figure and of the set of solutions of a given differential equation. A person living on the planet at the given time, a point of the given geometric figure, a solution of the given differential equation are elements of their respective sets. 

A set $A$ is regarded as given if a characteristic property of the elements of the set is given, that is, a property which all the elements of the set, and only they, possess. 

One of the fundamental ideas of set theory is that of membership of an element of a set. To denote that an object $a$ belongs to a set $A$ one writes $a \in A$ (if $a$ does not belong to $A$ one writes $a \not\in A$ or $a \overline{\in} A$). (It can happen that no object has the characteristic property defining $A$; it is then said that $A$ is empty and one writes $A = \empty$. For example, the set of real solutions of the equation $x^2 = -1$ is empty.) If each element of a set $A$ is at the same time an element of a set $B$, then $A$ is called a subset of $B$ and one writes $A \subset B$. If $A \subset B$ and $B \subset A$ simultaneously, then $A$ and $B$ are said to be equal and one writes $A = B$. The union $A \cup B$ of two sets $A$ and $B$ is the set comprising all the elements which belong to at least one of the sets $A$ or $B$. The intersection $A \cap B$ of $A$ and $B$ is the set comprising all the elements which belong to both $A$ and $B$. The operations of union and intersection are commutative, associative and mutually distributive. For example, $(A \cup B)\cap C=(A \cap C)\cup(B \cap C)$. Often one considers only sets which are contained in some fixed set $X$. If $A$ is a subset of $X$ and $P$ is a property characterizing the elements of $A$, then one writes $A=\{x \in X : P(x) \textrm{ is true }\}$. For example, if $X$ is the set of all real numbers and $A$ is the subset of positive numbers, then $A=\{x \in X: x > 0\}$. If $A\subset X$, then the set $X\setminus A=\{x \in X: x\not\in A\}$ is called the complement of the set $A$ (in $X$). The operations of union, intersection and taking the complement are connected by the so-called de Morgan laws. For example, $X\setminus(A\cap B)=(X\setminus A)\cup(X\setminus B)$. The branch of set theory concerned with the study of operations on sets (not only finite, but also infinite operations) is called the algebra of sets. The algebra of sets, in its turn, is a special case of the theory of Boolean algebras (cf. [[Boolean algebra|Boolean algebra]]).

Set theory was created by the work of 19th century mathematicians, who posed the aim of a complete revision of the foundations of mathematical analysis. Already in the first papers in this area (B. Bolzano, P. du Bois-Reymond, R. Dedekind), which considered sets of numbers or functions, the question of a quantitative comparison of infinite sets was posed. Is infinity of a set purely a negative property, not admitting elaboration, or do there exist different levels of mathematical infinity; are there infinite sets of different quantitative strength, of different  "power" ? The answer to this question was given by G. Cantor (1871–1883), who presented an almost modern exposition of the theory of cardinal and ordinal numbers (cf. [[Cardinal number|Cardinal number]]; [[Ordinal number|Ordinal number]]) and the theory of well-ordered sets (cf. [[Well-ordered set|Well-ordered set]]). The possibility of a comparative quantitative estimation of sets was based on the idea of a one-to-one correspondence (or [[Bijection|bijection]]) between two sets. Associate to each element of a set $A$, by any rule whatever, a definite element of a set $B$. If each element of $B$ turns out to be in correspondence to one and only one element of $A$, then it is said that a one-to-one correspondence (or bijective mapping or bijection) has been established between $A$ and $B$. There is a bijection between two finite sets if and only if both sets have the same number of elements. Generalizing this fact, Cantor defined quantitative equivalence, or equipotence, as the possibility of establishing a one-to-one correspondence between them. If a set $A$ is equipotent to a set $B$, then $A$ and $B$ have the same cardinal number. The value of the notion of the power of a set is determined by the existence of non-equipotent infinite sets. For example, the set of all real numbers and the set of all natural numbers have different powers. The first has the power of the continuum, and the second is a countable set. In each infinite set $A$ there is a proper subset of $A$ equipotent to the whole of $A$, whereas in a finite set such a proper part cannot be found. Therefore the presence of a proper part equipotent to the whole can be taken as the definition of an infinite set.

The merit of Cantor is not just in the solution of the problem of the power of a set, but in the decisive step he made of considering sets with elements of an arbitrary nature. To testify that this step to generality was difficult, there are firstly the various inconsistencies (cf. [[Antinomy|Antinomy]]), discoveries by various scholars at the beginning of the 20th century and leading to the creation of [[Axiomatic set theory|axiomatic set theory]], and secondly, the emergence of various problems (for example, the [[Continuum hypothesis|continuum hypothesis]]) which turned out to be undecidable.

A subsequent contribution to set theory was made by F. Hausdorff, who, after developing the theory of totally ordered sets and applying set theory to topology, completed the foundations of the theory of topological spaces (cf. [[Topological space|Topological space]]) (or, general topology). Later, the $\mathcal{A}$-operation, arising in the study of Borel sets, led to the creation of [[Descriptive set theory|descriptive set theory]]. From a number of problems in combinatorial mathematics and graph theory, combinatorial set theory arose. Finally, the discoveries of K. Gödel and P. Cohen in axiomatic set theory significantly influenced the methods and development of set theory.

====References====
{|
|-
|valign="top"|{{Ref|Al}}||valign="top"|  P.S. Aleksandrov,   "Einführung in die Mengenlehre und die Theorie der reellen Funktionen", Deutsch. Verlag Wissenschaft.  (1956)  (Translated from Russian)  {{MR|0168706}}  
|-
|valign="top"|{{Ref|Bo}}||valign="top"|  B. Bolzano,   "Paradoxes of the infinite", Routledge &amp; Kegan Paul  (1950)  (Translated from German)  {{MR|0039670}}  {{ZBL|0039.00506}} 
|-
|valign="top"|{{Ref|Bo2}}||valign="top"|  N. Bourbaki,   "Elements of mathematics. Theory of sets", Addison-Wesley  (1968)  (Translated from French)  {{MR|0237342}}  {{ZBL|0175.27001}} 
|-
|valign="top"|{{Ref|Ha}}||valign="top"|  F. Hausdorff,   "Grundzüge der Mengenlehre", Leipzig  (1914)  (Reprinted (incomplete) English translation: Set theory, Chelsea (1978))  {{MR|1034865}} {{MR|0979016}} {{MR|0031025}}  {{ZBL|1175.01034}} JFM {{ZBL|45.0123.01}} 
|-
|valign="top"|{{Ref|Ku}}||valign="top"|  K. Kuratowski,   "Topology", '''1''', Acad. Press  (1966)  (Translated from French)  {{MR|0234404}} {{MR|0217751}} {{MR|0217750}}  {{ZBL|0163.17002}} {{ZBL|0158.40901}} {{ZBL|0158.40802}} 
|-
|valign="top"|{{Ref|KuMo}}||valign="top"|  K. Kuratowski,   A. Mostowski,   "Set theory", North-Holland  (1968)  {{MR|0229526}}  {{ZBL|0165.01701}} 
|-
|valign="top"|{{Ref|Le}}||valign="top"|  A. Levy,   "Foundations of set theory", North-Holland  (1973)  {{MR|0345816}}  {{ZBL|0248.02071}} 
|-
|}



 
====Comments====
Cf. also [[Set|Set]].