Kőnig's Theorem (set Theory)

In set theory, Kőnig's theorem states that if the axiom of choice holds, ''I'' is a set, $\kappa_i$ and $\lambda_i$ are cardinal numbers for every ''i'' in ''I'', and $\kappa_i < \lambda_i$ for every ''i'' in ''I'', then

$\sum_\kappa_i < \prod_\lambda_i.$

The sum here is the cardinality of the disjoint union of the sets ''m_i'', and the product is the cardinality of the Cartesian product. However, without the use of the axiom of choice, the sum and the product cannot be defined as cardinal numbers, and the meaning of the inequality sign would need to be clarified.

Kőnig's theorem was introduced by in the slightly weaker form that the sum of a strictly increasing sequence of nonzero cardinal numbers is less than their product.

Details

The precise statement of the result: if ''I'' is a set, ''A_i'' and ''B_i'' are sets for every ''i'' in ''I'', and A_i for every ''i'' in ''I'', then

$\sum_A_i < \prod_B_i,$

where < means ''strictly less than in cardinality'', i.e. there is an injective function from ''A_i'' to ''B_i'', but not one going the other way. The union involved need not be disjoint (a non-disjoint union can't be any bigger than the disjoint version, also assuming the axiom of choice). In this formulation, Kőnig's theorem is equivalent to the axiom of choice.

(Of course, Kőnig's theorem is trivial if the cardinal numbers ''m_i'' and ''n_i'' are finite and the index set ''I'' is finite. If ''I'' is empty, then the left sum is the empty sum and therefore 0, while the right product is the empty product and therefore 1.)

Kőnig's theorem is remarkable because of the strict inequality in the conclusion. There are many easy rules for the arithmetic of infinite sums and products of cardinals in which one can only conclude a weak inequality ≤, for example: if $m_i < n_i$ for all ''i'' in ''I'', then one can only conclude

$\sum_ m_i \le \sum_ n_i,$

since, for example, setting $m_i = 1$ and $n_i = 2$, where the index set ''I'' is the natural numbers, yields the sum $\aleph_0$ for both sides, and we have an equality.

Corollaries of Kőnig's theorem

* If $\kappa$ is a cardinal, then $\kappa < 2^\kappa$.
If we take $m_i=1$, and $n_i=2$ for each $i$ in $\kappa$, then the left side of the above inequality is just $\kappa$, while the right side is $2^\kappa$, the cardinality of functions from $\kappa$ to $\$, that is, the cardinality of the power set of $\kappa$. Thus, Kőnig's theorem gives us an alternate proof of Cantor's theorem. (Historically of course Cantor's theorem was proved much earlier.)

Axiom of choice

One way of stating the axiom of choice is "an arbitrary Cartesian product of non-empty sets is non-empty". Let ''B_i'' be a non-empty set for each ''i'' in ''I''. Let ''A_i'' = for each ''i'' in ''I''. Thus by Kőnig's theorem, we have:
* If $\forall i \in I(\ < B_i)$, then $\ < \prod_B_i$.
That is, the Cartesian product of the given non-empty sets ''B_i'' has a larger cardinality than the sum of empty sets. Thus it is non-empty, which is just what the axiom of choice states. Since the axiom of choice follows from Kőnig's theorem, we will use the axiom of choice freely and implicitly when discussing consequences of the theorem.

Kőnig's theorem and cofinality

Kőnig's theorem has also important consequences for cofinality of cardinal numbers.

* If $\kappa \ge \aleph_0$, then $\kappa < \kappa^$.

If κ is regular, then this follows from Cantor's theorem. If κ is singular, then κ is a limit cardinal. Choose a strictly increasing cf(κ)-sequence of cardinals approaching κ. Let λ be their sum. Each summand is less than κ, so, by Kőnig's theorem, λ is less than the product of cf(κ) copies of κ. We finish the proof by showing that λ = κ. Since each summand is a lower bound for λ, λ ≥ κ. For the other inequality, λ ≤ cf(κ)·κ = κ.

According to Easton's theorem, the next consequence of Kőnig's theorem is the only nontrivial constraint on the continuum function for regular cardinals.
* If $\kappa \geq \aleph_0$ and $\lambda \geq 2$, then $\kappa < \operatorname(\lambda^\kappa)$.
Let $\mu = \lambda^\kappa$. Suppose that, contrary to this corollary, $\kappa \ge \operatorname(\mu)$. Then using the previous corollary, $\mu < \mu^ \le \mu^\kappa = (\lambda^\kappa)^\kappa = \lambda^ = \lambda^\kappa = \mu$, a contradiction.

A proof of Kőnig's theorem

Assuming Zermelo–Fraenkel set theory, including especially the axiom of choice, we can prove the theorem. Remember that we are given \forall i\in I. A_i, and we want to show $\sum_A_i<\prod_B_i.$

The axiom of choice implies that the condition ''A'' < ''B'' is equivalent to the condition that there is no function from ''A'' onto ''B'' and ''B'' is nonempty.
So we are given that there is no function from ''A''_''i'' onto ''B''_''i''≠, and we have to show that any function ''f'' from the disjoint union of the ''A''s to the product of the ''B''s is not surjective and that the product is nonempty. That the product is nonempty follows immediately from the axiom of choice and the fact that the factors are nonempty. For each ''i'' choose a ''b''_''i'' in ''B''_''i'' not in the image of ''A''_''i'' under the composition of ''f'' with the projection to ''B''_''i''. Then the product of the elements ''b''_''i'' is not in the image of ''f'', so ''f'' does not map the disjoint union of the ''A''s onto the product of the ''B''s.

Notes

References

*
* , reprinted as

{{DEFAULTSORT:Konigs theorem

Articles containing proofs
Axiom of choice
Cardinal numbers
Mathematical logic
Theorems in the foundations of mathematics