12

Initial sesments
I nreiisure rnyself A g a i r r sa t talltree. I { i n c t h a t I a m m u c ht a l l e r , For I reachright up to the sun, With rnyeye; And I reacliright up to the shoreof the sea With my ear. Nevertheless I ,d i s l i k e The way the antscrawl I n a n c lo u t o f m y s h a c l o w .
Wallacc Steverrs Fronr Su Si;l,niJicurtt Lundscupes, Harnronium, 1931

in the m oclels of PA discussed o f nonstandar cl T h e s atu ra ti o np ro p e rti e s the of these m odels. [n str uctur e a g re a t cl e al of light on l a s t c h a p te rsh e cl consequences : one of their m ost celebr ated t h i s c h a p te rw e w i l l d e scri be nonstandard model of PA theorerntliat any countzrble HarrveyFriednran's i s i s o m o rp h i c to a p ro p e ri n i tialsegment of itself.The pr oof of this theor em i n t u r n fo l l o w s fro m rn o re gener alconsider ations about when a m oclel M F PA ca n b e e mb e d cl e o d n to an initialsegment of anothermodelNF PA. The stanclard systemof thesemodelsM and N play a central role in such embedding problemsT . o s e et h i s , f i r s t n o t i c et h a t , i f M = y 1 r o l y ' , t h e n SSy(M) s SSy(N), since the formula (x)r: 0 is A,, anclso for all a e K and n e N , K F ( a ) , , : 0 ( 9 1 / F ( a ) , , : 0 , s o t h e s e tc o c l e d b y a i n K i s t h e s a l n ea s t l r e s et co d e d b y n i n N , th us SSy( M) :SSy( /( ) q.SSy( N) . In the special have the samestandar d then IVIand N actr - r ally c a s ewh e n N +M=/(c" N if A=N iscocled b y a e N . s a y ,t h e n f o r a l l n o n s t a n c l a r c l b e K s y s t e n rs ,ince : r n da l l n e N , 1/ Ff ;r < b\l i< n((x),- 0 +>(a)' : 0)

that is c(b ancl ri>N in /( such there soby overspill

N F V i < d ( ( t ) ' : 0 < >( a ) ': 0 ) ' of l/, so A i n l / a n clclbe /( . BLr t1( is an initial segment T h a t i s: c co cl e s 'l( 1 the sameset,4 itr K also,henceA e SSy(I() : c cocles c e I( anclas u,,/V, necessar conditions y give str aightfor war d S S y ( M). T h u s sta rrcl a rcl system s

159

160

Initial segnlents

l ts : lvl:>K<a,,/V and lc: M:>l(="// to exist,namely: for embeclcling of this T,h e r c s u l t s and SSy(M):SSy(l/), respectively SSy(M)gSSy(N) on togetherwith obviotr sconclition s c ha p te rsh o u ith a t th e seconclitions, if N ar e least M , at involved,ar e alsosufficietr t, o f th e mo d e.ls t h e th e o ri e s c ou n ta b l e . HEOREM 'S 1 2 . I F R I E , D N 4 A NT exactlywhen a countable We aim to prove here a theoremcharacterizing model as an initial segmentof a seconcl mo cl e lIIIF P A ca n b e e mbedcled em that a ny s we will deduceFr iedm etn'theor NF P A . A s a co n se q u ence, c ou n ta b l en o n sta n d a rdmoclel of. PA is isom or phicto a pr oper initi al o f i tse l f. F i rst, though, we need a pair of lemm asthat indicate s e g me n t between types over a m odel and the a ga i n th e ve ry cl o se connections syste m . m o d e l 'ssta n d a rd Leruun 12.I (Every 2,, or [,, type realized in a mociel is coded'). Let let a e M be a tuple of finite lengthfrom M and let MF PA be nonstandard, rze N. Then the sets

5: {rg(i)rl0(i) e r,, and MF 0(a)}

and T : {t 0(r)110(*)e II,, and M E0(a)} are coded in M. Proof. Observe that r 0 ( ; ) t: 4 1 p ( u ) : { ( u ) o + 0 e g ( a )l k e N , 0 e Z , , a n d ( l/ce N is not the Godel- number l ( u ) o : 0 1 u { . .r.} " l \ " / A " a n y . I , ,f o r m u l a | ) .5 ,,*rtyp e over M, so is r ealizedin M, by Theor em 1 1.5. i s a re cn rS i ve n p(u) codess. The II,, caseis similar. clearly any c e M realizing Leuun 12.2('Cocledf,, or n,, types are realized'). Let MFP.4 be non6 sta n cl a rd , e M a tu p l e of finite length,and let

p(i): {0,(i,6 l ;e r u 1
type)overM suchthat S = {t0,(i, t)t l; e ru}eSSy(iV1)' be a ),, type(or a 11,, in M. Thenp(;) is realizecl

rent Fr ieclmun'.s ther,t by . Let c e &1 cocleS anclconsicler Proo.f the type q(;) definecl q (i ) : {(c),+0 -, g (i, 6ili eN, 0( i, l) e 2,,,i : | 0( i, y) 11.

l(rl

only of ) ,, r 1 ( f ) i s fi n i te l y sa ti sfi e cl rn M, sincep( x) is, anclq( ;) consists f o r m u l a sa n d i s c l e a r l ya r e c u r s i v e t y p e . T h u s b y T h e o r e m 1 1 . 5 ,r 7 ( x )i s p( ;) too, as for all 0( t,6) r e a l i ze cl b y so me c\e N l . B r.rtsLr ch a r ealizes is in p(i), MF(c),*0 wherei:r0(i,l)1 so ME)(a. b). The fl,, curse n sinrilar. theor em . em beclcling W e a re n o w i n a p o si ti o nto pr ove our mzr in models of. PA,let notr standar d 1 2 .3 . L e t M,N b e cor - r ntable ee oN nE 'T ar,tb , Ha c e M a n dn e N . T h e n t h e f o l l o w i n ga r e e c l r - r i v a l e n t : ( a ) t h e r e e x i s t sa n e m b e d d i n g h : l v l - - > N w i t h i m a g e 1 1 2 , , Nw h i c h i s a n i n i t i a l se g me n to f N , h (c): ct tr n<b l 4l; ( b ) S S y ( M ) : S S y ( N ) a n c l ,f o r a l l I I , , f o r m u l a s0 ( x ,t ) , M l a i ) @ , c ) ) N Ff t < b 9 ( i , a ) . obser vedthat if Pr o o f . (a ))(b ) i s th e e a sydir ection.W e have alr eacly then SSy(M):SSy(1):SSy(N).If 0(i,y) is il,, then h:M51s"N ,(c71, and since b> I, M F a x 0 6 , c ) + I F a i 7 ( r , h ( c ) ) ) a A e I I F 0 ( c 1h / r ( c ':) c a n d I ; - r , , N t h i si m p l i e sN F 0 ( d .a ) h e n c eN F f i < b ? ( i , u ) . ll1, 1111, two sequeflces (b ))(a ), i s pr ovedby constr ucting T h e co n ve rse ,
. u,1 , Lri,. . . M and D11

at any stageof on i, anclso incluctively s i l l b e clefined a l l i . T h e sese q u e n cew of finite lengthu," . , uiM antl w e w i l l h a vesequences t h e c on stru cti o n
l)g, .. , U,eN.

,,, u to have?Fir stly, we d o w e re quir eour SeqLlences W h at p ro p e rti e s m u s t ma ke su re th a t /z(x)i s definedfor all x .M. that is x: tt,. ( l) For all x e M thereis some7 e N such thzrt w e re q u i reth a t h (c) : r r . Thtts we shall insistthat S e c o nd l y,
( 2 ) u 1 1 :c a n d L ) 1 y : 0 . N e x t , w e r e q u i t ' et h a t t h e i r n a g eo f h . { u , , ,u , ,. n o t c o n t a i n i n gb .

t f N, . ) i s a n i n i t i a ls e g m e no

( 3 ) u ,< b fo r a l l i ; a n cl l l l l e N , i f y ( u , t h e nl : u i f o r s o m e ie N . ( 4 ) f o r a l ly e N a n ca of substr uctltr e th a t l :{u r, L) t. .} is an I,,- elementar y re cl u i re F i n a l l y'u ve this, and will also for ce /z to be an achieves N . T he fo l l o w i n g co n cl i ti o n the 9o-structure of to preserve frorn lvl to N, i.e. to be l-l zrncl embeclcling by the ar gum entir r ( a) ) ( t- ') T h i s co n cl i ti oris r suggested t h e s e mo cl e l s. We ar gttnlent. y the Szlme i t b o v e,a n clca n e a si l yb e se ento be necessar by r e c l u i re

t62

Initial segnxents

0(x,10,..',!i) ( 5 ) f o r a l l l e N i u r cfl o r a l l I I , , f o r m u l a s , ., LIi)+l/Fli< b?(i,r)rr'' ., r),)' M l a i ( ) ( i , L t t.) . : rt zltltl c, u,, true for I : 0 by our choiceLt11: I{otice that (5) is ztutomatically (b ) a b o ve. o ur a ssu mp ti o n f'o co n stru cto u r t,,sald us satisfying( l) - ( 5) we fix enumer ati ons te N } .o f N i n w h i c he a c he l e m e ny .. } o f M a n c{l e u , r , , e 2 . ,' . {clu,dr,dr,. I,7 w h e r et h e i n d i c e s 0,t,.. . , ancl ce n . f u r u i f f i n i t e l yo f t e ni n t h e S e q L l e n of-M antl integers.(This is where the cor"rntabitity to cl;,e jare non-negative we can now show how the as .N is useclin ottr argument.)Thus eqt'ippecl, a n d u s a re fo u n d . LL1 we have already obtained u11, Strppose (5 ), w h e rek>0. Aiming to satisfy( t) ' we put u21*r : dr ,,the k th s a ti sfyi n g elementin our enumerationof M, and let A be the set , ,t r , ' ' ' , I t z t , * t ) } r M F 7 ( t t ,L a , , +& { ' \ ( y u l, t , . . . , l z r + , ) t l d 2 M) b y L emm a 12.1.Now consider w h i ch i s i n S S y( x) lt1tis II,, p (x): {az < bq( Z, Dr , . . , t) zk, a n d r l z p ( z , l r , . . . , l z r , + ' )e tA). We claim that p(.r) is a type over N and is coded in //. To checkthat /'(x) is be in p( x) for I <i < /' T hen f i n i te l ysa ti sfi e i ,i r:ta 2 <bQi( 2, r r , . , u2k,x)
MFAZt, . . . ,2,A'i:,Q,(2,,ttr,
SO
a 1) , Lt2p, Llr1,

t, t, r, , /N,i=,tP,(2 ME=|t, . . ., 21w

h e n c e ,b y ( 5 ) ,

..

rLI21rrw)

. ,. ., u z * , w ) ' N F f Z r, . . . , 2 i , t Q 1 b l A j : , r l t i ( | i , L L o

in l/, noticethatA e SSy(M): ssy(N) so there thatp(,r)is cocled To check the in N by anyse N realizing p(x) is coclecl A ln N. Thurs is re tV cocling tyPe recursive
j - r 1 Z 1 t v . t 1 , a , Q (W 2 ,l r . , . r W : * , . Y ) ' l I i : t a 2 r ! ( 2, v e o.. , V V - 1 rX, ) l tp e fi,, +t3zIwzr.,rt4t(2, , u : o |Itio allQe[r,, {r,r, yyr ,)lI
r . )

q(x):

@)i+Q<+(r);*0

Friedman'.s theorent

163

T h u s b y L e m r n a1 2 . 2 p ( x )i s r e a l i z e d i n N b y s o m eu z t * t N . I t i s e a s yt o clrecl< th a t (5 ) h o l d s fo r i :2 k+ I ancl,by consicler ing ( 5) applied to the f o r t r r u lx a: l t * 1 , s i n c e MFAxx:t.tt1, , soorpa,ib. rr ,NFax<bx:u.tk+1 N o w su p p o sew e h zl vea ,,, , u., . , u2k+ 1 satisfying( 5) , Lt2k+and C o n s i cl e r k, th e kth e l e m ent of ollr enumer atior rof //. If et) m z i x ( u ,,, , D 2 t,+,) th e n w e set u2r .r z:Ito,I) 2k+z: and it is easyto check D0, t h a t ( 5 ) h o l cl s fo r i : 2 k -1 2 . Other wise c*{ m ax( u0r , L) zt,+1) and we put D 2 .2 k. W e mu stfin cli l .t1 , M satisfying ( 5) for i : 2k + 2 anclthis choice : r e1 ,. a2
of 1t21,*2 L.e t

B:{t?(y,tt

t ! 2 k + 2 , w ) . 1 0 i l , ,& + , N F 0 ( u 1 1 ., . , u u , n r , b ) } .

T h e i r B i s co d e di n N b y L e mma 12.1.Now consider

p(x):

u"' {vz'1'12'

X ,) , Lt11ra1

r2 is I,, and tVz<wt1t(2,yr, ,lr.r*r)t O]

We claim that p(x) is codedand finitely satisfied in M. To checkthat p(x) is f i n i t e l ys a t i s f i e ds ,uppose YZtlt;(i,ur,. ,r,t2k+t,x)ep(x f) or 1<7</ and that MFVx ( m&X(&., uro * )A z yf i -_ Jltp1(2, uu,
..,1b1,a1,X). (t')

in B- I,,*, to the - I,,*1 Si n c e e a chE ,i s l I,,*, th e fo rmula in ( ' ' ) is equivalent formulzr A tY x< ma x(a 1 ,, < r 17i: ,- 1tp,( 2, ur , . . , L rzk+ ) aZ
,LlZ**t,X).

quantification Thus, using (5) anclthe fact that I1,,is closedunder boundecl ( u s i n gth e a p p ro p ri a te co l l e ction axioms,which ar e tr ue in both M and N) we get l / F 3 r < b Y x { m o X ( u , ,. , hence u2 0,. , ., Zb Y ' i = r - 1 t p , ( l / F V x < m a x ( u , , , , n ? k + ) a< u z * * tx, ) ) ,( r, r2 , . , . . , u z r , *x u 2 t , + r )< at z' V , / ' , = r - r 1 tu

(" '),si n cet ) z * * z { m a x ( u 1 , , , D z k + a w h i c h c o n tra cl i cts , )n d b y c h o i c eo f t h e

Qj,

j = , r f t , ( 2 ,u r , fulFax<max(u,,, , .L.t 2 k + , ) V Z A

. , Lt2lrn t, I),

p(x) is clearlycodecl in &1 since ancl hencep(x) is finitetysatisfiecl. B thenanys NI r ealizingthe Be SSy(l/):SSy(M) ancl so if re &1codes

164
recLlrsrve type

Initial segments

(. ^ l p e E , , , j : t V z l , ( z , l r , . . , y 2 t , . r , , . y', ^In r ) l r l ( x ) : J ( - r ) ; t ' { )\< + ( r oz l '< w t p ( Z , i o , i :L tv ' / t ' "\l= , - ' , ^ , o , , ( r ," ,''', " l,z , k + ,,, ,1 ' * r\ z r ') 1 ! (. |

= oli #( ot f or all o [,,*'] u {(.r),

p ( x ) . T h u s b y L e m m a1 2 . 2p u ( .l t codes , (x) isrealized i n N b y s o m eu 2 k + zf t h a t i f M F a i 9 ! , L t r " . . . , L t z r , *w i t h 0 2 , , * ,t h e n i s t h e n e a s yt o c h e c k z)
VZ 10(2, Ltr, . r ,) ( p ( x ) , L t 2 k +x

s o V Z < b - 1 0 ( 2 , u 1 1 , . . , u z k + z i)s f a l s e i n N , i . e . , N F ? ' Z < \ ? ( Z , D t ) , , : ( 5 ) D z t , * z )t,h u s h o l d s f o r I 2 l c+ 2 . C o n t i n L r i n gi n t h i s w a y , w e c o n s t r u c t r t i a n d u , f o r a l l l e N . W e c l e f i n e hQt):u1. hrs a well-definec fl u n c t i o n f r o m M t o N s i n c e e v e r yx e M i s d r f o r s o m e l c ,s o x : L t 2 k a,n d i f M F u , : u , t h e n N F u i : D i b y ( 5 ) , s i n c e' , : y i i s (trivially) I1,,. Similarly MF rt,<tt1)NF u;1uy, MEtt,* n1: ar)NF and MFui. Lt1:Ltp+NF u 1 .u i : u 1 r , scr h preserves < , + and ., so is an embedding. The image of h, I : { u u , u t , . . } i s a n i n i t i a l s e g m e n to f N s i n c ei f x e l { , x 1 u , f . o rs o m e i , u1," ui* u1--

f.orsomek > i. But thenx : e* for infinitely manyk and in particular x : e1,
.. y.,, u 2 t , + r )s o b y t h e c o n s t r u c t i o then ep<max(u1 nk : u 2 k + ?F . inally, if l e M a n dD : h ( i l ) 1 , t h e n s i n c h 11z,,Nsince , 0 ( t ) i s ) , , r , v i tih e: M --+1is an isomorphism IE0(D)eAIF0(u), 10(i)il,,, a n d M F ? ( u ) e N F 0 ( D ) ,b y ( 5 ) a p p l i e dt w i c e t o t h e f o r m u l a s I and tp(fi. 2) where 9(d) is azrp(il,z). theor em: We ca n n o w p ro veF r iedman' s T t re o R e u 1 2 .4(H . F ri e dm an) .Let M FPA be nonstandzr r and d countabl e, l e t let aeM and n e N . T h e n t h e r e i s a p r o p e r i n i t i a l s e g m e n tI c " M a su chth a t -1=M ancl1a r ,,M . co n ta i n i n g such that, for all 0(i, J) e [I,,, Proof . We must find b e .tV1 M Fai1G, a) ) lvl Eai < b9( i, a) , i . e . , b m u s ts a t i s f y

en,,1. p ( z ): { J i ? ( i , u ) - , a i < z 1 ( i , a ) 1 0

Friedman's theorent

i65

p ( z ) i s cl e :trl y re crl rsi ve zl rcl X,,..r . seethat it is finitelyser tisfiecl To note that i f 0 r ( i , a ) , . . . , 0 0 ( i , a ) a r eI / , ,z r n d A 4 F a i 7 i ( * , r ) f o r a l l i < / c t h e n t h e r ei u . e 5 , , . . . , b 1 , e f u \ s u c h t h a t A 4 1 0 , ( 6 , , u \f o r a l l r < / . , u n c l b rnax(6,,..., 6^)+I clearly s a t i s f i et s u l F l t < b 0 , ( t , n ) f o r a l l l . T h u st h e r e i s b e M r e a l i z i n g p Q ) ,b y T h e o r e m 1 1 . 5 , s o b y T h e o r e m r 2 . 3t h e r e i s a n e m b e d d i n g hM : ; 1 c " M w i t hh ( a ) : a , b + 1 a n d I ' - r , , Ma s r e q u i r e d .n R e v t n R rcs. It i s n e ce ssa ry, i n Theor em I2.4, thatlvl is countable. ( W e usecl t h i s w he n w e to o k e n u me rations of ful and M in Theor em r 2.3.) For e x a r n pl e ,i n C h a p te rB , C o rollar y 8.9, we showecl that ther e .r e c0,- lil< e n r o d e ls o f P A . S u ch mo d e ls clear ly have r 1o pr oper initial segm ents i s o m o rp h i c to th e mse l ve s. Nor can we expectin generalto get initial segments 1 with M = I1 ful trncl M+1, i.e., elementary f o r a l l f o r m u l a s .F o r e x a m p l ei f M : 1 ( n . ( w h e r e T + T h ( N ) i s a co mp l e tee xte nsion of PA) then M has no pr oper element a r y s ub stru ctu re s, a n d so c er tainly has no pr oper elem entar y initizr l s e g m en ts! T l r e sta te me n o t f th e th e o r emshowsthat the initial segm ent Ic"M can be taken to be arbitrarily large. An easy mistake that can be n-rade is in thinking that 1 can be arbitrarilysmall also.The fallaciousargumentis as f o l l o w s.S i n ceIc:" M i s i so mor phicto ful,tlter eis a pr oper initial segment I 1 c . " I i s o m o r p h it co . { ;L c . l l w i t h 1 r = 1 r l a n c s l oo l t . T h e n' b y c o n t i n u i n g in this way we can fincl an initial segment,I, srnallerthan any given nonstandardb e ful'.The mistakeis of coursein the phrasein invertecl commas. T h e r e i s n o w a y o f g u a ra n te eing that the sequence 1,r eaches N in its limit, and a counterexample provided is as follows. Let Yx7(x) be a true I/1 s e n t e n cew , h e re 0 e A ,,, th a t i s independent of PA. Let MFPA+ - lYx?( x) _-l0(x). be countableand let a e NI be leastin M satisfying Then, if ,1is any i n i t i a ls e g m e no t f M with adl and / closed u n c l e rI , ' , l F V x ? ( x ) s i n c e I < ^,,lvl.Hence 1 cannot be isomorphicto &1. F r i e dma n 'sth e o re mi s ve ry r emar kable.Until now we have not been a b l e t o fi n d a n y n o n -sta n cl a r d initial segm ents I q"M satisfying PA: we now know that there are lots of them actuallyisomorphicLo Mt.

Exercises for Section12.l l f PA- anclet N be e o c l eo L e t M - { n r , e t , . , , o i , . . . } b e a c o u n t a b lm 12.1" yt l t e r b , . . . l g N , a n dp o s s i b lo l f P A - w i t he l e r x e n{ tb su,br,..., a n o t h em r o d eo b e si cl e th se seS . u p p o sthat e l e m e nts e for all ie N andall 0( x11, ,r i- ' ) e ) ,,' '
M F0 ( a u , tlt ancl i s a n e r n b e c l c l i n g that h : ful-rN given by h(a;): b; is well-clefinecl Slror.v .f,/,r-structlrres with imageK: {br, . . ., b,, . .) < t,,N.

166

Initial segments

&/ and sLrppose rnoclels, nonstanclarcl MFB2,,*, be countable 12.2"'Let NFPA ancl fortn tlte type of i.e. eitchrecursive satltr:ttecl, is short I7,,11-l'ecllt'sively e) | f e N} p\x) : {xi< blx;e.r} U {Oi(x, further that S.ly(&/): Sr-rppose lor allT) over M isrealizedin rV1. (where01eIT,,.,,1 thilt there area, b e A/ and c e M sur;h SSy(N)zrncl I v l F a i 1 G , c )) l / F a i < b ] ( i , u ) hg : lvlj'1c"N with ft(c):11, f o r a l l 0 ( S , y ) e I I , , . S h o w t h a t t h e r ei s a n e m b e c l c l i n b+l andI1t,,N. ancl sufficient conclitionson countable moclels 12.3 Write down necessal'y hg : M:>1cN withl<t,,N. M , N F P A f o r t h e r et o b e a n e r n b e c l d i n anclnonstandard. PA be countable 12.4 Let A4F ( a ) G i v e n t h a t f u l V I T , - T h ( N ) , s h o w t h e r e i s u e M \ N s u c ht h a t n o I c . " M n o t co M . a is isomorphit containing (b) Given that MFII,-Th(N) and ae&1\N, showthat thereis 1c"M with a6.l=M. I c"M Showthat thereis a properinitialsegnrent PA be uncountable. 12.5 Let IVIF withN+lFPA. (Hint; Use the Lowenheinl-skolemtheorem to find K<Irl countableattd notr7.6 r heorem t f K a n d c o n s i d eT L.e t N * . 1 c . " K b e a p r o p e ri n i t i a ls e g m e no stanclard and a e- / } . ) 7:{re Mltl4Fxlu sorne

12.2 VARIATIONS l n th i s se cti o n w e sh all consider som e var iationsof the embeddi ng t h e o re m,T h e o re mL 2 .3, and someof its conseqLlences. of PA. The moclels I2.5. Let M, N be countablenonstandtrrd Tr-rEoReul f ol l o w i n ga re e q u i va l e nt: with /<.:- ,,A/; /z:M:> 1c.Ay' a n e mbedding ( a ) th e re e xi sts Th( &/) , the set of all ) ,,*, sente nc es ( b ) S S y(M):S S y(l /) a nclNFE,*r ftue in M. Pro o f. (a ))(b ) i s e a sy.For ( b) ) ( a) p(y):{ltO(t) let be N r ealizethe type

+Ji<y0(x)10 e II,,).

there is an embeclcling Then by Theorem I2.3 (putting a:c:0) : n h : M =ri -" N w i th I1 ',,N if l/Fr ,,*, - Th( &1)and SSy( M) sSy( N)

Vuriation.s

16'7

TrlEonsvr 12.6. Let lVI,^llPA ['recountableancl nonstarnclarcl T h e nt h e f o l l o w i n ga re e q u i va l e n t: - - l G " A / w i t h r i e / < t,, A/; ( a ) f o r a l l a e l / t h e r c i s a n e m b e d c l i nh g: f u I ( b ) S S y ( M ): S S ' y ( N ) a n c lN En , , , 2 - T h ( M ) . I'roof. (a) ) (b): lt XI FViAy?@, y) with 0 e fI,, ancl a e lV is ar bitr ar y, y) , t h e n b y ( a ) t h e r e i s 1 < 1 . , Nc o n t a i n i n g 17 r v i t h M = 1 . Thus I F3y0( r 1, hence NF0(t1.6; f o r s o m e6 e l s i n c e 1 < , . , N a n c lf i i s I1,,. Since ri e A/ n,as a r b i t r a r yN , F V i A t 0 6 , r ) , h e n c eN E n , , n 2 - T h ( M ) . ( b ) ) ( a ): If S S )(M) : S S y(N) and NF fr ,,+2- Th( n4) ,l e t u e N a n d l e t N V0( u) } . 4 : {t0 @) 110 e fl,,*1 ar ncl , t { i s c od e di n N , b y L e mma 12.1.Now consider p ( x ) : { 0 ( * )l t 6 ( t ) r e A ) . p ( x ) i s a t y p e o v e r M s i n c e i f 7 t ( x ) , . . . , 0 , ( x ) z t r ei n p ( x ) , t h e n l / F 3 x A \ f = t0 ,(x). T h i s i s a ),,*2 sentence, so M F3xAj= ' ' 0,( r ) ( sincethe f[,,*t V " \/1 = ,,-1 0 ;(x) ca n not be tr ue in M as l/F il,,+ 2- Th( M ) .) Also s e n t e n ce p ( x ) i s cl e a rl yco d e d i n M sinceAe SSy( l/) :SSy( M ) . Thus by Lemm a 12.2 there is c e M realizingp@), anclfor this c

M F a i l p ( r ,c ) ) l l F a r p ( i , a )
similarto that in the an ar gum ent f o r a l l V fI,,.S ob y T h e o re m 12.3( ancl h : M 51s" N with T( :,, N p r o o f o f T h e o re m I2 .5 ) th e re is an em beclding ll a n d h ( c): d , a s re q u i re d . The last result in this sectiongivesperhapsthe best indication so far of of PA can be. lrow complicated countzrble moclels moclelsof PA, let 12.7. Let M, N be countablenonstanclard TrreonErvr rz el<b sl e g m e n1 t c.A'/with eh e r ei s a n i n i t i z r a , b e N , n e N , a n ds u p p o s t 1. sltchinitial segments a n cM l =l <;-,,,A /. T fre n th e re ztr e2N" ancl let c:h- ' ( a) . W e shall P r o o f . L e t h : M->1 b e a n isor nor phism to constr uctembeddings f o l l o w th e i cl e ao f th e p ro o f of Theor em 1,2.3 and into tr ,vo, all clivicle b u t a t e a ch sta gethe constr uctions N I : t 1 1 r.,l y', &1- - + fy'W . e nr ttst etnbeclclings cliffer ent t h u s we w i l I e ve n tu a l l yh z:e 2N,, 1g"A/. ir nages have clif[elent embeclclings t a k e c a reth a t a l l th e secl i ffe r ent le , t { r d ,d M o r ep r e c i s e l y , t , - . . } : l V b ee n t t m e r a t i o u s , t , . . . \ r : I v la n d{ c , , t h a t e a c h/ N i s c 7f o t i n F r n i i e l y a s i n t h e p r o o f o f T h e o r e m I 2 , . 3 ,s L r c h

l68

Initial segments

oso f 0 s a n d t s a l l f i n i t es e q u e n c e m z i n y ie N . W e s h a l lc o n s t r u citl u . D u f o r e a c hi l oi s a t r i p l e 1 } f o r s o m el e N ) , w h e r e ( i . . . ,o : { 0 , 1 , . . . , i - I } - { 0 , /,)and e for any/:N- - +{ 0, 1} the ( Lt,,,tl ,,,ru j i ) rn [V l , e a chD,,is( ts,,,t) ' ,,,u' l/ fro map h 1 :u yr , - A f r i f o r a l l i e N nf/to {0,1, . ., i- l}) isanembedding he restrictioo ( w h e r e / | i c l e n o t ets oso thatfor alll e N an dal l b,,e ly' foreach N . We w i l l a l soconstr uct M = It<2 ,, -, .f ' N {0, 1},

bt,,+Im(h1)
whereas f (i) : 1) bc 1i;.o lm(hs). This will force all the Im(h): I,to be different,sincert f , g: N - {0, 1} are not equallet le N be leastsuch that f(i)+g(l) and slrppose "f(i):l, g(i):0' Then oI m ( f t r ) r . I m ( / z * ) . b osl i n t ) : b f 1 i . useinductionon the lengthof o. F or th e seu u ,Doandbowe T o co n stru ct ,u t t t 6 : ( c , c , c ) , u o : ( a , a , a ) a n d b a : b . o : A , t h e e m p t y s e q u e n c ep ( T h i s e n su re sth a t a e Im( l' ) and bSIm ( /) for all /:N- +{ 0' 1} .) Now z of w e have found u,, A,and b,for all 0, l sequences su p p o se i n d u cti ve l y 1}, less t h a nl e N s u c ht h a t ,f o r a l l o : { 0 , 1 , . . ' , i - 1 } - t 0 , lensth

('-) It M F J i 7 ( i , f l o t ( ., ,

for all I1,, formulas 0(I, ju, . . . ,!,) <b,,0(ta , o t o., . . . D o it) ' Ll.or,))l/Flt

It is easyto ch e ck u sing Theor em 12.3 that ( ' ' ) is equivalentto the th a t statement
r7
l v c l r l t

,t

. .-> l vJ o

l r t .

Uo I i

co i a r n a p h : M - + l / w i t h i m a g e 1 1 2 , , Na n c lb " q l c , N . can be extenclet o:Q, by our N o te to o th a t 1 't';i s true for l:0 anclthe empty sequence d7. Now fix some clroiceof b,nancl[1,7, o : { 0 , 1 , . . . , i - I l - - + { 0 ,1 } ancl
,1 L t, , t t r ,

,L[,.,Si,Uol0r. ,Uoli

Variutiorts

169

a n c l1 1 , W , . e s h o w h o w t o f i n c ld , , , , , D o ob , , t r ,t ) t , , 1 , 0 , , b1 , , ,s a t i s f y i n g( ' , ' ) , ' u v h e rie is replacecw l i t h i + I , a n c lo i s r e p l a c e c l by either o0 or ol. Write I for u,tlr, ? n c l f o r D 1otr,. ,11,,1; , t j , , 1 ,C . o n s i c l etrh e ) , , , , type

p(y): {li< yq(i,D)10 e i l , , ,M E a i ? @ ,i l ) l u { l i < b , 0 ( i , D ,y ) | 0 e f T , ,M , E v y a l 7 ( * , n ,y ) } over ly'.This is finitelysatisfied in l/ sinceif

0 r , . . . , 0 t I I , , , Q.r ., , t p 1 r e I I , , and ME lNtj=tai?j(i, iz)A li\f= ,Vyaxtlt,(i, n, y) t h e n t he re i s w e M su chth a t MF / tj=,Jr1w7,(i, r)n n f =, a i q , t , ( i ,u , w ) .

S o a p p l yi n g('') to th e ),,*1 fo r mula a w ,i 1 t h e r e i s y e N s u c h t h a t l / F 1 i < y ? 1 @ , D ) f o r e a c h7 < / a n d N a a i < b , , Q i ( i , [ t , y ) f o r e a c h7 < k . p ( y ) i s a l s oc o d e ciln N s i n c eb o t h o f 4 : { t 0 ( i , z ) r l 0 e f I , ,& M E 3 i 0 ( i , i l ) 1 and 3 : {t0 (i , z, y)110 e n,, & MFvySi) ( i, il, y) }

a r e i n SS y(tV I), A, B h e n cei n S S y(l/) , by Lemm a I2.I; anclif r , s e l/ cocle respectively, then any t e N realizingthe recursivetype

q(r)-l(t),+0e(r),*01 z)1 i :t o(s, t Io f1,,,

li,i eN,i:tai<y?(i,

z)rl

I )

N'i :,tlt *o<-,(s),#o u {t,1, l':' : :?(r't:.'"} e [ 1 , ,a n c l : t 0 ( i , 2 , y ) 1

t l0 7 ) u {(r),: 0 l l e N not of the above tr ' vofor m s}

170

nt,s Initiul segnte

n 12.2.W e clcfi ne in N, lr y Len' r ra T l i u s p( y) is r calizecl c ocl e s th e typ e 7 .r. p ( y ) . B y t h r :c h o i c co f t h e t f N realizing b , , 1 : b , , u l nb c, l , ,t,o b c u n y e l e m e n o p,u t t i t t g l y b,,,,.'fhr"rs s v e n w l t e t l b , , i s r e p l a c e cb t y p c p ( - r r ) ,( " ' ) h t > l c l c
0 N, 11,,11: c e ful'rtrld L),,11:

,;,,:,::,y , ,,,{ Li, ,!;,=rj ( b,,,,,(i, D ,1,,,,,)

the a ,n , ,c , lb , , 1 B 1 .u t a l s o t h e r e i s t t 1e M r e a l i z i t r g h o l c l sf o r t h i s c h o i c e o f L ! , , , , , 1 r tvoe

0 e fI,,l r(y) :{Vr-t 0(i, u, y) | NFVt < b,,:10(i,0. b,n,),

, nd l m p l e x i t ya in M, isof bouncleco t h i s i s c o d e di n N h e n c e o v e rM . s i n c e u,,1:h,,1w y .e Then, pr ,r tting i n M by our choiceof b,,11. i s fi n i te l ysa ti sfi e d obtain

. I for all 0(x, y , z) e [1,, t7u , ,))NF3t "\rFaio(i,

1b,,10(x. D, uur),

T he re st o f th e p ro o f i s now ztsin the pr oof of Theor em 12.3.W e put nl u . r l ,., . . } O f M ( r e C a l l h,e t t ' , , 1 y : t t ' , , 1 :td , i t h e l e m e n tO f t h e e n u m e r z r t i O {c zir efound by the szl m e ancl u' ,,1N t h a t i i s tl -rel e n g th o f o) . Then ui,,, to ( "' ,,)a nd attalogous conditions a rg u me n ta s i n T h e o l e m 12.3satisfying tt!,i, u|): e, and finc|uiin. we put tti11: Finally, if e,< rnax(O) ("'1)respectively. the in the itr gument ( "' 1) , using and a n alogous to ( "' 1y) co n d i ti o n s s a ti sfyi n g :, Ltl1:Ltl,',,v: p r o o f o f T h e o r e m L 2 . 3 .I f e , > m a x ( u ) t h e n w e m a y p u t u i j , o f o, for o0 and ol in plztce ( "' ) will be satisfied / l t:0 . Wh e n th i s i s fi n i s hecl co nstr uction can be continued. a n clso th e i n cl u cti ve is identi c al th a t the maps hlhavethe r equir edpr oper ties T h e ve ri fi ca ti o n t o th a t i n th e p ro o f o f T heor em 12.3,anclclistinct f,g gwe r ise to diffe r ent is in only one of 11 ,Is , sinceb,,11 Ir, Irb y the constr r .r ction i ni ti a l se g me n ts the w h e r e o : f f i a n c lI i s m a x i m a ls o t h a t / f i : g f l . T h i s c o m p l e t e s
p r o o f.

let a, b e M anclnonstanclar cl, C o rr.o l u n v 1 2 .8 . L e t MF PA be countable a e l . i b . T h e n t h e r e a r e 2 n " i t t i t i a ls e g m e n t s a n c l1 c " M w i t h / = M a n c | f o r a n y c t e [ v lt h e r e a r e 2 n " lV l l = , / .I n p a r t i c u l a r Jg"M with a eJ<b z,tnc a. o M I a n c lc o n t a i n i n g s q " M i s o n l o r p h rtc i n i t i a ls e g m e n t I

Proof. By Theorerls12.4ancl12.7.

tr

Variuticttt:;
Exercises I'or Section 12.2

t7I

1 2 . 6 F i n c l c o u n t a b l en o n s t a n c l a rL c,l I ( E P A s L r c h t h a t L , / ( s a t i s f yt h e s a r l c conrpletc cxtcnsion o f [ ' A u n c lh a r v e t l r cs u n r c s ; t i t n c l as rc y ls t e t n , b u L t 1K. (l-tirtt;Let I(: /(r for sotnesuitzrbtc 7':rncllet L be an elernentary encl-extension of /(. ) 1 2 , 7 L e t "t V I , I I F P A w i t h M ( b u t n o t n e c e s s a r i l y ' ) c o t r n t a b l e . h o wt h a t . f o r a l l S n e N , t h e r ei s a n e n r b e c l c l i n f tg : lVl--n 1(<,,,N iff S.S/(M)=.S.1)(N a) ncl y'FI,, rrTh(lvl) I 2 . 8 L e t I V I F P A b e c o u n t a b l ea n c l n o n s t a n c l u r c l ,t u , b e l V I a n c l n e N , a n c l le suplrose t l i e r e i s I < : , , i V Ir . v i t h a e l < b a r r cIlV = I 1 c . l V l . S h o wt h a t t h e r ei s J < y M w i t l r a e . l < b , J = . r V Ia n c la r ri s o r n o r p h i s r hn : N I - > J s u c ht h z r h l (u):s.