\(\DeclarePairedDelimiterX{\Set}[2]{\{}{\}}{#1 \nonscript\;\delimsize\vert\nonscript\; #2}\) \( \DeclarePairedDelimiter{\set}{\{}{\}}\) \( \DeclarePairedDelimiter{\parens}{\left(}{\right)}\) \(\DeclarePairedDelimiterX{\innerproduct}[1]{\langle}{\rangle}{#1}\) \(\newcommand{\ip}[1]{\innerproduct{#1}}\) \(\newcommand{\bmat}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\barray}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\mat}[1]{\begin{matrix}#1\end{matrix}}\) \(\newcommand{\pmat}[1]{\begin{pmatrix}#1\end{pmatrix}}\) \(\newcommand{\mathword}[1]{\mathop{\textup{#1}}}\)
Needs:
Set Specification
Needed by:
Set Complements
Set Intersections
Set Unions
Links:
Sheet PDF
Graph PDF

Empty Set

Why

Can a set have no elements?

Definition

Sure. A set exists by the principle of existence (see Sets); denote it by $A$. Specify elements (see Set Specification) of any set that exists using the universally false statement $x \neq x$. We denote that set by $\Set{x \in A}{x \neq x}$. It has no elements. In other words, $(\forall x)(x \not\in A)$. The principle of extension (see Set Equality) says that the set obtained is unique (contradiction).1 We call the unique set with no elements the empty set. If a set is not the empty set, we call it nonempty.

Notation

We denote the empty set by $\varnothing$.

Properties

It is immediate from our definition of the empty set and of the definition of inclusion (see Set Inclusion) that the empty set is included in every set (including itself).

$(\forall A)(\varnothing \subset A)$
Suppose toward contradiction that $\varnothing \not\subset A$. Then there exists $y \in \varnothing$ such that $y \not\in A$. But this is impossible, since $(\forall x)(x \not\in \varnothing)$.

  1. This account will be expanded in the next edition. ↩︎
Copyright © 2023 The Bourbaki Authors — All rights reserved — Version 13a6779cc About Show the old page view