Concept

Hausdorff paradox

The Hausdorff paradox is a paradox in mathematics named after Felix Hausdorff. It involves the sphere (a 3-dimensional sphere in ). It states that if a certain countable subset is removed from , then the remainder can be divided into three disjoint subsets and such that and are all congruent. In particular, it follows that on there is no finitely additive measure defined on all subsets such that the measure of congruent sets is equal (because this would imply that the measure of is simultaneously , , and of the non-zero measure of the whole sphere). The paradox was published in Mathematische Annalen in 1914 and also in Hausdorff's book, Grundzüge der Mengenlehre, the same year. The proof of the much more famous Banach–Tarski paradox uses Hausdorff's ideas. The proof of this paradox relies on the axiom of choice. This paradox shows that there is no finitely additive measure on a sphere defined on all subsets which is equal on congruent pieces. (Hausdorff first showed in the same paper the easier result that there is no countably additive measure defined on all subsets.) The structure of the group of rotations on the sphere plays a crucial role here - the statement is not true on the plane or the line. In fact, as was later shown by Banach, it is possible to define an "area" for all bounded subsets in the Euclidean plane (as well as "length" on the real line) in such a way that congruent sets will have equal "area". (This Banach measure, however, is only finitely additive, so it is not a measure in the full sense, but it equals the Lebesgue measure on sets for which the latter exists.) This implies that if two open subsets of the plane (or the real line) are equi-decomposable then they have equal area.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.