TheoremBase

Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice

An injection from [m] to [n] forces m ≤ n, so a finite set is listed by exactly one [n]; subsets, unions, Cartesian products, images and sets of maps of finite sets are finite, as are finite unions of finite sets; a set of natural numbers with zero is finite exactly when it is bounded above; every nonempty finite subset of a totally ordered set has a greatest and a least element; and a finite family of nonempty sets has a choice map, without any axiom of choice.

Statement

In the setting of The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion, let finite sets be as in Finite Sets §finite, intervals and [n][n] as in Intervals of Natural Numbers §interval and Intervals of Natural Numbers §segment, and let AA and BB be sets.

Let m,n∈N0m,n\in\mathbb{N}_{0}. If there is an injective map from [m][m] to [n][n], then m≤nm\le n; if there is a bijection from [m][m] onto [n][n], then m=nm=n.

If AA is finite, there is exactly one n∈N0n\in\mathbb{N}_{0} for which there is a bijection from [n][n] onto AA.

∅\emptyset is finite, and {x}\{x\} is finite for every set xx.

If AA is finite, every subset of AA is finite.

If AA and BB are finite, then A∪BA\cup B and A×BA\times B are finite.

If AA is finite and f:A→Bf:A\to B is a map, then f(A)f(A) is finite.

A subset SS of N0\mathbb{N}_{0} is finite if and only if there is b∈N0b\in\mathbb{N}_{0} with k≤bk\le b for every k∈Sk\in S; in particular every interval {m,…,n}\{m,\dots,n\} with m,n∈N0m,n\in\mathbb{N}_{0} is finite.

Let ≤\le be a total order on a set XX. Every nonempty finite subset SS of XX has a greatest element and a least element, max⁡S\max S and min⁡S\min S of Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §least.

If AA and BB are finite, then the set BAB^{A} of maps from AA to BB is finite; if moreover B≠∅B\neq\emptyset, then BA≠∅B^{A}\neq\emptyset.

Let now II be a finite set and (Ci)i∈I(C_{i})_{i\in I} a family of sets, with union ⋃i∈ICi\bigcup_{i\in I}C_{i} as in Indexed Families of Sets and Their Union, Intersection and Product §union, a set by The Union and Product of a Family of Sets Indexed by a Set, and the Intersection of a Family with an Inhabited Index Class, Are Sets §union.

If CiC_{i} is finite for every i∈Ii\in I, then ⋃i∈ICi\bigcup_{i\in I}C_{i} is finite.

If Ci≠∅C_{i}\neq\emptyset for every i∈Ii\in I, then there is a map f:I→⋃i∈ICif:I\to\bigcup_{i\in I}C_{i} with f(i)∈Cif(i)\in C_{i} for every i∈Ii\in I.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…