Some Questions concerning Hrushovski’s Amalgamation Constructions
نویسندگان
چکیده
In his book on stable groups [Poi87] Poizat writes (with respect to our 1987 understanding of ω-stable fields): ”Nous n’avons pas fait de progrès décisif depuis le temps oú nous chassions les aurochs avec une hache de pierre; nous avons seulment acquis une meilleure comprehension de l’enjeu du problem”. Sadly, there is no better way to describe the current situation with respect to the problem of classifying strongly minimal sets. Since the refutation of Zilber’s Conjecture, Hrushovski’s amalgamation construction of new strongly minimal sets, introduced in [Hru93] and [Hru92], stood in the way of any (naive) attempt of classification of their possible pregeometries. Indeed, our mastery of the techniques underlying these constructions is now better than it used to be, but our understanding of the fundamental questions they give rise to can hardly be said to have improved. To the best of my knowledge, there has not been any progress at all with respect to some questions that have already been asked in Hrushovski’s original paper. Several survey papers deal with these amalgamation constructions (e.g. [Wag94], [Bal02] and [Poi02]). These papers are concerned mainly with the construction itself developing axiomatic frameworks in which it can be carried out and the known examples it gives rise to. The aim of the present paper is threefold, and different: • Present a setting given in the language of (standard) geometric stability theory in which these construction can be understood. • Show how new structures which have been recently constructed using these methods (most notably [BMPZ05b] and [BHMPW06]) fit into this framework. • Point out fundamental questions concerning these constructions, that to the best of my knowledge have not been addressed. A central theme of this paper is that the major gap in our understanding of the scope of these constructions lies in the technically simpler part, usually known as the free construction, whereas the more involved part of the construction, known as the collapse, is fairly well understood.
منابع مشابه
The geometry of Hrushovski constructions, II. The strongly minimal case
We investigate the isomorphism types of combinatorial geometries arising from Hrushovski’s flat strongly minimal structures and answer some questions from Hrushovski’s original paper.
متن کاملHomology groups of types in model theory and the computation of H2(p)
We present definitions of homology groups Hn(p), n ≥ 0, associated to a complete type p. We show that if the generalized amalgamation properties hold, then the homology groups are trivial. We compute the group H2(p) for strong types in stable theories and show that any profinite abelian group can occur as the group H2(p). The work described in this paper was originally inspired by Hrushovski’s ...
متن کاملAn exposition of Hrushovski's New Strongly Minimal Set
This refuted a conjecture of B. Zilber that a strongly minimal theory must either be locally modular or interpret an infinite field (see [7]). Hrushovski’s method was extended and applied to many other questions, for example to the fusion of two strongly minimal theories ([4]) or recently to the construction of a bad field in [3]. There were also attempts to simplify Hrushovski’s original const...
متن کاملHomology of Types in Model Theory Ii: a Hurewicz Theorem for Stable Theories
This is a sequel to the paper [6] ‘Homology of types in model theory I: Basic concepts and connections with type amalgamation’. We compute the group H2 for strong types in stable theories and show that any profinite abelian group can occur as the group H2 in the model-theoretic context. The work described in this paper was originally inspired by Hrushovski’s discovery [8] of striking connection...
متن کاملOn the Model Theory of Random Graphs
Title of dissertation: ON THE MODEL THEORY OF RANDOM GRAPHS Justin Brody, Doctor of Philosophy, 2009 Dissertation directed by: Professor Michael C. Laskowski Department of Mathematics Hrushovski’s amalgamation construction can be used to join a collection of finite graphs to produce a “generic” of this collection. The choice of the collection and the way they are joined are determined by a real...
متن کامل