DEFINABLE TYPES IN PRESBURGER ARITHMETIC
|
|
- Daniella Booth
- 7 years ago
- Views:
Transcription
1 DEFINABLE TYPES IN PRESBURGER ARITHMETIC GABRIEL CONANT Abstract. We consider the first order theory of (Z, +, <), also known as Presburger arithmetic. We prove a characterization of definable types in terms of prime models over realizations, which has a similar flavor to the Marker-Steinhorn Theorem of o-minimality. We also prove that a type over a model is definable if and only if it has a unique coheir to any elementary extension, which is a characterization of definable types that Presburger arithmetic shares with stable theories and o-minimal theories. 1. Presburger Arithmetic Let L = {+,, 0, 1, <} and let T P r = Th(Z, +,, 0, 1, <). Note that all integers in Z are definable from + and <. We specify the following definable relations: (1) For n Z +, a unary predicate P n defining the elements divisible by n, i.e., T P r = x(p n (x) y ny = x). (2) For n Z +, a binary relation n defining congruence mod n, i.e. T P r = x y(x n y P n (x y)). Note that nx is shorthand for x x (n times). We will also use n x to mean P n (x). Theorem ] T P r has quantifier elimination in the language L {P n : n Z + }. See 2, Section 3.1] for more details on T P r, including a full axiomatization in L {P n : n Z + }. An important property of T P r, which is shown in 1] and follows easily from quantifier elimination, is that it is quasi-o-minimal, i.e., for any M = T P r, any definable subset of M (in one dimension) is a Boolean combination of -definable sets and intervals with endpoints in M. For the rest of this section, let M = T P r. Definition 1.2. Let a, b M with a < b. For n Z +, set b a = n if M =! n 1 x a < x < b. If there is no such n, set b a =. Set b a = 0 for a = b; and let a b = b a. Date: March 26,
2 2 GABRIEL CONANT Note that if a, b M then a b < if and only if b a Z. Moreover, if a, b M such that a < b and b a =, then a + k < b k for all k N. Definition 1.3. Given A M, let A be the subgroup of M generated by A. Let cl(a) be the divisible hull of A {1}, i.e., x cl(a) if and only if there are n Z +, k 1,..., k m, l Z and a 1,..., a m A such that nx = k 1 a k n a n + l. Theorem 1.4. Let A M. Then dcl(a) = acl(a) = cl(a). Proof. Let A 1 = A {1} and suppose w acl(a). By quantifier elimination, w is one of only finitely many solutions to a formula ϕ(x) of the form i I 0 m i x = a i i I 1 b i < m i x < c i k j (n j x + d j ) k j (n j x + d j ), j J 0 j J 1 } {{ } θ(x) where a i, d j A 1, b i A 1 {- }, c i A 1 { }, m i, n j Z, and k j Z +. If I 0 then w cl(a), so assume I 0 =. Set k = j J 0 J 1 k j. We have k j (n j w + b j ) for all j J 0 and k j (n j w + b j ) for all j J 1. It follows that for all m Z, k j (n j (w + mk) + b j ) for all j J 0 and k j (n j (w + mk) + b j ) for all j J 1. Therefore {w + mk : m Z} is an infinite set of solutions to θ(x). For any i I 1, if b i m i w < then m i w = b i + r for some r Z and so m i w A 1, which implies w cl(a). Similarly, if c i m i w < then x cl(a). So assume, towards a contradiction, that b i m i x = = c i m i x for all i I 1, and so b i < m i (w + rk) < c i for all r Z. Then {w + rk : k Z} is an infinite set of solutions to ϕ(x), which is a contradiction. Now suppose a cl(a). Then we have ma A 1 for some m Z +, and so ma is an L(A)-term. It follows that a is the unique solution to the L(A)-formula mx = ma, so a dcl(a). Altogether, we have shown acl(a) cl(a) dcl(a), which proves the result. Proposition 1.5. Any nonempty definable subset of M with a lower bound has a least element. Proof. Any nonempty subset of Z with a lower bound has a least element. So for any ϕ(x, ȳ) L, we can express this property with a sentence in T P r. In particular, Z = ȳ ( xϕ(x, ȳ) t x(ϕ(x, ȳ) t x) ) t ( ϕ(t, ȳ) x(ϕ(x, ȳ) t x) )]. Therefore, for any b M, we have the result for ϕ(m, b) by elementarity. Corollary 1.6. T P r has definable Skolem functions.
3 Proof. Suppose ϕ(x, ȳ) is an L-formula. DEFINABLE TYPES IN PRESBURGER ARITHMETIC 3 For any b, if ϕ(m, b) is bounded above then it has a greatest element, and otherwise ϕ(m, b) has a least positive element. So we can define the following Skolem function: f(ȳ) = x ϕ(x, ȳ) z > x ϕ(z, ȳ) ( z t > z ϕ(t, ȳ) x > 0 z ( 0 < z < x ϕ(z, ȳ) ))] From the last corollary, it follows that the definable closure of any set is a model of T P r. In particular, if M N and ā N, then we use the notation M(ā) for cl(mā). 2. Irreducible Types and Cuts Definition 2.1. A type p S n (M) is reducible if there is some 1 i n and ψ( x) L(M) such that p is irreducible if it is not reducible. p ψ( x)!xψ(x 1,..., x i 1, x, x i+1,..., x n ). Note that p S n (M) is reducible if and only if for some (equivalently all) realizations ā = p, there is some 1 i n such that a i M(a 1... a i 1 a i+1... a n ). Definition 2.2. (1) Let Z n := Z n \{ 0}. Given variables x 1,..., x n and k = (k 1,..., k n ) Z n we define the L-term s k( x) := k 1 x k n x n. (2) Given C M, C is downwards closed if c C and a < c implies a C, for all a, c M. C is finitely upwards closed if c C implies c + m C, for all m Z + and c M. C is a cut if it is downwards closed and finitely upwards closed. Note that if C is a cut then C has no maximal element and M\C has no minimal element. (3) Fix p S n (M). Given 1 i n, let σ i : Z + N such that for all m Z +, we have σ i (m) < m and p x i m σ i (m). Set σ p = (σ 1,..., σ n ). Next, given k Z n, define C k p := {c M : p s k( x) > c}.
4 4 GABRIEL CONANT Lemma 2.3. Suppose p S n (M) is irreducible. Then for all k Z n, C k p is a cut. Proof. Fix k Z n. Then C k p is clearly downwards closed. If C k p is not finitely upwards closed then it follows that p s k( x) = c for some c M. By assumption, there is some k i 0. Therefore if ā = p then a i M(a 1... a i 1 a i+1... a n ), contradicting that p is irreducible. Proposition 2.4. Suppose p, q S n (M) are irreducible such that σ p = σ q and C k p = C k q for all k Z n. Then p = q. Proof. By quantifier elimination, it suffices to show that p and q agree on atomic L(M)-formulas in variables x 1,..., x n. These are of the form (i) s k( x) = c, (ii) s k( x) > c, (iii) P m (s k( x) + c), where k Z n, c M, and m Z +. Since p and q are irreducible, it follows by Lemma 2.3 that both p and q must contain the negation of all formulas in (i). Moreover, p and q agree on all formulas in (ii) since C k p = C k q for all k Z n. Let ā = p and b = q in some elementary extension of M. Let σ p = (σ 1,..., σ n ) and σ q = (τ 1,..., τ n ). Then σ i = τ i for all 1 i n by assumption. Therefore, for all 1 i n and for all m Z +, we have a i m σ i (m) = τ i (m) m b i. By properties of modular arithmetic, it follows that for all k Z n, c M, and m Z +, we have s k(ā)+c m s k( b) + c. Therefore p P m (s k( x) + c) if and only if q P m (s k( x) + c). 3. Definable Types Definition 3.1. Let p S n (A) and B A. Then p is definable over B if for all L-formulas ϕ( x, ȳ), there is an L(B)-formula d p ϕ](ȳ) such that for all ā A, ϕ( x, ā) p = d p ϕ](ā). A type p S n (A) is definable if it is definable over B for some B A. Definition 3.2. Suppose p S n (M) is reducible. Pick i minimal such that a i M(a 1... a i 1 a i+1... a n ) for any ā = p, and define p red := p x1...x i 1x i+1...x n S n 1 (M).
5 DEFINABLE TYPES IN PRESBURGER ARITHMETIC 5 Proposition 3.3. Let p S n (M) be a reducible type (here T can be any complete theory). (a) p is definable if and only if p red is definable. (b) For all N M and q S n 1 (N ) extending p red, there is a unique q S n (N ) such that q p q. Proof. Part (a). If p is definable then p red is definable by definition. Conversely, suppose p red is definable. Without loss of generality, suppose ψ( x, z) L and c M are such that ψ( x, c)!xψ(x 1,..., x n 1, x, c) p, and so p red = p x1...x n 1. Fix ϕ( x, ȳ) L. Then for b M, we have ϕ( x, b) p x(ϕ(x 1,..., x n 1, x, b) ψ(x 1,..., x n 1, x, c)) p red M = d pred x(ϕ(x1,..., x n 1, x, ȳ) ψ(x 1,..., x n 1, x, z)) ] ( b, c). Therefore p is definable via d p ϕ( x, ȳ)](ȳ) := d pred x(ϕ(x1,..., x n 1, x, ȳ) ψ(x 1,..., x n 1, x, z)) ] (ȳ, c) L(M). Part (b). Fix N M and q S n 1 (N ) extending p red. Suppose q 1, q 2 S n (N ) are such that q p q 1 and q p q 2. Let ψ( x) = ψ( x, c) L(M) be as in part (a). Let ā i = q i, for i = 1, 2, in some elementary extension M of N. Then ā i := (a i 1,..., a i n 1) = q for i = 1, 2, so there is some σ Aut(M/N ) such that σ(ā 1 ) = ā 2. By assumption, q i ψ( x)!xψ(x 1,..., x n 1, x) for i = 1, 2. Therefore ψ(a 1 1,..., a 1 n 1, M) = {a 1 n} and ψ(a 2 1,..., a 2 n 1, M) = {a 2 n} But M = ψ(a 2 1,..., a 2 n 1, σ(a 1 n)), and so σ(a 1 n) = a 2 n. Therefore σ(ā 1 ) = ā 2, which implies q 1 = tp(ā 1 /N ) = tp(ā 2 /N ) = q 2. Definition 3.4. Let M = T P r and N M. Then N is an end extension of M if for all x N \M, either x > c for all c M, or x < c for all c M. A type p S n (M) is an end type if M(ā) is a proper end extension of M for some (i.e., all) ā = p. Proposition 3.5. Any irreducible end type is definable. Proof. By quantifier elimination it suffices to give definitions for the atomic formulas s k( x) = t(ȳ), s k( x) > t(ȳ) and P l (s k( x) + t(ȳ)), where t(ȳ) is an L-term, k Z n, and l Z +. Fix ā = p. Since p is irreducible, we have by Lemma 2.3 that k Z n implies s k(ā) M. But M(ā) is a proper end extension of M, which implies that for all k Z n, we either have s k(ā) < M or s k(ā) > M. Therefore we can partition Z n into S + S where S + := { k : s k(ā) > M} and S := { k : s k(ā) < M}.
6 6 GABRIEL CONANT Given k Z n and l Z +, let m( k, l) {0,..., l 1} such that s k(ā) l m( k, l). It follows that for any k Z n, any l Z +, and any ā = p, we have (1) s k(ā ) > M if k S + ; (2) s k(ā ) < M if k S ; (3) s k(ā ) l m( k, l). Therefore we can use the following definitions for p: d p s k( x) = t(ȳ) ] (ȳ) := y 1 y 1 d p s k( x) > t(ȳ) ] y 1 = y 1 if k S + (ȳ) := y 1 y 1 if k S d p Pl (s k( x) + t(ȳ)) ] (ȳ) := P l (m( k, l) + t(ȳ)) We now have all the pieces necessary to prove, for Presburger Arithmetic, a version of the Marker- Steinhorn Theorem in o-minimality (see 3]). Given a M and m Z +, we define a m = a ā m M, where ā is the unique integer in {0,..., m 1} such that a m ā. Then a m cl(a) and ( x ( x )) M = x m x y < y x < my. m m Theorem 3.6. Let p S n (M). The following are equivalent: (i) p is definable; (ii) for all ā = p, M(ā) is an end extension of M (i.e., either p is realized or an end type). Proof. First suppose ā = p, with M(ā) not an end extension of M. Then there is some b M(ā)\M and m 1, m 2 M such that m 1 < b < m 2. By definition, there is some r Z + such that rb M, ā. So let m 3 M and k Z n such that rb = m 3 + s k(ā). Note that s k(ā) M, so, with d 1 = m1 m3 r M and d 2 = m2 m3 r M, we have d 1 < s k(ā) < d 2. Let X = {m M : p s k( x) < m}. If p is definable, then X is a definable subset of M. Note that X is bounded below by d 1, and X since d 2 X. Therefore X has a least element d, by Proposition 1.5. It follows that d 1 < c < d, which is a contradiction. Therefore p is not definable. Conversely, suppose that for all ā = p, M(ā) is an end extension of M. If p is realized in M then it is clearly definable, so we may assume p is an end type. We prove p is definable by induction on n. The base case, as well as the induction step for irreducible p, follows from Proposition 3.5. So suppose p is reducible.
7 DEFINABLE TYPES IN PRESBURGER ARITHMETIC 7 Then p red is still either realized in M or an end type, and therefore definable by induction. So p is definable by Proposition 3.3. Corollary 3.7. Suppose M = T P r and N M. Then every type over M realized in N is definable if and only if every 1-type over M realized in N is definable. Proof. If every 1-type over M realized in N is definable, then N is an end extension of M. 4. Coheirs Definition 4.1. Let T be a theory and M = T. Given p S n (M), N M, and M A N, a type q S n (A) is a coheir of p to A if p q and q is finitely satisfiable in M, i.e., for every ϕ( x, ā) q there is some c M such that N = ϕ( c, ā). A type q S n (A) is an heir of p to A if p q and every formula represented in q is represented in p, i.e., for any ϕ( x, ā) q there is some c M such that ϕ( x, c) p. The next two results hold in any complete theory T. Theorem ] Suppose M = T and p S n (M). (a) p is definable if and only if p has a unique heir to any N M. (b) Suppose T is stable. Then p is definable. Moreover, if N M and M A N, then the unique heir of p to A is also the unique coheir of p to A. Proposition 4.3. Let M = T. Fix p S n (M), N M, and M A N. Suppose q is a partial n-type over A, which is finitely satisfiable in M and extends p. Then there is a complete type q S n (A), which extends q and is a coheir of p. Proof. Let Σ = {ϕ( x) L(A) : c M, N = ϕ( c)}. We first show that Σ q is consistent. Since Σ is closed under conjunctions, it suffices to show that Σ 0 := {ϕ( x)} {ψ 1 ( x),..., ψ k ( x)} is consistent, where ϕ( x) Σ and ψ i ( x) q, for 1 i k. But by assumption, there is c M such that N = k i=1 ψ i( x). By definition of Σ, it follows that c realizes Σ 0. Let q S n (A) be a complete type extending Σ q. For any ϕ( x) L(A), if ϕ( x) has no solution in M then ϕ( x) Σ q. Therefore every formula in q has a solution in M, and so q is a coheir of p. We now return to M = T P r. Lemma 4.4. If p S n (M) is an irreducible end type, and N M, then p has a unique coheir to N.
8 8 GABRIEL CONANT Proof. Let S + = { k Z n : s k( x) > 0 p} and S = { k Z n : s k( x) < 0 p}. By Lemma 2.3, and since p is an end type, it follows that for all k Z n, C k if k S + p = M if k S Fix N M. We define two cuts in N : C + M := {c N : b M, c < b} and C M := {c N : b M, c < b}. In particular, C + M is the downwards closure of M in N, and C M is the cut of elements in N that are less than every element of M. We partition N = D D D +, where D = C M, D = C+ M (N \C M ), and D+ = N \C + M. Note that D < D < D +, and also that D and D D are both cuts in N. Moreover, we have M D, and for all x in D there are c 1, c 2 M with c 1 < x < c 2. Let q := p {c < x i < d : 1 i n, c D, d D + }. If ϕ(x, b) p, with b M, then there is some ā M such that M = ϕ(ā, b). Clearly then, c < a i < d for any 1 i n, c D, and d D +. Therefore q is finitely satisfiable in M, and so can be extended to a coheir q S n (N ) of p by Proposition 4.3. Claim 1 : σ q = σ p and, for k Z n, C k C + M q = if k S + if k S C M Proof : We clearly have σ p = σ q since p q. Let ā = q in some elementary extension of N. First suppose k S +. We want to show D < s k(ā) < D +. But s k(ā) > D since k S + implies s k(ā) > M. Suppose, towards a contradiction, that s k(ā) > c for some c D +. Let k = (k 1,..., k n ) and set k j a j := max{k i a i : 1 i n}. Then c < s k(ā) nk j a j. Case 1 : k j > 0. Then a j > M and a j > c nk j, so there is some b M such that c nk j < b. It follows that c < nk j b, which is a contradiction since nk j b M and c D +. Case 2 : k j < 0. Then a j < M and a j < c nk j, so there is some b M such that b < c nk j. Again, this implies nk j b < c, which is a contradiction. By a similar proof, we have D < s k(ā) < D for all k S. Suppose r S n (N ) is a coheir of p to N. Claim 2 : r is irreducible. Proof : Suppose not. Without loss of generality, there is a realization ā = r such that a n N (a 1,..., a n 1). Then there is m Z +, d N, and k 1,..., k n 1 Z such that ma n = d + k 1 a k n 1 a n 1. With k = (-k 1,..., -k n 1, m), we have r s k( x) = d. Since r is a coheir, there is some b M such that s k( b) = d, and so d M. But this implies s k( x) = d p, contradicting that k 0 and p is irreducible.
9 DEFINABLE TYPES IN PRESBURGER ARITHMETIC 9 Now suppose, towards a contradiction, that q r. By Claim 1, Claim 2, and Proposition 2.4, it follows that there is some k Z n such that k S + and C k r C + M, or k S and C k r C M. Case 1 : k S + and C k r C + M. Since p r and C k p = M, it follows that C + M C k r. Then there is some d D + such that r s k( x) > d. But this formula cannot be satisfied in M, contradicting that r is a coheir. Case 2 : k S and C k r C M. Then C k r C M and we obtain d D such that r s k( x) < d, which again contradicts that r is a coheir. From these contradictions, we have shown that q = r, and so q is the unique coheir of p to N. We can now prove, for Presburger arithmetic, another characterization of definable types, which is true in any stable theory by Theorem 4.2, and also true in any o-minimal theory (see 3]). Theorem 4.5. Let M = T P r and p S n (M). Then p is definable if and only if p has a unique coheir to any N M. Proof. Suppose p is definable. By Theorem 3.6, p is either realized in M or is an end type. Note that any realized type will have a unique extension to any N M, which must be a coheir since it is fully satisfied in M. Also, if p is irreducible then the result follows by Lemma 4.4. So we may assume p is reducible. We prove, by induction on n, that p has a unique coheir to any N M. The base case is trivial since reducible 1-types are realized. So assume the result for types in less than n variables, and fix N M. Then p red is still either realized or an end type and so has a unique coheir to N by induction. If q is a coheir of p to N, then q red is the unique coheir of p red. Therefore p has a unique coheir to N by Proposition 3.3. Conversely, suppose p is not definable. Let ā be a realization of p in some elementary extension N M. By Theorem 3.6, M(ā) is not an end extension of M. Therefore there is some k Z n such that C k p M. Let C = C k p. Define X := {b N : c < b < d for all c C, d M\C}. Note that X since s k(ā) X. We define two partial types over N : q 1 := p {c < s k( x) < b : c C, b X} and q 2 := p {b < s k( x) < d : b X, d M\C}. Claim: For i {1, 2}, q i is finitely satisfiable in M. Proof : First consider q 1. Fix ψ( x) p and c C. Let A = ψ(m). Considering s k : M n M as a definable function, we have that B := s k(a) is definable (over M). Note that N = x B, x > c and so M = x B, x > c. Then {x B : x > c} is definable, nonempty, and bounded below, and so has a least element c by Proposition 1.5. Then M = x((x B x > c) x > c ), and so N satisfies this sentence. In particular c < s k(ā), and so c C. But c s k(a), and so we have shown that for all c C there is some d M such that M = ψ( d) and c < s k( d) < M\C. It follows that q 1 is finitely satisfiable in M. The
10 10 GABRIEL CONANT proof for q 2 is similar. By the claim and Proposition 4.3, q 1 and q 2 extend to two distinct coheirs of p to N. References 1] O. Belegradek, Y. Peterzil & F. Wagner, Quasi-o-minimal structures, Journal of Symbolic Logic 65 (2000) ] D. Marker, Model Theory: An Introduction, Springer, ] D. Marker & C. Steinhorn, Definable types in o-minimal theories, The Journal of Symbolic Logic 59 (1994), no. 1, ] A. Pillay, An Introduction to Stability Theory, Dover, Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, 851 S Morgan St, 322 SEO, Chicago, IL, 60607, USA; address: gconan2@uic.edu
Lemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.
Definition 51 Let S be a set bijection f : S S 5 Permutation groups A permutation of S is simply a Lemma 52 Let S be a set (1) Let f and g be two permutations of S Then the composition of f and g is a
More informationGalois Theory III. 3.1. Splitting fields.
Galois Theory III. 3.1. Splitting fields. We know how to construct a field extension L of a given field K where a given irreducible polynomial P (X) K[X] has a root. We need a field extension of K where
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationSMALL SKEW FIELDS CÉDRIC MILLIET
SMALL SKEW FIELDS CÉDRIC MILLIET Abstract A division ring of positive characteristic with countably many pure types is a field Wedderburn showed in 1905 that finite fields are commutative As for infinite
More informationThis asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.
3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but
More informationKevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm
MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationEvery Positive Integer is the Sum of Four Squares! (and other exciting problems)
Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationCODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES
CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES PAUL SHAFER Abstract. We prove that the first-order theory of the Medvedev degrees, the first-order theory of the Muchnik degrees, and the third-order
More informationIntroduction to Algebraic Geometry. Bézout s Theorem and Inflection Points
Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a
More informationInvertible elements in associates and semigroups. 1
Quasigroups and Related Systems 5 (1998), 53 68 Invertible elements in associates and semigroups. 1 Fedir Sokhatsky Abstract Some invertibility criteria of an element in associates, in particular in n-ary
More informationGlobal Properties of the Turing Degrees and the Turing Jump
Global Properties of the Turing Degrees and the Turing Jump Theodore A. Slaman Department of Mathematics University of California, Berkeley Berkeley, CA 94720-3840, USA slaman@math.berkeley.edu Abstract
More informationFundamentele Informatica II
Fundamentele Informatica II Answer to selected exercises 1 John C Martin: Introduction to Languages and the Theory of Computation M.M. Bonsangue (and J. Kleijn) Fall 2011 Let L be a language. It is clear
More informationFirst-Order Logics and Truth Degrees
First-Order Logics and Truth Degrees George Metcalfe Mathematics Institute University of Bern LATD 2014, Vienna Summer of Logic, 15-19 July 2014 George Metcalfe (University of Bern) First-Order Logics
More informationO-MINIMALISM HANS SCHOUTENS
THE JOURNAL OF SYMBOLIC LOGIC Volume 00, Number 0, XXX 0000 O-MINIMALISM HANS SCHOUTENS Abstract. An ordered structure is called o-minimalistic if it has all the first-order features of an o-minimal structure.
More informationPOLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS
POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).
More informationTHE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
More informationLecture notes - Model Theory (Math 411) Autumn 2002.
Lecture notes - Model Theory (Math 411) Autumn 2002. Anand Pillay December 9, 2002 1 Notation and review. Let me begin by briefly discussing many-sorted structures. Although in most of the course I will
More informationModule MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013
Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationExpansions, omitting types, and standard systems
THESIS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY Expansions, omitting types, and standard systems FREDRIK ENGSTRÖM Mathematical Sciences CHALMERS UNIVERSITY OF TECHNOLOGY AND GÖTEBORG UNIVERSITY Göteborg,
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More informationx a x 2 (1 + x 2 ) n.
Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number
More information(LMCS, p. 317) V.1. First Order Logic. This is the most powerful, most expressive logic that we will examine.
(LMCS, p. 317) V.1 First Order Logic This is the most powerful, most expressive logic that we will examine. Our version of first-order logic will use the following symbols: variables connectives (,,,,
More informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
More informationPrime power degree representations of the symmetric and alternating groups
Prime power degree representations of the symmetric and alternating groups Antal Balog, Christine Bessenrodt, Jørn B. Olsson, Ken Ono Appearing in the Journal of the London Mathematical Society 1 Introduction
More informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informations-convexity, model sets and their relation
s-convexity, model sets and their relation Zuzana Masáková Jiří Patera Edita Pelantová CRM-2639 November 1999 Department of Mathematics, Faculty of Nuclear Science and Physical Engineering, Czech Technical
More informationCyclotomic Extensions
Chapter 7 Cyclotomic Extensions A cyclotomic extension Q(ζ n ) of the rationals is formed by adjoining a primitive n th root of unity ζ n. In this chapter, we will find an integral basis and calculate
More informationP NP for the Reals with various Analytic Functions
P NP for the Reals with various Analytic Functions Mihai Prunescu Abstract We show that non-deterministic machines in the sense of [BSS] defined over wide classes of real analytic structures are more powerful
More informationMATHEMATICS IN RELATIVE SET THEORY Karel Hrbacek Department of Mathematics The City College of CUNY New York, NY 10031 July 31, 2009
MATHEMATICS IN RELATIVE SET THEORY Karel Hrbacek Department of Mathematics The City College of CUNY New York, NY 10031 July 31, 2009 1 2 Non-archimedean fields present a serious obstacle for attempts to
More informationx < y iff x < y, or x and y are incomparable and x χ(x,y) < y χ(x,y).
12. Large cardinals The study, or use, of large cardinals is one of the most active areas of research in set theory currently. There are many provably different kinds of large cardinals whose descriptions
More informationCorrespondence analysis for strong three-valued logic
Correspondence analysis for strong three-valued logic A. Tamminga abstract. I apply Kooi and Tamminga s (2012) idea of correspondence analysis for many-valued logics to strong three-valued logic (K 3 ).
More informationGod created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)
Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More informationPage 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p.
Page 331, 38.2 Assignment #11 Solutions Factor the following positive integers into primes. a. 25 = 5 2. b. 4200 = 2 3 3 5 2 7. c. 10 10 = 2 10 5 10. d. 19 = 19. e. 1 = 1. Page 331, 38.4 Suppose a is a
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationTruth as Modality. Amsterdam Workshop on Truth 13 March 2013 truth be told again. Theodora Achourioti. ILLC University of Amsterdam
Truth as Modality Amsterdam Workshop on Truth 13 March 2013 truth be told again Theodora Achourioti ILLC University of Amsterdam Philosophical preliminaries i The philosophical idea: There is more to truth
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationarxiv:1210.5957v1 [math.lo] 22 Oct 2012
Generic stability and stability arxiv:1210.5957v1 [math.lo] 22 Oct 2012 Hans Adler, Enrique Casanovas and Anand Pillay October 22, 2012 Abstract We prove two results about generically stable types p in
More information11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
More informationMATH 289 PROBLEM SET 4: NUMBER THEORY
MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides
More informationCS 3719 (Theory of Computation and Algorithms) Lecture 4
CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a
More information4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2:
4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets
More informationn k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...
6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence
More informationo-minimality and Uniformity in n 1 Graphs
o-minimality and Uniformity in n 1 Graphs Reid Dale July 10, 2013 Contents 1 Introduction 2 2 Languages and Structures 2 3 Definability and Tame Geometry 4 4 Applications to n 1 Graphs 6 5 Further Directions
More informationGREATEST COMMON DIVISOR
DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their
More informationCONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12
CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.
More informationH/wk 13, Solutions to selected problems
H/wk 13, Solutions to selected problems Ch. 4.1, Problem 5 (a) Find the number of roots of x x in Z 4, Z Z, any integral domain, Z 6. (b) Find a commutative ring in which x x has infinitely many roots.
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationMath 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationarxiv:math/0510680v3 [math.gn] 31 Oct 2010
arxiv:math/0510680v3 [math.gn] 31 Oct 2010 MENGER S COVERING PROPERTY AND GROUPWISE DENSITY BOAZ TSABAN AND LYUBOMYR ZDOMSKYY Abstract. We establish a surprising connection between Menger s classical covering
More information8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More informationTuring Degrees and Definability of the Jump. Theodore A. Slaman. University of California, Berkeley. CJuly, 2005
Turing Degrees and Definability of the Jump Theodore A. Slaman University of California, Berkeley CJuly, 2005 Outline Lecture 1 Forcing in arithmetic Coding and decoding theorems Automorphisms of countable
More informationABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair
More informationOn the generation of elliptic curves with 16 rational torsion points by Pythagorean triples
On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples Brian Hilley Boston College MT695 Honors Seminar March 3, 2006 1 Introduction 1.1 Mazur s Theorem Let C be a
More informationSummary Last Lecture. Automated Reasoning. Outline of the Lecture. Definition sequent calculus. Theorem (Normalisation and Strong Normalisation)
Summary Summary Last Lecture sequent calculus Automated Reasoning Georg Moser Institute of Computer Science @ UIBK Winter 013 (Normalisation and Strong Normalisation) let Π be a proof in minimal logic
More informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationMATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.
MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationA characterization of trace zero symmetric nonnegative 5x5 matrices
A characterization of trace zero symmetric nonnegative 5x5 matrices Oren Spector June 1, 009 Abstract The problem of determining necessary and sufficient conditions for a set of real numbers to be the
More informationTotal Degrees and Nonsplitting Properties of Σ 0 2 Enumeration Degrees
Total Degrees and Nonsplitting Properties of Σ 0 2 Enumeration Degrees M. M. Arslanov, S. B. Cooper, I. Sh. Kalimullin and M. I. Soskova Kazan State University, Russia University of Leeds, U.K. This paper
More informationA Beginner s Guide to Modern Set Theory
A Beginner s Guide to Modern Set Theory Martin Dowd Product of Hyperon Software PO Box 4161 Costa Mesa, CA 92628 www.hyperonsoft.com Copyright c 2010 by Martin Dowd 1. Introduction..... 1 2. Formal logic......
More informationChapter 13: Basic ring theory
Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring
More informationThe Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.
The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,
More informationThe Ideal Class Group
Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned
More informationCOMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:
COMMUTATIVE RINGS Definition: A commutative ring R is a set with two operations, addition and multiplication, such that: (i) R is an abelian group under addition; (ii) ab = ba for all a, b R (commutative
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More information1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is
More informationElementary Number Theory
Elementary Number Theory A revision by Jim Hefferon, St Michael s College, 2003-Dec of notes by W. Edwin Clark, University of South Florida, 2002-Dec L A TEX source compiled on January 5, 2004 by Jim Hefferon,
More informationGCDs and Relatively Prime Numbers! CSCI 2824, Fall 2014!
GCDs and Relatively Prime Numbers! CSCI 2824, Fall 2014!!! Challenge Problem 2 (Mastermind) due Fri. 9/26 Find a fourth guess whose scoring will allow you to determine the secret code (repetitions are
More informationPrime Numbers and Irreducible Polynomials
Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.
More informationMODELS OF SET THEORY
MODELS OF SET THEORY STEFAN GESCHKE Contents 1. First order logic and the axioms of set theory 2 1.1. Syntax 2 1.2. Semantics 2 1.3. Completeness, compactness and consistency 3 1.4. Foundations of mathematics
More informationPrimality - Factorization
Primality - Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.
More informationDEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS
DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsion-free abelian groups, one of isomorphism
More informationLocal periods and binary partial words: An algorithm
Local periods and binary partial words: An algorithm F. Blanchet-Sadri and Ajay Chriscoe Department of Mathematical Sciences University of North Carolina P.O. Box 26170 Greensboro, NC 27402 6170, USA E-mail:
More informationSign changes of Hecke eigenvalues of Siegel cusp forms of degree 2
Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2 Ameya Pitale, Ralf Schmidt 2 Abstract Let µ(n), n > 0, be the sequence of Hecke eigenvalues of a cuspidal Siegel eigenform F of degree
More informationComputability Theory
CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Computability Theory This section is partly inspired by the material in A Course in Mathematical Logic by Bell and Machover, Chap 6, sections 1-10.
More informationCollinear Points in Permutations
Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More informationMath 223 Abstract Algebra Lecture Notes
Math 223 Abstract Algebra Lecture Notes Steven Tschantz Spring 2001 (Apr. 23 version) Preamble These notes are intended to supplement the lectures and make up for the lack of a textbook for the course
More informationMathematical Induction
Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How
More informationFIRST ORDER THEORY OF THE s-degrees AND ARITHMETIC
FIRST ORDER THEORY OF THE s-degrees AND ARITHMETIC DANIELE MARSIBILIO AND ANDREA SORBI Abstract. We show that the first order theories of the s-degrees, and of the Q-degrees, are computably isomorphic
More informationGeometrical Characterization of RN-operators between Locally Convex Vector Spaces
Geometrical Characterization of RN-operators between Locally Convex Vector Spaces OLEG REINOV St. Petersburg State University Dept. of Mathematics and Mechanics Universitetskii pr. 28, 198504 St, Petersburg
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationTiers, Preference Similarity, and the Limits on Stable Partners
Tiers, Preference Similarity, and the Limits on Stable Partners KANDORI, Michihiro, KOJIMA, Fuhito, and YASUDA, Yosuke February 7, 2010 Preliminary and incomplete. Do not circulate. Abstract We consider
More informationF. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
More informationWRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
More information