Empty function Created 2026-10-31 Updated 2026-11-05
The empty function has the empty set as both its domain of a function and its graph of a function: it assigns no values at all. For every specified codomain , there is exactly one function , because there are no function inputs requiring a choice of function output. This includes . In contrast, a function from a nonempty set to the empty set cannot exist.
Consequently the set of functions from the empty set to any set has cardinality one. This is the reason for in cardinal exponentiation and for a Cartesian product indexed by the empty set having one element, the empty tuple.
For GCH arithmetic at aleph omega, let . Use monotonicity of cardinal exponentiation, the law , and for infinite cardinals in ZFC. Since ,Thus , and the generalized continuum hypothesis yieldsThe lower bound embeds binary-valued functions into -valued ones; the upper bound codes each value by a subset and combines the resulting pairs of indices. In particular the equality before applying the hypothesis is a ZFC equality.
For , monotonicity of cardinal exponentiation givesThe middle equality uses the currying law for cardinal exponentiation, and the final one uses . Hence , even before assuming GCH. Applying the Generalized continuum hypothesis yields
Past exam of the logic and set theory course of the University of Oxford 2007 B 7 ii Solution 2026-10-31
The set of all functions from a set of size to another set of size has size . Cardinal exponentiation and the law giveThereforeThe lower bound can also be seen by taking characteristic functions of all subsets of . Cantor's theorem makes this strictly larger than , unlike the continuous-function space in the next part.