Mathematical logic and foundations Definition
Cardinality of a finite set
Definition
Let be a set and let be a natural number. The set has elements if there is a bijection from to . For , the set is the empty set, so only the empty set has elements. A set is finite if it has elements for some natural number .
For a finite set , this number is unique. It is the cardinality of , with the notation or .
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, and . The uniqueness of follows from the fact that there is no injection from to when .
Where this leads
17 pages build on this one.
- Complement principle
- Number of functions between finite sets
- Number of k-element subsets
- Generalized pigeonhole principle
- Addition rule for two events
- Inclusion–exclusion for two sets
- Number of subsets of a finite set
- Number of permutations
- Rule of sum
- Inclusion–exclusion principle
- Infinite pigeonhole principle
- Bijection principle
- Pigeonhole principle
- Erdős–Szekeres theorem
- Rule of product
- Number of injections
- No-three-in-line problem
Further reading
- Web https://en.wikipedia.org/wiki/Cardinality, Finite cardinals
About this page
| Tag | 05099E1NMJ |
|---|---|
| URI | m2://05099E1NMJ |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03E10 |
| Defines | Cardinality 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
- Complement principle
- Number of functions between finite sets
- Number of k-element subsets
- Generalized pigeonhole principle
- Inclusion–exclusion for two sets
- Number of subsets of a finite set
- Number of permutations
- Rule of sum
- Inclusion–exclusion principle
- Bijection principle
- Pigeonhole principle
- Rule of product
- Number of injections