SU\G(𝔸)/K·U
Sign Up for free Log In

Generic stability, forking, and þ-forking

Authors

Darío García, Alf Onshuus, Alexander Usvyatsov
Type: Article
Publication Date: 2012-07-24
Citations: 6
DOI: https://doi.org/10.1090/s0002-9947-2012-05451-1

Abstract

Abstract notions of “smallness” are among the most important tools that model theory offers for the analysis of arbitrary structures. The two most useful notions of this kind are forking (which is closely related to certain measure zero ideals) and thorn-forking (which generalizes the usual topological dimension). Under certain mild assumptions, forking is the finest notion of smallness, whereas thorn-forking is the coarsest. In this paper we study forking and thorn-forking, restricting ourselves to the class of generically stable types. Our main conclusion is that in this context these two notions coincide. We explore some applications of this equivalence.

Locations

  • Transactions of the American Mathematical Society
    View

Similar Works

On non-forking spectra

2012-01-01
Artem Chernikov , Itay Kaplan , Saharon Shelah
Non-forking is one of the most important notions in modern model theory capturing the idea of a generic extension of a type (which is a far-reaching generalization of the concept … Non-forking is one of the most important notions in modern model theory capturing the idea of a generic extension of a type (which is a far-reaching generalization of the concept of a generic point of a variety). To a countable first-order theory we associate its non-forking spectrum - a function of two cardinals kappa and lambda giving the supremum of the possible number of types over a model of size lambda that do not fork over a sub-model of size kappa. This is a natural generalization of the stability function of a theory. We make progress towards classifying the non-forking spectra. On the one hand, we show that the possible values a non-forking spectrum may take are quite limited. On the other hand, we develop a general technique for constructing theories with a prescribed non-forking spectrum, thus giving a number of examples. In particular, we answer negatively a question of Adler whether NIP is equivalent to bounded non-forking. In addition, we answer a question of Keisler regarding the number of cuts a linear order may have. Namely, we show that it is possible that ded(kappa) < ded(kappa)^omega.
Chat View PDF

On non-forking spectra

2012-05-14
Artem Chernikov , Itay Kaplan , Saharon Shelah
Non-forking is one of the most important notions in modern model theory capturing the idea of a generic extension of a type (which is a far-reaching generalization of the concept … Non-forking is one of the most important notions in modern model theory capturing the idea of a generic extension of a type (which is a far-reaching generalization of the concept of a generic point of a variety). To a countable first-order theory we associate its non-forking spectrum - a function of two cardinals kappa and lambda giving the supremum of the possible number of types over a model of size lambda that do not fork over a sub-model of size kappa. This is a natural generalization of the stability function of a theory. We make progress towards classifying the non-forking spectra. On the one hand, we show that the possible values a non-forking spectrum may take are quite limited. On the other hand, we develop a general technique for constructing theories with a prescribed non-forking spectrum, thus giving a number of examples. In particular, we answer negatively a question of Adler whether NIP is equivalent to bounded non-forking. In addition, we answer a question of Keisler regarding the number of cuts a linear order may have. Namely, we show that it is possible that ded(kappa) < ded(kappa)^omega.
Chat View PDF

On non-forking spectra

2016-11-14
Artem Chernikov , Itay Kaplan , Saharon Shelah
Non-forking is one of the most important notions in modern model theory capturing the idea of a generic extension of a type (which is a far-reaching generalization of the concept … Non-forking is one of the most important notions in modern model theory capturing the idea of a generic extension of a type (which is a far-reaching generalization of the concept of a generic point of a variety). To a countable first-order theory we associate its non-forking spectrum – a function of two cardinals \kappa and \lambda giving the supremum of the possible number of types over a model of size \lambda that do not fork over a sub-model of size \kappa . This is a natural generalization of the stability function of a theory. We make progress towards classifying the non-forking spectra. On the one hand, we show that the possible values a non-forking spectrum may take are quite limited. On the other hand, we develop a general technique for constructing theories with a prescribed non-forking spectrum, thus giving a number of examples. In particular, we answer negatively a question of Adler whether NIP is equivalent to bounded non-forking. In addition, we answer a question of Keisler regarding the number of cuts a linear order may have. Namely, we show that it is possible that ded \kappa &lt; (ded _\kappa) ^{\omega} .

A Kunen-Like Model with a Critical Failure of the Continuum Hypothesis

2024-12-06
Omer Ben-Neria , Elliot Kaplan
We construct a model of the form $L[A,U]$ that exhibits the simplest structural behavior of $\sigma$-complete ultrafilters in a model of set theory with a single measurable cardinal $\kappa$ , … We construct a model of the form $L[A,U]$ that exhibits the simplest structural behavior of $\sigma$-complete ultrafilters in a model of set theory with a single measurable cardinal $\kappa$ , yet satisfies $2^\kappa = \kappa^{++}$. This result establishes a limitation on the extent to which structural properties of ultrafilters can determine the cardinal arithmetic at large cardinals, and answers a question posed by Goldberg concerning the failure of the Continuum Hypothesis at a measurable cardinal in a model of the Ultrapower Axiom. The construction introduces several methods in extensions of embeddings theory and fine-structure-based forcing, designed to control the behavior of non-normal ultrafilters in generic extensions.
Chat View PDF

The stable forking conjecture and generic structures

2003-07-01
Massoud Pourmahdian

A NOTE ON STABLE KIM-FORKING

2024-11-05
Yvon Bossut

The Stable Forking Conjecture in Homogeneous Model Theory

2004-05-01
Massoud Pourmahdian
We construct a simple homogeneous model without the stable forking property. We construct a simple homogeneous model without the stable forking property.

Ehrenfeucht-Mostowski models in abstract elementary classes

2005-01-01
John T. Baldwin
We work in the context of an abstract elementary class (AEC) with the amalgamation and joint embedding properties and arbitrarily large models.We prove two results using Ehrenfeucht-Mostowski models: 1) Morley's … We work in the context of an abstract elementary class (AEC) with the amalgamation and joint embedding properties and arbitrarily large models.We prove two results using Ehrenfeucht-Mostowski models: 1) Morley's omitting types theorem -for Galois types.2) If an AEC (with amalgamation) is categorical in some uncountable power µ it is stable in (every) λ < µ.These results are lemmas towards Shelah's consideration [12] of the downward transfer of categoricity, which we discuss in Section 6.This paper expounds some of the main ideas of [12], filling in vague allusions to earlier work and trying to separate those results which depend only on the Ehrenfeucht-Mostowski method from those which require more sophisticated stability theoretic tools.In [15], Shelah proclaims the aim of reconstructing model theory, 'with no use of even traces compactness'.We analyze here one aspect of this program.Keisler organizes [8] around four kinds of constructions: the Henkin method, Ehrenfeucht-Mostowski models, unions of chains, and ultraproducts.The later history of model theory reveals a plethora of tools arising in stability theory.Fundamental is a notion of dependence which arises from Morley's study of rank, and passes through various avatars of splitting, strong splitting, and dividing before being fully actualized in the first order setting as forking.We eschew this technique altogether in this paperto isolate its role.The axioms of an AEC (K, K ), were first set down in [17].We repeat for convenience.Definition 0.1.A class of L-structures, (K, K ), is said to be an abstract elementary class: AEC if both K and the binary relation K are closed under isomorphism and satisfy the following conditions.K is a partial order on K.
Chat View PDF

Prevalence of Generic Laver Diamond

2015-02-26
Sean Cox
Viale (2012) introduced the notion of Generic Laver Diamond at $\kappa$—which we denote $\Diamond _{\text {Lav}}(\kappa )$—asserting the existence of a single function from $\kappa \to H_\kappa$ that behaves much … Viale (2012) introduced the notion of Generic Laver Diamond at $\kappa$—which we denote $\Diamond _{\text {Lav}}(\kappa )$—asserting the existence of a single function from $\kappa \to H_\kappa$ that behaves much like a supercompact Laver function, except with generic elementary embeddings rather than internal embeddings. Viale proved that the Proper Forcing Axiom (PFA) implies $\Diamond _{\text {Lav}}(\omega _2)$. We strengthen his theorem by weakening the hypothesis to a statement strictly weaker than PFA. We also show that the principle $\Diamond _{\text {Lav}}(\kappa )$ provides a uniform, simple construction of 2-cardinal diamonds, and prove that $\Diamond _{\text {Lav}}(\kappa )$ is quite prevalent in models of set theory; in particular: $L$ satisfies $\Diamond ^+_{\text {Lav}}(\kappa )$ whenever $\kappa$ is a successor cardinal, or when the appropriate version of Chang’s Conjecture fails. For any successor cardinal $\kappa$, there is a $\kappa$-directed closed class forcing—namely, the forcing from Friedman-Holy (2011)—that forces $\Diamond _{\text {Lav}}(\kappa )$.
Chat View PDF

Geometric Stability Theory

1996-09-12
Anand Pillay
Abstract This book gives an account of the fundamental results in geometric stability theory, a subject that has grown out of categoricity and classification theory. This approach studies the fine … Abstract This book gives an account of the fundamental results in geometric stability theory, a subject that has grown out of categoricity and classification theory. This approach studies the fine structure of models of stable theories, using the geometry of forking; this often achieves global results relevant to classification theory. Topics range from Zilber-Cherlin classification of infinite locally finite homogenous geometries, to regular types, their geometries, and their role in superstable theories. The structure and existence of definable groups is featured prominently, as is work by Hrushovski. The book is unique in the range and depth of material covered and will be invaluable to anyone interested in modern model theory.

Stability Theory and its Variants

2000-01-01
Bradd Hart
Dimension theory plays a crucial technical role in stability theory and its relatives. The abstract dependence relations defined, although combinatorial in nature, often have surprising geometric meaning in particular cases. … Dimension theory plays a crucial technical role in stability theory and its relatives. The abstract dependence relations defined, although combinatorial in nature, often have surprising geometric meaning in particular cases. This article discusses several aspects of dimension theory, such as categoricity, strongly minimal sets, modularity and the Zil’ber principle, forking, simple theories, orthogonality and regular types and in the third, stability, definability of types, stable groups and 1-based groups. One of the achievements of the branch of model theory known as stability theory is the use of numerical invariants, dimensions, in a broad setting. In recent years, this dimension theory has been expanded to include the so-called simple theories. In this paper, I wish to give just a brief overview of the elements of this theory. In the first section, the special case of strongly minimal sets is considered. In the second section, the combinatorial definition of dividing is given and how it leads to a general independence relation is outlined. Only in the third section do stable theories appear and the theory surrounding them is developed there with an eye to other papers in this volume. 1. Strongly Minimal Sets Categorical Theories. One of the simplest questions one can ask about a first order theory is how many models it has of a given cardinality. If T is a countable theory with an infinite model then, by the Lowenheim–Skolem Theorem, it will have at least one model of every infinite power. The situation we will look at first is when a theory has exactly one model of some fixed power. Definition 1.1. A theory T is λ-categorical if T has exactly one model up to isomorphism of cardinality λ. T is said to be totally categorical if T is λ-categorical for every infinite cardinal λ. We will say that T is uncountably categorical if T is λ-categorical for all uncountable λ. Example 1.2. 1. The theory of a set in a language which has only equality is totally categorical.

Fundamentals of forking

1984-06-01
Victor Harnik , Leo Harrington

Prevalence of Generic Laver Diamond

2014-05-12
Sean Cox
Viale \cite{Viale_GuessingModel} introduced the notion of Generic Laver Diamond at $\kappa$---which we denote $\Diamond_{\text{Lav}}(\kappa)$---asserting the existence of a single function from $\kappa \to H_\kappa$ that behaves much like a supercompact … Viale \cite{Viale_GuessingModel} introduced the notion of Generic Laver Diamond at $\kappa$---which we denote $\Diamond_{\text{Lav}}(\kappa)$---asserting the existence of a single function from $\kappa \to H_\kappa$ that behaves much like a supercompact Laver function, except with generic elementary embeddings rather than internal embeddings. Viale proved that the Proper Forcing Axiom (PFA) implies $\Diamond_{\text{Lav}}(\omega_2)$. We strengthen his theorem by weakening the hypothesis to a statement strictly weaker than PFA. We also show that the principle $\Diamond_{\text{Lav}}(\kappa)$ provides a uniform, simple construction of 2-cardinal diamonds, and prove that $\Diamond_{\text{Lav}}(\kappa)$ is quite prevalent in models of set theory; in particular: 1) $L$ satisfies $\Diamond_{\text{Lav}}^+(\kappa)$ whenever $\kappa$ is a successor cardinal, or when the appropriate version of Chang's Conjecture fails. 2) For any successor cardinal $\kappa$, there is a $\kappa$-directed closed class forcing---namely, the forcing from Friedman-Holy \cite{MR2860182}---that forces $\Diamond_{\text{Lav}}(\kappa)$.
Chat View PDF

Prevalence of Generic Laver Diamond

2014-01-01
Sean Cox
Viale \cite{Viale_GuessingModel} introduced the notion of Generic Laver Diamond at $\kappa$---which we denote $\Diamond_{\text{Lav}}(\kappa)$---asserting the existence of a single function from $\kappa \to H_\kappa$ that behaves much like a supercompact … Viale \cite{Viale_GuessingModel} introduced the notion of Generic Laver Diamond at $\kappa$---which we denote $\Diamond_{\text{Lav}}(\kappa)$---asserting the existence of a single function from $\kappa \to H_\kappa$ that behaves much like a supercompact Laver function, except with generic elementary embeddings rather than internal embeddings. Viale proved that the Proper Forcing Axiom (PFA) implies $\Diamond_{\text{Lav}}(\omega_2)$. We strengthen his theorem by weakening the hypothesis to a statement strictly weaker than PFA. We also show that the principle $\Diamond_{\text{Lav}}(\kappa)$ provides a uniform, simple construction of 2-cardinal diamonds, and prove that $\Diamond_{\text{Lav}}(\kappa)$ is quite prevalent in models of set theory; in particular: 1) $L$ satisfies $\Diamond_{\text{Lav}}^+(\kappa)$ whenever $\kappa$ is a successor cardinal, or when the appropriate version of Chang's Conjecture fails. 2) For any successor cardinal $\kappa$, there is a $\kappa$-directed closed class forcing---namely, the forcing from Friedman-Holy \cite{MR2860182}---that forces $\Diamond_{\text{Lav}}(\kappa)$.
Chat View PDF

Generic embeddings associated to an indestructibly weakly compact cardinal

2010-09-02
Günter Fuchs
Chat View PDF

Structures

2019-04-04
Jonathan Kirby
Model theory begins with an audacious idea: to consider statements about mathematical structures as mathematical objects of study in their own right. While inherently important as a tool of mathematical … Model theory begins with an audacious idea: to consider statements about mathematical structures as mathematical objects of study in their own right. While inherently important as a tool of mathematical logic, it also enjoys connections to and applications in diverse branches of mathematics, including algebra, number theory and analysis. Despite this, traditional introductions to model theory assume a graduate-level background of the reader. In this innovative textbook, Jonathan Kirby brings model theory to an undergraduate audience. The highlights of basic model theory are illustrated through examples from specific structures familiar from undergraduate mathematics, paying particular attention to definable sets throughout. With numerous exercises of varying difficulty, this is an accessible introduction to model theory and its place in mathematics.

Preface

2019-04-04
Jonathan Kirby
Model theory begins with an audacious idea: to consider statements about mathematical structures as mathematical objects of study in their own right. While inherently important as a tool of mathematical … Model theory begins with an audacious idea: to consider statements about mathematical structures as mathematical objects of study in their own right. While inherently important as a tool of mathematical logic, it also enjoys connections to and applications in diverse branches of mathematics, including algebra, number theory and analysis. Despite this, traditional introductions to model theory assume a graduate-level background of the reader. In this innovative textbook, Jonathan Kirby brings model theory to an undergraduate audience. The highlights of basic model theory are illustrated through examples from specific structures familiar from undergraduate mathematics, paying particular attention to definable sets throughout. With numerous exercises of varying difficulty, this is an accessible introduction to model theory and its place in mathematics.

Index

2019-04-04
Jonathan Kirby
Model theory begins with an audacious idea: to consider statements about mathematical structures as mathematical objects of study in their own right. While inherently important as a tool of mathematical … Model theory begins with an audacious idea: to consider statements about mathematical structures as mathematical objects of study in their own right. While inherently important as a tool of mathematical logic, it also enjoys connections to and applications in diverse branches of mathematics, including algebra, number theory and analysis. Despite this, traditional introductions to model theory assume a graduate-level background of the reader. In this innovative textbook, Jonathan Kirby brings model theory to an undergraduate audience. The highlights of basic model theory are illustrated through examples from specific structures familiar from undergraduate mathematics, paying particular attention to definable sets throughout. With numerous exercises of varying difficulty, this is an accessible introduction to model theory and its place in mathematics.

Substructure Completeness

2019-04-04
Jonathan Kirby
Model theory begins with an audacious idea: to consider statements about mathematical structures as mathematical objects of study in their own right. While inherently important as a tool of mathematical … Model theory begins with an audacious idea: to consider statements about mathematical structures as mathematical objects of study in their own right. While inherently important as a tool of mathematical logic, it also enjoys connections to and applications in diverse branches of mathematics, including algebra, number theory and analysis. Despite this, traditional introductions to model theory assume a graduate-level background of the reader. In this innovative textbook, Jonathan Kirby brings model theory to an undergraduate audience. The highlights of basic model theory are illustrated through examples from specific structures familiar from undergraduate mathematics, paying particular attention to definable sets throughout. With numerous exercises of varying difficulty, this is an accessible introduction to model theory and its place in mathematics.

The forking effect

2021-05-03
Florentina Șoiman , Mathis Mourey , Jean‐Guillaume Dumas +1 more
Chat View PDF

Cited by (6)

Generic stability and stability

2012-10-22
Hans H. Adler , Enrique Casanovas , Anand Pillay
We prove two results about generically stable types $p$ in arbitrary theories. The first, on existence of strong germs, generalizes results from D. Haskell, E. Hrushovski and D. Macpherson on … We prove two results about generically stable types $p$ in arbitrary theories. The first, on existence of strong germs, generalizes results from D. Haskell, E. Hrushovski and D. Macpherson on stably dominated types. The second is an equivalence of forking and dividing, assuming generic stability of $p^{(m)}$ for all $m$. We use the latter result to answer in full generality a question posed by Hasson and Onshuus: If $p(x)\in S(B)$ is stable and does not fork over $A$ then $p\restriction A$ is stable. (They had solved some special cases.)

THE GROUP CONFIGURATION THEOREM FOR GENERICALLY STABLE TYPES

2024-11-11
Paul Wang
Abstract We generalize Hrushovski’s group configuration theorem to the case where the type of the configuration is generically stable, without assuming tameness of the ambient theory. The properties of generically … Abstract We generalize Hrushovski’s group configuration theorem to the case where the type of the configuration is generically stable, without assuming tameness of the ambient theory. The properties of generically stable types, which we recall in the second section, enable us to adapt the proof known in the stable context.
Chat View PDF

Remarks on generic stability in independent theories

2019-09-05
Gabriel Conant , Kyle Gannon
Chat View PDF

Minimal stable types in Banach spaces

2019-08-19
Saharon Shelah , Alexander Usvyatsov
Chat View PDF

Independence in Model Theory

2016-01-01
Åsa Hirvonen

GENERIC STABILITY AND STABILITY

2014-03-01
Hans H. Adler , Enrique Casanovas , Anand Pillay
Abstract We prove two results about generically stable types p in arbitrary theories. The first, on existence of strong germs, generalizes results from [2] on stably dominated types. The second … Abstract We prove two results about generically stable types p in arbitrary theories. The first, on existence of strong germs, generalizes results from [2] on stably dominated types. The second is an equivalence of forking and dividing, assuming generic stability of p ( m ) for all m . We use the latter result to answer in full generality a question posed by Hasson and Onshuus: If P ( x ) ε S ( B ) is stable and does not fork over A then prestrictionA is stable. (They had solved some special cases.)
Chat View PDF

References (19)

Stable Domination and Independence in Algebraically Closed Valued Fields

2007-12-10
Deirdre Haskell , Ehud Hrushovski , Dugald Macpherson
This book addresses a gap in the model-theoretic understanding of valued fields that had limited the interactions of model theory with geometry. It contains significant developments in both pure and … This book addresses a gap in the model-theoretic understanding of valued fields that had limited the interactions of model theory with geometry. It contains significant developments in both pure and applied model theory. Part I of the book is a study of stably dominated types. These form a subset of the type space of a theory that behaves in many ways like the space of types in a stable theory. This part begins with an introduction to the key ideas of stability theory for stably dominated types. Part II continues with an outline of some classical results in the model theory of valued fields and explores the application of stable domination to algebraically closed valued fields. The research presented here is made accessible to the general model theorist by the inclusion of the introductory sections of each part.
Chat View PDF

Generically stable and smooth measures in NIP theories

2012-12-13
Ehud Hrushovski , Anand Pillay , Pierre Simon
We formulate the measure analogue of generically stable types in first order theories with $NIP$ (without the independence property), giving several characterizations, answering some questions from an earlier paper by … We formulate the measure analogue of generically stable types in first order theories with $NIP$ (without the independence property), giving several characterizations, answering some questions from an earlier paper by Hrushovski and Pillay, and giving another treatment of uniqueness results from the same paper. We introduce a notion of "generic compact domination", relating it to stationarity of the Keisler measures, and also giving definable group versions. We also prove the "approximate definability" of arbitrary Borel probability measures on definable sets in the real and $p$-adic fields.
Chat View PDF

On generically stable types in dependent theories

2009-01-04
Alexander Usvyatsov
Abstract We develop the theory of generically stable types, independence relation based on nonforking and stable weight in the context of dependent theories. Abstract We develop the theory of generically stable types, independence relation based on nonforking and stable weight in the context of dependent theories.
Chat View PDF

Strongly dependent theories

2014-07-28
Saharon Shelah
Chat View PDF

Returning to semi-bounded sets

2009-06-01
Ya’acov Peterzil
Abstract An o-minimal expansion of an ordered group is called semi-bounded if there is no definable bijection between a bounded and an unbounded interval in it (equivalently, it is an … Abstract An o-minimal expansion of an ordered group is called semi-bounded if there is no definable bijection between a bounded and an unbounded interval in it (equivalently, it is an expansion of the group by bounded predicates and group automorphisms). It is shown that every such structure has an elementary extension N such that either N is a reduct of an ordered vector space, or there is an o-minimal structure , with the same universe but of different language from N , with (i) Every definable set in N is definable in , and (ii) has an elementary substructure in which every bounded interval admits a definable real closed field. As a result certain questions about definably compact groups can be reduced to either ordered vector spaces or expansions of real closed fields. Using the known results in these two settings, the number of torsion points in definably compact abelian groups in expansions of ordered groups is given. Pillay's Conjecture for such groups follows.

Measures and forking

1987-01-01
H. Jerome Keisler

Dependent first order theories, continued

2009-09-01
Saharon Shelah
Chat View PDF

Thorn orthogonality and domination in unstable theories

2011-01-01
Alf Onshuus , Alexander Usvyatsov
We study orthogonality, domination, weight, regular and minimal types in the contexts of rosy and super-rosy theories. We study orthogonality, domination, weight, regular and minimal types in the contexts of rosy and super-rosy theories.
Chat View PDF

Stable types in rosy theories

2010-10-04
Assaf Hasson , Alf Onshuus
Abstract We study the behaviour of stable types in rosy theories. The main technical result is that a non-þ-forking extension of an unstable type is unstable. We apply this to … Abstract We study the behaviour of stable types in rosy theories. The main technical result is that a non-þ-forking extension of an unstable type is unstable. We apply this to show that a rosy group with a þ-generic stable type is stable. In the context of super-rosy theories of finite rank we conclude that non-trivial stable types of U þ -rank 1 must arise from definable stable sets.

Properties and consequences of Thorn-independence

2006-03-01
Alf Onshuus
Abstract We develop a new notion of independence (ϸ-independence, read “thorn”-independence) that arises from a family of ranks suggested by Scanlon (ϸ-ranks). We prove that in a large class of … Abstract We develop a new notion of independence (ϸ-independence, read “thorn”-independence) that arises from a family of ranks suggested by Scanlon (ϸ-ranks). We prove that in a large class of theories (including simple theories and o-minimal theories) this notion has many of the properties needed for an adequate geometric structure. We prove that ϸ-independence agrees with the usual independence notions in stable, supersimple and o-minimal theories. Furthermore, we give some evidence that the equivalence between forking and ϸ-forking in simple theories might be closely related to one of the main open conjectures in simplicity theory, the stable forking conjecture. In particular, we prove that in any simple theory where the stable forking conjecture holds, ϸ-independence and forking independence agree.

On dp-minimality, strong dependence and weight

2011-07-06
Alf Onshuus , Alexander Usvyatsov
Abstract We study dp-minimal and strongly dependent theories and investigate connections between these notions and weight. Abstract We study dp-minimal and strongly dependent theories and investigate connections between these notions and weight.

A GEOMETRIC INTRODUCTION TO FORKING AND THORN-FORKING

2009-06-01
Hans H. Adler
A ternary relation [Formula: see text] between subsets of the big model of a complete first-order theory T is called an independence relation if it satisfies a certain set of … A ternary relation [Formula: see text] between subsets of the big model of a complete first-order theory T is called an independence relation if it satisfies a certain set of axioms. The primary example is forking in a simple theory, but o-minimal theories are also known to have an interesting independence relation. Our approach in this paper is to treat independence relations as mathematical objects worth studying. The main application is a better understanding of thorn-forking, which turns out to be closely related to modular pairs in the lattice of algebraically closed sets.

An introduction to forking

1979-09-01
Daniel Lascar , Bruno Poizat
The notion of forking has been introduced by Shelah, and a full treatment of it will appear in his book on stability [S1]. The principal aim of this paper is … The notion of forking has been introduced by Shelah, and a full treatment of it will appear in his book on stability [S1]. The principal aim of this paper is to show that it is an easy and natural notion. Consider some well-known examples of ℵ 0 -stable theories: vector spaces over Q , algebraically closed fields, differentially closed fields of characteristic 0; in each of these cases, we have a natural notion of independence: linear, algebraic and differential independence respectively. Forking gives a generalization of these notions. More precisely, if are subsets of some model and c a point of this model, the fact that the type of c over does not fork over means that there are no more relations of dependence between c and than there already existed between c and . In the case of the vector spaces, this means that c is in the space generated by only if it is already in the space generated by . In the case of differentially closed fields, this means that the minimal differential equations of c with coefficient respectively in and have the same order. Of course, these notions of dependence are essential for the study of the above mentioned structures. Forking is no less important for stable theories. A glance at Shelah's book will convince the reader that this is the case. What we have to do is the following. Assuming T stable and given and p a type on , we want to distinguish among the extensions of p to some of them that we shall call the nonforking extensions of p .

Generic stability, regularity, and quasiminimality

2011-09-07
Anand Pillay , Predrag Tanović
We study the notions generic stability, regularity, homogeneous pregeometries, quasiminimality, and their mutual relations, in arbitrary first order theories. We prove that “infinite-dimensional homogeneous pregeometries” coincide with generically stable strongly … We study the notions generic stability, regularity, homogeneous pregeometries, quasiminimality, and their mutual relations, in arbitrary first order theories. We prove that “infinite-dimensional homogeneous pregeometries” coincide with generically stable strongly regular types (p(x), x = x). We prove that in a theory without the strict order property, regular types are generically stable, and prove analogous results for quasiminimal structures. We prove that the “generic type” of a quasiminimal structure is “locally strongly regular”.
Chat View PDF

Groups, measures, and the NIP

2007-02-02
Ehud Hrushovski , Ya’acov Peterzil , Anand Pillay
We discuss measures, invariant measures on definable groups, and genericity, often in an NIP (failure of the independence property) environment. We complete the proof of the third author's conjectures relating … We discuss measures, invariant measures on definable groups, and genericity, often in an NIP (failure of the independence property) environment. We complete the proof of the third author's conjectures relating definably compact groups $G$ in saturated $o$-minimal structures to compact Lie groups. We also prove some other structural results about such $G$, for example the existence of a left invariant finitely additive probability measure on definable subsets of $G$. We finally introduce the new notion of "compact domination" (domination of a definable set by a compact space) and raise some new conjectures in the $o$-minimal case.
Chat View PDF

CLASSIFICATION THEORY FOR ELEMENTARY CLASSES WITH THE DEPENDENCE PROPERTY-A MODEST BEGINNING

2004-03-01
Saharon Shelah
Our thesis is that for the family of classes of the form EC(T),T a com- plete first order theory with the dependence property (which is just the negation of the … Our thesis is that for the family of classes of the form EC(T),T a com- plete first order theory with the dependence property (which is just the negation of the independence property) there is a substantial theory which means: a substantial body of basic results for all such classes and some complimentary results for the first order theories with the independence property, as for the family of stable (and the family of simple) first order theories. We examine some properties.

Zeta functions from definable equivalence relations

2006-12-31
Ehud Hrushovski , Benjamin Martin
We prove that the theory of the $p$-adics ${\mathbb Q}_p$ admits elimination of imaginaries provided we add a sort for ${\rm GL}_n({\mathbb Q}_p)/{\rm GL}_n({\mathbb Z}_p)$ for each $n$. We also … We prove that the theory of the $p$-adics ${\mathbb Q}_p$ admits elimination of imaginaries provided we add a sort for ${\rm GL}_n({\mathbb Q}_p)/{\rm GL}_n({\mathbb Z}_p)$ for each $n$. We also prove that the elimination of imaginaries is uniform in $p$. Using $p$-adic and motivic integration, we deduce the uniform rationality of certain formal zeta functions arising from definable equivalence relations. This also yields analogous results for definable equivalence relations over local fields of positive characteristic. The appendix contains an alternative proof, using cell decomposition, of the rationality (for fixed $p$) of these formal zeta functions that extends to the subanalytic context. As an application, we prove rationality and uniformity results for zeta functions obtained by counting twist isomorphism classes of irreducible representations of finitely generated nilpotent groups; these are analogous to similar results of Grunewald, Segal and Smith and of du Sautoy and Grunewald for subgroup zeta functions of finitely generated nilpotent groups.
Chat View PDF

Studies in Logic and the Foundations of Mathematics

1990-01-01

On NIP and invariant measures

2011-05-13
Ehud Hrushovski , Anand Pillay
We study forking, Lascar strong types, Keisler measures and definable groups, under an assumption of NIP (not the independence property), continuing aspects of the paper [16]. Among key results are … We study forking, Lascar strong types, Keisler measures and definable groups, under an assumption of NIP (not the independence property), continuing aspects of the paper [16]. Among key results are (i) if p = \mathrm{tp}(b/A) does not fork over A then the Lascar strong type of b over A coincides with the compact strong type of b over A and any global nonforking extension of p is Borel definable over \mathrm{bdd}(A) , (ii) analogous statements for Keisler measures and definable groups, including the fact that G^{000} = G^{00} for G definably amenable, (iii) definitions, characterizations and properties of “generically stable” types and groups, (iv) uniqueness of invariant (under the group action) Keisler measures on groups with finitely satisfiable generics, (v) a proof of the compact domination conjecture for (definably compact) commutative groups in o -minimal expansions of real closed fields.
Chat View PDF