|
|
|
|
König's theorem
|
(Theorem)
|
|
|
König's Theorem is a theorem of cardinal arithmetic.
The theorem can also be stated for arbitrary sets, as follows.
Theorem 2 Let and be sets, for all in some index set . If
for all , then
Proof. Let
 be a function. For each  we have
 , so there is some
 that is not equal to
 for any  . Define
 by  for all  . For any  and any  , we have
 , so
 . Therefore  is not in the image of  . This shows that there is no surjection from
 onto
 . As
 is nonempty, this also means that there is no injection from
 into
 . This completes 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
and
for all .
Also note that Theorem 2 is equivalent (in ZF) to the Axiom of Choice, as it implies that products of nonempty sets are nonempty. (Theorem 1, on the other hand, is not meaningful without the Axiom of Choice.)
|
"König's theorem" is owned by yark.
|
|
(view preamble)
See Also: Cantor's theorem
| Other names: |
Koenig's theorem, Konig's theorem, König-Zermelo theorem, Koenig-Zermelo theorem, Konig-Zermelo theorem |
| Keywords: |
inequality, cardinal |
This object's parent.
|
|
Cross-references: implies, axiom of choice, ZF, Cantor's theorem, proof of Cantor's theorem, diagonal, proof, injection, surjection, function, index set, cardinals, cardinal arithmetic
There are 5 references to this entry.
This is version 12 of König's theorem, born on 2004-02-20, modified 2007-01-07.
Object id is 5598, canonical name is KonigsTheorem.
Accessed 10235 times total.
Classification:
| AMS MSC: | 03E10 (Mathematical logic and foundations :: Set theory :: Ordinal and cardinal numbers) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|