Aut(M ) has a large dense free subgroup for saturated M

Garvin Melles Hebrew University of Jerusalem Saharon Shelah Hebrew University of Jerusalem Rutgers University October 6, 2003

Abstract We prove that for a stable theory T, if M is a saturated model of T of cardinality where > T , then Aut(M ) has a dense free subgroup on 2 generators. This arms a conjecture of Hodges.
modified:1993-08-26

Introduction

revision:1993-08-26

A subgroup G of the automorphism group of a model M is said to be dense if every nite restriction of an automorphism of M can be extended to an automorphism in G. In this paper we present Shelahs proof of a conjecture of Hodges that for a cardinal with > |T |, if M is a saturated model of T of size then the automorphism group of M, Aut(M ), has a dense free subgroup of cardinality 2 . Wilfrid Hodges had noted that the theorem was true for such that |T | and < = . Peter Neumann then pointed out to him that de Bruijn had shown that independently of any set theoretic assumptions on , Sym(), the group of permutations of , has a free subgroup on 2 generators. On checking the proof, Hodges found one could also make the subgroup dense, so the natural conjecture was that
Would like to thank Ehud Hrushovski for supporting him with funds from NSF Grant DMS 8959511 and Wilfrid Hodges for helping with the conjectures history partially supported by the U.S.-Israel Binational Science Foundation. Publ. 452

452

for any cardinal > |T | if there is a saturated model M of cardinality , then Aut(M ) has a dense free subgroup on 2 generators. As Shelah likes questions, Hodges asked him about the conjecture when Shelah went to work with Hodges in the Summer of 1989. The proof presented in this paper is simpler than the one from 1989, thought of by Shelah while he was helping Melles with his earlier proof. While the proof is not complicated, Melles thinks it is a nice application of the non forking relation for stable theories. By the following theorem of Shelah, the only open case was for T stable, although for completeness, we also include here a proof for the case that |M | = = < . Theorem 1 T has a saturated model in i one of the following hold 1. = < + |D(T )| 2. T is stable in proof [Sh c] VIII 4.7. Denition 2 A subgroup G of Aut(M ) is < dense if every elementary permutation of a subset A of M such that |A| < has an extension in G. Melles asked Shelah about the natural stregthening of Hodges question; Can one nd a subroup G of Aut(M ) for M a saturated model of cardinality , such that G is < dense and of cardinality 2 ? Shelah quickly found a proof arming this stronger conjecture. Throughout this paper we work in Ceq and follow the notation from [Sh c]. See there for the denitions of any notions left undened here. We denote the identity map by id.
modified:1993-08-26

|M | = = <

revision:1993-08-26

Lemma 3 Let I be an innite order and let a i | i I be a sequence indiscernible over A, f an elementary map with domain A ai | i I , and B a set. Then there is a sequence tp( f (ai ) | i I /f (A)) such that f (A). ci | i I ci | i I which realizes is indiscernible over B

452

proof By compactness and Ramseys theorem. Lemma 4 Let = fnn . . . f0 0 be a term (intended to represent a composition of functions with f 1 meaning f and f 1 meaning the inverse of f ) such that i {1, 1} and fi = fi+1 i = i+1 . Let M, N be models such that M is saturated of cardinality , and M N with N + saturated and + homogenous. Let being f0 . . . fn be a nite set of automorphisms of M with fi = fi+1 i fi = fi+1 in . Then there are automorphisms of N, n 0 and Fn . . . F0 = idN . F 0 . . . F n such that each Fi extends fi

proof If 0 = 1, let A0 = {a0 | i < } N be an innite indiscernible i sequence over M. Let F be an extension of f 0 to an automorphism of N and let A1 N realize tp(F [A0 ]/F [M ]) such that A1 is indiscernible 0 over A0 M. Let F0 be the elementary map extending f0 such that A0 is sent to A1 . If 0 = 1, then let A0 = {a0 | i < } N be an i innite indiscernible sequence over M. Let F be an extension of (f 0 )1 to an automorphism of N and let A1 N realize tp(F [A0 ]/F [M ]) such 0 that A1 is indiscernible over A0 M. Let (F0 )1 be the elementary map 1 such that (F 0 )1 sends A to A . Now by induction extending (f0 ) 0 1 0 on 0 < i n we dene innite sequences A i+1 indiscernible over M i Aj and elementary maps Fi such that
ji
modified:1993-08-26

i 1. Fi extends fi j i 2. If j < i and j = i , then Fj Fi

0 3. Fii . . . F0 (A0 ) = Ai+1

revision:1993-08-26

j Now suppose 0 < i n and Fj have been dened for all j < i. Suppose be the largest i = 1 and there is a j < i such that j = i . Let j j such j. Let F be an extension of Fj to an automorphism of N. By the j construction Ai is indiscernible over the domain of F j . So we can nd j Ai+1 realizing tp(F [Ai ]/dom Fj ) such that Ai+1 is indiscernible over j i M Aj . Let Fi be the elementary map extending Fj taking Ai to ji

Ai+1 . If i = 1 or if j does not exist, the induction step is similar. Now i let Fj be an automorphism of N extending Fi where i is the largest n n 0 0 index such that i = j . Fn . . . F0 = idN since Fn . . . F0 (A0 ) = An+1 and A0 An+1 = since An+1 is indiscernible over A0 M. 3

452

Theorem 5 Let T be a complete theory, M a saturated model of T of cardinality with |T | = < . Then Aut(M ) has a dense free subgroup on 2 generators. proof Let T R = < . For < , let T R = < and let be the 0 function with domain and range {0}. We dene by induction on < a model M of T and f Aut(M ) for T R such that 1. M |= T 2. |M | = 3. M | < is increasing continuous

4. If is a successor, then M is saturated 5. f f 6. If = + 1, then f | T R \ 0 i|i< is free

For = + 1 we let f i | i < be a sequence of automorphisms of 0 M such that each nite partial automorphism of M has an extension in f 0
modified:1993-08-26

|i< .

If we succeed in doing the induction then for f = then the f and the
<

if

f | =

, <

M are as required by the theorem. The only

problem in the induction is at successor steps, so let = + 1. Let

n 0 = | is a term of the form fn . . . f0

revision:1993-08-26

such that 1. i < n + 1,

i

{1, 1} i|i<
i

0 2. i < n + 1, i T R \ 3. i < n + 1, i = i+1

= 4

i+1

452

Let i | i < be a well ordering of . Let N be a + saturated, + homogenous model of T containing M . By induction on < we dene 0 i|i< elementary submodels M, of N and for every T R \ , f, such that 1. M,0 = M 2. f,0 = f

3. If = + 1, M, is saturated of cardinality 4. < f, f,

n n 0 0 5. If = + 1 and = fn . . . f0 then fn , . . . f0 , = idM,

If we succeed in the induction then we can let M =

< <

M, and f =

f, . The only non-trivial step in the induction is for successor steps, so let = + 1. By lemma 4 we can nd automorphisms F 0 , , . . . , Fn , n 0 of N extending f0 , , . . . , fn , such that if = fn . . . f0 then
n 0 Fn , . . . F0 , = idN

modified:1993-08-26

For T R \ 0 i | i < , but not in {0 , . . . , n }, let F, be an arbritary extension of f, to N. Let M, N be a saturated model of size such that 1. M, M,

n 0 2. M, contains witnesses to Fn , . . . F0 , = idN

3. M, is closed under the F, 0 For each T R \ i | i < , let f, be F, M, .

revision:1993-08-26

|M | = < <

Throughout this section, by theorem 1 mentioned in the introduction, we can assume that T is stable. Although the proofs in this section are simple, there is an hidden element of complexity covered over by theorem 1. 5

452

Theorem 6 Let Mi | i < is an increasing elementary chain of models of T that are saturated with cf r (T ). Then Mi is a
i<

saturated model of T. proof [Sh c] III 3.11 Lemma 7 Let Ci | i I be independent over A and let Di | i

I be independent over B. Suppose that for each i I , tp(C i /A) is stationary. Let f be an elementary map from A onto B, and let for each i I, fi be an elementary map extending f which sends C i onto Di . Then fi
iI

is an elementary map from

iI

Ci onto
iI

Di .

proof Left to the reader. Theorem 8 Let T be a complete stable theory and let M be a saturated model of T of cardinality > |T |. Then 1. Aut(M ) has a dense free subgroup G of cardinality 2
modified:1993-08-26

2. In fact, if is regular, then there is a free subgroup G of Aut(M ) such that any partial automorphism f of M with |dom f | < can be extended to an element of G. proof Let + r (T ) = cf () . We dene by induction on i an increasing continuous elementary chain of models M i of T, ordinals i i of cardinality 2 and families g | < i of automorphisms of Mi and such that 1. 0 = 2

revision:1993-08-26

2. |Mi | = 3. j | j i is increasing continuous

<i i+1 g g

4. g Aut(Mi )

i 5. For a xed , the g form an elementary chain

452

6.

i+1 g | < i+1

is free

7. If i = j + 1, or i = 0 then Mi is saturated. If we succeed in doing the induction then by theorem 6 M =

i<

Mi is a

saturated model of cardinality . If we let for <

i<

i ,

g = then g | <
i<

j g | j > , j <

is free by item 6. in the construction and is dense

(in the strong sense of 2. of the theorem) by item 5. The only diculty in the induction is for i = j + 1. Let list S 1 (acl ). (So ) Let independent over Mj such p . For every g Aut(Mj ) a | < , < p | <

be a set of elements

that tp(a /Mj ) is a nonforking extension of let f [g] be the permutation of such that

f [g] () = g(p ) = p
j List Aut(Mj )\ g | < j
modified:1993-08-26

as
j g | j < i

Let Ai = M j a | < , < and let h i | < i be a set of free permutations of Sym(). Dene for < i a permutation j, j, j g of Ai by letting g Mj = g and

revision:1993-08-26

j, g (a ) = ahi ()

f [g ] ()

j, j, By lemma 7 each g is an elementary map. The g | < i are free. For suppose not. Then for some {1 , . . . , n , n+1 } i we would have j, j, j, g1 . . . gn = gn+1

452

so for every <

j, j, j, f [g1 . . . gn ]() = f [gn+1 ]()

and for every < , h1 . . . hn () = hn+1 () a contradiction to the freeness of the h i . Let Mi be a model such that 1. Ai Mi Ceq

2. (Mi , a)aAi is saturated 3. |Mi | = This is possible as the theory of (Ceq , a)aAi is stable in . As (Mi , a)aAi j, i is saturated we can for each < i , let g be an extension of g to an automorphism of Mi .

< Denseness

Theorem 9 Let M be a saturated model of cardinality > |T |. Then Aut(M ) has a free < dense free subgroup on 2 generators.
modified:1993-08-26

proof If < = , the proof given gives a < dense free subgroup. So we can assume that T is stable in . We work in C eq . Let pi | i < i list all types over acl . Let ai,, | i < i , < , < be independent over , with ai,, realizing pi and (M, ai,, )(i,,)i is saturated. Let f | < 2 be a free subgroup of Sym(). Let

revision:1993-08-26

g | < 2

be a list of permutations of subsets of M of cardinality <

such that for every < 2 , acl dom g . Let C = dom g (= ran g ). For some subset u of i such that |u | |C | + r (T ), C {ai,, | {ai,, | (i, , ) i } | (i, , ) u } 8

452

We can nd a D C and v u such that |D | = |C |, |v | |C | + r (T ), and for some extension g of g , g is an automorphism of D with D {ai,, | (i, , ) v } and D {ai,, Since {ai,, | (i, , ) i v } | {ai,, | (i, , ) v } we have D | {ai,, | (i, , ) i v } For each < 2 let G = { < | < i < i ai,, D } Let h be the map taking ai,, to ai ,,f () for G if g (pi ) = pi . Since D | {ai,, | (i, , ) i v } and g and h agree on acl , g h is an elementary map. Let g be an extension of g h to an automorphism of M. (This is possible as (M, c)cD dom h ran h is saturated.) If {0 , . . . , n } 2 then G0 . . . Gn = so the g are free, and by construction g extends g so the g are < dense. | {ai,, | (i, , ) i } | (i, , ) v }

revision:1993-08-26

modified:1993-08-26

452

REFERENCES 1. N.G. de Bruijn, Embedding Theorems for Innite Groups, Nederl. Akad. Wetensch. Indag. Math. 19 (1957), p. 560-569. 2. Richard Kaye, The automorphism group of a countably recursive saturated model, Proc. London Math Soc. (3) 65 (1992), p. 225-244. 3. D. Macpherson, Groups of automorphisms of a 0 categorical structure, Quarterly J. Math. Oxford 37 (1986) p. 449-465. Sh c Saharon Shelah, Classication theory and the number of isomorphic models, revised, North Holland Publ. Co. Amsterdam, Studies in Logic and the foundations of Math., vol 92, 1990.

revision:1993-08-26

modified:1993-08-26

10

452