Simple groups and the number of countable models

Let T be a complete, superstable theory with fewer than ${2^{\aleph_{0}}}$ countable models. Assuming that generic types of infinite, simple groups definable in T ^eq are sufficiently non-isolated we prove that ω ^ω is the strict upper bound for the Lascar rank of T.     

M-gap conjecture and m-normal theories

We find a small weakly minimal theory with an isolated weakly minimal type ofM-rank ∞ and an isolated weakly minimal type of arbitrarily large finiteM-rank. These examples lead to the notion of an m-normal theory. We prove theM-gap conjecture for m-normalT. In superstable theories with few countable models we characterize traces of complete types as traces of some formulas. We prove that a 1-based theory with few countable models is m-normal. We investigate generic subgroups of small superstable groups. We compare the notions of independence induced by measure (μ-independence) and category (m-independence). Research supported by KBN grant 2 P03A 006 09.     

Les beaux automorphismes

Assume that the class of partial automorphisms of the monster model of a complete theory has the amalgamation property. The beautiful automorphisms are the automorphisms of models ofT which: 1. are strong, i.e. leave the algebraic closure (inT ^eq) of the empty set pointwise fixed, 2. are obtained by the Fraïsse construction using the amalgamation property that we have just mentioned. We show that all the beautiful automorphisms have the same theory (in the language ofT plus one unary function symbol for the automorphism), and we study this theory. In particular, we examine the question of the saturation of the beautiful automorphisms. We also prove that in some cases (in particular if the theory is -stable andG-trivial), almost all (in the sense of Baire categoricity) automorphisms of the saturated countable model are beautiful and conjugate.     

Theories of linear order

LetT be a complete theory of linear order; the language ofT may contain a finite or a countable set of unary predicates. We prove the following results. (i) The number of nonisomorphic countable models ofT is either finite or 2^ω. (ii) If the language ofT is finite then the number of nonisomorphic countable models ofT is either 1 or 2^ω. (iii) IfS ₁(T) is countable then so isS _n(T) for everyn. (iv) In caseS ₁(T) is countable we find a relation between the Cantor Bendixon rank ofS ₁(T) and the Cantor Bendixon rank ofS _n(T). (v) We define a class of modelsL, and show thatS ₁(T) is finite iff the models ofT belong toL. We conclude that ifS ₁(T) is finite thenT is finitely axiomatizable. (vi) We prove some theorems concerning the existence and the structure of saturated models. Most of the results in this paper appeared in the author’s Master of Science thesis which was prepared at the Hebrew University under the supervision of Professor H. Gaifman.     

Bounded orbits and measures on a group

We consider a definable group G acting on the space of complete types over G, in a monster model of a theory T. We discuss the notion of a bounded orbit of this action. We prove that some boundedness assumptions imply definable amenability of G.     

Ranks and definability in superstable theories

We study the notion of definable type, and use it to define theproduct of types and theheir of a type. Then, in the case of stable and superstable theories, we make a general study of the notion of rank. Finally, we use these techniques to give a new proof of a theorem of Lachlan on the number of isomorphism types of countable models of a superstable theory.     

Number of open sets for a topology with a countable basis

LetT be the family of open subsets of a topological space (not necessarily Hausdorff or evenT ₀). We prove that ifT has a countable base and is not countable, thenT has cardinality at least continuum. Partially supported by the Basic Research Fund, Israeli Academy of Sciences. Publication no. 454 done 6,8/1991. Partially sponsored by the Edmund Landau Center for research in Mathematical Analysis, supported by the Minerva Foundation (Germany).     

Topological dynamics and the complexity of strong types

We develop topological dynamics for the group of automorphisms of a monster model of any given theory. In particular, we find strong relationships between objects from topological dynamics (such as the generalized Bohr compactification introduced by Glasner) and various Galois groups of the theory in question, obtaining essentially new information about them, e.g., we present the closure of the identity in the Lascar Galois group of the theory as the quotient of a compact, Hausdorff group by a dense subgroup.We apply this to describe the complexity of bounded, invariant equivalence relations, obtaining comprehensive results, subsuming and extending the existing results and answering some open questions from earlier papers. We show that, in a countable theory, any such relation restricted to the set of realizations of a complete type over Ø is type-definable if and only if it is smooth. Then we show a counterpart of this result for theories in an arbitrary (not necessarily countable) language, obtaining also new information involving relative definability of the relation in question. As a final conclusion we get the following trichotomy. Let \(\mathfrak{C}\) be a monster model of a countable theory, p ∈ S(Ø), and E be a bounded, (invariant) Borel (or, more generally, analytic) equivalence relation on p(\(\mathfrak{C}\)). Then, exactly one of the following holds: (1) E is relatively definable (on p(\(\mathfrak{C}\))), smooth, and has finitely many classes, (2) E is not relatively definable, but it is type-definable, smooth, and has 2^?0 classes, (3) E is not type definable and not smooth, and has 2^?0 classes. All the results which we obtain for bounded, invariant equivalence relations carry over to the case of bounded index, invariant subgroups of definable groups.     

Complete lattices of subgroups in compact groups

Summary LetG be a compact group and a sublattice of the lattice of all closed subgroups ofG. In Proposition 1 it is shown that is a complete lattice if it is a closed subset of the spaceG ^c of all closed non empty subsets ofG. In general the converse of this fact is not true (Example 3), but the following result can be obtained (Theorem 5): If is complete and if each element of is normalized by the connected component of the identity ofG, then is a closed, totally disconnected subset ofG ^c. We mention the following corollary: IfG is totally disconnected or abelian, then is complete if and only if it is a closed subset ofG ^c.While writing this paper the author was a fellow of the National Research Council (A 7171).     

<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.     

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)     

A proof of vaught’s conjecture forω-stable theories

In this paper it is proved that ifT is a countable completeω-stable theory in ordinary logic, thenT has either continuum many, or at most countably many, non-isomorphic countable models. Dedicated to the memory of Abraham Robinson on the tenth anniversary of his death The author thanks the United States-Israel Binational Science Foundation for supporting his research. Supported by the Natural Sciences and Engineering Research Council of Canada, and FCAC Quebec.     

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’.     

Irreducible representations of Lie algebras of reductive groups and the Kac-Weisfeiler conjecture

Letg be the Lie algebra of a connected reductive groupG over an algebraically closed field of characteristicp>0. Suppose thatG ⁽¹⁾ is simply connected andp is good for the root system ofG. Ifp=2, suppose in addition thatg admits a nondegenerateG-invariant trace form. LetV be an irreducible and faithfulg-module withp-character g ^*. It is proved in the paper that dimV is divisible byp ^1/2dim() where () stands for the orbit of under the coadjoint action ofG.Oblatum 14-III-1994 & 17-XI-1994     

Uniformities,hyperspaces, and normality

LetX be a completely regular space and 2 ^X the hyperspace ofX. It is shown that the uniform topologies on 2 ^X arising from Nachbin uniformity onX, which is the weak uniformity generated byC(X, ), and from Tukey—Shirota uniformity onX, generated by all countable open normal coverings ofX, agree. They, both, coincide with a Vietoris-type topology on 2 ^X , the countable locally finite topology, iffX is normal.     

Models of set theory with definable ordinals

A DO model (here also referred to a Paris model) is a model of set theory all of whose ordinals are first order definable in . Jeffrey Paris (1973) initiated the study of DO models and showed that (1) every consistent extension T of ZF has a DO model, and (2) for complete extensions T, T has a unique DO model up to isomorphism iff T proves V=OD. Here we provide a comprehensive treatment of Paris models. Our results include the following:1. If T is a consistent completion of ZF+VOD, then T has continuum-many countable nonisomorphic Paris models.2. Every countable model of ZFC has a Paris generic extension.3. If there is an uncountable well-founded model of ZFC, then for every infinite cardinal there is a Paris model of ZF of cardinality which has a nontrivial automorphism.4. For a model ZF, is a prime model is a Paris model and satisfies AC is a minimal model. Moreover, Neither implication reverses assuming Con(ZF).Mathematics Subject Classification (2000): 03C62, 03C50, Secondary 03H99     

The projection theorem for spectral sets

LetG be a locally compact group with polynomial growth and symmetricL ¹-algebra andN a closed normal subgroup ofG. LetF be a closedG-invariant subset of Prim_* L ¹(N) andE={ker; with |N(k(F))=0}. We prove thatE is a spectral subset of Prim_* L ¹(G) ifF is spectral. Moreover we give the following application to the ideal theory ofL ¹(G). Suppose that, in addition,N is CCR andG/N is compact. Then all primary ideals inL ¹(G) are maximal, provided allG-orbits in Prim_* L ¹(N) are spectral.Dedicated to Professor Elmar Thoma on the occasion of his 60th birthday     

Sets associated with the farthest point problem

LetS be a convex compact set in a normed linear spaceX. For each cardinal numbern, defineS _n = {x X:x has exactlyn farthest points inS} andT _n = _kn S _k. It is shown that ifX =E thenT ₃ is countable andT ₂ is contractible to a point. Properties of associated level curves are given.     

Building ofGL(m, D) and centralizers

LetG=GL(m, D) whereD is a central division algebra over a commutative nonarchimedean local fieldF. LetE/F be a field extension contained inM(m, D). We denote byI (resp.I _E) the nonextended affine building ofG (resp. of the centralizer ofE ^x inG). In this paper we prove that there exists a uniqueG _E-equivariant affine mapj _EI_EI. It is injective and its image coincides with the set ofE ^x-fixed points inI. Moreover, we prove thatj _E is compatible with the Moy-Prasad filtrations.This author's contribution was written while he was a post-doctoral student at King's College London and supported by an european TMR grant