König's theorem for cardinal numbers states that, for a set-indexed family with at every index,
Here the sum is the cardinality of a disjoint union and the product is the cardinality of a Cartesian product. Work in ZFC. Choose disjoint sets of sizes and sets of sizes . For any function , its th coordinate values on form a subset of of cardinality at most . Choose outside that subset, using choice. Then cannot equal for any : if , its th coordinate was specifically excluded. Thus there is no surjection from the disjoint union onto the product.
Cardinal comparability under choice now implies the displayed strict inequality. Empty index set gives directly; empty individual cause no difficulty, since the corresponding coordinate excludes an empty image. This is the cardinal diagonal theorem, rather than the finitely branching tree result also bearing König's name.

Articles by others on the same topic (0)

There are currently no matching articles.