# Empty set

Last updated

In mathematics, the empty set is the unique set having no elements; its size or cardinality (count of elements in a set) is zero. [1] [2] Some axiomatic set theories ensure that the empty set exists by including an axiom of empty set, while in other theories, its existence can be deduced. Many possible properties of sets are vacuously true for the empty set.

## Contents

In some textbooks and popularizations, the empty set is referred to as the "null set". [2] However, null set is a distinct notion within the context of measure theory, in which it describes a set of measure zero (which is not necessarily empty). The empty set may also be called the void set.

## Notation

Common notations for the empty set include "{}", "${\displaystyle \emptyset }$", and "∅". [1] The latter two symbols were introduced by the Bourbaki group (specifically André Weil) in 1939, inspired by the letter Ø in the Danish and Norwegian alphabets. [3] In the past, "0" was occasionally used as a symbol for the empty set, but this is now considered to be an improper use of notation. [4]

The symbol ∅ is available at Unicode point U+2205. [5] It can be coded in HTML as &empty; and as &#8709;. It can be coded in LaTeX as \varnothing. The symbol ${\displaystyle \emptyset }$ is coded in LaTeX as \emptyset.

When writing in languages such as Danish and Norwegian, where the empty set character may be confused with the alphabetic letter Ø (as when using the symbol in linguistics), the Unicode character U+29B0 REVERSED EMPTY SET ⦰ may be used instead. [6]

## Properties

In standard axiomatic set theory, by the principle of extensionality, two sets are equal if they have the same elements. As a result, there can be only one set with no elements, hence the usage of "the empty set" rather than "an empty set".

The following lists document of some of the most notable properties related to the empty set. For more on the mathematical symbols used therein, see List of mathematical symbols .

For any set A:

• The empty set is a subset of A:
${\displaystyle \forall A:\varnothing \subseteq A}$
• The union of A with the empty set is A:
${\displaystyle \forall A:A\cup \varnothing =A}$
• The intersection of A with the empty set is the empty set:
${\displaystyle \forall A:A\cap \varnothing =\varnothing }$
• The Cartesian product of A and the empty set is the empty set:
${\displaystyle \forall A:A\times \varnothing =\varnothing }$

The empty set has the following properties:

• Its only subset is the empty set itself:
${\displaystyle \forall A:A\subseteq \varnothing \Rightarrow A=\varnothing }$
• The power set of the empty set is the set containing only the empty set:
${\displaystyle 2^{\varnothing }=\{\varnothing \}}$
• The number of elements of the empty set (i.e., its cardinality) is zero:
${\displaystyle \mathrm {|} \varnothing \mathrm {|} =0}$

The connection between the empty set and zero goes further, however: in the standard set-theoretic definition of natural numbers, sets are used to model the natural numbers. In this context, zero is modelled by the empty set.

For any property P:

• For every element of ${\displaystyle \varnothing }$, the property P holds (vacuous truth).
• There is no element of ${\displaystyle \varnothing }$ for which the property P holds.

Conversely, if for some property P and some set V, the following two statements hold:

• For every element of V the property P holds
• There is no element of V for which the property P holds

then V = ∅.

By the definition of subset, the empty set is a subset of any set A. That is, every element x of ${\displaystyle \varnothing }$ belongs to A. Indeed, if it were not true that every element of ${\displaystyle \varnothing }$ is in A, then there would be at least one element of ${\displaystyle \varnothing }$ that is not present in A. Since there are no elements of ${\displaystyle \varnothing }$ at all, there is no element of ${\displaystyle \varnothing }$ that is not in A. Any statement that begins "for every element of ${\displaystyle \varnothing }$" is not making any substantive claim; it is a vacuous truth. This is often paraphrased as "everything is true of the elements of the empty set."

### Operations on the empty set

When speaking of the sum of the elements of a finite set, one is inevitably led to the convention that the sum of the elements of the empty set is zero. The reason for this is that zero is the identity element for addition. Similarly, the product of the elements of the empty set should be considered to be one (see empty product), since one is the identity element for multiplication.

A derangement is a permutation of a set without fixed points. The empty set can be considered a derangement of itself, because it has only one permutation (${\displaystyle 0!=1}$), and it is vacuously true that no element (of the empty set) can be found that retains its original position.

## In other areas of mathematics

### Extended real numbers

Since the empty set has no member when it is considered as a subset of any ordered set, every member of that set will be an upper bound and lower bound for the empty set. For example, when considered as a subset of the real numbers, with its usual ordering, represented by the real number line, every real number is both an upper and lower bound for the empty set. [7] When considered as a subset of the extended reals formed by adding two "numbers" or "points" to the real numbers (namely negative infinity, denoted ${\displaystyle -\infty \!\,,}$ which is defined to be less than every other extended real number, and positive infinity, denoted ${\displaystyle +\infty \!\,,}$ which is defined to be greater than every other extended real number), we have that:

${\displaystyle \sup \varnothing =\min(\{-\infty ,+\infty \}\cup \mathbb {R} )=-\infty ,}$

and

${\displaystyle \inf \varnothing =\max(\{-\infty ,+\infty \}\cup \mathbb {R} )=+\infty .}$

That is, the least upper bound (sup or supremum) of the empty set is negative infinity, while the greatest lower bound (inf or infimum) is positive infinity. By analogy with the above, in the domain of the extended reals, negative infinity is the identity element for the maximum and supremum operators, while positive infinity is the identity element for the minimum and infimum operators.

### Topology

In any topological space X, the empty set is open by definition, as is X. Since the complement of an open set is closed and the empty set and X are complements of each other, the empty set is also closed, making it a clopen set. Moreover, the empty set is compact by the fact that every finite set is compact.

The closure of the empty set is empty. This is known as "preservation of nullary unions."

### Category theory

If A is a set, then there exists precisely one function f from ∅ to A, the empty function. As a result, the empty set is the unique initial object of the category of sets and functions.

The empty set can be turned into a topological space, called the empty space, in just one way: by defining the empty set to be open. This empty topological space is the unique initial object in the category of topological spaces with continuous maps. In fact, it is a strict initial object: only the empty set has a function to the empty set.

### Set theory

In the von Neumann construction of the ordinals, 0 is defined as the empty set, and the successor of an ordinal is defined as ${\displaystyle S(\alpha )=\alpha \cup \{\alpha \}}$. Thus, we have ${\displaystyle 0=\varnothing }$, ${\displaystyle 1=0\cup \{0\}=\{\varnothing \}}$, ${\displaystyle 2=1\cup \{1\}=\{\varnothing ,\{\varnothing \}\}}$, and so on. The von Neumann construction, along with the axiom of infinity, which guarantees the existence of at least one infinite set, can be used to construct the set of natural numbers, ${\displaystyle \mathbb {N} _{0}}$, such that the Peano axioms of arithmetic are satisfied.

## Questioned existence

### Axiomatic set theory

In Zermelo set theory, the existence of the empty set is assured by the axiom of empty set, and its uniqueness follows from the axiom of extensionality. However, the axiom of empty set can be shown redundant in at least two ways:

• Standard first-order logic implies, merely from the logical axioms, that something exists, and in the language of set theory, that thing must be a set. Now the existence of the empty set follows easily from the axiom of separation.
• Even using free logic (which does not logically imply that something exists), there is already an axiom implying the existence of at least one set, namely the axiom of infinity.

### Philosophical issues

While the empty set is a standard and widely accepted mathematical concept, it remains an ontological curiosity, whose meaning and usefulness are debated by philosophers and logicians.

The empty set is not the same thing as nothing ; rather, it is a set with nothing inside it and a set is always something. This issue can be overcome by viewing a set as a bag—an empty bag undoubtedly still exists. Darling (2004) explains that the empty set is not nothing, but rather "the set of all triangles with four sides, the set of all numbers that are bigger than nine but smaller than eight, and the set of all opening moves in chess that involve a king." [8]

The popular syllogism

Nothing is better than eternal happiness; a ham sandwich is better than nothing; therefore, a ham sandwich is better than eternal happiness

is often used to demonstrate the philosophical relation between the concept of nothing and the empty set. Darling writes that the contrast can be seen by rewriting the statements "Nothing is better than eternal happiness" and "[A] ham sandwich is better than nothing" in a mathematical tone. According to Darling, the former is equivalent to "The set of all things that are better than eternal happiness is ${\displaystyle \varnothing }$" and the latter to "The set {ham sandwich} is better than the set ${\displaystyle \varnothing }$". The first compares elements of sets, while the second compares the sets themselves. [8]

Jonathan Lowe argues that while the empty set:

"was undoubtedly an important landmark in the history of mathematics, … we should not assume that its utility in calculation is dependent upon its actually denoting some object."

it is also the case that:

"All that we are ever informed about the empty set is that it (1) is a set, (2) has no members, and (3) is unique amongst sets in having no members. However, there are very many things that 'have no members', in the set-theoretical sensenamely, all non-sets. It is perfectly clear why these things have no members, for they are not sets. What is unclear is how there can be, uniquely amongst sets, a set which has no members. We cannot conjure such an entity into existence by mere stipulation." [9]

George Boolos argued that much of what has been heretofore obtained by set theory can just as easily be obtained by plural quantification over individuals, without reifying sets as singular entities having other entities as members. [10]

## Related Research Articles

In mathematics, the axiom of choice, or AC, is an axiom of set theory equivalent to the statement that a Cartesian product of a collection of non-empty sets is non-empty. 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 the collection is infinite. Formally, it states that for every indexed family of nonempty sets there exists an indexed family of elements such that for every . The axiom of choice was formulated in 1904 by Ernst Zermelo in order to formalize his proof of the well-ordering theorem.

In mathematics, the axiom of regularity is an axiom of Zermelo–Fraenkel set theory that states that every non-empty set A contains an element that is disjoint from A. In first-order logic, the axiom reads:

Naive set theory is any of several theories of sets used in the discussion of the foundations of mathematics. Unlike axiomatic set theories, which are defined using formal logic, naive set theory is defined informally, in natural language. It describes the aspects of mathematical sets familiar in discrete mathematics, and suffices for the everyday use of set theory concepts in contemporary mathematics.

First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over non-logical objects, and allows the use of sentences that contain variables, so that rather than propositions such as "Socrates is a man", one can have expressions in the form "there exists x such that x is Socrates and x is a man", where "there exists" is a quantifier, while x is a variable. This distinguishes it from propositional logic, which does not use quantifiers or relations; in this sense, propositional logic is the foundation of first-order logic.

In mathematical logic, the Peano axioms, also known as the Dedekind–Peano axioms or the Peano postulates, are axioms for the natural numbers presented by the 19th century Italian mathematician Giuseppe Peano. These axioms have been used nearly unchanged in a number of metamathematical investigations, including research into fundamental questions of whether number theory is consistent and complete.

In mathematics, open sets are a generalization of open intervals in the real line. In a metric space—that is, when a distance is defined—open sets are the sets that, with every point P, contain all points that are sufficiently near to P.

In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom of extensionality, or axiom of extension, is one of the axioms of Zermelo–Fraenkel set theory.

In mathematical logic, the compactness theorem states that a set of first-order sentences has a model if and only if every finite subset of it has a model. This theorem is an important tool in model theory, as it provides a useful method for constructing models of any set of sentences that is finitely consistent.

In set theory, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is an axiomatic system that was proposed in the early twentieth century in order to formulate a theory of sets free of paradoxes such as Russell's paradox. Today, Zermelo–Fraenkel set theory, with the historically controversial axiom of choice (AC) included, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics. Zermelo–Fraenkel set theory with the axiom of choice included is abbreviated ZFC, where C stands for "choice", and ZF refers to the axioms of Zermelo–Fraenkel set theory with the axiom of choice excluded.

In mathematics, an empty product, or nullary product or vacuous product, is the result of multiplying no factors. It is by convention equal to the multiplicative identity, just as the empty sum—the result of adding no numbers—is by convention zero, or the additive identity.

In axiomatic set theory and the branches of mathematics and philosophy that use it, the axiom of infinity is one of the axioms of Zermelo–Fraenkel set theory. It guarantees the existence of at least one infinite set, namely a set containing the natural numbers. It was first published by Ernst Zermelo as part of his set theory in 1908.

A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra. It consists of a partially ordered set in which every two elements have a unique supremum and a unique infimum. An example is given by the natural numbers, partially ordered by divisibility, for which the unique supremum is the least common multiple and the unique infimum is the greatest common divisor.

Internal set theory (IST) is a mathematical theory of sets developed by Edward Nelson that provides an axiomatic basis for a portion of the nonstandard analysis introduced by Abraham Robinson. Instead of adding new elements to the real numbers, Nelson's approach modifies the axiomatic foundations through syntactic enrichment. Thus, the axioms introduce a new term, "standard", which can be used to make discriminations not possible under the conventional axioms for sets. Thus, IST is an enrichment of ZFC: all axioms of ZFC are satisfied for all classical predicates, while the new unary predicate "standard" satisfies three additional axioms I, S, and T. In particular, suitable nonstandard elements within the set of real numbers can be shown to have properties that correspond to the properties of infinitesimal and unlimited elements.

In mathematical logic, positive set theory is the name for a class of alternative set theories in which the axiom of comprehension

In the foundations of mathematics, Morse–Kelley set theory (MK), Kelley–Morse set theory (KM), Morse–Tarski set theory (MT), Quine–Morse set theory (QM) or the system of Quine and Morse is a first order axiomatic set theory that is closely related to von Neumann–Bernays–Gödel set theory (NBG). While von Neumann–Bernays–Gödel set theory restricts the bound variables in the schematic formula appearing in the axiom schema of Class Comprehension to range over sets alone, Morse–Kelley set theory allows these bound variables to range over proper classes as well as sets, as first suggested by Quine in 1940 for his system ML.

In universal algebra and in model theory, a structure consists of a set along with a collection of finitary operations and relations that are defined on it.

Constructive set theory is an approach to mathematical constructivism following the program of axiomatic set theory. The same first-order language with "" and "" of classical set theory is usually used, so this is not to be confused with a constructive types approach. On the other hand, some constructive theories are indeed motivated by their interpretability in type theories.

General set theory (GST) is George Boolos's (1998) name for a fragment of the axiomatic set theory Z. GST is sufficient for all mathematics not requiring infinite sets, and is the weakest known set theory whose theorems include the Peano axioms.

In mathematics, the intersection of two sets A and B, denoted by AB, is the set containing all elements of A that also belong to B.

## References

1. "Comprehensive List of Set Theory Symbols". Math Vault. 2020-04-11. Retrieved 2020-08-11.
2. Weisstein, Eric W. "Empty Set". mathworld.wolfram.com. Retrieved 2020-08-11.
3. Rudin, Walter (1976). Principles of Mathematical Analysis (3rd ed.). McGraw-Hill. p. 300. ISBN   007054235X.
4. e.g. Nina Grønnum (2005, 2013) Fonetik og Fonologi: Almen og dansk. Akademisk forlag, Copenhagen.
5. Bruckner, A.N., Bruckner, J.B., and Thomson, B.S. (2008). Elementary Real Analysis , 2nd edition, p. 9.
6. D. J. Darling (2004). The Universal Book of Mathematics. John Wiley and Sons. p. 106. ISBN   0-471-27047-4.
7. E. J. Lowe (2005). Locke. Routledge. p. 87.
8. George Boolos (1984), "To be is to be the value of a variable", The Journal of Philosophy 91: 430–49. Reprinted in 1998, Logic, Logic and Logic (Richard Jeffrey, and Burgess, J., eds.) Harvard University Press, 54–72.