View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Annals of Pure and Applied Logic 121 (2003) 113–143 www.elsevier.com/locate/apal Coset-minimal groups Oleg Belegradeka , Viktor Verbovskiyb;1 , Frank O. Wagnerc;∗ aDepartment of Mathematics, Istanbul Bilgi University, Kustepe 80310, Sisli, Istanbul, Turkey bInstitute of Problems of Informatics and Control, Ministry of Education and Science, Ul. Pushkina 125, Almaty 480100, Kazakhstan cInstitut Girard Desargues, Universiteà Claude Bernard (Lyon 1), 21 avenue Claude Bernard, F-69622 Villeurbanne-Cedex, France Received 15 February 2002; received in revised form 18 July 2002; accepted 6 August 2002 Communicated by A.J. Wilkie Abstract A totally ordered group G (possibly with extra structure) is called coset-minimal if every deÿnable subset of G is a ÿnite union of cosets of deÿnable subgroups intersected with inter- vals with endpoints in G ∪ {±∞}. Continuing work in Belegradek et al. (J. Symbolic Logic 65(3) (2000) 1115) and Point and Wagner (Ann. Pure Appl. Logic 105(1–3) (2000) 261), we study coset-minimality, as well as two weak versions of the notion: eventual and ultimate coset-minimality. These groups are abelian; an eventually coset-minimal group, as a pure or- dered group, is an ordered abelian group of ÿnite regular rank. Any pure ordered abelian group of ÿnite regular rank is ultimately coset-minimal and has the exchange property; moreover, every deÿnable function in such a group is piecewise linear. Pure coset-minimal and even- tually coset-minimal groups are classiÿed. In a discrete coset-minimal group every deÿnable unary function is piece-wise linear (this improves a result in Point and Wagner (Ann. Pure Appl. Logic 105(1–3) (2000) 261), where coset-minimality of the theory of the group was re- quired). A dense coset-minimal group has the exchange property (which is false in the discrete case (M.S.R.I., preprint series, 1998-051)); moreover, any deÿnable unary function is piecewise ∗ Corresponding author. E-mail addresses: [email protected] (O. Belegradek), [email protected] (V. Verbovskiy), [email protected] (F.O. Wagner). 1 Research partially done while visiting the Institut Girard Desargues in December 1999, supported by PICS 541-Kazakhstan. I would like to thank Bruno Poizat for his hospitality and helpful conversations. Research also partially supported by CRDF grant KM2-22H6. 0168-0072/03/$ - see front matter c 2002 Elsevier Science B.V. All rights reserved. PII: S0168-0072(02)00084-2 114 O. Belegradek et al. / Annals of Pure and Applied Logic 121 (2003) 113–143 linear, except possibly for ÿnitely many cosets of the smallest deÿnable convex nonzero subgroup. Finally, we give some examples and open questions. c 2002 Elsevier Science B.V. All rights reserved. MSC: 03C64 Keywords: Coset-minimality; Piecewise linear; Exchange property; Regular rank 1. Introduction In model theory one of the ÿrst natural questions is what the deÿnable relations in a given structure are. An opposite natural question is, given a particular characterization of the deÿnable sets, what we can say about the structure. An ordered structure in which the deÿnable sets are as simple as possible—only the Boolean combinations of intervals with endpoints in the structure—is called o-minimal [9]. In [2] a notion of quasi-o-minimality (introduced in [4] as a generalization of o- minimality) had been studied. A complete theory of ordered structures is called quasi- o-minimal if every deÿnable set in any of its models is a Boolean combination of parameter-free deÿnable sets and intervals with endpoints in the model. In particular, ordered groups (which may carry extra structure) with quasi-o-minimal theories had been analyzed. (Throughout the paper, for short, we call ordered groups with extra structure just groups.) In particular, it was proven that any such group is abelian, and any divisible such group is o-minimal. The theories of the lexicographically ordered groups Zn and Zn × Q with all elements named provide examples of quasi-o- minimal theories. Moreover, for each of these speciÿc groups, every deÿnable set in any model G of the theory of the group is a ÿnite union of cosets of subgroups mG intersected with intervals, for some positive integer m. (We shall elaborate this and some related results in the present paper.) This is based on a quantiÿer elimination result for ordered abelian groups of ÿnite regular rank due to Weispfenning [12], which allows an easy characterization of deÿnable sets in the groups; see Fact 8 below. We recall that an ordered group is regular if it is elementarily equivalent (as a pure ordered group) to an archimedean group [11], or, equivalently, if for all n¿0 any interval of size at least n contains an n-divisible element. An ordered abelian group G is said to have ÿnite regular rank if it has a ÿnite series {0}=G0¡G1¡ ···¡Gd =G of convex subgroups Gi with regular quotients Gi+1=Gi (for i¡d). Such a series of minimal possible length n is uniquely determined [1], and d is called the regular rank of the group. Pure ordered abelian groups of ÿnite regular rank can be characterized as the ordered groups elementarily equivalent to subgroups of the lexicographically ordered groups Rn; n¡!, or as the ordered abelian groups with ÿnitely many deÿnable convex subgroups [1]. Fact 1 (Belegradek [1]). (1) In any pure ordered abelian group of ÿnite regular rank d there is only one ÿnite series of convex subgroups with regular quotients of length d. It is the unique ÿnite series {0}=G0¡G1¡ ···¡Gd =G of convex subgroups such O. Belegradek et al. / Annals of Pure and Applied Logic 121 (2003) 113–143 115 that Gi+1=Gi is regular for all i¡d, and not divisible if 0¡i¡d. All members of the series are parameter-free deÿnable. (2) In any ordered abelian group with ÿnitely many deÿnable convex subgroups they form a series with regular quotients. The number of nonzero such subgroups is greater or equal to the regular rank of the group; for pure groups the two numbers are equal. In [10] the theory of quasi-o-minimality in the context of groups had been further developed. A group is called coset-minimal if every deÿnable set in it is a ÿnite union of cosets of deÿnable subgroups intersected with intervals. We say that the theory of an ordered group is coset-minimal if every model of it is coset-minimal. We do not know if the theory of any coset-minimal group is coset-minimal. It was shown that the theory of a group G is coset-minimal iJ the theory of G with all elements named is quasi-o-minimal. The above-mentioned characterization of deÿnable sets in models of the theories of pure ordered groups Zn and Zn × Q shows that these theories are coset-minimal (see Section 2). A coset-minimal group need not be a pure ordered group: it was shown in [3] that the theory of the ordered group Z × Z expanded by the endomorphism (x; y) → (0;x) is coset-minimal. It was proven in [10] that any coset-minimal group is an expansion of a group elementarily equivalent to Zn or Zn × Q, for some n. Thus the coset-minimal pure ordered groups are exactly the groups elementarily equivalent to Zn or Zn × Q (Corollary 16). In the study of quasi-o-minimal groups [2] a crucial role belongs to analysis of behavior of deÿnable sets near inÿnity and near the cuts corresponding to convex deÿnable subgroups. This motivated the following notions [10]. Let (M; ¡) be a linearly ordered set, and A; X; Y subsets of M. We say (cf. [2]) that X is ultimately equal to Y in A if there is a∈A such that X ∩A∩[a; ∞)=Y ∩A∩[a; ∞). If A=M, it is usually omitted. A group G is called ultimately coset-minimal if for every deÿnable convex subgroup H of G, every deÿnable set X in G is ultimately equal in H to a ÿnite union of cosets of some (not necessarily deÿnable) subgroups of G. A group G is called eventually coset-minimal if for every deÿnable nontrivial convex subgroup H of G and every deÿnable set X in G there are a∈H and b¿H (if H =G then b is allowed to be ∞) such that on the interval (a; b) the set X is equal to a ÿnite union of cosets of some (not necessarily deÿnable) subgroups of G. Clearly, coset-minimality implies eventual coset-minimality, which in turn implies ultimate coset-minimality. These weak versions of coset-minimality were introduced in [10], where ultimate coset-minimality was called ultimate periodicity, and eventual coset-minimality essential periodicity. The condition of ultimate coset-minimality implies strong consequences. Fact 2 (Point and Wagner [10, Theorem 2.2, Proposition 2.4]). Let G be an ulti- mately coset-minimal group. Then: (1) G is abelian. 116 O. Belegradek et al. / Annals of Pure and Applied Logic 121 (2003) 113–143 (2) Every deÿnable subgroup of G has ÿnite index in its convex hull; in particular the index |G : nG| is ÿnite for all n¡!. (3) If H is a deÿnable subgroup of G and X a deÿnable subset of H, then X is ultimately equal in H to a ÿnite union of cosets of nG, for some n¡!. (4) G is eventually coset-minimal i@ for any deÿnable proper nonzero convex sub- group H the quotient G=H is discrete.
Details
-
File Typepdf
-
Upload Time-
-
Content LanguagesEnglish
-
Upload UserAnonymous/Not logged-in
-
File Pages31 Page
-
File Size-