More on invariant types in NIP theories
|
|
- Russell Allen
- 6 years ago
- Views:
Transcription
1 More on invariant types in NIP theories Pierre Simon June 22, 2013 This note is not intended for publication in its present form. I wrote it to be used as a reference for other papers (mainly [CPS13]) and because I think that the ideas explored here might be of interest to others. We develop here some ideas hinted in [Sim12] concerning the study of global invariant types in NIP theories. There are two ideas or intuitions: the first one is that the relation p commutes with q, where p and q are global invariant types, is very meaningful and expresses in some way that p and q are far away from each other (think of DLO). It is shown in [Sim13] that two types which commute behave with respect to each other as in a stable theory. For example p has a unique non-forking extension to a realization of q and the limit type of any Morley sequence of p over a realization of q is equal to the invariant extension of p. We recall some of those facts below. The second idea is that amongst M-invariant types, definable types and M- finitely satisfiable types are two opposite extremes, and other invariant types sit somehow in between. We showed in [Sim12] that this intuition is justified in the dp-minimal case: a dp-minimal M-invariant types is either definable or finitely satisfiable in M. Our hope is that given an M-invariant type p, one can somehow decompose it into an M-finitely satisfiable type and a definable quotient. In this note, we make a first step towards such a result. Fixing a model M, we construct a continuous retraction F M from the set of M-invariant types to that of M- finitely satisfiable types. The idea is that F M (p) gives the finitely-satisfiable part of p. In all that follows, T is an NIP theory in a language L and U a monster model of T. For basic facts about NIP theories, we refer the reader to [Sim]. The notation M + N means that N is M + -saturated. 1
2 By an M-invariant type, we mean a global type p S(U) which is invariant under automorphisms of U fixing M. Equivalently (by NIP) it is a global type which does not fork (resp. divide) over M. A type is M-finitely satisfiable if it is finitely satisfiable in M. If p is M-invariant and finitely satisfiable in some small model, then it is finitely satisfiable in M; similarly for definable. If p(x) and q(y) are two M-invariant types, then p q denotes the M- invariant type tp(a, b/u) in variables (x, y) where b = q and a = p Ub. We recall some facts from previous papers: Proposition 0.1 ([Sim12] Lemma 6). An M-invariant type p is definable if and only if for every M-finitely satisfiable type q, p q M = q p M. Proposition 0.2 ([Sim13] Corollary 3.24). Let p and q be two global M- invariant types which commute. Assume that N M is M + -saturated, I = (a i : i < ω) = p (ω) and b = q, then lim(i/nb) = p Nb. Lemma 0.3. Let p, q be M-invariant types. Assume that p (ω) q (ω) M = q (ω) p (ω) M, then p and q commute. Proof. Build a sequence (a n, b n : n < ω) such that (a n, b n ) = p x q y Ua <n b <n when n is even and (a n, b n ) = q y p x Ua <n b <n when n is odd. We show by induction that this is an indiscernible sequence. If p and q do not commute, then we get infinite alternation. 1 The construction Let M = T and let M + M. Consider the pair (M, M): the expansion of M obtained by adding a new predicate P(x) naming M. Call L P the expanded language. Let (N, N) be an M + -saturated elementary extension of (M, M). Let p be a global M-invariant type (in the language L). Claim: The partial L P -type p N P(x) implies a complete L-type over M. Assume not. Then for some L-formula φ(x; b) L(M ), p N P(x) is consistent with φ(x; b) and with φ(x; b). We construct by induction a sequence (a i : i < ω) of points of N such that: a 2i = p N P(x) φ(x; b); a 2i+1 = p N P(x) φ(x; b). The sequence (a i : i < ω) is L-indiscernible, but the formula φ(x; b) alternates infinitely often on it. This contradicts NIP. 2
3 Therefore there is a unique type q S(M ) such that p N P(x) q is consistent. As q is consistent with P(x) it must be finitely satisfiable in M. As M is M + -saturated, q extends uniquely to a global M-finitely satisfiable L-type q. We now define F M (p) to be equal to q. It is not hard to check that this is well defined, i.e., does not depend on neither M nor (N, N). Lemma 1.1. Let M = T, then the map F M from M-invariant types to M- finitely satisfiable types has the following properties: (i) F M (p) M = p M ; (ii) F M is continuous; (iii) if p is finitely satisfiable, then F M (p) = p; (iv) for any M-definable function f, f (F M (p)) = F M (f (p)). Proof. Point (i) is clear. Point (ii) is by compactness: given a formula φ(x; b) over M, if F M (p) = φ(x; b), then there is some finite part p 0 of p N such that p 0 P(x) implies φ(x; b). If p is finitely satisfiable in M, then p N P(x) is a consistent L P -type, hence F M (p) = p. Point (iv) is easy to check. Remark 1.2. Beware that in general we do not have F M (p q) = F M (p) F M (q). 1.1 The reverse type We present another construction which associates to an invariant type, a finitely satisfiable type, but this time over a larger base. It already appeared in [Sim13]. Let p be an M-invariant type and let M + N. Given any b U, there is some B N of size M such that any two realizations of p B in N have the same type over Mb. To see this, assume not. Then we can build a sequence (a i,0 a i,1 : i < M + ) in N such that a i,0, a i,1 = p Ma<i,0 a <i,1, but a i,0, a i,1 do not have the same type over Mb. Then for any η : M + {0, 1}, the sequence (a i,η(i) : i < M + ) is indiscernible and we easily contradict NIP. This fact allows us to associate canonically to any b U a type over Mb which is compatible with p M. Letting b vary and pasting together the different type, we obtain a type R M (p) over U. This type is clearly N-finitely satisfiable and its restriction to N coincides with p N. Lemma 1.3. The following facts hold: 3
4 (i) For any M-invariant type q, we have (R N (p) q) N = (q p) N. (ii) The type R N (p) commutes with any M-invariant type (in particular with p). Proof. (i) Let q be M-invariant and b = q N. Let B N containing M and a = p B, then tp(b, a/b) = q p B. (iii) Let q be M-invariant; take some d U, a = R N (p) Nd and b = q Na d. Let a N such that tp(a/mdb) = R N (p) Mdb. Then (a, b) = (R N (p) x q y ) Md. Also a Md a, hence by M-invariance of p, (a, b) = (q y R N (p) x ) Md. 2 Commutativity properties We want to argue that F M (p) somehow captures the finitely satisfiable part of p. We do not define the finitely satisfiable part of p, but we have in mind something like {q M-finitely satisfiable p does not commute with q}. Lemma 2.1. Let p, q be M-invariant types, q being finitely satisfiable in M. Then we have F M (q p) = q F M (p). Proof. Let (M, M) + (N, N) be as in the definition of F M. Take yet another extension (N, N) + (N 1, N 1). Let a N 1 realize p N. As q is finitely satisfiable in M, q N a P(x) is consistent and is realized by some b N 1. Then by definition F M (q p) is given by tp(b, a/m ). But tp(b/m a) = q M a, hence the result. We know that a type is definable if and only if it commutes with all finitely satisfiable types. We show now that it is enough to check commutativity with one specific finitely satisfiable. Proposition 2.2. Let p be an M-invariant type. If p commutes with F M (p), then p is definable. Proof. If s 1 and s 2 are M-invariant types and M + N, saying that a 1 = s 1 N and a 2 = s 2 Na1 is equivalent to saying that a 2 = s 2 N and a 1 = R N (s 1 ) Na2. We will use this in the proof without explicit mention. Assume that p is not definable. Then there is some type q finitely satisfiable over M such that p q M q p M. Take N M, M + -saturated. Let b = q N and build a maximal sequence (c 0 i, c1 i : i < α) such that: 4
5 tp(b + (c 1 i, c0 i : i < α)/n) is finitely satisfiable in M; there is some M-finitely satisfiable type r i such that (c 1 i, c0 i ) = R N(r i ) (2) c 0 <i c1 <i N; the types r i commute with p; tp(bc 0 i /M) tp(bc1 i /M). Let a 0 = R N (p) over everything and a 1 = p over everything. Then tp(ba 0 /M) tp(ba 1 /M). Let s be the type of b+(c 1 i, c0 i ) i<α +a 0 a 1 over N. This type is M-invariant. If we apply F M to it, then the restriction to the variables corresponding to b + (c 1 i, c0 i ) i<α does not change since this type is M-finitely satisfiable. Thus we can find (g 0, g 1 ) such that b + (c 1 i, c0 i ) i<α + g 0 g 1 realizes F M (s) over N. By Lemma 2.1 and because the types r i commute with p, we have (g 1, g 0 ) = R N (F M (p)) (2) c 0 <αc 1 <αn. Also, g 0 = R N (F M (p)) Mb. We also still have tp(bg 0 /M) tp(bg 1 /M). So g 1 does not realize R N (F M (p)) over Mb. Then take g satisfying R N (F M (p)) over everything. Set c 0 α = g and c 1 α = g 1. This contradicts maximality of the sequence (c 0 i c1 i : i < α). Lemma 2.3. Let p be an M-invariant, not finitely satisfiable in M. Let I be a Morley sequence of p over M, then p MI is not finitely satisfiable in M. Proof. Otherwise, let D be an ultrafilter on M whose limit type q has the same restriction as p over MI. Then p and q have the same Morley sequence, hence p = q. Lemma 2.4. If p is M-invariant, but not finitely satisfiable in M, then F N (p) does not commute with R N (p) (where as before M + N). Proof. Let I = (a i : i < ω) be a Morley sequence of p over N. We know that p NI is not finitely satisfiable in N. Let φ(x; a 1,..., a n ) be a formula witnessing it. We have (a 1,..., a n ) = R N (p) (n) N. As φ(n; a 1,..., a n ) =, necessarily F N (p) R N (p) (n) = φ(x; y 1,..., y n ). On the other hand, R N (p) (n) F N (p) and R N (p) (n) p have the same restriction to N, hence R N (p) (n) F N (p) = φ(x; y 1,..., y n ). So F N (p) and R N (p) (n) do not commute, hence F N (p) and R N (p) do not commute. Lemma 2.5. The type p is definable if and only if F N (p) = R N (p). Proof. Assume that p is definable. Then we can certainly check directly from the definition that F N (p) = R N (p), but here is an easier way: we know that a definable type has a unique coheir over any model. (Proof: show that the 5
6 Morley sequence of a coheir is determined by reading it backwords and using the fact that p has a unique heir.) As both R N (p) and F N (p) are coheirs of p N, they must be equal. Conversely, if p is not definable, then p does not commute with F N (p). But R N (q) does commute with p, hence F N (p) R N (p). Proposition 2.6. Let p be M-invariant and let q be a type finitely satisfiable in M. Then if q commutes with F M (p), it commutes with p. Proof. Let M + N. Assume that q does not commute with p. Let r = p q (ω) p and let (a 1, b, a 0 ) = F M (r) N. Then for every k < ω, tp(a 1, b k /M) tp(a 0, b k /M). On the other hand by Lemma 2.1, tp( b, a 0 /N) = q (ω) F M (p) N. Thus for every k, (b k, a 0 ) does not realize q F M (p) over M, and tp(b k, a 0 /M) is constant as k varies. If q commutes with F M (p), this contradicts Proposition Application to dp-minimal types Let p be M-invariant and M + N. The situation is as follows: in any case, p and R N (p) commute; F N (p) commutes with R N (p) if and only if p is finitely satisfiable; F N (p) commutes with p if and only if p is definable. Recall that a type p is dp-minimal if for any A and any two sequences I and J mutually indiscernible over A, for any a = p, either I or J is indiscernible over Aa. In particular if p is M-invariant and dp-minimal, q and r are two M-invariant types which commute, then p commutes with either q or r. To see this let M + N and build ( b, c, a, b, c ) = q (ω) r (ω) p q (ω) r (ω) over N. The sequences b + b and c + c are mutually indiscernible but none is indiscernible over Na. Proposition 2.7. Let p be M-invariant and dp-minimal, then p is either finitely satisfiable in M or definable. Proof. If p is dp-minimal, then already p N is dp-minimal. Hence F N (p) is dpminimal. Since R N (p) and p commute, we know that F N (p) must commute with one or the other. We deduce that p is either finitely satisfiable or definable. 6
7 2.2 One last result Proposition 2.8. Let p be some global M-finitely satisfiable type orthogonal to all types finitely satisfiable in a set of size < κ. Then p is orthogonal to every global type invariant over a set of size < κ. Proof. Let p as in the statement. Let M of size < κ. There is e U such that for a = p, we have tp(a/e) tp(a/m). More precisely, for every φ(x; y), there are d 0 φ (y; e) and d1 φ (y; e) such that tp x(a/e) d l φ (y; e) φl (x; y) and d 0 φ (y; e) d1 φ (y; e) cover M. Let p be some type finitely satisfiable in a small N, N M. Let r be an heir of tp(e/m) over N and let e realize r. Let σ be an automorphism sending e to e. Then p is orthogonal to every type finitely satisfiable in σ(n) because every such type satisfies φ d0 φ (y; e) d1 φ (y; e). In particular, p is orthogonal to σ(p ). Let b = q and a 0 = p such that tp(a 0, b/u) p q. Let σ as in the previous paragraph for p = p. As q is M-invariant, it is also non-orthogonal to p 1 := σ(p). Hence we can find a 1 = p 1 such that tp(a 1, b/u) p 1 q. By orthogonality of p and p 1, we have tp(a 1, a 0 /U) = p 1 p. Now we iterate the construction. At stage α, we have defined (a i a i : i < α) = i<α p(2) i where each p i is orthogonal to j<i p j. Take σ such that p is orthogonal to σ( i<α p(2) i ). Set p α = σ 1 (p). Let a α = p α be such that tp(a α, b/u) p α q. Then let a α = p α Uba <α a <α. After T + steps, we contradict NIP. Question 2.9. Does this still hold if we replace orthogonal by commuting? References [CPS13] Artem Chernikov, Anand Pillay, and Pierre Simon. External definability and groups in nip theories. preprint, [Sim] Pierre Simon. Lecture notes on nip theories. preprint. [Sim12] Pierre Simon. Invariant types in dp-minimal theories. preprint, [Sim13] Pierre Simon. Distal and non-distal theories. Annals of Pure and Applied Logic, 164(3): ,
Type decompositions in NIP theories
École Normale Supérieure, Paris Logic Colloquium 2012, Manchester Definition A formula φ(x; y) has the independence property if one can find some infinite set B such that for every C B, there is y C such
More informationarxiv: v2 [math.lo] 23 Sep 2015
INVARIANT TYPES IN NIP THEORIES arxiv:1401.6715v2 [math.lo] 23 Sep 2015 PIERRE SIMON Abstract. We study invariant types in NIP theories. Amongst other things: we prove a definable version of the (p,q)-theorem
More informationStable embeddedness and N IP
Stable embeddedness and N IP Anand Pillay University of Leeds January 14, 2010 Abstract We give some sufficient conditions for a predicate P in a complete theory T to be stably embedded. Let P be P with
More informationWeight and measure in NIP theories
Weight and measure in NIP theories Anand Pillay University of Leeds September 18, 2011 Abstract We initiate an account of Shelah s notion of strong dependence in terms of generically stable measures, proving
More informationTame definable topological dynamics
Tame definable topological dynamics Artem Chernikov (Paris 7) Géométrie et Théorie des Modèles, 4 Oct 2013, ENS, Paris Joint work with Pierre Simon, continues previous work with Anand Pillay and Pierre
More informationStable embeddedness and N IP
Stable embeddedness and N IP arxiv:1001.0515v1 [math.lo] 4 Jan 2010 Anand Pillay University of Leeds January 4, 2010 Abstract We give some sufficient conditions for a predicate P in a complete theory T
More informationMeasures in model theory
Measures in model theory Anand Pillay University of Leeds Logic and Set Theory, Chennai, August 2010 Introduction I I will discuss the growing use and role of measures in pure model theory, with an emphasis
More informationω-stable Theories: Introduction
ω-stable Theories: Introduction 1 ω - Stable/Totally Transcendental Theories Throughout let T be a complete theory in a countable language L having infinite models. For an L-structure M and A M let Sn
More informationHence C has VC-dimension d iff. π C (d) = 2 d. (4) C has VC-density l if there exists K R such that, for all
1. Computational Learning Abstract. I discuss the basics of computational learning theory, including concept classes, VC-dimension, and VC-density. Next, I touch on the VC-Theorem, ɛ-nets, and the (p,
More informationAnnals of Pure and Applied Logic
Annals of Pure and Applied Logic 161 (2010) 944 955 Contents lists available at ScienceDirect Annals of Pure and Applied Logic journal homepage: www.elsevier.com/locate/apal Types directed by constants
More informationForking and dividing in dependent theories
Forking and dividing in dependent theories (and NTP 2 in there) Artem Chernikov 1 joint work with Itay Kaplan 2 1 Humboldt Universität zu Berlin / Université Claude Bernard Lyon 1 2 Hebrew University of
More informationOn NIP and invariant measures
arxiv:0710.2330v2 [math.lo] 29 Jan 2009 On NIP and invariant measures Ehud Hrushovski Hebrew University of Jerusalem January 28, 2009 Abstract Anand Pillay University of Leeds We study forking, Lascar
More informationDefinably amenable groups in NIP
Definably amenable groups in NIP Artem Chernikov (Paris 7) Lyon, 21 Nov 2013 Joint work with Pierre Simon. Setting T is a complete first-order theory in a language L, countable for simplicity. M = T a
More informationOn NIP and invariant measures
On NIP and invariant measures Ehud Hrushovski Hebrew University of Jerusalem Anand Pillay University of Leeds December 3, 2010 Abstract We study forking, Lascar strong types, Keisler measures and definable
More informationA trichotomy of countable, stable, unsuperstable theories
A trichotomy of countable, stable, unsuperstable theories Michael C. Laskowski Department of Mathematics University of Maryland S. Shelah Department of Mathematics Hebrew University of Jerusalem Department
More informationGEOMETRIC STRUCTURES WITH A DENSE INDEPENDENT SUBSET
GEOMETRIC STRUCTURES WITH A DENSE INDEPENDENT SUBSET ALEXANDER BERENSTEIN AND EVGUENI VASSILIEV Abstract. We generalize the work of [13] on expansions of o-minimal structures with dense independent subsets,
More informationarxiv: v2 [math.lo] 3 Nov 2011
ON OMEGA-CATEGORICAL SIMPLE THEORIES arxiv:1102.3631v2 [math.lo] 3 Nov 2011 DANIEL PALACÍN Abstract. In the present paper we shall prove that countable ω-categorical simple CM-trivial theories and countable
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 informationLECTURE NOTES ON FORKING
LECTURE NOTES ON FORKING ARTEM CHERNIKOV Part 1. Preliminaries, model-theoretic notions of smallness, preindependence relations 1. Lecture 1 1.1. Types. Most of the time we fix a complete countable first-order
More informationStrong theories, burden, and weight
Strong theories, burden, and weight Hans Adler 13th March 2007 Abstract We introduce the notion of the burden of a partial type in a complete first-order theory and call a theory strong if all types have
More informationNIP THEORIES AND SHELAH S THEOREM
NIP THEORIES AND SHELAH S THEOREM These are the informal and expanded notes of a mini-course given in the Universidad Autónoma de Madrid, 29-30 of May 2018 (6 hours). The mini-course was given at the end
More informationForking and Dividing in Random Graphs
Forking and Dividing in Random Graphs Gabriel Conant UIC Graduate Student Conference in Logic University of Notre Dame April 28-29, 2012 Gabriel Conant (UIC) Forking and Dividing in Random Graphs April
More informationarxiv: v2 [math.lo] 12 Feb 2018
LOCAL CHARACTER OF KI-INDEPENDENCE ITAY KAPLAN, NICHOLAS RASEY, AND SAHARON SHELAH arxiv:1707.02902v2 [math.lo] 12 Feb 2018 Abstract. We show that NSOP 1 theories are exactly the theories in which Kim-independence
More informationCompact complex manifolds with the DOP and other properties.
Compact complex manifolds with the DOP and other properties. Anand Pillay Dept. Mathematics Univ. Illinois at Urbana-Champaign Thomas Scanlon Dept. Mathematics University of California at Berkeley July
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 informationAN INTRODUCTION TO STABILITY THEORY
AN INTRODUCTION TO STABILITY THEORY DANIEL PALACÍN These lecture notes are a slightly extended version of my course on stability theory given at the Münster Model Theory Month in May of 2016. The course
More informationNonsensitivity, Stability, NIP, and Non-SOP; Model Theoretic Properties of Formulas in Continuous Logic. Karim Khanaki
Nonsensitivity, Stability, NIP, and Non-SOP; Model Theoretic Properties of Formulas in Continuous Logic Karim Khanaki Faculty of Fundamental Sciences, Arak University of Technology, P.O. Box 38135-1177,
More informationOn Kim-independence in NSOP 1 theories
On Kim-independence in NSOP 1 theories Itay Kaplan, HUJI Joint works with Nick Ramsey, Nick Ramsey and Saharon Shelah 06/07/2017, Model Theory, Będlewo, Poland 2/20 NSOP 1 Definition The formula ϕ(x; y)
More informationRosenthal compacta and NIP formulas
Rosenthal compacta and NIP formulas Pierre Simon To cite this version: Pierre Simon. Rosenthal compacta and NIP formulas. Fundamenta Mathematicae, Instytut Matematyczny, Polskiej Akademii Nauk,, 2015,
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationGENERIC SETS IN DEFINABLY COMPACT GROUPS
GENERIC SETS IN DEFINABLY COMPACT GROUPS YA ACOV PETERZIL AND ANAND PILLAY Abstract. A subset X of a group G is called left-generic if finitely many left-translates of X cover G. Our main result is that
More informationi i i i i i i i
A Guide to NIP Theories The study of NIP theories has received much attention from model theorists in the last decade, fuelled by applications to o-minimal structures and valued fields. This book, the
More informationProperly forking formulas in Urysohn spaces
Properly forking formulas in Urysohn spaces Gabriel Conant University of Notre Dame gconant@nd.edu March 4, 2016 Abstract In this informal note, we demonstrate the existence of forking and nondividing
More informationReducts of Stable, CM-trivial Theories
Reducts of Stable, CM-trivial Theories Herwig Nübling 27th July 2004 Abstract We show that every reduct of a stable, CM-trivial theory of finite Lascar rank is CM-trivial. AMS classification: 03C45 Keywords:
More informationarxiv:math.lo/ v1 28 Nov 2004
HILBERT SPACES WITH GENERIC GROUPS OF AUTOMORPHISMS arxiv:math.lo/0411625 v1 28 Nov 2004 ALEXANDER BERENSTEIN Abstract. Let G be a countable group. We proof that there is a model companion for the approximate
More informationMekler s construction and generalized stability
Mekler s construction and generalized stability Artem Chernikov UCLA Automorphism Groups, Differential Galois Theory and Model Theory Barcelona, June 26, 2017 Joint work with Nadja Hempel (UCLA). Mekler
More informationIntroduction. Itaï Ben-Yaacov C. Ward Henson. September American Institute of Mathematics Workshop. Continuous logic Continuous model theory
Itaï Ben-Yaacov C. Ward Henson American Institute of Mathematics Workshop September 2006 Outline Continuous logic 1 Continuous logic 2 The metric on S n (T ) Origins Continuous logic Many classes of (complete)
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 informationON THE STRUCTURE OF CATEGORICAL ABSTRACT ELEMENTARY CLASSES WITH AMALGAMATION
ON THE STRUCTURE OF CATEGORICAL ABSTRACT ELEMENTARY CLASSES WITH AMALGAMATION MONICA M. VANDIEREN AND SEBASTIEN VASEY Abstract. For K an abstract elementary class with amalgamation and no maximal models,
More informationTRANSFERING SATURATION, THE FINITE COVER PROPERTY, AND STABILITY
TRANSFERING SATURATION, THE FINITE COVER PROPERTY, AND STABILITY John T. Baldwin Department of Mathematics University of Illinois at Chicago Chicago, IL 60680 Rami Grossberg Department of Mathematics Carnegie
More informationMODEL THEORY OF GROUPS (MATH 223M, UCLA, SPRING 2018)
MODEL THEORY OF GROUPS (MATH 223M, UCLA, SPRING 2018) ARTEM CHERNIKOV Lecture notes in progress. All comments and corrections are very welcome. Last update: May 21, 2018 Contents 1. Introduction 1 1.1.
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 informationDIVIDING AND WEAK QUASI-DIMENSIONS IN ARBITRARY THEORIES
DIVIDING AND WEAK QUASI-DIMENSIONS IN ARBITRARY THEORIES ISAAC GODBRING AND HENRY TOWSNER Abstract. We show that any countable model of a model complete theory has an elementary extension with a pseudofinite-like
More informationModel Theory and Forking Independence
Model Theory and Forking Independence Gabriel Conant UIC UIC Graduate Student Colloquium April 22, 2013 Gabriel Conant (UIC) Model Theory and Forking Independence April 22, 2013 1 / 24 Types We fix a first
More informationINTRODUCTION TO GEOMETRIC STABILITY
INTRODUCTION TO GEOMETRIC STABILITY ARTEM CHERNIKOV Lecture notes for the IMS Graduate Summer School in Logic, National University of Singapore, Jun 2017. The material is based on a number of sources including:
More informationµ (X) := inf l(i k ) where X k=1 I k, I k an open interval Notice that is a map from subsets of R to non-negative number together with infinity
A crash course in Lebesgue measure theory, Math 317, Intro to Analysis II These lecture notes are inspired by the third edition of Royden s Real analysis. The Jordan content is an attempt to extend 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 informationSIMPLICITY IN COMPACT ABSTRACT THEORIES
SIMPLICITY IN COMPACT ABSTRACT THEORIES ITAY BEN-YAACOV Abstract. We continue [Ben03], developing simplicity in the framework of compact abstract theories. Due to the generality of the context we need
More informationGenerically stable regular types
arxiv:1308.5768v1 [math.lo] 27 Aug 2013 Generically stable regular types Predrag Tanović Mathematical Institute SANU, Belgrade, Serbia Abstract We study non-orthogonality of symmetric, regular types and
More informationOn the forking topology of a reduct of a simple theory
arxiv:1812.06351v1 [math.lo] 15 Dec 2018 On the forking topology of a reduct of a simple theory Ziv Shami Ariel University December 18, 2018 Abstract Let T be a simple theory and T is a reduct of T. For
More informationREPRESENTATION THEORY, LECTURE 0. BASICS
REPRESENTATION THEORY, LECTURE 0. BASICS IVAN LOSEV Introduction The aim of this lecture is to recall some standard basic things about the representation theory of finite dimensional algebras and finite
More informationINTERPRETING HASSON S EXAMPLE
INTERPRETING HASSON S EXAMPLE CHARLES K. SMART Abstract. We generalize Ziegler s fusion result [8] by relaxing the definability of degree requirement. As an application, we show that an example proposed
More informationVC-dimension in model theory and other subjects
VC-dimension in model theory and other subjects Artem Chernikov (Paris 7 / MSRI, Berkeley) UCLA, 2 May 2014 VC-dimension Let F be a family of subsets of a set X. VC-dimension Let F be a family of subsets
More informationITERATING ALONG A PRIKRY SEQUENCE
ITERATING ALONG A PRIKRY SEQUENCE SPENCER UNGER Abstract. In this paper we introduce a new method which combines Prikry forcing with an iteration between the Prikry points. Using our method we prove from
More informationAround the Canonical Base property
Zoé Chatzidakis 1/ 24 Around the Canonical Base property Zoé Chatzidakis CNRS (UMR 7586) - Université Paris 7 10 June 2013 Model Theory 2013 Ravello partially supported by ANR-06-BLAN-0183 Zoé Chatzidakis
More informationAN INTRODUCTION TO EXCELLENT CLASSES INTRODUCTION
AN INTRODUCTION TO EXCELLENT CLASSES OLIVIER LESSMANN ABSTRACT. In this paper, we present Shelah s theory of excellence concluding with his categoricity theorem for the class of atomic models of a countable
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 informationFields and model-theoretic classification, 2
Fields and model-theoretic classification, 2 Artem Chernikov UCLA Model Theory conference Stellenbosch, South Africa, Jan 11 2017 NIP Definition Let T be a complete first-order theory in a language L.
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 informationApplications of model theory in extremal graph combinatorics
Applications of model theory in extremal graph combinatorics Artem Chernikov (IMJ-PRG, UCLA) Logic Colloquium Helsinki, August 4, 2015 Szemerédi regularity lemma Theorem [E. Szemerédi, 1975] Every large
More informationAMENABILITY, DEFINABLE GROUPS, AND AUTOMORPHISM GROUPS
AMENABILITY, DEFINABLE GROUPS, AND AUTOMORPHISM GROUPS KRZYSZTOF KRUPI SKI AND ANAND PILLAY Abstract. We prove several theorems relating amenability of groups in various categories (discrete, denable,
More informationUSING ULTRAPOWERS TO CHARACTERIZE ELEMENTARY EQUIVALENCE
USING ULTRAPOWERS TO CHARACTERIZE ELEMENTARY EQUIVALENCE MIKAYLA KELLEY Abstract. This paper will establish that ultrapowers can be used to determine whether or not two models have the same theory. More
More informationLecture 11: Minimal types
MODEL THEORY OF ARITHMETIC Lecture 11: Minimal types Tin Lok Wong 17 December, 2014 Uniform extension operators are used to construct models with nice structural properties Thus, one has a very simple
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 informationThe nite submodel property and ω-categorical expansions of pregeometries
The nite submodel property and ω-categorical expansions of pregeometries Marko Djordjevi bstract We prove, by a probabilistic argument, that a class of ω-categorical structures, on which algebraic closure
More informationHINDMAN S THEOREM AND IDEMPOTENT TYPES. 1. Introduction
HINDMAN S THEOREM AND IDEMPOTENT TYPES URI ANDREWS AND ISAAC GOLDBRING Abstract. Motivated by a question of Di Nasso, we show that Hindman s Theorem is equivalent to the existence of idempotent types in
More informationJUMPS IN SPEEDS OF HEREDITARY PROPERTIES IN FINITE RELATIONAL LANGUAGES
JUMPS IN SPEEDS OF HEREDITARY PROPERTIES IN FINITE RELATIONAL LANGUAGES MICHAEL C. LASKOWSKI AND CAROLINE A. TERRY Abstract. Given a finite relational language L, a hereditary L-property is a class of
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationI-Indexed Indiscernible Sets and Trees
1 / 20 I-Indexed Indiscernible Sets and Trees Lynn Scow Vassar College Harvard/MIT Logic Seminar December 3, 2013 2 / 20 Outline 1 background 2 the modeling property 3 a dictionary theorem 3 / 20 order
More informationON VC-MINIMAL THEORIES AND VARIANTS. 1. Introduction
ON VC-MINIMAL THEORIES AND VARIANTS VINCENT GUINGONA AND MICHAEL C. LASKOWSKI Abstract. In this paper, we study VC-minimal theories and explore related concepts. We first define the notion of convex orderablity
More informationCHAINS OF SATURATED MODELS IN AECS
CHAINS OF SATURATED ODELS IN AECS WILL BONEY AND SEBASTIEN VASEY Abstract. We study when a union of saturated models is saturated in the framework of tame abstract elementary classes (AECs) with amalgamation.
More informationLocal Homogeneity. June 17, 2004
Local Homogeneity Bektur Baizhanov Institute for Informatics and Control Almaty, Kazakhstan John T. Baldwin Department of Mathematics, Statistics and Computer Science University of Illinois at Chicago
More informationTOPOLOGICAL COMPLEXITY OF 2-TORSION LENS SPACES AND ku-(co)homology
TOPOLOGICAL COMPLEXITY OF 2-TORSION LENS SPACES AND ku-(co)homology DONALD M. DAVIS Abstract. We use ku-cohomology to determine lower bounds for the topological complexity of mod-2 e lens spaces. In the
More informationTHE SCHRÖDER-BERNSTEIN PROPERTY FOR a-saturated MODELS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 THE SCHRÖDER-BERNSTEIN PROPERTY FOR a-saturated MODELS JOHN GOODRICK AND MICHAEL C. LASKOWSKI (Communicated
More informationMath 121 Homework 5: Notes on Selected Problems
Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements
More informationGENERALIZED AMALGAMATION IN SIMPLE THEORIES AND CHARACTERIZATION OF DEPENDENCE IN NON-ELEMENTARY CLASSES
GENERALIZED AMALGAMATION IN SIMPLE THEORIES AND CHARACTERIZATION OF DEPENDENCE IN NON-ELEMENTARY CLASSES By Alexei Kolesnikov Submitted in partial fulfillment of the requirements for the degree of Doctor
More informationGroups definable in o-minimal and NIP settings
Università di Pisa Dipartimento di Matematica Corso di Laurea Magistrale in Matematica Groups definable in o-minimal and NIP settings Tesi di Laurea Magistrale Candidato Alessandro Achille Relatore Prof.
More informationEmbedding Differential Algebraic Groups in Algebraic Groups
Embedding Differential Algebraic Groups in Algebraic Groups David Marker marker@math.uic.edu April 8, 2009 Pillay proved that every differential algebraic group can be differentially embedded into an algebraic
More informationNotes on ordinals and cardinals
Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}
More informationEstimates for probabilities of independent events and infinite series
Estimates for probabilities of independent events and infinite series Jürgen Grahl and Shahar evo September 9, 06 arxiv:609.0894v [math.pr] 8 Sep 06 Abstract This paper deals with finite or infinite sequences
More informationAlgebraic closure in continuous logic
Revista Colombiana de Matemáticas Volumen 41 (2007), páginas 279 285 Algebraic closure in continuous logic C. Ward Henson Hernando Tellez University of Illinois, Urbana-Champaign, USA Abstract. We study
More informationCOHEIR IN AVERAGEABLE CLASSES
OHEIR IN AVERAGEABLE LASSES WILL BONEY This document serves as a supplement to Boney [Bon, Section 3], in particular to provide the details to Proposition 3.6. Familiarity with that paper and Boney and
More informationGOOD FRAMES IN THE HART-SHELAH EXAMPLE
GOOD FRAMES IN THE HART-SHELAH EXAMPLE WILL BONEY AND SEBASTIEN VASEY Abstract. For a fixed natural number n 1, the Hart-Shelah example is an abstract elementary class (AEC) with amalgamation that is categorical
More information2. Prime and Maximal Ideals
18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the so-called prime and maximal ideals. Let
More informationA linear algebra proof of the fundamental theorem of algebra
A linear algebra proof of the fundamental theorem of algebra Andrés E. Caicedo May 18, 2010 Abstract We present a recent proof due to Harm Derksen, that any linear operator in a complex finite dimensional
More information3 The language of proof
3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;
More informationA linear algebra proof of the fundamental theorem of algebra
A linear algebra proof of the fundamental theorem of algebra Andrés E. Caicedo May 18, 2010 Abstract We present a recent proof due to Harm Derksen, that any linear operator in a complex finite dimensional
More informationTheorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.
5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field
More informationA TRICHOTOMY OF COUNTABLE, STABLE, UNSUPERSTABLE THEORIES
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 363, Number 3, March 2011, Pages 1619 1629 S 0002-9947(2010)05196-7 Article electronically published on September 23, 2010 A TRICHOTOMY OF COUNTABLE,
More informationSUPPLEMENT TO DENSE PAIRS OF O-MINIMAL STRUCTURES BY LOU VAN DEN DRIES
SUPPLEMENT TO DENSE PIRS OF O-MINIML STRUCTURES BY LOU VN DEN DRIES LLEN GEHRET Introduction If in doubt, all notations and assumptions are with respect to [7]. Generally speaking, exercises are things
More informationIndependence Relations in Theories with the Tree Property. Gwyneth Fae Harrison-Shermoen
Independence Relations in Theories with the Tree Property by Gwyneth Fae Harrison-Shermoen A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in
More informationARTEM CHERNIKOV AND SERGEI STARCHENKO
A NOTE ON THE ERDŐS-HAJNAL PROPERTY FOR STABLE GRAPHS arxiv:1504.08252v2 [math.lo] 11 Apr 2016 ARTEM CHERNIKOV AND SERGEI STARCHENKO Abstract. In this short note we provide a relatively simple proof of
More informationLECTURE 2: THE THICK SUBCATEGORY THEOREM
LECTURE 2: THE THICK SUBCATEGORY THEOREM 1. Introduction Suppose we wanted to prove that all p-local finite spectra of type n were evil. In general, this might be extremely hard to show. The thick subcategory
More informationBetween proof theory and model theory Three traditions in logic: Syntactic (formal deduction)
Overview Between proof theory and model theory Three traditions in logic: Syntactic (formal deduction) Jeremy Avigad Department of Philosophy Carnegie Mellon University avigad@cmu.edu http://andrew.cmu.edu/
More informationLECTURE 5: v n -PERIODIC HOMOTOPY GROUPS
LECTURE 5: v n -PERIODIC HOMOTOPY GROUPS Throughout this lecture, we fix a prime number p, an integer n 0, and a finite space A of type (n + 1) which can be written as ΣB, for some other space B. We let
More informationPETER A. CHOLAK, PETER GERDES, AND KAREN LANGE
D-MAXIMAL SETS PETER A. CHOLAK, PETER GERDES, AND KAREN LANGE Abstract. Soare [23] proved that the maximal sets form an orbit in E. We consider here D-maximal sets, generalizations of maximal sets introduced
More informationarxiv: v2 [math.gr] 14 May 2012
Ampleness in the free group A. Ould Houcine and K. Tent arxiv:1205.0929v2 [math.gr] 14 May 2012 May 15, 2012 Abstract We show that the theory of the free group and more generally the theory of any torsionfree
More information32 Divisibility Theory in Integral Domains
3 Divisibility Theory in Integral Domains As we have already mentioned, the ring of integers is the prototype of integral domains. There is a divisibility relation on * : an integer b is said to be divisible
More informationAmalgamation and the finite model property
Amalgamation and the finite model property Alex Kruckman University of California, Berkeley March 25, 2015 Alex Kruckman (UC Berkeley) Amalgamation and the FMP March 25, 2015 1 / 16 The motivating phenomenon
More informationFORKING AND DIVIDING IN HENSON GRAPHS
FORKING AND DIVIDING IN HENSON GRAPHS GABRIEL ONANT arxiv:1401.1570v1 [math.lo] 8 Jan 2014 Abstract. For n 3, define T n to be the theory of the generic K n-free graph, where K n is the complete graph
More information