Concept

Whitehead problem

In group theory, a branch of abstract algebra, the Whitehead problem is the following question: Is every abelian group A with Ext1(A, Z) = 0 a free abelian group? Saharon Shelah proved that Whitehead's problem is independent of ZFC, the standard axioms of set theory. Assume that A is an abelian group such that every short exact sequence must split if B is also abelian. The Whitehead problem then asks: must A be free? This splitting requirement is equivalent to the condition Ext1(A, Z) = 0. Abelian groups A satisfying this condition are sometimes called Whitehead groups, so Whitehead's problem asks: is every Whitehead group free? It should be mentioned that if this condition is strengthened by requiring that the exact sequence must split for any abelian group C, then it is well known that this is equivalent to A being free. Caution: The converse of Whitehead's problem, namely that every free abelian group is Whitehead, is a well known group-theoretical fact. Some authors call Whitehead group only a non-free group A satisfying Ext1(A, Z) = 0. Whitehead's problem then asks: do Whitehead groups exist? Saharon Shelah showed that, given the canonical ZFC axiom system, the problem is independent of the usual axioms of set theory. More precisely, he showed that: If every set is constructible, then every Whitehead group is free; If Martin's axiom and the negation of the continuum hypothesis both hold, then there is a non-free Whitehead group. Since the consistency of ZFC implies the consistency of both of the following: The axiom of constructibility (which asserts that all sets are constructible); Martin's axiom plus the negation of the continuum hypothesis, Whitehead's problem cannot be resolved in ZFC. J. H. C. Whitehead, motivated by the second Cousin problem, first posed the problem in the 1950s. Stein answered the question in the affirmative for countable groups. Progress for larger groups was slow, and the problem was considered an important one in algebra for some years. Shelah's result was completely unexpected.

À 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.