LOGIC COLLOQUIUM '88
STUDIES IN LOGIC AND THE FOUNDATIONS OF MATHEMATICS VOLUME 127
Editors:
J. BARWISE, Stanford H.J. KEISLER, Madison P. SUPPES, Stanford A.S. TROELSTRA, Amsterdam
AMSTERDAM
NORTH-HOLLAND NEW YORK 0 OXFORD 0 TOKYO
0
LOGIC COLLOQUIUM '88 Proceedings of the Colloquium held in Padova, Italy August 22-31, 1988
Edited by
R. E R R 0 C. BONOTTO S. VALENTINI A. ZANARDO University of Padova Padova, Italy
1989
NORTH-HOLLAND AMSTERDAM 0 NEW YORK 0 OXFORD 0 TOKYO
0 ELSEVIER SCIENCE PUBLISHERS B.V., 1989
All rights reserved. No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, mechanical, photocopying. recording or otherwise, without the prior written permission of the publisher, Elsevier Science Publishers B.V. Physical Sciences and Engineering Division, P.O. Box 103.1000 AC Amsterdam, The Netherlands. Special regulations for readers in the U S A . - This publication has been registered with the Copyright Clearance Center Inc. (CCC),Salem, Massachusetts. Information can be obtained from the CCC about conditions under which photocopies of parts of this publication may be made in the USA. All other copyright questions, including photocopying outside of the U.S.A., should be referred to the copyright owner, Elsevier Science Publishers B.V., unless otherwise spec$ed. No responsibility is assumed by the publisher for any injury andlor damage to persons or property as a matter of products liability, negligence or otherwise. or from any use or operation of any methods, products. instructions or ideas contained in the material herein.
pp. 37 1-374: copyright not transferred ISBN: 0 444 87455 0 ELSEVIER SCIENCE PUBLISHERS B.V. Sara Burgerhartstraat 25 P.O. Box 21 1, lo00 AE Amsterdam, The Netherlands Distributors for the USA. and Canada: ELSEVIER SCIENCE PUBLISHING COMPANY, INC. 655 Avenue of the Americas New York, N.Y. 10010, U.S.A.
PRINTED IN THE NETHERLANDS
V
EUROPEAN SUMMER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC PADOVA, 1988 The 1988 European Summer Meeting of the Association was Logic Colloquium ' 88, held at the University of Padova, Italy, from August 22 to August 31. It was organized by the Department of Pure and Applied Mathematics of the University of Padova. Financial support was received from IUHPS, the Consiglio Nazionale delle Ricerche, the Ministero della Pubblica Istruzione fondi 40%, the Camera di Commercio of Padova, the Cassa di Risparmio di Padova e Rovigo, the Giunta Regionale del Veneto. Further help was received from the Provincia di Padova, the Comune di Padova, the Comune di Piazzola sul Brenta, the Banca Antoniana di Padova e Trieste, Italsiel. There were 237 registered participants and 46 accompanying persons, from 30 different countries. 48 participants were supported by the organizing committee. The organizing committee consisted of: C. Bonotto, R. Fern, A. Zanardo (University of Padova); D. Mundici, S. Valentini (University of Milan); M. Dalla Chiara (University of Florence); A. Marcja (University of Trento); F. Montagna (University of Siena). The program committee consisted of: F. Drake (University of Leeds, UK), J. E. Fenstad (University of Oslo, Norway), R. Ferro (University of Padova, Italy), J. Gurevich (University of Michigan, USA), Y. N. Moschovakis (UCLA, USA), D. Mundici (University of Milan, Italy), A. Scedrov (University of Pennsylvania, USA). Professor John Steel, of UCLA, gave a series of three one-hour invited lectures on "Determinacy, large cardinals and inner models". Other invited one-hour lectures were as follows: W. Craig (Stanford) "Logical partial functions and extensions of equational logic" E. Casari (Florence) "Comparative logics and abelian L groups" J. C. Mitchell (Stanford) "Typed lambda calculus and logical relations" I. Moerdijk (Amsterdam) "Models fro the geometry of S. Lie and E. Cartan" M. Dickmann (Paris VII) "The model theory of chain fields" C. Bohm (Rome) "Solving equations in lambda calculus" D. N o m n (Oslo) "Kleene - spaces" D. Mundici (Milan) "The language of projective modules over AF C* Algebras" S. Friedman (M. I. T.) "The lllz-singleton conjecture" W. Maass (Illinois) "Some problems and results in the theory of actually computable functions" E. Bouscaren (Paris VII) "Model theory of elementary pairs of models" J-Y. Girard (Paris VII) "Geometry of interaction" A. Baudisch (ADW der DDR) "On stable solvable groups of bounded exponent" R. Chuaqui (Stanford) "Probabilistic models" M. Magidor (Hebrew) "Aronszajn eees and successors of singular cardinals" S. Feferman (Stanford) "Finitely presented logics" T. A. Slaman (Illinois) "Bounded time reducibility Turing degrees" A. Macintyre (Oxford) "A Lefschetz principle for algebraic integers" G. Rota (M. I. T.) "Logic and invariants theory" A. Kechris (CalTech) "Definability problems in analysis" G. Sambin (Padova) "Intuitionistic formal spaces and their neighbourhood"
fieface
vi
Also two panel discussions took place, one on "The teaching of logic" with panelists M. Davis (Courant) and D. Watt (Leeds), the other on "Trends in logic" with panelists M. Davis (Courant), S. Feferman (Stanford), M. Magidor (Hebrew), A. Macintyre (Oxford).
In addition there were 25 sessions for contributed papers at which 89 papers were presented, and a further 37 papers were presented by title. The editors, members of the local organizing committee, take this opportunity to thank very warmly all those who contributed to the success of the meeting, and in particular Stefan0 Baratella, Enrico Gregorio and Ugo Solitro. The editors Ruggero Ferro Cinzia Bonotto Silvio Valentini Albemzanardo Padova, December 30,1988
Vii
TABLE OF C 0 " T S Preface
V
On the model theory of free metabelian groups of bounded exponent A. Baudisch
1
D.0.P and n-tuples of models E. Bouscaren
11
Algebra and model theory of chain fields: an overview M. A. Diclanann
29
A Lefschetz principle for integral closures A. Macintyre
53
The C*-algebras of three-valued logic D. Mundici
61
Some problems and results in the theory of actually computable functions W. Maass, T.A. Slaman
79
Kleene-spaces D. Normann
91
On bounded time Turing reducibility on the recursive sets T.A. Slaman
111
The ni-singleton conjecture: an introduction S. Fnedman
113
The descriptive set theory of 0-ideals of compact sets A.S. Kechris
117
Solving equation in lambda-calculus C. Bohm, A. Piperno, E. Tronci
139
Comparative logics and abelian 1 -groups E. Casari
161
Finitary inductively presented logics S. Feferman
191
Geometry of interaction 1: interpretation of system F J. Y. Girard
22 1
viii
Table of Contents
Intuitionistic formal spaces and their neighbourhood G . Sambin
261
Probabilistic models R. Chuaqui
287
Logical partial functions and extension of equational logic W. Craig
3 19
Panel discussion on: TRENDS IN LOGIC Relation with computer science M. Davis
357
Some remarks S. Feferman
361
Trends in logic A. Macintyre
365
Remarks concerning the comments of A. Macintyre V. Ham&
369
Remarks on logic in mathematics and in computer science G . Longo
37 1
Comments in the panel discussion on trends in logic A. Ranta
375
Concluding remarks in the panel discussion Y.N. Moschovakis
377
Panel discussion on: THE TEACHING OF LOGIC The teaching of logic C. Bernardi
38 1
Teaching the incompleteness theorem M. Davis
385
LTF - a logic teaching framework D. J. Watt
393
Logic Colloquium '88 Ferro, Bonotto, Valentini and Zanardo (Editors) 0 Elsevier Science PublishersB.V. (North-Holland), 1989
I
On the model theory of free metabelian groups of bounded exponent by And reas Baud i sch Karl-WeierstraB-Institut
fur
Mathematik der AdW der DDR
1) Introduction Let F (q,p) (or F only) be the free group v v with p free generators in the variety A A of all groups G 9.p with a normal subgroup H such that H is abelian and of exponent q and G/H is abelian of exponent p. p and q are primes. In the elementary theory of FP with xo 4 P we interprete the monadic second order theory of an infinite vectorspace over the field K with p elements, where the P second order variables range over finite subspaces. For this interpretation G/H gives the desired vectorspace and the elements of H code the finite subspaces. One subspace is given by several points in H. The main tool from algebra is the Magnus-embedding [ 8 ] . That it can be used also for Fp(q,p) is proved by N. Blackburn [ G I . Using the methods of W. Baur [ 5 ] Rnd the undecidability of the universal theory of finite groups, due to A.M. Slobodskoi [ 121, we obtain the undecidability of the elementary theory Th(FP) of Fp (x, 4 p ) . Furthermore it follows that Th(Fv) is unstable. It has the strict order property and the independence property. This example has led us to prove that every stable solvable group of bounded exponent is nilpotent by finite. But this theorem follows already from results of R.M. Bryant and B. Hartley C71. Let us look at the elementary theory of relatively free groups of other varieties of groups. For absolutely free groups it is only known that they are not superstable (Gibone, see C113). The stabilityproblem and the famous problems of Tarski concerning the decidability and the elementary equivalence are open. For free nilpotent of length c ( > 1 ) groups [9] and free solvable of length
A . Baudisch
2
c ( > 1 ) groups [ l o ] Malzew gave interpretations of the elementary theory of the natural numbers. Undecidability and unstability follow. From Szmielews elimination of quantifiers [13] decidability and stability for free abelian groups are obtained. I n the case of free abelian groups of bounded exponent n we have even o-stability and non-multidimensionality. The same properties are proved for infinite free nilpotent of length c groups of exponent pm with c < p [ 2 ] , [ 3 ] . I am very grateful to Elena and Ralph Sti;;hr for helpful discussions.
2 ) The Magnus-Embedding
extended by N. Blackburn [ 6 ] , The work of W. Magnus [ a ] , gives us a presentation of the groups F free in the P variety aqAP of all groups G with a normal subgroup H where H is abelian of exponent q and G/H is abelian of exponent p ( p , q primes): Let B be an abelian group of exponent p generated by {bi : i < P I . Let Kq be the field of q elements and K (B) be the group ring of B with 9 coefficients in I< . Assume that A is a free I< (B)-module 4 9 freely generated by {ai : i < p } . Then the sernidirect product BA is the group of all pairs (b,v) where b f B and 'p f A with the following group operation (b,qp?(c,v)= (bc,;pc + w). (1,O) is the tinit of this group and ( k . - ' , y b - ' ) is the inverse element, of (b,v). Sending y of A to ( 1 , q ) we can consider A as a normal subgroup of BA and BA/A B. It is eas i ly computed :
(1)
(b,q)'
= ( l , ' p ( l + b + b2 +
. . .
+ bp-')),
The group BA is an elernent of the variety A A . Let 9 P {ci : i < p} be 3 set of free generators of F . Then it is CL possible to extend f(cij = (bi,aij to a homomorphism f of FP into BA. By Blackburn ( 6 3 f is an embedding of F in P
Model Theory of Free Metabelian Groups of Bounded Exponent
3
BA. T h e r e f o r e w e i a e n t i f y FP w i t h t h e c o r r e s p o n d i n g Let-H be t h e subgrnup F A o f FP. By s u b g r o u p o f BA. P ( 3 ) H is a n o r m a l s u b g r o u p o f F . Then FP/H B. If we P work in H w e o f t e n w r i t e o n l y 4 i n s t e a d o f ( 1 , ~ ) .We c a n c o n s i d e r H as a Kq(B)-module. Con j u g a t i o n d e f i n e s an a c t i o n o f B on H . I n o t h e r words ( l , q j ( b J v ) = ( 1 , q b ) is i n d e p e n d e n t from w . E v e r y e l e m e n t i n A has a u n i q u e p r e s e n t a t i o n 'p = I: r i a i w h e r e r i € K ( B ) . B y t h e r e s u l t s
9 i ( l , 4 ) f H i f f Z ri(l-bi) = 0 i n K ( B ) . 9 i By (1) ( l , S i ) = ( b i , a i ) ' C H and by ( 2 ) ( 1 , ~ .. ) = 1J [ ( b i , a i ) , ( b ., a . ; I € H . W e use
t o d e n o t e t h e J J s u b g r o u p g e n e r a t e d by g l , . . . , g n .
of B l a c k b u r n [ S ]
Lemma 2 . 1 . I f w e c o n s i d e r 13 as a I< (B)-module, t h e n i t is cl g e n e r a t e d by t h e s e t {Si : i < p } IJ . : E . . : j < i < p } . If 1J h f H f l < ( b l , al), . . . , ( bn, srlj > t h e n h = Z E - .r-. + 1 6 . s - where r - . € K ( < b l , . _ . b , n>) l<j
Proof:
Using
presented 0
<
as
k i < o.
yx = x y [ y , x ]
n i
By
e v e r y e l e m e n t g of FU
( b i , a i ) k ig ' , (3)
g'
where
has t h e form
r-. € K (B). If g f H then plki 1J 9 1 < i < n . The a s s e r t i o n f o l l o w s . 0
can
g ' i [F , F 1 , P
for
and
P
Z E - . r-. j
every
be
where i
with
F o r o u r model t h e o r e t i c p u r p o s e s t h e f o l l o w i n g c o n s e q u e n c e is i m p o r t a n t .
Lemma 2 . 2 . H is d e f i n a b l e i n F
by V y z ( [ [ y , z l , x ] = 1)
Proof: To show t h e nontrivial direction, choose = ( b l , a l ) and z = ( b O , a O ) . Assume x = (h,qa) i s i n FP b u t n o t i n H. Then b + 1. [ y , z ] = ( l , a o ( l - b l ) - a l ( l - b o ) ) a n d C CY,Z! 1 , X I = ( 1,sol( l-bl) ( b - 1 ) - ( l - b o ) ( b-1))) . I n B b l a n d b are l i n e a r l y i n d e p e n d e n t o r Lo and b are y
4
A . Baudisch
l i n e a r l y independent. T h e r e f o r e i n I<( B ) (l-blj(b-l) + 0 9 o r (l-bo)(b-l) 0 . S i n c e t h e K (Bj-module A is f r e e l y
*
9
g e n e r a t e d by ao,a l , .. . it f o l l o w s t h a t [ [ y , z ] , x ]
Between t h e g e n e r a t o r s following r e l a t i o n s : F o r k < j < i < p
(6)
E .
Zi
and
E .
. of
1J
H
we
+
1.0
have
the
.(1 + b . + b2 t . . . + b P - l ) ( l t h . t b ? + . . . t b p - l )= 0 1 1 J J J
1J
S i m i l a r l y as Bachmuth h a s p r o v e n g r o u p s C 1 1 , w e c a n show:
for
free
metabelian
P r o p o s i t i o n 2 . 3 . L e t u s c o n s i d e r - H as a K ( B ) - m o d u l e . With rl r e s p e c t t o t h e g e n e r a t o r s g i and E - - ( j < i < p ) ( 4 ) , ( 5 ) , 1J and ( 6 ) g i v e u s a s y s t e m of d e f i n i n g r e l a t i o n s f o r
H.n
W e c a n c o n s i d e r P r o p o s i t i o n 2 . 3 as a r e s u l t c o n c e r n i n g t h e s u b g r o u p of BA g e n e r a t e d by t h e e l e m e n t s ( b i , ai!. Then i t i m p l i e s t h e consequence o f Blackburns paper I S ] , t h a t t h i s s u b g r o u p is i s o m o r p h i c t o F . CI
3) Searching f o r f r e e p e n e r a t o r s In t h i s s e c t i o n w e c o n s i d e r t h e f o l l o w i n g q u e s t i o n : L e t {co. cl,.. . } be a s u b s e t of F s u c h t h a t t h e images v co + H, c 1 + H, . . . i n Fp/H freely ( i n t h e v a r i e t y of Fv/H. Does a b e l i a n g r o u p s of exponent p ) qenerate { c o , c l , . . . } f r e e l y g e n e r a t e FP ? I n t h e case p = q t h i s i s true, p r o v e n by G . Baumslag [4]. W e see e a s i l y t h a t i t
Model Theory of Free Metabelian Groups of Bounded Exponent
5
is n o t t r u e for t h e case p +; q. Assume c o , c l , . . . freely g e n e r a t e FP. Then cz + 13, e l + H, c2 + H, . . . freely g e n e r a t e F /H b u t c:, cl, c2, . . . d o n o t f r e e l y g e n e r a t e F P P' since = 1. W e can show t h e f o l l o w i n g o n l y :
(~09)~
Lemma 3 . 1 . Assume t h a t co, c l , . . . Si
fl
c f H be
c,.
l(iGt-1
modulo
f r e e l y g e n e r a t e FP .
H where
.
..
}
< v
( 1 G i G n) there
is
a,
< ...
1
and 0 < s i < p . Then f o r e v e r y i some d s u c h t h a t c = d modulo H a n d ({c,,~,.
; ' an
al
<
Let
\ {c".}) U {d} f r e e l y g e n e r a t e s FbJ 1
P r o o f : W.1.o.g. s u p p o s e i = 1. Choose r i (0 < r i < p ) s u c h t h a t r i s l = s i mod p . The map f ( c k ! = ck f o r k al r and f (c,']. ) = c '2 . . . car l -- e would i n d u c e an a u t o m o r C'X1 a 2 n phism o f t h e a b s o l u t e l y f r e e g r o u p g e n e r a t e d by c o , c l , . . T h e r e f o r e i t i n d u c e s an a u t o m o r p h i s m o f FP . Then ({c,, el,.. . } .\\ (c } ) IJ{ e } i s 3 s e t o f f r e e g e n e r a t o r s o f s1 "1 : FU. Now c = e mod H . T h e r e f o r e w . 1 . o . g . ri = 1 and c = c f o r some a and 0 < s < p . Assume s = fl ti, where t h e
*
l< i < m
t i a r e primes. W e show t h e a s s e r t i o n by i n d u c t i o n on m. F o r s = 1 n o t h i n g i s t o p r o v e . O t h e r w i s e s = rs' where r = t l and s' = fl t i . By i n d u c t i o n h y p o t h e s i s t h e r e is l
Some
d
s u c h that
s'
cca = d modulo H a n d ({c,, e l , . . . } \ { c a } ) U { d l i s a s e t o f f r e e g e n e r a t o r s of F . T h e r e f o r e w e h a v e r e d u c e d t h e v p r o b l e m t o t h e case w h e r e c = cQs modulo H and s is a p r i m e with 1 < s < p. 1 ) Case s + q Then G.C.M.(s,pq) = 1 and u s + vpq = 1 f o r some u and v . I t f o l l o w s c" = c u S l l = cl-vpq = c . We Choose d = c s ' a a obtain t h a t ( { c , , ~ , ,. . . } \\ { c u ) U {d} i s a s e t of free g e n e r a t o r s of Fp. '1
A . Baudbch
6
2 ) Case s = q Then q = s < p . W e u s e G . C . M . ( p + q , p q ) = 1. Choose u and v s u c h t h a t u ( p + q ) + vpq = 1. Then a = ca a n d c: f H . Therefore d = has ( ca V a) U = ca cPpq the desired p r 0 p e r t i e s . a
c2.E
C o r o l l a r y 3 . 2 . E v e r y a u t o m o r p h i s m o f F /H automorphism o f F .
is i n d u c e d by a n
P
4)
I n t e r p r e t a t i o n a n d U n d e c i d a b i 1i t y
Theorem 4.1. L e t T 2 b e t h e monadic s e c o n d o r d e r t h e o r y of a n i n f i n i t e v e c t o r s p a c e o v e r t h e f i e l d fC w i t h F e l e m e n t s P where t h e s e c o n d o r d e r v a r i a b l e s r a n g e o v e r f i n i t e s u b spaces. T h e r e i s a n i n t e r p r e t a t i o n of T2 i n t h e e l e m e n t a r y t h e o r y of FP: F /H i s c o n s i d e r e d as t h e d e s i r e d v e c t o r v W e define for k C H g + H c V(h) iff [ h , g ] = 1. space. The V ( h ) are f i n i t e s u b s p a c e s of f /H and t h e y r a n g e lover &l a l l f i n i t e subspaces.
Proof: I t i s clear t h a t w e c a n c o n s i d e r F V / H as a v e c t o r s p a c e o v e r Kp. L e t h be any e l e m e n t o f H . As m e n t i o n e d i n 2 . ( 2 ) g = g ’ modulo H i m p l i e s [ h , g l = [ h , g ’ ] . T h e r e f o r e w e c a n d e f i n e V ( h ) s F /H as t h e z e t o f all v g + €3 i n F / H w i t h [ h , g ] = 1. V ( h ) is a s u b g r o u p s i r i c p P hg = h and hg’ = h i m p l i e s hgg’ = h . As above l e t u s c o n s i d e r €1 as a Kq(B)-module where I< ( B ) i s t h e g r o u p r i n g 9 B = F /H w i t h c o e f f i c i e n t s i n I< . In t h i s n o t a t i o n P 9 {d f FP/H 1 h ( d - 1 ) = 0 ) .
over V(hj
C l a i m 1 L e t h f H and l e t cl,.. . , cn be any s u b s e t of a s e t of f r e e g e n e r a t o r s o f F such t h a t h f (cl, . . . , crl>. Then P V ( h ) !z + H / H .
C o n s i d e r i n g t h e Magnus-Embedding l e t ci be ( b i , a i ) as above i n s e c t i o n 2. Then h = I: a i r i ( i n module n o t a 1$ i < n are e l e m e n t s o f t h e g r o u p r i n g t i o n ) where t h e ri
7
Model Theory of Free Metabelian Groups of Bounded Exponent
K q ( < b l , . . . ,b n > ) (Lemma 2 . 1 . ) . K q ( < b l , . . . , b,>) i s t h e g r o u p r i n g o v e r t h e s u b g r o u p < b l , . . . ,bn> of B w i t h c o e f f i c i z n t s i n I< . W e show t h a t i f d f t h e n d f V ( h ) . By 4 t h a~t c l , . . . , c ~ , c ~is+ ~ Lemma 3 . 1. t h e r e i s some c ~ s u~c h +
a s u b s e t of a s e t of f r e e g e n e r a t o r s of Fp and c , + ~ is i n L e t c n + l = ( b n + l , a n + l ) . Then t h e c o s e t of d modulo H. bn+l = d . W e o b t a i n t h a t h ( b r l + l - l ) = 0 i s i m p o s s i b l e s i n c e Thir; is a t h i s would i m p l y r i ( b n + l - l ) = 0 f o r 1 G i < n . c o n t r a d i c t i o n b e c a u s e r i € I<( < b l , . . . ) ,b 9
Claim 1
.a
i m p l i e s t h a t e v e r y V ( h ) is a f i n i t e
subgroup
of
F,/H.
C l a i m 2 F o r e v e r y f i n i t e s u b s p a c e D of F /H t h e r e i s some v h € H such t h a t V(h) = D.
V ( e l 0 ) = <1>, as p r o v e d i n Lemrria 2 . 2 . T h e r e f o r e w . 1 . o . g . D +; <1>. By L e m m a 3 . 1 . i t is p o s s i b l e t o c h o o s e a s e t o f f r e e g e n e r a t o r s of F s u c h t h a t t h e e l e m e n t s c l , .. . , c n o f v t h i s s e t modulo H g e n e r a t e D. As above l e t c- = (bi.aj) f o r 1 < i < n. I n t h e g r o u p r i n g I< (B) d e f i n e @(D! = I: d .
4 dtD S i n c e m u l t i p l i c a t i o n w i t h a n e l e m e n t of D is a p e r m u t a t i o n o f D w e o b t a i n 0 ( D ) ( d - 1 ) = 0 f o r d E D . Choose h = a , e ( D ) . S i n c e 9 ( D ) ( d - d ) = 0 f o r d E D, D is a s u b s e t of V(h). By c o n s t r u c t i o n D = < b l , . . . , b n > . Then by C l a i m 1 D r V ( h ) L b 1, . . . , bn) = D, as d e s i r e d . <;I
<
Corollary 4 . 2 . The e l e m e n t a r y t h e o r y unstable. I t has t h e strict order independence p r o p e r t y .
o f Fp (x, property
Using t h e work of W . obtain :
S l o b o d s k o i [123
B a u r [ 5 ] and A . M .
v)
arid
is the
we
c)
C o r o l l a r y 4 . 3 . TL a n d t h e r e f o r e t h e e l e m e n t a r y Fp ( x O < p ) are u n d e c i d a b l e .
theory
of
A . Baudisch
8
The r e s t of t h e p a p e r i s d e v o t e d t o t h e p r o o f W e can also formulate t h e r e s u l t corollary. S l o b o d s k o i i n t h e f o l l o w i n g way.
of of
this A.M.
Theoretn 4.4.( S l o b o d s k o i ) L e t u s c o n s i d e r t h e l a n g u a g e LG o f g r o u p t h e o r y w i t h s y m b o l s f o r m u l t i p l i c a t i o n , u n i t , and inverse element. T h e r e i s some n a t u r a l number rn s u c h t h a t a l l u n i v e r s a l s e n t e n c e s w i t h a t most 111 t h e set o f v a r i a b l e s t r u e i n a l l f i n i t e groups is undecidable.
I f A is a v e c t o r s p a c e w e u s e A u t ( A j t o d e n o t e t h e g r o u p o f of A . L e t Sm b e t h e t h e o r y o f all finite autornorphisrns V e c t O r s € J a c e s A o v e r K w i t h NI autornorphisms f l , . . . , fm. W e P use a language L w i t h a symbol f o r t h e a d d i t i o n arid rn unary f u n c t i o n s y m b o l s x i ( 1 4 i < rn) f u r t h e a u t o m o r phirns. L e t S i b e t h e d e f i n a b l e e x t e n s i o n of Sm w i t h a d d i t i o n a l u n a r y f u n c t i o n symbols x i 1 f o r t h e i n v e r s e automorF o l l o w i n g W. Baur [ 5 ] w e o b t a i n : phisms F o r e v e r y o p e n f o r r m l a q ( x l , . . . . x m ) i n LG + w i t h the v a r i a b l e s x l , . . . ,xm o n l y t h e r e is a s e n t e n c e 'p i n L+ sm s u c h t h a t f o r e v e r y v e c t o r s p a c e A o v e r K and f o r a l l P f l , .. . , frrl € A u t ( A ) A u t ( A ) P== q ( f l , . . . . f m ) i f f -1 For instance if ( A , f l , . . . , frrl, f l , . . . vp+. ~ ( x , .,. . . x m ) is an equation ylyz.. .yk = 1 with rrl,x1 -1 , . . . , xii'> i n L~ t h e n yi € { x l , .. . , s
fil.
-
,fill)
y+
= ~ ~ z ( ~ ~ ( ~ ~ ( . .= . z )~ ~wbere ( ~ ) . . . ~ )
W e can formulate:
(1)
A u t ( k ) k V x l . . .xm'p(xl,. . . , x r n ) i f f f o r a l l f l , . . . , f m f Aut(A). ( A , f l , . . , f r f l , f-1 l ,.
. . > f i 1 v". ) I===
Model Theory of Free Metabelian Groups of Bounded Exponent
Fo lowing W . (2
9
Baur a g a i n w e s e e :
F o r e v e r y f i n i t e g r o u p G g e n e r a t e d by a t most rn e l e m e n t s t h e r e e x i s t s an f i n i t e v e c t o r s p a c e A o v e r KP s u c h t h a t t h e f i n i t e g r o u p Aut(A) c o n t a i n s G .
A is d e f i n e d as t h e a d d i t i v e g r o u p o f t h e g r o u p r i n g I' ( G ) . Then t h e automorphisrn c o r r e s p o n d i n g t o g f G is t h e b m u l t i p l i c a t i o n w i t h g i n I< ( G ) . Combining ( 1 ) and ( 2 ) it P is proved f o r e v e r y open s e n t e n c e ~ ( x. . . , xm) o f LG i n t h e v a r i a b l e s x,,. . . ,xrn only:
,,
( 3 ) T h e f o l l o w i n g s t a t e m e n t s are e q u i v a l e n t . ( i ) I n e v e r y f i n i t e g r o u p G Vs,.
. . srncp(xl,. . . , xm ) i s t r u e .
( i i ) In every f i n i t e vectorspace A over K f l , . . . ! f m € Aut(A)
for a l l P ( A , f l ' . . . , f r n , f-1 l , . . . , f -1 m j
e'p'.
A s W. Baur h a s o b t a i n e d t h e u n d e c i d a b i l i t y o f t h e element a r y t h e o r y of an i n f i n i t e v e c t o r s p a c e w i t h two automorphisrns from an u n d e c i d a b l e word problem w e g e t fr-om S l o b o d s k o i s C l 2 l r e s u l t (Theorem 4 . 4 . ) :
Leiarna 4 . 5. T h e t h e o r y Sm o f f i n i t e v e c t o r s p a c e w i t h m autornorphisms i s u n d e c i d a b l e .
over
I n a n a l o g y t o W . Baur 151 t h e r e is an i n t e r p r e t a t i o n of SIfl i n t h e t h e o y y T,+3 o f i n f i n i t e K - v e c t o r s p a c e s w i t h rn+3 P p r e d i c a t e s f o r f i n i t e s u b s p a c e s . L e t A be a f i n i t e v e c t o r s p a c e o v e r K w i t h t h e automorphisms f 1, . . . , f m . L e t F B be an i n f i n i t e K - v e c t o r s p a c e . Choose two s u b s p a c e s P -2 A, - A2 A w i t h A, n A2 = (0) o f B. T a k e a s u b s p a c e Ag of t h a t i t d e s c r i b e s an isomorphism f A, @ A2 i n s u c h a way, of A, and A2. CTsing t h i s i d e n t i f i c a t i o n f of A, and A2 w e can u s e f u r t h e r s u b s p a c e s Ai+3 o f A, 83 A2 t o d e f i n e t h e g i v e n automorphisms f i o f A. T h i s is t h e i d e a t o p r o v e :
Lemma 4 . 6 . The t h e o r y Trn+3 o f i n f i n i t e v e c t o r s p a c e s w i t h m+3 p r e d i c a t e s f o r f i n i t e s u b s p a c e s i s u n d e c i d a b l e . 0
A . Baudisch
10 References
Bachmuth, Automorphisms of f r e e m e t a b e l i a n g r o u p s , Amer. Math. S o c . 118 ( 1 9 6 5 ) . 93-104 A. Baudisch, D e c i d a b i l i t y and s t a b i l i t y of f r e e n i l p o t e n t p-groups of f i n i t e exponent, Ann. Math. L o g i c 23 ( 1 9 8 2 ) , 1-25 A. Baudisch, On L a s c a r r a n k i n n o n - m u l t i d i m e n s i o n a l o - s t a b l e t h e o r i e s , i n L o g i c C o l l o q u i u m ’ 8 5 , e d . by The P a r i s L o g i c Group, N o r t h - H o l l a n d , 1987, 3 3 - 5 1 G . Baumslag, A s u b g r o u p t h e o r e m f o r some p r o d u c t v a r i e t i e s , A r c h . Math. 6 ( 1 9 6 5 ) , 337-341 N. B a u r , D e c i d a b i l i t y a n d u n d e c i d a b i l i t y o f t h e o r i e s of a b e l i a n g r o u p s w i t h p r e d i c a t e s f o r s u b g r o u p s , C o m p o s i t i o M a t h e m a t i c a 3 1 ( 1 9 7 5 ) , 23-30 N . B l a c k b u r n , N o t e on a t h e o r e m o f Magnus, J o u r n a l A u s t r a l . Math. Soc. 10 ( 1 9 6 9 ) , 469-474 R. M . B r y a n t , B. H a r t l e y , Periodic locally solvable g r o u p s w i t h t h e m i n i m a l c o n d i t i o n on c e n t r a l i z e r s , J . of A l g e b r a 6 1 ( 1 9 7 9 ) , 328-334 W . Magnus, On a t h e o r e m of M a r s h a l l H a l l , Ann. o f Math. 4 0 ( 1 9 3 9 ) , 764-769 A . I . Malzew, On a c o r r e s p o n d e n c e between r i n g s and g r o u p s , M a t . S b . 50 ( 1 9 6 0 1 , 257-266 ( i n R u s s i a n ) A . I . Malzew, On free s o l v a b l e g r o u p s DAN 130 ( 1 9 6 0 ) , 495-498 ( i n R u s s i a n ) B. P o i z a t , Groupes s t a b l e s , avec types generiques r e g u l i e r s , J o u r n . Sym. L o g i c 48 ( 1 9 8 3 ) , 339-355 A.M. Slobodskoi, Undecidability of t h e universal ( 19R1), t h e o r y of f i n i t e g r o u p s , A l g e b r a i L u g i k a 2 0 207-230 ( i n R u s s i a n ) W . Szmielew, E l e m e n t a r y p r o p e r t i e s of a b e l i a n g r o u p s , Fund. Math. 4 1 ( 1 9 5 5 ) , 203-271.
[ 1 3 S.
Trans.
[23
[3]
[4]
[5]
[61
“71
[8] [9]
[lo] [ll] [ 121
[ 131
Logic Colloquium '88 Ferro, Bonotto, Valentini and Zanardo (Editors) 0 Elsevier Science Publishers B.V. (North-Holland), 1989
11
D.0.P AND N-TUPLES OF MODELS
ELISABETI! BOUSCAREN C.N.R.S.-UNIVERSITE PARIS 7
Abstract. We show that, for T a complete superstable theory, if the theory of pairs of models of T is stable, then, for all 11, the theory of n-tuples of models of T is stable. In order to prove this, we generalize to arbitrary n-tuples of models a previous result of ours: the theory of pairs of T is stable if and only if it is superstable if and only i f T does not have the Dimensional Order Property [2].
Introduction. If T is a complete first-order theory i n the language L, let L2 = L u { S } , where S is a new unary predicate symbol. We consider elementary pairs of models of T, M1 5 M2, M I # M2, as L2structures, with M I interpreting the predicate S, and denote by T' the elementary class of such pairs (M1,Mz) in L2. Note that in general T' is not complete. In recent years, some results werc obtained which we believe to be evidence of the fact that the study of the model-theory of T' in a general context is a genuine subject, in the following sense: it is possible t o express "sophisticated" properties of T i n a "simpler way" i n the language L2. For example in [5], Poizat gave various equivalent statements of the fact that T does not have the finite cover property in terms of very basic behaviour of a particular complete extension of TI, the theory of "beautiful pairs". In [2], it was shown that, for nuperstable T, the following are equivalent: (1) T does not have the Dimensional Order Property (2) T' is stable (3) T' is superstable. Since then we realized that little seemed to be known about the meaning of even
12
E. Bouscaren
much more basic properties of T'. For example, the following question: does the fact that T' is complete reflect some general properties of T?, has only got partial answers for the moment (see [3]). One of the so far unsolved problems that turns out to be naturally linked to the above question is the following: is there anything to be gained by enriching the language even further and considering arbitrary ii-tuples of models of T , instead of just pairs of models of T? We still do not know, for example, if the fact that T' is complete implies that, for all n '2, the theory of n-tuples of T is also complete. In this paper, we want to consider the question of arbitrary n-tuples of models in the context of classification theory, that is i n the context of the rcsult from [a] mentioned above, which characterizes superstable NDOP theories in terms of the stability of pairs. The main result ( 5 2 ) will be the generalization of our result about pairs: if T is superstable NDOP, then for all n, I I 2, the theory of n-tuples of T is superstable NDOP. We show this by induction on 11. I n fact, our induction assumptions a t each stage will have to be more detailed and contain facts about the behaviour of the orthogonality and domination relations. This proves that, for a superstable theory T, if the theory of pairs of 'r is stable, then, for all n, the theory of n-tuples of T is stable. We do not know if this is also true more generally for a stable theory T. In the last part of the paper (53), we go back to pairs of models and show that, if T is superstable NDOP, and i f K is regular, K. 2 I T I , then, for any complete extension of T' in La, all &-saturated models of T can be chosen to be the small model in a &-saturated pair for this Extension. There are examples of theories with DOP for which this is impossible, even if one dces not require the pair to be itself K3aturated.
>
>
>
Notation. For T a complete theory in L, for n
> 2, we define L,
to be
L U {S,...,Sn) where the Si's are new unary predicates. We consider elementary n-tuples of models of T, M1 <...< M, as L,-structures, with M i interpreting Si. We will always be considering arbitrary complete theories of such n-tuples of distinct models in L,, which we will usually denote by T,.
D.O.P. and N-Tuples of Models
13
By convention, T,, for n = 1, denotes T. A model of T, will be denoted in the following way M = (MI,...,M,), where as sets M = M,. W e will write x E Mi instead of M I= 'I x E Si ' I . W e will make no distinction between underlying sets and L,-structures, and if we have an n-tuple M = (MI,...,M,-l,M,), we will write that M,-l = (Mi,...,Mn-2,M,-]) is an L,-lstructure. In order to distinguish between notions in L and in L,, the notions in L,, fGr n > 1, will be preceded by T,, or indexed by 11, for example, the T,-type of a over A is denoted t,(a/A), we will have models which are T,-prime over some set ... In order t o avoid any ambiguities we will i n fact often use this notation i n a redundant fashion. Preliminaries. W e assume the reader is familiar with all the basic notions of stability as well as with the notions used in Classification Theory: orthogonality, regular type dimensional order property, which were introduced by Shelah in [6,7], and are also presented, for example in [ 1,4]. We follow the usual convention of working inside a saturated model of T of inaccessible cardinality, which we call the monster model. If p, q are types over some model M, we denote p dominates q over M by p D q over M. If p and q are domination equivalent, we write p o q. Here are a few casy basic facts about n-tuples that we will be using all the time and which we leave to the reader: PROPOSITION
0.1. Let T be a complete theory and let T,, be a complete theory of
n-tuples of T. I f M is a model of T,, then (1) if M is T,-A-saturated, then for all j , 1 5 j 5 n, then Mj is a Tj -A -saturated model. (2) f is a T , -automorphism of M if and only if J is an automorphasrn of M and, for each j , 1 5 j 5 n-1, f IM, is a Tj-automorphisrn oJMj. (3) If M inN , then for all j , 2 <_ j <_ n, the type of Nj-1 over Mj is the heir of t(Nj d M j -1). (4) IJ M < ,N 5 , N', and t, ( a / M ) , then for all j , 1 5 j 5 n
a E N'
is such that t n ( a / N ) is a T,-heir
of
E. Bouscaren
14
- t(a/Nj) is a heir oft(a/Mj)
-if;
E
I$,
then tj(Z/Nj) is a Tj-heir oJtj(a/Mj).
$1Forking in n-tuples. This part is exactly similar to what one has to do in the case of pairs, the fact that we are here dealing with 11-tuples does not make any difference in the proofs. Hence we will state the results without proof and we refer
the reader to [2, section 21. Once more T is a complete theory and T, is a complete theory of n-tuples of T. 1.1. Let T be superstable and let M be n model of T,,, M = ( M I ,...,MI,).
PROPOSITION
e,
If 6 E M , are such that t(a/M,-l) = t(J/Mn-l), then T,-type ouer M,-I in the it-tuple ( M I ,...,M,). DEFINITION:
a
and 6 have the saiiic
(in Teq)Let T be stable and let M 5 , N be two models of T,. If
we define the T,-basis of a over M to be the canonical basis of the type of M U N,.I. LEMMA
a E N, a over
1.2. Let T be stable and let M 5 , N be models oJT,.
(i) The preceding definition is independent of the model N of T, which contains a. (ii) Let E N and let C(e) be the T,-basis of over M . Then C ( a ) is contained in the T , -definable closure oJM U
a
P R O P O S I T I O N 1.3.
a.
Let T be superstable and let MSn N be models of T,. Let
b E N,with respective T,-bases C(a) and C(b) over M . I f t ( a ^ C(e)/ M ) = t ( 5 - C(b)/ M) and t , (C(.)/ M)= then t,(&. C(ii)/ M ) = tn(6^C(6)/ M).
1,
a,
(C(b)/ M),
We are going to need special notation for the model M,,-,, which we will call the small model and denote by S. Types of T, which contain the formule E S" will be called types ofthe small model.
"v
PROPOSITION
1.4. Suppose that T is superstable and that T , is stable. Let M 5 , N be
models of T,,
a, b E N, C ( a ) the T, -basis
oJ
a ouer M .
D.O.P. and N-Tuples o f Models
15
Then a and 5 are T,,-independent over M i f and only i f (i) C(a) and 5 are T,-independent over M (ii) t(a/MU Nn-l U 5) does not fork over M U Nn-l. COROLLARY 1.5. If T is superstable, then T,, is stable (superstable, w-stable) if and only if all the types ofthe small model of T,, are stable (have U-rank, have Morley Rank). PROOF. One gets first the stable case from Proposition 1.3. Itl then easy to get the superstable case by applying Proposition 1.4. The cLFstable case also follows immediatly from Proposition 1.3.
f 2 Thcories with NDOP.The induction. In this second part, although again the ideas are very similar to those in the corresponding parts of [a, sections 3 and 41, the proofs are different. Note that we are going to need , for the induction, some facts that had not been shown in the particular case of pairs, condition ( 2 ) i n the induction for example. We will prove here only exactly what is needed for our induction. Once this is done, we leave it to the reader to check that one can in fact be more precise about certain points (forking, depth of the theory) as it was done in the case of pairs. So from now on, we suppose that, for all k, 1 5 k 5 n-1, all complete theories Tk of k-tuples, satisfy the following three assumptions: ( 1 ) k Tk is superstable NDOP. (a), If M,M, ...N” are N,-saturated models of Tkr such that, for all j , M < k Mi, and { M ,...,M } are Tk-independent over M , then, if N is Tk -N, -prime over U Mj ’s, N is also N, -prime (for T) over U Mj ’s. ( 3 j k If M
E. Bouscaren
16
In a first step we are going to show that T, is superstable. Then we will have to go into a more detailed study of orthogonality that will give us that T, has NDOP and satisfies (2)n and (3)n. By the results in the previous section, we only need to show that the types of the small model of T, are superstable. This will follow easily from the Main Proposition, which gives forking for these types in term of forking for T and for T,-1 , where T,-l denotes the (complete) theory in the language Ln-l of the n-1-tuple (MI,...,Mn-l), for any M = (MI,...,Mn-l,Mn) model of T,. MAIN P R O P O S I T I O N 2.1. Let M I , N be models of T , and let ;,6 E N, CC N,,.l be such that (a) a is in the small model o f N (i.e. in N,,.1)
(b) t(%/Nn-l U M,) does not fork over C u M,, (c) tn-l(Z/Mn-1 U C) does not T,,.~-fork over Mn.l. Then t n ( a / M U 5) is the unique T,-heir o f i t s restriction to M. Before going into the picof, let us see why this gives us the superstability of Tn.
Let M 5 , P 5 , N be models of T,, and let 6 E N,-1. The followzng are equzvalent: (a) t n ( a / P ) zs the unzque T,-hear o f t n ( a / M ) ( z a ) tn-1 ( ~ / P , - I )does not T,-1 -fork over M,-l. From this it follows easily that COROLLARY 2.3. The theo y T , as superstable. COROLLARY 2.2.
Let us now go back to the proof of Proposition 2.1. We will in fact be showing the following: PROPOSITION 2.1'. Let M S , N be models of T,, and let 21,az E Nn-l, C I Nn.l, 6 E N be such that:
(i) tn ( Z I / M ) = tn ( ; l / M ) (ia) { a l , az,C} is a T,-t-independent set over Mn-l. (iii) t(b/Nn-l il M,) does not fork over CU Mn. Then t,(al/M, U C U 3) = t, ( Z Z / M , U C U 6). Now 2.1' implies 2.1 easily: let 5 and 6 be as in 2.1. Take a' realizing an
D.O.P.and N-TupIes of Models arbitrary Tn-heir of tn(Z/M) over M U C U 6-Z, w.1.o.g. Then apply 2.1' to and a'.
a
17
a' is
realized in Nn.l.
PROOF OF PROPOSITION 2.1'. We leave it to the reader t o check that we can assume have the that both M and N are N,saturated. We can also assume, as and same T,-type over M that there is a T,-automorphism g* of N which sends Zl to $2 and leaves M pointwise invariant. First step: we begin by constructing a T,-l-automorphism g of Nn-l which sends Zl to and leaves M,.I U C pointwise invariant. Now, N,-1 and M,-1 are models of Tn-l,and by our induction assumption, T,l.l is superstable N D O P . Let R1, M,-l U 5 Rl L Nn-l, be a model of Tn.l, maximal T,.140minated by over M,_l. Now let R2 be the image of R, by the T,,-automorphisn~ g*. Then M,.1 U C R2 Nn-l, and R2 is maximal T,,_140niinatedby 22 over M,.1. Since {&,%2,C} is a T,.l- independent set over M,l.l, it follows that Rl, R2 and C are T,-,-independent over MI,-,. Now choose P, M,.I U C C P N n - l , model of Tn-l,maximal T,-l-independent from Rl U Rz over M.-l. As T,.1 has N D O P , the model Nn.l must be T,-l-N,-prime over Rl U R2 U P. By independence, there is an elementary T,-I-isomorphism between Rl U R2 U P and R2 U Rl U P, which can be extended, by uniqueness of N,-prime models, to a T,.,-automorphism of N,-1. We denote this autornorphism by g. Then g satisfies the following: -grR1 = g*IRl - g exchanges Rl and RZ - g r P is the identity. Second step: we now want to extend g to an automorphisrn f of the whole model N , which will leave M U C U 6 pointwise invariant. This of course will give us the result we want. Now, as Rl,R2 and P are T,.l independent over Mn.l, they are certainly independent (for T) over M,.l. Let S1, containing Rl, be a model of T , maximal in N dominated by S1 over M,.l, and let S2 be the image of SI by the original T,-automorphism g*. Then S2 is maximal dominated by R, over M,.l. By domination, S1 and S2 are independent over Mn-l. We claim that S1 U S2 and M, U P U 6 are independent over Mn.l: indeed, R1 U Rz U P Nn-l; by assumption, t(6/Mn U Nn-l) does not fork over M, U C, hence over M, U P. So t(R1 U R2/Mn U P U 6 ) does not fork over M, U P, and the rest follows by domination. Let PI, M, U P u 6 P' N be a model of T maximal
al
E. Bouscaren
18
independent from S1 U Sz over M,-l. As T has NDOP, N must be N,-prime minimal over S1 U S2 U P'. By minimality, N is also &-prime over Sl U Sz U N,.l U PI. Let us now define a map f from S1 U SZU N,.1 U PI to S2 U SI U Nn-1 U P': - f IN,-1 = g, the Tn-l-automorphism defined in the first step - frsl
= g* IS1
- flS2
= (g*)-'ISz
f l P ' is the identity. We claim that f is an elementary isomorphism. This will finish the proof, as by uniqueness of the N,-prime model, f will be extended to an automorpliism of the whole model N, with all the required properties. So let us now prove the claim: first let us recall that by induction assumption (2)n-1, N n - 1 is not only the T,.I-N,-prinie model over Rl U Rz U P, but also the N,-prime model of T over RI U Rz U P. Now in order to see that f is elementary we just need to check that SI and N,.1 U S2 U PI are independent over R1 and Sz and N,-1 U S1 U PI are independent over Rz. We leave it to the reader to check that, by the relations of domination and independence between these models, t(Sl/Nn.l), t(SZ/N,-I) and t(P'/N,,.,) must be pairwise orthogonal and that the rest follows. -
We must now study in more detail the octhogonality and domination relations in T,. If N is a model of T,, S" (N) denotes the space of T,-types over N . If p E S"(N), we write "p I 5" to mean that p is orthogonal to the formula "V E S ' . NOTATION.
We look first at the behaviour of types I S. The following two proposit,ions are fairly straightforward, and in any case, the proofs are exactly similar to the eqgivalent statements in the case of pairs in [a, section 41. P R O P O S I T I O N 2.4. Let A45" N be &saturated models of T , and let p E P(M)and
D.O.P.and N-Tuples ofModels
19
-
a realize p in N. (i) p I S i f f t(a/MU Nn.l) does not folk over M. (ii) If p I S, if P i n M,then p does not Tn-fOrk over P iff t ( a / M ) does not fork over P . PROOF. Note first that p I Siff C(a), the T,-canonical basis of a over M is included in M. The rest is then easy, using the characterization of forking given by Prop.l.4.
(i) Let M < , , N be N,-saturated models of T , such that there is a E N with t n ( a / M ) I S, and a Tn-dominates N over M. Then a dominates N over M. (ai) Let M (, N be N,-saturated models of T,, and let p E S”(N), p I S. Then p I,, M iff the restriction of p to T is orthogonal to M.
PROPOSITION 2.5.
-
Let us now look at types of the small model. PROPOSITION 2.6. Let M 5 , N be N,-saturated models of T,. Let a E Nn.l be such that a Tn-dominates N over M. Then n Tn-,-dominates Nn.( over Mn-l. PROOF. Let P, M,.l u C P C Nn.l, be a model of Tn-l, maximal T,.l-dominated by over Mn.l. If P # Nn-l, there must be some c in Nn-l - P, T,.I-independent from over M,.l. By Proposition 2.1, this means that and c are Tn-independent over M, which contradicts the fact that T,-dominates N over M.
a
a
a
a
a
Let M
tn(a/M) on tn(6/M). By Proposition 2.6, it follows that 6 T,-I-dominates Nn-l over Mn-l, hence that tn-l(Wfn-1) on-1 tn-I(b/M n-1) and tn-l(Z/Mn-l) must be D,-l-rninirnal.
20
E. Bouscaren
a
a
Now, N,-1 is T,-I-dominated by over M,-l and by the above has minimal T,_l-type. It follows by our induction assumption (3),-1 that a dominates N,_l over Mn-l. Now, N,-1 and M are independent over Mn.l, hence also dominates N,.l over M. Now let P , containing M U Nn-l, be a model of T, maximal dominated by over M, in N. If P # N, there must be c in N - P, such that c and P are independent over M. But N,-l P , hence t(c/N,.1 U M ) does not fork over M. By Proposition 2.4, this means that tn(c/M) I S, and c cannot be T,,-dominated by a over M.
a
a
2.8. Let MS,, N Sn N' be N,-saturated realize a D , -minimal 1, -type over N. Then -tn(Z/N) I, M
COROLLARY
models of T,. Let
n. E N,'.l
iff -t(Z/Nd 1K - 1 iff - t ( z / N ) I M. I ~ R O O F . The fact that t(a/N,_l) I M,.I iff t(a/N) I M just follows from the independence rclations between NA.,, M , M,., and N. Now assumc that t,(a/N) is not T,+xthogonal to M. This means that thcrc is b in NA.l such that and b are not T,-independent over N and t,(b/N) does not T,-fork over M.By Proposition 2.1, this is equivalent to a and b are not T,.l-independent over N,.l and t,-l(b/Nn-l) does not T,.l-fork over M,.l. which exactly means that tn.1(~/Nn-l)is not T,.l+rthogonal to Mu.,. As by 2.7, is D,-l-minimal, the induction assumption (3),-1 applies, and this in turn is equivalent to the fact that t(a/N,.I) is not orthogonal to M,.,.
a
a
COROLLARY
2.9. Assumption (3), in the induction holds for T,.
PROOF. If t,(a/N) is on-minimal, then one can without loss of generality assume that either t,(a/N) t- "7 E S' or t,(a/N) I S. So the result follows by Propositions 2.5,2.7 and 2.8.
2.10. Let M, M', n/lz, be N,-saturated models of T,, with M C M' n M, h4' and n/lz T , -independent over M . Suppose that, for i = 1,2, there is zi an A@, such that Z i has D,-minirnal T,-type over M and Z i T,-dominates M' over M. Then the T,-N,-prime model over M' U is also &-prime over
PROPOSITION
D.O.P. and N-Tuples ofModels
21
MUM. PROOF. The model N is Tn-N,-prime over M' U M2, it follows that N is T d o m i n a t e d by M' over M2, and by M2 over M'. By Corollary 2.9, it follows that N is dominated by M' over M2, and by M2 over MI. By NDOP of T , this implies that N is N,-prime over M' U M2.
2.11. The theory T, has NDOP. If not there are Mo, M' and M2,T,-N,saturated, Mo M' n M2, M' and M2 Tn-independent over Mo, such that: PROPOSITION
PROOF.
-For i = 1,2, M i is T,-N,-prime over Mo U ai, for some D,,-niinimal ai over Mo. -If N is the T,-N,-prime model over M' U M2, there is a T,-regular type p over N, which is T,,+rthogonal to both M' and M2. Now by Proposition 2.10, N must also be &-prime over M'U M2. As p is I>,-minimal, by Corollary 2.9, the restriction of p to T would also be orthogonal to both M' and M2. But this contradicts the fact that T has NDOP.
Assumption (2), in the induction holds for T, a) Assume first that, for all i, 1 5 i 5 k, Mi is T,,-dominated by some ai with D,-minimal T,-type over M. We prove the result by induction on k. The case k = 2 is Proposition 2.10. Recall from the statement of (2), that N is the T,-N-prime model over the U i < k Mi. Choose io, 1 5 io 5 k, and consider R 5 , N, the T,-N,-prime model over {U Mi ; i # io}. By NDOP of T,, N must be minimal, hence it is also T,-N,-prime over R U MIo. Hence N is T,-dominated by MIo over R. By Corollary 2.9, it follows that N is dominated by MIo over R. This implies easily that R must be maximal in N, dominated by R over M. Now let i # io; by induction, R is in fact RE-prime over {U M i ; i # io}. Suppose that for some ( Y E N, M i dominates Mi U cr over M, then (Y and R must be independent over MI, hence R dominates R u Q over M, which contradicts the maximality of R. So Mi must be maximal in N dominated by Mi over M. Our choice of io was arbitrary, hence the above shows that, for all i, 1 5 i 5 k, Mi must be maximal in N dominated by Mi over M. It is easy to check that no Q in N can be independent from Ui
PROOF.
22
E. Bouscaren
is &-prime over U i < k M'. b)The general case. Let N ' 5 N be N,-prime over U i < k Mi. Suppose for contradiction that N ' # N and choose cr E N-N', with regular type over N'. - If t(cr/N') is not orthogonal to M: then without loss of generality, cr and N ' are independent over M. Let B finite included in U j < k M i be such that st,(cr/B) I- t,,(cr/Ui,-minimal T,-type, such that M ' is T,-N,-prime over U j c m N'. Let /l E M', st,(/l/B) = st,(o/B). Then, as cr and N ' are independent over M , we must have that /l and U j c m N j are independent over M, but this is impossible. - If t(cr/N') is orthogonal to M: let B be as above, with the additional property that t(cr/N') does not fork over M U B. Consider M', and /l E M', as above. As cr and N ' are independent over M', t(cr/M') I M; by NDOP of T , for some io, t(cr/M') is not orthogonal to N'O, hence t(a/N'O) I M, but this should then also be true for 0,which is impossible.
$3 r;-prime models. Extending models of T. In this last chapter, we would like to
make some remarks about "prime" models of the theories of n-tuples. These will turn out to be linked with the following question: given a model M of T , when is it possible to extend this model into the small model of any given theory of pairs? Here again the difference between theories with and without DOP will be clear. We assume that T is superstable NDOP. We will deal here only with pairs of models, but it should he easy for the reader to see which of the results we are going to talk about generalize iinmediatly to all 11-tuples. We are working with a complete theory of pairs of T, denoted Tz, which we know is also superstable NDOP. We have shown in the previous section that ( 2 ) holds ~ (Proposition 2.12), that is, that, once we are working over Tz-independent &-saturated models of Tz, then, there is no difference between taking Tz-N,-prime models and taking &-prime models. This is also true for the restrictions to the small models: PROPOSITION 3.1. Let M,M', be N,-saturated models of Tz, with M52 Mi, for
...,d
D.O.P.and N-Tuples ofModels
23
all a, and MI, ...,Mk Tz-independent over M. I f N is the Tz-N,-prime model over U i < k Mi, then N1 (i.e. the small model o f the pair N = (Nl,N2)) is the N,-prime model over U i < k Mf, where Mf is the small model of Mi. PROOF. Easy, if you note that i n the case of Tz, of course, there is no need to suppose that the types are 02-minimal in order to get Corollary 2.8. Now we want to see what happens when we are dealing with N,-prime models over sets and not models. Of course taking prime models for T or for T2 has to be different in general, but it might not be if we restrict ourselves to those T2-types which behave exactly like types for T for domination and orthogonality, that is, either T2-types which are orthogonal to S, or types of the small model. We had already seen i n [2] what happens in the first case: PROPOSITION3.2. (Corollary 4.2 i n 121) I f M 3 2 N are &-saturated models of T2, i j N is the T2-&-prime model over MU a, for some with tz(a/M) IS,then N is &-prime over M U a. Note that in this case the small model of N is equal to the small model of M.
a,
We get the same result for small models, in the case of non multidimensional theories: PRoPosiTioN 3.3. Suppose T is a non multidimensional theory. Let M 5 z N be N, -saturated models of Tz such that N is the Tz-N, -prime model over MU a, for some 2 in N I . Then Nl is the &prime model over MI U a. PROOF. N I is dominated by over MI. As T is non multidimensional, any model dominated by over MI must be &-prime over MI U
a
a.
But this is not true in general, as the following example shows: let L = { R ~ , R Z , ( U ~ )where ~ < ~ }Rl , and Rz are binary relations and for each i , U i is a unary predicate. Let T be the following theory in L: -Rl is an equivalence relation with infinitely many classes -R2 is an equivalence relation , refining RI into infinitely many Rfllasses, all infinite. -The predicates U i are pairwise disjoint. -For all i < w, for all class C mod Rz, U i n C is infinite. Consider a model NI of T such that:
E. Bouscaren
24
-there are countably many classes mod R1, each of cardinality 2N0, and each partitioned into 2N0 many Rz-classes. Now for each i < w and each class Ci mod R1,choose representatives for the N Rz-classes, in the predicate Uo : {a:; x E 2 "}. Let Nz be an elementary extension of N1 such that , for each (i,x) E w x gNo, there is bj E NZ-Nl, bi R2 a: and b: E U j iff j E x. Consider the theory Tz of the pair (NlrN2) i n the language La. This theory is superstable but not w-stable because if x,z are two different subsets of w,then tz(ai/@) f tz(ai/@). Now, in Tz, the following holds, for all x,z finite subsets of w:
Tz t
V a E S , a E UO, 3 b,, b,, I tX
U, , b,, RI a , .3 v 6 S ( v E U i
E
[,Ah
A [.Ah
y
~ ( v3$ S ( v
E h
S such that RZ4,
Z
A v R2 b,,) E Uj A
]
v R2 bxz)) 1.
Jtz
Now let M = (M1,Mz) be a Tzphnentary extension of the pair ( N l , N z ) , T2-N-saturated. Let also P = (P,,P2) tz M be N,-saturated. Let c E PI be such that c E UO and c is not equivalent mod Rl to any element in MI. Now assume that P is the Tz-N,-prime model over M U c. Claim: PI cannot be the &prime model over M I U c. The model P1 is certainly &-atomic over M I U c but we will see that it contains an indiscernible sequence over MI U c of cardinality 2N0. Indeed, by &-saturation, for any x E 2No, there must be in P I some b, such that bx E UO 7 b x RI c , -(bx RZ c) [ there is z $ S ( z E Uj and z R, I), ) ] Now such a b,, as it is Rl+quivalcnt to c must be the z's above must be in P2-Ma. In the language Tz-types, but for the language L, {b, ; x E 2 N O } , is M I U c. This proves the claim.
iff (j E x]. i n Pl-M1; for the same reason
La, all the b,'s have different an indiscernible sequence over
We will now see that the situation in the example above arises only because our notion of saturation was too weak. Let us recall some definitions and results concerning the notion of
D.O.P. and N-Tuples of Models
25
&solation. These can be found in [6,chapter IV]. We will only give the definitions and results in the context of superstable theories, even when this assumption is unnecessary. DEFINITION. Let T be superstable, let K be an infinite cardinal. If p E S(B), we say that p is &-isolated if there is A E B, I A I < K , such that p tA i- p. If A C_ B, we say that B is rc-atomic over A if, for all 6 C B, t(6/A) is &-isolated. We say that M 1 A, &-saturated model of T, is &-prime over A if, it can be elementarily embedded over A in any K-aturated model containing A . THEOREM. [6, Chapter IV] Let T be superstable and let K > I T I , be regular. Then for any set of parameters A , there is a K-prime model over A , unique u p to isomorphism over A . If A M, then M is &-prime over A if and only i f the three following conditions hold: (i) M is A-saturated (ai) M is K-atomic over A (iii) every indiscernible sequence over A , in M , has cardinality at most li. Now, if we choose K big enough, then the obstruction in the example will disappear. LEMMA 3.4. Let K be regular, K > I T I , and let M 3 N be tc-saturated models of T2. I f N is Tz-K-atomic over MU A , for some A included in N1, I A1 5 K, then Nl is K-atomic over M I U A . PROOF. N is T d o m i n a t e d by A over M, hence N1 must be dominated by A over MI. As A has cardinality at most IC, it follows that N I is K-atomic over MI U A. We must now deal with indiscernibles: L E M M A 3.5. Let M < z N be models of T2. I f t i
2 Z1T I ,
and if 15 N , is an
I A I 5 K , I 11 > K ,
then indiscernible set over MU A , for some A included in N I , there is J C I, I JI > K , Tz-indiscernible over MU A . PROOF. By indiscernability, we can find some B, IBI 5 K , such that t(A"I/MI) does not fork over B. Let P be a model of Tz, containing B, P 5 2 M, and I P I 5 K. Then t(A"I/MI) does not fork over PI. Now [ P i U A1 5 K , 111 > K , and we chose K 2 2IT1 by superstability of Tz, we can find J E I, IJI > 6, which is Tz-indiscernible over PI U A. As A and J are included in S, their Tz-type over P
26
E. Bouscaren
is based over P1, hence J is Trindiscernible over P U A. By Proposition 2.1 again, A ^ J and M are Tz-independent over P. As a direct consequence of Lemmas 3.4 and 3.5, and the characterization of K-prime models, we get: PROPOSITION3.6. Let K be regular, K Z1 and let hf 5 2 N be K-saturated models of Tz. I f N is TZ-K-prime over MU A , for some A included in Nl, I A1 5 tl, their N1 is &-prime over A41 u A ,
>
We can now see how this is linked with the possibility of extending Inodels of T in the small model of any complete theory of pairs of T: PROPOSITION 3.7. Let li be regular, K 2 Z1T I , and let P be a rt-saturated iuodcl of 7'. Then there is a T?-t;-saturated model of Tz, N = ( N l , N 2 ) such that NI a n d 1' are isomorphic. PROOF. Let M = (Ml,M2) be the saturated model of T2 of cardinality tl. Tlien M I itself must be saturated of cardinality K. If P has also cardinality K , then there i s nothing to prove. If not, there is a copy of MI inside P. We now work in the monster model of T 2 , C = (ClrC2);in Cl, find a copy of P over M I . We are going to construct, inside C, a strictly increasing sequence of models of Tar (N'),with thc following properties: -M 5 No -for each i, N ' is T2-rc-saturated -for each i there is an embedding of N f into P, f i , such that if i<j, then f, extends fi. 'The construction: Choose a0 in P-MI; take No model Tz-K-prime over M U a+ My Proposition 3.7, NY is K-prime over M I U ao, hence there is a n embedding fo of NY into P, over M I . Case i+l: We have an embedding fi of N f into P, if P # fi(Nj), choose a in l'-fi(Ni). Let a' be the conjugate of a over Ni, take N'" to be the Ta-tl-prime model over N ' U a ' , by Proposition 3.7, Nf" is n-prime over N f U a', hence there is an embedding fi+l of Nf" into P, which extend fi and takes a' to a. Limit case: Consider U N i , for i<j, and f , the limit of the fi's. By superstability of T2, U N ' will be itself Tz-rc-saturated, so we just take it as NJ, and take f as fj. Now this construction goes on until, for some i, fi(N:) and P are equal, and
D.O.P. and N-Tuples of Models
21
this proves the result. Note that, in any case, independently of NDOP, some condition of saturation on the model of T will be needed: take for example the theory of one equivalence relation with exactly one class of cardinality n for each n, 1 5 n < q consider the prime model M. This model cannot be the small model for any theory of pairs which says that at least one class has been extended in the bigger model. Now Proposition 3.7 does not hold for DOP theories, as the following very simple example shows: let L = {U,V,Z,R}, where U,V,Z are unary predicates and R is a ternary relation. Consider T, the canonical example of a theory with DOP in the language L: -U, V and Z are infinite and pairwise disjoint, the union of U,V,Z covers the whole model. -R(x,y,z) implies that x E U, y E V and z E Z. -For each z E Z there is a unique couple (x,y) such that R(x,y,z). -For each conple (x,y) there are infinitely many z's such that R(x,y,z). By using pairs, one can code definably in Lz any relation on UxV, for example , let M be any model of T such that U and V have the same cardinality in M, let N be an elementary extension of M such that for each x in U(M), there is a unique y in V(M) such that, for some z in N-M, R(x,y,z), and conversely, for each y in V(M), there is a unique x in U ( M ) such that, for SOIW z in N-M, R(x,y,z). Let Tz be the theory of the pair (M,N) in La. Then, we have in fact coded a bijection between U and V in the small model, and no model where U and V have different cardinalities can be the small model of such a pair.
REFERENCES
of Stability Theory, Springer-Verlag, Berlin, 1988. [a] E. B O W C A R E N , Dimensional Order Property and pairs ofmodels, Annals of pure and applied Logic, to appear. [3] E.BOUSCAREN and B.POIZAT, Des belles paires auz beaux uples, J o u d of Symbolic Logic, vol. 53 (1988), pp 434-442. [I]
J. BALDWIN, pundarnentak
28
E. Bouscaren
[4] D.LASCAR, Stability in Model Theory, Pitman, Longman Sientific and Technical, 1987.
[5) B.POIZAT, Paires de structures stables, Journal of Symbolic Logic, vol.48 (1983), pp 239-249. [6] S.SHELAH, Classification Theory and the number of non isomorphic models, North Holland, Amsterdam, 1978. [7] S.SHELAH, The spectrum problem I: N,-saturnfed models, the main gap, Israel Journal ofMathematics, ~01.43(1982), pp 324-356.
UniversitC Paris 7 UFR de Mathematiques CNRS - URA 753 2 Place Jussieu 75251 PARIS Cedex 05 FRANCE
Logic Colloquium '88 Ferro, Bonotto,Valentini and Zanardo (Editors) 0 Elsevier Science Publishers B.V. (North-Holland),1989
29
ALGEBRA AND MODEL THEORY OF CHAIN FIELDS AN OVERVIEW
M. A. D I C K M A N N C N R S - Universite Paris VII
SUMMARY. This paper is a survey of recent progress in the model theory of 0 chain fields, with special emphasis on c h a i n ~ l o s e dfields.
The notion of a chain field was introduced by Harman [16] at the beginning of the eighties continuing earlier work of Becker "4 on the theory of fields endowed with an ordering of higher level. In the first two sections of this paper we present the mathematical motivation of these notions and a brief account of the algebraic theory developed by these authors. The main tools from valuation theory -essential for both the algebraic and the model-theoretical development of the subject- are presented in $3. The next section contains an account of the results achieved in the model theory of chainxlosed fields: first-rder axiomatizations, completeness, modelkompleteness and quantifier elimination; the material comes mainly from the author's paper 1121. In $5 we review the state of knowledge concerning the behaviour of polynomials over (certain) chain-Iosed fields: a nullstellensatz, and some results motivated by Hilbert's 17th problem. Finally, we examine the relationship between recent results on the model theory of chain fields and previous work on real fields. In order to understand the motivations behind the notion of a chain field we will first make a brief tour into the theory of higher-level ordered fields.
30
M.A. Dickmann
$1. HIGHER-LEVEL ORDERINGS.
The ancestors of the notion of a higher-level ordering are to be found in the interphase between number theory -indeed as far back as Hilbert's 1909 work [17]giving the solution to Waring's problem- and the theory of ordered fields *.g. in the search for a generalization of the notion of order suitable for the study of sums of 2"-th powers i n a field. More precisely, the investigation of hereditarily Pythagorean fields and the Galois group of certain classes of algebraic number fields led E. Becker to the notion of an ordering of higher level. DEFINITION 1.1 (Higher-level ordering). Let I< be a field and 11 > 1 an integer. A subset P I< is called an ordering o j ( e m c l ) level 2" iff it satisfies the following requirements: (i) 0 E P. (ii) P + P P. (iii) P' (= P - ( 0 ) ) is a subgroup of the multiplicative group I<' (= I< - ( 0 ) ) . (iv) K'/p. is a cyclic group of order 2". 0 Note that an ordering of (exact) level 2 is just an order in the usual sense. Warning. We will use the terms "order" and "ordered field" with their usual meaning, while "ordering", "higher-level ordering", "higher-level ordered field", etc. will be used to denote orderings of some level 2", n 21 (resp., a field endowed with such an ordering). If necessary, we may add the adjective "proper" to denote higher-level orderings which are not usual orders, i.e. of level 2 4 . We use the 0 term real field to denote a field carrying at least one (usual) order. Here are some examples of higher-level orderings which are not orders: 1.2. EXAMPLES. (a) Let Q((X)) denote the field of formal power series in one
variable with rational coefficients. The set m
Pn = { C aiX' i=m
I m E I and, either (m 2 0 (mod 2") (rn E 2 n-1 (mod 2") and am < 0)},
is an ordering of exact level 2", for
n
> 1.
and am > 0) or
Algebra and Model Theory o f Chain Fields: An Overview
31
(b) A similar condition defines an ordering of exact level 2" on the rational function field Q(X);namely, if am denotes the nonzero coefficient of lowest degree of F E Q[X], then F E Pn iff (m
0 (mod 2") and am > 0) or (m
5
2"-l
(mod 2") and am < 0),
and, for F,G E Q[X], G # 0:
F/G E Pll iff FG
2n-l
E Pn.
The field Q(X) possesses other 2"-th level orderings as well; for example, the ordering obtained by the same definition, where am is taken to be the leading coejjcient of F E Q[X] (i.e.,
in
= deg(F)).
0
The initial steps into the thcory of higher-level ordered fields can be consulted in Becker's nionograpliy [a; Ch. I, $11. For our present purposes, the point to be remembered is that the relationship between orderings of level 2" (n > 2) and sums of 2"-th powers in a field is to a large extent the same as that (3 which usual orders bear to sums of squares. Another remark helping to clear up the picture is that the examples mentioned in 1.2 are, in a sense, the "simplest" fields carrying orderings properly of higher level. Indeed, a necessary and sufficient condition for a field to carry at least one such order is that, for some n > 2, there is a sum of 2"--th powers which is not a sum of squares (Becker[2; Thm. 16, p. 351). It follows that fields having exactly one order, and algebraic extensions of them, do not carry orderings properly of higher level; for example, no algebraic extension of Q and no real closed field carries such an ordering. In [2] Becker worked out the extension theory of higher-level ordered fields; the reader may also consult the survey 13). The correct notion is that of a faithful extension:
DEFINITION 1.3. Let K L be fields and P, Q orderings of higher level on K , L, respectively. is called a faithful extension of < K , P > iff Q n K = P, and P, Q have the same level. 0 Note. The relation Q n K = P only guarantees that the canonical map K'/p. -> L'/ is well-defined and injective; hence the level of P is less than or
Q'
M.A. Dickmann
32
equal to that of Q.
Now the main results of Becker's extension theory are easily stated: THEOREM 1.4. (1) A n y higher-level ordered field has a maximal faithfil algebraic extension. (Any such extension is called a higher-level real closure or, simply, a real closure, of , if no confusion is possible.) (2) A higher-level ordei$ng of Ii can be faith&lly extended to an algebraic extension L of K if: (a) L is of odd degree over I<; (ii) L is contained in the Pythagorean closure of li (this is the maximal algebraic extension F which is Pythagorean, i.e. real and satisfying F2 + F2 = F2). lfcnce, u higher-level real closed field is Pythagorean and every polynomial of odd degree over it has a root ( [ 2 ; Thm. 19, P. 501). (3) Let L be a finite field extension of li, and P a higher-level ordeiing of I<. The number of faithful extensions of P to L is not bigger than the degree [ L: Ii] ([2; Thm. 20, p. 511). ( 4 ) Higher-level real closures are not unique, in yenerul. Indeed, two real closures
o f (i=
1, 2) are K-isomorphic if and only if for every n
2 1, an
element of K h a s u Zn-th root in Ll i f f i t has one in L 2 ( [ 2 ; Thm. 12, p. 1621).
n
Warning. Higher-level real closures (and higher-level real closed fields) have been previously called generalized real closures (resp. generalized real closed fields). We also mention the following result which we will need later:
PROPOSITION 1.5 (Becker
[a; Cor.
2 , p. 431). Let K be u Pythagorean field p+l
currying exactly two orders Pg' P1, und such thut Then: (a) I f a is any element of Po n - P I ,
=
K
for some n
we have Po = I?
U aK2
>. 1. and
-K2) and any n 2 2, Pn = k,zn U -a 2n-II{2n ,n 2n-l n-1 =Ii U a is the unique ordering of level Zn, and I? (b) For any element a E Ii
-
(I?
U
Algebra and Model Theory of Chain Fields: A n Overview
33
In particular, these identities hold in higher-level real closed fields (and hence also in chain-closed fields; see Proposition 2.7 below). U No account of higher-level orderings, however sketchy, could omit mentioning the following brilliant application to number theory. THEOREM 1.6 (Becker [2; Thm. 25; pp. 6 2 4 3 1 ) . Let K 6e an injnite field and n, m be integers. Given arbitrary xl, ...,xr E li, there exist yl, ...,ys E li such that
r 2n 2m s 2n+m (EXi ) = c yj . i=l j= 1 In particular, for li = Q ( X l , ...,X I $ this proves the existence oJi.ationa1functions F I ,...,Fs E Q(Xl ,...,X J such that
'f
The key step in Hilbert's celebrated solution to Waring's problem, [ 171, consist,ed in proving a special, though slightly different, form of these "generic" identities, namely for n = 1, r = 5 , but arbitrary integral exponent on the left-hand side, instead of 2m; Ililbert's proof was based in geometrical considerations. For further information, consult Ellison's survey [13].
52. CHAIN FIELDS.
The non-uniqueness phenomenon accounted for in Theorem 1.4(4) leads to the question of classifying the K-isomorphism types of the real closures of a higher-level ordered field < K , P > . A solution to this question is contained i n Becker [2; Thm. 13, p. 1631, under a slightly more restricted form than that which we will consider here. Indeed, Becker's conditions for &isomorphism of two real closures of < K , P> led Harman to the notion of a chain of higher-level orderings: DEFINITION 2.1 (Chain). A chain on a field I< is a sequence
I i E w>
of
M.A. Dickmunn
34
(i) Po, P I are different (usual) orders of I<; (ii) For n 2 2, Pn is an ordering of exact level 2"; subject to the following requirement: (iii) P n u -Pn = (Po n Pn-l)
u -(Po n P1l-l),
for n
> 2.
A structure < K , P i > i E u , wliere the Pj's form a chain of I<, will be called a chain held.
0
2.2. EXAMPLES. We return to the examples given in 1.2.
(a) The orderings P n on Q((X)), sul)pletnented with the only two orders of this field, constitute a chain. Recall that thesc orders place X iiifinitesimally near 0, to W
its "right" and to its "left", respcctively; for s = C aiX' # 0, where m E i=m am # 0, they are defined by:
Z and
s E P (= P ) iff aln > 0, and O o+ s E P1 (= P ) iff (m even and am > 0) or (in odd and am < 0) 0-
(b) The foregoing definitions applicd without modification to the first sequence of higher-level orderings on the field Q(X) given i n 1.2, yield a chain. The second sequence also yields a chain by considering the orders Po = P+,, P I = P-, which make X infinite (i.e., Iargcr than every element of Q in absolute value), positive or negative, respectively. 0 Another remarkable consequence of Becker's work is that, any field possessing an ordering of level >_ 4 also has a chain; see ['L; Thm. 15, p. 37 and Thm. 24, p. 581, and [16; Cor. 1.41. It soon became clear that chain fields themselves are a natural object of study in this setting. In [16] Harman extensively investigated the algebra of chain fields. His main tools were valuation-theoretic, as it was the case in Becker's study of a single ordering of higher level. He worked out a satisfactory extension theory, [16; $31, proving among other things:
35
Algebra and Model Theory of Chain Fields: An Overview
PROPOSITION 2.3 ([16; Thm. 4.61). Every chain field has an algebraic eztension maximal for the property that the chain extends faithjidly, i.e. preserving the level of each ordering. 0 Calling chain-closed a chain field whose chain does not extend faithfully to any proper algebraic field extension, and chain closure of a chain field any chainclosed algebraic extension of it, Proposition 2.3 just says that every chain field has a chain closure. Furthermore, chain closures are unique, as one may expect from the fact that they were constructed to classify isomorphism types of higher-level real closures. THEOREM 2.4 ([16; Cor. 4.71). Two chain closures of a chain field iEw are exchanged b y an isomorphism which pointwise fixes the,field K.
0
Harman also gave an Artin-Schreier type characterization of chain-closed
fields: THEOREM 2.5 ([16; Thm. 4.31). A chain field iEw is chain-closed if and only ij (a) p 0 n p I = ~ i ~ . (b) Any polynomial P E K [ X ] of odd degree has a root in K.
0
Condition (b) is obtained by showing that any chain on a field I< extends faithfully to any field of odd degree over I< ((16; Cor. 3.101). T o get condition (a) one shows that a chain
I
i E w> on I< has a faithful extension to I<(,6),
where a E I< - K2, if and only if a E Po n P1 ([16; Prop. 3.111).
A chain-closed field essentially has one chain: PROPOSITION 2.6 ([16; Prop. 4.41). If iEw is chain-closed, the only chains on I( are and (observe that the conditions defining a chain are symmetric under exchange of Po and PI). El
36
M.A. Dickmann
For the sake of completeness we add a precise statement of the connection between chain-closed fields and higher-level real closures:
PROPOSITION 2.7 ([16; p. 167 and Cor. 1.41). Fix an integer n 2 2. The n-th ordeiing of the chain of a chain-closed field makes it into a higher-level real closed field. Conversely, given a real closed field of (exact) level 2", IC is chain-closed for some chain whose n-th term is P. Furthermore, given a field with an ordering of (exact) level Zn, , there is a bijection between the A-isomorphism types of higher-level real closures of and the 0 chaiii-closures of the various chain fields iEw , where PI1 = P.
$3. VALUATIONS IN CHAIN FIELDS. I n this section we present a sunitnary of the valuation-theoretic concepts
and techniques involved in the proofs of the foregoing results. Extending a well-known construction originating with Baer and Krull, Becker [a; Ch. I, 521 assigns to each ordering of higher level P on a field I< a valuation ring B(K, P):
TIlEOItEM 3.1 ( [ 2 ; Thin. 8 and pp. 15-18]). Let be a highel--level ordered field. (a) The set B(K, P) = { a E l C I For some rational number r > 0, r * a E P } is a valuation ring of ti (when P is an order, the condition r f a E P takes the usual form la1 < r, and B(K, P) is the old Raer-Krull valuation ring). (0) The maximal ideal oJB(K, P ) is: M(K, P ) = { a E IC I For every rational r > 0, r a E P } . (c) The residual image o f P, p = { a / M I a t P} (where M = M(IC, P)), is an archimedean (usual) order on the residue field B(K, P ) = B(K, P)/Mcli,pi. (d) P is compatible with B(IC, P), that is, 1 + M ( K , P ) P. (e) B(K, P) is the unique valuation ring A of I\' compatible with P (in the sense of (d)) such that the image pis an archimedean order on the residue field 2. (fl [2; Thm. 18, p. 48 and Thm. 24, pp. 58-59] If is a higher-level real
Algebra and Model Theory of Chain Fields: A n Overview
31
closed field, then B(K, P) is Henselian and the residue field B(K, P) is real closed under the (usual) order P. 0 Remarkably, it turns out that this setting transfers without modifications to the context of chain fields: PROPOSITION 3.2 ([lG; p. 144, Thni. 1 3 , and Prop. 4.41). Let iEw be a chain field. Then:
(a) The valuation rings B(K, Pi) coincide Jor all i E w. (6) The (archimedean) residual orders
coincide Jor all i E w.
(c) I f < K , Pi>iEw is chain-closed, then B(li, Pi) is Heitselinn and B(K, Pi) is real closed under the order p r b r i E w.
0
Notation. We shall denote by B(K) any of the valuations R(K, Pi), for a chain field < K , Pi>.
0
c
The valuations B(I<, P) play a. fundaniental role in both Becker's and Harman's work. Although these valuations are a blessing from the algebraist's point of view, they are of little help for model-theoretic considerations. The difficulty lies i n that the rings B(K, P) are not first-order definable in any useful language, as the residue jeld is archimedean. However, Jacob's [18] work on the model theory of higher-level real closed fields relied heavily on his discovery of a valuation of which has many of the good properties of the valuation introduced above and, i n addition, is first-order definable in terms of P. I n ma.ny situations this valuation turns out to be identical with a valuation earlier considered by Ax [l]. DEFINITION 3.3 (The Jacob valuation). Let P be a higher-level ordering on a field K. Let J'(I<, P) = {x E Ii 1 x $ *P' and 1 + x E P}, J"(K, P) = {x E K I x E *P and x.J'(K, P) C J'(Ii, P)}. Now, the Jacob ring is J(K, P) = J'(K, P) U J"(K, P). 0
38
M.A. Dickmann
In (18; Thm. 11 Jacob proves:
THEOREM 3.4. (a) J(Ii, P) is a valuation ring o f K , and the residual image of P, is a total order on the residue field J(Ii, P). (b) If is a higher-level real closed field, then J(Ii, P) is Henselian and the 0 residue field J[K, P ) is real closed for the order As a matter of fact, only a fraction of the assumption that P is a n ordering of
higher level is used in (a); see Jacob 1191. In analogy to the case of Bcckcr's archirnedean valuation B(K, P), the Jacob valuations J(I<, P i ) obta.ined at different levels of a chain coincide when the field < K , P i > i E uis chain4osed. PROPOSITION 3.5 (Dickma.nn 112; Prop. 1.101). Let
(a) The valuation rings J(Ii, Pi) coincide for all i E w. In particular, from 3.4(b), (b) The residual orders
5coincide /or all i
E
w.
Notation. If the field i E wis chainxlosed, J(K) will denote any of the
valuations J(I<, Pi).
Completing this account on valuation techniques we will deal with the question how the Becker and t,he Jacob valuations compare with one another. It turns out that these valuations are cxtrcnial within a natural class of valuations on a field. 3.6. Notation. (a) We shall denote by q I < ) the set of Nenselian valuations on a field K , with real closed residue field ( i n the usual sense). We know (3.l(f) and 3.4(b)) that YIC) is non-empty for higher-level real closed field and (hence) for chainxlosed fields. The set YIC) comes equipped with the partial order of inclusion of the corresponding valuation rings. (N.B.: the reverse inclusion order is most commonly used, but this is immaterial for our present purposes.)
39
Algebra and Model Theory o f Chain Fields: An Overview
rv and
(b) As usual, if v is a valuation , we denote by Av, Mv,
-
Av, the ring,
maximal ideal, value group and residue field, corresponding to v. (c) The valuations whose rings are B(K) and J(I<) will be denote by b and j, respectively . 0 The following proposition sumiiiarizes the general properties of valuations in
YK).
PROPOSITION 3.7. Let K be any field such that Y(K) # (a) I\' is real.
8,and v E
(b) Any residually positive unit o f A v is in ti'", for all n
> 1.
7"(I<). Then:
i n particular, (c) 1
+ Mv E n I\ ,zn . n>l
(d) The ring Av is convex /or any subscl P
I; such that n Ii2" 712
I
< P, P . P (I P,
and P n -P = { 0 ) ; that is: aEPAb-aEPA6EAvimplyaEAv.
.In particular, (e) The ring A v is convex for any order (indeed, any partial order) oJ Ii..
($ Y(K) is totally ordered by inclusion. (9) The value group rVas divisible by every odd prime. (h) rv is dense.
0
The proof of Proposition 3.7 is routine; for ( b ) and (g) one uses Nensel's lemma to lift a simple residual root of a suitable polynomial of form Xm - a; (a) only depends on the fact that the residue field is real. Specializing to chain-closed fields we get the following additional properties: THEOREM 3.8. Let iEu be a chain-closed chain field. Then:
40
M.A. Dickmann
(a) B(U) is the smallest and J(K) the largest, valuation rings in Y(K). (b) The value group r . corresponding to J(K) contains no non-trivial 2-divisible 3 conuez subgroup. (c) r . is reoularly dense, that is, mr . is dense in r . for every m > 2 (cf: 3 3 3 Robinson-Zakon [23; Dej 3.31). (d) For v E Y(K), IrJ I = 2. 0 2rU This result is proved in Dickmann [la; Prop. 1.10 and Prop. 1.7(e)],except for the assertion about B(I<); the latter is an easy consequcnce of the fact that a valuation ring convex for an order P of I< (e.g., P = Po) is the convex hull for 1' of some subfield of I<; for B(I<) this subfield is Q. To be honest, Theorem 3.8 and Proposition 3.5 are proved together; using rcsiilts from [9] it is shown that each of the valuation rings J ( K , Pi), i E w, is maximal i n qK); cf. Proposition 3.7(f).
54. MODEL THEORY OF CHAINXLOSED FIELDS.
In [18] Jacob examined the model-theoretic properties of higher-level real closed fields. Using Becker's algebraic work and the definable valuation J(K, P), he proved decidability, completeness and modelxomplctcncss (in a suitable language) of the first3rder theory of real closed fields of a fixed (higher) level. Jacob's results are in a sense optimal, insofar as the non-uniqueness of higher-level real closures prevents quantifier~liminationsresults from holding in languages natural from an algebraic point of view. Harman's discovery of chain fields -removing the obstacle of non-uniqueness of closuresopened up the path for the next wave of model-theoretic results, a wave still very much in progress. Drawing the consequences of his algebraic work, I extended in [12] the properties of the Jacob valuation to chain-losed fields and established the basic model-theoretic properties of this class of fields. Use of the Ax-Kochen-Ershov transfer principle for valued fields was of crucial importance in order to achieve these results. Following a logical progression (but not the chronological order) we will discuss first the axiomatisation of chainxlosed and related classes of fields in
Algebra and Model Theory of Chain Fields: An Overview
41
various languages. This area was examined Gondard in (141, (151. 4.1. Notation. LF = {+,-,-,-',O,l}
will denote the usual language for fields (with
multiplicative inverse), and LCF = LF
U
{Po, P1, P2,...} its expansion by
countably many unary predicates (to be interpreted by the members of a chain); LCF is the language for chain gelds. We shall also consider the language LcF(A) obtained by adding to LCF another unary predicate, A, which will be interpreted by the Jacob valuation. We will say that a field (construed as a structure in the language LF) is chain-closed if there is a chain with respect to which it is chain-closed; when the chain is mentioned esplicibly we will call it a chain-closed chain geld. 0 As already pointed out (Proposition 2.5) Harman obtained an axiomatization of chain-closed chain fields in the language LCF: it suffices to write
down the definition of a chain plus the axioms 2.5(a),(b). We will call CCCF the first-order theory thus obtained. It is clear from Harman's work (cf. specially [16; $51, 41) that the orderings Pn (n > 2) are (implicitly) definable from Po, PI. Using Proposition 1.5 one may dispense with Po and P 1 as well, and get an axiomatisation for chain-closed fields in the language LF. However, a neater axiomatization was obtained by Gondard in [14], [15]:
PROPOSITION 4.2. Cliain-closed fields are exactly the modek of the following set of axioms in LF (which we call CCF): -
Axioms for commutative gelds.
- Pythagorean axioms: "a sum of two squares is a square" and "a sum of two
fourth-powers as a fourth-power". - 3y[Vw(y# w2 h y # -w 2) h Vdz(z = z2 v x = -z 2 v z = yz2
vx
= -yz2)].
- "Evey polynomial of odd degree has a root".
A n alternative axiomatization for CCF is obtained by adding the axioms for real
42
M.A. Dickmann
fields and omitting the first Pythagorean axiom.
0
2
2
Remark. The third axiom says that, for any a E K - ( K U-K ), the sets 2 2 2 2 Po = K U aK and P1 = K U -aK are positive cones for total orders on K; these sets do not depend on the choice of a , cf. Proposition 1.5. For several alternatives to the Pythagorean axioms, see [15] and [16; Cor. 2.41. The class of chainable fields (i.e., fields admitting a t least one chain), an obvious analog in our context to the class of real fields, was proved by Gondard to be axiomatizable i n the expansion LF(c) of tlie language for fields by a new individual constant c. PROPOSITION 4.3 (Gondard [15; Thm. 1-11, [14; Tlrm. 11). Chainable fields are exactly the models of the following set of axioms in LF(c): - Axioms for commutative real Jields. . not a sum of fourth-powers'' - "c2 as
0
It is an open problem whether the class of chainable fields is axiomatizable in LF.
A third class of chain fields having an obvious analog in tlie context of ordered fields is the class of fields carrying a unique chain. An axiomatisation for this class in the language LF is only known for the case of fields which, in addition, are Pythagorean and have exactly two orders; Gondard [15; Tlim. 111-21. Let us now turn to the model-theoretic mentioned a t the beginning of this section.
results for chain-closed fields
THEOREM 4.4 (Dickmann (12; Thm. 1.111). The theory CCF is complete and decidable. Hence so is CCCF. Proof. The Jacob valuation of a chain-closed field is Henselian with real closed residue field. The first-rder theory of its value group is the theory of regularly dense, odd-divisible ordered abelian groups r such that I l?/2r I = 2; cf. Theorem
Algebra and Model Theory of Chain Fields: A n Overview
43
3.8. This theory was proved complete by Robinson-Zakon [23; Thm. 4.71. The result follows, then, by the Ax-Kochen-Ershov transfer principle. Completeness of CCCF follows immediately, since this is an expansion of CCF by definable predicates. Decidability is a consequence of completeness and the fact that both 0 theories are recursively axiomatizable. In order to discuss model-completeness we need to enrich the language LCF; we will use the language LCF(A) introduced in 4.1. Let us call CCVF (for chain-closed valued field) the theory CCCF augmented by the following axiom, which interprets the predicate A as the Jacob ring:
A(x) <->
(X
j! *P2 A 1
+ x E P2) V [X E *P2 A Vy(y j! *P2 A 1 + y E P2 -> 1
+ xy E P2)].
The choice of P2 is immaterial; P2 can equivalently be replaced by any Pn with n > 2, by Po n P1, or by I< 2 ; see Proposition 3.5. THEOREM 4.5 (Dickmann [12; Thm. 2.31). The theory CCVF is model-complete in LcF(A). 0.
The proof proceeds along a line similar to that of Theorem 4.4, using variants of the Robinson-Zakon and Ax-Kochen-Ershov results adapted to modelcompleteness. One needs showing that the (lifting of) divisibility predicates Dm(a) ++ 3p(ry = mp), m > 2, i n the language for the value groups, are quantifier-free definable in LCF. In an unpublished paper [lo; $21 Delon deals with several questions related to model-completeness of chain-closed fields. Among other things, she gives a useful characterization of elementary inclusion: PROPOSITION 4.6 (Delon [lo; Prop. 2.11). Let Zi7c L be chain-closed jelds. The following are equivalent: (a) I( is existentially closed in L (for the language LF).
44
M.A. Dickmann
(b) K 5 L (in LF). (c) K is relatively algebraically closed in L and J(L) n li = J(1i).
0
This characterization has two important consequences: PROPOSITION 4.7 (Delon [lo; Prop. 2.41). (a) CCF has no ezistentially closed model. (b) The chain-closed fields
other words, such that B(li) = J(1i)- are exactly the ezistentially closed models of CCCF. Since this class is not elementary, CCCF has no model-companion. We turn now to the question of quantifier elimina.tion for the theories considered above. The first result of this kind was proved by the author: THEOREM 4.8 (Dickmann [12; Thin. 3.11). Let CCVF" denote the extension of the theory CCVF b y the axiom Po(c) h ~ P , ( c ) ,in the ezpnnsion ojthe language
LcF(A) b y a new individual constant c . The theory CCVF' recursiue) quantijier elimination in LCF(A, c).
admits (primitive
0
This theorem was proved using the technique of quantifier elimination transfer, introduced by Cherlin-Dickmann [8; I'hm. 51. This result tells us that, a theory of Henselian valued fields satisfying certain conditions -too technical to be stated here in detail- admits quantifier elimination in a suitable expansion of the language for valued fields, provided the corresponding theories of residue fields and of value groups admit quantifier elirnina.tion in suitable expansions of the languages for fields and for ordered abelian groups, respectively. In our case one gets a certain theory C of valued fields eliminating quantifiers, in which CCVF' can be interpreted (and back), in such a way that one gets Theorem 4.8. The constant c serves to define the predicates Pn, using Proposition 1.5. The existence of a primitive recursive elimination procedure follows from work of Weispfenning ~ 5 1~, 6 1 . One may ask whether the additional constant c is really necessary to get
Algebra and Model Theory of Chain Fields: An Overview
45
quantifier elimination. In an unpublished paper [lo; Thm. 1.41 F. Delon has recently shown, using a different technique, that one can do away with it; thus, the following holds: THEOREM 4.8 (revisited). The theory CCVF admits quantifier elimination in L&). a
$5. BEHAVIOUR OF POLYNOMIALS OVER CERTAIN CIIAIN-CLOSED FIELDS. Since Robinson gave, in 1955, a proof of Ililbert's nullstellensatz using modekompleteness of the first-order theory of algebraically closed fields, the close relationship between this type of result and elementary inclusion has been firmly established (see Cherlin's "abstract nullstellensatz" following Theorem 5.2 below). This connection has been widely used in order to prove nullstellensatze for classes of fields and rings relevant to various branches of algebra and algebraic geometry. Let us recall that a nullstellensatz for a field I<, possibly with additional structure, is a characterization of the. vanishing ideal 9 (V(1)) (see definition below) of the variety V(1) I<" defined by ail ideal of polynomials I E KIX1, ...,X,], usually in terms of some polynomial identity holding in the ring KIXp..,Xnl/I.
5.1. Notation. Let K be a field. For dc I<[X1,...,Xn] and S c I<", we set For every P E d ,P(X) = 01, J ( S )= { P E KIX1 ,...,XI1] I For every X E S, P(x) = 0 ) . ~ ( d = {) F E K"
I
Without loss of generality d can be taken to be an ideal of I<[X1,...,X,], and S a variety (algebraic set) of Kn. It is natural to expect that some kind of nullstellensatz for chain-closed fields would follow from the characterization of elementary inclusion given in Proposition 4.6. Indeed, this is the case; the result, obtained by Becker and
M.A. Dickmann
46
Gondard (41 (unpublished), is as follows: THEOREM 5.2 (Nullstellensatz). Let iEu be an existentially closed model of CCCF (i.e., I Y(I<)I = l ) , and I an ideal ofI<[X1, ...,X,]; fix cr E ti' - (+I<2) = =
*(Pan -P1).
Then:
>
P E J ( V ( I ) ) i f f for soiiie natural number k 1 and polynomials G, I€ E C K [ X 1 ,...,Xnf we have Pdk + G - cr2H E 1. o In analogy to many of the previous nullstellensatze, the point of departure for a proof of this result is Cherlin's characterization of the vanishing ideal J(V(1)) as tlie so called "T-radical" of I, namely tlie intersection of all prime ideals P E KIX1, ...,X,] containing I and such t1ia.t the ring KIX1,...,Xn]/p embeds in a model of T extending I( (in the sense of the language of T); this holds under the assumption that K is an existentially closed model of an inductive theory T of commutative rings; cf; Cherlin [7; Thm. 73, pp. 103-1041. (For Theorem 5.2, T = CCCF.) Each particular application requires a certain amount of additional algebraic work in order to arrive a t a characteriza.tion of the T-radical in terms of the basic notions pertaining to the theory T. The form of the nullstellensatz for chain-closed fields given in Theorem 5.2 fails if I V K ) I 2 and n 2. A counterexample is obtained by suitably modifying
>
>
the counterexample mentioned after Theorem 5.4 below. Now we turn our attention to certLin results on polynoiriials over chain-closed fields suggested by Hilhert's 17th problem. Hilbert's classical problem was that of characterizing the class of rational functions f E W(X1, ...,Xn) which are non-negative definite on W, i.e. which take non-negative values whenever the denominator does not vanish. Artin-Schreier's celebrated theorem proved: -
f is non-negative definite on I< iff f E C K(X)
2
,
41
Algebra and Model Theory of Chain Fields: A n Overview -
for rational functions f E K ( X ) = K(X1, ...,Xn) with coefficients in a real closed field K. A similar problem for higher-level real closed fields was solved by Becker and Jacob in [ 5 ] ; they characterized the class of rational functions f E K(X1,,..,Xn) whose values lie in P for lion-vanishing denominators. The equivalence (*) can also be read as a characterization of rational functions in C I<(x)2 i n terms of the value they take on in I<. h a d this way round the questioii makes sense for any field K and for arbitrary exponents, instead of squares. This interpretation is underscored by the following restatement of the Artin-Schreier theorem: -
f
E C
I<(X)2 iff for every
x E I<",
f(2) defined implies f(x) E K2.
In an unpublished paper, Delon and Gondartl give a characterization of the class C K(X)2n in this spirit, for certain chain4osed fields I< and i n one variable.
for polynomials
THEOREM 5.4 (Delon-Gondard [ll]). Let K be u chain-closed held such that I V(I<)I = 1, and n > 1 an integer. The jollowing are equivalent for any rational &nction an one variable f E IC(X): (a) cK(x)~~. (b) For every real (finite) algcbruic extension L of Ii, we have For eve y x E L, j(x) dcJined implies j E C I, zn.
0
The proof of this result involves a detailed study of the finite algebraic extensions of K and of the root,s of one-variable polynomials over K, an analysis which makes heavy use of the valuation-theoretic notions presented in $3. Theorem 5.4 fails if the assumption I q K ) I = 1 is dropped. In [lo] F. Delon considers the polynomial f(X) = ( X2 l ) . ( X 2 c2), where c E K is chosen so that V(C) = 0 and b(c) > 0; here b denotes Becker's archimedean valuation with ring B(K), and v any valuation with a larger ring (e.g., Jacob's). She shows that f verifies condition 5.4(b) for n = 2 but is not a sum of fourth-powers in K(X).
+
+
M.A. Dickmann
48
$6. CHAIN-CLOSED FIELDS AND ROLLE FIELDS.
It is customary to define the property of Rolle for an ordered field as follows: DEFINITION 6.1. An ordered field < K , <> is said to have the property of Rolle if for every polynomial P E K[X] and every a, b E I(, a < b, such that P(a) = P(b) = 0, there exists c E I<, a < c < b, so that P'(c) = 0, where P ' 0 denotes the (formal) derivative of P. Brown, Craven and Pelling [6] gave the following characterization of these fields: THEOREM 6.2. A n ordered field has the property of Rolle iff the underlying field Ii carries a Hensclian valuation with odd-divisible value group and real closed residue field (odd-divisibility follows automatically from the other assumptions; see Proposition 3.7). c! This criterion is independent of the order 5 , tha.t is, every order on a field has the property of Rolle provided one of them has it. This leads to the following notion (see [9; p. 3151): DEFINITION 6.3 (Rolle field). A field is a Rolle field iff it is real and one (or all)
of its orders has the property of Rolle.
0
Now we prove: PROPOSITION 6.4 (Dickmann [la; Prop. 4.21). A field is a model ofCCF i f f i t is a Rolle field having exactly two orders. 0 Proof. The criterion of Theorem 6.2 and Proposition 3.4(b) prove that chainclosed fields are Rolle. Conversely, let K be a Rolle field with two orders. By 6.2 and IIarman [16; Cor. 1.51, K carries a cha.in < P i I i E w>. We only need to check axioms (a) and (b) of Proposition 2.5. Axiom 2.5(b) readily follows from Hensel's lemma and the fact that the residue field is real closed.
Algebra and Model Theory of C h i n Fields: A n Overview
49
rv of
any valuation
Axiom 2.5(a). Since K has two orders, the value group
v E FfK) cannot be 2-divisible; otherwise K would be real closed. Considering any x E K such that 2 V(X) yields K2 # K4. Since a Rolle field is Pythagorean (Becker [2; p. 66]), Proposition 1.5 shows that Po = K2 U aK2 and 0 P1 = K 2 u -aK 2 for any a E Po n -PI. Hence Po n P1 = K 2. COROLLARY 6.5 (Dickmann [12; Cor. 4.31). The class of Rolle fields with ezactly two orders is aziomatizable in the language LF , complete and decidable. The theory CCVF introduced in $4 is its model-companion.
0
Proposition 6.4 clearly establishes t1ia.t CCF is the simplest theory of Rolle fields beyond the real closed ones (a Rolle field with only one order is necessarily real closed, as the value group of any of its valuations in FfK) is 2-divisible). It also clarifies, to some extent, the nature of chain-closed fields. In [20], [21] and [22] Laslandes investigated several theories of fields carrying finitely many orders. Van den Dries had previously examined theories of this type in his thesis [24] but, while he considered painuise independent orders -i.e., orders defining different topologies-, Laslandes dealt with dependent orders, i.e. orders defining the same topology. In particular, in (22; Ch. 111, $21 he considered the theory COSDn of fields with n suyerdependent orders, namely 11
orders defining the same topology, endowed with a valuation ring convex for all of them, and inducing the same order 011 the residue field (the second of these properties is i n fact equivalent to the first). He proved that COSDn has a modelkompanion, COSDn, and gave an explicit axiomatization of it in the language with symbols for the n orders and the valuation ring; see below.The following holds: PROPOSITION 6.6 (Dickmann [la; Prop. 4.11). The theory COSDn is identical with CCVF (or, to be precise, with the obvious reformulation of the latter in the language L F u (Pg' P I , A } ) . 0
M.A. Dickmann
50
Proof. Both are complete theories satisfying Laslandes axioms for COSDn, namely: (i) Po, P I are distinct orders; (ii) A is a valuatioii ring convex for both Po, P I , and these induce the same order on the residue field; (iii) A is Henselian
with real closed residue field; (iv) the value group r of A is odd4ivisible, I I'/2r I = 2, and regularly dense. Cf. $33, 4 above and [21; Prop. 11. 0 Furthermore, modulo trivial changes in the languages involved, our theory
CCVF'
a
is identical to Laslandes' COSDII, an extension of COSDll involving a
new individual constant c, for which he proved quaiitificr elimina.tion.
REFERENCES. [l] J. Ax, O n the undecidability of power series jields, I'roceedings of the American Mathematical Society, vol. 1G (1%5), 11. S46. [a] E. Becker, Hereditarily-Pythagorean jelds and orderings of higher level, Monografias de Matematica, vol. 29, Instituto de Matematica Pula e Aplicada, Rio de Janeiro, 1978. 131 , Extended Artin -Schreier theorg oj fields, Rocky Mountain Journal ofhfathematics, vol. 14 (1984), pp. 881-897. [4] E. Becker and D. Gondard, A nneaus semi-chainables, unpublislicd manuscript, 1988, 27 pp. [5] E. Becker and B. Jacob, Rational points in algebraic varieties over a generalized real closed field: a model-theoretic approach, Journal fir die Reine und Angewandte Mathemalik, vol. 357( 19S5), pp. 77-95. [6] R. Brown, T. Craven and M. J. Pelling, Ordered fields satishing Rolle's theorem, Illinois Journal ofMathematics, vol. 30( 19S6), pp. 66-78. [7] G. Cherlin, Model-theoretic algebra; selected topics, Lecture Notes in Mathematics, vol. 521, Springer Verlag, Berlin, 1976. [S] G. Cherlin and M. A. Dickmann, Real closed rings. II: Model theory, Annals o f p u r e and Applied Logic, vol. 25(19S3), pp. 213-231. [9] F. Delon, Corps et anneauz de Rolle, Proceedings of the American Mathematied Society, vol. 97(1986), pp. 315-319.
Algebra and Model Theory of Chain Fields: A n Overview
51
[101 ___ , Complhents sur les corps chaine-clos, S h i m i r e DDG "Structures alg&ripes ordon&es", Paris, 1987/1988 (to appear). [ll]F. Delon and D. Gondard, l.lihe Problhe d e Hilbert au niveau n dans les corps chaine-clos, Shinatre DDG "Structures alg&riques ordonw'es", Paris 1986/1987. [la] M. A. Dickmann, The model theory of chain-closed fields, Journal of
Symbolic Logic, vol. 53( 1988), pp. 921-930. [13] W. J . Ellison, Wariiig's problem, American Mathematical Monthly, vol. 78 (1971), pp. 10-36. [14] D. Gondard, Thkorie du premier ordre des corps chahables et des corps chaine-clos, Comptes Rendus des Shnces de I'Aeadhie des Sciences, S&ie I: MaUuhatique, vol. 304(1987), pp. 463-465. [I51
chaines-clos,
,
Axiomatisations "B la Artin-Schreier" des corps chainables et Shinaire DDG "Structures alg6briques ordo&&" Paris
1986/1987.
(161 J . Harman, Chains of higher level orderings, Ordered ~5eld.sand real algebraic
geomelry, Contemporary Mathematics, vol. 8, American Mathematical Society, Providence, Rhode Island, 1982, pp. 141-174. [17) D. Hilbert, Beweis f i r die Darstellbarkeit der ganzen Zahlen durch eine feste Zahl n-ter potenzen (Wan'ngsches problem), Mathematische Annalen, vol. 67 (1909), pp. 281-300. [IS] B. Jacob, The model theory of generalized real closed fields, Journal fir die Reine und Angewandte Mathematik, vol. 323( 1981), pp. 213-220. [ 191 B. Jacob, Fans, real valuations and hereditarily-Pythagorean Jelds, Pacifie Journal ojMalhematics, vol. 93 (1981), pp. 95-105. [20] B. Laslandes, Moddes-compagnons de theories de C O T S munis d e n ordres, Comptes Rendus des Sances de I'Acadhie des Sciences, S h e I: Mathhatique, vol. 300(1985), pp. 411414. , Corps de Rolle portant un nombre fini d'ordres, Comptes "211 Rendus des Sdances de I'Acadhie des Sciences, S&ie I: Mathhatiques, vol. 302 (1986), pp. 401404. 1221 , Thhrie des mod&s des corps n-ordon&, cycle, Universitk Paris VII, Paris, 1984.
These de Qieme
[23] A. Robinson and E. Zakon, Elementary properties of ordered abelian groups,
52
M.A. Dickmann
Transactions of the American Mathematical Society, vol. 96( 1960), pp. 222-236. [24] L. van den Dries, Model fheory offields, Ph. D. Thesis, University of Utrecht, Utrecht, 1978. [25] V. Weispfenning,
Elimination of guantijiers for certain ordered and lattice-ordered abelian groups, Bulletin de la Soci& M a t h h a t a p e de Belgique, %e 13, vol. 33(1981), pp. 131-155. , Quantifier elimination and decision procedures for valued [261 fields, Models and sets, Proceedings of the Logic Colloquium Aachen '83, Lecture Notes in Mathematics, vol. 1103, Springer-Verlag, Berlin, 1984, pp. 419472.
Equipe de Logique MathCmatique UFR de Mathbmatique Universiti! Paris VII 75251 Paris. FRANCE
Logic Colloquium '88 Ferro, Bonotto, Valmtini and Zanardo (Editors) 0 Elsevier Science Publishers B.V. (North-Holland), 1989
53
A Lefschetz Principle f o r Integral Closures Angus Macintyre Mathematical Institute University of Oxford
50.
Introduction. There is a fertile analogy between
and F
P
[t] for prime p and transcendental t
[A].
This centres
round a few fundamental results, such as the product formula and the finiteness of class number, and has helped organize research at the most advanced levels.
p
+ m
But even if one lets
there is no exact result involving elementaryequivalence. When van den Dries [Dl gave his remarkable elimination
theory forznt, the ring of all algebraic integers, I wondered: (a)
Is there a characteristic p version?
(b) If so, does it connect Here,
zint to the [tlint P IF
?
sFp [tlint should be the integral closure of IF
P
[tl
in the algebraic closure of IF (t). P The answer to (a) is "Yes", a result which can be got using the work of Moret-Bailly [MB] and a non-trivial
.
modification of [D]
For (b) also the answer is "Yes", and the exact formulation is our Lefschetz Principle.
The field-theoretic version
relates the algebraic numbers and the algebraic closures of the IF (t), for example in the sense that the former is P
54
A . Macintyre
equivalent to any nonprincipal ultraproduct of the latter. true for
This is
zint arid the F Itlint, but it is P
true "up to localization" in a sense to be explained below. This paper contains no proofs, and is intended solely as an introduction to a definitive paper now in preparation
by van den Dries and myself [DM].
The paper I originally
submitted to these Proceedings had various defects detected by van den Dkies, whom I hearily thank for his delicate analysis.
Basic Notions.
51.
1.1.
a multiplicative set, S-'R If
S
If R is a commutative ring and S is the localization of R at S .
is the complement of a prime ideal P, we write R p €or
S-lR.
1.2.
If R , is a domain, R ( o ) is its field of fractions.
If
K
is a field, Kalg is its algebraic closure.
For
a domain R , Rint 1' s the integral closure of R in R ( 0 ) int . particular is the ring of all algebraic integers.
1.3.
Spec(R) is the usual space of prime ideals of R.
R one associates its structure sheaf on R , with
In
To
Rp the stalk
at P.
1.4.
J ( R ) is the Jacobson radical of R, first-order definable
via :
x
E J(R) e
(Vy) [ l + xy is invertible]
A Lefschetz Principle f o r Integral Closures
55
In special circumstances J(R) equals the set of nilpotent elements (and this is in general not first-order definable).
12.
The Local-Global Principle. 2 . 1 .
Moret-Bailly [MB]
works with rings R satisfying:
(***I
(i) R is an excellent Dedeki+
ring;
(ii) for every finite R-schema 2 the group Pic(2) is torsion ; (iii) for every maximal ideal P of R the residue-field RIP is an algebraic extension of a finite field. He remarks that ( * * * ) is satisfied when R is either the ring of integers of a number field, or the ring of functions of a smooth, connected affine curve over a finite field, or a localization of one of the above.
Obviously ( * * * ) is not
an elementary condition. Moret-Bailly proved: Theorem 1.
Suppose R satisfies ( * * * I ,
V is an absolutely
irreducible variety defined over R, and W is an irreducible Zariski open subset of V defined over R.
If W(Rp) # I$ for
every P E Spec(R) then W(Rint) # 0. This had been proved by Rumely [Rl in the number-field case, by a completely different method.
Indeed, Rumely proved
an extended version, a Density Theorem, where one tries to detect points of W(Rint) with prescribed behaviour at various places of R.
The latter is what van den Dries uses crucially
A . Macintyre
56
in [D].
Moret-Bailly does not give a Density Theorem in this
generality, but, fortunately one can adapt van den Dries' proof to use only Theorem 1 .
This will be an important feature
of [DM]. 2.1.
Theorem 1 obviously extends from R to Rint, by a simple
This is immediately relevant to deciding int the existential theory of R , when R is z o r PP [t] (or a localization of a finite integral extension of one of them).
limit argument.
The reason is that for P E Spec(Rint), the localizations (Rint ) p are of two kinds:
(i)
for P = (O), an algebraically closed field:
(ii) for P # (0), the valuation ring of an algebraically closed field with nontrivial valuation. In [R] Abraham Robinson proved that these rings are uniformly model-complete, and in [DMM] it is shown that those in (ii) have uniform quantifier-elimination if is allowed as a primitive.
I
(division)
(i) of course has uniform
elimination. This readily yields decidability for the class of localizations. To decide the existential theory of Rint, one must reduce the problem of checking points on varieties V to the case of absolutely irreducible V. constructivity this is quite standard.
At the level of
51
A Lefschetz Principle f o r Integral Closures 2.3.
Van den Dries saw that one can even get an informative
quantifiex-elimination for Theorem.
zint out of Rumely 's Density
Essentially one has to convert Theorem 1 into an
elementary condition for W(Rint) # @.That is, if W varies through a definable family, one needs to express in a firstorder way'the local conditions that W(R Pint) # @ for every P E Spec(Rint). By [DMM] the condition W(R Pint) # @ is quantifier-free definable in R p F t (using 1 ) . one to pull the quantified version ( ( V P )
!)
But how is
back into Rint?
There is also the problem of getting from absolutely irreducible V to general V.
Van den Dries has an elegant solution to
this bit, which fortunately adapts to the characteristic p case. [t] is that Rint is P Bezout and has every nonzero prime ideal maximal. The former 2.4.
A special feature when R = P o , F
fact is essentially finiteness of the class number, and the latter follows from the fact that rings of integers in global fields are Dedekind. Note that Bezout is elementary, while the other condition is not. Another important nonelementary property of Rint , in the above cases, is that every element of J(Rint/I) is nilpotent, for any ideal I of Rint.
This property is,
strangely enough, quite crucial in van den Dries' elimination [D], but will be avoided in [DM].
A . Macintyre
58
All P in Spec(Rint) with P # (0) are undefinable, so
2.5.
there is no obvious way of eliminating (VP) in favour of first-order concepts.
However, since any P # (0) is maximal
for the special R above, one can avail oneself of the definability of J(Rint/I) for definable I, and this gives a clue to the primitives van den Dries used in [D]. is no particular point spelling them out here.
There
It suffices
to say that J(Rint/I) for various definable I is the main ingredient.
53.
Sample Results
3.1.
There is a uniform elimination,
in the language LRAD of [D], for all semisimple $(Zint) S
-1
and
(IFp[tIint), where S is a multiplicative set in a finite
.
This yields integral extension of z o r F [t] P int . Theorem 2. Each IF It] is decidable, and the theory of all P IFp [t]int is decidable. The Lefschetz Principle is Theorem 3 . E(@)
For every L-sentence 0 there is a finite set
of primes such that for all multiplicatively closed
finitely generated S
sz-{O}
with L(@) 5 S, Q has the same
truth-value in S-’(zint), and this truth-value is the same as that in any F Note: -
P
[tlint for p
One cannot do better.
is invertible.
4
C(@).
Let @ say that either 2 or 3
Q is true in all F [t] nt, but false in P
nt
59
A Lefschetz Principle for Integral Closures 4.
Concluding Remarks.
In [DM] a comprehensive analysis will
be given of the logic of the local-global principle.
In
particular, natural axioms will be given, and complete extensions classified, rather in the style of [Ax].
[Ax]
J. Ax, The elementary theory of finite fields, Annals of Math. 8 8 ( 1 9 6 8 1 , 2 3 9 - 2 7 1 .
[D]
L.P.D. van den Dries, Elimination theory for the ring of algebraic integers, J. reine angew. Math. 3 8 8 ( 1 9 8 8 ) , 189-205.
[DM]
L.P.D. van den Dries, A.J. Macintyre, Analogues between numbers and functions, in preparation.
[DMM] L.P.D. van den Dries, A. Macintyre, K. McKenna, Elimination of quantifiers in algebraic structures, Adv. in Math. 47 ( 1 9 8 3 1 , 76-87. [MB]
L. Moret-Bailly, Points entiers des varietgs arithmgtiques, 1 4 7 - 1 5 4 in Sdminaire de Thgorie des Nombres, Paris 85-86 (ed. C . Goldstein), Birkhauser 1 9 8 7 .
[R]
A. Robinson,
[Ru]
R. Rumely, Arithmetic over the ring of all algebraic integers, J. reine angew. Math. 3 6 8 ( 1 9 8 6 1 , 1 2 7 - 1 3 3 .
Complete Theories, Amsterdam 1 9 5 6 .
This Page Intentionally Left Blank
Logic Colloquium '88 Ferro, Bonotto, Valentini and Zanardo (Editors) 0 Elsevier Science Publishers B.V. (North-Holland), 1989
61
THE C*-ALGEBRAS OF THREE-VALUED LOGIC DANELE MUNDICI
Dipartimento Scienze Informazione Universitd a? Milano 9, via Moretto da Brescia 20133 Milano, Italy
Summary We show that Grothendieck's functor KO maps 3-subhomogeneous AF C*-algebras with Hausdorff structure space one-one onto countable Lindenbaum algebras of 3-valued logic. Whereas in the interpretation of Birkhoff and von Neumann propositions are identified with projections and form an uncountable nondistributive lattice, in our interpretation propositions are unitary equivalence classes of projections, and form a countable MV, algebra of Chang and Grigolia, afim a 3-valued Lukasiewicz algebra in the sense of Moisil and Monteiro, that is, a Kleene algebra equipped with an operation V obcying x* A V x = x* A X and x* v V x = 1.
MV algebras, lattice-ordered abelian groups [12], [131, 1301, 141, [S] Let us equip the real unit interval [0,1] with the operations *, 0 , and given by x* = 1 - x, x 8 y = min (1, x + y ) . x y = (x*@y*)* = max (0, x + y 1). Algebras in the variety generated by I = ( [0,1], 0, 1, *, 0 , are known as 1.
0 )
(Chang's) MV algebras. They stand to the infinite-valued sentential calculus of Lukasiewicz [50],as boolean algebras stand to the 2-valued calculus. For each n = 2, 3, ..., let I, be the subalgebra of I with underlying set (0, l/(n -l), 2/(n -l), ..., ( n -2)/(n -l), I ] . Algebras in the variety generated by I, are called MV, algebras. MV2 algebras are just boolean algebras. Chang [I2 011, [13, Lemma 81 provided a list of equational axioms for MV algebras. A simplified list was given by Mangani [34] as follows: An algebra A = ( A , 0, 1, *,0, is an MV algebra iff (A, 0 , 0) is an abelian monoid, and x 8 1 = 1, x** = x , O* = 1, ( x * @ y ) * 0 y = 0 )
(y*@x)*@x, x*y = (x*@y*)*. See [40,2.61 for details. Note that x* @ x = 1 follows from the above axioms. Grigolia [30, $31 proved that MV3 algebras may be equivalently defined as MV algebras obeying the additional axiom x 8 x = x 8 x 8 x.
62
D. Mundici
Chang [12, 1.16-171 proved that boolean algebras coincide with MV algebras obeying x e x =x. Following [38], given a lattice-ordered abelian group G with a distinguished strong (order) unit u, we let T(G,u) be. the unit interval (g E G I 0 I g I u) equipped with the operations g*= u-g, g e h = uh(g+h), g*h = Ov(g+h-u). Further, for every lattice-ordered group homomorphism f: G + G' such that flu) = u', we let r(f) be theresmctionof f to the unitintervalof G.
1.1 THEOREM [40,3.9].
r is a categorical equivalence belween lattice-orderedabelian
groups with strong unit, and MV algebras.
REMARK. Mangani's axioms were rediscovered by Bosbach [8, 1.21. Warning:
Bosbach's last axiom [8, CS5, p. 901 should read a o ( a o b')' = b 0 ( b o a')' instead of a o (a o b')' = b o (a o a')'. This error is reproduced by Frink [27] in his review of [8]. Very recently, MV algebras have found applications in the study of variants of Aristotle's comparative logic [ 111, expert systems [31, $71, proof theory of many-valued logic [42], [45], IsCki-Tanaka algebras [39], 1431, and lattice-ordered groups [41], [46], [47]. As shown in [40] and [47], free MV algebras generate interesting examples of C*-algebras.
2. K O of rings 1321, [351, 1261 Let A be a ring with a unit element 1, and let p be the family of all finitely generated projective left A-modules. Thus P E p iff P is a direct summand of a
free left A-module of finite rank. We say that P , Q E p are stably isomorphic iff there is R E 63 such that P @ R 2 Q @ R . We let [PI be the stable isomorphism class of P , and we define Ko(A)+ = ([PI I P E p ). &(A)+ is then turned into a cancellative abelian semigroup by writing [P]+[Q] = [PBQ] for all P and Q in p. By formally adjoining additive inverses we obtain an abelian group Ko(A), the Grothendieck group of A. Each element of Ko(A) has the form [PI - [Q] for some P and Q in @. Two elements [PI - [Q] and [R] - [Sl are equal in Ko(A) iff [ P @ S ] = [R@Q]. Defining x I y iff y - x E Ko(A)+, we equip Ko(A) with a pre-order
The C*-Algebras of Three-Valued Logic
63
(that is, a reflexive and transitive) relation, which is translation invariant: x I y implies x + t I y + t . The element [A] is a strong unit in Ko(A), in the sense that for each x in Ko(A) there is an integer n 2 1 such that x I n [ A ] . In all rings considered in this paper, the relation I turns out to be antisymmetric, and Ko(A) thus becomes a partially ordered (P.o.) abelian group with the distinguished strong unit [A]. In the category of p . 0 . groups with strong unit, by a morphism f : (G,u) + (G',u') we mean an order-preserving group homomorphism f such that f l u ) = u'.
3. C*-algebras [18] Let A be a Banach space over the complex field C . If A is an algebra over C and the multiplication satisfies the inequality llryll I lkll llyll , then A is called a Banach algebra. A is an involutive Banach algebra iff there is a map * : A + A such that x** = x , (x + y)* = x* + y*, (Ax)*= %*, (xy)* = y*x*, Ilx*ll = Ilrll, for all x, y E A and A E C . If in addition for each x E A , Ilx x*ll = Ilx*ll Ilxll, then A is called a C*-algebra. Unless otherwise specified, every C*-algebra A considered in this paper will have a unit 1. If H is a Hilbert space over C, the set L(H) of bounded linear operators on H is a C*-algebra with the natural algebraic operations (addition, multiplication, multiplication by complex scalars, and the adjoint operation), and norm. A C*-algebra of operators is a norm closed subset of some L(H) which is also closed under all the algebraic operations of L(H). The GelfandNaimark-Segal theorem asserts that every C*-algebra is isomorphic to a C*-algebra of operators. A representation of A in a Hilbert space H is a linear map n:A 4 L(H) such that n(xy) = rc(x)a(y), and a ( x * ) = n(x)* for all x , y E A . When l e A , it is also assumed that ~ ( 1 is ) the identity operator on H . A linear subspace K of H is called an invariant subspace of a iff n (x)K K for all x E A . If ( 0 ) and H are the only invariant subspaces of n, then a is said to be irreducible, in symbols, n E Irr(A). A subset J of A is a primitive ideal of A iff J is the kernel of some irreducible representation of A . The structure space of A is the set Prim(A) of primitive ideals of A equipped with the (Jacobson) hull-kernel topology: thus a subset S of Prim(A) is closed iff each primitive ideal which contains the set n ( J I J ES) is already in S. Given an integer n > 1, a C*-algebra A is called n-subhomogeneour iff for each irreducible representation of A in a Hilbert space H the dimension of H is
D.Mundici
64
< n. A projection in a C*-algebra A is a self-adjoint idempotent p = p* = p2. Projections p and q are equivalent in the sense of Murray and von Neumann iff there is an element v E A such that vv* = p and v*v = q. We say that p and q are unitarily equivalent iff upu* = q for some u E A with u*u = uu* = 1. 4.
K O of AF C*-algebras
[261, [191, [291
Following [ 9 ] , a C*-algebra A is called approxirnatelyfinite dimensional (AF) ... of finite dimensional C*iff A has a unit 1 and there is a sequence A1 A2 algebras, all with the same unit 1 , each Ai a sub-C*-algebra of Ai +1 , such that A is the norm closure of u Ai. AF C*-algebras are a standard tool in quantum statistical mechanics [ l o ] , [25], [49]. Elliott [23] proved that for every AF C*-algebra A, Ko(A) is a p.0. group,
and that from the pair (Ko(A), [ A ] ) one can unambiguously recover A. Subsequently, Effros, Handelman and Shen [20] gave a simple characterization of the p.0. groups arising as &(A) from arbitraq AF C*-algebras. We shall need the following fragment of the KO-theory of AFC*-algebras: 4.1 THEOREM.(i)
Let A and B be AF C*-algebras. Then KO( A ) is a countable p.0. abelian group with strong unit [A]. Further, A is isomorphic to B iff (Ko(A), [ A ] ) and (Ko(B), [ B ] ) are isomorphic as p.0. groups with strong unit. (ii) A p.0. group G withstrong unit u isisomorphicto (Ko(A), [ A ] ) forsome AF C*-algebra A iff G iscountable, abelian, unperforated ( i f nx 2 0 for some n > 0 then x 2 0), and has the Riesz property (given x,, xz, y , , y z E G with X i Iyj forall i,j, there is anelement Z E G such that xi S z 5 y, forall i , j ) .
Recalling Theorem 1.1 we have 4.2
COROLLARY.The function A + T(Ko(A), [ A ] ) maps all isomorphism
classes of AF C*-algebras with lattice-ordered KO one-one onto all isomorphism classes of countable MV algebras.
See [40] and [47] for some applications of the above correspondence. In [44] the combinatorial complexity of certain AF C*-algebras is measured in terms of the
The C*-Algebrasof Three-ValuedLogic
65
complexity of the word problem of their associated MV algebras. Some instances of Corollary 4.2 are given in the following table.
4.3 TABLE. ITS AF C*-CORRESPONDENT
(0,1)
C
Lukasiewicz chain (0,lln,...,1 1 , [50, p. 481 Q n [0,1], Q = the rationals dyadic rationals in the unit interval algebra generated by p~ [0,1] \Q, [48, p. 11 real algebraic numbers in [0,1] Chang algebra C , [ 12, p. 4741 free with one generator free with K O generators, [ 12, p. 4721 atomless boolean subalgebra of Q n [O,l] totally ordered finite boolean three-valued, M V 3 , [30]
M, (C), the n x n complex mamces Glimm universal UHF, [21], [I91 CAR algebra of the Fermi gas, [25] Effros-Shen algebra Fp, [22], [19] Blackadar algebra B, [7, p. 1041 Behncke-Leptin A,,,, [21, [9,3.41 the Farey algebra, [47, $31 the algebra of [40,$81 C ( 2 9 119, P. 131 UHF, [281, [I91 Murray,von Neumann compar., [24] finite-dimensional commutative 3-subhom., T2 stmcture space, [33]
The rest of the paper is devoted to proving the last three lines of this table.
5. Finite vs. finite dimensional,
5.1 PROPOSITION. The function A
boolean vs. commutative
-+
T(Ko(A),[ A ] )maps all isomorphism classes
of finite dimensional C*-algebras one-one onto all isomorphism classes of finite MV
algebras. PROOF. If A is a finite dimensional (AF) C*-algebra, then A is a finite product Mn,(C) x ... x M,,(C) = L(H1) x ... x L(H,), each Hi a Hilbert space of finite
dimension n i . i = 1,...,r , [18, 5.7.11. A routine computation [35], [26] yields
66
D. Mundici
Ko(A) = Z' with the product ordering: ( X I , ..., x t ) 2 0 iff xi 2 0 for all i . The strong unit [A] of &(A) is then identified with ( n l , ..., n r ) . It follows that T(Ko(A), [ A ] ) = (0, l/nl,...,1 ) x ... x (0, l / n t , ...,1 ) is a finite MV algebra. Conversely, if B is a fimite MV algebra then its underlying lattice [ 12, 1.1 11 is complete and atomic, whence by [3,Theorem 421 B is an MV algebra of [O,l]-valued functions, and the intersection of all maximal ideals of B is (0). Let At@) be the set of atoms of B . For each b E At(B) let us fix a maximal ideal Ib such that b e . Then b/Ib is an atom of B/Ib , and B/Ib is (isomorphic to) a subalgebra of [ & I ] . By [12, 3.191 there is an integer b' > 0 such that B / I b = (0,Ub', 2/b', ..., 1 ) . Moreover, b/tb = l/b' and for each atom c f b we have ClIb = 0. Define B' = n ( B l 1 , I b E At@)). Let f : B + B' be the homomorphism x + (x/Ib I b E At@)). For each b E At(B) we have f ( b ) = (0....,0, l/b', 0....,0). Thus f is onto B'. Moreover, f is one-one, for otherwise, if x # y and f ( x ) =f ( y ) then, letting d(x,y) = x**y @y**x, by [12, 3.141 the atomicity of B yields an atom a I d(x,y), whence 0 < a/Ia I d(x,y)lI,, and 0
5.2 PROPOSITIONThe function A
+ r(Ko(A), [ A ] )maps all isomorphism classes of
commutative AF C*-algebras one-one onto all isomorphism classes of countable boolean algebrm. PROOF. If A is commutative, by [18, 1.41 we can identify A with the C*-algebra
C(X) of complex-valued continuous functions on X, for some compact Hausdorff space X. X has a countable base of clopens, by [29, p. 1201. Direct computation shows that (&(A), [ A ] ) is the lattice-ordered abelian group C(X, Z) of continuous integer-valued functions on X, where Z is given the discrete topology, and with the constant function 1 as the strong unit [29, p. 1591. Then T(Ko(A), [ A ] ) is the countable boolean algebra of (0,l )-valued continuous functions on the space X. Conversely, if B is a countable boolean algebra, by the Stone duality we can identify B with a boolean algebra of (0.1 )-valued continuous functions over some
The C*-Algebras of Three-Valued Logic
67
compact Hausdorff space Y with a countable base of clopens. Arguing as in the first part, and using Theorem 4.1, we get B 3 T(Ko(C(Y)), [C(Y)J), by 129, p. 1201.
QED As a particular case of Proposition 5.2, the countable atomless boolean algebra corresponds to the C*-algebra C(20) of complex-valued continuous functions over the Cantor cube [19, p. 131.
6.
Subhomogeneous vs. 3-valued
6.1 THEOREM. The function A
+
T(Ko(A), [ A ] ) maps all isomorphism classes of
3-subhomogeneous AF C*-algebras with Hausdorff structure space one-one onto all isomorphism classes of countable M V 3 algebras. 6.2 DEFINITION. Let E be a 3-subhomogeneous C*-algebra. For each projection p in E , we define the function d p : Irr(E) +(O, 1/2, 1 ) by dp(a) = ratio between
dimension of the range of a (p) and dimension of the Hilbert space of a
.
6.3 LEMMA.Assume A is a 3-subhomogeneous AF C*-algebra with Hausdorff structure space Prim(A). Then for any two projections p and q in A thefollowing conditions are equivalent:
p and q are equivalent in the sense of Murray and von Neumann; (ii) p and q are unitarily equivalent; (iii) dp = dq (i)
PROOF. Trivially, (ii) implies (i). The converse implication is proved in [21, 3.61. Trivially, (ii) implies (iii). Assume now dp = dq , with the intent of proving (ii). Let A be the norm closure of u A, , where A, c A2 c ... is an ascending sequence of finite
dimensional C*-algebras. By [21, 3.31 we can safely assume that p and q are in A,, and by [18, 5.7.11 we can write A1 = M k l ( C ) x ... x Mh(C), where each Mki;(C)is the C*-algebra of ni x ni complex matrices. Since A is 3-subhomogeneous, ki E ( 1 , 2 ) for each i = 1, ..., t . For each n we can similarly form copies C1 ,..., Ca(,,) of the C*-algebra C, and copies D1,..., Db(,) of M2(C) in such a way that
68
D.Mundici
Considered as elements of A,, p and q have the form
We say that a factor Ci in A,, is a separator (for p and q ) iff pi f qi (ix., pi = 0 and 4i = 1, or viceversa). Claim, For some positive integer m, there is no separator in A,,. Deny (absurdum hypothesis). For each separator C , in A,,+, there is precisely one separator C i in A, such that C ; is embedded in C , with respect to the Bratteli diagram 191 of -A. Call such Ci the mother of C , . The set of separators, together with the motherhood relation, determines a finite set of maximal trees in the Bratteli diagram of A . By our absurdum hypothesis, at least one tree, say T , has infinitely many nodes. By Konig's lemma, T has an infinite path C i ( l ) ,Ci(2),..., where each Ci(,,) is a separator in A , and is the mother of Ci(,,+l). By [9, 3.2, 3.3, 3.81, the product of the factors in A, other than Ci(,) is an ideal I,, of A,,, and the norm closure of uI, is a primitive ideal I of A, Since exactly one between p and 4 belongs to I , letting K E Irr(A) be such that ker(a) = I , we have d p ( n ) f dq(n), thus contradicting (iii). This settles our claim. Let now m be such that A,,, has no separators. Recalling (1) and (2), for each j = 1,..., a(m) + b(m), p, and q, are projections in the C*-algebra of operators L ( H , ) , the Hilbert space H, being one-dimensional for j = 1,..., a(m), and twodimensional for the remaining j's. Further, the ranges of p, and 4, have the same dimension in H , : as a matter of fact, for j = 1, ..., a(m) this follows from our aszumption about m ; for j = a ( m ) + l , ...,a(m)+b(rn) this is a consequence of assumption (iii), together with the assumed 3-subhomogeneity of A and [18, 2.10.21. It is now easy to find u = (u1,..., uo(,,,)+b(,,,)) in A,,, such that u*u = uu* = 1 and p = uqu*. QED
6.4 L E M M A . Let A be a 3-subhomogeneous Prim(A). Then we have:
AF C*-algebra
with Hausdofl
The C*-Algebras of Three-Valued Logic
69
(i) For eachprojection p E A and j e (0, 1/2, l ) , the set X , = (ker(x) I dp(X)=j , n ~ I r r ( A ) )is a clopen subset of Prim(A); (ii) For each clopen subset Y of Prim(A) there is a projection py in A such that m y ) = 1 for all X E Irr(A) with k e r ( ~E) Y , and Ir(py) = 0 f o r all x E Irr(A) with ker(n) e Y . (iii) For any two projections p and q in A there is a projection r in A such that dr(x) = min (1, dp(x)+ d,(x)), f o r all x~ Irr(A).
XO = (ker(x) I II x@) II = 0 )
I II n(p) I1 < 1) is clopen by [18, 3.3.9, 4.4.11 together with our hypotheses about A. Replacing p by 1 - p , we have that X I is clopen. By 3-subhomogeneity, X m is clopen. PROOF. (i)
= [ ker(x)
(ii) This follows from [18, 4.4.1, 10.5.61. (iii) By 3-subhomogeneity, whenever d p ( x )+ d,(n) < 1, Q) and x(q) must be orthogonal projections, whence x(p+q) is a projection. By (i), both sets X = (ker(x) I d p ( x )+ d,(x) < l ) , and Y = (ker(n) I dp(n)+ d,(x) 2 1) are clopen. Let p x and p y be as given by (ii). Then r = @+q)px + py
is the required projection.
QED 6.5 LEMMA. Let A be a 3-subhomogeneous AF C*-algebra with Hausdorff Prim(A). Then Ko(A) is lattice-ordered. With reference to Definition 6.2, for each projection p in A we define the function Dp : Prim(A) + ( 0 , 1/2, 1) by stipulating that for each J E Prim(A), Dp(J)
PROOF.
= dp(x), for an arbitrary
x E Irr(A) with ker(x) = J . The value of Dp(J) does not
depend o n the choice of x, by [18, 4.3.7, 2.2.11, together with the assumed 3subhomogeneity of A. Let D be the set of the D,,’s, with p ranging over all projections in A. D is equipped with the partially defined operation of adding two functions Dp and D, whenever p is orthogonal to q , D , + D, = DP+,. Let S (resp., G) be the additive semigroup (resp., group) of real-valued functions o n Prim(A) generated by D. Then S induces the natural pointwise order on G, and the constant function 1 = D1 is a strong unit of G. The partially defined addition on D agrees with the natural pointwise addition of G. Trivially, D is upward directed: indeed, 1 is the greatest element in D . Claim. D is hereditaryin G: if h E G and O s h l l , then h E D .
70
D. Mundici
As a matter of fact, let 0 I h =f - g I1, with J g E S. Then for suitably chosen projections p 1 ,..., p n in A we have h = D,, +...+ DPn. By induction on n, we can
find a projection r E A such that h = D,. The case n=l is trivial. If h = DP,+...+DPn+, then by induction hypothesis Dp,,+...+ D,, = D, for some projection q E A. Since
D,+Dpn+,= h 5 1, using [18, 4.3.7(ii) and 2.2.11 and Lemma 6.4 (iii) we obtain a projection r E A such that D, = D, + Dpn+l,as required to settle our claim. The analysis of [23, 4.4 and $51, together with [26, 0 2-41 and Lemma 6.3 now allows us to make the following identifications: D = ( X E &(A)+[ x I [A]) = ( X E Ko(A)I 0 C_ x I [ A ] ) ,
S = Ko(A)+, (G,1) = WOW), [All. To conclude the proof of the lemma, let f = Dp,+...+ Dpn and g = Dq,+...+ D,. Lemma 6.4 (i) , the set Y = (ker(n) I
Ci Dpi(ker(n))
2
By
c, Dqj(ker(n)), Z E Irr(A))
is a clopen subset of Prim(A). Letting p y be as given by Lemma 6.4 (ii), we have that each pipy. as well as each qjpy, is a projection. The function Xi Dpipv - C, Dqjpy belongs to G and coincides with max(0, f-g) over Prim(A). By [4, 1.2.91, G = Ko(A) is lattice-ordered. QED 6.6 PROOFOF THEOREM 6.1. Let A be a 3-subhonogeneous AF C*-algebra with Hausdorff Prim(A). We have just proved that &(A), [A]) is a lattice-ordered abelian group of functions from Prim(A) into the set Z1/2 of integral multiples of 1/2, with the constant function 1 as the strong unit. Therefore, B = T(Ko(A), [A]) is an MV algebra of (0,1/2,1)-valued functions on Prim(A). Since each f .
equation @f =@@L
B satisfies the B is an MV3 algebra. B is countable, by Corollary 4.2.
Conversely, let B be a countable MV3 algebra. Let L be the free MV algebra over denumerably many generators [ 12, p. 4721. A familiar universal algebraic construction [17, p. 1761 shows that L is the MV algebra of [O,l]-valued functions on the Hilbert cube [0,11° generated by the canonical projections eo, el,..., where each ei :[O,l]" -+ [0,1] is given by ei(x) = x i , for every x = (XO. XI, ...) E [0,11° . Since in particular B is an MV algebra, there is an ideal J in L such that B G L/J. Since by 130, 3.11 B is a subdirect product of MV algebras of either form (0.1) or (0,1/2,1), from [45, 3.1 (v)*(ii)] it follows that for some nonempty closed subset X of [O,l]", B is (isomorphic to) the MV algebra of restrictions to X of the functions in L. Let G be the countable lattice-ordered group of real-valued functions on X
generated by B,
with the constant function 1 as thestrong unitof G. Then
The C*-Algebras of Three-Valued Logic
71
B = nG,l). By [40,03], the riiap J + Jn B is a lattice isomorphism between the I-ideals of G and the ideals of B. Prime (resp., maximal) I-ideals of G correspond to prime (resp., maximal) ideals of B. In B prime ideals coincide with maximal ideals [30,2.4]. In G iniersections of I-ideals are I-ideals. Therefore, the space Spec(G) of prime I-ideals of G equipped with the hull-kernel topology [4, $101 coincides with the subspace of maximal I-ideals of G , which is a Hausdorff space [4, 10.21. Let now A be the AF C*-algebra such that (Ko(A), [A]) E (G,l), as given by Theorem 4.1. It is well-known [29, p. 1961 that KO induces a lattice isomorphism of the set of (closed, two-sided) ideals of A onto the set of order-ideals (= convex, directed subgroups) of G. Since in G order-ideals are the same as I-ideals, it follows that primitive (resp., maximal) ideals in A correspond to prime (resp., maximal) I-ideals in G , whence in A primitive ideals coincide with maximal ideals, and Prim(A) is homeomorphic to the Hausdorff space Spec(G). There remains to be proved that A is 3-subhomogeneous. Let x = (XO, X I . ...) E X. If for some i we had xi P [0,1/2,1], then letting I,= I ~ E IBf ( x ) = 01, I, is a maximal ideal of B, and the quotient map B + BII, is just evaluation at the point x. In particular, the canonical projection ei is mapped into ei(x) e [0,1/2,1), and hence,
BII, is not a subalgebra of [0,1/2,1), contradicting [30, 2.171. We have shown that all coordinates xi of each x E X are in the set (0,1/2,1]. Since every function f~ B arises from the canonical projections by applying the pointwise MV operations, we have that range(f) is contained in {0,1/2,1]. Thus, for every gEG, range(g) is contained in Z1/2. Let now n ~ I r r ( A )and J = ker(z). By [9, p. 2141, AIJ is an AF C*algebra with unit 1/J. Let I be the maximal I-ideal of G corresponding to J via KO. By [19, 9.1-41 we have
Since X is compact and every function in G is continuous, there is a point x E X such that I = (gEG I g ( x ) = 0 ) . For each gE G, g l l = g ( x ) E Z1/2. Therefore, (GII, 111) is isomorphic to either (Z, l), or (Z1/2, 1). By (3) we conclude that n(A) = AIJ is isomorphic to either C or M2(C). and A is 3-subhomogeneous. The
proof of Theorem 6.1 is complete. QED
D. Mundici
12
7.
Propositions as (equivalence classes of) projections
[51, 111.51
Before the advent of MV algebras, an equivalent version of MV3 algebras was introduced in 1940 by Moisil [36, 08 13, 141, and developed by him in 1960 [36, $151, and by Monteiro in 1963 [37, VII]. Further developments lead to the following 7.1 DEFINITION. [ 16, p. 2421 . A three-valued Lukasiewicz algebra is an algebra A = (A, 0, 1, *, V , v , A ) such that ( A , 0, 1, *, v , A ) is a Kleene algebra, and for all x E A , X*AVX= X * A x , and x * v V x = 1.
Recall 11, p. 2151 that a Kleene algebra (A,O,I,*,V,A) is a distributive lattice with smallest element 0 and largest element 1 such that x** = x, (xvy)* = X*AY*, and X A X * I yvy*. The following result, whose proof is implicit in the work of Moisil and Monteiro, shows that MV3 algebras and three-valued Lukasiewicz algebras are cryptoisomorphic in the sense of Birkhoff [5, p. 1541: 7.2 THEOREM.(i) Given an MV3 algebra E, define @ ( E )= ( E , 0, 1, *, V, v , A ) by VX = x@x, x v y = (x*@y)*@y, XAY = ( x * v y * ) * . Then g ( E ) is a threevalued Lukasiewicz algebra; (ii) Conversely, given a three-valued Lukasiewicz algebra F, let M F ) = ( F , 0, 1, *, 8, *) be given by x@y = (x v V y ) A 0, v V x ) , and x y = (x*@y*)*. Then M F ) isan MV3 algebra; (iii) Themaps 0 and y aremutuallyinverse.
PROOF. (i) By [30, 3.11, it is sufficient to consider the (trivial) case when E = {0,1/2,1). (ii) By [15,2.31, it is sufficient to consider the case when F is the lattice ( 0 , 1/2, 1 ) with x* = 1 - x and V x = min (1, 2). Using Mangani's axioms given in Section 1, (ii) is easily verified. (iii) Trivial. 7.3 PROPOSITION. [14, p. 6731. For each x in any three-valued Lukasiewicz algebra F , Vx is the smallest element y E F such that YAY* = 0, yvy* = 1, and x 5 y . 7.4. In their analysis [6] of the logical structure of the Hilbert space H of a quantum
system S, Birkhoff and von Neumann identified the propositions on S with the closed
The C*-Algebras of Three-Valued Logic
13
linear subspaces of H. Equivalently, in [51, 111.51 propositions are interpreted as projections of L(H). Defining p l q iff pq=p, [51, 11.41, the set of propositions becomes an uncountable, rwndistributive lattice. Although the Hilbert space description of S is successful for nonrelativistic quantum systems with a finite number of degrees of freedom, infinite systems lie somewhere beyond the reach of this formalism. When, for instance, S is a quantum lattice [ 10, Ch. 61, [25, p. 3851, [49, p. 221, the AF C*algebra A describing S typically has a multitude of inequivalent irreducible representations, corresponding to macroscopically different classes of states of S. A comes to us as an abstract C*-algebra free of any underlying Hilbert space. The
Gelfand-Naimark-Segal theorem allows us to reconstruct u Hilbert space representation appropriate to each possible physical situation of S. All relevant information on S is contained in A; thus in particular, observables of S are constructed from the selfadjoint elements of A, [25, Ch. 91. Accordingly, all the logical structure of S is installed in (and should therefore be extracted from) the AF C*-algebra A. By [40, 1.31, A is embeddable into an AF C*-algebra with lattice-ordered KO. As shown in Table 4.3, AF C*-algebras with lattice-ordered KO include many interesting examples. Assuming &(A) to be latticeordered, by Corollary 4.2 the algebra B = T(Ko(A), [ A ] ) is a countuble Lindenbaum algebra of the infinite-valued sentential logic of Lukasiewicz. Elements of B are genuine propositions - in fact they are logical equivalence classes of sentences, which can be written in some finite alphabet, see [40, $71 for a concrete example dealing with the CAR algebra. Propositions in B are acted upon by negation *, and by the Lukasiewicz disjunction @, together with its de Morgan dual operation. In addition, lattice connectives can be defined by x v y = (x*@y)*@y and XAY = (x*vy*)*, thus making
(B,v,A) a distriburive lattice. By Corollary 4.2, from the MV algebra B , A can be unambiguously reconstructed. Further, every countable MV algebra is obtainable from some AF C*-algebra in this way. In order to better understand the nature of propositions in S, let us first recall that (x is said to be an inner automoiphism of A iff there is ueA such that u*u=uu*=l and a ( x ) = uxu* for all x e A. The canonical correspondence [26], [21, 3.61 between stable isomorphism classes of finitely generated projective A-modules 5 [A] and unitary equivalence classes of projections in A, makes it possible to visualize propositions as projections in A, just as von Neumann did for L(H), with the additional proviso that projections p and q should be identified iff a@) = q for some inner automorphism a
D. Mundici
74
of A. Thus, propositions are naturally present in the AF C*-algebra describing S, as unitary equivalence classes @] of projections. Let 5 k.e the order of Murray and von Neumann: thus lp] 5 [q] iff a@) I q for some inner automorphism a (we are reformulating the traditional definition of 5 [18, p. 3811 in the light of [21, 3.61). Then 5 induces the lattice structure [12, 1.111 of the MV algebra B . Letting for every projection P E A ,
@]* = [l-p], the structure ( B , 0, 1, *, v, A ) becomes a
Kleene algebra. In contrast to the richer MV structure of B , the Kleene structure alone is not sufficient to reconstruct A. However, in case A is 3-subhomogeneous, KO@) is lattice-ordered iff Prim(A) is Hausdorff. A can be recovered from (B,V) by defining V[p] = [ql, where q is the <-smallest central projection of A such that p S q . The existence of such q follows from Lemmas 6.3-5, for q is the only projection such that for all n E Irr(A), d,(n) = 0 if d,(n) = 0, and d , (n)= 1 if d,(n) E (U2.11. By Theorem7.2 and Proposition 7.3, ( B , O,l,*,v,v,A) i @r(Ko(A),[A]). Despite the relative simplicity of the construction of B from A, Theorem 6.1 ensures that A can be unambiguously reconstructed from B. Moreover, every countable threevalued Lukasiewicz algebra arises from 4, r , and KO in this way.
References 1. 2. 3. 4. 5.
6. 7.
R.BALBES, P.DWINGER,"Distributive Lattices", University of Missouri Press, 1974. H.BEHNCKE, H.LEPTIN, C *-algebras with a two-point dual, Journal of Functional Analysis, 10 (1972) 330-335. L.P.BELLUCE, Semisimple algebras of infinite valued logic, Canadian J . Math., 38 (1986) 1356-1379. A.BIGARD, K.KEIMEL, S.WOLFENSTEIN, "Groupes et anneaux rtticults", Lecture Notes in Mathematics, vol. 608, Springer-Verlag, Berlin, 1977. G.BmKHOFF, "Lattice Theory", Third Edition, Amer. Math. SOC.Colloq. Publ., vol. 25, Providence, R.I., 1967. G. BIRKHOFF, J. VON NEUMANN, The logic of quantum mechanics, Annals of Math., 37 (1936) 823-843. B.B.BLACKADAR,A simple C*-algebra with no nontrivial projections, Proc. Amer. Math. Soc., 78 (1980) 504-508.
The C*-Algebrasof Three-ValuedLogic
8. 9. 10. 1 1. 12. 13. 14. 15. 16. 17. 18. 19. 20. 2 1. 22. 23. 24.
25.
75
B.BOSBACH, Concerning bricks, Acta Math. Acad. Sci. Hungar., 38 (1981) 89-104. 0. BRATTELI,Inductive limits of finite-dimensional C*-algebras, Trans. Amer. Math. SOC., 171 (1972) 195-234. O.BRATTELI,D.W. ROBINSON, "Operator Algebras and Quantum Statistical Mechanics I , 11",Springer-Verlag, Berlin, 1979. E.CASAR1, This Logic Colloquium '88. C.C.CHANG,Algebraic analysis of many valued logics, Trans. Amer. Math. SOC., 88 (1958) 467-490. C.C.CHANG,A new proof of the completeness of the Lukasiewicz axioms, Trans. Amer. Math. Soc., 93 (1959) 74-80. RXIGNOLI,Boolean elements in Lukasiewicz algebras, Proc. Japan Acad., 4 1 (1965) 670-675. R.CIGNOLI, Representation of Lukasiewicz and Post algebras by continuous functions, Colloq. Math., 24 (1972) 127-138. R.CIGNOLI, Coproducts in the categories of Kleene and three-valued Lukasiewicz algebras, studia Logica, 38 (1979) 237-245. P.M.COm, "Universal Algebra", Revised Edition, D.Reide1, Dordrecht, 1981. J.DIXMIER, "C*-algebras", North-Holland, Amsterdam, 1977. E.G.EFFROS, "Dimensions and C*-algebras", CBMS Regional Conf. Series in Math., vol. 46, Amer. Math. Soc., Providence, R.I., 1981. E.G.EFFRos, D.E.HANDELMAN, C.L.SHEN,Dimension groups and their affine representation, Amer. J. Math., 102 (1980) 385-407. E.G.EFFROS, JAOSENBERG, C*-algebras with approximately inner flip, Pacific J.Math., 77 (1978) 417-443. E.G.EFFROS, C.L.SHEN, Approximately finite C*-algebras and continued fractions, Indiana J . Math., 29 (1980) 191-204. G.A.ELLIOTT, On the classification of inductive limits of sequences of semisimple finite-dimensional algebras, J. Algebra, 38 (1976) 29-44. G.A.ELLIOTT, On totally ordered groups, and KO, Lecture Notes in Math., vol. 734, pp. 1-49, Springer-Verlag, Berlin, 1979. G.G.EMcH, "Mathematical and conceptual Foundations of 20th CentuIy Physics", North-Holland, Amsterdam, 1984.
76
D. Mundici
26. T.FACK, O.M&CHAL, Applications de la K-thCone algtbrique aux C*-algbbres, Lecture Notes in Math., vol. 725, pp. 144-169, Springer-Verlag, Berlin, 1979. 27. O.FRINK, Review of Bosbach's article [8], Mathematical Reviews 83m06021. 28. J.G.GLIMM, On a certain class of operator algebras, Trans. Amer. Math. Soc., 95 (1960) 318-340. 29. K.R.GOODEARL,Notes on Real and Complex C*-algebras, Shiva MathSenes, vol. 5, Birkhauser, Boston, 1982. 30. R.GRIGOLIA, Algebraic analysis of Lukasiewicz Tarski's n-valued logical systems, In: Selected Papers on Lukasiewicz Sentential Calculi (R.Wi?jcicki and G.
31.
32. 33. 34. 35. 36. 37. 38.
39. 40. 41.
Malinowski, Eds.) pp. 8 1-92, Polish Acad. of Sciences, Ossolineum, Wroclaw, 1977. P.HAJEK,J.J.VALDES,Algebraic foundations of uncertainty processing in rulebased expert systems, Math. Inst. of the Czech. Acad. of Sciences, Report n. 28 (1987), 48 pp. N.JACOBSON, "Basic Algebra I, II", W. H. Freeman and Co., New York, 1985. S.H.KYE, Subhomogeneous AF C*-algebras and their Fubini products I, 11, Proc. Amer. Math. Soc., 94 (1985) 249-253, and ibid., 97 (1986) 244-246. P.MANGANI, On certain algebras related to many-valued logics, (Ital.), Boll. Un. Mat. Ital. (4), 8 (1973) 68-78. J.MILNOR,"Introduction to algebraic K-theory", Annals of Math. Studies, vol. 72, Princeton, N.J., 1972. G.C.MOISIL,"Essais sur les logiques non Chrysippiennes", Editions de 1'Acad. de la RCpublique Socialiste de Roumanie, Bucarest, 1972. A.A.MONTEIRO,Sur les algkbres de Heyting symktriques, Portugaliae Math., 39 (1980) 1-237. D.MWDICI,Mapping abelian I-groups with strong unit one-one into MV algebras, /.Algebra, 98 (1986) 76-81. D.MUNDICI, MV algebras are categorically equivalent to bounded commutative BCK algebras, Math. Japonica, 31 (1986) 889-894. D. MUNDICI, Interpretation of AF C*-algebras in Lukasiewicz sentential calculus, J. Functional Analysis, 65 (1986) 15-63. D.MUNDIC1, Every abelian I-group with two positive generators is ultrasimplicial, J. Algebra, 105 (1987) 236-241.
The C*-Algebras of Three-Valued Logic
I1
42. D.MUNDICI,Satisfiability in many-valued sentential logic is NP-complete, Theoretical Computer Sci., 5 2 (1987) 145-153. 43. D.MUNDICI, Bounded commutative BCK algebras have the amalgamation property, Math. Juponica, 32 (1987) 279-282.
44. D.MUNDICI,The Turing complexity of AF C*-algebras with lattice-ordered KO, Lecture Notes in Computer Sci., vol. 270, pp. 256-264, Springer-Verlag, Berlin, 1987. 45. D.MUNDICI,The derivative of truth in Lukasiewicz sentential calculus, Proc. VII Latin Amer. Symp. on Math. Logic, Contemporary Math., vol. 69, pp. 209-227, Amer. Math. Soc., Providence, R.I., 1988. 46. D.MLJNDICI,Free products in the category of abelian 1-groups with strong unit, J.Algebra, 113 (1988) 89-109. 47. D. MUNDICI,Farey stellar subdivisions, ultrasimplicial groups, and KO of AF C*algebras, Advances in Math., 68 (1988) 23-39. 48. A.RosE, J.B.RossER, Fragments of many-valued statement calculi, Trans. Amer. Math. SOC., 87 (1958) 1-53. 49. G.L.SEWELL,Quantum Theory of Collective Phenomena, Clarendon Press, Oxford, 1986. 50. A.TARSKI,J.LUKASIEWICZ, Investigations into the Sentential Calculus, In: Logic, Semantics, Metamathematics, pp. 38-59, Oxford University Press, 1956. 5 1. J.VON NEUMANN, Mathematical Foundations of Quantum Mechanics, Princeton University Press, 1955.
...
...
.
This Page Intentionally Left Blank
Logic Colloquium ’88 Ferro, Bonotto, Valentini and Zanardo (Editors) 0 Elsevier Science Publishers B.V. (North-Holland), 1989
19
S o m e Problems and Results in the
Theory of Actually Computable Functions (preliminary abstract)
WOLFGANG
MAASS* AND THEODORE A. SLAMAN**
We consider subsets A of (0,l)’ (the set of all finite binary strings I). According to Church’s thesis A is computable (meaning that there is a n algorithm for deciding
“I
E A?”) if and only if A is recursive. Because of the advance of
computing machinery it has also become of interest to find a precise mathematical definition which captures the intuitive notion that A is actually computable (meaning that there is an algorithm for deciding ‘‘z E A?” so that this computation can actually be carried out if 1x1, the length of
I, is not “too large”). It has become common in
computational complexity theory to consider the class
as an adequate mathematical model for the class of “actually computable” sets (to be
more precise: if one considers not only deterministic algorithms but also randomized algorithms whose output may be incorrect with an exponentially small probability, then one may replace P by the potentially larger class BPP; e.g. P R I M E S is known to be in BPP but it is open whether P R I M E S E P ) . , The complexity classes D T I M E ( t ( n ) )that occur in the definition of P are somewhat dependent on the considered computational model (although P isn’t). For the *Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL. 60680. Written under partial support by NSF-Grant CCR 8703889, while visiting the Department of Computer Science at the University of Chicago. **Department of Mathematics, University of Chicago, Chicago, IL. 60637. Written under partial support by Presidential Young Investigator Award DMS-8451748 and NSF-Grant DMS-8601856.
W. Maass and T.A. Slaman
80
random access machine (RAM), the model on which we focus in this paper, one defines for arbitrary functions t : N + N+:
A E D T I M E R A M ( ~ (:*there ~ ) ) exists a (deterministic) RAM R that decides “z E
A?” so that R is of time complexity O ( t ( n ) )
(i.e. there is a constantlc z E {O,l}*,
> 0 s.t., for every input
R executes at most I{ . t(lz1) instructions).
The RAM is the model of choice for most algorithm designers because its instructions and its computation time (= number of instructions that are executed) correspond quite well to those of a real machine (see e.g. Aho, Hopcroft, Ullman [AHU]). Turing machines are somewhat less realistic because they are confined to specific data structures (the tapes) which have artificially large access time (because in order to read a bit far away on a tape the respective head has to travel over all cells in between).
Very roughly one can view a RAM as a stronger version of a Turing machine where the “head” may jump in one step to an arbitrary “cell” (called register on a RAM) whose address has been specified. Furthermore in order to allow that such address be stored in a single register, one allows that a register may hold an arbitrary integer (however one linits the allowed arithmetical operations on register contents so that after t computation steps all integers stored in registers of the RAM have bit length
5 t ) . For
a more detailed definition of a RAM we refer to [CR], [AHU], [MY], [PI. A
reader who is more familiar with Turing machines should note that the only deviating feature of RAM’S that we will exploit in the subsequent analysis is the fact that a RAM
allows more sophisticated diagonalization-algorithmswith regard to computation time
(in particular a fine hierarchy theorem is known for computation time on RAM’S (see below), whereas the corresponding statement for multi-tape Turing machines is still open - because for k 2 3 it is not known whether every k-tape Turing machine can be simulated by a Turing machine with k
-
1 tapes in linear time.
As supporting evidence f o r this thesis (that P is the class of actually computable
sets) we would like to point to - the mathematical simplicity of this definition -
its robustness with regard to changes of the computational model (e.g. Turing machines, random access machines, uniform circuit families)
The Theory of Actually Computable Functions
-
81
the ”test of time” (about 20 years of intensive work in computational complexity theory and algorithm design have so far not provided strong arguments against this thesis). Among the problematic poinb of this thesis we would like to mention:
- constant factors in front of the considered polynomial time bounds (as well as the
size of the programs) are ignored (consequently theory and praxis disagree about the feasibility of certain algorithms; however it appears to be very hard to take these aspects into account and still preserve the simplicity and robustness of the mat hematical definition). - its focus on worst case time bounds, as opposed to the practically more important
average case analysis (this point can be addressed in a mathematical model if one can specify which input distribution is “realistic”). Let us assume then that P is an adequate model for the class of “actually computable sets”. There are several aspects of P that can then be studied: we can compare it to other complexity classes (e.g. NP, EXPTIME, PSPACE); we can examine specific problems to see if they are in P ; we can look for internal structure in P ; we can compare the structure of P with familiar recursion theoretic classes (recursive sets, r.e. sets, arithmetical sets, sets recursive in objects of higher types, a- and p-recursive sets). Our intention is to look for the fine structure of P , which may shed light on its other aspects as well. In this abstract we focus on one facet of the fine structure of
P , the classification of sets in P according to their exact time complexity. Of course quite a bit is known already about the fine structure of P. Thus before we describe our results we would like to give for non-experts in complexity theory an idea of the type of results that have been achieved so far. i) Immerman and Moschovakis have shown that
A E P w A is uniformly inductively definable over finite structures with linear order.
This equivalence leads to results about the fine structure of P from the point of view of definability ([F], [I], [MI, [R]). ii) Hierarchy Theorems. The first hierarchy theorem was proven by Hartmanis and Steams [HS]for Turing
W.Maass and T.A. Slaman
82
machines. For random access machines (RAM’S), the model on which we will focus in this paper, Cook and Reckhow (CR] have shown: Let f , g : N -+ N+ be functions f (n> such that f(n),g(n) 2 n, sup - = 03, and f is time constructible on a RAM n
(i.e. the map In c)
An)
where both the input n and the output f ( n ) are given in
unary representation, can be computed in time O ( f ( n ) )on some RAM). Then
D T I M E R A M(f(n)) D T I M E R A M(g(n)). It turns out that all explicitly defined functions that are actually used to estimate the computation time of algorithms are in fact time constructible on a RAM. For example the hierarchy theorem implies that
D T I M E R A M (C ~ )D T I M E R A M (log* ~ . n) C f
f
...
C D T I M E ~ ~ ~ ( n . l o g l ocg D n )T I k f E ~ ~ ~ ( n . l o g n ) f
f
NOTE: It has been shown that the hierarchy theorem does not hold for arbitrary recursive f,i.e. the time-constructability-assumptionfor f is essential [HH]. iii) Concrete positive results, e.g.
ADDITION E DTIME(n), M U L T I P L I C A T I O N E D T I M E R A M ( loglogn) ~. [SS], L I N E A R P R O G R A M M I N G E P (K] Of course, there exist an enormous number of results of this type. iv) Comparisons between computational models, e.g.
DTIMETuring
rnachine(t(n))
G
DTIMERAM(t(lZ)/lOgt(n)),for t ( n )2 12 ’10gfl [PI. On the other hand one has not been able to show that A $! D T I M E R A M ( for ~) any “natural” set A E P (in fact not even for any “natural” set A E N P ) , which is perhaps the most prominent
in our knowledge about the fine structure of P
(“natural” means here that A should have some independent mathematical significance (MULTIPLICATION is a good candidate), in particular A should not just be the result of a diagonalization-argummt.)
The Theory of Actually Computable Functions
83
Remark. In the following we wiil only consider time complexity on RAM’S and we write D T I M E ( f ) instead of D T I M E R A Mf( ) . The preceding points indicate that an important structural property of P (which has no analogue in the more traditional structures of recursion theory) is the fact that we have a natural hierarchy for sets A E P , given by the complexity classes D T I M E ( f ) for f bounded by a polynomial. We can classify the sets A E P according to their time complexity, i.e. according to their associated set of time bounds
Thus we define A < C B ( “ Ahas time complexity less or equal to the time complexity of B”) by:
A
A =c B
:($ V f E
T ( A E D T I M E ( f ) (j B E D T I M E ( f)).
We will refer to the equivalence classes of
=C as
c o m p l e z i t y types.
The set T of considered time bounds is defined as follows:
T
:= { f : N
3
N+ I f ( n ) 2 n, f is time constructible on a RAM, f ( c .n ) = O ( f ( n ) )for every c E N+, except for finitely many arguments f agrees with a function g that is concave n m
i.e. Vn > r n ( g ( n ) 2 -g(rn))}.
Remark. This definition of T has been chosen so that it is large enough to contain all functions that are actually used to estimate the time complexity of algorithms, on the other hand it is not too large in order to avoid some pathological phenomena (e.g. gap theorems [HW], [HH] and non-closure of time complexity classes under linear time reduction). Note that T is closed under variation on finitely many arguments, i.e.
f E T , f =* g and g(n)
2 n implies g E T .
W.Maass and T.A. Sbrnan
84
Definition. We say that A is linear time reducible to B ( A SlinB ) if there is a RAM
A?” in time O((Z(). We assume here that a RAM with oracle B has a separate infinite array of query-
with oracle B that decides
‘‘2
E
registers into which it can write any string y € {0,1}* (one bit per register) for which it wants to find out whether y E B. After each execution of the additional instruction ORACLE QUERY the answer to this question can be found in the first register (and all query registers are erased). Note that
is transitive. One calls the equivalence class of
=lin
linear (time)
degrees.
Remark. The main interest in linear time reductions arised from the fact that A
B implies that A
llin
B (i.e. the time complexity of A is less or equal to that of B ) . This
implication has provided the only successful means to compare the time complexity of sets A and B. We will also use it in this way, for example to show that every
complexity type C contains a sparse set (Corollary 8). (On the other hand we are forced to provide in Theorem 1 a different method to show that A
=C
B when we
given an example of sets A and B of the same time complexity but incomparable linear time degree.) In this way one can show for example that the time complexity of deciding whether an undirected graph has a path from a distinguished vertex s to a distinguished vertex
t is less or equal to that of the corresponding problem for directed graphs. Similarly one can show that the circuit value problem (CVP) with the requirement that the gate records in the input are sorted according to gate numbers has exactly the same time complexity as CVP without this requirement (the reduction from the latter to the former version exploits that a RAM can sort in linear time). Less obvious linear time reductions have been constructed for example by Dewdney [D] (he shows in particular that SATISFIABILITY =lin
=lin
SET-SPLITTING and that BIPARTITE MATCHING
=lin
3 - COLORABILITY VERTEX CONNEC-
TIVITY (“are there 2 k disjoint uv-paths in G, for u , u , k given”); note that the latter problems are known to be in P ) and Grandjean [Gl], [G2] (he shows that some natural NP-complete problems B are not in DTIMET,,;,,
A
ma&ine(TL)
by showing that
B for every A E N T I M E ( n ) ) .
T h e o r e m 1. Every complexity type C
# 0 contains incomparable linear time degrees.
In order to prove this theorem we construct for an arbitrary given complexity type
The Theory of Actually Computable Functions
C # 0 two sets A , B E C with A
lljnB (ie.
A
$lin
B and B
&in
85
A ) . The only nontrivial
part of this construction is to find suitable requirements whose satisfaction implies that the constructed sets A,B are of the given complexity type C. It is quite easy to find such requirements if C is a principal complezity type, where we call a complexity type
C principal if there exists a time bound fc E T s.t. for any A E C
(i.e. fc is an “optimal time bound” for sets A E C). The Cook-Reckhow construction of a diagonalizing RAM [CR] provides, for every
f E T, a set A whose complexity type C is principal and where jc
:= f is an ‘‘optimal
time bound” for C. On the other hand Blum’s speed-up theorem ([B], [MY]) implies that there are sets
A E P whose complexity type C is non-principa2, e.g. one can construct a set A for
In order to construct sets A of an arbitrary given complexity type C (principal or Eon-principal) we use as a tool characteristic T-sequences (which are certain effective sequences of indices). We will show in Lemma 2 that one can associate with every complexity type C a characteristic T-sequence ( t i ) i E N s.t.
{f E T(A E D T I M E ( f ) }= {f E 2’132 for every A E C (we say then that
“ ( t i ) i E ~is
E N(f(n) = O ( { t , } ( n ) ) ) }
This fact is
characteristic for C”).
complemented by Lemma 3, where we show that for any characteristic T-sequence (ti)iEN
there is a complexity type c s.t.
( t i ) i E ~is
characteristic for C. Furthermore
the construction method of Lemma 3 reappears in the proof of Theorem 1 to ensure that the constructed sets A , B are of the given complexity type C. We arrange that their sets of time complexity bounds are characterized by the same T-sequence that is characteristic for C. Thus, we avoid the usual device of achieving A =c B via showing that A
=lin
B.
Definition.
( t i ) i 2 ~ ~N
is called a characteristic T-sequence if t : i
Ht
i
is recursive
and a) V i E N ( { t i } E T and program
ti
is a witness for the time-constructibility of
{ti})
W.Maass and T.A. Slaman
86
b) V i ) n E N ( { t i + l } ( n )5 { t i } ( n ) ) . L e m m a 2. (“inverse of the speed-up theorem”). For every recursive set A there exists a characteristic T-sequence ( t i ) i E p ~such that Vf E T ( A E D T I M E ( f ) w 32 E N(f(n) = Q ( { t i } ( n ) ) ) ) .
L e m m a 3. (“refinement of the speed-up theorem”).
For every characteristic T-
sequence ( t i ) i E N there exists a recursive set A such that
Vf E “ ( A E D T I M E ( f)
* 32 E N(f(n) = Q ( { t i } ( n ) ) ) ) .
Remark. The proof of Lemma 3 is somewhat more delicate than the usual proof of the speed-up theorem because {t,+l} need not be a strictly slower growing function { t i } (in fact we have in general that for many i both functions are the same, and {t,+l}may even have a larger time-constructibility-factorthan { t i } ) . In both lemmata
than
we exploit that our concepts are rather concrete (in particular that we consider only time constructible functions and a specific machine model). Idea of the proof of T h e o r e m 1. Let
(ti)iEN
be a characteristic T-sequence for
the given complexity type C. Construct sets A , B s.t. both Alli,B and for all f E
T the set A (or the set B ) is in D T I M E ( f ) iff f(n) = O ( { t i ) ( n ) )for some i E
N. Use the priority method to handle conflicts between the resulting two types of
0
requirements.
Remark. Although it is the main goal of our approach to study the fine structure of P , it also yields some new results (and open problems) about polynomial time
reductions. In particular it allows to make the “upper bounds” of the constructed sets more precise (instead of making the sets just recursive). As a sample we give the following result, which is proved with the same arguments as Theorem 1. T h e o r e m 4. A complexity type C contains sets A , B that are incomparable w.r.t. polynomial time reductions if and only if C
P.
One may ask whether it can happen that two sets A , B of the same complexity type have “no common information”, i.e. that they form a minimal pair w.r.t. linear time (resp. polynomial time) reductions.
The Theory of Actually Computable Functions
87
T h e o r e m 5. There are recursive sets A, B of the same complexity type C such that
A, B form a minimal pair w.r.t. linear time (resp. polynomial time) reductions. The proof of this result combines methods from Cohen forcing and from the proof of Lemma 3 in a finite injury priority argument. It is not known whether such a pair of sets exists in every complexity type. It would be of some interest to characterize the structure of the linear time degrees inside a given complexity type. The following result shows that these structures are not all isomorphic (it also shows that linear time degrees play a significant role in the analysis of complexity types). T h e o r e m 6. A complexity type C has a largest linear degree if and only if C is principal (in fact if C is non-principal then it does not even contain a maximal linear degree). Finally we would like to mention briefly two other concepts that are of interest for the fine structure of P (although they have no direct analogue in classical recursion theory): sparse sets and the padding operator. Definition. A C {0, I}' is sparse if n
H
card(An(0,l)") is bounded by a polynomial.
Definition. For arbitrary functions s E T we associate with every set A C {0,1}* the s-padding P,(A) := { Z # O ~ ( ~ ~E ~A} ) )of Z A. Note that P, is in fact well-defined on complexity types (i.e. A =c B implies P,(A) = c P,(B)) and that P, projects complexity classes downwards:
A E D T I M E ( f ) =+ P,(A) E D T I M E ( f
o s-').
T h e o r e m 7. ("inversion of the padding operator"). Fix any s E T.Then the map
C3A
H
P , ( A ) E C'
from the complexity types into the complexity types is onto. Corollary 8. Every complexity type C contains a sparse set. In order to derive this corollary from Theorem 7 one considers the padding function s ( n ) = 2" and exploits that there exists for every set A S {0,1}* some set B E {1}*
(thus B is sparse) with +(A)
=ljn
B.
W.Maass and T.A. Slaman
88
Remark. It is interesting to compare Corollary 8 with Mahaney’s result [Ma] that P # N P implies that there is no NP-complete sparse set. Finally we would like to point out that there are of course many other interesting aspects of the fine structure of P which we have not even mentioned here (some of the other aspects will be discussed in a forthcoming paper).
Some open problems about the fine structure of P : 1. Is there any “natural” A E P s.t. A $ D T I M E ( n ) ?
2. Are there relationships between the mathematical structure of a set A (e.g. combinatorial properties of a set A , or other “extensional” properties) and its time complexity?
3. What is the structure of linear time degrees inside a complexity type C? In particular: are those structures isomorphic for all principal (resp. non-principal) complexity types C? 4. What is the structure of linear time degrees inside a complexity class D T I M E ( f)?
In particular: does this structure depend on f (for f superlinear)?
5. Are there besides the padding operators any other interesting operators on P? In particular: is there some interesting notion of a “jump”? 6. Are there sets A , B that are in the same complexity type (i.e. A and B have the same deterministic time complexity) but which have different nondeterministic time complexity (or: different space complexity)?
The Theory of Actually Computable Functions
89
REFERENCES [-4HU] A.V. AHO,J.E. HOPCROFT,J.D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley (Reading, 1974).
[B] M. BLUM,A machine-independent theory of the complexity of recursive functions, J . ACM 14(1967), 322-336.
[CR] S.A. COOK, R.A. RECKHOW, Time-bounded random access machines, J . Comp. Syst. SC.7(1973), 354-375. [D] A.K. DEWDNEY, Linear time transformations between combinatorial problems, Internat. J . Computer Math. 11(1982), 91-110. [F] R. FAGIN, Monadic generalized spectra, Zeitscbrift f. Math. Log& 21(1975), 89-96. [GI] E. GRANDJEAN, A natural NP-complete problem with a nontrivial lower bound, SIAM J. Comp. 1988 (to appear). (G2] E. GRANDJEAN, A nontrivial lower bound for an N P problem to automata, preprint
(1987).
[HS] J. HARTMANIS, R.E. STEARNS, On the computational complexity of algorithms, Trans. AMS 117(1965), 285-306. [HH] J. HARTMANIS, J.E. HOPCROFT,An overview of the theory of computational complexity, J . ACM 18(1971), 444-475. [I] N. IMMERMAN, Languages which capture complexity classes, Proc. of the 15th ACM Symp. on the theory of computing, 1983, 347-354. [I<] L.G. KHACICIAN, A polynomial algorithm for linear programming, Soviet Math. Doklady. 20(1979), 191-194.
[MY] M. MACHTEY,P. YOUNG, An Introduction to the General Theory of Algorithms, North-Holland (Amsterdam, 1978). Sparse complete sets for N P : solution of a conjecture of Berman and [Ma] S. MAHANEY, Hartmanis, J. Comp. Syst. Sc. 25(1982), 130-143. [MI Y.N. MOSCHOVAKIS, Abstract recursion as a foundation for the theory of algorithms, preprint (1983).
[PI W.J. PAUL,Komplexitatstheorie, Teubner (Stuttgart, 1978).
[R] M.
DE ROUGEMONT, Uniform definability on finite structures with successor, Proc. of the 16th ACM Symp. on the theory of computing, 1984, 409-417.
[SS] A. SCHONHAGE, V. STRASSEN, Schnelle Multiplikation grosser Zahlen, Computing 7(1971), 281-292.
This Page Intentionally Left Blank
Logic Colloquium '88 Ferro, Fkmotto, VaIentini and Zanardo (Editors) 0 Elsevier Science Publishers B.V. (North-Holland), 1989
91
Kleene-spaces Dag Normann The University of Oslo, Norway
A bstracr
A Kleene space is an abstract version of Kleene's continuous functionals of some type. A Kleene space consists of a set of formal neighbourhoods with an ordering and a consistency relation, and a set of associates of total objects. The associates are total with respect to certain "questions" represented by chains of mutually incomparable neighbourhoods. Each neighbourhood is nonempty, which is demonstrated by the extension associate, considered as a part of the Kleene space. A transfinite hierarchy of Kleene spaces is constructed, the construction is based on the principal constructors: Function space ;well founded tree space ;iteration of a constructor over a well founded tree and product of thus parameterised families of spaces.
1. Introduction The continuous or countable functionals were independently introduced by Kleene [ 1 ] and by Kreisel [ 2 1. In the recent literature they are seen as a type structure ( Ct(k)]ke N starting with Ct(0) = N and letting Ct(n+l) be a certain set of continuous maps from Ct(k) to N. Kleene showed that the type structure of continuous functionals is a natural domain for recursion theory. Type theory is also used as a semantics for certain programming languages, typed h-calculus etc.These applications involve notions of dependent types and of transfinite types. The key is that types will represent propositions and the elements of the types will represent proofs of these propositions. In this paper we will construct a transfinite hierarchy of types of continuous functicnals.
D.Normann
92
One main reason for doing this is to see how the fine structure of the finite level continuous functionals can be adjusted to transfinite levels. One basic aspect of the continuous functionals is that it is only the total objects that matter. This means that a formal neighbowhood is only of interest as long as it contains some total object. Another basic aspect is the effective version of the aspect above; when a formal neighbowhood is nonempty we can uniformly find an element of it. This uniform selector of an element is called rhe extension map. A third aspect, implicit in Kleene's paper and explicitly used in later work on the subject ( e.g. in Normann[ 3 ] ) is the notion of the trace of a functional. The trace
% is a
function hQ:N+ N that is computable in Q and that uniquely determines Q. It is defined by carefully restricting Q to some countable dense set. The trace maps must be seen as technical tools and not as an intrinsic part of the type structure. Thus our real project will be to find a transfinite hierarchy in the spirit of Kleene where we have uniform extension maps, and then to see what kind of recursion theory this hierarchy will possess. In this paper we will concentrate on describing the constructors and possible hierarchies. In order to have control over the transfinite levels of our type structure we need to take an abstract approach and to discuss the operators defining our hierarchy in a general setting. However, in order to discuss totality in a general setting we need some discussion of the concept of totality itself. In Normann[ 4 ] we are discussing this concept in some depth. Our main definition, that of a Kleene space, is rooted on the discussion in [ 4 ] One prime ingredient will be the chains to be defined later. They will represent ways of answering questions, and technicly they will replace the more ad hoc trace functions. 2. Abstract Kleene spaces.
2.1 Definition a) A weak information domain is a partial order ( P , < ) with a least element Ip such that for all p E P, the set ( q E P I q < p ] is finite. b) If ( P , < ) is a weak information domain and p , q E P then p and q are
consistent if p and q have a joint extension. c) A weak information domain P is an information domain if each finite set of pairwise consistent elements has a unique least upper bound in P ( I p will by
KIeeneSpaces
93
convention be the least upper bound of the empty set ) .
2.2 Remark The formal neighbowhoods used in Kleene's or Kreisel's original papers with the natural ordering will not form an information domain because there may be infinitely many predecessors. As will be seen from the constructions below there are alternative orderings on these domains turning them into information domains. 2.3 Definition Let ( P ,< ) be an information domain. a) Let a c P . We let a € Up , theuniverse of P , if i) The elements of a are pairwise consistent. ii) a is closed under the least upper bounds of finite subsets. b) Let C c P . Wesay that C i s a chain if i) If p and q are two different elements of C ,then p and q are < - incomparable. ii) Consistency restricted to C is an equivalence relation. c) ( I ] is called the dummy chain. 2.4 Remark
The elements p of P will model real world procedures giving answers to certain questions. The questions will be represented by the chains, in the sense that a question is represented by all ways to answer it. Consistency means that two procedures are compatible, i.e. they can be seen as parts of the same procedure. The chains representing a question will consist of all the minimal procedures answering that particular question. Our condition that consistency is an equivalence relation on a chain can be seen as a technical condition, but it also reflects the nature of the procedures we have in mind. This is discussed in more detail in [ 4 1. The elements of Up are the ideal procedures, the natural elements of a completion of P.
2.5 Definition Let P be an information domain. a) Let p E P an let C be a chain. p meets C if there is a q 5 p in C. b) Let a E Up and let C be a chain. a meets C if there is an element of cx that
D.Nomzann
94
meets C. We are now ready to define the notion of a Kleene space. On the basis of the discussion in 2.4 our definition of totality is the only natural one. Notice that every nonempty a
are met by the dummy chain. 2.6 Definition Let P be an information domain.
Up is dense if each p E P is an element of a for some a E A.
a) A set A
b) A set C of chains is dense if the dummy chain is in C and if for all p , q E P, if p and q are inconsistent then there is a C E C, a p i I p in C and a ql I q in C such that p1 and q1 are inconsistent. 2.l.Definition
a) A Kleene space isastructure X = ( P x ,C h X , e x t x , t x such that i) PX is a countable information domain. ii) ChX is a dense set of chains in P.
iii) If p
E
P then extX( p ) E ASX , which is defined by
A s x = [ a € Up la meets C forall C E C h X ) iv) If p , q is an inconsistent pair from P then tX( p ,q ) E C h x demonstrating that C h x is a dense set of chains, at least with respect to the pair p , q ( Cfr. 2.6.b ). b) The frame of the Kleene space X is the triple ( PX ,extx , tX ) , while PX is called the domain of X. c) If a , p
E
Up then a and p a r e consistent if a u p is consistent.
We leave the proofs of the following trivial facts about Kleene spaces for the reader:
2.8 Lemma Let X be a Kleene space. a) If a E A s x ,if a c p and if p E Up then p E ASX. b) If A P is a finite consistent set then A is contained in some a E Asx. c) Consistency is an equivalence relation on ASX.
KleeneSpaces
95
d) I f a E A s X a n d p c a then P = [ q E a l p l q ) E A s X . It is not difficult to find examples of Kleene spaces. We will give two examples here. Other examples will grow from these two using our general constructors. Our basic examples are that of the natural numbers and that of a singleton.
2.9 Examples Let P N = ( I , ~ I n € N ) Let I S l , l l n and n l n f o r a l l n E N. There are just two chains, N.and the dummy chain. Then A s N = ( [ n ) , [ l , n ) I ~ E N ] The extension maps extN and the map tN are trivial to construct. Notice that extly( I ) can be chosen fairly freely, and that each choice is equally natural. We may assume that extN( I) = { 0 ,I ), but we will not make any use of the assumption. Let Po = [ I ). Let Cho consist just of the dummy chain.Then ( I ) is the one and only total object. The one extension map is obvious and there is no need for t-maps. In our hierarchies this singleton space Xo will be the sole basis for the construction. We will show that any Kleene space will permit a set of trace functions. From now on we will drop the subscripts when they are inessential. 2.10 Lemma
Let ( P ,Ch ,ext , t ) be a Kleene space. Then there is a family of trace functions h(p):N 'undefined' ) such that
+ N u { u ) ( where
i) P 5 q and h(p)(n) E N 3 h(q)(n) = h(p)(n) ii) If p and q are consistent, if h(p)(n) E N and h(q)(n)
E
u=
N then h(p)(n) =
h(q)(n). ( We say that h(p) and h(q) are compatible when this condition is satisfied. ) ii) If p and q are inconsistent then h(p) and h(q) are not compatible. iv) If a E As then Vn3pc a ( h(p)(n) Let h(a)(n) be this unique value.
E
N)
96
D. Normann
Proof k t ( ( pi ,qi ) )i E~ be an enumeration of all inconsistent pairs of elements in P. Let ( ri ) i E~ be an enumeration of P. We let h(p)(i) = u unless there is an s I p in t(fi ,qi ). If there is such an s ,we let h(p)(i) = pj( r, E t( pi ,q ) A rj is consistent with s ) We have to verify properties i) - iv) , noticing that u) also implies that h@) is well defined. i) is trivial, ii) is a consequence of the fact that consistency is an equivalence relation on t( pi ,qi ), so when p and q are consistent they will meet t( pi ,qi ) in the same equivalence class, and h(p)(i) is essentially the least element in the equivalence class met by p. If p and q are inconsistent there is an i E N such that ( p , q ) = ( pi ,qi ). Then the values t(p)(i) and t(q)(i) are incompatible. This verifies iii). If
a E As then a in particular meets all t(pi ,qi ). This shows iv). The trace functions are useful when one wants some recursion structure on the set of equivalence classes of associates. They map the associates into
NN identifying
elements of the same equivalence class. They can also be used to define sequences of extension maps converging to the maximal element of each class. We will now give the fiist constructor of Kleene spaces, It is mvial to construct the disjoint union ( the sum ) and the Cartesian product of two Kleene spaces. For the sum we need that the set of chains is nonempty, and this is uniformly secured by insisting on the presens of the otherwise harmless dummy chain. We will show how to construct the space of continuous functions from one Kleene space to another.
Kleene-Spaces
97
D ~ , ~ = ( I ( P . ~ ) I I P E ~ A ~ E c ) We let Chz be the set of all Da,c together with the dummy chain.
Iz is just the empty set. If 71 = (PI , q 1 1 , . . . , ( Pn , qn 1 1 and 72 = I (ri , s l 1 , . . . ,( r, Clearly
4.
,Sm ) are inconsistent we may pick i 5 n ,j Im such that pi and r, are.inconsistent.
Let a = extX( 1.u.b.I pi, rj ) ) and let C = ty( qi sj ). Let tz( z1 ,‘ 2 ) = D,c, 5 . Let T = [ (pi , q1 ) ,. . . , ( pn ,qn ) ). Let E l , . . . , Ek be the PX-chains
tx( pi ,pj ) such that qi and qj are inconsistent. Let A = ( p E P I p meets all E l , . . . , Ek ). For p E A , let Bp = ( i I pi is consistent with p ) and let qp = l.u.b.(qi I i E Bp 1. Let 6 = zu( ( r , s ) l r E A A S Ee x t y ( e ) ] Let y = extz( z ) be the set of all finite subsets of 6.
Then y will be an element of ASZ. We leave the proof of this fact for the reader. We will end this section by justifying why we call the space Z constructed above the function space. If y E ASZ we may define an operator fr as follows: q e f$a)ifthereisaset
z in yanda P E a suchthat ( p , q ) E z.When a i s a
consistent set in P, the elements of f$ a ) will be painvise consistent. We let F$a) be the closure of f$a) under least upper bounds. If
a is in Asx then F+a) is in
Asy. Moreover, if a1 and a2 are consistent then F$al) and F$a2) are consistent, so Fy maps equivalence classes into equivalence classes. Finally, if we give the set of equivalence classes in ASX and Asy their natural topologies, the Fr -maps will represent exactly the total continuous maps. We leave the verifications of these claims for the reader. 3. Parameterisations
One way to construct new Kleene spaces will be to form infinite products of uniformly parametensed families of Kleene spaces. In this section we will show how to represent such parameterised families and how to construct the products. 3.1 Dejinition Let Q be an information domain. By a subdomain Q1 of Q we mean a subset of Q such that
D.Normann
98
i) If q e Q1 and r < q thenre Q1 ii) If A E Q1 is a finite consistent set, then l.u.b.( A ) E Q1
3.2 Definition a) A uniform parameterisationof information domains will consist of two information domains P and Q together with a function A mapping P into subdomains of Q such that p i Ip2
A( p i ) is a subdomain of A( p2 ).
We will write Qp for A( p ). If a E U p we let
Q1 be the union of the
QP for
p E a. b) If P , Q and A are. as above, then a uniform object is a map A with domain P such that A( p ) is a subset of Qp that is pairwise consistent and closed under 1.u.b.k of finite sets.
3.3 Definition A uniformparameterisationof Kleene spaces will consist of a Kleene space
X = ( P , Ch ,ext ,t ) , an information domain Q with a uniform parameterisation A , Kleene spaces Ya with domain Q a for each a E Asx together with two maps E and T suchthat i) If q E Q then E( q ) is a uniform object such that 1. q E E( q )( p ) whenever q E Qp.
2. exty,( q ) is the union of all E( q )( p ) for p E a when q E Qa.
ii) If 91 and 92 are inconsistent elements in Q then T( q1 ,42 )( p ) is defined and is a chain in Qp whenever q1 , E Qp, and then there are inconsistent r1 5 q1 and r2 I
such that '1
E
T( q i .q2 )( P 1 and '2 E T( q i , q 2 )( P ).
For each a E Asx we have that t y a ( q1 , q 2 ) is the union of all T( q1 , Q )( p ) for p c a when q1 , q 2 Qa. ~ The frame of the parameterisation will be the quintuple ( P , Q ,A , E , T ) while the domain will be the triple ( P , Q , A ).
3.4 Remark In this definition we see that the uniformity of the parameterisation only concerns the frames of the spaces. The most interesting objects in a Kleene space are the associates and the nonempty neighbourhoods. Since the class of associates may be of very high complexity, we do not want to restrict ourselves to a situation where they are given in a
Kleene-Spaces
99
uniform way. We need the uniformity on the part of the domains and the extension maps in order to preserve the recursive descriptions of some interesting sets of nonempty neighbourhoods. The tchains can be seen as a technical tool for defining extension maps in complex spaces, and thus we need to have a uniform control of these objects as well. The full set of chains will however be of arbitrary high complexity, and we will not expect the chains to be given in some uniform way. We will now construct the product of a uniformly parameterised family of Kteene spaces. The product will essentially consist of continuous maps sending an element
a E ASXto an element in Asy,. The uniform cibjects are natural candidates for these. 3.5 Definition be a uniformly parameterised family of Kleene spaces. We will Let X , ( Y a )ae adopt all the notation from above.
We will define the product space Z = n(aEX)Ya as follows: pz = ( ( PI 41 ,. . . ,( Pn ,qn ) I qi A( pi ) ,qi and qj are consistent when pi and p, are consistent and when i # j then Pi f Pj for 1 5 i j 5 n ). We order PZ as in the function space case. If Y E Upz then y determines auniformobject Ay by A$ p ) = closure(( q I 3 z y~3pYp( ( p’ ,q ) E z ) 1) where closure is closure under 1.u.b.k of finite subsets. If a E ASX and D E Chy, we let c D , a = ( ( ( p , q ) 11 q E A ( p ) , q E D and pEa) 1. We let ChZ be the set of all CD,a together with the dummy chain. The construction of the extension maps and the t-maps are almost as in the function space case: If ( (PI , 4 1 1 , . . . ( P n , q n ) and ~2 = ( (‘1, ~ 1 1 ,... , ( r m , sm I I are
.
inconsistent we may pick i 5 n ,j I m such that pi and r, are inconsistent. Let a = extx( I.u.b.( p i , r, ) ) and let D = T( qi Sj ). Let tz( ,T 2 ) = CD,,. Let 2 = ( (pi ,q1 ) , . . . ,( pn , qn 1 ). Let E l ,. . . , Ek be the PX-chains tX( pi ,p, ) such that qi and qj are inconsistent. k t A = ( p E P I p meets all E l ,. . . ,Ek ). For p E A , let Bp = ( i Ipi is consistent with p ) and let qp = 1.u.b. (q I i E Bp ).
D.Normann
100
Let 6 = z u ( ( r , s ) l r s A A S E E ( e ) ( r ) ] Let y = extz( z ) be the set of all finite subsets of 6. Then y will be an element of Asz. We leave the proof of this fact for the reader. This ends the construction of Z. Another natural constructor will be the sum of a parametensed family of spaces. In order to define this sum we seemingly need more uniformity on behalf of the chains, and then the iteration theorem of section 5 has an evasive behavior. 4 . The well founded tree spaces
In the previous section we defined acceptable parameterised families of Kleene spaces, and how to form the product of such. In this section we will construct spaces consisting of well founded trees of a certain kind. In the next section we will use these trees as indices for recursively defined Kleene spaces, and thus we will get a way of consuucting parameterised families of spaces.
If X and Y are two Kleene spaces we will construct the space Z = Tree( X ,Y ). The space will essentially consist of well founded trees with leaves from X and with branches indexed by Y.The aim will be to find the least solution of the equation Z=X+Y+Z and in this section we will let X ,Y and Z have this fixed meaning. 4.1 Definition Let PZ be the least set satisfying the set equation
P , = I I ) u ( O J X P x u ( 1 IXPy-jx The ordering is also defined inductively by
I l p forall p E PZ ( O , p ) < ( O , q ) in Pz if p l q in Px. ( 1 , p ) < ( 1 , q ) in P z if p l q in PY+z. Clearly PZ may be defined by induction:
Pzo = ( 1I u ( 0 JXPX p z n + l = pz, u ( 1 IXPY+Z,. This enables us to define the extension maps by induction as well:
Kleene-Spaces
101
We must define the chains before we can prove that the extensions really are associates in Z. 4.3 Definition Let a1 , a 2 , .
. . be an infinite sequence of associates in Y,and let
C1 , C 2 , . . . be
an infinite sequence of chains in X. Depending on these sequences we define the chains D i j in Pz. . for 1 5 i I j as follows J -1
Di,i = [ 0 )xCi Di,j+l = ( 0 Ixci u ( 1 IXP(ai Di+l,j+l) where p ( a , D ) = ( [ - ( P , q ) J l p E a A q € D
1
The following monotonicity property is trivial:
Let D, = u(D1,i I i E N ) 4.5 Definition Let Chz consist of the dummy chain together with all D,
as constructed above.
Before we end the definition of Z by defining tZ we will characterize the associates in Z and see that they really represent the wellfounded trees as intended. Let Y E Upz and assume that y is not just ( I ). Then y defines a tree Ty as follows: If y L ( 0 JxPx then y represents an element in UX , i.e. Ty is just a leaf.
rc a )where cx varies
If y E [ 1 JxPz then y represents a branching to the trees TF over Asy .
If the mot of the tree is placed at the top, we see that the tree Tr is well defined by a
D.Normann
102
top-down induction. We think of Tr as a set of finite sequences ( a 1 , . . . ,a n where n 2 0 , each a 1 , . . . ,an-l are in Asy and a n is either in Asy ,in Upx or empty. In the two last cases we call an a leaf. If ( a 1 ,. . . , an) is a sequence from Asx ,we let T$ a 1 , . . . ,CXn ) be the subtree of sequences that are the continuations of ( a 1 , . . . , an) into a sequence in Tr. Clearly each Ty will be of the form Ty for some
1'.
4.6 Lemma
Let a 1 , a 2 , . . . and C1 , C 2 , . . . be as in definition 4.3. Let y E UZ. Let 1 5 i 5 j. Then the following are equivalent:
y meets D i j T$ a i , . . . , ak-1 ) is a leaf meeting Ck for some k such that i I k Ij. The proof is by a simple induction on j 2 i. 4.7 Theorem
Let y E Upz. Then the following are equivalent: i) Y E Asz ii) Ty is well founded with leaves in ASX.
Proof i) * ii): Let Y E Asz. Let a 1 , a 2 , . . . be a sequence from Asy and let C1 , C 2 , . . . be
a sequence from Chx. Then y meets D,
so there is a least i such that y meets
D1,i. Claim The number i is independent of the sequence C1 , (22,. . . .
Proof By lemma 4.6 y meets D1,i for the first time when T$ a 1 , . . . ai-1 ) is a leaf that meets Ci. But there is exactly one i such that T$ a 1 , . . . ai-1 ) is a leaf. By the claim we see that T$ a 1 , . . . ai-1 ) is a leaf meeting all C E Chx, so the leaf is in Asx.
1C3
Klee ne-Spaces
ii) 3 i): If Ty is well founded with leaves in ASX then for any sequence a 1 ,a 2 , . Asy and C1 ,C 2 , .
..
..
from
from Chx, there is an i such that
T$ a 1 ,. . . , ai-1 ) is a leaf in Asx . Then T$ a1 , . . . , ai-1 ) meets Ci, and, by lemma 4.6, y meets D , . 4.8 Remark This theorem is proved in a more general version and in greater detail in [ 4 ]
4.9 Lemma The density requirement on the chains is satisfied.
Proof Let 21 ,‘22 be inconsistent, and assume that the level of 21 is less than or equal to that of 22. Notice that whenever we are given a 1 ,a2 , . . .an-l ,C1 ,C2 , . . . Cn we have constructed achain D I , ~where the maximal level of the elements is n. This chain can always be extended to a chain D ,
by letting aj = exty( I) for j 2 n and
by letting Cj be the dummy chain for j > n .Thus we want to prove by induction on the level k of 22 that there is an n I k+l, a sequence a1 ,a2 , . . .an-land a sequence C1 , . . . , Cn such that D I , ~will satisfy the density requirement. Case 1: k = 0 Then 21 = (0,p) and 72 = (1,q) for some inconsistent p and q in Px. Let C1 = tX(p,q). Case 2: k > 0 while 21 is of level 0. Then 21 =(O,p) and 22=(0,q) for some p and q. Then there is a pair (p1,qi) E q. By the induction hypothesis there are sequences a1 , . . . , an-l ,C1 , . . . ,Cn with n Ik such that D I , ~ a1 ( , . . . ,a n - l , C 1 , . . . ,C,) separates q1 and 21. Then D I , ~ +exty( ~ ( p i ) ,a 1 , . . . , an-1 , QJ, C1 , . . . , Cn ) , where Co is the dummy chain, will separate q and z2. Case 3: k > 0, the level of 21 is positive. Then 21 = (1,ql) and 22 = (l,q2) for some q1 , q 2 . There will be (pi ,‘1) E q1 and (p2, r 2 ) E 42 such that p i and p2 are consistent while r1 and r2 are inconsistent. Let p = l.u.b.( p i , p2 >.
D. Normann
104
By the induction hypothesis there is a pair of sequences a1 , . . . ,an-1 ,c1 , . . . , Cn such that Dl,n( a 1 , . . . , an-l,(21,. . . , C n ) is separating q1 and q2.Then Dn+1( exty( p i ) , a1 ,. . . ,an-1 ,Co ,C1 ,. . . , Cn ) , where Co is the dummy chain, will separate q and ~ 2 . This ends the construction of the t-maps and of the verification of their essential properties. It remains to prove that the extension maps really are associates. But it is trivial to show that they represent trees Tr of finite height and thus trees that are well founded. In the previous section we gave two examples of Kleene spaces, the singleton space Xo and the space of natural numbers, N. It is not hard to see that the space Tree( Xo ,Xo ) actually is isomorphic to the space of the natural numbers. In the next section we will see how the constructors may be iterated through the well founded trees, and thus yield parameterised families of spaces. In particular this observation means that we may construct families parameterised over N by recursion.
5 . Iteration We have seen some constructors of Kleene spaces. We will now show that these constructors can be iterated over spaces of the kind Tree( X , Y ) to give us parameterised families of spaces. We will have to use some notation from category theory in order to characterize the kind of constructors we have in mind. 5.1 Definition a) Let P and Q be information domains. An embedding of P into Q is a 1-1 map $4’ -+ Q that is order preserving, preserves inconsistency and that maps initial segments to initial segments. b) Let Pi = ( P i ,Q1 , A1 ) and P2 = ( P 2 , Q 2 , A2 ) be two uniform parameten’sations. An embedding of Pi to P2 will consist of two embeddings
$:Pi
-+
P2 and y:Q1
+ Q2
such that y A1 E A2 $ with the obvious meaning 0
0
of this inequality. c) A frame embedding is an embedding that sends elements cjf the frame to the corresponding elements. This definition works for both kinds of embeddings.
Kleene-Spaces
105
5.2 Remark We have defined four categories, categories for the domains of single and parameterised families of spaces and categories for the frames of the same.
5.3 Definition A uniform constructor is a constructor of a Kleene space or a uniformly parameterised family of Kleene spaces from a finite sequence of Kleene spaces and uniformly parameterised families of such of a fixed arity that is categorical in the following sense: There is a functor from the category of sequences of domains of the given arity to the domains of the given kind commuting with direct limits and pullbacks that gives the new domain from the old ones, and that preserves frame embeddings. 5.4 Remark As intensively used by Girard in e.g. [ 5 ] and [ 6 ] this category-theoretic way of describing an operator is just a precise way of saying that the operator is very uniform and uniquely and finitely based. We will require this uniformity at the level of the
domains and frames, and we notice that the new domain will only depend on the old domains while the rest of the new frame may depend on the old domains, the extension maps and the t-maps, though in a uniform way. We do not require any uniformity on behalf of the chains or the associates. Operators that are uniform with respect to these ingredients are studied in [ 4 1. We observe that the three constructors we have considered so far are all uniform. The composition of uniform constructors will also be a uniform constructor:
5.5 Lemma a) Let I-(X ,X i , . . . ,Xn ) and A( X i ,. . . , Xi ) be two uniform constructors where the variable X is of the same type as A. Then
.
A( X1 , . . . , Xn ) =I-( A( X1 , . . . , X1 1 . x 1 , . . . Xn
is a uniform consmctor. We call A the composition of r and A. b) If r(Y ,X i , . . . ,Xn ) is a uniform consmctors such that the variable Y is of type 'Kleene space' then
A( ( Y a ) a E A s X . X 1 , . . . . X n ) = ( r ( Y a . X l , . . , , X n ) ) a ~ A s x is a uniform constructor. We call A the parameter version of r.
D.Normann
106
C) If r(X1 ,. . . ,Xn ) is a uniform constructor and IC:
( 1 , . . . ,n)
+ { 1 ,. . .,m)
then
A(Y 1 , . . . ,Ym ) = r( Yx(1) , . . . , Yx(n) is also a uniform constructor. d) The constant operator
r(X i ,. . . ,Xn ) = Y
is uniform for all fixed Kleene
spaces Y. The proofs are tedious but basically mvial and they are left for the reader. The main result of this section is that we may iterate these constructors:
5.6 Theorem Let X be a sequence of variables of some given arity. Let Z be a (variable over) Kleene space(s), W a variable over pararneterised families of Kleene spaces. Let A( Z , X ) and r(W ,X ) be two uniform operators. Then there is a uniform operator Asx ITA,r( {za)a~
7
= { w y ) y ~AsT~=(x,Y)
called the iterurion of A and A, satisfying the equations w y = IC) X N Z y l ’ X ) if y = (0)X Y 1 w y = (11 x r ( (WFyl(P)1P~Asy
9
x ) if
y = (1) xY1
for Y E AsTree(X,Y) Proof We will show how to construct the parameterised domain, the extension functions and
the t-maps in some detail, but we will leave out many of the proofs. We will also omit the variables X in the proof, they may be added wherever needed without any difficulty. We assume that X , Y and ( Z a ) a G ~ s Xand we will use the subscript Z for any item occuring in the frame of the parameterisation. Likewise, we will use W as a subscript for items occuring in the new parameterisation. It will be clear from the constructions that ITA,r will be a uniform constructor. First we define Qw: Qw is the least partial ordering satisfying: LEQz
KleeneSpaces
107
(0) x A( Qz ) with the obvious ordering is a substructure of Qz ( 1) x r(P T~O [,Y > QZ, p+&)
with the obvious ordering is a substructure of Qw.
The latter expression means that we apply r to the parameterisation domain A(p) = QWin constructing Qw. There will always be a least solution to this equation. We define the parameterisation function Aw(p) of the domains by recursion on p as follows: p = ( 0 > P I ) . Then Aw( P 1 = (O)XAZ( P1 ). Let p E PT=(x,Y). p = ( 1 ,p i 1 and let p i = { ( r i s i ) , . . . , (rn7Sn)1. Let Pp = ( r 1 3 1,.._, ik ( ( ril , . . . , rik ) is consistent and r 5 I.u.b.( ril , . . . , rik ] ). Let Ap( r ) = Aw( l.u.b.( si I ri S r )). Let Up be the least set containing all Aw( r ) for r E Pp that is closed downwards and under 1.u.b.k of finite sets. Ap 1. Let Aw( p 1 =r(Pp ,lJp,
Claim AW is a uniform parameterisation such that if y E AST-(X,V
then Aw( y ) = p w
Y'
Proof The uniformity is O.K. The rest of the claim is proved by induction on the rank of 'y, where we at the induction step will assume that the definition of pW is based on the induced uniform parameterisation as described below.
Y
If y is a leaf then the claim is trivial. If y is not a leaf then y consists of neighbourhoods of the form ( 1, { ( r l , s i ) , . . . , (rn.sn) 1.1. By the induction hypothesis A$ r ) = closure( u( Ap( r ) Ip E y ) ),
where closure here means closure downwards and under I.u.b.'s of finite consistent . If we use this subsets, is a uniform parameterisation of ( WF ( p ) )p
Y1
parameterisation when we construct Wy the claim also holds for y .
D.Normann
108
When the domains PW and the local uniform parameterisations are given, the
Y
associates Asw are also implicitly given. Moreover, the chains ChW are given by Y Y the recursive definition of Wr- It remains to define the extension maps and the t-maps in a uniform way. We define Ew( q )( p ) and Tw( q1 ,Q )( p ) by simultanous recursion on p. If p = ( 0 ,p i ) we use A , EZ and TZ to find the appropriate values for EW and TW . If p = ( 1 ,P i ) then we, in analogy with the construction of the uniform domainparameterisation, use the Ew- and TW-maps applied to p*'s of lower level than p to define an appproximation to the EW
Y1
( WF,, I ( p ) ) p
-
and TW -maps for the parameterisation
.We may apply r
Y1
to these approximations to define EW and
Tw. We omit the tedious details. This ends our proof of the theorem.
6. Hierarchies Now there are several possibilities for producing hierarchies of Kleene spaces based on the constructors described above, and for all these hierarchies we may produce notation systems for the hierarchy. The hierarchies will be combined hierarchies for Kleene spaces, parametensed families of Kleene spaces and constructors. In the simplest hierarchy we start with the singleton-space Xo and the constructors 'function space', 'product space' and 'well founded tree space'. We will close the class of constructors under iteration, composition and parameterisation, and we will include all constant constructors for Kleene spaces in the hierarchy. We will close the class of Kleene spaces and parameterised families of Kleene spaces under application of the constructors. Using a Godel-type enumeration we may asign a natural number, an index, to each object in this hierarchy, and the frame for each object will be uniformly recursive in the index. As a consequence, the spaces in the hierarchy may be uniformly and recursively parameterised over the natural numbers. It is clear that the set of associates occuring in this hierarchy is recursive in the functional 3E but it is also clear that the set is of a high complexity and that we need computations far longer than N 1 in order to "compute" this set relative to 3E. By the way, there is no problem in coding all the partial orderings, chains, associates and frames as elements of NN in order to make the statements above presise.
Kleene-Spaces
109
Without increasing the over-all complexity we m a y extend the hierarchy by including each individual space Wy in a parametensed family. Then an index for the space must contain information about W together with some code for y. Thus the notation system will be as complex as the set of associates. There is still no problem, however, to show that the whole hierarchy is recursive in 3E and thus of bounded complexity. These hierarchies may be extended as follows:
, are in the hierarchy for each a E ASX such that ( Y , )a hxcan be If X and Y seen as a uniform parametensation, then this parametensation is in the hierarchy. This last clause is much like the bounding principle for recursion in 3E and we leave it open to decide if this hierarchy will be as complex as full recursion in 3E. References 1. Kleene, S.C.: Countable functionals, in A. Heyting ( ed. ) Constructivity in mathematics, North-Holland ( 1959 ) 81-100 2 Kreisel, G. : Interpretation of analysis by means of functionals of finite type, in A. Heyting ( ed.) Constructivity in mathematics, North-Holland ( 1959 ) 101-128 3. Normann, D.: Recursion on the countable functionals, Springer Lecture Notes in Mathematics No. 8 11, Springer ( 1980 ). 4 . Normann, D.: Formalking the notion of total information, to appear in the proceedings from Heyting '88. 5 . Girurd. J.-Y. :
n:
-logic,Part l:Dilators, Annals of Mathematical Logic 21
( 1981 ) 75-219
6 . Girard. J.-Y. :The system F fifteen years later, typed manuscript.
This Page Intentionally Left Blank
Logic Colloquium '88 Ferro, Bonotto, Valentini and Zanardo (Editors) 0 Elsevier Science Publishers B.V. (North-Honand), 1989
111
O n B o u n d e d Time T u r i n g Reducibility on the Recursive Sets
TIIEODORE -4.SLAMAN In this talk, we will discuss some recent progress in the understanding of the structure the recursive sets ordered by time bounded Turing reducibility. In particular, we will focus on (deterministic) polyiiomial time ( P T I M E )Turing reductions although our techniques are completely general. Let {O,l}* be the set of finite binary strings. Lower case Greek letters u and T denote strings; IuI is the length of u ;upper case Roman letters denote subsets of (0, I}*; upper case Greek letters ip and 0 denote Turing functionals. A Turing functional ip is in P T I M E if there is a polynoinial p such t1ia.t for every string Q and every X, the computation of @(o,S)is completed in less than p(lal)many steps. Note, the definition of P T I M E makes explicit reference to an unspecified model for computation. From our point of view, any of the standard choices, including Turing machines, is acceptable. DEFINITION.A < p B if there is a 9 in PTIAfE such that @ ( B )= A. A 3 p A
B if
We consider various structures associated with these reducibilities. Let REC be the class of recursive subsets of {0, l}*. (REC,< p ) gives this class the order induced from PTIAlE reducibility. (RECI e p ,S p ) orders its PTIAfE degrees. Early results of Ladner 111 show that these structures are quite rich. For example, he showed that the orderings are dense with incomparable elements. We will discuss some results addressing their more global properties. (Shinoda-Slaman) There is a n interpretation of the arithmetic in the first order theory of (RECI ~ p
TIIEOREhr 1.
first
order theory of
Theorem 1 has the immediate corollary that (RECI L p , < p ) is an undecidable structure. T I I E O R E h i 2.
(Shore-Slaman) E o c r y finite lattice c a n be embedded in ( R E C ,Sp).
Tlie methods used to prove Tlicorein 2 are conil>incdwith Ladner's techniques to show the following.
THEOREM 3. (Shore-Slaman) The 3 V - t h c o r y of (REC,< p ) is decidable. DEFINITION. D T I M E ( n ' ) is the class of recursive subsets of {O,l}* that have an algorithm such that for soiiie constant c and for all u,the algorithm returns the value at u in ~ steps. DTIAZE(n', A ) is the analogous class defined relative to A. less than c J Q Jmany Tlie author was partially supported by Presidential Yoouiig Iiivestigator Award DAIS-6451746 and N.S.F. Grant DAIS-SG0185G.
T.A. Slaman
112
THEOREM 4. (Haught-Slaman) There i s a recursive set A and an automorphism f of the lattice of sets {X I X < p -4) such that f preserves < p and f o r some B < p A, f ( B ) $ p B. Further, we m a y chose f to preserve the DTIME(n',A) complezity classes or not, as desired.
We may view Theorem 4 from two vantage points. As a theorem about ( R E C ,< p ) , we conclude that there is a principal ideal x-ith a nontrivial automorphism. It is open whether there is a nontrivial automorpliisin of the whole structure. As a theorem about the interaction between the various DTIAlE(n'), there is an A , not in P T I M E , such that the classes DTIAfE(n',A) are not definable in ( P T I M E ( A ) ,< p ) . Let < L denote the existence of a linear time reduction. It is open whether there is an automorphism of ( P T I A I E ,< L ) or cren whether DTIAIE(n) is defiiiable in this structure.
REFERENCES 1. Ladner, R. E., On lbe slruclure of po/ytioniinl lime reducibility, Jour. Assoc. Comp. hiachinery 22 l g i 5 ),.. 155- 171. 2. Haught, C . and Slaman, T. A . , .41ifoinorplitsn1sin the P T I A l E Turing degrees of flre recursive sets, (to appear). 3. Shinoda, J. and Slaman, T. A., OIL1hc theory of 16e P T I A I E degrees o/ flie recursive s e f s , (to appear). 4. Shore, R. A. and Slaman, T. A , , Lattice emleddings i a the P T I A I E degrees of the recursive s e f s , (to appear). %
Department of hlatliematics; The University of Cliicago; Chicago, IL GOG37; U . S. A
Logic Colloquium ’88 Ferro, Bonotto, Valentini and Zanardo (Editors) 0 Elsevier Science PublishersB.V. (North-Holland), 1989
113
The If:-Singleton Conjecture: A n Introduction Sy D. R i e d m a n MIT Solovay conjectured that there is a IIi-Singleton R such that 0 < L R < L O#. My purpose here is to provide a setting for this conjecture and to give an idea of its proof, This article is intended for the non-specialist; I will do my best to explain all the basic notions.
I will begin with the following result of Cohen: 1) There can be a nonconstructible real. By this, I mean that “3R C w ( R $! L)” is consistent with ZFC. It is natural to ask for something stronger:
2) Can there be a definable nonconstructible real? This was answered affirmatively by McAloon, who showed using Cohen’s methods that R = (~212~” = N,+1} can be nonconstructible. For our present purposes a more definitive result is due to Silver and Solovay:
3) If there is a measurable cardinal then O# = Thy(L, N 1 , N2,. . , ) is a definable nonconstructible real. By this we mean that the set of Godel numbers of formuls q5(11 ...I,) in the language of set theory such that ( L ,e) +(H1,.. .,fin) is the definable, nonconstructible real Q#. When we write N 1 ,N 2 . . we mean the first w-many uncountable cardinals of V = the real world, riot of L = the constructible universe. In fact if there is a measurable cardinal then Nf, N$, .. . are all countable ordinals.
.
It is not difficult constructible reds:
4)
w
to
generate
other
examples
of
definable,
non-
- O# is definable, nonconstructible.
5) O## = Thy(L[O#],fi1,N2,. . .) is definable, nonconstructible. We would like to eliminate examples as in 4),by modding out by a suitable equivalence relation. Define R 5~ S iff R E L [ q , R
.
6) There is areal R
I LO#
which is Cohen generic over L. Now O# is not =L-equivalent
114
Sy
D.Friedman
to any real Cohen generic over L. Thus R, = (L[O#]-least real Cohen generic over L ) is a definable, nonconstructible real and O# $ L R,. But R. is not really L'canonical'', because to define R, we need to refer to O# and O# is not constructible from R,. Thus we are looking for reals defined in a more absolute way, as follows: Definition R is a Solovay Singleton if for some formula $(z) with ordinal parameters,
R is the unique real R such that L[R] 4(R). Now O# is a Solovay Singleton of a special type: Definition A IIi-formula is a formula of the form VS3T+ where rC, is arithmetical and S,T range over reals. R is a IIi-Singleton if R is the unique solution to a IIi formula. Leiry-Shoenfield absoIuteness implies that: 7 ) R is a IIi-Singleton R is a Solovay Singleton via a formula $(z) that is II1 in the Lkvy hierarchy and has no ordinal parameters.
Thus a IIi-Singleton is the simplest type of Solovay Singleton that could be nonconstructible. 8) O# is a IIi-Singleton. Solovay's IIi-Singleton Conjecture There is a IIi-Singleton R, 0 < L R < L O#.
Results T h e o r e m 1 There is a IIi-Singleton R,O
R < L O#.
A question related to the IIi-Singleton Conjecture is due to Kechris. A set X is
II; if X = {RJ+(R)} where $ is a II: formula. Question Does every nonempty countable IIi set contain a IIi-singleton? Theorem 2 IIi-singleton.
There
is
a
nonempty
countable
II:
set
containing
no
On the other hand we have: Theorem (Harrington-Kechris) If X is a nonempty countable IIi set then X contains a Solovay Singleton, defined using parameters Nl , .. . N, for some n. T h e o r e m 2' For each n there is a nonempty countable II: set X , such that no element of X, is a Solovay Singleton defined using parameters N1,. . . ,N,. Thus the Harrington-Kechris result is best possible. O n t h e Proof of Theorem 1
R arises as the generic real for an L-definable forcing P. This is a c l a ~ sforcing: P is not a set. P is built out of three types of forcings: 1) Jensen Coding: This enables R to code a class of information.
The IIi-Singleton Conjecture: An Introduction
115
2) Backwards Easton Forcing: This is used to add certain CUB subsets to Linaccessible cardinals. Such a forcing is an iteration Po * PI* Pz .. . * Pa * . . through the ordinals with the restriction that the support of any condition is bounded in any L-inaccessible.
*
.
3) Set Forcing: This helps to make R a IIi-Singleton, via a trick of Solovay. The existence of O# entails the existence of a canonical CUB class of indiscernibles I for ( L ,e) such that L = C1 Skolem hull (I)in ( L ,e). Our desired P-generic G P arises in a very natural way from I : G = {plp(ii.. . i n ) 5 p for some il . . . i n E I } where (il,. . . i n ) H p(il.. .i n ) is a &(L,e) procedure. Our goal is to show that there is only one P-generic. This is where the Backwards Easton forcing comes in. There is a method of adding CUB sets (in a Backwards Easton fashion) for the purpose of "killing" guesses (21 . . .in) at an n-tuple of indiscernibles. N o correct quess ( i l . . . i n ) E I" can be killed. Our forcing is set up so that the generic G will kill any guess (i, . . .i n ) which via the C l ( L ,E ) procedure above produces information p(i1 . , . i n ) contradicting G. So there can only be our one generic G, as another generic H would have to kill the correct guesses (21 . .. i n ) E I" which produce p(il . .. i n )4 H. The other key ingredient in the proof is the Recursion Theorem. To create the forcing P we need a C1 index for the procedure (il . . .i n ) I-+ p ( i l .. .in) in order to know which guesses (il .. .in) to kill. But this procedure in turn cannot be defined explicitly without knowing the forcing P! This circularity is dealt with by using the Recursion Theorem to obtain the desired index.
A similar technique can be used to establish Theorem 2.
Sy D. Friedman
116
References Beller-Jensen-Welch David [S2]
1821
Coding the Universe, Cambridge University Press
“A Very Absolute lli-Singleton,” Annals of Pure and Applied Logic.
ILAnImmune Partition of the Ordinals,” in Recumion Theory Friedman [S6] Week, Springer-Verlag Lecture Notes. Harrington-Kechris [77]
‘TI:-Singletons and O#, F’undamenta Mathernatica.
Jensen-Solovay [68] “Some Applications of Almost Disjoint Sets,” in Mathematical Logic and the Foundation3 of Set Theory, North Holland.
Logic Colloquium ’88 Ferro, Bonotto, Valentini and Zanardo (Editors) 0 Elsevier Science PubIishers B.V. (North-Holland),1989
117
The Descriptive Set Theory of
(I
- Ideals
of Compact Sets Alexander S. Kechris’ Department of Mathematics California Institute of Technology Pasadena, CA 91125
ABSTRACT. W e present here a survey of t h e definability theory of u-ideals of closed sets in compact metric spaces a n d its structural implications. W e also include proofs of some recent results in this area.
$0. I N T R O D U C T I O N . T h e s t u d y of u-ideals of compact sets has been motivated by problems in classical a n d a b s t r a c t harmonic analysis. W e will not discuss in any length these applications here
- t h e interested reader can consult [I<-L] - b u t we will
concentrate instead on t h e pure descriptive set theoretic aspects of this study, which a r e of independent interest. Throughout this paper E will be a compact, metric space. denote t h e set of closed subsets of E. A subset I
By K(E) we
E I<(E) is called lreredrtary if
I<, L E K(E); K E I; L C I< a L E I, an ideal if moreover
K, L E I
I< u L E I
and finally a o-idealif in addition
I<, K1,K q ,
... E K(E);
Vi(Ki E I); I< = U i K i 3 I< E I.
T h e terminology “ideal,” “u-ideal” will b e reserved for these notions below. ‘Research partially supported by NSF G r a n t .
A.S. Kechris
118 Exanides. 1) For each A
E E, let
I<(A) =def t h e a-ideal of all closed subsets of A, IC,(A)
zdef the
a-ideal of all countable closed subsets of A.
2) Imeager =def t h e a-ideal of all meager (nowhere dense) closed subsets of E.
3) Given a (Borel) probability measure p on E, let I, =def t h e a-ideal of closed sets of p-measure 0. More generally, given a (Choquet) subadditive capacity y on E, let Iy =def t h e a-ideal of closed sets of y-capacity 0.
(For the notions of capacity, subadditive capacity, etc. see e.g. [I<-L-W]). Jy
=def
t h e a-ideal of y-thin closed
sets, i.e. those containing no
uncountable family of pairwise disjoint closed sets of positive .r-capacity.
(For J y we are not necessarily assuming t h a t y is subadditive).
If H is any class of probability measures on E, let -def IH -
JH
nltEH 1p3
zdef the
a-ideal of H-thin closed sets, i.e. those containing no
uncountable family of pairwise disjoint closed sets not i n I H . 4 ) Let now E
= T =def t h e unit circle. Consider
U =def the u-ideal of closed sets of uniqueness for trigonometric series,
Uo =def t h e o-ideal of closed sets of eztended uniqueness. ( A closed set F
T is a s e f of uniqueness if every trigonometric series
cnelnX
converging to 0 off F is identically 0, and is a set of ezfended uniqueness if this holds for all Fourier-Stieltjes series C,?(n)einX, where p is a (Borel complex) measure o n
T. For more on these notions see [I<-L]).
The Descriptive Set Theory of 0-Ideals of Compact Sets
119
If R is t h e class of all probability R q c h m a n measures on
V, i.e. those for
which j ( n )
-
0 as Jnl
-+
00,
then it turns out t h a t
uo = IR. 5) Let X be a separable Banach space, X* its dual. Let E = BI(X*) be t h e unit ball of X* with the weak*
-
topology. Consider
Isep =def t h e u-ideal of closed subsets of E which a r e norm-separable. G ) Let E = 2w, P u t
I, =def t h e u-ideal of closed subsets of E which avoid a cone of Turing degrees (i.e. I< E I,
5
e 3x E
P V y E I<(.
bT y), where
is Turing reducibility).
T h e set I<(E) becomes itself a compact, metric space under t h e usual metric p(I<,L) =def s u p {d(x,I<), d(y,L): x 6 L, y E I<) if I<, L
# 0 = diam(E),
I< or L
= 0, I< #
L;
if
= 0 if
K = L = 0 .
All topological and descriptive .set theoretic notions concerning I<( E) refer to this space. T h e basic desriptive set theory of a-ideals of compact sets has been developed in (I<-L-W].. W e will review some of the results in this paper below and discuss t h e more recent development in this subject. T h e r e are three basic components in this theory: A) Classification of t h e definability of a-ideals: We will concentrate around
the first level (Borel,
xi, JJi,etc.) of t h e projective hierarchy, where most of t h e N
examples occur. Roughly speaking, t h e main results imply t h a t a-ideals of compact sets can occur here only in o n e of a very small number of definability classes.
A.S. Kechris
120
Bases (or generators) for o-ideals:
B)
S t u d y of t h e definability of bases
(i.e. generating sets) of o-ideals a n d its relationship with structural properties of t h e a-ideals .
C)
F u r t h e r structural properties:
Study of t h e relationship between
definability of a-ideals a n d such structural properties of a-ideals as thinness ( t h e general version of t h e countable chain condition), control, inner approximation, etc. W e will concentrate here on p a r t s A), B).
Concerning C ) t h e reader is
referred to $3 of (I<-L-W].
$1. C O M P L E X I T Y
a-IDEALS. First we have, denoting by
2 t h e class of differences of Theorem
1.
-def
-
0
Q1
-Q?
no sets, t h e following -1
( T h e Dichotomy Theorem; [I<-L-W]).
space, I a a-ideal of closed sets in E. If I is either
Let E be a compact, metric
- Qi, or
then exactly o n e of
t h e following hold:
n: - complete,
i)
I is
ii)
I is
iii)
I is D p - complete a n d of t h e form K(A), A E Dq,
iv)
I is
v)
I is
(If
N
-
@ - complete,
ny - complete and of t h e form I<(A), A E @. N
r
E -!
-
complete and of t h e form [<(A), A E
L
is a class of sets in compact, metric spaces then we call a set A
r-complete if A E B
z?.
Eo, B E
r
r
C E
and for a n y 0-dimensional compact, metric space Eo and a n y
there is continous rp:Eo
-
E with B = v-’[A]).
T h u s excluding t h e “degenerate cases” iii) - v), i t follows t h a t within or
nt t h e only classes t h a t N
o-ideals I can occupy a r e
labeling “Dichotomy Theorem.”
n: N
and
Q:, thereby
the
T h e diagram below summarizes t h e contents of
The Descriptive Set Theory of 0-Ideals of Compact Sets
121
Theorem I
...
( T h e ci :led classes a r e t h e only o n e s within V
r
denotes t h e dual of
C1 or n1t h a t con -1 -1
ain a-ideals. Here
r).
A m o n g o u r examples t h e following a-ideals a r e “siniple,” i.e.
A E
I$;
Imeager; I py I y’ J 7 for certain y’s.
no -2
: IC(A) for
T h e following a r e o n t h e o t h e r h a n d
N
“complicated,” i.e. lJi-complete:
I<(A) for A E
ni
but A $
N
@;
ICu(E),
E
uncountable; J T for certain y’s; U, Uo by a t h e o r e m of Solovay a n d K a u f m a n - see [I<-L] for details; Isep by a n unpublished result of Godefroy a n d Louveau; I,. M o r e recently t h e a-ideal Uo in T h a s been found to h a v e a r a t h e r surprising hereditary property. Theorem
2. ([K2]).
A n y a-ideal I of closed s u b s e t s of T which c o n t a i n s all
singletons a n d is contained in Uo is n o t
C’. -1
(In particular, a n y s u c h
n1 a-ideal is -1
n :-complete). N
T h e proof uses a d hoc analytical constructions. I t would b e very interesting to find a descriptive s e t theoretic result, which modulo known s t r u c t u r a l properties
of Uo would imply T h e o r e m 2. A positive answer t o t h e following problem would d o just that. Problem
3. Let I be a
n!
a-ideal of closed sets in a c o m p a c t , m e t r i c s p a c e E
N
containing all singletons. Is t h e r e a d e n s e G6 set G
E E such
t h a t K(G) C_ I?
T h i s a n d o t h e r problems underline t h e need for a b e t t e r u n d e r s t a n d i n g of t h e s t r u c t u r e of
no a-ideals. -2
A S . Kechris
122
W e comment briefly on some facts concerning rdeals of compact sets as
Remarks.
opposed tc a-ideals. form I<(A), A E
4;.
Moreover, it has been shown by Dougherty-Kechris and
n -;
Louveau (see [1<2]), t h a t every
a r e ideals in t h e higher Borel classes
a-ideal is actually a a-ideal.
-
C:
and
However, there
c,",n:, c,",
I...
U
Beyond
ideal is of t h e
First, i t is proved i n [I<-L-W] t h a t every $ k
N
N
n: t h e situation has not yet
been investigated in any
Y
detail.
W e suspect however t h a t exclusion phenomena persist for a while beyond
&:
Jz:.
and
?B(n:) - is t h e class of Borel sets above n:, -
Here is a specific result. If
i.e. the smallest a-algebra of sets containing all levels of t h e Borel hierarchy of
-
Denote by D2(n:)
n1 sets, then one can specify t h e -1
?B(n') that contain a-ideals of compact sets. -1
t h e class of differences of
n: -
sets. Let
xy - (n:) - be t h e
(Jzi)t h e dual class of Ey (n:) a n d inductively define as usual x : (n:), n: (ni)for < So "B(E:) = u,<wl
-
class of countable unions of D,(n:)
sets,
@
u
Q
z:
U
of Borel separated unions of
(II:) th )e class
~ ~ ~ denote I I Y by B ~ ~ ( u , < A
Ua
Ua
wl.
"
(II:). F
=
where An E
-
-
An
( Q : ) sets, i.e. those of t h e form U n A n ,
E
Cn where Cn a r e Borel and Cn n Cm =
(b
for n # m.
Theorem 4. (Douglierty-I<ecliris). Let E be a compact, metric space, 1 a a-ideal of closed sets i n E.
If I is in
?B(n:) - and
Determinacy
(%(n:)) - is assumed, then
exactly o n e of t h e following hold i) I is
n: -
ii) I is D2(n1)-complete, -1 iii) I is
n:-
iv) I is in
-
(n:)-complete B~U(U,<~
for some 1
5a <
Q : (nil) - u,<~ $J
wl,
(nil :or
some limit
Moreover for E = Zw iv) can be improved to: iv)' I is csu
x <
wl.
(u,<,n: (n:)N
N
123
The Descriptive Set Theory of a-Ideals of Compact Sets
complete where csu stands for "colpen separated unions" and there exist a-ideals of closed sets in E which verify cases ii)-iv)'.
Proof. W e will establish some more general results. If
r
is a class of sets in compact, metric spaces and A & E is a set in t h e
compact, metric space E, we say t h a t A is r-hnrd if for every 0-dimensional
r
compact metric, space Eo and every B G Eo, B E with B = q-'[A].
For
B E
there is continuous p:EO -+ E
T h u s A is r-complete if it is r-hard a n d A E
r, I" such classes, denote
by
r
A
r'
r.
t h e class of all A n B with A E
r'.
-Lemma
A. If A
K(A) is
rA
Proof.
Let Eo be 0-dimensional, B, C
E'is r-hard and r'-hard, then a n y S & I<(E) with I<,(A)
F: Eo
c Eo, B E r and
C = $-'[A].
I<(E) is continuous and x E B
+
~ ( xg ) K(A), so F - ~ [ S ] = B n
fl
C
3
B E S e UB E I
SO
I is
r
A
c1
r
, S = {B
E I<(I<(E)):
i
r
which is closed under continuous
r,
n Cn)
E
r.
Lemma
c.
r
is a Wadge class, A is r-hard and t h e dual class with
&(A)
C
S
C
r
is closed
Cn clopen pairwise disjoint,
Un(Bn
S
3
u B E I}.
r'-hard.
under clopen-separated unions (csu) if for Bn E
any
B n C
A r'-hard.
preimages and contains a I?-complete set in 2 w . W e say t h a t a class
then
Then
U B is continuous from K(I<(E)) into K(E) and
By a Wadge class, we mean a class
If
E
i
Apply Lemma A to A = I But B
--+
c.
Say I
A r'-hard.
x
F ( x ) E I<,(A),
Proof.
r
Let q,$:EO
P u t F(x) = {q(x), G(x)}.
B. If t h e a-ideal I is r - h a r d and r'-hard, then I is
c I<(E).
r'.
C E
-Lemma
Then S is
ES E
r'-hard.
be continuous with B = v-'[A],
csu,
r,
I<(A)
is
V
r
is closed under
Awr-hard,
where
A.S. Kechris
124
AWr
In,,A,
=
: A,
r).
E
First notice t h a t there is 2 E A such t h a t A n V is r-hard for every nblid
P f .
V of A. Indeed, fix Xo C 2w r-complete and put Y = V
r, so Y
is a csu of sets in
V
r.
E
UnEw lnO(-X0).
T h u s there is continuous
'p
Then Y
with -Y=(p-'(A].
Put
Z = c p ( i ) , i = t h e constant 1 sequence. Given now Bn E
5 2-"
d((pn(x),z)
r
let
'pn
P u t F(x) = {'p,(x):n
for each n, x.
then F(x) E &(A).
be continuous such t h a t Bn = 'pn-'[A],
e nn Bn.
If x
Then F ( x )
6
E w}
and
u{z}. If x E n Bn
K(A) so we a r e done as F is
continuous. -I
Lemma Q. If
r
V
r
is a Wadge class, I a a-ideal is I'-hard and
is closed under csu,
then 1 is Awr-hard.
Proof. As in Lemma B.
-I
Note now t h a t by Determinacy
(%(n:)),if r c %(n:) - is a Wadge class N
V
r
and A C 2w is not in
then A is r - h a r d .
continuous surjection x : 2w
Given a a-ideal I
is
a
[I], namely 'p(I<) = x[K]. Borel function
4(1<)=7r-'[K].
$:K(E)
So i f ^ i E
I<(E) find a
N
-+
E and let I = {I< E I<(2w) : x [I<] E I}. T h e n T is
a a-ideal o n 2w and there is a continuous function p : I<(2w)
p-'
c
-
This i f ' i is r - h a r d for some K(2w) such
-+
r, where r is closed
that
I
u
IC(E) with I =
r, so is 1.
= $~-1
Also there
[I],
namely
under Borel preirnages, then I E
r.
%(n:). - If I E n-:, then i ) of t h e theorem is e (n:). T h e n $ n: U thus 'i is n:-hard - and
Let I be a a-ideal on E, I E satisfied.
So assume I
-
so by Lemma B
N
C:-hard,
-
D2(ni)-complete,
N
'i is
D2(n:)-hard. N
so I is D2(n:)-complete N
N
If
'i is
-
in D,(n:)
and ii) is satisfied.
then
'i is
So assume
The Descriptive Set Theory of 0-Ideals of Compact Sets
-I
V
D2(Q:).
-
and so by Lemma 4 ( a s D2(n:)
T h e n ?is D2(n:)-hard N
is closed
Y
If
is n!(n:)-hard.
under csu),
125
*i
is in
-
ny(ni) - - then as before I is n!(n:)-
N
complete. W e proceed this w a y through t h e classes
n:(n:), N
e q u i v a l e n t l y ) ~is not in Un<,n:(nl) N -1' hard
and
so
by
Lemma
D
?
is
Assume now I (or
n<w.
-
If7
csu (un@(U:))
A'"r
=
=
V
r, then*i
nz(Q:)-hard.
If
is
r-
however
N
u
I E csu (ull@(Q:)),
- -
then I E Bsu ( u n n y ( n i ) ) , so iv) is satisfied. W e continue
similarly through t h e countable ordinals.
(0:)) a n d its dual Vr
In t h e case E = 2 w , since T = c s u ( u a < A @ least Wadge classes above
u,,,n:
N
are the
(n:),iv)' follows. -
W e discuss now some examples: T a k e E = 2 W . To find a complete u-ideal in or
D2(1J:) I=I<,(A).
@(g:) let
A C_ 2w be complete for such a class and consider
Clearly I is hard for t h e corresponding class, since X E A e {x} €1. To
see t h a t I belongs t o t h e corresponding class use t h e formula
ICE1 e I<EI<w(2W)& VxEIIYP(I<) [ x E I < for t h e case
n:(n:), Y
-
while for D2(n:)
N
if A = B
3
xEA],
n C, with B E Q;,C
E
C: use
the formula I<EI
I<EI<(B) & VxEHYP(I<) [ x E K e - x E A ] .
- -
Finally one can construct complete u-ideals for c s ~ ( U , , ~ ( n g ( n : ) ) way:
If A is csu of sets Bn via disjoint clopen sets C,,, then I=I<,(A)
Kw(Um
-
n C n ) ) via t h e clopen sets {K C
-
i n a similar
is a csu of
C m : ICe Um
-I
Remark. R. Dougherty has pointed o u t t h a t one can replace in iv) BSU(~,,~@
(Qi))
by t h e class of all set which a r e locally in
equivalently those of t h e form Un(Gn+l a r e open and Sn EU,
-
u,,,@(~~)
G n ) n S n , where Go C G1 C G 2
or
s...
126
A.S. Kechrb
52. B A S E S FOR a - I D E A L S . We introduce first t h e concept of basis for a a-ideal.
Definition
1. Let
I b e a a-ideal of closed sets in E. A
h;lsis for I
is a subset B C I
such t h a t
=def t h e smallest a-ideal
I=B,
containing B
= {I<EI<(E) : I< C Remark.
Un I<,,
; KI1 E
B}.
Usually bases a r e also hereditary b u t we will n o t m a k e t h i s p a r t of t h e
definition here.
We will s t u d y t h e definability of bases of a-ideals a n d i t s connections with i m p o r t a n t s t r u c t u r a l properties of t h e o-ideals. Pronosition
2. (see [I<-L-W]).
T h e a-ideal I h a s a hereditary
Clearly a a-ideal I h a s a
C1 basis -1
fl:
basis iff I is
c
iff I h a s a hereditary
-
basis.
ni. -
F o r not
necessarily hereditary bases w e h a v e t h e following reduction results. Theorem
3.
([K-L-W]).
Let I b e a a-ideal of c o m p a c t sets. T h e n
i) I h a s a
C1 basis -1
ii) I has a
Co basis iff -2
iff I has a
-
fli basis.
I h a s a D2 basis.
V
iii) I h a s a D p basis iff h a s a D2
n
V
D2 basis.
We next a d d r e s s t h e question of t h e complexity of a-ideals with
F o r t h a t we recall t h e definition of t h e class C'-IND
-
bases.
(see [MI):
N
Let X be Polish. A set A
EX
x E A where no E w,
'p
(n, A; x) is a
C: N
-
is C i - I N D if it h a s t h e form
* 'pQ3(n0 ; x)
relation in which n E w, A
5
w,x E X a n d p is
The Descriptive Set Theory of a-Ideals of Compact Sets
127
monotone o n A. T h e iterates of cp are defined by cp € (n;x> ts cp(n,1nf:39
and
pm=U
<
p'(nf;
XI);
x)
is t h e least fixed point of 9. ( B y a result of Grilliot one can even
allow in this definition
'p
to be non-monotone).
To get a feeling about t h e size of C i - I N D note t h e following result of AczelN
Richter: T a k e X = 2w. Then A
5
2w is C i - I N D (this is t h e lightface notion, i.e.
C:) iff there is a El formula tl, such
above is lightface
XE.4 where a ( x ) =def least ordinal
0
'p
N
that
* L 4 x ) I x 1 i= 7JJ(x)
such t h a t L,(x)[x]
-
There is also another description of C:-IND
is C:-reflecting. t h a t we will use later, due to
Solovay (see [M)): Let
GCi be t h e class of all sets of the form N
x E A ts G c r Q ( a , x ) ,
e 3a(0) Va(1) 3 4 2 ) V a ( 3 ) ... Q ( a , x ) where
QE
ww x
X, Q E
C8.T h e n
xi, - Di
C:-IND = G ~02' N
T h e class C 1 - I N D is quite bigger t h a n -1
but still well below
b.f, - i.e.
we have the picture
-
... C:-IND
c:
.........................
A~ -2.
W e have now Theorem 4. i) If E is a compact, metric space a n d I is a a-ideal of closed sets in E
A.S. Kechris
128
which has a
-
Ci basis, then
I E Ci-IND.
N
ii) T h e r e is a a-ideal I of closed sets in E = 2w with a
-
basis, which is
( C1-IND)-complete. -1
-
This C t - I N D is t h e exact maximum complexity of a-ideals of compact sets with C l - b a s e s . This solves a problem posed in [I<-L-W]. -1
Proof. i) Let
~
:
-+
2 E be ~ a continuous surjection. Let ^i be t h e a-ideal on 2w
defined by
KEY If B is a
is a
-
-
basis for I,
-B =
-3 n[K]
E I.
{ I < E 1 < ( 2 w ) : ~ [ I <E] B}
basis for I. Since L E I
* n-l[L)
ET
-
it is enough to s h o w T E C i - I N D .
So we may assume E = 2w. Let Ns = { a E 2 w : s C_ a } , for S E ~ < be ~ ,t h e standard basic nbhds of Zw.
C' -1
Let R E
be a hereditary
-
basis for I.
Define
t h e Cantor-Bendixson derivative associated with B by
*
n
3((FB(')=
0).
F+ F B ( l ) = { x ~ F : t l s [ x ~ N , Ns
F$ B]}
and denote its iterates by FB(E). T h e n FcI(=B,)
($
Consider now t h e following operator p(S, A; F) ( S E ~ A ~C ~2 <, w , FcI<(2W)): p(s, A; F)
T h e n p is
e Fn N, n ( 2 w -
UtEA I V ~E) B.
xi, - monotone o n A and p E (s, F)
s N, n ~ ~ ( = ' 10
so 'p
€ (0; F )
($
FB(') = 0,
The Descriptive Set Theory of a-Ideals of Compact Sets
129
1.e.
FEI
~ ~ ( F )0 ;
-
so I E C:-IND.
ii) W e s t a r t with t h e following key
-
Given P C w w in GC!
Lemma.
(lightface!), t h e r e is a t o t a l recursive function
2w such t h a t if G(c,I<) ( C E ~I<~ E, 1<(2w)) is in
f:w”+
(see [MI for this notion) for
C: s u b s e t s of 1<(2’),
Ci
a n d good universal
t h e n letting
N
B(c, I<) e 3 L E I<(2w) [I< g L & G(c,L)] or (I<=0) we have
where
I< E B, (so t h a t B, is
-
($
B(r,I<)
, non-0 a n d hereditary).
G r a n t i n g this l e m m a w e c o m p l e t e t h e proof as follows: I t is enough t o c o n s t r u c t a a-ideal I o n 2w x 2w with C t - b a s i s which is
-
GC;-complete (lightface!).
FET3-3 T h e n 4B E
C’1
Let 3
E I<(2w ~
2 be ~defined ) by
I< E K(2W) 3 ~ E [FC 2 ~ I< x { c } & B(c,K)].
a n d hereditary. Let
t h e l e m m a above x E p
-
T h e n i t is easy to check for P, f as in
2w E(Bf(x))u
w 2w x {f(x)} E I so t h a t I is G C i - c o m p l e t e .
---Proof of t h e lemma.
By a tree ( o n e w o r 2 ) w e will mean below a t r e e in t h e usual
sense which moreover h a s no terminal nodes.
Such trees (on w o r 2 ) a r e in 1-1
correspondence with closed s u b s e t s (of w“’o r 2 W ) , given by T
+ [TI = t h e s e t
of
I30
A S . Kechris
branches of T. Given P as in t h e s t a t e m e n t of t h e l e m m a , w e will find a total recursive
-
g:ww
-
2w such t h a t g ( x ) is a c o d e of a non-0
s e t of trees o n w , which is
closed u n d e r inclusion a n d is such t h a t
X E P e 3 { T n } ( T n E Sg(,)
(*) where S, = t h e
C1 s e t of trees with -1
&ww
= UnP'nl)
code c.
Assuming t h i s can b e d o n e w e complete t h e proof as follows:
For each s E 2 < w define s * E w < w as follows: If s = O n , t h e n s * = 0. If n s= 0 '10 l l . . . l O n k l O m , t h e n S* = (no, n1 ,...,nk). Clearly s E t j s* t* and n
if for
E
E 2 w , c*
= Un(cln)* t h e n if
c
is eventually 0, c * is a finite sequence a n d
otherwise c* E w w . Let N = { c E 2w: c h a s infinitely m a n y l's}.
For x E ww define n o w t h e following hereditary
-
s u b s e t of I<(2w)
T 3 T * { T is a t r e e o n 2 &
KEBL-3
T* is a t r e e o n
w
&
I< = [TI & Vs[s,T & T* E Sg(,)}
3 s*ET*]
V [3
c(cg N & I< C{c))].
T h e n it is easy to check, using (*), t h a t
2W~(B4)e u x E P. Since t h e r e is clearly a recursive f with Bk = B
f(x)
we
a r e done.
So w e finally c o m e to t h e problem of constructing g. Let XEP e 3 a ( O ) V P ( 0 ) 3 a ( l ) V P ( l ) with A E
xi, w h e r e a
-
a'
... ( < a $ > , x ) E
= (a(O),p(O), ...). For a, a' E
3 m Vn
2
A ww
m ( a ( n ) = a'(.)).
If u E ww w e can also view u as a s t r a t e g y for player I p u t t i n g
put
The Descriptive Set Theory of a-Ideals of Compact Sets a(ao...an-l) where
< ... >
= (I(< .a ,..., a n - l > ) ; a i E
is a recursive coding of finite sequences.
r E ww as a s t r a t e g y for player 11.
We d e n o t e by u
131
w
Sinmilary we c a n view
*
r t h e m e m b e r of w w
resulting in t h e r u n of a g a m e in which I uses u a g a i n s t I1 using r , i.e. u*r(O) = u(0), u * r ( l ) = r ( ( a * s ( O ) ) ) , u * r ( 2 ) = u ( ( u * r ( l ) )u, * r ( 3 ) ) = r ( ( u * r ( O ) ,u*s(2))), ....
We h a v e t h a t x E' I iff I h a s a winning s t r a t e g y in t h e g a m e I1
I
"
0
I wins iff ( < a , o > , x ) E
A.
Using a trick from [I<2], consider t h e auxilary g a m e 1;
I
U
I wins iff 3 a ' [ ~ ' - u & ( ~ ' * r , x ) E A]
Call t h e payoff set of this g a m e A*( , x ) .
Again A * E
E;.
Since
C8 g a m e s u
a r e determined, i t follows t h a t I h a s a winning s t r a t e g y in ( t h e g a m e for) A iff I h a s a winning s t r a t e g y in A*.
T h e point of t h e reduction is t h a t A* is --invariant
for
I, i.e. A*(,x)
&
0'
-
u
j A*(,x).
So without lass of generality w e c a n a s s u m e t h a t A(,x) is already
-
invariant o n a. S a y now (,x)E A e 3n(,x,n) where F E
@.
E F
Define now g ( x ) so t!iat T E S g ( x ) 0 31130 V P [ P € [ T l
* (,
x,n)EFl
where u ( P ) is t h e m e m b e r of w w t h a t I plays following u when I1 plays Clearly S
g(x)
is hereditary
C:, so i t is e n o u g h to show
P
E ww.
that
N
xEP
tj
3{Tn) ( T n
E Sg(x) &
ww
= UnITnl).
5 : Let u b e a winning s t r a t e g y for I in A. L e t ITn] =
{ P : ( < a ( P ) . B > , x,n) EF}.
132
A.S. Kechris
a n d w w = Un[Tn]. Then T n E S dx) t : S a y ww
= U n [ T n ] , Tn = Sg(,).
Let pll, a n be such t h a t
P € [ T n ] 3 ( < u ( B ) , P > , X,pn) EF}.
We describe a s t r a t e g y for I in A as follows: As long as I1 s t a y s is To (i.e. plays p with gets o u t of To, s a y for t h e first t i m e at ko, i.e.
let n1
>
0 be least such t h a t
pl(ko
s t a y s in Tn I follows for ko 1’
+ l)),
anl(Pl(ko
a(k0
+ 2)
t h e first t i m e a t kl, let n2
>
+ +
P I ko E
T o ) I follows uo. If I1
p Iko E To b u t pI(k0
+
1 ) !$ To,
1) E Tn (such clearly exists). As long as 1 1 on u n
1
(i.e. he plays a ( k o
+ 2), ...
= ull,(BI(kO
+
p
1) =
If I1 gets o u t of T n s a y for 1
n1 b e least such t h a t P / ( k l
t h e n o n as long as I1 s t a y s in Tn , I follows u n , etc. 2 2
+
1) E Tn2 a n d from
We claim t h a t this is a
Indeed, given a n y p E w w , since p E [Tn] for s o m e n, i t
winning s t r a t e g y for I.
follows t h a t for s o m e n‘ a n d s o m e k’, if
Q
is t h e result of 1’s moves a g a i n s t
following t h e above described s t r a t e g y , t h e n
k> k’ By definition, if
0’
j a(k)
(plk).
= u ,(p) w e h a v e n
(, so (,
=u
x ) E A. B u t clearly
Q
-
X,
Pn‘) E F
a’, so by --invariance
(,x)
E A and
we a r e done. i
Remark.
If follows from T h e o r e m s 3(i), 4 t h a t t h e r e is B
t h a t B u is (C:-IND)-complete.
E I<
(2w), B E
-
T h i s gives a n interesting normal form for C i - I N D
Y
a n d a connection of this class with
no, as opposed -2
Solovay’s T h e o r e m . Indeed, for a n y class
P
E X
is in
ar
ni - such
r
to
xi which
define a new class
iff t h e r e is a c o m p a c t , metric E, B
comes u p in
N
ar as follows:
A set
I<(E), BET a n d Bore1 m a p
The Descriptive Set Theory of u-Ideals of Compact Sets f: X
-
I<(E) such t h a t x E P e f(x) E B,.
a but
L!:
--o -
133
Then we have
C)=a
;!L
z 2
T h e next problem is now t o identify t h e classes t h a t a-ideals with can occupy.
-
Ci
bases
W e conjecture again t h a t (with t h e exception perhaps of some A t this tiine (excluding Bore1 u-
"degenerate" cases) only "few" cases can occur.
ideals) we have only examples of such ideals wliich a r e n:-complete (e.g. I<,(2")), (see below) and (Ci-IND)-cornplete ( b y Theorem 4).
u
t h e only possible cases?
n:.
beyond
u
u
-
@(Q;)-complete
Are these
If so, this would establish a new important "dichotomy"
Any classification results of this type could be also significant i n
applications. In particular, they could be useful in classifying the complexity of a n
U1*, in t h e theory of s e t s of uniqueness. T h e r e is
important a-ideal, denoted by
now strong evidence ( b u t n o proof y e t ) t h a t this a-ideal is not
n: u
(see
(I<-L-TI).
Before we proceed let us give a n example (due to Douglierty) of a @(flt)-complete
a-ideal with a
"
C' -1
basis in 2,.
-
Fix A g 2" C:-complete and let
I & I< (2" x 2 w ) be t h e a-ideal generated by K(2" x 2")
U
{I<EI<(2" x2"): T(K)EI<,(A)}
where T ( K ) = {x:3y(x,y)EIi}. This clearly has t h e
C1 basis -1
{{x}: xE2" x 2") U {{x} x K:I<EI<(2W),x E A}. Moreover i t is in
@ (n:) since
- -
I<EI e r(K) E I<,(2,)
& VXEHYP(I<) [ X E K 2 x E A V {y: ( X J ) E I<} is countable].
Finally, by Lemma D in $1, to show t h a t it is
- -
is (n:VC;)-hard.
If B is
n; - and
C is
- -
@ (n;)-hard
-
C;
it is enough t o show it
a n d f, g a r e continuous with
A S . Kechris
134
W e concentrate for t h e rest of t h e paper in t h e s t u d y of t h e structure of
ni N
Intuitively, such a a-ideal altliough
(non-Borel) a-ideals t h a t have Borel bases. "complex" can be generated in a "simple" way.
First we have t h e following reduction result.
5.
Theorem
([I<-L-W]). Let I be a
n1 a-ideal of compact sets. -1
T h e n t h e following
a r e equivalent i) I h a s a
-
basis,
ii) I has a Borel, in fact
no basis, -2'
iii) I has a hereditary Borel basis. T h e new element here is course iii).
Notice however t h a t in iii) a r e cannot
reduce "Borel" down to a n y fixed level of t h e B o r J hierarchy, as t h e examples I<,(A),
A Borel, show. W e will see now t h a t
ni (non-Borel) a-ideals t h a t admit'Borel bases have u
important structural properties. W e need a definition first Definition
5.
A a-ideal I on E is calibrated if F E I<(E); Fn E I; I<(F-IJIIFn)
I s F E I.
This definition, motivated by measure theoretic inner regularity properties, is satisfied by most examples in practice.
(for H E
-
C:), U ,
U o Isep,
I,
For example K,(A),
a r e all calibrated.
I p , IT, Jy,IH
A n important exception is
Imeager, which is n o t calibrated.
We can state now t h e following key structural consequence of t h e existence
The Descriptive Set Theory of a-Ideals of Compact Sets
I35
of Borel bases. Theorem
I.
( T h e Basis Criterion, [I<-L-W]). If i is a
n: -
a-ideal of closed sets i n
t h e compact, metric space E and i) I
n K(V) is non-Bore1 for all open V
c
E,
ii) I is calibrated, then
I has Borel basis
* Every dense G b G
C E contains a closed set F
C
G, F
e I.
A further important structural property of such a-ideals has been obtained using this criterion by Debs-Saint Raymond. Definition 8. A a-ideal I on E is locally non-Borel if
F E I<(E); Fe I Definition
9. A
3
I n I q F ) is non-Borel.
a-ideal I on E has t h e covering property if for all A I<(A) C I
* 3{F,}(Fn
h a s the covering property.
E, A E
z;
E I & A C U n Fn).
Notice t h a t t h e classical perfect set theorem for t h a t I<,(E)
c
-
C:
is exactly t h e assertion
In fact let us notice t h e following more
general fact. Pronosition
u.Let
I be a a-ideal o n E which has a
Co basis. -2
T h e n I has the
covering property.
Proof. G
E, A E
Fix A
2w a G g set with fIG]
-
C:.
Let f:ZW
-+
E be
a continuous surjection and
= A. Let N
I = {I< E K(ZW): qI<] E I}.
Clearly
has a
-
Ei
basis
which we can assume is hereditary.
Let {Vn} be a
clopen basis for 2w and let
V =
U {Vn:
GnVn
€7).
If G C V, then A can be covered by countably many sets in I and we a r e done.
A.S. Kechrh
136
Else G’=def
G-V
# 0. We will find then I< 6
such t h a t I<
G’.
Then A
contains a closed set n o t in I, namely qI<] a n d w e a r e d o n e again.
-
P u t F= G‘. Note t h a t if V n r l F
# 0, t h e n V n
in F. it follows t h a t I<(G’) is a d e n s e G6 in
f l
F
ey.
Since G‘ is dense
K(F). Let
M = {I< E I<(F): tln[Vn n K # 0
* I< n v n g El.
T h e n M is G g a n d is also d e n s e in I<(F) since for every Vn with Vn
n F +?
E.
So by t h e Baire C a t e g o r y T h e o r e m , K(G’) n A4 # 0. Let I< E hi, I< C
G’. Since Vn N
n F # 0, V n
n I< # 0
+ Vn
-
B it follows again by t h e Baire C a t e g o r y T h e o r e m
-
t h a t I< $? B, = I a n d t h e proof is complete. i
T h e following is now a sweeping extension of t h e preceding results. Theorem ~-
11. (Debs-Saint R a y m o n d , [D-S]). Let I be a
n’ a-ideal of c o m p a c t sets. -1
If I is locally non-Bore1 a n d calibrated, t h e n
I h a s a Borel basis
I h a s t h e covering property.
Let is see now which of o u r examples have Borel bases ( t h e preceding results a r e used to s h o w t h e non-existence of Borel bases): W i t h Borel basis: ---
A is t h e difference of t w o
I<,(A), A E A’; Uo (Kechris - Louveau, [I<-L]); I<(A), if -1
n$ -- sets ([I<-L-W]).
W i t h n o n o r e l basis:
J y , unless J y is already Borel (for example if 7 is a
projection of measures, J y h a s n o Borel basis - see [I<-L-W]), Isep (GodefroyLouveau); K(A), when A is n o t t h e difference of t w o
n$ -- s e t s ([I<-L-W]); U (Debs-
Saint R a y m o n d , [D-SJ); I,. T h e existence of a Borel basis for Uo a n d non-existence of such basis for U have m a n y applications in t h e t h e o r y of sets of uniqueness, see [I<-L].
137
The Descriptive Set Theory of 0-Ideals of Compact Sets It would be interesting to characterize t h e
n'-1
u-ideals of compact sets t h a t
have t h e covering property. For example (modulo non-triviality conditions) are all t h e assumptions in Theorem 1 necessary?
Clearly t h e covering property implies
calibration. T h e next question along these lines is t h e following Problem --
12. Can a
no a-ideal of compact sets have t h e covering property? -2
If Problem 1.3 has a positive answer then t h e answer is obv