Jump to content

Whitehead problem: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
wikilink Axiom of constructibility
Discussion: I was wondering about that :D
 
(55 intermediate revisions by 34 users not shown)
Line 1: Line 1:
{{Distinguish|Whitehead theorem|Whitehead conjecture}}
In [[group theory]], the '''Whitehead problem''' is the following question:
{{Use shortened footnotes|date=May 2021}}
:Is every [[abelian group]] ''A'' with [[Ext functor|Ext]]<sup>1</sup>(''A'', '''Z''') = 0 a [[free abelian group]]?
In [[group theory]], a branch of [[abstract algebra]], the '''Whitehead problem''' is the following question:
The condition Ext<sup>1</sup>(''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 (algebra)|kernel]] is isomorphic to the group of [[integer]]s '''Z''', then there exists a group homomorphism ''g'' : ''A'' → ''B'' with ''fg'' = [[identity map|id<sub>''A''</sub>]]. Abelian groups satisfying this condition are sometimes called '''Whitehead groups''', so Whitehead's problem asks if every Whitehead group is free.


{{quote|1=Is every [[abelian group]] ''A'' with [[Ext functor|Ext]]<sup>1</sup>(''A'', '''Z''') = 0 a [[free abelian group]]?}}
The question was asked by [[J. H. C. Whitehead]] in the 1950s, motivated by the [[second Cousin problem]]. The affirmative answer for [[countable]] groups was already found in the 1950s. Progress for larger groups was slow, and the problem was considered one of the most important ones in [[abstract algebra|algebra]] for many years.


In 1973, [[Saharon Shelah]] showed that from the standard [[ZFC]] axiom system, the statement can be neither proven nor disproven. More precisely, he showed that:
[[Saharon Shelah]] proved that Whitehead's problem is [[Independence (mathematical logic)|independent]] of [[ZFC]], the standard axioms of set theory.{{r|Shelah1974}}
* If [[Axiom of constructibility|every set is constructible]], then every Whitehead group is free.
* If [[Martin's axiom]] holds and the [[continuum hypothesis]] is false, then there is a non-free Whitehead group.
Since the consistency of ZFC implies both the consistency of the axiom that all sets are constructible, and the consistency of Martin's axiom plus the negation of the continuum hypothesis, this shows that Whitehead's problem is undecidable.


==Refinement==
This 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 that was shown to be undecidable.
Assume that ''A'' is an abelian group such that every short [[exact sequence]]
:<math>0\rightarrow\mathbb{Z}\rightarrow B\rightarrow A\rightarrow 0</math>
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<sup>1</sup>(''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
:<math>0\rightarrow C\rightarrow B\rightarrow A\rightarrow 0</math>
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<sup>1</sup>(''A'', '''Z''') = 0. Whitehead's problem then asks: do Whitehead groups exist?
The Whitehead problem remains undecidable even if one assumes the Continuum hypothesis, as shown by Shelah in 1980. Various similar independence statements were proved and it was realized more and more that the theory of uncountable abelian groups depends very sensitively on the underlying [[set theory]].


== References ==
==Shelah's proof==
Saharon Shelah showed that, given the canonical [[ZFC]] axiom system, the problem is [[Independence (mathematical logic)|independent of the usual axioms of set theory]].{{r|Shelah1974}} More precisely, he showed that:
* Shelah, S. (1974) "Infinite Abelian groups, Whitehead problem and some constructions." ''Israel Journal of Mathematics 18'': 243-56.
* If [[Axiom of constructibility|every set is constructible]], then every Whitehead group is free;
* ------ (1980) "Whitehead groups may not be free, even assuming CH. II," ''Israel Journal of Mathematics 35'': 257-85.
* If [[Martin's axiom]] and the negation of the [[continuum hypothesis]] both hold, then there is a non-free Whitehead group.
* Eklof, Paul C. (1976) "Whitehead's Problem is Undecidable,"''The American Mathematical Monthly 83'': 775-88. This is an expository account of Shelah's proof.
Since the [[consistency]] of ZFC implies the consistency of both of the following:
*{{springer|id=W/w110030|title=Whitehead problem|author=P.C. Eklof}}
*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]] groups.{{r|Stein1951}} Progress for larger groups was slow, and the problem was considered an important one in [[abstract algebra|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.{{r|Shelah1977|Shelah1980}} In fact, it remains undecidable even under the [[generalised continuum hypothesis]].<ref>{{cite web |url=https://www.karlin.mff.cuni.cz/~trlifaj/ANK_5.pdf |title=The Whitehead Problem and Beyond (Lecture notes for NMAG565) |last=Triflaj |first=Jan |date=16 February 2023 |website= |publisher=[[Charles University]] |access-date=26 September 2024 |quote=}}</ref> The Whitehead conjecture is true if all sets are [[constructible universe|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]].


==See also==
==See also==
*[[Free abelian group]]
*[[Whitehead torsion]]
*[[List of statements undecidable in ZFC]]
*[[List of statements undecidable in ZFC]]
*[[Statements true in L]]
*[[Axiom of constructibility#Statements true in L|Statements true in L]]

== References ==
{{reflist|refs=
<ref name=Shelah1974>{{cite journal |last=Shelah |first=S. |author-link=Saharon Shelah |date=1974 |title=Infinite Abelian groups, Whitehead problem and some constructions |journal=[[Israel Journal of Mathematics]] |volume=18 |issue=3 |pages=243–256 |doi=10.1007/BF02757281 | doi-access= |mr=0357114 |s2cid=123351674}}</ref>

<ref name=Stein1951>{{cite journal |last=Stein |first=Karl |date=1951 |title=Analytische Funktionen mehrerer komplexer Veränderlichen zu vorgegebenen Periodizitätsmoduln und das zweite Cousinsche Problem |journal= Mathematische Annalen |volume=123 |pages=201–222 |doi=10.1007/BF02054949 | doi-access= |mr=0043219|s2cid= 122647212 }}</ref>

<ref name=Shelah1977>{{cite journal |last=Shelah |first=S. |author-link=Saharon Shelah |date=1977 |title=Whitehead groups may not be free, even assuming CH. I
|journal=[[Israel Journal of Mathematics]] |volume=28 |issue=3 |page=193-203 |doi=10.1007/BF02759809 | doi-access=free |mr=0469757 |hdl=10338.dmlcz/102427 |hdl-access=free |s2cid=123029484}}</ref>

<ref name=Shelah1980>{{cite journal |last=Shelah |first=S. |author-link=Saharon Shelah |date=1980 |title=Whitehead groups may not be free, even assuming CH. II
|journal=[[Israel Journal of Mathematics]] |volume=35 |issue=4 |pages=257–285 |doi=10.1007/BF02760652 | doi-access= |mr=0594332 |s2cid=122336538}}</ref>
}}

==Further reading==
{{refbegin}}
*{{cite journal |last=Eklof |first=Paul C. |date=December 1976 |title=Whitehead's Problem is Undecidable |journal=The American Mathematical Monthly |volume= 83|issue= 10 |pages=775–788 |doi= 10.2307/2318684 |jstor=2318684}} An expository account of Shelah's proof.
*{{springer|id=W/w110030|title=Whitehead problem |author=Eklof, P.C.}}
{{refend}}


[[Category:Independence results]]
[[Category:Independence results]]
[[Category:Group theory]]
[[Category:Group theory]]
[[Category:Mathematical problems]]

[[he:בעיית וייטהד]]
[[zh:怀特海问题]]

Latest revision as of 05:30, 26 September 2024

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.[1]

Refinement

[edit]

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?

Shelah's proof

[edit]

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:

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.

Discussion

[edit]

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] In fact, it remains undecidable even under the generalised continuum hypothesis.[5] 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.

See also

[edit]

References

[edit]
  1. ^ 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.
  2. ^ 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.
  3. ^ 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.
  4. ^ 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.
  5. ^ Triflaj, Jan (16 February 2023). "The Whitehead Problem and Beyond (Lecture notes for NMAG565)" (PDF). Charles University. Retrieved 26 September 2024.

Further reading

[edit]