216th  Top academic disciplines 
Set theory is the branch of mathematics that studies sets, which are collections of objects. Although any type of object can be collected into a set, set theory is applied most often to objects that are relevant to mathematics.
The modern study of set theory was initiated by Georg Cantor and Richard Dedekind in the 1870s. After the discovery of paradoxes in naive set theory, numerous axiom systems were proposed in the early twentieth century, of which the Zermelo–Fraenkel axioms, with the axiom of choice, are the bestknown.
The language of set theory is used in the definitions of nearly all mathematical objects, such as functions, and concepts of set theory are integrated throughout the mathematics curriculum. Elementary facts about sets and set membership can be introduced in primary school, along with Venn and Euler diagrams, to study collections of commonplace physical objects. Elementary operations such as set union and intersection can be studied in this context. More advanced concepts such as cardinality are a standard part of the undergraduate mathematics curriculum.
Set theory is commonly employed as a foundational system for mathematics, particularly in the form of Zermelo–Fraenkel set theory with the axiom of choice. Beyond its foundational role, set theory is a branch of mathematics in its own right, with an active research community. Contemporary research into set theory includes a diverse collection of topics, ranging from the structure of the real number line to the study of the consistency of large cardinals.
Contents 
Mathematical topics typically emerge and evolve through interactions among many researchers. Set theory, however, was founded by a single paper in 1874 by Georg Cantor: "On a Characteristic Property of All Real Algebraic Numbers".^{[1]}^{[2]}
Beginning with the work of Zeno around 450 BC, mathematicians had been struggling with the concept of infinity. Especially notable is the work of Bernard Bolzano in the first half of the 19th century. The modern understanding of infinity began 186771, with Cantor's work on number theory. An 1872 meeting between Cantor and Richard Dedekind influenced Cantor's thinking and culminated in Cantor's 1874 paper.
Cantor's work initially polarized the mathematicians of his day. While Karl Weierstrass and Dedekind supported Cantor, Leopold Kronecker, now seen as a founder of mathematical constructivism, did not. Cantorian set theory eventually became widespread, due to the utility of Cantorian concepts, such as onetoone correspondence among sets, his proof that there are more real numbers than integers, and the "infinity of infinities" ("Cantor's paradise") the power set operation gives rise to.
The next wave of excitement in set theory came around 1900, when it was discovered that Cantorian set theory gave rise to several contradictions, called antinomies or paradoxes. Bertrand Russell and Ernst Zermelo independently found the simplest and best known paradox, now called Russell's paradox and involving "the set of all sets that are not members of themselves." This leads to a contradiction, since it must be a member of itself and not a member of itself. In 1899 Cantor had himself posed the question: "what is the cardinal number of the set of all sets?" and obtained a related paradox.
The momentum of set theory was such that debate on the paradoxes did not lead to its abandonment. The work of Zermelo in 1908 and Abraham Fraenkel in 1922 resulted in the canonical axiomatic set theory ZFC, which is thought to be free of paradoxes. The work of analysts such as Henri Lebesgue demonstrated the great mathematical utility of set theory. Axiomatic set theory has become woven into the very fabric of mathematics as we know it today.
Set theory begins with a fundamental binary relation between an object o and a set A. If o is a member (or element) of A, we write o ∈ A. Since sets are objects, the membership relation can relate sets as well.
A derived binary relation between two sets is the subset relation, also called set inclusion. If all the members of set A are also members of set B, then A is a subset of B, denoted A ⊆ B. For example, {1,2} is a subset of {1,2,3} , but {1,4} is not. From this definition, it is clear that a set is a subset of itself; in cases where one wishes to avoid this, the term proper subset is defined to exclude this possibility.
Just as arithmetic features binary operations on numbers, set theory features binary operations on sets. The:
A set is pure if all of its members are sets, all members of its members are sets, and so on. For example, the set containing only the empty set is a nonempty pure set. When doing set theory, it is common to restrict attention to the pure sets, and many systems of axiomatic set theory are designed to axiomatize the pure sets only.
A key idea in set theory is the von Neumann universe of pure sets. Sets in this universe are arranged in a cumulative hierarchy, based on how deeply their members, members of members, etc. are nested. Each set is assigned an ordinal number α in this hierarchy, known as its rank. A set is assigned a rank by transfinite recursion: if the least upper bound on the ranks of the members of a set X is α then X is assigned rank α+1. Also, for each ordinal α, the set V_{α} contains all sets assigned a rank less than α.
Elementary set theory can be studied informally and intuitively, and so can be taught in primary schools using, say, Venn diagrams. The intuitive approach silently assumes that all objects in the universe of discourse satisfying any defining condition form a set. This assumption gives rise to antinomies, the simplest and best known of which being Russell's paradox. Axiomatic set theory was originally devised to rid set theory of such antinomies^{[3]}.
The most widely studied systems of axiomatic set theory imply that all sets form a cumulative hierarchy. Such systems come in two flavors, those whose ontology consists of:
For the above systems, allowing urelements (objects that can be members of sets while having no members themselves) does not give rise to any interesting mathematics.
The systems NFU (allowing urelements) and NF (lacking them), though having their origin in type theory, are not based on a cumulative hierarchy. NF and NFU include a "set of everything," relative to which every set has a complement. Here urelements matter, because NF, but not NFU, produces sets for which the axiom of choice does not hold.
Systems of constructive set theory, such as CST, CZF, and IZF, embed their set axioms in intuitionistic logic instead of first order logic. Yet other systems accept standard first order logic but feature a nonstandard membership relation. These include rough set theory and fuzzy set theory, in which the value of an atomic formula embodying the membership relation is not simply True and False. The Booleanvalued models of ZFC are a related subject.
Nearly all mathematical concepts are now defined formally in terms of sets and set theoretic concepts. For example, mathematical structures as diverse as graphs, manifolds, rings, and vector spaces are all defined as sets having various (axiomatic) properties. Equivalence and order relations are ubiquitous in mathematics, and the theory of relations is entirely grounded in set theory.
Set theory is also a promising foundational system for much of mathematics. Since the publication of the first volume of Principia Mathematica, it has been claimed that most or even all mathematical theorems can be derived using an aptly designed set of axioms for set theory, augmented with many definitions, using first or second order logic. For example, properties of the natural and real numbers can be derived within set theory, as each number system can be identified with a set of equivalence classes under a suitable equivalence relation whose field is some infinite set.
Set theory as a foundation for mathematical analysis, topology, abstract algebra, and discrete mathematics is likewise uncontroversial; mathematicians accept that (in principle) theorems in these areas can be derived from the relevant definitions and the axioms of set theory. Few full derivations of complex mathematical theorems from set theory have been formally verified, however, because such formal derivations are often much longer than the natural language proofs mathematicians commonly present. One verification project, Metamath, includes derivations of more than 10,000 theorems starting from the ZFC axioms and using first order logic.
Set theory is a major area of research in mathematics, with many interrelated subfields.
Combinatorial set theory concerns extensions of finite combinatorics to infinite sets. This includes the study of cardinal arithmetic and the study of extensions of Ramsey's theorem such as the ErdosRado theorem.
Descriptive set theory is the study of subsets of the real line and, more generally, subsets of Polish spaces. It begins with the study of pointclasses in the Borel hierarchy and extends to the study of more complex hierarchies such as the projective hierarchy and the Wadge hierarchy. Many properties of Borel sets can be established in ZFC, but proving these properties hold for more complicated sets requires additional axioms related to determinacy and large cardinals.
The field of effective descriptive set theory is between set theory and recursion theory. It includes the study of lightface pointclasses, and is closely related to hyperarithmetical theory. In many cases, results of classical descriptive set theory have effective versions; in some cases, new results are obtained by proving the effective version first and then extending ("relativizing") it to make it more broadly applicable.
A recent area of research concerns Borel equivalence relations and more complicated definable equivalence relations. This has important applications to the study of invariants in many fields of mathematics.
In set theory as Cantor defined and Zermelo and Fraenkel axiomatized, an object is either a member of a set or not. In fuzzy set theory this condition was relaxed by Zadeh so an object has a degree of membership in a set, as number between 0 and 1. For example, the degree of membership of a person in the set of "tall people" is more flexible than a simple yes or no answer and can be a real number such as 0.75.
An inner model of Zermelo–Fraenkel set theory (ZF) is a transitive class that includes all the ordinals and satisfies all the axioms of ZF. The canonical example is the constructible universe L developed by Gödel. The study of inner models of extensions of ZF is of interest in set theory because it can be used to prove consistency results. For example, it can be shown that regardless whether a model V of ZF satisfies the continuum hypothesis or the axiom of choice, the inner model L constructed inside the original model will satisfy both the generalized continuum hypothesis and the axiom of choice. Thus the assumption that ZF is consistent (has any model whatsoever) implies that ZF together with these two principles is consistent.
The study of inner models is common in the study of determinacy and large cardinals, especially when considering axioms such as the axiom of determinacy that contradict the axiom of choice. Even if a fixed model of set theory satisfies the axiom of choice, it is possible for an inner model to fail to satisfy the axiom of choice. For example, the existence of sufficiently large cardinals implies that there is an inner model satisfying the axiom of determinacy (and thus not satisfying the axiom of choice).^{[4]}
A large cardinal is a cardinal number with an extra property. Many such properties are studied, including inaccessible cardinals, measurable cardinals, and many more. These properties typically imply the cardinal number must be very large, with the existence of a cardinal with the specified property unprovable in ZermeloFraenkel set theory.
Determinacy refers to the fact that, under appropriate assumptions, certain twoplayer games of perfect information are determined from the start in the sense that one player must have a winning strategy. The existence of these strategies has important consequences in descriptive set theory, as the assumption that a broader class of games is determined often implies that a broader class of sets will have a topological property. The axiom of determinacy (AD) is an important object of study; although incompatible with the axiom of choice, AD implies that all subsets of the real line are well behaved (in particular, measurable and with the perfect set property). AD can be used to prove that the Wadge degrees have an elegant structure.
Paul Cohen invented the method of forcing while searching for a model of ZFC in which the axiom of choice or the continuum hypothesis fails. Forcing adjoins to some given model of set theory additional sets in order to create a larger model with properties determined (i.e. "forced") by the construction and the original model. For example, Cohen's construction adjoins additional subsets of the natural numbers without changing any of the cardinal numbers of the original model. Forcing is also one of two methods for proving relative consistency by finitistic methods, the other method being Booleanvalued models.
A cardinal invariant is a property of the real line measured by a cardinal number. For example, a wellstudied invariant is the smallest cardinality of a collection of meagre sets of reals whose union is the entire real line. These are invariants in the sense that any two isomorphic models of set theory must give the same cardinal for each invariant. Many cardinal invariants have been studied, and the relationships between them are often complex and related to axioms of set theory.
Settheoretic topology studies questions of general topology that are settheoretic in nature or that require advanced methods of set theory for their solution. Many of these theorems are independent of ZFC, requiring stronger axioms for their proof. A famous problem is the normal Moore space question, a question in general topology that was the subject of intense research. The answer to the normal Moore space question was eventually proved to be independent of ZFC.
From set theory's inception, some mathematicians objected to it as a foundation for mathematics, arguing, for example, that it is just a game which included elements of fantasy. The most common objection to set theory, one Kronecker voiced in set theory's earliest years, starts from the constructivist view that mathematics is loosely related to computation. If this view is granted, then the treatment of infinite sets, both in naive and in axiomatic set theory, introduces into mathematics methods and objects that are not computable even in principle. Ludwig Wittgenstein questioned the way Zermelo–Fraenkel set theory handled infinities. Wittgenstein's views about the foundations of mathematics were later criticised by Paul Bernays, and closely investigated by Crispin Wright, among others.
Category theorists have proposed topos theory as an alternative to traditional axiomatic set theory. Topos theory can interpret various alternatives to that theory, such as constructivism, finite set theory, and computable set theory.

Contents 
Resource type: this resource is a lesson. 
Welcome! This is a lesson in the Computer Science course Introductory Discrete Mathematics for Computer Science.
Intuitively, a set can be thought of as a collection of elements. In a set, the order of the elements is irrelevant, as is the possibility of duplicate elements. For example, we write X = {1,2,3} to denote a set X containing the numbers 1, 2 and 3. Or, X = {1,2,3} = {3,2,1} = {1,1,2,3,3}.
Set theory is the study of sets in mathematics. Sets are collections of objects.
The reason why set theory was made is that collections of objects can cause problems if you work with them without explaining them better. It was made by people like Georg Cantor and Bertrand Russell.
Set theory begins by giving some examples of things that are sets. Then it gives rules in which you can make other sets from the already known sets. Collections of objects that are not sets are called classes. It is possible to do mathematics using only sets, rather than classes, so that the problems that classes cause in mathematics do not occur.
A binary relation between two sets is the subset relation, also called set inclusion. If all the members of set A are also members of set B, then A is a subset of B, marking A ⊆ B. For example, {1,2} is a subset of {1,2,3} , but {1,4} is not. From this example, it is clear that a set is a subset of itself. In cases where one wishes to not to have this, the term proper subset is meant not to have this possibility.
The selfconsidering object in the set theory was existing too, an example numbers: 1={1}, 2={1, 2}, 3={1, 2, 3} and so on.
