KNOWPIA
WELCOME TO KNOWPIA

In group theory, a branch of abstract algebra, the **Whitehead problem** is the following question:

Is every abelian group

Awith Ext^{1}(A,Z) = 0 a free abelian group?

Saharon Shelah proved that Whitehead's problem is independent of ZFC, the standard axioms of set theory.^{[1]}

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?

Saharon Shelah showed that, given the canonical ZFC axiom system, the problem is independent of the usual axioms of set theory.^{[1]} 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.^{[2]} 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. 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. 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.^{[3]}^{[4]} 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.

- ^
^{a}^{b}Shelah, S. (1974). "Infinite Abelian groups, Whitehead problem and some constructions".*Israel Journal of Mathematics*.**18**(3): 243–256. doi:10.1007/BF02757281. MR 0357114. S2CID 123351674. **^**Stein, Karl (1951). "Analytische Funktionen mehrerer komplexer Veränderlichen zu vorgegebenen Periodizitätsmoduln und das zweite Cousinsche Problem".*Mathematische Annalen*.**123**: 201–222. doi:10.1007/BF02054949. MR 0043219. S2CID 122647212.**^**Shelah, S. (1977). "Whitehead groups may not be free, even assuming CH. I".*Israel Journal of Mathematics*.**28**(3): 193-203. doi:10.1007/BF02759809. hdl:10338.dmlcz/102427. MR 0469757. S2CID 123029484.**^**Shelah, S. (1980). "Whitehead groups may not be free, even assuming CH. II".*Israel Journal of Mathematics*.**35**(4): 257–285. doi:10.1007/BF02760652. MR 0594332. S2CID 122336538.

- Eklof, Paul C. (December 1976). "Whitehead's Problem is Undecidable".
*The American Mathematical Monthly*.**83**(10): 775–788. doi:10.2307/2318684. JSTOR 2318684. An expository account of Shelah's proof. - Eklof, P.C. (2001) [1994], "Whitehead problem",
*Encyclopedia of Mathematics*, EMS Press