Axiom of empty set

From Wikipedia, the free encyclopedia

In set theory, the axiom of empty set is one of the axioms of Zermelo-Fraenkel set theory.

In the formal language of the Zermelo-Fraenkel axioms, the axiom reads:

\exist x \forall y \lnot (y \in x)

or in words:

There is a set such that no set is a member of it.

We can use the axiom of extensionality to show that there is only one empty set. Since it is unique we can name it. It is called the empty set, and also denoted by {}. Thus the essence of the axiom is:

An empty set exists.

The axiom of empty set is generally considered uncontroversial, and it or an equivalent appears in just about any alternative axiomatisation of set theory.

In some formulations of ZF, the axiom of empty set is actually repeated in the axiom of infinity. On the other hand, there are other formulations of that axiom that don't presuppose the existence of an empty set. Also, the ZF axioms can also be written using a constant symbol representing the empty set; then the axiom of infinity uses this symbol without requiring it to be empty, while the axiom of empty set is needed to state that it is in fact empty.

Furthermore, one sometimes considers set theories in which there are no infinite sets, and then the axiom of empty set may still be required. That said, any axiom of set theory or logic that implies the existence of any set will imply the existence of the empty set, if one has the axiom schema of separation. However, if separation is derived as a theorem schema from the axiom schema of replacement (as is sometimes done), then that derivation requires the axiom of empty set. So it could not be used to eliminate the axiom of empty set.

  • Paul Halmos, Naive set theory. Princeton, NJ: D. Van Nostrand Company, 1960. Reprinted by Springer-Verlag, New York, 1974. ISBN 0-387-90092-6 (Springer-Verlag edition).
  • Jech, Thomas, 2003. Set Theory: The Third Millennium Edition, Revised and Expanded. Springer. ISBN 3-540-44085-2.
  • Kunen, Kenneth, 1980. Set Theory: An Introduction to Independence Proofs. Elsevier. ISBN 0-444-86839-9.
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.