Fusing o-minimal structures
|
|
- Annis Lawrence
- 5 years ago
- Views:
Transcription
1 Fusing o-minimal structures A.J. Wilkie Mathematical Institute University of Oxford St Giles Oxford OX1 3LB UK May 3, 2004 Abstract In this note I construct a proper o-minimal expansion of the ordered additive group of rationals. 1 Introduction Following work by van den Dries on expansions of the real field (see [1]) Pillay and Steinhorn layed the foundations for the general theory of o-minimality in [11]. At that time, and very much in the spirit of model theory of the period, Steinhorn asked whether the most atomic of all (interesting) o-minimal structures, namely the ordered, additive group of rationals, could have a proper o-minimal expansion. Although, as we shall show here, the answer to this question is disappointingly positive, much research into o-minimal expansions of ordered, divisible groups was activated by Steinhorn s question (see [12], [2], [6], [7], [8], [5], [14], [10]). The most recent is reported in [9] where many of the natural questions in the case of structures related to R an are settled, but where it is also pointed out that fundamental issues remain unresolved in general. The purpose of this paper is to show that the o-minimal condition places almost no restriction on partial (abelian) group structures that can exist on 1
2 bounded parts of archimedean structures related to R an. The following result gives the flavour of our main theorem. Here, and throughout the paper, we use the convention that if 0 E R and F : E n E, then for r, s E with r < s, F [r,s] : E n E is the function sending x to F ( x) if x E n [r, s] n, and to 0 if x E n \ [r, s] n. Theorem 1. There exists an expansion B; of the ordered ring B := B; 0, 1, <, +, of real algebraic numbers such that the reduct B; 0, 1, <, is isomorphic to the ordered, additive group of rational numbers (with 1 distinguished) and such that both the structures and are o-minimal. B; [r,s] r,s B,r<s B; 0, 1, <, + [r,s], [r,s], r,s B,r<s I should remark that by a result of [6], the domain of an o-minimal structure can support at most two definable ordered groups (up to definable isomorphism) and it follows fairly easily from this that the structure B; itself cannot be o-minimal. However, the second displayed structure in Theorem 1 may be viewed as an expansion of the ordered additive group of rationals, and is certainly a proper expansion (e.g. because its definable closure operator is non-modular), so we do have an answer to Steinhorn s question. In fact, the rationals may be replaced by any countable, archimedean ordered, divisible abelian group and the real algebraics by any countable, archimedean ordered, real closed field. Notice also that Theorem 1 implies that the additive (circle) groups of rationals (mod 1) and real algebraics (mod 1) can coexist o-minimally on the same set. 2 Preliminaries and statements of results A function f : R n R is called restricted analytic if it is of the form F [0,1] : R n R, where F : R n R is analytic at least on some open set U R n with [0, 1] n U. With this notation, if α N n is a multi-index and G : R n R is any function agreeing with the α th derivative F (α) of F on U, then we write f (α) for the restricted analytic function G [0,1]. 2
3 The proof of our main theorem relies heavily on the following result, due to Gabrielov, in which I use R to denote the real ordered field R; 0, 1, <, +,. Proposition 1. Let F be a collection of restricted analytic functions closed under differentiation. Then the structure R; F has a model complete theory and is o-minimal. If we take F to be the collection of all restricted analytic functions, then the corresponding structure R; F is usually denoted R an and was first shown to be model complete by Gabrielov in 1969 (see [3]). The above refinement was established much later in the paper [4]. We can now state our main theorem. Theorem 2. Let F be a countable collection of restricted analytic functions closed under differentiation and set A := R; F. Let B be a countable elementary substructure of A. Then for any countable elementary substructure G of R; 0, 1, <, +, there exists an expansion B, of B such that B; 0, 1, <, = G (where B = dom(b)) and such that the structure B, [r,s] r,s B,r<s is o-minimal. Proof of Theorem 1 assuming Theorem 2. We take F =, B the ordered ring of algebraic numbers and G the ordered additive group of rationals (with 1, as well as 0, distinguished) in Theorem 2. Then all but the very last assertion of Theorem 1 follow immediately. To obtain this as well, we need the following facts and I am grateful to Philip Scowcroft for pointing them out to me (private communication: the crucial result is Theorem 1.1 of [10]): Let D be any expansion of the ordered additive group of rationals (with 0, 1 distinguished) by bounded relations, and let ψ(x) be any formula of L(D). Then (a) there exists q Q such that either p Q with p q, D ψ[p] or p Q with p q, D ψ[p], and (b) for any r, s Q with r < s, there exists a formula θ(x) of L(D), all of whose quantifiers are bounded by closed terms, such that D x[r x s (ψ(x) θ(x))]. Thus, thanks to these results, the o-minimality of the structure B; 0, 1, <, + [r,s], [r,s], r,s B,r<s follows readily from that of B; 0, 1, <, + [r,s], [r,s], [r,s] r,s B,r<s (which, of course, follows immediately from that of B, [r,s] r,s B,r<s ). 3 Towards the proof of the main theorem Let F, A, B, B, G be as in the hypothesis of Theorem 2. Say G = dom(g) so that G is the underlying set of a divisible additive subgroup of R, 0, + 3
4 containing 1. We shall fuse G onto B via the restriction to B of a certain function φ : R R satisfying several properties, the first few of which are as follows:- 3.1 φ is analytic and bijective; 3.2 φ(0) = 0, φ(1) = 1; 3.3 x R φ (1) (x) > 0 (so that φ 1 is also analytic and both φ and φ 1 are monotonically increasing); 3.4 φ maps B bijectively onto G. Now define the function : R 2 R by x y := φ 1 (φ(x) + φ(y)) (for x, y R). Then is analytic and, by 3.4, maps B 2 to B.Also, by , the map φ B is an isomorphism from the structure B; 0, 1, <, to G. In order to establish the o-minimality of the structure B; [r,s] r,s B,r<s consider the expansion A := A;, φ (i) i 1 of A. If 3.5 for all i 1, the i th derivative φ (i) of φ maps B to B, then B; has a (unique) expansion, B say, to a substructure of A. We shall construct φ so that, in addition to , the following holds:- 3.6 B is existentially closed in A. Now before proceeding we need the following Lemma 1. For all multi-indices l, m N 2 with l + m 1, the l, m th derivative x (l,m) y of x y is expressible as a rational function, with integer coefficients, in the quantities φ (i) (x), φ (j) (y) and φ (k) (x y) for 1 i, j, k l + m. A similar result holds for the functions µ N (for N N) defined by N {}}{ µ N (x) := x x x (= φ 1 (N φ(x))) (for x R). Further, the denominators of these expressions are,respectively, powers of φ (1) (x y) and φ (1) (µ N (x)),so by 3.3 they are nowhere vanishing. Proof. Differentiation of the identity φ(x y) = φ(x) + φ(y) yields x (1,0) y = φ(1) (x) φ (1) (x y) and x (0,1) y = 4 φ(1) (y) φ (1) (x y).
5 The result for (both parts) now follows easily by induction on l + m using the chain rule. Similarly µ (1) N (x) = N φ(1) (x) φ (1) (µ N (x)) and so, again by induction, we obtain that µ (1) N (x) is expressible as a rational function, with integer coefficients, in the quantities φ (i) (x), φ (j) (µ N (x)) for 1 i, j l with denominator a power of φ (1) (µ N (x)). Remark: The crucial point in the above expressions is that they do not involve the function φ itself, only its derivatives. Now consider the set { } {µ N : N N} of analytic functions and let H denote its closure under differentiation. Let H res denote the corresponding set {h [0,1] : h H} of restricted analytic functions and let A denote the expansion A; H res of A. Then by Proposition 1, A is o-minimal and has a model complete theory. But by Lemma 1 each function in H res (and H) is certainly existentially definable in A and hence, by 3.6, the structure B has a (unique) expansion to a substructure, B say, of A and, further, B is existentially closed in A. But the theory of A, being model complete, is 2 -axiomatizable so it follows that B is elementarily equivalent to A and hence, by a fundamental result of [11], B is also o-minimal. This obviously implies the o-minimality of its reduct B := B; [0,1], µ N [0,1] N N. However, the presence here of the functions µ N [0,1] clearly implies that all the restricted functions [r,s] (for r, s B, r < s) are definable (with parameters) in B, and hence the structure B; [r,s] r,s B,r<s is o-minimal. Theorem 2 is thus established. So, it remains to construct a function φ : R R satisfying The countably many conditions imposed by 3.5 and 3.6 will be satisfied one by one, and a suitable limit of the inductively defined approximations will then be taken. An appropriate space in which to take such a limit is described in the next section. 4 The Approximation Space I denote by B the set of all entire functions f : C C for which e R M(f; R) is bounded (for R 0) where, as is usual, M(f; R) denotes sup z R f(z), 5
6 and set f := sup e R M(f; R) R 0 for such f. Then B, is easily seen to be a normed linear space. In fact, it is a Banach space. For if f n : n N is any Cauchy sequence in B, then certainly K n N, f n K, so n N, R 0, M(f n ; R) e R K. It follows from Montel s theorem (see [13] page 149 for the exact version that we need here, and see also the subsequent discussion in [13] for why we are working in a complex space even though we are only interested in limits of real functions) that some subsequence f ni : i N of f n : n N converges uniformly on compact subsets of C to an entire function, f say. Let ɛ > 0, and choose N = N(ɛ) large enough so that n, m N f n f m < ɛ/2. Now, for each R > 0 i 0 = i 0 (R) such that M((f f ni0 ), R) < ɛ/2, and we may take i 0 so that n i0 N. It follows that for any n N, M((f f n ), R) M((f f ni0 ), R) + M((f n f ni0 ), R)) < ɛ/2 + e R f n f ni0 < (1 + e R )ɛ/2 and hence f f n < (e R + 1)ɛ/2 < ɛ. Thus the sequence f n : n N converges to f in the space B, as required. Remark: The choice of the dampening factor e R in the definition of is not crucial. We merely require that it dominates every polynomial in R for large R. However, this particular choice does make some later calculations less cumbersome because of the following result. Lemma 2. The map sending f to f (1) is a bounded linear operator on B (with norm e). Proof. Let f B and R > 0. Then for any z C with z R we have, by Cauchy s formula, f (1) (z) = 1 f(w) 2πi C (w z) dw, 2 where C is the circle centred at z and having radius 1. Hence, since w R+1 for w on C, f (1) (z) M(f; R+1) e R+1 f. Thus f (1) e f, as required. We can now state and prove the interpolation property we require of our space B. It is, in fact, a version of the standard Lagrange Interpolation Theorem suitably adapted for present needs. 6
7 Lemma 3. Let n, N be positive integers and K a non-negative integer. Then there exists a positive real number C = C(K, n, N) 1 with the following property: Suppose we are given (i) a 1,..., a n C with a i N and a i a j N 1 for 1 i, j n and i j; (ii) ɛ R with 0 < ɛ < 1; (iii) F B; (iv) non-negative integers K 1,..., K n with K K n = K; (v) b i,j C (for i = 1,..., n, j < K i ) satisfying F (j) (a i ) b i,j < ɛ. Then there exists G B with F G < C ɛ such that G (j) (a i ) = b i,j for each i = 1... n and j < K i. Further, if the a i s and b i,j s are real and if F [R] R, then we may choose G so that G[R] R. Proof. By induction on K. For K = 0 we take C(0, n, N) = 1 and there is nothing to prove. Suppose K > 0 and that C(K 1, n, N) 1 has been found. Set C(K, n, N) := C(K 1, n, N) (2 N 2K (2K 2 + 1) K e N+K + 1). To see that this works, suppose we are given the data as in (i)-(v). Then at least one K i is positive (as K > 0), say K n > 0. By the inductive hypothesis we may choose G 0 B with F G 0 < C(K 1, n, N) ɛ, and such that G (j) 0 (a i ) = b i,j for each i = 1,..., n and j < K i apart from, possibly, the pair i = n and j = K n 1. Now define the functions H, G : C C by and H(z) = n 1 i=1 (z a i) K i n 1 i=1 (a n a i ) K i (z a n) Kn 1, (K n 1)! G(z) = G 0 (z) + H(z) (b n,kn 1 G (Kn 1) 0 (a n )). Since B contains all polynomials (cf, the remark immediately before the statement of Lemma 2) we have that H B and hence G B. Further, for R > 0, e R M(H; R) e R (R+N)K (by (i) and (iv)). But the upper N K 7
8 bound here achieves its maximum at some R 2NK 2, so we obtain that H N 2K (2K 2 + 1) K. Now observe that H (Kn 1) (a n ) = 1 and that H (j) (a i ) = 0 for all other pairs i, j with i = 1,..., n and j < K i and hence, in all cases, G (j) (a i ) = b i,j (by the choice of G 0 ). Notice also that if a i R, b i,j R for i = 1,..., n and j < K i, and if our inductive assumption includes the statement that G 0 [R] R, then G[R] R. So it only remains to calculate the required upper bound for F G. For this, we first note that it follows immediately from Lemma 2 that the map sending f to f (Kn 1) is a bounded linear operator on B of norm e Kn 1. Hence F (Kn 1) G (Kn 1) 0 e Kn 1 F G 0 < e K C(K 1, n, N) ɛ. Thus, using also the lemma hypotheses (v) and (i), we obtain b n,kn 1 G (Kn 1) 0 (a n ) b n,kn 1 F (Kn 1) (a n ) + F (Kn 1) (a n ) G (Kn 1) < ɛ + M(F (Kn 1) G (Kn 1) 0 ; N) ɛ + e N F (Kn 1) G (Kn 1) 0 ɛ(1 + e N+K C(K 1, n, N)). However, by the choice of G 0 and the definition of G, F G 0 (a n ) F G 0 + G G 0 < C(K 1, n, N) ɛ + H b n,kn 1 G (Kn 1) 0 (a n ). Hence, by combining the above inequalities (and also using the fact that C(K 1, n, N) 1 ), we finally obtain that F G < C(K 1, n, N) ɛ + N 2K (2K 2 + 1) K ɛ (1 + e N+K C(K 1, n, N)) C(K 1.n, N)(1 + 2N 2K (2K 2 + 1) K e N+K ) ɛ = C(K, n, N) ɛ, as required. We shall also require the following lemma and definition. Lemma 4. Let V := {f B : C > 1 4, x R, f (1) (x) C e x }. Then V is open in B. Proof. Let f V. Choose C > 1 such that x R, f (1) (x) C e x. 4 Let C = 4C+1, so that C > Let ɛ = (C 1) 1, so that ɛ > e I claim that if g B and g f < ɛ, then g V, thus establishing the lemma. Indeed, we have by Lemma 2 that ɛ > g f e 1 g (1) f (1) and so x R, g (1) (x) f (1) (x) e ɛ e x. Hence, x R, g (1) (x) f (1) (x) e ɛ e x C e x e ɛ e x = C e x, which shows that g V as required. Definition 1. With V as in the statement of Lemma 4, we set V := {f V : f(0) = 0, f(1) = 1 and f[r] R}. 8
9 V is not empty. For example φ 0 V where, for z C, φ 0 (z) := (e e 1 ) 1 (e z e z ). Notice also that if f V and g := f R then g : R R is a real analytic function satisfying g(0) = 0, g(1) = 1 and g (1) (x) 1 for all x R. In 4 particular, g is monotonically increasing and bijective. Further, since convergence with respect to our norm on B certainly implies pointwise convergence, and because of lemma 2, it follows that the same is also true of a function g = f R with f only assumed to lie in the closure (in B) of V. 5 Completion of the proof of Theorem 2 Recall the situation: F is a countable collection of restricted analytic functions (closed under differentiation), A denotes the structure R; F and B is a countable elementary substructure of A. We denote the language of B + by L +, ie. L + is the language of the structure A (or B) together with a new constant symbol c b for each element b of B, where B = dom(b). We are also given a countable elementary substructure G of R; 0, 1, <, + with dom(g) = G, say. Let L + 0 denote the language L + {F i : i 1}, where each F i is a unary function symbol, and let L + 1 denote the language L + 0 {π}, where π is a binary function symbol. If φ : R R is any analytic bijection, then A φ denotes the L + 1 -expansion of A in which F i is interpreted as the i th derivative φ (i) of φ (for i 1) and π by the function φ : R 2 R : x, y φ 1 (φ(x) + φ(y)). Our aim, then, is to construct φ so that are satisfied (for A = A φ and B the (unique) expansion of B to an L + 1 -substructure of A ). As we have already indicated, φ will be the (restriction to R of the) limit in the space B of a Cauchy sequence whose terms lie in V. (Here, and henceforth, V and V denote the sets defined in the statement of Lemma 4 and Definition 1 respectively.) Then 3.1,3.2 and 3.3 will be satisfied by the remarks at the end of the previous section. For 3.4 and 3.5 we require the following definition and lemma. Definition 2. Suppose that ψ B, that Q is a positive integer and that B is a finite subset of B containing 0 and 1. Then ψ is called B, Q -correct if ψ V and, for each b B, ψ(b) G and, for i = 1,..., Q 1, ψ (i) (b) B. Lemma 5. With the notation and assumptions of Definition 2, let ψ be B, Q -correct. Let ɛ > 0 be small enough so that θ B, θ ψ < ɛ 9
10 implies θ V (cf. Lemma 4). Then for any Q N, a B and g G, (i) there is ψ 0 B such that ψ 0 is B {a}, Q -correct, and (ii) there is ψ 1 V and b 0 B such that ψ 1 (b 0 ) = g. Further, for k = 0, 1 we have ψ k ψ < ɛ and, for each b B and j < Q, (b) = ψ(j) (b). ψ (j) k Proof. (i) We may assume that Q > Q and a / B. Say B = {a 1,..., a n 1 } (with the a i s distinct) and write a n for a. Choose N N so that a i N and a i a j N 1 for 1 i, j n with i j. Let C = C(nQ, n, N) (cf Lemma 3). For i = 1,..., n 1, j < Q let b i,j := ψ (j) (a i ) and for Q j < Q choose b i,j B so that ψ (j) (a i ) b i,j < ɛ (using the denseness C of B in R ). Similarly, choose b n,0 G and b n,1,..., b n,q 1 B so that ψ (j) (a n ) b n,j < ɛ for j < C Q. The existence of the required ψ 0 B now follows readily from Lemma 3 and our hypothesis on ɛ. (ii) By the argument at the end of section 4, ψ is surjective, so there exists a R with ψ(a) = g. If a B we may take ψ 1 = ψ. Otherwise, choose N N so large that b N and b b N 1, for all b, b B {a} with b b. Now let C = C(nQ, n, 2N), where n = B + 1, and choose b 0 B to satisfy a b 0 < (2N) 1 and g ψ(b 0 ) < ɛ, and proceed as in (i) to obtain C the desired ψ 1 with ψ 1 (b 0 ) = g. We now state and prove the crucial correction lemma which will allow us to cope with the requirement 3.6. Lemma 6. Let Φ(v 1,..., v m ) be a quantifier-free formula of L + 1 and suppose that B is a finite subset of B containing, as well as 0 and 1, all those elements b of B for which the constant symbol c b occurs in Φ. Suppose further that Q 1 is a natural number greater than all those i 1 such that the function symbol F i occurs in Φ. Now let ψ V be a B, Q -correct function such that the formula Φ(v 1,..., v m ) is satisfiable in the structure A ψ and let ɛ be a positive real number. Then there exists ψ 0 V such that (i) ψ ψ 0 < ɛ, (ii) ψ (j) 0 (b) = ψ (j) (b) for all b B and j < Q, and 10
11 (iii) there exist b 1,..., b m B such that ψ 0 is B {b 1,..., b m }, Q -correct and A ψ0 Φ[b 1,..., b m ]. Proof. We may suppose, by the usual tricks of introducing variables, that Φ has the form (Φ 1 Φ 2 ) Φ 3, where Φ 1 is a quantifier-free L + -formula, Φ 2 is a conjunction of formulas of the form F j (x) = y for 1 j < Q, and Φ 3 is a conjunction of formulas of the form π(x, y) = z, where x, y, z {v 1,..., v m } {c b : b B }. (We are also using the hypotheses on Q and B here.) Notice that such a form of representation of a formula is stable under identification of variables and under substitution of a constant symbol c b (with b B ) for a variable. Hence we may assume (by a suitable inductive hypothesis on m) that Φ(v 1,..., v m ) is satisfied in the structure A ψ by some α 1,..., α m R m with α i / B for i = 1,..., m and α i α j for 1 i, j m, i j. Having fixed such α 1,..., α m, choose N 1 so that a N and a a N 1 for all a, a B {α 1,..., α m } with a a. We now transform Φ 2 (v 1,..., v m ) into a quantifier-free L + -formula in the variables v i, u i,j (for 1 i m, 1 j < Q), Φ 2(v 1,..., v m, ū) say, as follows. Firstly, replace each occurrence of F j (c b ) (for 1 j < Q, b B ) in Φ 2 by the constant symbol c β, where β = ψ (j) (b). (Notice that β B by the B, Q -correctness of ψ.) Secondly, replace each occurrence of F j (v i ) (for 1 j < Q, 1 i m) by the new variable u i,j. Then clearly we have: (*) for any θ V satisfying θ (j) (b) = ψ (j) (b) for all b B and j = 1,..., Q 1, and any γ 1,..., γ m R, A θ (Φ 1 Φ 2 )[γ 1,..., γ m ] A + (Φ 1 Φ 2)[γ 1,..., γ m, δ] where δ denotes the m(q 1)-tuple with i, j -th entry δ i,j := θ (j) (γ i ) (for 1 i m, 1 j < Q), and A + is the natural expansion of A to an L + - structure. In particular, by applying (*) with θ = ψ, γ i = α i and (hence) δ i,j = ψ (j) (α i ) (for 1 i m and 1 j < Q), it follows that for arbitrarily small boxes R mq containing the point α 1,..., α m, δ and having corners in B mq, we have A + v 1,..., v m, ū (Φ 1 Φ 2)(v 1,..., v m, ū). 11
12 But we may transfer this L + -sentence to B + (since B + A + ) and hence obtain a sequence of points α (p) 1,..., α m (p), δ (p) B mq converging to α 1,..., α m, δ as p and each witnessing (in B +, and so in A + ) the formula (Φ 1 Φ 2). Notice also that for each i = 1,..., m, and j = 1,..., Q 1, ψ (j) (α (p) i ) δ (p) i,j 0 as p. As for the formula Φ 3 (v 1,..., v m ), this may be regarded, as it stands, as a formula of the language of the structure R := R; 0, 1, <, +, g g G and we may interpret the function symbol π by + (ie. the usual addition function on R) and the constant symbols c b (for b B ) as ψ(b). (Notice that ψ(b) G for such b by the B, Q -correctness of ψ.) Then, since x ψ y = z if and only if ψ(x) + ψ(y) = ψ(z) (for any x, y, z R), we have (**) for any θ V satisfying θ(b) = ψ(b) for all b B, and any γ 1,..., γ m R, A θ Φ 3 [γ 1,..., γ m ] R Φ 3 [ψ(γ 1 ),..., ψ(γ m )]. Thus,by a similar argument to that following (*) above (except that this time we use the fact that G; g g G R, as given by the hypothesis of Theorem 2), we obtain a sequence of points g (p) 1,..., g m (p) G m converging to ψ(α 1 ),..., ψ(α m ) as p and satisfying in G; g g G, and so also in R, the formula Φ 3. Notice that for each i = 1,..., m, ψ(α (p) i ) g (p) i 0 as p. We now proceed as in the proof of Lemma 5: we let m = B, C = C((m + m ) Q, m + m, 2N) (cf. Lemma 3) and we choose p large enough so that for each i = 1,..., m and j = 1,..., Q 1 we have that ψ (j) (α (p) i ) δ (p) i,j < ɛ and ψ(α(p) C i ) g (p) i < ɛ. We may suppose further C that a 2N and that a a (2N) 1 for a, a B {α (p) 1,..., α m (p) }, a a. Having fixed such a p we now apply Lemma 3, taking {a 1,..., a n } to be B {α (p) 1,..., α m (p) } (keeping the values ψ (j) (b) fixed for b B, j < Q), to obtain a function ψ 0 B satisfying (i) ψ ψ 0 < ɛ, (ii) ψ (j) 0 (b) = ψ (j) (b) for b B, j = 0,..., Q 1, (iii) ψ (j) 0 (α (p) i ) = δ (p) i,j for i = 1,..., m, j = 1,..., Q 1, and (iv) ψ 0 (α (p) i ) = g (p) i for i = 1,..., m. If we now apply (*) and (**) with θ = ψ 0 and γ i = α (p) i for i = 1,..., m, 12
13 we see from (ii), (iii) and (iv) that A ψ0 ((Φ 1 Φ 2 ) Φ 3 )[α (p) 1,..., α m (p) ] and that ψ 0 is B {α (p) 1,..., α m (p) }, Q -correct, as required. Now to complete the proof of Theorem 2 we let E denote the collection of all quantifier-free fromulas of L + 1 and fix an enumeration, Φ n, a n, g n : n 1 say, of the set E B G. Suppose that the variables occuring in the formula Φ n are amongst v 1,..., v mn. Pick φ 0 V (cf. the remark following Definition 1) and choose ɛ 0 > 0 so small that θ V whenever θ B and φ 0 θ < ɛ 0 (cf. Lemma 4). Let B 0 = {0, 1}, Q 0 = 1. Our aim is to construct inductively a sequence φ n : n N of elements of V, finite subsets B 0 B 1 B n of B and integers Q 0 < Q 1 < < Q n <, such that for each n 0 properties (1) n -(7) n below hold. At this point it is convenient to introduce the notation θ 1 θ 2 (mod B, Q), where θ 1, θ 2 B, B B and Q is a positive integer, to mean that θ (j) 1 (b) = θ (j) 2 (b) for each b B and j < Q. (1) n for all b B, if the constant symbol c b occurs in Φ n then b B n ; (2) n for all j 1, if the function symbol F j occurs in Φ n the j < Q n ; (3) n a n B n and φ 1 n (g n ) B n ; (4) n φ n is B n, Q n -correct; (5) n φ n 1 φ n < 2 ɛ 0 3 n ; (6) n φ n φ n 1 (mod B n 1, Q n 1 ); (7) n either for no θ V with φ n θ < ɛ 0 3 n and θ φ n (mod B n, Q n ) is Φ n satisfiable in the structure A θ, or else there exist b 1,..., b mn B n such that A φn Φ n [b 1,..., b mn ]. Now notice that all these conditions hold when n = 0 (mostly vacuously so). So suppose that φ n, B n and Q n have been constructed to satisfy (1) n -(7) n for some n 0. We proceed to construct φ n+1, B n+1 and Q n+1 as follows. Firstly, by repeated use of Lemma 5 (using sufficiently small ɛ s) we may find B n+1 B n, Q n+1 > Q n so that (1) n+1 -(3) n+1 hold, and a function ψ V such that φ n ψ < ɛ 0 3 n 2, ψ is B n+1, Q n+1 -correct and ψ φ n (mod B n, Q n ). (We are using (4) n here.) 13
14 Now if there is no θ V with ψ θ < ɛ 0 3 n 1 and θ ψ (mod B n+1, Q n+1 ) such that Φ n+1 is satisfiable in A θ, then we may set φ n+1 = ψ and (1) n+1 -(7) n+1 are clearly satisfied. Otherwise, choose such a θ. Then we may apply Lemma 6 to obtain a function φ n+1 V such that θ φ n+1 < ɛ 0 3 n 2, φ n+1 θ (mod B n+1, Q n+1 ) and such that there exist b 1,..., b mn B with A φn+1 Φ n [b 1,..., b mn ]. Further, φ n+1 is B n+1 {b 1,..., b mn }, Q n+1 -correct. So if we replace B n+1 by B n+1 {b 1,..., b mn } then (1) n+1 -(4) n+1, (6) n+1 and (7) n+1 are immediate. For (5) n+1 we have φ n+1 φ n φ n θ + θ ψ + ψ φ n < ɛ 0 3 n 2 + ɛ 0 3 n 1 + ɛ 0 3 n 2 < 2 ɛ 0 3 (n+1), which indeed gives (5) n+1 and completes the inductive construction. Now the properties (5) n clearly imply that φ n : n N is a Cauchy sequence in B (consisting of elements of V ) and hence converges to some φ B. By the remarks at the end of Section 4 it follows that the restriction of φ to R satisfies Further, by the properties (6) n these same remarks imply (*) for all n N, φ φ n (mod B n, Q n ). Hence (by the properties (3) n, (4) n ) φ also satisfies 3.5. Finally, to see that φ satisfies 3.6, we require a calculation. For n N let ɛ n := 2 ɛ 0 3 (n+1) φ n φ n+1 so that ɛ n > 0 by (5) n+1. Then for m, n N with m > n we have φ n φ m i=n φ i φ i+1 + φ m+1 φ ɛ n + 2 ɛ 0 m i=n 3 (i+1) + φ m+1 φ (by (5) n+1,..., (5) m+1 ) ɛ n + ɛ 0 3 n (by letting m ). Hence (**) for all n N, φ n φ < ɛ 0 3 n. Notice that by setting n = 0 here it follows, by the definition of ɛ 0, that φ V (so φ V ). Now consider an arbitrary quantifier-free formula of L it will be Φ n (v 1,..., v mn ) for some n - and suppose that it is satisfiable in the structure A φ. By applying (7) n with θ = φ, it follows from (*) and (**) (and the comment following (**)) that A φn Φ n [b 1,..., b mn ] for some b 1,..., b mn B n. But by (1) n, 14
15 (2) n and (*) this clearly implies that A φ Φ n [b 1,..., b mn ]. This establishes 3.6 (recall the comments at the beginning of this section) and completes the proof of the main theorem. References [1] L van den Dries, Remarks on Tarski s problem concerning R, +,, exp, Logic colloquium 1982, North Holland, 1984, [2] M Edmundo, Structure theorems for o-minimal expansions of groups, Annals of Pure and Applied Logic 102 (2000), [3] A Gabrielov, Projections of semianalytic sets, Funct. Anal. Appl. 2 (1968), [4] A Gabrielov, Complements of subanalytic sets and existential formulas for analytic functions, Inv. Math. 125 (1996), [5] D Marker,Y Peterzil and A Pillay, Additive reducts of real closed fields, J Symb Logic 57 (1992), [6] C Miller and S Starchenko, A growth dichotomy for o-minimal expansions of ordered groups, TAMS 350 (1998), [7] Y Peterzil, A structure theorem for semibounded sets in the reals, J. Symb. Logic 57 (1992), [8] Y Peterzil, Reducts of some structures over the reals, J. Symb. Logic 58 (1993), [9] Y Peterzil and S Starchenko, On torsion-free groups in o-minimal structures, preprint (September,2003). [10] A Pillay,P Scowcroft and C Steinhorn, Between groups and rings, Rocky Mountain J of Math. 19(3) 1989, [11] A Pillay and C Steinhorn, Definable sets in ordered structures,i, TAMS 295 (1986), [12] R Poston, Defining multiplication in o-minimal expansions of the positive reals, J. Symb. Logic 60 (1995),
16 [13] R Remmert, Classical topics in complex function theory, Springer, [14] A Strzebonski, One-dimensional groups definable in o-minimal structures, J. Pure and Applied Algebra 96 (1994),
An introduction to o-minimality
An introduction to o-minimality Notes by Tom Foster and Marcello Mamino on lectures given by Alex Wilkie at the MODNET summer school, Berlin, September 2007 1 Introduction Throughout these notes definable
More informationMASTERS EXAMINATION IN MATHEMATICS SOLUTIONS
MASTERS EXAMINATION IN MATHEMATICS PURE MATHEMATICS OPTION SPRING 010 SOLUTIONS Algebra A1. Let F be a finite field. Prove that F [x] contains infinitely many prime ideals. Solution: The ring F [x] of
More informationVC-DENSITY FOR TREES
VC-DENSITY FOR TREES ANTON BOBKOV Abstract. We show that for the theory of infinite trees we have vc(n) = n for all n. VC density was introduced in [1] by Aschenbrenner, Dolich, Haskell, MacPherson, and
More informationMATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5
MATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5.. The Arzela-Ascoli Theorem.. The Riemann mapping theorem Let X be a metric space, and let F be a family of continuous complex-valued functions on X. We have
More informationINTRODUCTION TO REAL ANALYTIC GEOMETRY
INTRODUCTION TO REAL ANALYTIC GEOMETRY KRZYSZTOF KURDYKA 1. Analytic functions in several variables 1.1. Summable families. Let (E, ) be a normed space over the field R or C, dim E
More informationMASTERS EXAMINATION IN MATHEMATICS
MASTERS EXAMINATION IN MATHEMATICS PURE MATH OPTION, Spring 018 Full points can be obtained for correct answers to 8 questions. Each numbered question (which may have several parts) is worth 0 points.
More informationA SIMPLE PROOF OF THE MARKER-STEINHORN THEOREM FOR EXPANSIONS OF ORDERED ABELIAN GROUPS
A SIMPLE PROOF OF THE MARKER-STEINHORN THEOREM FOR EXPANSIONS OF ORDERED ABELIAN GROUPS ERIK WALSBERG Abstract. We give a short and self-contained proof of the Marker- Steinhorn Theorem for o-minimal expansions
More informationLöwenheim-Skolem Theorems, Countable Approximations, and L ω. David W. Kueker (Lecture Notes, Fall 2007)
Löwenheim-Skolem Theorems, Countable Approximations, and L ω 0. Introduction David W. Kueker (Lecture Notes, Fall 2007) In its simplest form the Löwenheim-Skolem Theorem for L ω1 ω states that if σ L ω1
More informationRepresenting Scott Sets in Algebraic Settings
Representing Scott Sets in Algebraic Settings Alf Dolich Kingsborough Community College Julia F. Knight University of Notre Dame Karen Lange Wellesley College David Marker University of Illinois at Chicago
More informationVAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0. Contents
VAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0 BENJAMIN LEDEAUX Abstract. This expository paper introduces model theory with a focus on countable models of complete theories. Vaught
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationChapter 3: Baire category and open mapping theorems
MA3421 2016 17 Chapter 3: Baire category and open mapping theorems A number of the major results rely on completeness via the Baire category theorem. 3.1 The Baire category theorem 3.1.1 Definition. A
More informationGROUPS DEFINABLE IN O-MINIMAL STRUCTURES
GROUPS DEFINABLE IN O-MINIMAL STRUCTURES PANTELIS E. ELEFTHERIOU Abstract. In this series of lectures, we will a) introduce the basics of o- minimality, b) describe the manifold topology of groups definable
More informationCommutative Banach algebras 79
8. Commutative Banach algebras In this chapter, we analyze commutative Banach algebras in greater detail. So we always assume that xy = yx for all x, y A here. Definition 8.1. Let A be a (commutative)
More informationPRESERVATION THEOREMS IN LUKASIEWICZ MODEL THEORY
Iranian Journal of Fuzzy Systems Vol. 10, No. 3, (2013) pp. 103-113 103 PRESERVATION THEOREMS IN LUKASIEWICZ MODEL THEORY S. M. BAGHERI AND M. MONIRI Abstract. We present some model theoretic results for
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationRepresenting Scott Sets in Algebraic Settings
Wellesley College Wellesley College Digital Scholarship and Archive Faculty Research and Scholarship 8-2015 Representing Scott Sets in Algebraic Settings Alf Dolich Julia F. Knight Karen Lange klange2@wellesley.edu
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationMAT1000 ASSIGNMENT 1. a k 3 k. x =
MAT1000 ASSIGNMENT 1 VITALY KUZNETSOV Question 1 (Exercise 2 on page 37). Tne Cantor set C can also be described in terms of ternary expansions. (a) Every number in [0, 1] has a ternary expansion x = a
More informationSolutions to Unique Readability Homework Set 30 August 2011
s to Unique Readability Homework Set 30 August 2011 In the problems below L is a signature and X is a set of variables. Problem 0. Define a function λ from the set of finite nonempty sequences of elements
More information2.2 Lowenheim-Skolem-Tarski theorems
Logic SEP: Day 1 July 15, 2013 1 Some references Syllabus: http://www.math.wisc.edu/graduate/guide-qe Previous years qualifying exams: http://www.math.wisc.edu/ miller/old/qual/index.html Miller s Moore
More informationAN INTRODUCTION TO GEOMETRIC STABILITY THEORY
AN INTRODUCTION TO GEOMETRIC STABILITY THEORY SALMAN SIDDIQI Abstract. In this paper, we will introduce some of the most basic concepts in geometric stability theory, and attempt to state a dichotomy theorem
More informationIntroduction to Model Theory
Introduction to Model Theory Charles Steinhorn, Vassar College Katrin Tent, University of Münster CIRM, January 8, 2018 The three lectures Introduction to basic model theory Focus on Definability More
More informationPosets, homomorphisms and homogeneity
Posets, homomorphisms and homogeneity Peter J. Cameron and D. Lockett School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K. Abstract Jarik Nešetřil suggested
More informationMath 320-2: Midterm 2 Practice Solutions Northwestern University, Winter 2015
Math 30-: Midterm Practice Solutions Northwestern University, Winter 015 1. Give an example of each of the following. No justification is needed. (a) A metric on R with respect to which R is bounded. (b)
More informationLimit computable integer parts
Limit computable integer parts Paola D Aquino, Julia Knight, and Karen Lange July 12, 2010 Abstract Let R be a real closed field. An integer part I for R is a discretely ordered subring such that for every
More informationMETRIC HEIGHTS ON AN ABELIAN GROUP
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 44, Number 6, 2014 METRIC HEIGHTS ON AN ABELIAN GROUP CHARLES L. SAMUELS ABSTRACT. Suppose mα) denotes the Mahler measure of the non-zero algebraic number α.
More informationFREMLIN TENSOR PRODUCTS OF CONCAVIFICATIONS OF BANACH LATTICES
FREMLIN TENSOR PRODUCTS OF CONCAVIFICATIONS OF BANACH LATTICES VLADIMIR G. TROITSKY AND OMID ZABETI Abstract. Suppose that E is a uniformly complete vector lattice and p 1,..., p n are positive reals.
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016 1. Please write your 1- or 2-digit exam number on
More informationContinued fractions for complex numbers and values of binary quadratic forms
arxiv:110.3754v1 [math.nt] 18 Feb 011 Continued fractions for complex numbers and values of binary quadratic forms S.G. Dani and Arnaldo Nogueira February 1, 011 Abstract We describe various properties
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationPRIME NUMBER THEOREM
PRIME NUMBER THEOREM RYAN LIU Abstract. Prime numbers have always been seen as the building blocks of all integers, but their behavior and distribution are often puzzling. The prime number theorem gives
More informationIntroduction to Bases in Banach Spaces
Introduction to Bases in Banach Spaces Matt Daws June 5, 2005 Abstract We introduce the notion of Schauder bases in Banach spaces, aiming to be able to give a statement of, and make sense of, the Gowers
More informationQualifying Exam Logic August 2005
Instructions: Qualifying Exam Logic August 2005 If you signed up for Computability Theory, do two E and two C problems. If you signed up for Model Theory, do two E and two M problems. If you signed up
More informationOn expansions of the real field by complex subgroups
On expansions of the real field by complex subgroups University of Illinois at Urbana-Champaign July 21, 2016 Previous work Expansions of the real field R by subgroups of C have been studied previously.
More informationTopological properties of Z p and Q p and Euclidean models
Topological properties of Z p and Q p and Euclidean models Samuel Trautwein, Esther Röder, Giorgio Barozzi November 3, 20 Topology of Q p vs Topology of R Both R and Q p are normed fields and complete
More informationMASTERS EXAMINATION IN MATHEMATICS
MASTERS EXAMINATION IN MATHEMATICS PURE MATHEMATICS OPTION FALL 2007 Full points can be obtained for correct answers to 8 questions. Each numbered question (which may have several parts) is worth the same
More informationGeometry of subanalytic and semialgebraic sets, by M. Shiota, Birkhäuser, Boston, MA, 1997, xii+431 pp., $89.50, ISBN
BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 36, Number 4, ages 523 527 S 0273-0979(99)00793-4 Article electronically published on July 27, 1999 Geometry of subanalytic and semialgebraic
More informationRIEMANN MAPPING THEOREM
RIEMANN MAPPING THEOREM VED V. DATAR Recall that two domains are called conformally equivalent if there exists a holomorphic bijection from one to the other. This automatically implies that there is an
More informationISAAC GOLDBRING AND THOMAS SINCLAIR
ON THE AXIOMATIZABILITY OF C -ALGEBRAS AS OPERATOR SYSTEMS ISAAC GOLDBRING AND THOMAS SINCLAIR Abstract. We show that the class of unital C -algebras is an elementary class in the language of operator
More informationExercise Solutions to Functional Analysis
Exercise Solutions to Functional Analysis Note: References refer to M. Schechter, Principles of Functional Analysis Exersize that. Let φ,..., φ n be an orthonormal set in a Hilbert space H. Show n f n
More informationNOTES ON O-MINIMALITY
NOTES ON O-MINIMALITY 1. O-minimality In what follows, < is a binary relation symbol and L ord is the language with just this symbol, that is to say, L ord is the language of ordered structures. We will
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More informationMORLEY S CATEGORICITY THEOREM
MORLEY S CATEGORICITY THEOREM NICK RAMSEY Abstract. A theory is called κ-categorical, or categorical in power κ, if it has one model up to isomorphism of cardinality κ. Morley s Categoricity Theorem states
More informationSyntactic Characterisations in Model Theory
Department of Mathematics Bachelor Thesis (7.5 ECTS) Syntactic Characterisations in Model Theory Author: Dionijs van Tuijl Supervisor: Dr. Jaap van Oosten June 15, 2016 Contents 1 Introduction 2 2 Preliminaries
More informationMODEL THEORY FOR ALGEBRAIC GEOMETRY
MODEL THEORY FOR ALGEBRAIC GEOMETRY VICTOR ZHANG Abstract. We demonstrate how several problems of algebraic geometry, i.e. Ax-Grothendieck, Hilbert s Nullstellensatz, Noether- Ostrowski, and Hilbert s
More informationPart V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory
Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite
More informationWEIERSTRASS THEOREMS AND RINGS OF HOLOMORPHIC FUNCTIONS
WEIERSTRASS THEOREMS AND RINGS OF HOLOMORPHIC FUNCTIONS YIFEI ZHAO Contents. The Weierstrass factorization theorem 2. The Weierstrass preparation theorem 6 3. The Weierstrass division theorem 8 References
More information08a. Operators on Hilbert spaces. 1. Boundedness, continuity, operator norms
(February 24, 2017) 08a. Operators on Hilbert spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2016-17/08a-ops
More informationCategoricity Without Equality
Categoricity Without Equality H. Jerome Keisler and Arnold W. Miller Abstract We study categoricity in power for reduced models of first order logic without equality. 1 Introduction The object of this
More informationtp(c/a) tp(c/ab) T h(m M ) is assumed in the background.
Model Theory II. 80824 22.10.2006-22.01-2007 (not: 17.12) Time: The first meeting will be on SUNDAY, OCT. 22, 10-12, room 209. We will try to make this time change permanent. Please write ehud@math.huji.ac.il
More informationFundamentals of Model Theory
Fundamentals of Model Theory William Weiss and Cherie D Mello Department of Mathematics University of Toronto c 2015 W.Weiss and C. D Mello 1 Introduction Model Theory is the part of mathematics which
More informationBasic counting techniques. Periklis A. Papakonstantinou Rutgers Business School
Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED
More information4.6 Montel's Theorem. Robert Oeckl CA NOTES 7 17/11/2009 1
Robert Oeckl CA NOTES 7 17/11/2009 1 4.6 Montel's Theorem Let X be a topological space. We denote by C(X) the set of complex valued continuous functions on X. Denition 4.26. A topological space is called
More informationMargulis Superrigidity I & II
Margulis Superrigidity I & II Alastair Litterick 1,2 and Yuri Santos Rego 1 Universität Bielefeld 1 and Ruhr-Universität Bochum 2 Block seminar on arithmetic groups and rigidity Universität Bielefeld 22nd
More informationLecture 2: Syntax. January 24, 2018
Lecture 2: Syntax January 24, 2018 We now review the basic definitions of first-order logic in more detail. Recall that a language consists of a collection of symbols {P i }, each of which has some specified
More informationMath 396. Quotient spaces
Math 396. Quotient spaces. Definition Let F be a field, V a vector space over F and W V a subspace of V. For v, v V, we say that v v mod W if and only if v v W. One can readily verify that with this definition
More informationOn divisibility in definable groups
On divisibility in definable groups Margarita Otero Departamento de Matemáticas Universidad Autónoma de Madrid 28049 Madrid, Spain margarita.otero@uam.es December 10, 2008 Abstract Let M be an o minimal
More informationProperties of O-minimal Exponential Fields
1 Universität Konstanz, Fachbereich Mathematik und Statistik 11 September 2017 19th ÖMG Congress and Annual DMV Meeting 1 Supported by DVMLG-Nachwuchsstipendium 1 Preliminary Notions 2 Decidability of
More informationFINITE MODEL THEORY (MATH 285D, UCLA, WINTER 2017) LECTURE NOTES IN PROGRESS
FINITE MODEL THEORY (MATH 285D, UCLA, WINTER 2017) LECTURE NOTES IN PROGRESS ARTEM CHERNIKOV 1. Intro Motivated by connections with computational complexity (mostly a part of computer scientice today).
More informationMath 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative
Math 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative This chapter is another review of standard material in complex analysis. See for instance
More informationLebesgue Measure on R n
CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationDefinability in the Enumeration Degrees
Definability in the Enumeration Degrees Theodore A. Slaman W. Hugh Woodin Abstract We prove that every countable relation on the enumeration degrees, E, is uniformly definable from parameters in E. Consequently,
More information11 COMPLEX ANALYSIS IN C. 1.1 Holomorphic Functions
11 COMPLEX ANALYSIS IN C 1.1 Holomorphic Functions A domain Ω in the complex plane C is a connected, open subset of C. Let z o Ω and f a map f : Ω C. We say that f is real differentiable at z o if there
More informationMath 225A Model Theory. Speirs, Martin
Math 5A Model Theory Speirs, Martin Autumn 013 General Information These notes are based on a course in Metamathematics taught by Professor Thomas Scanlon at UC Berkeley in the Autumn of 013. The course
More informationMath 676. A compactness theorem for the idele group. and by the product formula it lies in the kernel (A K )1 of the continuous idelic norm
Math 676. A compactness theorem for the idele group 1. Introduction Let K be a global field, so K is naturally a discrete subgroup of the idele group A K and by the product formula it lies in the kernel
More informationCompact operators on Banach spaces
Compact operators on Banach spaces Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto November 12, 2017 1 Introduction In this note I prove several things about compact
More informationMASTERS EXAMINATION IN MATHEMATICS
MASTERS EXAMINATION IN MATHEMATICS PURE MATHEMATICS OPTION FALL 2010 Full points can be obtained for correct answers to 8 questions. Each numbered question (which may have several parts) is worth 20 points.
More informationWalker Ray Econ 204 Problem Set 3 Suggested Solutions August 6, 2015
Problem 1. Take any mapping f from a metric space X into a metric space Y. Prove that f is continuous if and only if f(a) f(a). (Hint: use the closed set characterization of continuity). I make use of
More informationCHEVALLEY S THEOREM AND COMPLETE VARIETIES
CHEVALLEY S THEOREM AND COMPLETE VARIETIES BRIAN OSSERMAN In this note, we introduce the concept which plays the role of compactness for varieties completeness. We prove that completeness can be characterized
More information2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31
Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15
More informationOn the strong cell decomposition property for weakly o-minimal structures
On the strong cell decomposition property for weakly o-minimal structures Roman Wencel 1 Instytut Matematyczny Uniwersytetu Wroc lawskiego ABSTRACT We consider a class of weakly o-minimal structures admitting
More informationPartial Collapses of the Σ 1 Complexity Hierarchy in Models for Fragments of Bounded Arithmetic
Partial Collapses of the Σ 1 Complexity Hierarchy in Models for Fragments of Bounded Arithmetic Zofia Adamowicz Institute of Mathematics, Polish Academy of Sciences Śniadeckich 8, 00-950 Warszawa, Poland
More informationBasics of Model Theory
Chapter udf Basics of Model Theory bas.1 Reducts and Expansions mod:bas:red: defn:reduct mod:bas:red: prop:reduct Often it is useful or necessary to compare languages which have symbols in common, as well
More informationImmerse Metric Space Homework
Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps
More informationModel theory, algebraic dynamics and local fields
Model theory, algebraic dynamics and local fields Thomas Scanlon University of California, Berkeley 8 June 2010 Thomas Scanlon (University of California, Berkeley) Model theory, algebraic dynamics and
More informationSOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL VALUES GUY KATRIEL PREPRINT NO /4
SOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL VALUES GUY KATRIEL PREPRINT NO. 2 2003/4 1 SOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL
More informationMath 426 Homework 4 Due 3 November 2017
Math 46 Homework 4 Due 3 November 017 1. Given a metric space X,d) and two subsets A,B, we define the distance between them, dista,b), as the infimum inf a A, b B da,b). a) Prove that if A is compact and
More informationDefinable henselian valuation rings
Definable henselian valuation rings Alexander Prestel Abstract We give model theoretic criteria for the existence of and - formulas in the ring language to define uniformly the valuation rings O of models
More informationBERNARD RUSSO. University of California, Irvine
A HOLOMORPHIC CHARACTERIZATION OF OPERATOR ALGEBRAS (JOINT WORK WITH MATT NEAL) BERNARD RUSSO University of California, Irvine UNIVERSITY OF CALIFORNIA, IRVINE ANALYSIS SEMINAR OCTOBER 16, 2012 KEYWORDS
More informationCHAPTER 8: EXPLORING R
CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationMath 328 Course Notes
Math 328 Course Notes Ian Robertson March 3, 2006 3 Properties of C[0, 1]: Sup-norm and Completeness In this chapter we are going to examine the vector space of all continuous functions defined on the
More informationMore Model Theory Notes
More Model Theory Notes Miscellaneous information, loosely organized. 1. Kinds of Models A countable homogeneous model M is one such that, for any partial elementary map f : A M with A M finite, and any
More informationStanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon Measures
2 1 Borel Regular Measures We now state and prove an important regularity property of Borel regular outer measures: Stanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon
More informationTheorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers
Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower
More informationDiscrete Mathematics. Benny George K. September 22, 2011
Discrete Mathematics Benny George K Department of Computer Science and Engineering Indian Institute of Technology Guwahati ben@iitg.ernet.in September 22, 2011 Set Theory Elementary Concepts Let A and
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationFirst In-Class Exam Solutions Math 410, Professor David Levermore Monday, 1 October 2018
First In-Class Exam Solutions Math 40, Professor David Levermore Monday, October 208. [0] Let {b k } k N be a sequence in R and let A be a subset of R. Write the negations of the following assertions.
More informationThe constructible universe
The constructible universe In this set of notes I want to sketch Gödel s proof that CH is consistent with the other axioms of set theory. Gödel s argument goes well beyond this result; his identification
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationContents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3
Analysis Math Notes Study Guide Real Analysis Contents Ordered Fields 2 Ordered sets and fields 2 Construction of the Reals 1: Dedekind Cuts 2 Metric Spaces 3 Metric Spaces 3 Definitions 4 Separability
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #18 11/07/2013
18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #18 11/07/2013 As usual, all the rings we consider are commutative rings with an identity element. 18.1 Regular local rings Consider a local
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationBernstein s analytic continuation of complex powers
(April 3, 20) Bernstein s analytic continuation of complex powers Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/. Analytic continuation of distributions 2. Statement of the theorems
More informationAlgebras with finite descriptions
Algebras with finite descriptions André Nies The University of Auckland July 19, 2005 Part 1: FA-presentability A countable structure in a finite signature is finite-automaton presentable (or automatic)
More informationPart II. Logic and Set Theory. Year
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 60 Paper 4, Section II 16G State and prove the ǫ-recursion Theorem. [You may assume the Principle of ǫ- Induction.]
More informationCONSTRUCTION OF THE REAL NUMBERS.
CONSTRUCTION OF THE REAL NUMBERS. IAN KIMING 1. Motivation. It will not come as a big surprise to anyone when I say that we need the real numbers in mathematics. More to the point, we need to be able to
More informationComplex Analysis Qualifying Exam Solutions
Complex Analysis Qualifying Exam Solutions May, 04 Part.. Let log z be the principal branch of the logarithm defined on G = {z C z (, 0]}. Show that if t > 0, then the equation log z = t has exactly one
More informationDiscriminating groups and c-dimension
Discriminating groups and c-dimension Alexei Myasnikov Pavel Shumyatsky April 8, 2002 Abstract We prove that every linear discriminating (square-like) group is abelian and every finitely generated solvable
More information