Cardinal product 2026-10-31
The cardinal product is the cardinality of the set of functions on the index set with at every coordinate. The empty product is one, because it contains the empty function. A zero factor makes a nonempty-index product zero. In ZFC, a family of nonzero cardinals has nonzero product by the axiom of choice.
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.
Empty-set cases for Cartesian projections Created 2026-10-07 Updated 2026-11-05
For the coordinate projection map , let denote the other factor. Then is surjective exactly when is the empty set or is nonempty. If is nonempty, a preimage of one chosen element requires an element of , and that same element provides a preimage for every element of .
The projection map is injective exactly when is the empty set or has at most one element. When contains an element and contains two distinct elements, the corresponding distinct ordered pairs have the same projection. With at most one omitted coordinate available, two pairs with the same retained coordinate must agree.
These conditions include the cases with the empty set as the domain of a function. In particular, a surjection onto an empty Cartesian product need not induce a surjection onto a nonempty factor: the empty function onto is surjective, while the resulting empty function into is not.
Left inverse Created 2026-10-05 Updated 2026-11-05
A left inverse of a function is a function satisfying
It forces injectivity: if , applying gives . For example, on the natural numbers has left inverse . The reverse function composition is not the identity at odd inputs.
Conversely, an injective function with nonempty has a left inverse. On the image of a function , send each value to its unique preimage; outside the image, send every point to one fixed . The nonempty-domain qualification matters: the unique empty function from to a nonempty is injective, but no function exists.
The cardinal sum is the cardinality of a disjoint union, and the cardinal product is the cardinality of the set of choice functions:
Here the cardinals are represented by initial ordinals. Tagging by makes the summands disjoint even when their underlying sets overlap. For an empty index set the sum is zero and the product is one, because there is exactly one empty function. If any factor in a nonempty product is zero, that product is empty.
Zorn's lemma states that a nonempty partially ordered set in which every chain has an upper bound contains a maximal element. Here a chain means a subset totally ordered by the inherited order; it need not have a greatest member.
View every partial function as its graph, a subset of . The family is a set by axiom of separation from the power set of this product. Let be a chain and put . If two members of the union assign values to the same input, the chain property makes one graph contain the other, so those values agree. Thus is a partial function.
If and , choose a chain member containing in its domain. Its rational-scalar closure gives . If , choose two chain members containing them; the larger one contains both, and therefore contains with value . Hence satisfies the required additive identity and domain closure. Consequently
and it is an upper bound for the chain. For the empty chain its union is the empty function, which satisfies the defining logical implications vacuously, so this case is covered too.
A nonempty weakly linear function has a domain closed under rational scalars and addition, hence a vector subspace of over . Additivity first gives and , then for integers . If with , rational closure puts in and
Thus : it is a -linear map. The empty function is not maximal because it extends to the function on with value zero.
Suppose a maximal had proper domain . Choose and any prescribed real value , for instance . Every element of has a unique expression : if two expressions coincide and the coefficients differ, then would belong to . Define
Uniqueness makes this well-defined. The displayed logical formula and the -linearity of show directly that is additive and has a domain closed under rational scalars. Hence it is a weakly linear function and extends . It is a proper extension because is now in its domain, contradicting maximality. Therefore
Part (a) and Zorn's lemma guarantee the existence of maximal extensions as well as this description of their domains.
True in ZF. A function from into the functions corresponds bijectively to a function from into :
The inverse sends to the function . These two explicit transformations are inverses, proving the currying law for cardinal exponentiation. Empty domains and codomains cause no exception: the same correspondence still applies, including the unique empty function when its domain is empty. No selection of representatives or choice functions is involved.
Hartogs theorem says that for every set there is a least ordinal that does not inject into . This theorem requires no axiom of choice.
To prove it, collect all well-orderings of subsets of . They are set-sized data, coded by pairs from and . Each has a unique ordinal order type, so replacement gives a set of their order types. If and , restricting the corresponding well-order to an initial segment shows . Hence is an ordinal. If this ordinal itself injected into , its transported well-order would put among its own elements, impossible for an ordinal. Every smaller ordinal does inject by definition. Thus has the asserted property.
The recursion printed in the source needs two boundary restrictions. Its new-row successor clause allows , which would assign a value at outside the declared domain. Also, at , its row-start clause gives while its column-start clause gives . Taken literally, these clauses do not define a function.
The intended extension fills the new row first and the remaining new column second. Restrict the row successor clause to , and apply the column-start clause only when . With these two restrictions the domains are disjoint:
All successors here are ordinal successors. Simultaneous transfinite induction proves a stronger result: is a bijection of onto an ordinal , and the functions extend one another.
At zero this is the empty function. Assuming it at , the least missing ordinal is . Recursion down the new row gives values for ; recursion down the remaining column gives for . These enumerate two disjoint consecutive ordinal intervals above the old range, so the extension is well defined and bijective, with
At a limit , take the union of the earlier functions. Compatibility makes it a function, and every pair of coordinates below is already present at some earlier stage. Its range is the ordinal , and injectivity is preserved by the compatible union. This completes the construction of the row-and-column enumeration of an ordinal square.
For finite stages . For example the table of , with the first coordinate indexing rows, is
The remaining parts refer to this domain-consistent construction. The source's literal boundary claims are preserved in the archive, rather than silently asserted as valid.
Right-inverse characterization of the axiom of choice Created 2026-10-14 Updated 2026-11-05
The statement that every surjective function has a right inverse is equivalent to the axiom of choice.
Given a surjective function , each fiber of a function is nonempty. The axiom of choice selects from that fiber for every , so and is a right inverse. When is the empty set, the unique empty function supplies without a choice.
Conversely, take an indexed family of nonempty sets. The projection map from the disjoint union to is surjective. A right inverse assigns , selecting one for every index. This is a choice function, so the asserted splitting of all surjections gives the axiom of choice.
A weakly linear partial function on the real numbers has a domain closed under rational scalar multiplication and addition, and it preserves addition on that domain. A nonempty domain is a vector space over the rational numbers, and additivity implies rational homogeneity of an additive function by integer multiplication and division. The empty function also satisfies the defining conditions vacuously. This terminology does not assert homogeneity under arbitrary real scalars.