Difference between revisions of "Cardinality"
Mysmartmouth (talk | contribs) |
m (→Infinite) |
||
| (17 intermediate revisions by 7 users not shown) | |||
| Line 1: | Line 1: | ||
| − | + | '''Cardinality''' is a property of [[set]]s. For [[finite]] sets, the cardinality of is the number of [[element]]s in that set, i.e. the size of the set. The cardinality of <math>\{3, 4\}</math> is 2, the cardinality of <math>\{1, \{2, 3\}, \{1, 2, 3\}\}</math> is 3, and the cardinality of the [[empty set]] is 0. | |
| − | + | ==Notation== | |
| − | * [[ | + | The cardinality of a set <math>A</math> is denoted by <math>|A|</math>. In the above example, the cardinality of <math>\{3, 4\}</math> is <math>|\{3, 4\}| = 2</math>. Sometimes, the notations <math>n(A)</math> and <math>\# (A)</math> are used. |
| − | * [[ | + | |
| − | * [[ | + | ==Infinite== |
| + | For [[infinite]] sets, cardinality also measures (in some sense) the "size" of the set, but an explicit formulation is more complicated: the cardinality of a set <math>S</math> is the least [[cardinal]] that can be put in [[bijection]] with <math>S</math>. With the [[Axiom of choice]] (<math>\sf{AC}</math>), each set is well-orderable, and since the class of well-orderable cardinals is well-ordered, we can reasonably talk about the least cardinal in bijection with a set <math>S</math>. In the absence of <math>\sf{AC}</math>, one can define cardinals using [[equivalence classes]], formed via the relation <math>X\sim Y\Leftrightarrow|X|=|Y|</math> (there is a bijection between <math>X</math> and <math>Y</math>). | ||
| + | |||
| + | The notion of cardinalities for infinite sets is due to [[Georg Cantor]] and is one aspect of the field of [[set theory]]. Most significantly, Cantor showed that there are multiple infinite cardinalities. In other words, not all infinite sets are the same size. | ||
| + | |||
| + | == See Also == | ||
| + | * [[Injection]] | ||
| + | * [[Surjection]] | ||
| + | * [[Set]] | ||
| + | * [[Element]] | ||
| + | |||
| + | {{stub}} | ||
| + | [[Category:Set theory]] | ||
Latest revision as of 23:54, 16 November 2019
Cardinality is a property of sets. For finite sets, the cardinality of is the number of elements in that set, i.e. the size of the set. The cardinality of 
is 2, the cardinality of 
is 3, and the cardinality of the empty set is 0.
Notation
The cardinality of a set 
is denoted by 
. In the above example, the cardinality of is 
. Sometimes, the notations 
and 
are used.
Infinite
For infinite sets, cardinality also measures (in some sense) the "size" of the set, but an explicit formulation is more complicated: the cardinality of a set 
is the least cardinal that can be put in bijection with . With the Axiom of choice (
), each set is well-orderable, and since the class of well-orderable cardinals is well-ordered, we can reasonably talk about the least cardinal in bijection with a set . In the absence of , one can define cardinals using equivalence classes, formed via the relation 
(there is a bijection between 
and 
).
The notion of cardinalities for infinite sets is due to Georg Cantor and is one aspect of the field of set theory. Most significantly, Cantor showed that there are multiple infinite cardinalities. In other words, not all infinite sets are the same size.
See Also
This article is a stub. Help us out by expanding it.
