(

8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8

N
-FREE ABELIAN GROUP WITH NO
NON-ZERO HOMOMORPHISM TO Z
SH883
Saharon Shelah
The Hebrew University of Jerusalem
Einstein Institute of Mathematics
Edmond J. Safra Campus, Givat Ram
Jerusalem 91904, Israel
Department of Mathematics
Hill Center-Busch Campus
Rutgers, The State University of New Jersey
110 Frelinghuysen Road
Piscataway, NJ 08854-8019 USA
Abstract. We, for any natural n, construct an
n
-free abelian groups which have
few homomorphisms to Z. For this we use
n
-free (n+1)-dimensional black boxes.
The method is hopefully relevant to other constructions of
n
-free abelian groups.
I would like to thank Alice Leonhardt for the beautiful typing.
This research was supported by German-Israeli Foundation for Scientic Research and Develop-
ment
First Typed - 06/Mar/6
Latest Revision - 09/Mar/5
Typeset by A
M
S-T
E
X
1
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8


2 SAHARON SHELAH
Annotated Content
1 Constructing
k()+1
-free Abelian group
[We introduce x is a combinatorial k()-parameter. We also give a short
cut for getting only there is a non-Whitehead
k()+1
-free non-free abelian
group (this is from 1.6 on). This is similar to [Sh 771, 5], so proofs are
put in an appendix, except 1.14, note that 1.14(3) really belongs to 3.]
2 Black boxes
[We prove that we have black boxes in this context, see 2.1; it is based on
the simple black box. Now 2.3 belongs to the short cut.]
3 Constructing abelian groups from combinatorial parameter
[For x K
cb
k()+1
we dene a class G
x
of abelian groups constructed from it
and a black box. We prove they are all
k()+1
-free of cardinality [[
x
+
0
and some G G
x
satises Hom(G, Z) = 0.]
4 Appendix 1
[We give adaptation of the proofs from [Sh 771, 5] with the relevant
changes.]
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8

n
-FREE ABELIAN GROUP, ETC. 3
0 Introduction
For regular =
n
we look for a -free abelian group G with Hom(G, Z) = 0.
We rst construct G and a pure subgroup Zz G which is not a direct summand.
If instead not direct product we ask not free so naturally of cardinality , we
know much: see [EM02].
We can ask further questions on abelian groups, their endormorphism rings,
similarly on modules; naturally questions whose answer is known when we demand

1
-free instead
n
-free; see [GbTl06] . But we feel those two cases can serve as
a base for signicant number of such problems (or we can immitate the proofs).
Also these cases are reasonable for sorting out the set theoretical situation. Why
not =

and higher cardinals? (there are more reasonable cardinals for which
such results are not excluded), we do not fully know: note that also in previous
questions historically this was harder.
Note that there is such an abelian group of cardinality
1
, by [Sh:98, 4] and see
more in Gobel-Shelah-Stru ungman [GShS 785]. However, if MA then
2
< 2

any
2
-free abelian group of cardinality < 2

0
fail the question.
The groups we construct are in a sense complete, like

Z. They are close to
the ones from [Sh 771, 5] but there S = 0, 1 as there we are interested in Borel
abelian groups. See earlier [Sh 161], see representations of [Sh 161] in [Sh 523, 3],
[EM02].
However we still like to have =

, i.e.

-free abelian groups. Concerning

this we continue in [Sh 898].
We thank Ester Sterneld and R udiger Gobel for corrections.
We shall use freely the well known theorem saying
0.1 Theorem. A subgroup of a free abelian group is a free abelian group.
0.2 Denition. 1) Pr(, ): means that for some

G we have:
(a)

G = G

: + 1)
(b)

G is an increasing continuous sequence of free abelian groups
(c) [G
+1
[ ,
(d) G
+1
/G

is free for < ,

(e) G
0
= 0
(f) G

/G

is free if
(g) some h Hom(G

; Z) cannot be extended to

h Hom(G
+1
, Z).
2) We let Pr

(, , ) be dened as above, only replacing G

+1
/G

is free for
< by G
+1
/G

is -free.
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8


4 SAHARON SHELAH
1 Constructing
k()+1
-free abelian groups
1.1 Denition. 1) We say x is a combinatorial parameter if x = (k, S, ) =
(k
x
, S
x
,
x
) and they satisfy clauses (a)-(c)
(a) k <
(b) S is a set (in [Sh 771], S = 0, 1),
(c)
k+1
(

S) and for simplicity [[

0
if not said otherwise.
1A) We say x is an abelian group k-parameter when x = (k, S, , a) such that
(a),(b),(c) from part (1) and:
(d) a is a function from to Z.
2) Let x = (k
x
, S
x
,
x
) or x = (k
x
, S
x
,
x
, a
x
). A parameter is a k-parameter for
some k and K
cb
k()
/K
gr
k()
is the class of combinatorial/abelian group k()-parameters.
3) We may write a
x
,n
instead a
x
(, n). Let w
k,m
= w(k, m) = k : ,= m.
4) We say x is full when
x
=
k()
(

S).
5) If
x
let x be (k
x
, S
x
, ) or (k
x
, S
x
, , a ()) as suitable. We may
write x = (y, a) if a = a
x
, y = (k
x
, S
x
,
x
).
1.2 Convention. If x is clear from the context we may write k or k(), S, , a instead
of k
x
, S
s
,
x
, a
x
.
A variant of the above is
1.3 Denition. 1) For

S = S
m
: m k) we dene when x is a

S-parameter:

x
m k
x

m


(S
m
).
2) We say is a (x, )-black box or witness Qr(x, ) when:
(a) =
m
: m k
x
)
(b) =

:
x
)
(c)

=
,m,n
: m k
x
, n < ) and
,m,n
<
m
(d) if h
m
:
x
m

m
for m k
x
then for some
x
we have: m k
x
n <
h
m
( m, n)) =
,m,n
, see clause (a) of Denition 1.4 below on
m, n) and
x
m
.
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8

n
-FREE ABELIAN GROUP, ETC. 5
2A) We may replace by if = : k
x
). We may replace x by
x
(so say
Qr(
x
, ) or say is a (, )-black box).
3) We say a parameter x is

S-full or x is a full (

S, k)-parameter when
x
=

mk

(S
m
).
1.4 Denition. For a k()-parameter x and for m k() let
(a)
x
m
=
x,m
= : =

: k()) and
m

>
S and k() ,=
m

S and for some

we have n < , =

m, n) where
=

m, n) means
m
=

m
n and k() ,= m

(b)
x
k()
is
x
m
: m k()
(c) m( ) = m if
x
m
.
1.5 Denition. 1) We say a combinatorial k()-parameter x is free when there is
a list

: < ()) of
x
such that for every for some m k() and some
n < we have
()

m
m, n) /

m
m, n) : < .
2) We say a combinatorial k-parameter x is -free when x = (k, S
x
, ) is free
for every
x
of cardinality < .
Remark. 1) We can require in () even (

n)[

m
(n) /

(n

) : k, <
, n

< ].
At present this seems an immaterial change.
1.6 Denition. For k() < and an abelian group k()-parameter x we dene
an abelian group G = G
x
as follows: it is generated by x

: m k() and

x
m
y
,n
: n < and
x
z freely except the equations:

,n
(n!)y
,n+1
= y
,n
+a
x
,n
z +

x
<m,n>
: m k().
1.7 Explanation. A canonical example of a non-free group is (Q, +). Other examples
are related to it after we divide by something. The ys here play the role of providing
(hidden) copies of Q. What about xs? For we consider y
,n
: n < ), as
a candidate to represent (Q, +), k() + 1, opportunities to avoid having (Q, +)
as a quotient, say by dividing K by a subgroup generated by some of the xs.
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8


6 SAHARON SHELAH
This is used to prove G
x
is not free even not
k()+2
-free, which is necessary. But
for each m k() if x
(m,n)
: n < ) are not in K, or at least x
(m,n)
for n
large enough then Q is not represented using y
,n
: n < ); so we have k() + 1
opportunities to avoid having y
,n
: n < ) represent (Q, +) in the quotient,
one for each innite cardinal
k()
. This helps us prove
k()
-freeness. More
specically, for each m() k() if H G is the subgroup which is generated by
X = x
<m,n>
: m ,= m() and
k()+1
(

S) and m k(), still in G/H the set

y
,n
: n < does not generate a copy of Q, as witnessed by x
<m(),n>
: n < .
As a warm up we note:
1.8 Claim. For k() < and k()-parameter x the abelian group G
x
is an
1
-free
abelian group.
Now systematically
1.9 Denition. Let x be a k()-parameter.
1) For U

S let G
U
= G
x
U
be the subgroup of G generated by Y
U
= Y
x
U
= z
y
,n
:
k()+1
(U) and n < x
<m,n>
: m k() and
(k()+1)
(U)
and n < . Let G
+
U
= G
x,+
U
be the divisible hull of G
U
and G
+
= G
+
(

S)
.
2) For U

S and nite u

S let G
U,u
be the subgroup
1
of G generated by
G
U(u\{})
: u; and for
k()
U let G
U,
be the subgroup of G generated
by G
U{
k
:k<g( ) and k=}
: < g( ).
3) For U

S let
U
=
x
U
= the equation
,n
:
k()+1
U and n < .
Let
U,u
=
x
U,u
=
U(u\{})
: u.
1.10 Claim. Let x K
k()
.
0) If U
1
U
2


S then G
+
U
1
G
+
U
2
G
+
.
1) For any n() < , the abelian group G
+
U
(which is a vector space over Q), has
the basis Y
n()
U
:= z y
,n()
:
k()+1
(U) x
<m,n>
: m k(),

k()+1
(U) and n < .
2) For U

S the abelian group G
U
is generated by Y
U
freely (as an abelian group)
except the set
U
of equations.
3) If m() < and U
m


S for m < m() then the subgroup G
U
0
+. . . +G
U
m()1
of G is generated by Y
U
0
Y
U
1
. . . Y
U
m()1
freely (as an abelian group) except
the equations in
U
0

U
1
. . .
U
m()1
.
3A) Moreover G/(G
U
0
+ . . . + G
U
m()+1
) is
1
-free provided that
if
0
, . . . ,
k()
U
m
: m < m() are such that
1
note that if u = {} then G
U,u
= G
U
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8

n
-FREE ABELIAN GROUP, ETC. 7
( k())(m < m())[
0
, . . . ,
k()

U
m
)
then for some m < m() we have
0
, . . . ,
k()
U
m
.
4) If m() k() and U

= UU

for < m() and U

: < m()) are pairwise

disjoint then holds.
5) G
U,u
G
Uu
if U

S and u

SU is nite; moreover G
U,u

pr
G
Uu

pr
G.
6) If U

: < ()) is -increasing continuous then also G

U

: < ()) is
-increasing continuous.
7) If U
1
U
2
U

S and u

SU is nite, [u[ < k() and U
2
U
1
= and
v = u then (G
U,u
+ G
U
2
u
)/(G
U,u
+ G
U
1
u
) is isomorphic to G
U
1
v
/G
U
1
,v
.
8) If U

S and u

SU has k() members then (G
U,u
+ G
u
)/G
U,u
is
isomorphic to G
u
/G
,u
.
1.11 Discussion: For the readers benet we write what the group G
x
is for the case
k() = 0. So, omitting constant indexes and replacing sequences of length one by
the unique entry we get that it is generated by y
,n
(for

S, n < ) and x

(for

>
S) freely as an abelian group except the equations (n!)y
,n+1
= y
,n
+x
n
.
Note that if K is the countable subgroup generated by x

:
>
2 then G/K
is a divisible group of cardinality continuum hence G is not free. So G is
1
-free
but not free.
Now we have the abelian group version of freeness, the positive results in 1.12, 1.13
and the negative results in 1.13.
1.12 The Freeness Claim. Let x K
k()
.
1) The abelian group G
Uu
/G
U,u
is free if U

S, u

SU and [u[ k k()
and [U[
k()k
.
2) If U

S and [U[
k()
, then G
U
is free.
1.13 Claim. 1) If x is a combinatorial k()-parameter then x is
k()+1
-free.
2) If x is an abelian group k()-parameter and (k
x
, S
x
,
x
) is free, then G
x
is free.
Proof. 1) Easily follows by (2).
2) Similar and follows from 3.2 as easily G belongs to G
(k(),S
x
,
x), see Denition
3.3.
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8


8 SAHARON SHELAH
1.14 Claim. Assume x K
cb
k()
is full (i.e.
x
=
k()+1
(

(S
x
))).
1) If U

S and [U[ ([S[ +
0
)
+(k()+1)
, the (k() +1)-th successor of [S[ +
0
.
Then G
x
U
is not free.
2) If [S
x
[
k()+1
then G
x
is not free.
3) Assume x K
cb
k()
, [S
x

[ +

<
+1
for < k() and [
x
[
k()
and G G
x
(see Denition 3.3) then G is not free.
Proof. 1) Let

= [S[. Assume toward contradiction that G

U
is free and let
be large enough; for notational simplicity assume [U[ =
+k()+1
, this is O.K.
as a subgroup of a free abelian group is a free abelian group. We choose N

by
downward induction on k() such that
(a) N

is an elementary submodel
2
of (H (), , <

)
(b) |N

| = [N

+k()
[ =
+
and :
+
N

(c) x

:
x
k()
), y
,n
:
x
and n < ), U and G
U
belong to N

and
N
+1
, . . . , N
k()
N

.
Let G

= G
U
N

, a subgroup of G
U
. Now
()
0
G
U
/(G

: k()) is a free (abelian) group

[easy or see [Sh 52], that is:
as G
U
is free we can prove by induction on k k()+1 then G/(G
k()+1
:
< k) is free, for k = 0 this is the assumption toward contradiction, the
induction step is by Ax VI in [Sh 52] for abelian groups and for k = k() +1
we get the desired conclusion.]
Now
()
1
letting U
1

be U for = k() + 1 and

k()

m=
(N
m
U) for k(); we have:
U
1

has cardinality
+
for k() + 1
[Why? By downward induction on . For = k() + 1 this holds by an
assumption. For = k() this holds by clause (b). For < k() this holds
by the choice of N

as the set
k()

m=+1
(N
m
U) has cardinality
++1

and belong to N

and clause (b) above.]

2
H () is {x: the transitive closure of x has cardinality < } and <

is a well ordering of
H ()
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8

n
-FREE ABELIAN GROUP, ETC. 9
()
2
U
2

=: U
1
+1
(N

U) has cardinality
++1
for k()
[Why? As [U
1
+1
[ =
+1
>

= |N

| [N

U[.]
()
3
for m < k() the set U
3
m,
=: U
2

r=m
N
r
has cardinality
+m
[Why? By downward induction on m. For m = 1 as U
2

N
m
and
[U
2

[ =
++1
and clause (b). For m < 1 similarly.]
Now for = 0 choose

U
2

, possible by ()
2
above. Then for > 0, k()
choose

U
3
0,
. This is possible by ()
3
. So clearly
()
4

U and

N
m
U ,= m for , m k().
[Why? If = 0, then by its choice,

U
2

, hence by the denition of U

2

in
()
2
we have

/ N

, and

U
1
+1
hence

N
+1
. . . N
k()
by ()
1
so ()
4
holds for = 0. If > 0 then by its choice,

U
3
0,
but U
3
m,
U
2

by ()
3
so

U
2

hence as before

N
+1
. . . N
k()
and

/ N

.
Also by ()
3
we have

r=0
N

so ()
4
really holds.]
Let

: k()) and let G

be the subgroup of G
U
generated by x
<m,n>
:
m k() and
k()+1
U and n < y
,n
:
k()+1
U but ,=

and n < .
Easily G

recalling G

= N

G
U
hence G

: k() G

, but y

,0
/ G

hence
()
5
y

,0
/

: k().
But for every n
()
6
n!y

,n+1
y

,n
= x

<m,n>
: m k() G

: k().
[Why? x

<m,n>
G
m
as

(k()) + 1m) N
m
by ()
4
.]
We can conclude that in G
U
/

: k(), the element y

,0
+

:
k() is not zero (by ()
5
) but is divisible by every natural number by ()
6
.
This contradicts ()
0
so we are done.
2),3) Left to the reader.
1.14
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8


10 SAHARON SHELAH
2 Black Boxes
2.1 Claim. 1) Assume k() < , =

0
, =
k()
() and S = , =
k()+1
(

S)
or just S

() =

for k() and =

k()

(S

) and
x = (k(), , ) so x is a full combinatorial S

: k())-parameter. Then has

a -black box, i.e. Qr(
x
k() , ), see Denition 1.3.
2) Moreover, x has the

: k())-black box, i.e. for every

B = B

:

x
k()
) satisfying clause (c) below we can nd h

: ) such that:
(a) h

is a function with domain m, n) : m k(), 2 n <
(b) h

( m, n)) B
<m,n>
(c) B
m,n
is a set of cardinality
m
(d) if h is a function with domain
x
k()
, see Denition 1.4 such that h(
m, n)) B
( <m,n>)
for , m k(), n < and

<

for k()
then for some
x
, h

h and

(0) =

for k().
3) Assume

,
+1
=

+1
for k(). If S

for simplicity, for

k(), x is a full combinatorial (

S, k())-parameter, and [B
<m,n>
[
k()
for

x
then we can nd h

:
x
) as in part (2), moreover such that:
(e) if then

is increasing
(f) if

is regular then we can in clause (d) above add: if E

is a club of

for
k() then we can demand: if
x
then for each for some

<

we have

(E

)
(g) if

is singular of uncountable conality,

=
,i
: i < cf(

),
cf(
i,
) =
i,
increasing with i we can add: if u

cf(

) is unbounded,
E
,i
a club of
,i
then

(E
i,

) for some i u

.
Proof. Part (1) follows form part (2) which follows from part (3), so let us prove
part (3). To uniformize the notation in 2.1(1), i.e. 1.3(2) and 2.1(2),(3) we shall
denote:

1
h

( m, n)) =
k()
,m,n
.
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8

n
-FREE ABELIAN GROUP, ETC. 11
Note that without loss of generality
3

x
k()
B

= [B

[, i.e. without loss
of generality
x
n < m k() B
<m,n>
=
n
and we use
k()
,m,n
=
h

( m, n)) for
x
, m k() and n < . We prove part (3) by induction on
k(). Let
k
=
x
and without loss of generality S

.
Case 1: k() = 0.
By the simple black box, see [Sh 300, III,4], or better [Sh:e, VI,2], see below
for details on such a proof.
Case 2: k() = k + 1.
Let

2

k
=
k
,m,n
:
k
, n < , m k) witness parts (2),(3) for k, i.e. for x
k
,
hence no need to assume x
k
is full.
So =
k()
, =
k()
and let H = h : h is a function from
k
to . So
[H[ ()

0
k
= . By the simple black box, see below, we can nd

:

)
such that

3
()

h

= h
,n
: n < ) and h
,n
H for

() if

f = f

:
>
) and f

H for every such and <

and
>
is increasing then for some increasing

we have and n < h

,n
= f
n
() if cf() >
0
and E is a club of then we can add (n) : n <
E.
[Why? First assume = . Let g

= g
,
: < n

) : < ) enumerate
>
H
such that for each g
>
H the set < : g

= g is unbounded in . Now
for

and n < let h
,n
= g
(k),n
for every k large enough if well dened
and g
(n+1),n
otherwise. So clause () of
3
holds and as for clause () of
3
, let

f = f

:
>
) be given, f

H.
Assume
>
is increasing. We choose
n
by induction on n < such that:

4
()
n
= (n) if n < g()
3
Why? (As doubts were cast we shall elaborate.) For
k()
let B

= {i : i < |B

|} for

k()
and let g

be a one-to-one function from B

onto B

. Now assume that h

:
k()

is as required in the claim for B

: and dene a fucntion h

with domain Dom(h

) =
{ m, n : m k() and n < } such that h

( m, n) = g

(h

( m, n)) B
<m,n>
for
, m k(), n < . Dene the function h

with domain
k()
by h

( ) = g
1

h, so h

is well
dened with domain
k()
such that h

( ) B

. By the choice of h

:
k()
there is
such that m k() n < h

( m, n) = h

( m, n). But by the choice of h

, h

we have
m k() n < h

( m, n) = g
1

(h

( m, n)) = g
1

(h

( m, n) = h( m, n)
as required.
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8


12 SAHARON SHELAH
()
n
< and
n
>
m
if n = m + 1
() if n g() then
n
satises g

n
= f

:<m
: m n).
Now =:
n
: n < ) is as required in clause () of
3
; to get also clause () of

3
we should add in clause () of
4
then
n
> min(E
m
).
Second, if > but still

0
, let g

: <

0
) list
>
H, and let h
n
:
for n < be such
4
that < < (

n)(h
n
() ,= h
n
()) and let cd:
>

be one to one onto. Now for

and n < let h
,n
be g

where is the unique

ordinal < such that for every k < large enough (cd((k)))(n) = h
n
() so in
particular g(cd((k)) : k < ) is going to innity or h
,n
is not well dened; in
fact, we can use only the case g(cd((k)) = k; stipulating h
,n


0 when not
dened. So we have dened h
,n
:

, n < ). Now we immitate the previous
argument: clause () of
2
holds.
Next we shall dene
k()
=
k()
,m,n
:
k+1
, m k(), n < ) as required;
so let =

: k())
k()
we dene
k()

=
k()
,m,n
: m k(), n < ) as
follows:

5
if
k()


and
0
, . . . ,
k()1
)
k
then for m k() and n <
() if m = k() then
k()
,m,n
= h

k()
,n
(
0
, . . . ,
k()1
)) <
m
() if m < k(), i.e. m k then
k()
,m,n
=
k
k(),m,n
<
m
.
Clearly
k()
,m,n
<
m
in all cases, as required, (in clause (a),(b),(c) of 2.1(2) and
(e) of 2.1(3). But we still have to prove that
k()
,m,n
:
k+1
, m k(), n <
) witness Qr(x
k()
, ), see Denition 1.3(2) this suces for 2.1(2), little more is
needed for 2.1(3); just using () of
3
and the induction hypothesis.
Why does this hold? Let h be a function with domain
x
k()
k()
as in part (3) and

<

for k().
For
>
let f

:
k
=
k()
be dened by: f

: k)) =: h(

:
k))). So by
3
above for some increasing

k()


we have

k()
(0) =

k()
and

6
n < f

k()
n
= h

k()
,n
.
Now substituting the denition of

f we have

7

0
, . . . ,
k
)
k
n < h

k()
,n
(
0
, . . . ,
k
) = h(
0
, . . . ,
k
,

()
n)).
4
recall (

N) means for every large enough n <

(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8

n
-FREE ABELIAN GROUP, ETC. 13
Substituting the denition of
k
we have

8
if
0
, . . . ,
k
)
k
and n < then
k()
<
0
,...,
k
,

k()
>
= h(
0
, . . . ,
k
,

k()

n)).
Now we dene a function h

with domain
x
k
k
by: if
x
k
k
then h

( ) =
h(

k()
)).
So by the choice of
k
in
2
we can nd

0
, . . . ,

k
)
k
with no repetitions
such that

(0) =

for k and in
2

9
m k n <
k

0
,...,

k
,m,n
= h

0
, . . . ,

k
) (m, n))).
Let

0
, . . . ,

k
,

k+1
),

0
, . . . ,

i
).
Note that

10
if m k, n < then h

k, m)) = h((

m, n))

k()
)) = h(

m, n)).
Now by
9
+
10
and
5
() this means

11
if m k and n < then
k()

,m,n
= h(

k, m)).
So by putting together
8
+
11
we are clearly done, i.e. we can check that

0
, . . . ,

k
,

k()
) is as required.
2.1
2.2 Conclusion. For every k < there is an
k+1
-free abelian group G of cardinality

k+1
and pure (non-zero) subgroup Zz G such that Zz is not a direct summand
of G.
Proof. Let = 2

0
and x be a combinatorial k-parmeter as guaranteed by 2.1.
Now by 2.3(2) below we can expand x to an abelian group k-parameter, so G
x
is
as required.
2.3 Claim. 1) If x is a combinatorial k-parameter such that Qr(x, 2

0
) then for
some a, y := (x, a) is an abelian group k-parameter such that h Hom(G
y
, Z)
h(z) = 0.
2) For every k there is an
k+1
-free abelian group G of cardinality
k+1
and z G
a pure z G as above.
Proof. 1) Let witness Qr(x, 2

0
). We dene a function :Ord Z by: () in
if < , is n if = + n < + and is zero otherwise. For each
x
we
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8


14 SAHARON SHELAH
shall choose a sequence a
,n
: n < ) of integers such that for any b Z0 for
no c

Z do we have:

for each n < we have
n!c
n+1
= c
n
+a
,n
b + (
,m,n
) : m k().
This is easy: for each pair (b, c
0
) Z Z the set of a
n
: n < )

Z such that
there is at least one sequence (and always at most one sequence) c
0
, c
1
, c
2
, . . . ) of
integers such that

holds for them, is meagre, even no-where dense so the choice
of a
,n
: n < ) is possible.
Now toward contradiction assume that h is a homomorphism from G
x
to zZ
such that h(z) = bz, b Z0. We dene h

:
x
k
by h

( ) = n if n < and
h(x

) = nz and h

( ) = + n if n < and h(x

) = (n)z.
By the choice of , for some
x
we have: m k n < h

( m, n)) =

,m,n
. Hence h(x
(m,n)
) = (
,m,n
)z for m k, n < .
Let c
n
Z be such that h(y
,n
) = c
n
z. Now the equation
,n
in Denition 1.6
is mapped to the n-th equation in

, so an obvious contradiction.
2) By part (1) and 2.2.
2.3
2.4 Remark. 1) We can replace by a set of cardinality in Denition 1.3. Using
Zz instead of simplify the notation in the proof of 2.3.
2) We have not tried to save in the cardinality of G in 2.3(2), using as basic of the
induction the abelian group of cardinality
0
or
1
.
2.5 Claim. 1) If
0
=

0
0
,
m+1
= 2

m
and
m
=
m
for m k for the -full
combinatorial k-parameter x, the (x, )-black box exist.
2.6 Conclusion. Assume
0
< . . . <
k()
are strong limit of conality
0
(or

0
=
0
),

=
+

= 2

.
Then in 2.1 for
x
we can let h
,m
has domain
x
m
: [

for
= m + 1, . . . , k().
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8

n
-FREE ABELIAN GROUP, ETC. 15
3 Constructing abelian groups from combinatorial parameters
3.1 Denition. 1) We say F is a -regressive function on a combinatorial param-
eter x K
cb
k()
when S
x
is a set of ordinals and:
(a) Dom(F) is
x
(b) Rang(F) [
x

x
k()
]

0
(c) for every
x
and m k() we
5
have sup Rang(
m
) > sup(Rang(
m
) :
F( )); note

x
or
x
k()
as F( ) is a set of such objects.
1A) We say F is nitary when F( ) is nite for every .
1B) We say F is simple if
k()
(0) determined F( ) for
x
.
2) For x, F as above and
x
we say that is free for (x, F) when:
x
and
there is a sequence

: < ()) listing

F( ) : and sequence

: < ()) such that

(a)

k()
(b) if < () and

then F(

: <

m, n) : <
is such that

x
and n < , m k()
(c) if < () and

then for some n < we have

, n) /

, n) : < ,

: < .
3) We say x is -free for F is (x, F) is -free when x, F are as in part (1) and every

x
of cardinality < is free for (x, F).
3.2 Claim. 1) If x K
cb
k()
and F is a regressive function on x then (x, F) is

k()+1
-free provided that F is nitary or simple.
2) In addition: if k k(),
x
has cardinality
k
and u = u

: )
satises u

0, . . . , k(), [u

[ > k, then we can nd

: <
k
),

: <

k
), n

: <
k
) such that:
(a)

: <
k

(b) if

x
then

u

, n

<
(c)

, n

) /

, n

) : <

: < .
Remark. We may wonder:
5
actually, suce to have it for = k()
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8


16 SAHARON SHELAH
Ruedeger Question: Assume F( ) [
k()
]

0
for
x
is as in Denition 3.1.
Is this O.K. in the proof of 3.2, particularly Case 1?
Answer: Seems not. Assume ,= and
(A) u

=
1
, F( ) =
1
, n) : n <
(B) u

=
2
, F( ) =
2
, n) : n < .
So if (, ) = (

4
,

2
), we have
0
,=
1
as ,= , (
1
<
2
) by (B), and
(
2
<
1
) by (A).
Proof. 1) Follows by part (2) for the case k = k(), u

= 0, . . . , k() for every
.
2) So we are assuming x K
cb
k()
, F is a regressive function on x which is nitary
or simple, k k(),
x
has cardinality
k
and without loss of generality
is closed under F( )
x
. We prove this by induction on k.
Case 1: k = 0.
Subcase 1A: Ignoring F.
Let

: < [[) list with no repetitions (so < [[ <

k
=
0
). Now
< [[ u

,= and let

= min(u

) k(). Hence for each < [[ we know
that <

,=

, hence for some n = n

,
< we have

, n
,
) , =

, n
,
).
Let n

= supn
,
: < ), it is < as < . Now (

, n

) : < [[) is as
required.
Subcase 1B: F( ) is nite
6
.
Let

: < [[) list , we choose w

j
by induction on j j(), j() such
that:
(a) w
j
[[ is nite for j <
(b) j w
j+1
(c) if w
j
then F(

: w
j

(d) w
j()
= [[ and w
0
=
(e) w
j
w
j+1
(f) if j() = then w
j()
= w
j
: j < j().
6
If we assume for F( )
k()
then any list

: < || with no repetitions and

: < ||,

u

will do. Why? Because Y

:= {F(

) : < } is a nite subset of

k()
. Now for < || the set u
1

:= {n < :

, n belongs to Y

} is nite, and also for

each < the set u
r
, Y
,
:= {n < :

, n =

, n} is nite. As is nite we can

nd n = n

\Y

\ {Y
,
: < }. Now n

: < || is as required.
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8

n
-FREE ABELIAN GROUP, ETC. 17
No problem to do this; for clause (c) use F is regressive, the ordinals well ordered
but we elaborate. Assume that the nite w
j
[[ has been chosen. We dene
w
j,m
by induction on m such that w
j,m
[[ is nite and -increasing with m.
For m = 0 let w
j,m
= w
j
. If w
j,m
is dened let
w
j,m+1
= w
j,m
< [[ : for some w
j,m
we have

F(

) .
As w
j,m
is nite and [[ and each F(

) is nite and

: < [[ clearly
w
j,m+1
is nite [[.
Lastly, we let w
j+1
be w
j,m
: m < . If it is nite we have carried the
inductive step on j. If not, then w
j,m
: m < ) is -increasing and we let

j,m
= sup
,0
(i) : i < , w
j,m+1
w
j+m
and it suces to prove
()
j,m
>
j,m+1
(both are ordinals!).
Why () is true? As by the denition of
j,m+1
for some i

< and

w
j,m+2
w
j,m+1
we have
,0
(i

) =
j,m+1
. By the denition of w
j,m+2
as

/
w
j,m+1
, there is

w
j,m+1
such that

F(

) .
As

/ w
j,m+1
necessarily

/ w
j,m
hence by the denition of
j,m
we know
that (i < )(
,0
(i) <
j,m
). By clause (c) of Denition 3.1(1) as

F(

) we
know that
,0
(i

) < sup
,0
(i) : i < . By the last two sentences we are done
proving (), so we are done dening w
j+1
hence we nish justifying .
Now let (j, i) : i < i

j
) list w
j+1
w
j
such that: if i
1
, i
2
< i

j
and
(j,i
1
)

F(
(j,i
2
)
) then i
1
< i
2
; we prove existence by F being regressive. Let
j,i
: i < i

j
)
list F(

) : w
j+1
w
j

x
F(

) : w
j
.
Let

j
= i

j(1)
+i

j(1)
: j(1) < j. Now we choose

for <

j
for j < j() as
follows:
(a)

j
+i
=
j,i
if i < i

j
(b)

j
+i

j
+i
=
(j,i)
if i < i

j
.
Lastly, we choose n

j
+i
< for i < i

j
as in case 1A.
Now check.
Subcase 1C: F is simple.
Note that F( ) when dened is determined by
k()
(0) and is included in

x
k()

x
: sup Rang(
k()
) <
k()
(0). So let u =
k()
(0) : and
u

= usup(u) +1 and for u let

= :
k()
(0) = and for u

(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8


18 SAHARON SHELAH
let
<
=

: u. Now by induction on u

we choose (

) : <

)
such that it is a required for
<
. For = min(u) this is trivial and if otp(u )
is a limit ordinal this is obvious. So assume = max(u ), we use Subcase 1A
on

, and combine them naturally promising

= k() n

> 1.
Case 2: k = k

+ 1 and [[ =
k
.
Let

: <
k
) be -increasing continuous with union , [
1+
[ =
k

,
0
= ,
each

closed enough, mainly:

1
if
i

for i < i() < , and

: k()
i

: k(), i <
i() then

is closed under F( )
x
.
Next
if <
k
,
+1

then u

= u

: for every or just some n < for
some

we have , n) = , n) has at most one member.

[Why? So assume toward contradiction that
+1
and (1) ,= (2) belong to
u

. Hence by the denition of u

there are
1
,
2

and n
1
, n
2
< such that

1
, n
1
)
1

1
, n
1
) and
1
, n
2
) =
2

2
, n
2
). Now m k() for
some i 1, 2, m
i
for some i 1, 2,
m
is (
i
, n
i
))
m

m

. Hence

: k()

: k() and

. So by
1
we have

, so we are done.]
Apply the induction hypothesis to
+1

for each and get (

,
,
,,n
,
) :
< ()) such that
,

,
, n
,
) /
,

,
, n
,
) : < ).
Let

= () : < [[ and = () : < + , < () let

=
,
,

=
,
,

=
,
. I.e. we combine but for
+1

we use u

u

:

+1

), so [u

u

[ k 1 = k

.
3.2
3.3 Denition. For a combinatorial parameter x we dene G
x
, the class of abelian
groups derived from x as follows: G G
x
if there is a simple (or nitary) regressive
F on
x
and G is generated by y
,n
:
x
, n < x

:
x
k()
freely
except

,n
(n!)y
,n+1
= y
,n
+ b
,n
z
,n
+

x
<m,n>
: m k()
where
(a) b
,n
Z
(b) z
,n
is a linear combination of
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8

n
-FREE ABELIAN GROUP, ETC. 19
x

: F( )
x
y
,n
: F( )
x
and
(m k())( m, n)) F( ).
3.4 Claim. If x K
cb
k()
and G G
x
(i.e. G is an abelian group derived from x),
then G is
k()+1
-free.
Proof. We use claim 3.2. So let H be a subgroup of G of cardinality
k()
. We
can nd such that
() (a)
x
has cardinality
k()
(b) every equation which X

= x
<m,n>
, y
,n
: m k(), n < ,
satises in G, is implied by the equations from

=
,n
:

(c) H G

= x
<m,n>
, y
,n
: , m k(), n < )
G
(d) if then F( ) is included in (, n) : , k() and
n < .
So it suces to prove that G

is a free (abelian) group.

Let the sequence (

) : < ()) be as proved to exist in 3.2. Let U =

< () :

() and for () let X

0

= x

<m,n>
:
U , m k() and n < and X
1

= X
0

: U . So for each U
there is n

= n
,
: v

) such that:

0, . . . , k(), n
,
< and
X
1
+1
X
1

= x
<,n>
: v

and n [n
,
, ).
For () let G
,
= y

,n
, x

: U and X
1

)
G

. Clearly
G
,
: ()) is purely increasing continuous with union G

, and G
,0
= 0.
So it suces to prove that G
,+1
/G
,
is free. If / U the quotient is trivially a
free group, and if U we can use

to prove that it is free giving a basis.

3.4
3.5 Conclusion. For every k() < there is an
k()+1
-free abelian group G of
cardinality =
k()+1
such that Hom(G, Z) = 0.
Proof. We use x and h

:
x
) from 2.1(3), and we shall choose G G
x
. So G
is
k()+1
-free by 3.4.
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8


20 SAHARON SHELAH
Let S = (a
i
,
i
) : i < i
1
)(b
j
,
j
, n
j
) : j < j
1
) : i
1
< , a
i
Z,
i

x
k()
and j
1
< , b
j
Z,
j

x
, n
j
< (actually S =
x
k()
suce noting
j
=

j,
: k())).
So [S[ =
k()
and let p be such that:
(a) p = p

: < )
(b) p lists S
(c) p

= (a

i
,

i
) : i < i

)(b

j
,

j
, n

j
) : j < j

) so

j
=

j,
: k())
(d) sup Rang(

i,k()
) < , sup Rang(

j,k()
) < if i < i

, j < j

.
Now to apply Denition 3.3 we have to choose z

(for Denition 3.3) as a

i
x

i
:
i < i

+ b

j
y

j
,n

j
: j < j

and z

= z
,n
= z

k()
(0)
for
x
, n < then for

x
we choose b
,n
: n < )

Z such that:
there is no function h fromz

y
,n
: n < x
<m,n>
: m k(), n <
into Z satisfying
(a) h(z

) ,= 0 and
(b) h(x
<m,n>
) = h

( m, n)) for m k(), n <
(c) for every n sn
()
n
n!h(y
,n+1
) = h(y
,n
) + b
,n
h(z

) + x
<m,n>
):
m k().
E.g. for each

2 we can try b

n
= (n) and assume toward contradiction that
for each

2 there is h

as above. Hence for some c Z0 the set

2 :
h

(z

) = c is uncountable. So we can nd
1
,=
2
such that h

1
= c = h

2
(x

)
and
1
([c[ + 7) =
2
([c[ + 7). So for some n [c[ + 7,
1
n =
2
n and

1
(n) ,=
2
(n). Now consider the equation ()
n
for h

1
and h

2
, subtract them and
get (
1
(n)
2
(n))c is divisible by n!, clear contradiction.
So G G
x
is well dened and is
k()+1
-free by 3.4. Suppose h Hom(G, Z) is
non-zero, so for some <
k()
, h(z

) ,= 0 (actually as G
1
= x

:
x
k()
)
G
is a subgroup such that G/G
1
is divisible necessarily h G
1
is not zero hence in
2.1(2) for some
x
k()
we have h(x

) ,= 0). So by the choice of h

: )
for some
x
,
k()
(0) = and we have h

= h x
<m,n>
: m k(), n < .
By we clearly get a contradiction.
3.5
Remark. We can give more details as in the proof of 2.3.
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8

n
-FREE ABELIAN GROUP, ETC. 21
3.6 Conclusion. For every n m < there is a purely increasing sequence G

:

n
+1) of abelian groups, G

, G

/G

are free for <

n
and G

n
+1
/G

n
is
n
-free and for some h Hom(G

, Z) has no extension in Hom(G

n
+1
, Z).
Proof. Let G, z be as in 2.2. So also G/Zz is
n
-free. Let G

= z)
G
for

2
, G

n
+1
= G.
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8


22 SAHARON SHELAH
4 Appendix 1
4.1 Notation. If

x
m
and =

k() : ,= m and =

m
then let
x
m, ,
:= x

. (See proof of 1.12).
Proof of 1.8. Let U

S be countable (and innite) and dene G

U
like G re-
stricting ourselves to

U; by the Lowenheim-Skolem argument it suces to

prove that G

U
is a free abelian group. List
k()+1
U without repetitions as

t
: t < t

), and choose s
t
< by induction on t < such that [r < t &
r

k() =
t
k() =
t,k()
: [s
t
, )
r,k()
: [s
r
, )].
Let
Y
1
= x
m, ,
: m < k(),
k()+1\{m}
U and
>
2
Y
2
=

x
m, ,
:m = k(),
k()
U and for no t < t

do we have
=
t
k() &
t,k()
: s
t
<

Y
3
= y

t
,n
: t < t

and n [s
t
, ).
Now
()
1
Y
1
Y
2
Y
3
z generates G

U
.
[Why? Let G

be the subgroup of G

U
which Y
1
Y
2
Y
3
generates. First we prove
by induction on n < that for
k()
U and
n
S we have x
k(), ,
G

. If
x
k(), ,
Y
2
this is clear; otherwise, by the denition of Y
2
for some < (in fact
= n) and t < such that s
t
we have =
t
k(), =
t,k()
.
Now
(a) y

t,+1
, y

t,
are in Y
3
G

.
Hence by the equation
,n
in Denition 1.6, clearly x
k(), ,
G

. So as Y
1

G

U
, all the generators of the form x
k(), ,
with each

U are in G

.
Next note that
(b) x
m,
t
{ik():i=m},
belong to Y
1
G

if m < k().
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8

n
-FREE ABELIAN GROUP, ETC. 23
Now for each t < we prove that all the generators y

t
,n
are in G

. If n s
t
then clearly y

t
,n
Y
3
G

. So it suces to prove this for n s

t
by downward
induction on n; for n = s
t
by an earlier sentence, for n < s
t
by
,n
. Together all
the generators are in this subgroup so we are done.]
()
2
Y
1
Y
2
Y
3
z generates G

U
freely.
[Why? Translate the equations, see more in [Sh 771, 5].]

1.8
Proof of 1.10. 0), 1) Obvious.
2),3),4) Follows.
5) Let

: < m()) list u, U

= U (u

) so G
U,u
= G
U
+
0
. . . + G
U
m()1
.
First, G
U,u
G
Uu
follows by the denitions. Second, we deal with proving
G
U,u

pr
G
Uu
. So assume z

G, a

Z and a

belongs to G
U
0
+. . . +G
U
m()
so it has the form b
i
x

<m
i
,n
i
>
: i < i() + c
j
y

j
,n
j
: j < j() + az with
i() < , j() < and a

, b
i
, c
j
Z and
i
,
i
,
j
are suitable sequences of members
of U
(i)
, U
(i)
, U
k(j)
respectively where (i), k(j) < m(). We continue as in [Sh 771].
6) Easy.
7) Clearly U
1
v = U
2
u hence G
U
1
u
G
U
1
v
= G
U
2
u
hence G
U,u
+ G
U
1
u
is
a subgroup of G
U,u
+ G
U
2
u
, so the rst quotient makes sense.
Hence (G
U,u
+G
U
2
u
)/(G
U,u
+G
U
1
u
) is isomorphic to G
U
2
u
/(G
U
2
u
(G
U,u
+
G
U
1
u
)). Now G
U
1
,v
G
U
1
v
= G
U
2
v
G
U,u
+ G
U
2
,u
and G
U
1
,v
G
U,v
=
G
U,v\U
= G
U,u
G
U,u
+ G
U
2
,u
. Together G
U
1
,v
is included in their intersection,
i.e. G
U
2
u
(G
U,u
+ G
U
1
u
) include G
U
1
,v
and using part (1) both has the same
divisible hull inside G
+
. But as G
U
1
,v
is a pure subgroup of G by part (5) hence of
G
U
1
v
. So necessarily G
U
1
u
(G
U,u
+ G
U
1
,u
) = G
U
1
,v
, so as G
U
2
u
= G
U
1
v
we
are done.
8) See [Sh 771, 5].
1.10
Proof of 1.12. 1) We prove this by induction on [U[; without loss of generality [u[ =
k as also k

= [u[ satises the requirements.

Case 1: U is countable.
So let

: < k list u be with no repetitions, now if k = 0, i.e. u = then

G
Uu
= G
U
= G
U,u
so the conclusion is trivial. Hence we assume u ,= , and let
u

:= u

for < k.
Let
t
: t < t

) list with no repetitions the set

U,u
:=
x

k()+1
(U
u): for no < k does
k()+1
(U u

). Now comes a crucial point: let t < t

,
for each < k for some r
t,
k() we have
t,r
t,
=

by the denition of
U,u
, so
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8


24 SAHARON SHELAH
[r
t,
: < k[ = k < k() +1 hence for some m
t
k() we have < k r
t,
,= m
t
so for each < k the sequence
t
(k() + 1m
t
) is not from
s
: s k() and
s ,= m
t
) :
s


(U u

) for every s k() such that s ,= m

t
.
For each t < t

we dene J(t) = m k(): the set

t,s
: s k() & s ,= m
is included in U u

for no k. So m
t
J(t) 0, . . . , k() and m J(t)

t
j k() : j ,= m /
k()+1\{m}
(U u

) for every k. For m k() let

t,m
:=
t
j k() : j ,= m and

t
:=

t,m
t
. Now we can choose s
t
< by
induction on t < t

such that
() if t
1
< t, m k() and

t
1
,m
=

t,m
, then

t,m
s
t
/
t
1
,m
: < .
Let Y

= x
m, ,
G
Uu
: x
m, ,
/ G
Uu

for < k y
,n
G
Uu
: y
,n
/
G
Uu

for < k.
Let
Y
1
= x
m, ,
Y

: for no t < t

do we have m = m
t
& =

t
.
Y
2
= x
m, ,
Y

: x
m, ,
/ Y
1
but for no
t < t

do we have m = m
t
& =

t
&

t,m
t
s
t

t,m
t

Y
3
= y
,n
: y
,n
Y

and n [s
t
, ) for the t < t

such that =
t
.
Now the desired conclusion follows from
()
1
y + G
U,u
: y Y
1
Y
2
Y
3
generates G
Uu
/G
U,u
()
2
y + G
U,u
: y Y
1
Y
2
Y
3
generates G
Uu
/G
U,u
freely.
Proof of ()
1
. It suces to check that all the generators of G
Uu
belong to G

Uu
=:
Y
1
Y
2
Y
3
G
U,u
)
G
.
First consider x = x
m, ,
where
k()+1
(U u), m k() and
n
S for
some n < . If x / Y

then x G
U,u

for some < k but G

Uu

G
U,u
G

Uu
so we are done, hence assume x Y

. If x Y
1
Y
2
Y
3
we are done so assume
x / Y
1
Y
2
Y
3
. As x / Y
1
for some t < t

we have m = m
t
& =

t
. As x / Y
2
,
clearly for some t as above we have
t,m
t
s
t

t,m
t
. Hence by Denition
1.6 the equation

t
,n
from Denition 1.6 holds, now y

t
,n
, y

t
,n+1
Y
3
G

Uu
.
So in order to deduce from the equation that x = x

t
<m
t
,n>
belongs to G

Uu
, it
suces to show that x

t,j
<j,n>
G

Uu
for each j k(), j ,= m
t
. But each such
x

t,j
<j,n>
belong to G

Uu
as it belongs to Y
1
Y
2
.
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8

n
-FREE ABELIAN GROUP, ETC. 25
[Why? Otherwise necessarily for some r < t

we have j = m
r
,

t,j
=

r,m
r
and

r,m
r
s
r

t
n
r,m
r
so n s
r
and as said above n s
t
. Clearly r ,= t as
m
r
= j ,= m
t
, now as

t,m
r
=

r,m
r
and
t
,=
r
(as t ,= r) clearly
t,m
r
,=
r,m
r
.
Also (r < t) by () above applied with r, t here standing for t
1
, t there as
r,m
r

s
r

t,j
n
r,m
r
. Lastly for if t < r, again () applied with t, r here standing
for t
1
, t there as n m
t
gives contradiction.]
So indeed x G

Uu
.
Second consider y = y
,n
G
Uu
, if y / Y

then y G
U,u
G

Uu
, so assume
y Y

. If y Y
3
we are done, so assume y / Y
3
, so for some t, =
t
and
n < s
t
. We prove by downward induction on s s
t
that y
,s
G

Uu
, this clearly
suces. For s = s
t
we have y
,s
Y
3
G

Uu
; and if y
,s+1
G

Uu
use the
equation

t
,s
from 1.6, in the equation y
,s+1
G

Uu
and the xs appearing in
the equation belong to G

Uu
by the earlier part of the proof (of ()
1
) so necessarily
y
,s
G

Uu
, so we are done.
Proof of ()
2
. We rewrite the equations in the new variables recalling that G
Uu
is generated by the relevant variables freely except the equations of
,n
from
Denition 1.6. After rewriting, all the equations disappear.
Case 2: U is uncountable.
As
1
[U[
k()k
, necessarily k < k().
Let U =

: < where = [U[, list U with no repetitions. Now for each

[U[ let U

:=

: < and if < [U[ then u

= u

. Now

1
(G
U,u
+ G
U

u
)/G
U,u
: < [U[) is an increasing continuous sequence of
subgroups of G
Uu
/G
U,u
.
[Why? By 1.10(6).]

2
G
U,u
+ G
U
0
u
/G
U,u
is free.
[Why? This is (G
U,u
+ G
u
)/G
U,u
= (G
U,u
+ G
u
)/G
U,u
which by 1.10(8)
is isomorphic to G
u
/G
,u
which is free by Case 1.]
Hence it suces to prove that for each < [U[ the group (G
U,u
+G
U
+1
u
)/(G
U,u
+
G
U

u
) is free. But easily

3
this group is isomorphic to G
U

/G
U

,u

.
[Why? By 1.10(7) with U

, U
+1
, U,

, u here standing for U

1
, U
2
, U, , u
there.]

4
G
U

/G
U

,u

is free.
[Why? By the induction hypothesis, as
0
+ [U

[ < [U[
k()(k+1)
and
[u

[ = k + 1 k().]
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8


26 SAHARON SHELAH
2) If k() = 0 just use 1.8, so assume k() 1. Now the proof is similar to (but
easier than) the proof of case (2) inside the proof of part (1) above.

1.12
(
8
8
3
)


r
e
v
i
s
i
o
n
:
2
0
0
9
-
0
3
-
0
5







m
o
d
i
f
i
e
d
:
2
0
0
9
-
0
3
-
0
8

n
-FREE ABELIAN GROUP, ETC. 27
REFERENCES.
[EM02] Paul C. Eklof and Alan Mekler. Almost free modules: Set theoretic
methods, volume 65 of NorthHolland Mathematical Library. North
Holland Publishing Co., Amsterdam, 2002. Revised Edition.
[GbTl06] R udiger Gobel and Jan Trlifaj. Approximations and endomorphism
algebras of modules, volume 41 of de Gruyter Expositions in Mathe-
matics. Walter de Gruyter, Berlin, 2006.
[GShS 785] R udiger Gobel, Saharon Shelah, and Lutz Str ungmann. Almost-Free
E-Rings of Cardinality
1
. Canadian Journal of Mathematics, 55:750
765, 2003. math.LO/0112214.
[Sh:e] Saharon Shelah. Nonstructure theory, accepted. Oxford University
Press.
[Sh 898] Saharon Shelah. pcf and abelian groups. Forum Mathematicum,
preprint. 0710.0157.
[Sh 52] Saharon Shelah. A compactness theorem for singular cardinals, free
algebras, Whitehead problem and transversals. Israel Journal of Math-
ematics, 21:319349, 1975.
[Sh:98] Saharon Shelah. Whitehead groups may not be free, even assuming
CH. II. Israel Journal of Mathematics, 35:257285, 1980.
[Sh 161] Saharon Shelah. Incompactness in regular cardinals. Notre Dame Jour-
nal of Formal Logic, 26:195228, 1985.
[Sh 300] Saharon Shelah. Universal classes. In Classication theory (Chicago,
IL, 1985), volume 1292 of Lecture Notes in Mathematics, pages 264
418. Springer, Berlin, 1987. Proceedings of the USAIsrael Conference
on Classication Theory, Chicago, December 1985; ed. Baldwin, J.T.
[Sh 523] Saharon Shelah. Existence of Almost Free Abelian groups and re-
ection of stationary set. Mathematica Japonica, 45:114, 1997.
math.LO/9606229.
[Sh 771] Saharon Shelah. Polish Algebras, shy from freedom. Israel Journal of
Mathematics, 181:477507, 2011. math.LO/0212250.