In
group theory
In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups.
The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field ( ...
, a branch of
abstract algebra
In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures, which are set (mathematics), sets with specific operation (mathematics), operations acting on their elements. Algebraic structur ...
, the Whitehead problem is the following question:
Saharon Shelah proved that Whitehead's problem is
independent of
ZFC, the standard axioms of set theory.
Refinement
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 Ext
1(''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 Ext
1(''A'', Z) = 0. Whitehead's problem then asks: do Whitehead groups exist?
Shelah's proof
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
In deductive logic, a consistent theory is one that does not lead to a logical contradiction. A theory T is consistent if there is no formula \varphi such that both \varphi and its negation \lnot\varphi are elements of the set of consequences ...
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.
Discussion
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
In mathematics, a Set (mathematics), set is countable if either it is finite set, finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is ''countable'' if there exists an injective function fro ...
groups. Progress for larger groups was slow, and the problem was considered an important one in
algebra
Algebra is a branch of mathematics that deals with abstract systems, known as algebraic structures, and the manipulation of expressions within those systems. It is a generalization of arithmetic that introduces variables and algebraic ope ...
for some years.
Shelah's result was completely unexpected. While the existence of undecidable statements had been known since
Gödel's incompleteness theorem of 1931, previous examples of undecidable statements (such as the
continuum hypothesis) had all been in pure
set theory
Set theory is the branch of mathematical logic that studies Set (mathematics), sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory – as a branch of mathema ...
. The Whitehead problem was the first purely algebraic problem to be proved undecidable.
Shelah later showed that the Whitehead problem remains undecidable even if one assumes the continuum hypothesis. In fact, it remains undecidable even under the
generalised continuum hypothesis.
The Whitehead conjecture is true if all sets are
constructible. That this and other statements about uncountable abelian groups are provably independent of
ZFC shows that the theory of such groups is very sensitive to the assumed underlying
set theory
Set theory is the branch of mathematical logic that studies Set (mathematics), sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory – as a branch of mathema ...
.
See also
*
Free abelian group
*
Whitehead torsion
*
List of statements undecidable in ZFC
*
Statements true in L
References
Further reading
* An expository account of Shelah's proof.
*
{{refend
Independence results
Group theory
Mathematical problems