All Topics  
Set theory

 

   Email Print
   Bookmark   Link






 

Set theory



 
 
Set theory is the branch of mathematics
Mathematics

Mathematics is the study of quantity, structure, space, change, and related topics of pattern and form. Mathematicians seek out patterns whether found in numbers, space, natural science, computers, imaginary abstractions, or elsewhere....
 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 Cantor
Georg Cantor

Georg Ferdinand Ludwig Philipp Cantor was a Germany mathematician, born in Russia. He is best known as the creator of set theory, which has become a foundations of mathematics in mathematics....
 and Dedekind in the 1870s. After the discovery of paradoxes
Naive set theory

Naive set theory is one of several theories of sets used in the discussion of the foundations of mathematics. The informal content of this naive set theory supports both the aspects of mathematical sets familiar in discrete mathematics , and the everyday usage of set theory concepts in most contemporary mathematics....
 in informal set theory, numerous axiom systems were proposed in the early twentieth century, of which the Zermelo–Fraenkel axioms
Zermelo–Fraenkel set theory

Zermelo?Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of axiomatic set theory and as such is the most common foundations of mathematics....
, with the axiom of choice
Axiom of choice

In mathematics, the axiom of choice, or AC, is an axiom of set theory. Informally put, the axiom of choice says that given any collection of bins, each containing at least one object, it is possible to make a selection of exactly one object from each bin, even if there are infinite set many bins and there is no "rule" for which object t...
, are the best-known.

Set theory, formalized using first-order logic
First-order logic

First-order logic is a formal deductive system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first-order predicate calculus , the lower predicate calculus, the language of first-order logic or predicate logic....
, is the most common foundational system for mathematics.






Discussion
Ask a question about 'Set theory'
Start a new discussion about 'Set theory'
Answer questions from other users
Full Discussion Forum



Encyclopedia


Set theory is the branch of mathematics
Mathematics

Mathematics is the study of quantity, structure, space, change, and related topics of pattern and form. Mathematicians seek out patterns whether found in numbers, space, natural science, computers, imaginary abstractions, or elsewhere....
 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 Cantor
Georg Cantor

Georg Ferdinand Ludwig Philipp Cantor was a Germany mathematician, born in Russia. He is best known as the creator of set theory, which has become a foundations of mathematics in mathematics....
 and Dedekind in the 1870s. After the discovery of paradoxes
Naive set theory

Naive set theory is one of several theories of sets used in the discussion of the foundations of mathematics. The informal content of this naive set theory supports both the aspects of mathematical sets familiar in discrete mathematics , and the everyday usage of set theory concepts in most contemporary mathematics....
 in informal set theory, numerous axiom systems were proposed in the early twentieth century, of which the Zermelo–Fraenkel axioms
Zermelo–Fraenkel set theory

Zermelo?Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of axiomatic set theory and as such is the most common foundations of mathematics....
, with the axiom of choice
Axiom of choice

In mathematics, the axiom of choice, or AC, is an axiom of set theory. Informally put, the axiom of choice says that given any collection of bins, each containing at least one object, it is possible to make a selection of exactly one object from each bin, even if there are infinite set many bins and there is no "rule" for which object t...
, are the best-known.

Set theory, formalized using first-order logic
First-order logic

First-order logic is a formal deductive system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first-order predicate calculus , the lower predicate calculus, the language of first-order logic or predicate logic....
, is the most common foundational system for mathematics. The language of set theory is used in the definitions of nearly all mathematical objects, such as functions
Function (mathematics)

The mathematical concept of a function expresses dependence between two quantities, one of which is known and the other which is produced. A function associates a single output to each input element drawn from a fixed Set , such as the real numbers , although different inputs may have the same output....
, 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 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
Cardinality

In mathematics, the cardinality of a set is a measure of the "number of Element of the set". For example, the set A = contains 3 elements, and therefore A has a cardinality of 3....
 are a standard part of the undergraduate mathematics curriculum.

Beyond its use as a foundational system, set theory is a branch of mathematics
Mathematics

Mathematics is the study of quantity, structure, space, change, and related topics of pattern and form. Mathematicians seek out patterns whether found in numbers, space, natural science, computers, imaginary abstractions, or elsewhere....
 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
Real number

In mathematics, the real numbers may be described informally in several different ways. The real numbers include both rational numbers, such as 42 and −23/129, and irrational numbers, such as pi and the square root of two; or, a real number can be given by an infinite decimal representation, such as 2.4871773339...., where the digits co...
 line to the study of the consistency of large cardinals.

History

See Johnson (1972) for a book-length treatment. Mathematical topics typically emerge and evolve through interactions among many researchers. The point of origin of set theory is somewhat unusual in that it can be identified as an 1874 paper by Georg Cantor
Georg Cantor

Georg Ferdinand Ludwig Philipp Cantor was a Germany mathematician, born in Russia. He is best known as the creator of set theory, which has become a foundations of mathematics in mathematics....
: "On a Characteristic Property of All Real Algebraic Numbers".

Beginning with the work of Zeno
Zeno of Elea

Zeno of Velia was a pre-Socratic Greek philosopher of southern Italy and a member of the Eleatic School founded by Parmenides. Aristotle called him the inventor of the dialectic....
 around 450 BC, mathematicians had been struggling with the concept of infinity
Infinity

Infinity comes from the Latin infinitas or "unboundedness." It refers to several distinct concepts – usually linked to the idea of "without end" – which arise in philosophy, mathematics, and theology....
. Especially notable is the work of Bernard Bolzano
Bernard Bolzano

Bernhard Placidus Johann Nepomuk Bolzano , Bernard Bolzano in English, was a Bohemian mathematician, theology, philosopher, logician and antimilitarism of German language mother tongue....
 in the first half of the 19th century. The modern understanding of infinity began 1867-71, with Georg Cantor
Georg Cantor

Georg Ferdinand Ludwig Philipp Cantor was a Germany mathematician, born in Russia. He is best known as the creator of set theory, which has become a foundations of mathematics in mathematics....
's work on number theory. An 1872 meeting between Cantor and Dedekind
Richard Dedekind

Julius Wilhelm Richard Dedekind was a Germany mathematics who did important work in abstract algebra, algebraic number theory and the foundations of the real numbers....
 much influenced Cantor's thinking and culminated in Cantor (1874).

Cantor's work initially polarized the mathematicians of his day. While Weierstrass
Karl Weierstrass

Karl Theodor Wilhelm Weierstrass was a Germany mathematics who is often cited as the "father of modern mathematical analysis"....
 and Dedekind
Richard Dedekind

Julius Wilhelm Richard Dedekind was a Germany mathematics who did important work in abstract algebra, algebraic number theory and the foundations of the real numbers....
 supported Cantor, Kronecker
Leopold Kronecker

Leopold Kronecker was a Germany mathematician and logician who argued that arithmetic and Mathematical analysis must be founded on "whole numbers", saying, "God made the integers; all else is the work of man" ....
, now seen as a founder of mathematical constructivism, did not. But the utility of Cantorian concepts such as one-to-one correspondence among sets, his proof that there are more real number
Real number

In mathematics, the real numbers may be described informally in several different ways. The real numbers include both rational numbers, such as 42 and −23/129, and irrational numbers, such as pi and the square root of two; or, a real number can be given by an infinite decimal representation, such as 2.4871773339...., where the digits co...
s than integers, and the "infinity of infinities" ("Cantor's paradise") the power set
Power set

In mathematics, given a Set S, the power set of S, written , P, ℘ or Power set#Representing subsets as functions, is the set of all subsets of S....
 operation gives rise to, eventually led to the widespread acceptance of Cantorian set theory.

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 paradox
Paradox

A paradox is a Proposition or group of statements that leads to a contradiction or a situation which defies intuition ; or, it can be an apparent contradiction that actually expresses a non-dual truth ....
es. Russell
Bertrand Russell

Bertrand Arthur William Russell, 3rd Earl Russell, Order of Merit , Fellow of the Royal Society , was a British people philosopher, mathematical logic, mathematician, historian, advocate for social reform, and pacifism....
 and Zermelo independently found the simplest and best known paradox, now called Russell's paradox
Russell's paradox

Part of fundamental mathematics, Russell's paradox , discovered by Bertrand Russell in 1901, showed that the naive set theory of Gottlob Frege leads to a contradiction....
 and involving "the set of all sets that are not members of themselves." Clearly this set cannot be a member of itself, and hence it must be a member of itself! In 1899 Cantor had himself posed the question: "what is the cardinal number
Cardinal number

In mathematics, cardinal numbers, or cardinals for short, are a generalization of the natural numbers used to measure the cardinality of Set ....
 of the set of all sets?" and obtained a related paradox. It was later realized that these paradoxes are not merely set theoretic, and that in logic the sentence "this sentence is false" gives rise to a similar problem, for if the sentence is true, it must be false. Kurt Gödel
Kurt Gödel

Kurt G?del was an Austrian-United States logician, mathematician and philosopher. One of the most significant logicians of all time, G?del made an immense impact upon scientific and philosophical thinking in the 20th century, a time when many, such as Bertrand Russell, A....
 used this fact in the 1931 proof of his celebrated incompleteness theorem
Gödel's incompleteness theorems

In mathematical logic, G?del's incompleteness theorems, proved by Kurt G?del in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest....
.

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 Fraenkel in 1922 resulted in the canonical axiomatic set theory ZFC, which is thought to be free of paradoxes. The work of analysts
Real analysis

Real analysis, or theory of functions of a real variable is a branch of mathematical analysis dealing with the Set of real numbers. In particular, it deals with the analytic function properties of real function and sequences, including convergence and limit s of sequences of real numbers, the calculus of the real numbers, and continu...
 such as Lebesgue
Henri Lebesgue

Henri L?on Lebesgue was a France mathematician, most famous for his theory of integral. Lebesgue's integration theory was originally published in his dissertation, A summary of Henri Lebesgue's dissertation , at the University of Nancy in 1902....
 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.

Basic concepts


Set theory begins with a fundamental binary relation
Binary relation

In mathematics, a binary relation is an arbitrary association of elements within a set or with elements of another set.An example is the "divides" relation between the set of prime numbers P and the set of integers Z, in which every prime p is associated with every integer z that is a divisibility of p, and no othe...
 between an object o and a set A. If o is a member (or element) of A, we write .

The basic binary relation
Binary relation

In mathematics, a binary relation is an arbitrary association of elements within a set or with elements of another set.An example is the "divides" relation between the set of prime numbers P and the set of integers Z, in which every prime p is associated with every integer z that is a divisibility of p, and no othe...
 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
Subset

In mathematics, especially in set theory, a Set A is a subset of a set B if A is "contained" inside B. Notice that A and B may coincide....
 of B, denoted . For example, is a subset of , but is not.

Just as arithmetic
Arithmetic

Arithmetic or arithmetics is the oldest and most elementary branch of mathematics, used by almost everyone, for tasks ranging from simple day-to-day counting to advanced science and business calculations....
 features binary operation
Binary operation

In mathematics, a binary operation is a calculation involving two operands, in other words, an operation whose arity is two. Binary operations can be accomplished using either a binary function or binary operator....
s on number
Number

A number is a mathematical object used in counting and measurement. A notational symbol which represents a number is called a Numeral system, but in common usage the word number is used for both the abstract object and the symbol, as well as for the numeral for the number....
s, set theory features binary operations on sets. The:
  • Union
    Union (set theory)

    In set theory, the term Union refers to a set operation used in the convergence of set elements to form a resultant set containing the elements of both sets....
     of the sets A and B, denoted , is the set whose members are members of at least one of A or B. The union of and is the set .
  • Intersection
    Intersection (set theory)

    In mathematics, the intersection of two Set A and B is the set that contains all elements of A that also belong to B , but no other elements....
     of the sets A and B, denoted , is the set whose members are members of both A and B. The intersection of and is the set .
  • Complement
    Complement (set theory)

    In discrete mathematics and predominantly in set theory, a complement is a concept used in comparisons of sets to refer to the unique values of one set in relation to another....
     of set A relative to set U, denoted , is the set of all members of U that are not members of A. This terminology is most commonly employed when U is a universal set
    Universal set

    In set theory, a universal set is a Set which contains all objects, including itself. The most widely-studied set theory with a universal set is Willard Van Orman Quine?s New Foundations, but Alonzo Church and :de:Arnold_Oberschelp also published work on such set theories....
    , as in the study of Venn diagram
    Venn diagram

    Venn diagrams or set diagrams are diagrams that show all hypothetically possible logical relations between a finite collection of Set . Venn diagrams were invented around 1880 by John Venn....
    s. This operation is also called the set difference of U and A, denoted The complement of relative to is , while, conversely, the complement of relative to is .
  • Symmetric difference
    Symmetric difference

    In mathematics, the symmetric difference of two Set is the set of elements which are in one of the sets, but not in both. This operation is the set-theoretic kin of the exclusive disjunction in Boolean logic....
     of sets A and B is the set whose members are members of exactly one of A and B. For instance, for the sets and , the symmetric difference set is .
  • Cartesian product
    Cartesian product

    In mathematics, the Cartesian product is a direct product of sets. The Cartesian product is named after Ren? Descartes, whose formulation of analytic geometry gave rise to this concept....
     of A and B, denoted , is the set whose members are all possible ordered pair
    Ordered pair

    In mathematics, an ordered pair is a collection of two distinguishable objects, one being the first coordinate system , and the other being the second coordinate ....
    s (a,b) where a is a member of A and b is a member of B.
The powerset of a set A is the set whose members are all possible subsets of A. For example, the powerset of is .

Some ontology


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
Von Neumann universe

In set theory and related branches of mathematics, the von Neumann universe, or von Neumann hierarchy of sets, denoted V, is the class of all Set , divided into a transfinite hierarchy of individual sets....
 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 a 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 a then X is assigned rank a+1. Also, for each ordinal a, the set Va contains all sets assigned a rank no greater than a.

Axiomatic set theory

Elementary set theory can be studied informally and intuitively, and so can be taught in primary schools using, say, Venn diagram
Venn diagram

Venn diagrams or set diagrams are diagrams that show all hypothetically possible logical relations between a finite collection of Set . Venn diagrams were invented around 1880 by John Venn....
s. 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
Russell's paradox

Part of fundamental mathematics, Russell's paradox , discovered by Bertrand Russell in 1901, showed that the naive set theory of Gottlob Frege leads to a contradiction....
. Axiomatic set theory was originally devised to rid set theory of such antinomies.

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
Ontology

Ontology in philosophy is the study of the nature of being, existence or reality in general, as well as of the basic category of being and their relations....
 consists of:
  • Sets alone. This includes the most common axiomatic set theory, Zermelo–Fraenkel set theory
    Zermelo–Fraenkel set theory

    Zermelo?Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of axiomatic set theory and as such is the most common foundations of mathematics....
     (ZFC), which includes the axiom of choice
    Axiom of choice

    In mathematics, the axiom of choice, or AC, is an axiom of set theory. Informally put, the axiom of choice says that given any collection of bins, each containing at least one object, it is possible to make a selection of exactly one object from each bin, even if there are infinite set many bins and there is no "rule" for which object t...
    . Fragments of ZFC include:
    • Zermelo set theory
      Zermelo set theory

      Zermelo set theory, as set out in an important paper in 1908 by Ernst Zermelo, is the ancestor of modern set theory. It bears certain differences from its descendants, which are not always understood, and are frequently misquoted....
      , which replaces the axiom schema of replacement
      Axiom schema of replacement

      In set theory, the axiom schema of replacement is a schema of axioms in Zermelo-Fraenkel set theory that asserts that the of any Set under any definable functional predicate is also a set....
       with that of separation;
    • General set theory
      General set theory

      General set theory is George Boolos's name for a three-axiom fragment of the canonical axiomatic set theory Zermelo set theory. GST is sufficient for all mathematics not requiring infinite sets, and is the weakest known set theory whose theorems include the Peano axioms....
      , a small fragment of Zermelo set theory
      Zermelo set theory

      Zermelo set theory, as set out in an important paper in 1908 by Ernst Zermelo, is the ancestor of modern set theory. It bears certain differences from its descendants, which are not always understood, and are frequently misquoted....
       sufficient for the Peano axioms
      Peano axioms

      In mathematical logic, the Peano axioms, also known as the Dedekind?Peano axioms or the Peano postulates, are a set of axioms for the natural numbers presented by the 19th century Italian people mathematician Giuseppe Peano....
       and finite set
      Finite set

      In mathematics, finite set is a Set that has a finite number of element . For example,is a finite set with five elements. The number of elements of a finite set is a natural number , and is called the cardinality of the set....
      s;
    • Kripke-Platek set theory, which omits the axioms of infinity, powerset
      Axiom of power set

      In mathematics, the axiom of power set is one of the Zermelo-Fraenkel axioms of axiomatic set theory.In the formal language of the Zermelo-Fraenkel axioms, the axiom reads:...
      , and choice
      Axiom of choice

      In mathematics, the axiom of choice, or AC, is an axiom of set theory. Informally put, the axiom of choice says that given any collection of bins, each containing at least one object, it is possible to make a selection of exactly one object from each bin, even if there are infinite set many bins and there is no "rule" for which object t...
      , and weakens the axiom schemata of separation and replacement
      Axiom schema of replacement

      In set theory, the axiom schema of replacement is a schema of axioms in Zermelo-Fraenkel set theory that asserts that the of any Set under any definable functional predicate is also a set....
      .
  • Sets and proper classes. This includes Von Neumann-Bernays-Gödel set theory, which has the same strength as ZFC for theorems about sets alone, and Morse-Kelley set theory, which is stronger than ZFC.
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
New Foundations

In mathematical logic, New Foundations is an axiomatic set theory, conceived by Willard Van Orman Quine as a simplification of the theory of types of Principia Mathematica....
 (with urelements) and NF
New Foundations

In mathematical logic, New Foundations is an axiomatic set theory, conceived by Willard Van Orman Quine as a simplification of the theory of types of Principia Mathematica....
 (lacking them) are not based on a cumulative hierarchy. NF and NFU include a "set of all sets," relative to which every set has a complement. Here urelements matter, because NF, but not NFU, allows sets for which the axiom of choice
Axiom of choice

In mathematics, the axiom of choice, or AC, is an axiom of set theory. Informally put, the axiom of choice says that given any collection of bins, each containing at least one object, it is possible to make a selection of exactly one object from each bin, even if there are infinite set many bins and there is no "rule" for which object t...
 does not hold.

Systems of constructive set theory
Constructive set theory

Constructive set theory is an approach to constructivism following the program of axiomatic set theory. That is, it uses the usual first-order logic language of classical set theory, and although of course the logic is constructive logic, there is no explicit use of constructive type theory....
, such as CST, CZF, and IZF, embed their set axioms in intuitionistic logic
Intuitionistic logic

Intuitionistic logic, or constructivist logic, is the symbolic logic system originally developed by Arend Heyting to provide a formal basis for Luitzen Egbertus Jan Brouwer's programme of intuitionism....
 instead of first order logic. Yet other systems accept standard first order logic but feature a nonstandard membership relation. These include rough set theory
Rough set

A rough set, first described by Zdzislaw I. Pawlak, is a formal approximation of a crisp set in terms of a pair of sets which give the lower and the upper approximation of the original set....
 and fuzzy set theory, in which the value of an atomic formula
Atomic formula

In mathematical logic, an atomic formula is a formula with no deeper propositional structure, that is, a formula that contains no logical connectives or equivalently a formula that has no strict subformulas....
 embodying the membership relation is not simply True and False. The Boolean-valued model
Boolean-valued model

In mathematical logic, a Boolean-valued model is a generalization of the ordinary Alfred Tarski notion of structure or model theory, in which the truth values of propositions are not limited to "true" and "false", but take values in some fixed complete Boolean algebra....
s of ZFC are a related subject.

Applications

Nearly all mathematical concepts are now defined formally in terms of sets and set theoretic concepts. For example, mathematical structures as diverse as graphs
Graph (mathematics)

In mathematics a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected objects are represented by mathematical abstractions called vertices, and the links that connect some pairs of vertices are called edges....
, manifolds, rings
Ring (mathematics)

In mathematics, a ring is a type of algebraic structure. There is some variation among mathematicians as to exactly what properties a ring is required to have, as described in detail below....
, and vector space
Vector space

File:Vector addition ans scaling.pngA vector space is a mathematical structure formed by a collection of vectors: objects that may be Vector addition together and Scalar multiplication by numbers, called scalar s in this context....
s are all defined as sets having various (axiomatic) properties. Equivalence
Equivalence relation

In mathematics, an equivalence relation is, loosely, a binary relation on a Set that specifies how to split up the set into subsets such that every element of the larger set is in exactly one of the subsets....
 and order relations are ubiquitous in mathematics, and the theory of relations
Relation (mathematics)

In mathematics , a relation is a property that assigns truth values to combinations of k first-order logic. Typically, the property describes a possible connection between the components of a k-tuple....
 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
Principia Mathematica

The Principia Mathematica is a 3-volume work on the foundations of mathematics, written by Alfred North Whitehead and Bertrand Russell and published in 1910?1913....
, 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 (see Metamath
Metamath

Metamath is a computer-assisted proof checker. It hasno specific logic embedded and can simply be regarded as a device to apply inference rules to formulas....
). For example, properties of the natural
Natural number

In mathematics, a natural number can mean either an element of the Set = *n = = ? = ? ...
 and real number
Real number

In mathematics, the real numbers may be described informally in several different ways. The real numbers include both rational numbers, such as 42 and −23/129, and irrational numbers, such as pi and the square root of two; or, a real number can be given by an infinite decimal representation, such as 2.4871773339...., where the digits co...
s can be derived within set theory, as each number system can be identified with a set of equivalence class
Equivalence class

In mathematics, given a Set X and an equivalence relation ~ on X, the equivalence class of an element a in X is the subset of all elements in X which are equivalent to a:...
es under a suitable equivalence relation
Equivalence relation

In mathematics, an equivalence relation is, loosely, a binary relation on a Set that specifies how to split up the set into subsets such that every element of the larger set is in exactly one of the subsets....
 whose field is some infinite set
Infinite set

In set theory, an infinite set is a Set that is not a finite set. Infinite sets may be countable set or uncountable set. Some examples are:* the set of all integers, , is a countably infinite set; and...
.

Set theory as a foundation for mathematical analysis
Mathematical analysis

Mathematical analysis, which mathematicians refer to simply as analysis, has its beginnings in the rigorous formulation of calculus. It is the branch of mathematics most explicitly concerned with the notion of a limit , whether the limit of a sequence or the limit of a function....
, topology
Topology

Topology is a major area of mathematics that has emerged through the development of concepts from geometry and set theory, such as those of space, dimension, shape, transformation and others....
, abstract algebra
Abstract algebra

Abstract algebra is the subject area of mathematics that studies algebraic structures, such as group , ring , field , module , vector spaces, and algebra over a field....
, and discrete mathematics
Discrete mathematics

Discrete mathematics, also called finite mathematics, is the study of mathematical structures that are fundamentally discrete in the sense that its objects can assume only distinct, separate values, rather than a values on a continuum ....
 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
Metamath

Metamath is a computer-assisted proof checker. It hasno specific logic embedded and can simply be regarded as a device to apply inference rules to formulas....
, includes derivations of more than 10,000 theorems starting from the ZFC axioms and using first order logic.

Areas of study

Set theory is a major area of research in mathematics, with many interrelated subfields.

Combinatorial set theory


Combinatorial set theory concerns extensions of finite combinatorics
Combinatorics

Combinatorics is a branch of pure mathematics concerning the study of Countable set objects. It is related to many other areas of mathematics, such as algebra, probability theory, ergodic theory and geometry, as well as to applied subjects in computer science and statistical physics....
 to infinite sets. This includes the study of cardinal arithmetic and the study of extensions of Ramsey's theorem
Ramsey's theorem

In combinatorics, Ramsey's theorem states that in any colouring of the edges of a sufficiently large complete graph , one will find monochromatic complete subgraphs....
 such as the Erdos-Rado theorem.

Descriptive set theory


Descriptive set theory is the study of subsets of the real line
Real line

In mathematics, the real line is simply the set R of singleton real numbers.However, this term is usually used when R is to be treated as a space of some sort, such as a topological space or a vector space....
 and, more generally, subsets of Polish space
Polish space

In mathematics, a Polish space is a separable space complete space topological space; that is, a space homeomorphic to a Complete space metric space that has a countable Dense set subset....
s. It begins with the study of pointclass
Pointclass

In the mathematical field of descriptive set theory, a pointclass is a collection of Set of point , where a point is ordinarily understood to be an element of some perfect set Polish space....
es in the Borel hierarchy
Borel hierarchy

In mathematical logic, the Borel hierarchy is a stratification of the Borel algebra generated by the open subsets of a Polish space; elements of this algebra are called Borel sets....
 and extends to the study of more complex hierarchies such as the projective hierarchy and the Wadge hierarchy
Wadge hierarchy

In descriptive set theory, Wadge degrees are levels of complexity for sets of reals and more comprehensively, subsets of any given topological space....
. 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
Effective descriptive set theory

Effective descriptive set theory is the branch of descriptive set theory dealing with Set of real number having lightface definitions; that is, definitions that do not require an arbitrary real parameter....
 is between set theory and recursion theory
Recursion theory

Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees....
. It includes the study of lightface pointclasses, and is closely related to hyperarithmetical theory
Hyperarithmetical theory

In recursion theory, hyperarithmetic theory is a generalization of Turing computability. It has close connections with definability in second-order arithmetic and with weak systems of set theory such as Kripke?Platek set 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 relation
Borel equivalence relation

In mathematics, a Borel equivalence relation on a Polish space X'' is an equivalence relation on X'' that is a Borel algebra subset of X'' × X''...
s and more complicated definable equivalence relation
Equivalence relation

In mathematics, an equivalence relation is, loosely, a binary relation on a Set that specifies how to split up the set into subsets such that every element of the larger set is in exactly one of the subsets....
s. This has important applications to the study of invariants
Invariant (mathematics)

In mathematics, an invariant is something that does not change under a set of Transformation s. The property of being an invariant is invariance....
 in many fields of mathematics.

Fuzzy set theory


In set theory as Cantor
Georg Cantor

Georg Ferdinand Ludwig Philipp Cantor was a Germany mathematician, born in Russia. He is best known as the creator of set theory, which has become a foundations of mathematics in mathematics....
 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. E.g. 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.

Inner model theory


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
Constructible universe

In mathematics, the constructible universe , denoted L, is a particular class of sets which can be described entirely in terms of simpler sets....
 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
Continuum hypothesis

In mathematics, the continuum hypothesis is a hypothesis, advanced by Georg Cantor, about the possible sizes of infinite Set . Cantor introduced the concept of cardinal number to compare the sizes of infinite sets, and he gave two proofs that the cardinality of the set of integers is strictly smaller than that of the set of real numbers....
 or the axiom of choice
Axiom of choice

In mathematics, the axiom of choice, or AC, is an axiom of set theory. Informally put, the axiom of choice says that given any collection of bins, each containing at least one object, it is possible to make a selection of exactly one object from each bin, even if there are infinite set many bins and there is no "rule" for which object t...
, the inner model L constructed inside the original model will satisfy both the 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).

Large cardinals


A large cardinal is a cardinal number with an extra property. Many such properties are studied, including inaccessible cardinal
Inaccessible cardinal

In set theory, an uncountable set regular cardinal is called weakly inaccessible if it is a weak limit cardinal, and strongly inaccessible, or just inaccessible, if it is a strong limit cardinal....
s, measurable cardinal
Measurable cardinal

In mathematics, a measurable cardinal is a certain kind of large cardinal number....
s, 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 Zermelo-Fraenkel set theory.

Determinacy


Determinacy refers to the fact that, under appropriate assumptions, certain two-player 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
Axiom of determinacy

The axiom of determinacy is a possible axiom for set theory introduced Jan Mycielski and Hugo Steinhaus. It refers to certain two-person Determinacy#Basic notionss of length ordinal number with perfect information....
 (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.

Forcing


Paul Cohen
Paul Cohen

Paul Cohen may refer to:*Paul Cohen , American , professor at Stanford University*Paul Cohen , American saxophonist and music teacher, frequently performing with orchestras and as a soloist...
 invented forcing
Forcing (mathematics)

In the mathematical discipline of set theory, forcing is a technique invented by Paul Cohen for proving consistency and independence results. It was first used, in 1962, to prove the independence of the continuum hypothesis and the axiom of choice from Zermelo-Fraenkel set theory....
 while searching for a model
Model theory

In mathematics, model theory is the study of mathematical Structure such as Group , fields, graph , or even models of set theory, using tools from mathematical logic....
 of ZFC in which the continuum hypothesis
Continuum hypothesis

In mathematics, the continuum hypothesis is a hypothesis, advanced by Georg Cantor, about the possible sizes of infinite Set . Cantor introduced the concept of cardinal number to compare the sizes of infinite sets, and he gave two proofs that the cardinality of the set of integers is strictly smaller than that of the set of real numbers....
 fails. Forcing adjoins to some given model of set theory additional sets in order to create a larger model with properties determined by the construction and the original model. For example, Cohen's construction adjoins additional subsets of the natural number
Natural number

In mathematics, a natural number can mean either an element of the Set = *n = = ? = ? ...
s without changing any of the cardinal number
Cardinal number

In mathematics, cardinal numbers, or cardinals for short, are a generalization of the natural numbers used to measure the cardinality of Set ....
s of the original model. Forcing is also one of two methods for proving relative consistency by finitistic methods, the other method being Boolean-valued model
Boolean-valued model

In mathematical logic, a Boolean-valued model is a generalization of the ordinary Alfred Tarski notion of structure or model theory, in which the truth values of propositions are not limited to "true" and "false", but take values in some fixed complete Boolean algebra....
s.

Cardinal invariants


A cardinal invariant is a property of the real line measured by a cardinal number. For example, a well-studied invariant is the smallest cardinality of a collection of meagre set
Meagre set

In the mathematical fields of general topology and descriptive set theory, a meagre set is a set that, considered as a subset of a topological space, is in a precise sense small or negligible set....
s 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.

Set-theoretic topology


Set-theoretic topology studies questions of general topology
General topology

In mathematics, general topology or point-set topology is the branch of topology which studies properties of topological spaces and structures defined on them....
 that are set-theoretic 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
Moore space (topology)

In mathematics, particularly topology, a Moore space is a topological space satisfying an axiom that may be thought of as a separation axiom. In fact, Moore spaces are generally interesting in mathematics because they may be applied to prove interesting metrization theorems....
, 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.

Objections to set theory

From set theory's inception, some mathematicians objected to it
Controversy over Cantor's theory

In mathematical logic, the theory of infinite Set was first developed by Georg Cantor. Although this work has found near-universal acceptance in the mathematics community, it has been criticized in several areas by mathematicians and philosophers....
 as a foundation for mathematics
Foundations of mathematics

Foundations of mathematics is a term sometimes used for certain fields of mathematics, such as mathematical logic, axiomatic set theory, proof theory, model theory, and recursion theory....
, 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
Naive set theory

Naive set theory is one of several theories of sets used in the discussion of the foundations of mathematics. The informal content of this naive set theory supports both the aspects of mathematical sets familiar in discrete mathematics , and the everyday usage of set theory concepts in most contemporary mathematics....
 and in axiomatic set theory, introduces into mathematics methods and objects that are not computable even in principle. Ludwig Wittgenstein
Ludwig Wittgenstein

Ludwig Josef Johann Wittgenstein was an Austrian-United Kingdom philosopher who worked primarily in logic, the philosophy of mathematics, the philosophy of mind, and the philosophy of language....
 questioned the way Zermelo–Fraenkel set theory
Zermelo–Fraenkel set theory

Zermelo?Fraenkel set theory with the axiom of choice, commonly abbreviated ZFC, is the standard form of axiomatic set theory and as such is the most common foundations of mathematics....
 handled infinities. Wittgenstein's views about the foundations of mathematics were later criticised by Paul Bernays
Paul Bernays

Paul Isaac Bernays was a Switzerland mathematician, who made significant contributions to mathematical logic, axiomatic set theory, and the philosophy of mathematics....
, and closely investigated by Crispin Wright
Crispin Wright

Crispin Wright is a United Kingdom philosopher, who has written on neo-Gottlob Frege philosophy of mathematics, Wittgenstein's later philosophy, and on issues related to truth, Philosophical realism, cognitivism, skepticism, knowledge, and Objectivity ....
, among others. In the mid 20th century, Errett Bishop
Errett Bishop

Errett Albert Bishop was an United States mathematician known for his work on analysis. He is the father of constructivist analysis, by virtue of his 1967 Foundations of Constructive Analysis, where he Mathematical proof most of the important theorems in real analysis by constructivist methods....
 dismissed set theory as "God
God

God is a deity in theism and deism religions and other belief systems, representing either the sole deity in monotheism, or a principal deity in polytheism....
's mathematics, which we should leave for God to do."

Category theorists
Category theory

In mathematics, category theory deals in an abstract way with mathematical structures and relationships between them: it abstracts from set s and function s to objects linked in diagrams by morphisms or arrows....
 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
Turing machine

Turing machines are basic abstract symbol-manipulating devices which, despite their simplicity, can be adapted to simulate the logic of any computer algorithm....
 set theory.

See also

  • List of set theory topics
    List of set theory topics

    This page is a list of articles related to set theory....
  • Musical set theory concerns the application of combinatorics
    Combinatorics

    Combinatorics is a branch of pure mathematics concerning the study of Countable set objects. It is related to many other areas of mathematics, such as algebra, probability theory, ergodic theory and geometry, as well as to applied subjects in computer science and statistical physics....
     and group theory
    Group theory

    In mathematics and abstract algebra, group theory studies the algebraic structures known as group .The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring , field , and vector spaces can all be seen as groups endowed with additional operations and axioms....
     to music; beyond the fact that it uses finite set
    Finite set

    In mathematics, finite set is a Set that has a finite number of element . For example,is a finite set with five elements. The number of elements of a finite set is a natural number , and is called the cardinality of the set....
    s it has nothing to do with mathematical set theory of any kind. In the last two decades, transformational theory in music has taken the concepts of mathematical set theory more rigorously (see Lewin 1987).


Further reading

  • Keith Devlin
    Keith Devlin

    Keith J. Devlin is an England mathematician and writer....
    , 1993. The Joy of Sets. Springer Verlag.
  • Tiles, Mary, 2004 (1989). The Philosophy of Set Theory: An Historical Introduction to Cantor's Paradise. Dover Publications.


External links


  • Foreman
    Matthew Foreman

    Matthew Dean Foreman is a set theory at University of California, Irvine. He has made contributions in widely varying areas of set theory, including descriptive set theory, forcing , and infinitary combinatorics....
    , M., Akihiro Kanamori, eds. 3 vols., to appear in February 2009 . Each chapter surveys some aspect of contemporary research in set theory. Does not cover established elementary set theory, on which see Devlin (1993).