Non-empty set

From Wikipedia, the free encyclopedia

In set theory, a set is called non-empty (or nonempty) if it contains at least one element, and is therefore not the empty set.

The requirement that a set be non-empty is frequently found in mathematical hypotheses. One reason is that we can easily make logical errors when we make hypotheses about the empty set, which is often nonintuitive and can be tricky to reason about correctly (see Empty set for further discussion of this). Thus, this hypothesis of nonemptiness can often be removed under a more careful treatment. On the other hand, there certainly are times when the empty set is a special case and really does need to be excluded from a hypothesis.

A common example where both of these situations arise is the axiom of choice. Although this axiom can be stated in several ways, for each standard way of stating it, there are two places where the term "nonempty" could be used. Often you will find the term used in both places, whereas in fact it is needed in only one. (See Axiom of choice for further discussion of this example).

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.