Idea

In set theory, cardinality is a way of classifying sets, by the kinds of maps possible between any two sets by ‘size’.

Definition

The cardinal of a set is the equivalence class, written of sets that have bijections between and other sets. Let , be sets, then the following are considered definitions:

Finite Cardinality

The cardinality is written as for iff where is the canonical finite set . The first infinite cardinal is denoted . Each subsequent cardinal is written for any other ordinal .

Remarks

Common Facts

  • Cantor’s theorem: For any set , the cardinality of its power set is strictly greater than the cardinality of . Symbolically, .
  • Schröder-Bernstein theorem: If there exist injective functions from to and from to , then there exists a bijective function between and .
  • Infinite arithmetic: For infinite cardinals and , assuming the Axiom of Choice, addition and multiplication simplify to .
  • [^1]Aleph numbers: The infinite well-ordered cardinals are denoted by the Hebrew letter aleph indexed by ordinals: . The cardinality of the natural numbers is .
  • The continuum: The cardinality of the real numbers, denoted , equals . The Continuum hypothesis states that , which is independent of ZFC.

Relation to the Skeleton of Set

In category theory, a skeleton of a category is a full subcategory where no two distinct objects are isomorphic, and every object in the original category is isomorphic to an object in the subcategory.

In the category of sets and functions, denoted Set, isomorphisms are bijections. Two sets are isomorphic if and only if they have the same cardinality.

A skeleton of Set therefore contains exactly one set of each cardinality. The class of cardinal numbers, when defined as initial ordinals via the Von Neumann cardinal assignment, provides a canonical choice for the objects of this skeleton. We view the skeleton of Set as the category whose objects are the cardinal numbers and whose morphisms are arbitrary functions between them.

References