König’s theorem


König’s Theorem is a theorem of cardinal arithmetic.

Theorem 1.

Let κi and λi be cardinals, for all i in some index setMathworldPlanetmathPlanetmath I. If κi<λi for all i∈I, then

∑i∈Iκi<∏i∈Iλi.

The theorem can also be stated for arbitrary sets, as follows.

Theorem 2.

Let Ai and Bi be sets, for all i in some index set I. If |Ai|<|Bi| for all i∈I, then

|⋃i∈IAi|<|∏i∈IBi|.
Proof.

Let φ:⋃i∈IAi→∏i∈IBi be a function. For each i∈I we have |φ⁢(Ai)|≤|Ai|<|Bi|, so there is some xi∈Bi that is not equal to (φ⁢(a))⁢(i) for any a∈Ai. Define f:I→⋃i∈IBi by f⁢(i)=xi for all i∈I. For any i∈I and any a∈Ai, we have f⁢(i)≠(φ⁢(a))⁢(i), so f≠φ⁢(a). Therefore f is not in the image of φ. This shows that there is no surjection from ⋃i∈IAi onto ∏i∈IBi. As ∏i∈IBi is nonempty, this also means that there is no injection from ∏i∈IBi into ⋃i∈IAi. This completesPlanetmathPlanetmathPlanetmathPlanetmathPlanetmath the proof of Theorem 2. Theorem 1 follows as an immediate corollary. ∎

Note that the above proof is a diagonal argument, similar to the proof of Cantor’s Theorem. In fact, Cantor’s Theorem can be considered as a special case of König’s Theorem, taking κi=1 and λi=2 for all i.

Also note that Theorem 2 is equivalentMathworldPlanetmathPlanetmathPlanetmath (in ZF) to the Axiom of ChoiceMathworldPlanetmath, as it implies that products (http://planetmath.org/GeneralizedCartesianProduct) of nonempty sets are nonempty. (Theorem 1, on the other hand, is not meaningful without the Axiom of Choice.)

Title König’s theorem
Canonical name KonigsTheorem
Date of creation 2013-03-22 14:10:21
Last modified on 2013-03-22 14:10:21
Owner yark (2760)
Last modified by yark (2760)
Numerical id 15
Author yark (2760)
Entry type Theorem
Classification msc 03E10
Synonym Koenig’s theorem
Synonym Konig’s theorem
Synonym König-Zermelo theorem
Synonym Koenig-Zermelo theorem
Synonym Konig-Zermelo theorem
Related topic CantorsTheorem