arXiv Analytics

Sign in

arXiv:1111.6991 [math.GN]AbstractReferencesReviewsResources

Simple proof of Zermelo's theorem

V. V. Filippov, E. Yu. Mychka

Published 2011-11-29, updated 2011-12-01Version 2

Most of the assertions in the theory of well ordered sets are quite simple. However, one of its central statements, Zermelo's theorem, stands out of this rule, for its well-known proofs are rather complicated. The aim of the current paper is to propose a simple proof of this theorem. Please inform us if you ever encountered such a proof.

Comments: 2 pages
Categories: math.GN
Related articles:
arXiv:1102.4564 [math.GN] (Published 2011-02-22, updated 2011-02-24)
Short proof of a theorem of Juhasz
arXiv:2409.09490 [math.GN] (Published 2024-09-14)
Two Selection Theorems for Extremally Disconnected Spaces
arXiv:1011.4145 [math.GN] (Published 2010-11-18)
A short and elementary proof of Hanner's theorem

Links

Toolbox