Fact-checked by Grok 2 weeks ago

Empty set

In , the empty set, also known as the or void set, is the unique set that contains no elements, serving as a foundational concept in . It is denoted by the symbol ∅ (phi) or sometimes by empty curly braces {}, and its —the number of elements it contains—is zero. This set exists by the axiom of the empty set in Zermelo-Fraenkel set theory (ZF), which asserts that there is a set with no members, ensuring a starting point for constructing all other sets without relying on prior elements. Its uniqueness follows from the , which states that two sets are equal if they have the same elements; since ∅ has none, no other set matches it. The empty set plays a crucial role in the structure of , acting as a of every possible set because there are no elements in ∅ that fail to belong to any other set A (i.e., ∅ ⊆ A for all A). It forms the basis for defining natural numbers in the von Neumann construction, where 0 is identified with ∅, 1 with {∅}, and so on, enabling the representation of ordinals and cardinals. In the cumulative hierarchy of sets, the empty set populates the lowest level V₀ = ∅, from which higher levels build the entire set-theoretic universe V. Additionally, the power set of the empty set is {∅}, the containing only itself, illustrating its self-referential yet non-contradictory nature. Properties of the empty set extend to various mathematical contexts, such as , where it is both open and closed in any , and , where it can form degenerate structures like a but not a due to the absence of an . In , ∅ is the initial object in the (Set), characterized by a unique to any other set, underscoring its universal mapping properties. These attributes highlight the empty set's paradoxical yet essential status: empty of content, yet indispensable for rigorous mathematical foundations.

Definition and Notation

Definition

In set theory, the empty set is defined as the set that contains no elements whatsoever. This concept serves as a foundational building block, representing the absence of any membership in a collection. Formally, a set S is empty if, for every object x in the universe of discourse, x does not belong to S; in logical terms, this is expressed as \forall x (x \notin S). This condition ensures that no object satisfies the membership relation with respect to the empty set, distinguishing it from any non-empty set, which has at least one element that does belong to it. The empty set is unique within the universe of sets, as the guarantees that any two sets with exactly the same elements are identical, and since both would have no elements, they must coincide. This uniqueness positions the empty set as a singular, prerequisite object essential for constructing all other sets in axiomatic frameworks.

Notation

The standard symbol for the empty set is ∅, a slashed circle introduced by as part of the Bourbaki group's work in 1939, inspired by the letter Ø to represent the set with no elements. Prior to this, historical variants included the empty braces {} and the uppercase lambda Λ, the latter used by in his 1889 Arithmetices principia to denote the null class. In mathematical literature and print, ∅ is the predominant notation for the empty set, emphasizing its formal status in . However, in informal texts, programming languages, and some computational contexts, the empty braces {} are commonly employed to represent it, as seen in languages like , where set() denotes an empty set, while {} denotes an empty (which may cause confusion in contexts where both are used). In typesetting, particularly with , two main commands produce variants of the symbol: \emptyset, which renders a slashed zero-like form (∅), and \varnothing from the amssymb package, which produces a more circular slashed version (∅); the former has become dominant in modern digital due to its adoption in systems like by in 1979. To avoid ambiguity, the empty set symbol ∅ is distinguished from similar characters: it differs from the Greek lowercase φ (often used for functions or angles) and the Latin capital (U+00D8), which is a distinct letter not intended for mathematical sets.

Basic Properties

Equality and Cardinality

The empty set is unique in the sense that there is exactly one such set in any given universe of discourse. This follows from the , which states that two sets are equal they have precisely the same elements: if A and B are both empty, then for all x, x \in A if and only if x \in B holds vacuously, since no x satisfies the antecedent, implying A = B. Thus, no distinct empty sets can exist. The of the empty set, denoted |\emptyset|, is . measures the "size" of a set via the of a to a representative; the empty set admits a only to itself, and is the unique corresponding to this of sets with no elements. In foundational systems such as those using von Neumann ordinals, the natural number is defined as the empty set itself, reinforcing that |\emptyset| = [0](/page/0). The empty set is the unique set possessing zero elements and thus cannot be equal to any non-empty set, as the latter contains at least one element, violating extensionality. While the empty set is a subset of every set, it equals only itself among all sets.

Membership and Subsets

The empty set contains no elements, meaning that for every object x, x \notin \emptyset. This property ensures that any statement of the form \forall x (x \in \emptyset \to P(x)) is vacuously true for any predicate P(x), as the premise x \in \emptyset never holds. A key consequence is the empty set's role as a universal subset: \emptyset \subseteq A for every set A. This follows from the definition of , which requires \forall x (x \in \emptyset \to x \in A); since no x satisfies x \in \emptyset, the holds vacuously. The power set of the empty set, denoted \mathcal{P}(\emptyset), consists solely of the empty set itself, so \mathcal{P}(\emptyset) = \{\emptyset\}. This yields a cardinality of |\mathcal{P}(\emptyset)| = 1, as there are no other subsets possible. Since \emptyset has no proper subsets, it serves as the terminal element in any strictly decreasing chain of subsets under inclusion, preventing infinite descent within the subset lattice of any set. This property underpins well-foundedness in set-theoretic constructions, ensuring that descending chains of subsets terminate.

Operations and Algebraic Structure

Union and Intersection

The union of the empty set with any set A results in A itself, as the empty set contributes no elements to the collection.\] $\emptyset \cup A = A$ for all sets $A$.\[ This property establishes the empty set as the in the of sets under .$$] In contrast, the intersection of the empty set with any set A yields the empty set, since there are no elements common to both.[ $\emptyset \cap A = \emptyset$ for all sets $A$.] Thus, the empty set acts as an absorbing element for the operation, where intersecting with \emptyset nullifies any set.[$$ Regarding set difference, removing the empty set from any set A leaves A unchanged, as no elements are subtracted.\] $A \setminus \emptyset = A$ for all sets $A$.\[ Conversely, the difference of the empty set minus any set A remains empty, since \emptyset has no elements to retain after exclusion.\] $\emptyset \setminus A = \emptyset$ for all sets $A$.\[ Within a fixed U, the complement of the empty set is U itself, encompassing all elements not in \emptyset.\] $\overline{\emptyset} = U$.\[ This underscores the empty set's role as the minimal element whose negation covers the entire universe.[]

Cartesian Products and Functions

The Cartesian product of the empty set with any other set is empty. For sets A and B, the A \times B consists of all ordered pairs (a, b) such that a \in A and b \in B. If A = \emptyset and B is any set (empty or non-empty), no such pairs exist because there are no elements in A to form the first component, so \emptyset \times B = \emptyset. Similarly, A \times \emptyset = \emptyset for any set A, and thus \emptyset \times \emptyset = \emptyset. In the context of functions, the empty set admits a unique function to any set. A function f: \emptyset \to S for any set S is a subset of \emptyset \times S that relates every element of \emptyset to exactly one element in S; since \emptyset \times S = \emptyset, the only such subset is the empty set itself, called the empty function. This empty function exists and is unique regardless of whether S is empty or non-empty. In particular, the unique function \emptyset \to \emptyset is also the empty function. Relations involving the empty set follow similarly from the structure. A on sets A and B is any of A \times B; the empty relation is the empty set \emptyset, which is a valid of any , including \emptyset \times \emptyset = \emptyset. Thus, the empty holds vacuously on the empty set. These properties imply that the empty set serves as the initial object in the (denoted Set), where objects are sets and s are s. An initial object I requires a unique I \to X for every object X; here, the unique empty \emptyset \to X satisfies this for any set X, and the empty set is the unique such object up to .

Role in

Axiomatic Foundations

In axiomatic set theory, particularly Zermelo-Fraenkel set theory (ZF), the existence of the empty set is postulated by the empty set axiom, which asserts that there exists a set S such that for all x, x \notin S, formally stated as \exists S \, \forall x \, \neg (x \in S). This axiom ensures the foundation for constructing all other sets, as it provides the initial object from which further structures are built. In some formulations of ZF, the empty set axiom is considered redundant and can be derived using the axiom of pairing and the axiom schema of separation: given any set x, the separation schema yields the subset \{ y \in x \mid y \neq y \}, which contains no elements since the condition y \neq y is always false, thus producing the empty set. The uniqueness of the empty set follows directly from the , which states that two sets are equal if they have the same elements: \forall x \forall y \, (\forall z (z \in x \leftrightarrow z \in y) \to x = y). To see this, suppose A and B are sets with no elements. Then for any z, z \notin A and z \notin B, so z \in A \leftrightarrow z \in B holds vacuously for all z. By , A = B. Thus, there is exactly one empty set, conventionally denoted \emptyset. The empty set plays a central role in the von Neumann construction of the natural numbers within ZF set theory. Here, the number zero is defined as $0 = \emptyset, the successor of a set x is S(x) = x \cup \{x\}, and the natural numbers are built iteratively: $1 = S(0) = \{\emptyset\}, $2 = S(1) = \{\emptyset, \{\emptyset\}\}, and so on. This construction identifies each natural number n with the set of all preceding natural numbers, ensuring that the ordinals are transitive sets well-ordered by membership, as formalized in von Neumann's axiomatization. The empty set also serves as the base of the cumulative hierarchy in , denoted V_\alpha for ordinals \alpha, which organizes all sets by their rank. Specifically, V_0 = \emptyset, and for successor ordinals, V_{\alpha+1} = \mathcal{P}(V_\alpha) (the power set of V_\alpha), while for limit ordinals \lambda, V_\lambda = \bigcup_{\beta < \lambda} V_\beta. This hierarchy, introduced by , captures the iterative process of set formation starting from the empty set, underpinning the structure of the entire of sets V = \bigcup_{\alpha} V_\alpha.

Universal and Initial Object

In , the empty set \emptyset serves as the initial object in the \mathbf{Set}, whose objects are sets and morphisms are functions between them. An initial object I in a \mathcal{C} is an object such that, for every object A in \mathcal{C}, there exists a unique ! : I \to A. In \mathbf{Set}, this unique from \emptyset to any set A is the empty function, which exists regardless of whether A is empty or non-empty, as there are no elements in \emptyset to map. This uniqueness arises because any purported function f : \emptyset \to A must satisfy the function definition for all elements in the domain, but since the domain \emptyset contains no elements, the condition is vacuously true for the empty assignment, and no other assignment is possible. Initial objects are unique up to unique isomorphism: if I and J are both initial objects in \mathcal{C}, then there exists a unique isomorphism I \to J, ensuring that \emptyset is the only initial object in \mathbf{Set} up to this equivalence. While \emptyset is not a terminal object in \mathbf{Set}—terminal objects in \mathbf{Set} are sets, for which there is a unique from any set B to the —the empty set does act as a object in other categories built on sets, such as the category \mathbf{Rel} of sets and relations, where it is both and . In categories where the coincide to form a zero object, such as \emptyset in \mathbf{Rel}, this object enables the construction of a zero between any pair of objects X and Y, defined as the composite X \to \emptyset \to Y via the unique s; this zero composes appropriately and simplifies limits, colimits, and exact sequences in additive or pointed categories.

Applications in Mathematics

Topology and Geometry

In topology, the empty set ∅ serves as the underlying set for the empty topological space, which admits a unique consisting solely of ∅ itself. This structure is both and indiscrete, as the power set of ∅ coincides with the , satisfying the axioms vacuously while having no proper . The interior of ∅ in any is ∅, being the largest open contained within it, and its closure is also ∅, as the smallest containing it. By definition, ∅ is open in every , as topologies must include the empty set to ensure arbitrary s (including the empty union) yield open sets. Similarly, ∅ is closed, since its complement is the entire , which is open, or equivalently, as the empty of closed sets. These properties hold universally, independent of the specific on a nonempty . The empty set exhibits compactness vacuously in any : every open cover of ∅ has a finite subcover, namely the empty collection, as there are no points to cover. It is also connected, since it cannot be expressed as a union of two nonempty disjoint open sets—any such decomposition would require nonempty components, which ∅ lacks. In geometry, ∅ functions as the empty manifold, which satisfies the axioms of a smooth or topological manifold of any dimension vacuously and is included in definitions for convenience in cobordism and homotopy theory. For instance, in oriented cobordism, the empty manifold acts as the unit element under disjoint union. In simplicial complexes, ∅ is the unique (-1)-simplex, serving as the base case where the empty complex has dimension -1 and includes no higher simplices, facilitating inductive constructions in algebraic topology. This role underscores ∅ as the initial object in geometric decompositions, such as the absence of 0-simplices in void structures.

Category Theory and Algebra

In category theory, the empty set \emptyset serves as a foundational example of an initial object, extending its properties from the to broader algebraic and categorical structures. In the , \emptyset is initial because there exists a unique from \emptyset to any set X, namely the empty . This notion generalizes to other categories where structures analogous to \emptyset—such as trivial or zero objects—play the role of initial objects, ensuring unique morphisms to every other object in the . In the category of groups \mathbf{Grp}, the trivial group \{e\} (with e the identity) corresponds to the empty set in the sense that it is the initial object, as there is a unique group homomorphism from \{e\} to any group G, sending e to the identity of G. Similarly, in the category of rngs \mathbf{Rng} (rings without multiplicative identity), the zero ring (with a single element $0where0+0=0and0 \cdot 0=0) is the initial object, admitting a unique rng homomorphism to any rng R, which maps &#36;0 to $0_R. These examples illustrate how the "emptiness" of \emptyset manifests as minimal algebraic structures that initiate homomorphisms universally. The empty set also relates to free constructions in , where the on the empty set of generators yields the algebra in the corresponding . For instance, the free monoid on the empty set is the trivial monoid (singleton with ), which is in the category of s \mathbf{Mon}, as it generates unique monoid homomorphisms to any monoid by mapping the to the target's . This pattern holds across algebraic categories: the on no generators is the , in \mathbf{Grp}; the free rng on no generators is the zero rng, initial in \mathbf{Rng}. Such free structures on \emptyset thus coincide with the objects, providing a generative on minimality. In , the empty space (the with underlying set \emptyset) acts as the initial object in the homotopy category of topological spaces \mathbf{Ho}(\mathbf{Top}), where morphisms are classes of continuous maps. There is a unique class from the empty space to any space Y, corresponding to the empty map, preserving the initiality of \emptyset under . This underscores the empty set's role in capturing "nothingness" as a starting point even in geometric and homotopical abstractions. However, the empty set's analogue is not always initial across all algebraic categories. For example, the category of fields \mathbf{[Field](/page/Field)} has no object, as no admits a unique to every other —homomorphisms between fields of different are impossible, and even within the same , no source exists. This limitation highlights that while \emptyset initializes many categories, structural constraints like no zero divisors in prevent a direct counterpart.

Analysis and Measure Theory

In measure theory, the empty set is always measurable, and its is defined to be zero, \mu(\emptyset) = 0. This property follows directly from the axioms of measure, where the measure of the empty set is required to be zero to ensure consistency with the additivity over s; for instance, since \emptyset is the of itself and itself, \mu(\emptyset) = \mu(\emptyset) + \mu(\emptyset) implies \mu(\emptyset) = 0. The additivity of the Lebesgue measure further reinforces this, as the empty set contributes nothing to the measure of any union, allowing it to serve as the in the sigma-algebra of measurable sets. The role of the empty set extends to integration in real analysis. For any integrable function f, the Lebesgue integral over the empty set is zero: \int_{\emptyset} f \, d\mu = 0. This result holds because the integral over a set of measure zero, such as \emptyset, is the integral of the zero function almost everywhere, and the Lebesgue integral of the zero function is zero by definition. This property ensures that integrals remain well-defined and finite even when the domain of integration is empty, avoiding pathological behaviors in limits or sums that might otherwise involve undefined operations. In , which builds on measure theory with the normalized to total measure one, the empty —the consisting of no outcomes—has probability zero: P(\emptyset) = 0. This follows from the axioms of probability, where the empty set is disjoint from any A, so P(A) = P(A \cup \emptyset) = P(A) + P(\emptyset), implying P(\emptyset) = 0. Consequently, the empty represents an impossible occurrence, providing a foundational null case for probability spaces. The empty set also plays a stabilizing role in analysis involving the extended real numbers, where expressions like -\infty + \infty are left . By convention in the extended reals, the supremum of \emptyset is -\infty and the infimum is +\infty, which allows limits and extrema over potentially empty sets to be handled uniformly without introducing indeterminate forms in applications such as optimization or theorems. This convention ensures that analytic constructions, like those in measure-theoretic limits, remain consistent even when no elements are present.

Historical and Philosophical Aspects

Historical Development

The concept of the empty set, denoting a collection containing no elements, emerged gradually in the history of mathematics, with roots in the treatment of nothingness and voids. In ancient Greek mathematics, such as Euclid's Elements (c. 300 BC), there was no explicit recognition of an empty collection or zero, as Greek philosophy generally rejected the idea of void or non-being, leading to a mathematics focused on positive quantities and filled spaces. Similarly, the Indian Sulba Sutras (c. 800–200 BC), which detail geometric constructions for Vedic altars, emphasize practical measurements and approximations but offer no direct treatment of emptiness, though later Indian developments of shunya (void or zero) in philosophical and numerical contexts foreshadowed ideas of absence. The 19th century marked the first formal introductions of the empty set in logical and set-theoretic contexts. George Boole, in his 1847 work The Mathematical Analysis of Logic, incorporated the "empty class" or "nothing" as the complement of the universe of discourse, representing a class with no members and assigning it the symbol 0 in his algebraic logic of classes. Giuseppe Peano, in his 1889 pamphlet Arithmetices principia, nova methodo exposita, used the symbol Λ to denote the null class in his axiomatization of arithmetic, though this notation created ambiguities by overlapping with symbols for falsehood in logical expressions. Georg Cantor advanced the concept significantly in the 1880s through his theory of transfinite numbers and point sets; in his 1880 paper "Über unendliche, lineare Punktmannigfaltigkeiten, V," he denoted the absence of points with the letter O, treating the empty collection as a valid set with cardinality zero in his hierarchy of infinities. In the , the empty set gained axiomatic prominence in foundational systems. Ernst Zermelo's 1908 paper "Untersuchungen über die Grundlagen der Mengenlehre I" provided the first axiomatic , where the existence of the empty set follows as a from the of separation applied to any set with the contradictory property (e.g., the where no satisfies x ≠ x), ensuring its role as a building block for all sets. , in his 1918 monograph Das Kontinuum: Kritische Untersuchungen über die Grundlagen der Analysis, formalized aspects of analysis using predicative methods inspired by Poincaré and , incorporating the empty set as the foundational null domain from which constructive sequences of sets are built to avoid impredicative definitions. Later, the collective work of the Bourbaki group, beginning in with their , emphasized a structuralist on , positioning the empty set as the unique initial object in the —defined rigorously as the set y such that ∀x (x ∉ y)—central to their axiomatic treatment of structures like groups, topologies, and algebras.

Philosophical Debates

The ontological status of the has been a point of contention in , particularly regarding whether it truly "exists" as a set or merely subsists in some abstract sense. , in his early work, argued that the null class—the class with no members—does not in the sense of having instances, but it subsists as a formal structure necessary for logical consistency. This distinction allows the empty set to function mathematically without committing to the existence of nonexistent objects, avoiding paradoxes like those in where nonexistents are treated as having being. Critics, however, question whether such subsistence amounts to a watered-down form of , rendering the empty set an ontological rather than a robust entity. Epistemologically, the empty set raises issues with vacuous truths, statements that hold true solely because their subject is empty, such as "all elements of the empty set are even numbers." These truths challenge intuitive understanding, as they seem to assert properties over nothing, yet they are logically valid under classical semantics where over an empty yields truth. Philosophers whether such vacuity undermines epistemic , with some arguing it reflects a mismatch between formal and human cognition, potentially leading to over-acceptance of counterintuitive claims. Others defend vacuous truths as essential for preserving deductive closure in , emphasizing that must yield to rigorous proof. In , L.E.J. Brouwer's constructive accommodates the empty set by defining it as the with no realizable elements, integrating it without violating constructivist principles that require mathematical entities to be mentally constructible through finite processes. However, later intuitionist G.F.C. Griss proposed a stricter "negationless" that rejected the empty set, viewing it as incompatible with the absence of and the need for inhabited domains. Mereology, the theory of part-whole relations, contrasts the empty set with pure absence by debating the inclusion of a "null individual"—an that is a part of everything yet overlaps with substantial. Proponents of classical often reject such a null item to avoid trivializing the into a single element, preferring absence as a non-entity rather than an empty fusion of parts. This highlights tensions between set-theoretic emptiness, which posits a structured void, and mereological nothingness, which denies any such structure to prevent ontological inflation.

References

  1. [1]
    Empty Set -- from Wolfram MathWorld
    The empty set is generally designated using { } (ie, the empty list) in the Wolfram Language. A set that is not the empty set is called a nonempty set.
  2. [2]
  3. [3]
  4. [4]
  5. [5]
  6. [6]
  7. [7]
    empty set in nLab
    ### Summary of Empty Set from nLab
  8. [8]
    [PDF] Naive set theory. - Whitman People
    We begin by observing that a set is either empty or it is not, and, if it is not, then, by the definition of the empty set, thereis an element in it. This ...
  9. [9]
    Basic concepts - SIUE
    Definition2.1.​​ The empty set is the set with no elements. In particular, the empty set is the unique set for which the statement (∀x,x∉∅) ( ∀ x , x ∉ ∅ ) is ...Missing: S | Show results with:S
  10. [10]
    [PDF] Proposal to Represent the Slashed Zero Variant of Empty Set
    Oct 30, 2015 · According to his autobiography, Weil used the capital letter Ø of the Norwegian alpha- bet to create the symbol, as shown in Figure 1 [Weil].<|control11|><|separator|>
  11. [11]
    How did mathematicians notate the empty set before $\varnothing
    Jul 8, 2015 · Peano used Λ for both null class and "false" in his axiomatization of arithmetic in 1889, but Zermelo axiomatizing set theory in 1908 went back ...
  12. [12]
    Empty set literal? - python - Stack Overflow
    May 25, 2011 · The same notation that works for non-empty dict/set works for empty ones. Notice the difference between non-empty dict and set literals: {1: 'a' ...
  13. [13]
    nothing, \varnothing and \emptyset - TeX - LaTeX Stack Exchange
    Sep 15, 2011 · The command \varnothing is defined by the amssymb package, and \emptyset is defined by TeX itself, but neither defines \nothing. Is \nothing defined by ...Nice looking empty set? - math mode - LaTeX Stack Exchangevarnothing no different from \emptyset - TeX - LaTeX Stack ExchangeMore results from tex.stackexchange.com
  14. [14]
    Set Theory - Stanford Encyclopedia of Philosophy
    Oct 8, 2014 · Null Set: There exists a set, denoted by \({\varnothing}\) and called the empty set, which has no elements. Pair: Given any sets \(A\) and ...
  15. [15]
    Basic set theory - Stanford Encyclopedia of Philosophy
    In particular, there is only one set with no elements at all. This set is called, naturally, the empty set, and is represented by the symbol \({\varnothing}\).
  16. [16]
    Finite Set -- from Wolfram MathWorld
    elements. The empty set is also considered as a finite set, and its cardinal number is 0. A finite set can also be characterized as a set which ...
  17. [17]
    [PDF] fundamentals of zermelo-fraenkel set theory - UChicago Math
    Aug 23, 2011 · Axiom of Extensionality. If every element of X is an element ... But though the empty set is unique, a set containing one element is not.
  18. [18]
    None
    ### Definitions and Properties of the Empty Set
  19. [19]
    [PDF] Chapter 5 Sets
    Vacuously true statements typically occur when you are trying to apply a definition or theorem to a special case involving an abnormally small or simple object ...
  20. [20]
    [PDF] set-theory.pdf
    Sep 15, 2010 · Notice that the powerset of A always contains the empty set, regardless of what's in A. As a consequence, P(∅) = {∅}. If A and B are two sets, ...
  21. [21]
    [PDF] Sets and set operations
    Definition: Given a set S, the power set of S is the set of all subsets of S. The power set is denoted by P(S). Examples: • Assume an empty set ∅. • ...
  22. [22]
    [PDF] Transfinite Induction - Penn Math
    A totally ordered set (S, ≤) is said to be well ordered if there is no infinite descending chain x1 > x2 > x3 > ··· in S. Equivalently, every non-empty subset ...Missing: descent | Show results with:descent
  23. [23]
    Cartesian product - PlanetMath.org
    Mar 22, 2013 · For any sets A A and B B , the Cartesian product A×B A × B is the set consisting of all ordered pairs (a,b) ( a , b ) where a∈A a ∈ A and b∈B b ...
  24. [24]
    functions from empty set - PlanetMath
    Mar 22, 2013 · It turns out that functions from the empty set are important because they make the empty set be an initial object.
  25. [25]
    Definition of n-ary Relation
    The empty set is certainly a set of ordered n-tuples. Therefore it is a relation. It is called the empty relation. The Cartesian product A1 ... An ...
  26. [26]
    Section 4.12 (002B): Initial and final objects—The Stacks project
    In the category of sets the empty set \emptyset is an initial object, and in fact the only initial object. Also, any singleton, i.e., a set with one element, ...
  27. [27]
    [PDF] The Axioms of Set Theory ZFC
    The Axiom of Empty Set. ∃x∀z(z /∈ x). This axiom postulates the existence of a set without any elements, i.e., an empty set. 1. The Axiom of Extensionality.
  28. [28]
    Zermelo-Fraenkel set theory
    Extensionality ... This axiom asserts the existence of the null (empty) set. It can be proven from this axiom and the previous axiom that such a set is unique.
  29. [29]
    Eine Axiomatisierung der Mengenlehre. - EuDML
    Neumann, J. von. "Eine Axiomatisierung der Mengenlehre.." Journal für die reine und angewandte Mathematik 154 (1925): 219-240. <http://eudml.org/doc/149573> ...
  30. [30]
    terminal object in nLab
    ### Definition of Terminal Object
  31. [31]
    How can I define a topology on the empty set? - Math Stack Exchange
    Jul 9, 2015 · There is only one topology on the empty set, it is {∅}. In this case, the empty set and the whole set are the same.
  32. [32]
    [PDF] An outline summary of basic point set topology - UChicago Math
    A topology on a set X is a set of subsets, called the open sets, which satisfies the following conditions. (i) The empty set ∅ and the set X are open. (ii) ...
  33. [33]
    Is the empty set compact in R? - Math Stack Exchange
    Sep 14, 2020 · The empty set is a subset of any set. In particular it is included in open balls ∅⊂B(0,r) so it is bounded.general topology - A compact open set - Mathematics Stack ExchangeHow can I define a topology on the empty set? - Math Stack ExchangeMore results from math.stackexchange.com
  34. [34]
    What does it mean for the empty set to be connected and totally ...
    Jan 28, 2016 · A space is connected if it cannot be written as union of two non-empty disjoint open subsets. A space is disconnected if it is not connected.Empty space connected? If so, then what are its components?Is the empty set a topological space? - Math Stack ExchangeMore results from math.stackexchange.com
  35. [35]
    [PDF] Lecture 15: - Purdue Math
    It follows as a special case that the empty manifold is assigned the groundfield, 𝑍(∅) = C. In particular, a closed 𝑑-dimensional manifold (i.e. a cobordism ...
  36. [36]
    [PDF] 6 Simplicial complexes
    For example, a graph is a one-dimensional abstract simplicial complex. Being a set system, A defines the poset (A, C), where C denotes set inclusion, see figure ...
  37. [37]
    [PDF] Simplicial Complexes - People @EECS
    Feb 4, 1999 · The sets meet in triplets but not in quadruplets, which implies that the nerve is 2-dimensional. to a vertex, and k+ 1 sets with non-empty ...
  38. [38]
    Category of rings - Wikipedia
    The ring of integers Z is an initial object in Ring. · The zero ring is a terminal object in Ring. · The product in Ring is given by the direct product of rings.As a concrete category · Properties · Related categories and functors
  39. [39]
    How Free and Initial algebras relate? - Math Stack Exchange
    Sep 20, 2023 · In the examples of groups or rings, for instance, the initial algebra is the free algebra over an empty set of generators. Daniel Schepler.abstract algebra - Usage of the term "Free" - Math Stack ExchangeIs the free group on an empty set defined? - Math Stack ExchangeMore results from math.stackexchange.com
  40. [40]
    What category without initial object do you care about? - MathOverflow
    Aug 27, 2010 · The category of varieties (or just integral schemes) has no initial object. (The empty set is not irreducible; this does not prove my claim ...<|control11|><|separator|>
  41. [41]
    [PDF] The Lebesgue Integral
    Before we can discuss the the Lebesgue integral, we must first discuss “measures.” Given a set X, a measure is, loosely-speaking, a map that assigns sizes ...
  42. [42]
    [PDF] Chapter 2: Lebesgue Measure - UC Davis Math
    (bn − an). If n = 1 or n = 2, the volume of a rectangle is its length or area, respectively. We also consider the empty set to be a rectangle with µ(∅) = 0.
  43. [43]
    Impossible event - StatLect
    The impossible event has zero probability. One of the basic properties of probability is that the empty set must have zero probability (see the lecture on ...<|control11|><|separator|>
  44. [44]
    Infimum and supremum of the empty set - Math Stack Exchange
    Jun 29, 2013 · It is customary to define the infimum of the empty set as being ∞. This makes sense since the infimum is the greatest lower bound and every real number is a ...Why is the empty set bounded? - Math Stack ExchangeWhat is the infimum/supremum of a set in the extended real line?More results from math.stackexchange.com
  45. [45]
    II. Sulba Sutras - Indian Mathematics - Redressing the balance
    The Sulba-sutras have been dated from around 800-200 BC, and further to the expansion of topics in the Vedangas, contain a number of significant developments.
  46. [46]
    Giuseppe Peano - Biography
    ### Summary of Peano's Notation for Empty Set in 1889
  47. [47]
    Zermelo's Axiomatization of Set Theory
    Jul 2, 2013 · This final axiom asserts the existence of an infinitely large set which contains the empty set, and for each set a that it contains, also ...Missing: descent | Show results with:descent
  48. [48]
    Hermann Weyl - Stanford Encyclopedia of Philosophy
    Sep 2, 2009 · The year 1918, the same year in which Space-Time-Matter appeared, also saw the publication of Das Kontinuum (The Continuum), a work in which ...
  49. [49]
    (PDF) WEYL REEXAMINED: “DAS KONTINUUM” 100 YEARS LATER
    Jun 10, 2020 · We propose a precise formalization of that system, which is the first to be completely faithful to what is written in the book. Finally, we ...<|control11|><|separator|>
  50. [50]
    Nonexistent Objects - Stanford Encyclopedia of Philosophy
    Aug 22, 2006 · Russell argues that since it is a principle of MOT\(^o\) that to every set of properties there is a corresponding object and since existence is ...
  51. [51]
    On the Onto-Epistemological Status of the Empty Set and the Pure ...
    Jun 26, 2021 · This article discusses the quiddity of the empty set from its epistemological and linguistic aspects. It consists of four parts.
  52. [52]
    Why a Gricean-style defense of the vacuous truth of ...
    Jan 5, 2024 · The paper analyzes two approaches to explaining why certain counterpossibles, though perhaps true, may appear to be false.
  53. [53]
    Logical Truth - Stanford Encyclopedia of Philosophy
    May 30, 2006 · A logical truth ought to be such that it could not be false, or equivalently, it ought to be such that it must be true.The Nature of Logical Truth · Modality · Formality · The Mathematical...
  54. [54]
    Intuitionism in the Philosophy of Mathematics
    Sep 4, 2008 · 3.2 Intuitionistic logic. Brouwer rejected the principle of the excluded middle on the basis of his philosophy, but Arend Heyting was the ...
  55. [55]
    Mereology - Stanford Encyclopedia of Philosophy
    May 13, 2003 · Absent (P.1) or (P.2), (P.4′) is logically stronger. Yet again one may rely on the alternative definition of ' ...