on the o-minimal LS-category

We introduce the o-minimal LS-category of definable sets in o-minimal expansions of ordered fields and we establish a relation with the semialgebraic and the classical one. We also study the o-minimal LS-category of definable groups. Along the way, we show that two definably connected definably compact definable groups G and H are definable homotopy equivalent if and only if L(G) and L(H) are homotopy equivalent, where L is the functor which associates to each definable group its corresponding Lie group via Pillay’s conjecture.     

A remark on divisibility of definable groups

We show that if G is a definably compact, definably connected definable group defined in an arbitrary o‐minimal structure, then G is divisible. Furthermore, if G is defined in an o‐minimal expansion of a field, k ∈ ? and p_k : G → G is the definable map given by p_k (x ) = x^k for all x ∈ G , then we have |(p_k )^–1(x )| ≥ k^r for all x ∈ G , where r > 0 is the maximal dimension of abelian definable subgroups of G . (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Compact domination for groups definable in linear o-minimal structures

We prove the Compact Domination Conjecture for groups definable in linear o-minimal structures. Namely, we show that every definably compact group G definable in a saturated linear o-minimal expansion of an ordered group is compactly dominated by (G/G ⁰⁰, m, π), where m is the Haar measure on G/G ⁰⁰ and π : G → G/G ⁰⁰ is the canonical group homomorphism.     

<Emphasis Type="Italic">G</Emphasis>-linear sets and torsion points in definably compact groups

Let G be a definably compact group in an o-minimal expansion of a real closed field. We prove that if dim(G\X) < dim G for some definable then X contains a torsion point of G. Along the way we develop a general theory for the so-called G-linear sets, and investigate definable sets which contain abstract subgroups of G. M. Otero was Partially supported by GEOR MTM2005-02568 and Grupos UCM 910444.     

Groups,group actions and fields definable in first‐order topological structures

Given a group (G, ·), G?M^m, definable in a first‐order structure $\mathcal {M}=(M,\ldots )Given a group (G, ·), G?M^m, definable in a first‐order structure $\mathcal {M}=(M,\ldots )$ equipped with a dimension function and a topology satisfying certain natural conditions, we find a large open definable subset V?G and define a new topology τ on G with which (G, ·) becomes a topological group. Moreover, τ restricted to V coincides with the topology of V inherited from M^m. Likewise we topologize transitive group actions and fields definable in $\mathcal {M}$. These results require a series of preparatory facts concerning dimension functions, some of which might be of independent interest.     

The universal covering homomorphism in o‐minimal expansions of groups

Suppose G is a definably connected, definable group in an o‐minimal expansion of an ordered group. We show that the o‐minimal universal covering homomorphism : → G is a locally definable covering homomorphism and π₁(G) is isomorphic to the o‐minimal fundamental group π (G) of G defined using locally definable covering homomorphisms. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Superstable theories with few countable models

Summary We prove here: Theorem. LetT be a countable complete superstable non -stable theory with fewer than continuum many countable models. Then there is a definable groupG with locally modular regular generics, such thatG is not connected-by-finite and any type inG ^eq orthogonal to the generics has Morley rank. Corollary. LetT be a countable complete superstable theory in which no infinite group is definable. ThenT has either at most countably many, or exactly continuum many countable models, up to isomorphism.Supported by NSF grant DMS 90-06628     

Definable group extensions in semi‐bounded o‐minimal structures

In this note we show: Let R = 〈R, <, +, 0, …〉 be a semi‐bounded (respectively, linear) o‐minimal expansion of an ordered group, and G a group definable in R of linear dimension m ([2]). Then G is a definable extension of a bounded (respectively, definably compact) definable group B by 〈R^m, +〉 (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A note on stable sets,groups, and theories with NIP

Let M be an arbitrary structure. Then we say that an M ‐formula φ (x) defines a stable set in M if every formula φ (x) ∧ α (x, y) is stable. We prove: If G is an M ‐definable group and every definable stable subset of G has U ‐rank at most n (the same n for all sets), then G has a maximal connected stable normal subgroup H such that G /H is purely unstable. The assumptions hold for example if M is interpretable in an o‐minimal structure. More generally, an M ‐definable set X is weakly stable if the M ‐induced structure on X is stable. We observe that, by results of Shelah, every weakly stable set in theories with NIP is stable. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Permutation Groups in o-Minimal Structures

In this paper we develop a structure theory for transitive permutationgroups definable in o-minimal structures. We fix an o-minimalstructure M, a group G definable in M, and a set and a faithfultransitive action of G on definable in M, and talk of the permutationgroup (G, ). Often, we are concerned with definably primitivepermutation groups (G, ); this means that there is no propernon-trivial definable G-invariant equivalence relation on ,so definable primitivity is equivalent to a point stabiliserG being a maximal definable subgroup of G. Of course, sinceany group definable in an o-minimal structure has the descendingchain condition on definable subgroups [23] we expect many questionson definable transitive permutation groups to reduce to questionson definably primitive ones. Recall that a group G definable in an o-minimal structure issaid to be connected if there is no proper definable subgroupof finite index. In some places, if G is a group definable inM we must distinguish between definability in the full ambientstructure M and G-definability, which means definability inthe pure group G:= (G, .); for example, G is G-definably connectedmeans that G does not contain proper subgroups of finite indexwhich are definable in the group structure. By definable, wealways mean definability in M. In some situations, when thereis a field R definable in M, we say a set is R-semialgebraic,meaning that it is definable in (R, +, .). We call a permutationgroup (G, ) R-semialgebraic if G, and the action of G on canall be defined in the pure field structure of a real closedfield R. If R is clear from the context, we also just write‘semialgebraic’.     

On the definability of verbal subgroups

We show that if G is a group of finite Morley rank, then the verbal subgroup <w(G)> is of finite width, where w is a concise word. As a byproduct, we show that if G is any abelian-by-finite group, then G ⁿ =<x ⁿ (G)> is definable. Received: 15 March 1996 / Published online: 18 July 2001     

Linear Groups Definable in o-Minimal Structures

We study subgroups G of GL(n, R) definable in o-minimal expansions M = (R, +, · ,…) of a real closed field R. We prove several results such as: (a) G can be defined using just the field structure on R together with, if necessary, power functions, or an exponential function definable in M. (b) If G has no infinite, normal, definable abelian subgroup, then G is semialgebraic. We also characterize the definably simple groups definable in o-minimal structures as those groups elementarily equivalent to simple Lie groups, and we give a proof of the Kneser–Tits conjecture for real closed fields.     

Fields interpretable in rosy theories

We are working in a monster model ℭ of a rosy theory T. We prove the following theorems, generalizing the appropriate results from the finite Morley rank case and o-minimal structures. If R is a ⋁-definable integral domain of positive, finite U^t-rank, then its field of fractions is interpretable in ℭ. If A and M are infinite, definable, abelian groups such that A acts definably and faithfully on M as a group of automorphisms, M is A-minimal and U^t(M) is finite, then there is an infinite field interpretable in ℭ. If G is an infinite, solvable but non nilpotent-by-finite, definable group of finite U^t-rank and T has NIP, then there is an infinite field interpretable in 〈G, ·〉.     

Difference algebraic subgroups of commutative algebraic groups over finite fields

We study the question of which torsion subgroups of commutative algebraic groups over finite fields are contained in modular difference algebraic groups for some choice of a field automorphism. We show that if G is a simple commutative algebraic group over a finite field of characteristic p, ? is a prime different from p, and for some difference closed field (?, σ) the ?-primary torsion of G(?) is contained in a modular group definable in (?, σ), then it is contained in a group of the form {x∈G(?) :σ(x) =[a](x) } with a∈ℕ\p ^ℕ. We show that no such modular group can be found for many G of interest. In the cases that such equations may be found, we recover an effective version of a theorem of Boxall. Received: 28 May 1998 / Revised version: 20 December 1998     

<Emphasis Type="Italic">G</Emphasis>-compactness and groups

Lascar described E _KP as a composition of E _L and the topological closure of E _L (Casanovas et al. in J Math Log 1(2):305–319). We generalize this result to some other pairs of equivalence relations. Motivated by an attempt to construct a new example of a non-G-compact theory, we consider the following example. Assume G is a group definable in a structure M. We define a structure M′ consisting of M and X as two sorts, where X is an affine copy of G and in M′ we have the structure of M and the action of G on X. We prove that the Lascar group of M′ is a semi-direct product of the Lascar group of M and G/G _L . We discuss the relationship between G-compactness of M and M′. This example may yield new examples of non-G-compact theories. The first author is supported by the Polish Goverment grant N N201 384134. The second author is supported by the Polish Goverment grant N201 032 32/2231.     

Definability in the Substructure Ordering of Simple Graphs

For simple graphs, we investigate and seek to characterize the properties first-order definable by the induced subgraph relation. Let \({\mathcal{P}\mathcal{G}}\) denote the set of finite isomorphism types of simple graphs ordered by the induced subgraph relation. We prove this poset has only one non-identity automorphism co, and for each finite isomorphism type G, the set {G, G ^co } is definable. Furthermore, we show first-order definability in \({\mathcal{P}\mathcal{G}}\) captures, up to isomorphism, full second-order satisfiability among finite simple graphs. These results can be utilized to explore first-order definability in the closely associated lattice of universal classes. We show that for simple graphs, the lattice of universal classes has only one non-trivial automorphism, the set of finitely generated and finitely axiomatizable universal classes are separately definable, and each such universal subclass is definable up to the unique non-trivial automorphism.     

An $ \mathfrak{X} $-crown of a finite soluble group

Let G be a finite soluble group and F_\mathfrakX(G) {\Phi_\mathfrak{X}}(G) an intersection of all those maximal subgroups M of G for which G

Smooth roots of hyperbolic polynomials with definable coefficients

We prove that the roots of a definable C ^∞ curve of monic hyperbolic polynomials admit a definable C ^∞ parameterization, where ‘definable’ refers to any fixed o-minimal structure on (ℝ,+, ·). Moreover, we provide sufficient conditions, in terms of the differentiability of the coefficients and the order of contact of the roots, for the existence of C ^p (for p ∈ ℕ) arrangements of the roots in both the definable and the non-definable case. These conditions are sharp in the definable and, under an additional assumption, also in the non-definable case. In particular, we obtain a simple proof of Bronshtein’s theorem in the definable setting. We prove that the roots of definable C ^∞ curves of complex polynomials can be desingularized by means of local power substitutions t ↦ ±t ^N . For a definable continuous curve of complex polynomials we show that any continuous choice of roots is actually locally absolutely continuous.     

On the Boolean algebras of definable sets in weakly o‐minimal theories

We consider the sets definable in the countable models of a weakly o‐minimal theory T of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic (hence T is p‐ω‐categorical), in other words when each of these definable sets admits, if infinite, an infinite coinfinite definable subset. We show that this is true if and only if T has no infinite definable discrete (convex) subset. We examine the same problem among arbitrary theories of mere linear orders. Finally we prove that, within expansions of Boolean lattices, every weakly o‐minimal theory is p‐ω‐categorical. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)