Math 2.0

Mathematical logic and foundations Definition

Cardinality of a finite set

Definition

Let AA be a set and let nn be a natural number. The set AA has nn elements if there is a bijection from {1,2,…,n}\{1, 2, \dots, n\} to AA. For n=0n = 0, the set {1,…,n}\{1, \dots, n\} is the empty set, so only the empty set has 00 elements. A set is finite if it has nn elements for some natural number nn.

For a finite set AA, this number nn is unique. It is the cardinality of AA, with the notation ∣A∣|A| or #A\# A.

Remarks

Two finite sets have the same cardinality if and only if there is a bijection between them. The bijection principle states this. For example, ∣{a,b,c}∣=3|\{a, b, c\}| = 3 and ∣∅∣=0|\varnothing| = 0. The uniqueness of nn follows from the fact that there is no injection from {1,…,m}\{1, \dots, m\} to {1,…,n}\{1, \dots, n\} when m>nm > n.

Where this leads

17 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Cardinality, Finite cardinals
About this page
Tag05099E1NMJ
URIm2://05099E1NMJ
Kinddefinition
WritingW0 stub
MSC03E10
DefinesCardinality of a finite set

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by