The essentially free spectrum of a variety

Alan H. Mekler1 Department of Mathematics and Statistics, Simon Fraser University, Burnaby, B.C. V5A 1S6 CANADA Saharon Shelah2 Institute of Mathematics, Hebrew University, Givat Ram, 91904 Jerusalem, ISRAEL Otmar Spinas3 Department of Mathematics, University of California, Irvine, CA 92717, USA

ABSTRACT: We partially prove a conjecture from [MeSh] which says that the spectrum of almost free, essentially free, non-free algebras in a variety is either empty or consists of the class of all successor cardinals.
modified:1994-11-11

Introduction and notation

revision:1994-11-10

Suppose that T is a variety in a countable vocabulary . This means that is a countable set of function symbols and T is a set of equations, i.e. sentences of the form x1 , . . . , xn (1 (x1 , . . . , xn ) = 2 (x1 , . . . , xn )) where i are terms. The class of all
1 2

The author is supported by the NSERC The author is supported by the United StatesIsrael Binational Science Foundation;

publication 417. 3 The author is supported by the Schweizer Nationalfonds. 1

417

models of T will be denoted by Mod(T ), and a member of Mod(T ) is called an algebra in the variety T . Let M Mod(T ). For A M , A denotes the submodel of M generated by A. Such A is called a free basis (of A ) if no distinct a1 , . . . , an A satisfy an equation which is not provable from T . Moreover, M is called free if there exists a free basis of M , i.e. one which generates M . By F we denote the free algebra with free basis of size , where is a cardinal. For M1 , M2 Mod(T ), the free product of M1 and M2 is denoted by M1 M2 . Formally it is obtained by building all formal terms in the language with constants belonging to the disjoint union of M1 and M2 , and then identifying them according to the laws in T . For M, M : < such that M, M Mod(T ) and M is a submodel of M for all < , the free product of the M s over M is dened similarly, and it is denoted by M {M : < }; the intention being that distinct M , M are disjoint outside M except for those equalities which follow from the laws in T and the equations in Diag(M ) Diag(M ). Here Diag denotes the diagram of a model. For M, N Mod(T ) we say N/M is free if M is a submodel of N and there exists a free basis A of N over M , i.e. A is a free basis, N = M A and between members of A and M only those equations hold which follow from T and Diag(M ). Suppose |M | = . Then M is called almost free if there exists an increasing continuous family M : < cf() of free submodels of size < with union M . Moreover,
modified:1994-11-11

M is called essentially free if there exists a free M Mod(T ) such that M M is free, essentially non-free otherwise. The essentially free spectrum of the variety T which is denoted by EINC(T ), is the class of cardinals such that there exists M Mod(T ) of size which is almost free and essentially free, but not free. In [MeSh] the essentially non-free spectrum, i.e. the spectrum of cardinalities of almost free and essentially non-free algebras in a variety T , has been investigated, and it is shown that this spectrum has no simple description in ZFC, in general. Here we will show

revision:1994-11-10

that the situation is dierent for EINC(T ). Firstly, by a general compactness theorem due to the second author (see [Sh]), EINC(T ) contains only regular cardinals. Secondly, we will show that EINC(T ) is contained in the class of successor cardinals. Our conjecture is that EINC(T ) is either empty or equals the class of all successor cardinals (depending on T ). Motivating examples for this conjecture are among others Z/4Zmodules (where EINC is empty) and Z/6Zmodules (where EINC consists of all successor cardinals) (see [EkMe, p.90]). We succeed to prove the conjecture to a certain extent. Namely, we prove 2

417

the following theorem. Theorem. If for some cardinal , (0 )+ EINC(T ), then every successor cardinal belongs to EINC(T ). For the proof we will isolate a property of T , denoted Pr1 (T ), which says that a countable model of T with certain properties exists, and then show that, on the one hand, the existence of M Mod(T ) in any cardinality of the form (0 )+ implies that Pr1 (T ) holds, and on the other hand, from Pr1 (T ) an algebra M Mod(T ) can be constructed in every successor cardinality.

1. EINC(T) is contained in the class of successor cardinals

Theorem. For every variety T , EINC(T ) is contained in the class of successor cardinals. Proof: Suppose EINC(T ). By the main result of [Sh], must be regular. So
modified:1994-11-11

suppose is a regular limit cardinal. Let M Mod(T ) be generated by {a : < } and suppose that M is almost free and essentially free. We will show that then M must be free, and hence does not exemplify EINC(T ). By assumption and a Lwenheim-Skolem argument, M F is free. Let {c : < }, o {b : < } be a free basis of M F , F , respectively. Let be a large enough regular cardinal, and let C be the club consisting of all such that for some substructure A H(), ,

of size < which contains is a xed well-

revision:1994-11-10

M, F , {a : < }, {b : < } and {c : < }, we have A = . Here H() is the set of all sets which are hereditarily of cardinality < , and {c : < } = {a : < } {b : < } . Since M is supposed to be almost free, the set

ordering of H(). Note that the information about M reects to each C, especially

C0 = { C : {a : < } is free} 3

417

is still a club. Let , C0 be cardinals with < . We will show that {a : < } / {a : < } is free. This will suce to conclude that M is free since the cardinals below are a club and hence C1 = { C0 : is a cardinal} is a club such that for every , C1 with < , {a : < } / {a : < } is free. For the proof, let {d : < } be a free basis of {a : < } . As = || < || = we may assume {a : < } {d : < } . Hence easily {a : < } = {a : < } F ,

{a :<}

i.e. there exists an isomorphism which leaves {a : < } xed. But {a : < } F {c : < } and {c : < } / {c : < } is free. Moreover {c : < = } = {a : < } {b : < } and hence {c : < } / {a : < } is free. Consequently {a : < } / {a : < } is free.

2. EINC(T) is either empty or contains almost all successor cardinals

modified:1994-11-11

Denition 2.1. The property Pr1 (T ) says: There exist N, M Mod(T ) such that N is countably generated, M is a subalgebra of N and the following clauses hold: (i) M has a free basis; (ii) N F0 /M is free; (iii) M {N : n } F0 /M F0 is not free. Theorem 2.2. Suppose that Pr1 (T ) holds and is a successor cardinal. Then EINC(T ). Proof: Let = + . Let M, N witness Pr1 (T ). Let N = M {N : < }. We claim that M = N F exemplies that EINC(T ). Let {c : < } be a free basis of F . Firstly, M is almost free: For < let N = M {N : < }. Then clearly N F : < is a ltration of M. Moreover N F is free for every < , since easily N F M {N F : < } and by Pr1 (T ), M is free and N F0 /M is free. =
0

revision:1994-11-10

417

Secondly, M F N F is free, since N F M {N F0 : < } is free as in = = the proof of almost freeness. Thirdly, M is not free. By contradiction, suppose that I = {d : < } were a free basis of M. Let be a large enough regular cardinal, and let A that |B| = 0 , and A, + , N, M, N, M, F, I B. Let u = B \ (A ), v = A B , w = A B . Notice that w = B . Dene M1 = A B M. Now easily M1 is countably generated and it has the form M1 = M {N : v} {c : w} . Hence M1 M M {N : n } F0 M M {N F0 : n } M M F0 , where for the = = = last isomorphy we applied (ii) from Pr1 (T ). Next dene M2 = B M. Then easily M2 = M {N : u} M M1 . Hence by the isomorphy above we have M2 M {N : n } F0 . = By (iii) from Pr1 (T ) we conclude that M2 /M1 is not free. On the other hand, {d : u} witnesses that M2 /M1 is free, a contradiction. Theorem 2.3. Suppose , are cardinals such that = + , 0 = and EINC(T ). Then Pr1 (T ) holds. Proof: Let M exemplify EINC(T ). Let {a : < } generate M. Let F be free such that M F is free. Without loss of generality we may assume that F = F ; in fact, if H(), ,

such that

|A| = , + 1 A, and + , N, M, N, M, F, I A. Next choose B

H(), ,

such

modified:1994-11-11

revision:1994-11-10

|F | < then we may replace F by F F which is isomorphic to F , and if |F | > use a LwenheimSkolem argument. So let {b : < } be a free basis of F , and let {c : < } o be a free basis of N = M F . Let be a large enough regular cardinal, and let N , for every < , be a countable elementary substructure of H(), ,

such that , M, F, N, {a : < }, {b : <

}, {c : < } belong to N . Let u = N . By assumption on M (M is almost free), the set 5

417

{ < : {a : < } is free {c : < } = {a : < } {b : < } } contains a club; let C be the

least one. Hence C N for every < .

Using elementarity, it is easy to see that for every C the following three clauses hold ((1) holds for every < ): (1) {c : u } = {a : u } {b : u } ; (2) {c : u } = {a : u } {b : u } ; (3) { a : u } is free, and {a : } / { a : u } is free. To prove (3), let d : I be the

least free basis of {a : } . So by

elementarity d : I N and {d : I N } = {a : u } . Hence {d : I N } and {d : I \ N } witness that (3) holds. Moreover it is not dicult to see that C0 = { C : = {u : < }} is still a club. Hence S0 = { C0 : cf() > } is stationary. By Fodors Lemma, for some < , S1 = { S0 : u } is stationary. By assumption, | |0 0 < . So by thinning out S1 further (using this assumption and the completeness of the nonstationary ideal on ), we may nd a stationary S2 S1 and u such that for every 1 , 2 S2 the following hold:
modified:1994-11-11

(4) u1 1 = u ; (5) o.t.(u1 ) = o.t.(u2 ), and the unique order-preserving map h = h1 2 : u1 u2 induces (by c ch() ) an isomorphism from {c : u1 } onto {c : u2 } which maps a to ah() and b to bh() . Let = min(S2 \ ), M = {a : u } and N = {a : u } . As C, by elementarity we know that M is free. As {c : } is a free basis, clearly {c : u } / {c : u } is free, and by (2) and as S2 C, also {c : u } / M is free. Finally, {c : u } N F =
0

revision:1994-11-10

by (1). Hence we conclude that N F0 / M is free. Hence, if the pair M, N does not exemplify Pr1 (T ), then (iii) in its denition fails. We will use this to show that then M is free, which contradicts our assumption. Then we conclude that Pr1 (T ) holds. By induction on < we choose w such that the following requirements are satised: 6

417

(6) w0 = ; (7) |w | < ; (8) for limit, w = {w : < }; {u() , u : w } < (9) if () = min( \ w ), then w+1 = w {()} {(, n) : n }, where the (, n) belong to S2 , and for any m, n with m < n, min(u(,n) \ u ) and sup(u(,m) ) < min(u(,n) \ u ) hold. By (6) and C0 C we conclude that {u : w0 } = and {a : } is free. By (8) and (9) it is clear that the sequence {a : {u : w }} : <

is increasing and continuous with limit M. Hence the following claim gives the desired contradiction: Claim. For every < , {a : is free. Proof: Let us introduce the following notation. For x {a, b, c} and I set:
x ZI = {x : x x W = Z w
modified:1994-11-11

{u : w+1 }} / {a :

{u : w }}

{u : I}}

K x = {x : u } , so K a = M . The Claim will follow from the following three facts:

b a c (10) ZI = ZI ZI ; a a a (11) W Z{()} F0 /W is free; a a a (12) W+1 = K a {Zw {()} , Z{(,n)} : n }. b a c For (10), to prove ZI = ZI ZI is rather straightforward by using (1). Moreover

revision:1994-11-10

c c there exists a homomorphism h : M F ZI which is the identity on ZI and maps M a onto ZI ; h can be dened by letting

h(c ) =

c a0

if {u : I}, otherwise.

a b Now suppose that ZI ZI |= (, where is an equation and a {a : a b), {u : I}}, {b : {u : I}} are nite. Then this equation holds in b

417

M F , of course. As {b : < } is a free basis of F , we conclude that (, is provable a b) from nitely many equations in Diag(M) and the laws of the variety. But h maps this proof to a proof from Diag(Z a ) and leaves a, xed. Consequently Z c = Z a Z b holds. b
I I

To prove (11), rst clearly down to 0 ? Choose N

c c Zw {()} /W

is free. Hence by (10),

I I c a Zw {()} /W

is

a a free. We may assume that |w | = ; hence Zw {()} F /W is free. How to get

such that N is countable and contains everything a a a relevant, especially W , Z() , F . Let X N be a free basis of Zw {()} F over (H(), ,
) a a a W . Then X N is a free basis of N (Zw {()} F ) over N W . Moreover a a a a a N (Zw {()} F ) = (N W ) Z{()} (N F ) (N W ) Z{()} F0 . = a a We claim that X N is a free basis over W of what it generates over W , namely a a Zw {()} F0 . Otherwise there were nite sets X0 X and Y0 W such that X0 Y0

satises an equation which does not follow from the laws of the variety and the equalities in Diag(W a ). By elementarity we can nd Y1 W a N such that X0 Y1 satises the

same equation, a contradiction. To prove (12), if a is replaced by c, then (12) is easily veried by using the free basis {c : < }. But then using (10) and K c = K a K b we easily nish. Finally, as C and has uncountable conality, by (3) we may choose F0 {a : } (i.e. an algebra isomorphic to F0 ) such that M F0 = and even
modified:1994-11-11

M F0 = F0 M . By (12) we conclude
a a a W+1 = Zw {()} F0 M (F0 M {Z{(,n)} : n }). a Moreover by construction (as (, n) S2 ), Z{(,n)} M N for every n . Hence = a M {Z{(,n)} : n } M F0 M {N : n }. By assumption F0 M {N : n =

F0

a }/F0 M is free, and so clearly of rank 0 . We conclude that W+1 W Zw {()} F0 , = a a

revision:1994-11-10

a a and so W+1 /W is free by (11).

References
[EkMe] P.C. Eklof and A.H. Mekler, Almost free modules: set-theoretic methods, North8

417

Holland 1990 [MeSh] A.H. Mekler and S. Shelah, Almost free algebras, Israel J. Math., to appear [Sh] S. Shelah, A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals, Israel J. Math. 21(1975), 319349

revision:1994-11-10

modified:1994-11-11

417