Class (set theory)

From Wikipedia, the free encyclopedia

(Redirected from Class (mathematics))
Jump to: navigation, search

In set theory and its applications throughout mathematics, a class is a collection of sets (or sometimes other mathematical objects) that can be unambiguously defined by a property that all its members share. Some classes are sets (for instance, the class of all integers that are even), but others are not (for instance, the class of all ordinal numbers or the class of all sets). A class that is not a set is called a proper class.

Many objects in mathematics are too big for sets and need to be described with classes. Examples include large categories or the class-field of surreal numbers. The usual construction to show that a given "thing" is a proper class is to show that such a "thing" has at least as many elements as there are ordinal numbers. For an example of such a proof, see free lattices.

A proper class cannot be an element of a set or a class and is not subject to the Zermelo-Fraenkel axioms of set theory; thereby a number of paradoxes of naive set theory are avoided. Instead, these paradoxes become proofs that a certain class is proper. For example, Russell's paradox becomes a proof that the class of all sets which do not contain themselves is proper, and the Burali-Forti paradox becomes a proof that the class of all ordinal numbers is proper.

The standard Zermelo-Fraenkel set theory axioms do not talk about classes; classes exist only in the metalanguage as equivalence classes of logical formulas. Another approach is taken by the von Neumann-Bernays-Gödel axioms; classes are the basic objects in this theory, and a set is then defined to be a class that is an element of some other class. The proper classes, then, are those classes that are not elements of any other class.

In other set theories, such as New Foundations or the theory of semisets, the concept of "proper class" still makes sense (not all collections are sets) but the criterion of sethood is not size. For example, any set theory with a universal set has proper classes which are subclasses of sets.

The word "class" is sometimes used synonymously with "set," most notably in the term "equivalence class." This usage dates from a historical period where classes and sets were not distinguished as they are in modern terminology. Many discussions of "classes" in the 19th century and earlier are really referring to sets, or perhaps to a more ambiguous concept.

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.