The First Almost Free Whitehead Group Sh914

نویسنده

  • SAHARON SHELAH
چکیده

Assume G.C.H. and κ is the first uncountable cardinal such that there is a non-free κ-free abelian Whitehead group of cardinality κ. We prove that if all κ-free Abelian group of cardinality κ are Whitehead then κ is necessarily an inaccessible cardinal.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Set theory generated by Abelian group theory

Introduction. This survey is intended to introduce to logicians some notions, methods and theorems in set theory which arose—largely through the work of Saharon Shelah—out of (successful) attempts to solve problems in abelian group theory, principally the Whitehead problem and the closely related problem of the existence of almost free abelian groups. While Shelah’s first independence result re...

متن کامل

Uniformization and the Diversity of Whitehead Groups

The connections between Whitehead groups and uniformization properties were investigated by the third author in [9]. In particular it was essentially shown there that there is a non-free Whitehead (respectively, א1-coseparable) group of cardinality א1 if and only if there is a ladder system on a stationary subset of ω1 which satisfies 2-uniformization (respectively, ω-uniformization). (See also...

متن کامل

Hereditarily Separable Groups and Monochromatic Uniformization

We give a combinatorial equivalent to the existence of a non-free hereditarily separable group of cardinality א1. This can be used, together with a known combinatorial equivalent of the existence of a non-free Whitehead group, to prove that it is consistent that every Whitehead group is free but not every hereditarily separable group is free. We also show that the fact that Z is a p.i.d. with i...

متن کامل

On the genericity of Whitehead minimality

We show that a finitely generated subgroup of a free group, chosen uniformly at random, is strictly Whitehead minimal with overwhelming probability. Whitehead minimality is one of the key elements of the solution of the orbit problem in free groups. The proofs strongly rely on combinatorial tools, notably those of analytic combinatorics. The result we prove actually depends implicitly on the ch...

متن کامل

A Combinatorial Principle]A Combinatorial Principle Equivalent to the Existence

As a consequence of identifying the principle described in the title, we prove that for any uncountable cardinal λ, if there is a λ-free Whitehead group of cardinality λ which is not free, then there are many “nice” Whitehead groups of cardinality λ which are not free.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011