Math 2.0

Mathematical logic and foundations Definition

Finite set

Builds on Equinumerous sets

Definition

A set AA is finite when there is a natural number nn such that AA is equinumerous with {1,2,…,n}\{1, 2, \dots, n\}. For n=0n = 0, this set is the empty set. The number nn is unique, and it is the number of elements of AA.

Remarks

Subsets, finite unions, finite products and the power set of finite sets are finite. A finite set is not equinumerous with any proper subset of itself. This is the pigeonhole principle. A set that is not finite is infinite.

Reading path

To understand this page from the ground up, read these 19 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Element definition
  2. Proposition concept
  3. Set definition
  4. Implication definition
  5. Predicate definition
  6. Ordered pair definition
  7. Existential quantifier definition
  8. Universal quantifier definition
  9. Cartesian product definition
  10. Subset definition
  11. Uniqueness quantifier definition
  12. Binary relation definition
  13. Function definition
  14. Codomain definition
  15. Injective function definition
  16. Surjective function definition
  17. Bijective function definition
  18. Equinumerous sets definition
  19. Finite set definition

Where this leads

25 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Finite_set, lead section
About this page
Tag0BBTH3YSZA
URIm2://0BBTH3YSZA
Kinddefinition
WritingW1 stated
MSC03E10
DefinesFinite set
UsesEquinumerous sets

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (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