TheoremBase

Induction on the number of elements of the domain: maps on a one-point set are the image of the target, and maps on a set with one extra point are the image of the finite product of the smaller map set with the target under extension; a constant map shows nonemptiness.

Proof

Each result cited is universally quantified over the data in its own statement.

Since TT is nonempty and finite, it has qq elements for some q∈Nq\in\mathbb{N}, and we may fix t0∈Tt_{0}\in T.

Nonemptiness. For every set YY the constant map Y→TY\to T with value t0t_{0} belongs to Map(Y,T)\mathrm{Map}(Y,T), so Map(Y,T)\mathrm{Map}(Y,T) is nonempty.

A preliminary remark. The initial segment [1][1] is {1}\{1\} by claim 2 of Basic Properties of Initial Segments of the Natural Numbers. Hence a set YY with 11 element is {a}\{a\} for a=β(1)a=\beta(1), where β:[1]→Y\beta:[1]\to Y is a bijection.

Finiteness, by induction. Let AA be the set of those p∈Np\in\mathbb{N} such that Map(Y,T)\mathrm{Map}(Y,T) is finite for every set YY with pp elements. We show A=NA=\mathbb{N} by the principle of induction Principle of Induction for the Natural Numbers.

1∈A1\in A. Let YY have 11 element; by the remark Y={a}Y=\{a\}. For t∈Tt\in T let c(t)∈Map(Y,T)c(t)\in\mathrm{Map}(Y,T) be the map sending aa to tt. The map c:T→Map(Y,T)c:T\to\mathrm{Map}(Y,T) is surjective, because every f∈Map(Y,T)f\in\mathrm{Map}(Y,T) equals c(f(a))c(f(a)), the two maps having the same value at the only point aa of YY. Since TT has qq elements, claim 4 of Basic Properties of Finite Sets shows that Map(Y,T)\mathrm{Map}(Y,T) has mm elements for some m∈Nm\in\mathbb{N}, so it is finite by Finite Set.

If p∈Ap\in A then S(p)∈AS(p)\in A. Let YY have S(p)S(p) elements. By claim 2 of Peeling an Element off a Finite Set, and Unions of Finite Sets there are a subset Y′⊆YY'\subseteq Y with pp elements and x∈Yx\in Y with x∉Y′x\notin Y' and Y=Y′∪{x}Y=Y'\cup\{x\}. Since p∈Ap\in A, the set Map(Y′,T)\mathrm{Map}(Y',T) is finite, and it is nonempty by the first paragraph. By claim 1 of Finiteness of Cartesian Products, Tuple Sets, and Permutation Sets the Cartesian product Map(Y′,T)×T\mathrm{Map}(Y',T)\times T is finite; it contains the pair of the constant map with value t0t_{0} and t0t_{0}, so it is nonempty and has m′m' elements for some m′∈Nm'\in\mathbb{N}. For g∈Map(Y′,T)g\in\mathrm{Map}(Y',T) and t∈Tt\in T let E((g,t))∈Map(Y,T)E((g,t))\in\mathrm{Map}(Y,T) be the map whose value at y∈Y′y\in Y' is g(y)g(y) and whose value at xx is tt; this is well defined because Y=Y′∪{x}Y=Y'\cup\{x\} and x∉Y′x\notin Y'. The map E:Map(Y′,T)×T→Map(Y,T)E:\mathrm{Map}(Y',T)\times T\to\mathrm{Map}(Y,T) is surjective: for f∈Map(Y,T)f\in\mathrm{Map}(Y,T), let f′f' be the restriction of ff to Y′Y'; then E((f′,f(x)))E((f',f(x))) and ff agree at every point of Y′Y' and at xx, so they are equal. By claim 4 of Basic Properties of Finite Sets, Map(Y,T)\mathrm{Map}(Y,T) has mm elements for some m∈Nm\in\mathbb{N}, so it is finite by Finite Set. Thus S(p)∈AS(p)\in A.

By Principle of Induction for the Natural Numbers, A=NA=\mathbb{N}.

Conclusion. The given YY is nonempty and finite, so by Finite Set it has pp elements for some p∈Np\in\mathbb{N}. Since p∈Ap\in A, Map(Y,T)\mathrm{Map}(Y,T) is finite, and it is nonempty by the first paragraph. This proves (Finiteness).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…