Whitehead problem

From Wikipedia, the free encyclopedia

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

Is every abelian group A with Ext¹(A, Z) = 0 a free abelian group?

Abelian groups satisfying this condition are sometimes called Whitehead groups, so Whitehead's problem asks: is every Whitehead group free? Shelah (1974) proved that Whitehead's problem was undecidable within standard ZFC set theory.

Contents 1 Refinement 2 Shelah's proof 3 Discussion 4 References 5 See also

[edit] Refinement

The condition Ext¹(A, Z) = 0 can be equivalently formulated as follows: whenever B is an abelian group and f : B → A is a surjective group homomorphism whose kernel is isomorphic to the group of integers Z, then there exists a group homomorphism g : A → B with fg = id_A.

[edit] Shelah's proof

Saharon Shelah (1974) showed that the problem was undecidable in the standard ZFC axiom system. More precisely, he showed that:

• if Every set is constructible, then every Whitehead group is free.
• if Martin's axiom holds and the negation of the continuum hypothesis, then there is a non-free Whitehead group.

Since the consistency of ZFC implies the consistency of either of the following:

• The axiom that all sets are constructible;
• Martin's axiom plus the negation of the continuum hypothesis,
  

Whitehead's problem is undecidable.

[edit] Discussion

J. H. C. Whitehead, motivated by the second Cousin problem, first posed the problem in the 1950s. Stein (1951) 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. 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 been confined to the realm of set theory. The Whitehead problem was the first purely algebraic problem to be proved undecidable.

Shelah (1977, 1980) later showed that the Whitehead problem remains undecidable even if one assumes the Continuum hypothesis. Proving that this and other statements about uncountable abelian groups are independent of ZFC shows that the theory of such groups depends very sensitively on the underlying set theory.

[edit] References

• Eklof, Paul C. (1976), “Whitehead's Problem is Undecidable”, The American Mathematical Monthly 83 (10): 775-788, <http://links.jstor.org/sici?sici=0002-9890%28197612%2983%3A10%3C775%3AWPIU%3E2.0.CO%3B2-6>  An expository account of Shelah's proof.
• Eklof, P.C. (2001), “Whitehead problem”, in Hazewinkel, Michiel, Encyclopaedia of Mathematics, Kluwer Academic Publishers, ISBN 978-1556080104 
• Shelah, S. (1974), “Infinite Abelian groups, Whitehead problem and some constructions”, Israel Journal of Mathematics 18: 243-256, MR0357114 
• Shelah, S. (1977), “Whitehead groups may not be free, even assuming CH. I”, Israel Journal of Mathematics 28: 193-203, MR0469757 
• Shelah, S. (1980), “Whitehead groups may not be free, even assuming CH. II”, Israel Journal of Mathematics 35: 257-285, MR0594332 
• Stein, Karl (1951), “Analytische Funktionen mehrerer komplexer Veränderlichen zu vorgegebenen Periodizitätsmoduln und das zweite Cousinsche Problem”, Math. Ann. 123: 201-222, MR0043219, DOI 10.1007/BF02054949 

[edit] See also

• List of statements undecidable in ZFC
• Statements true if all sets are constructible