Proof of König's Theorem
König's theorem is the most powerful general inequality in cardinal arithmetic, implying Cantor's theorem as a special case and restricting the behavior of the exponential function.
Statement
Let be an index set and , be families of cardinals with for all . Then:
Proof
We need to show: (a) , and (b) .
Part (a): For each , fix an injection (which exists since ). We construct an injection from into .
For each (where ), define a function by:
The map is injective: if , then (the only coordinate that can be nonzero) and , so .
Part (b): Suppose for contradiction that is a surjection. For each , consider the "slice" . This is the set of values in that appear as the -th coordinate of some .
Since , there exists for each .
Define a function by . Then .
By surjectivity, for some , . Then . But by construction. Contradiction.
Corollaries
Cantor's theorem as a special case: Take , , for all . Then and , so .
Cofinality restriction: Taking and suitable sequences: . In particular:
- , so .
- (since ).
König's theorem gives an upper bound on in terms of . Shelah's pcf theory (possible cofinalities) provides much deeper results about products of cardinals, particularly the remarkable theorem that if is a strong limit, then . This was a breakthrough showing that the exponential function at singular cardinals is far more constrained than at regular cardinals.