\(\DeclarePairedDelimiterX{\Set}[2]{\{}{\}}{#1 \nonscript\;\delimsize\vert\nonscript\; #2}\) \( \DeclarePairedDelimiter{\set}{\{}{\}}\) \( \DeclarePairedDelimiter{\parens}{\left(}{\right)}\) \(\DeclarePairedDelimiterX{\innerproduct}[1]{\langle}{\rangle}{#1}\) \(\newcommand{\ip}[1]{\innerproduct{#1}}\) \(\newcommand{\bmat}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\barray}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\mat}[1]{\begin{matrix}#1\end{matrix}}\) \(\newcommand{\pmat}[1]{\begin{pmatrix}#1\end{pmatrix}}\) \(\newcommand{\mathword}[1]{\mathop{\textup{#1}}}\)
Needs:
Equivalent Sets
Needed by:
Groups
Set Numbers
Submodular Functions
Links:
Sheet PDF
Graph PDF
Wikipedia

Finite Sets

Why

As with introducing Equivalent Sets, we want to talk about the size of a set.1

Definition

A finite set is one that is equivalent to some natural number; an infinite set is one which is not finite. From this we can show that $\omega $ is infinite. This justifies the language “principle of infinity” with  Natural Numbers. The principle of infinity asserts the existence of a particular infinite set; namely $\omega $.

Motivation for set number

It happens that if a set is equivalent to a natural number, it is equivalent to only one natural number.

A set can be equivalent to at most one natural number.2

A consequence is that a finite set is never equivalent to a proper subset of itself. So long as we are considering finite sets, a piece (subset) is always less than than the whole (original set).

A finite set is never equivalent to a proper subset of itself.

Subsets of finite sets

Every subset of a natural number is equivalent to a natural number.3 A consequence is:

Every subset of a finite set is finite.4

Unions of finite sets

If $A$ and $B$ are finite, then $A \union B$ is finite.

Products of finite sets

If $A$ and $B$ are finite, then $A \times B$ is finite.

Powers of finite sets

If $A$ is finite then $\powerset{A}$ is finite.

Functions between finite sets

If $A$ and $B$ are finite, then $A^B$ is finite.

  1. Will be expanded in future editions. ↩︎
  2. Future edition will include proof, which uses comparability of numbers and the results of  Equivalent Sets. ↩︎
  3. This requires proof, and may become a proposition in future editions. ↩︎
  4. An account will appear in future editions. ↩︎
Copyright © 2023 The Bourbaki Authors — All rights reserved — Version 13a6779cc About Show the old page view