We define an $\mathfrak{R}$-group to be a stable group with the property that a generic element can only be algebraic over a generic. We then derive some corollaries for $\mathfrak{R}$-groups and fields, and prove a decomposition theorem and a field theorem. As a nonsuperstable example, we prove that small stable groups are $\mathfrak{R}$-groups.

We prove that every ω-categorical, generically stable group is nilpotent-by-finite and that every ω-categorical, generically stable ring is nilpotent-by-finite.

AssumeGis a group definable in a modelMof a stable theoryT. We prove that the semigroupSG(M) of completeG-types overMis an inverse limit of some semigroups type-definable inMeq. We prove that the maximal subgroups ofSG(M) are inverse limits of some definable quotients of subgroups ofG. We consider the powers of types in the semigroupSG(M) and prove that in a way every type inSG(M) is profinitely many steps away from a type in a subgroup ofSG(M).

In a recent communication an uncountably categorical group has been constructed that has a non-locally-modular geometry and does not allow the interpretation of a field. We consider a system Δ of elementary axioms fulfilled by some special subgroups of the above group. We show that Δ is complete and stable, but not superstable. It is not even a R-group in the sense discussed by Wagner.

We define the notion of generic for an arbitrary subgroup H of a stable group, and show that H has a definable hull with the same generic properties. We then apply this to the theory of stable fields.

We prove that each ω-categorical, generically stable group is solvable-by-finite.

In this note we study some local properties ofω-stable groups of finite Morley rank.

We define a generalized version of CM-triviality, and show that in the presence of enough regular types, or solubility, a stable CM-trivial group is nilpotent-by-finite. A torsion-free small CM-trivial stable group is abelian and connected. The first result makes use of a generalized version of the analysis of bad groups.

We develop several aspects of local and global stability in continuous first order logic. In particular, we study type-definable groups and genericity.

In this paper, we shall survey results about the group-theoretic properties of stable groups. These can be classified into three main categories, according to the strength of the assumptions needed: chain conditions, generic types, and some form of rank. Each category has its typical application: Chain conditions often allow us to deduce global properties from local ones, generic properties are used to get definable groups from undefinable ones, and rank is necessary to interpret fields in certain group (...) actions. While originally the main input came from algebraic group theory, founded on the similarities between rank and dimension, increasingly methods borrowed from finite group theory have come to play a rôle, emphasizing the study of characteristic subgroups and characteristic families of subgroups. (shrink)

The aim of this paper is to describe an analogue of the theory of nontrivial torsion-free divisible abelian groups for metabelian groups. We obtain illustrations for “old-fashioned” model theoretic algebra and “new” examples in the theory of stable groups. We begin this paper with general considerations about model theory. In the second section we present our results and we give the structure of the rest of the paper. Most parts of this paper use only basic concepts (...) from model theory and group theory. However, in Section 5, we need some somewhat elaborate notions from stability theory. One can find the beginnings of this theory in [14], and we refer the reader to [16] or [21] for stability theory and to [22] for stable groups.§1. Some model theoretic considerations. Denote by the theory of torsion-free abelian groups in the language of groups ℒgp. A finitely generated group G satisfies iff G is isomorphic to a finite direct power of ℤ. It follows that axiomatizes the universal theory of free abelian groups and that the theory of nontrivial torsion-free abelian groups is complete for the universal sentences. Denote by the theory of nontrivial divisible torsion-free abelian groups. (shrink)

We generalise various properties of quasiendomorphisms from groups with regular generic to small abelian groups. In particular, for a small abelian group such that no infinite definable quotient is connected-by-finite, the ring of quasi-endomorphisms is locally finite. Under some additional assumptions, it decomposes modulo some nil ideal into a sum of finitely many matrix rings.

The following theorems are proved about the Frattini-free componentG Φ of a soluble stable ℜ-group: a) If it has a normal subgroupN with nilpotent quotientG Φ/N, then there is a nilpotent subgroupH ofG Φ withG Φ=NH. b) It has Carter subgroups; if the group is small, they are all conjugate. c) Nilpotency modulo a suitable Frattini-subgroup (to be defined) implies nilpotency. The last result makes use of a new structure theorem for the centre of the derivative of the Frattini-free (...) component of a centreless soluble ℜ-group. (shrink)

We show that a stable groupG satisfying certain commutator conditions is nilpotent. Furthermore, a soluble stable group with generically splitting automorphism of prime order is nilpotent-by-finite. In particular, a soluble stable group with a generic element of prime order is nilpotent-by-finite.

We develop a Sylow theory for stable groups satisfying certain additional conditions (2-finiteness, solvability or smallness) and show that their maximal p-subgroups are locally finite and conjugate. Furthermore, we generalize a theorem of Baer-Suzuki on subgroups generated by a conjugacy class of p-elements.

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.

Multimodal neuroimaging provides a rich source of data for identifying brain regions associated with disease progression and aging. However, present studies still typically analyze modalities separately or aggregate voxel-wise measurements and analyses to the structural level, thus reducing statistical power. As a central example, previous works have used two quantitative MRI parameters—R2* and quantitative susceptibility —to study changes in iron associated with aging in healthy and multiple sclerosis subjects, but failed to simultaneously account for both. In this article, we propose (...) a unified framework that combines information from multiple imaging modalities and regularizes estimates for increased interpretability, generalizability, and stability. Our work focuses on joint region detection problems where overlap between effect supports across modalities is encouraged but not strictly enforced. To achieve this, we combine L1, total variation, and L2 group lasso penalties. While the TV penalty encourages geometric regularization by controlling estimate variability and support boundary geometry, the group lasso penalty accounts for similarities in the support between imaging modalities. We address the computational difficulty in this regularization scheme with an alternating direction method of multipliers optimizer. In a neuroimaging application, we compare our method against independent sparse and joint sparse models using a dataset of R2* and QS maps derived from MRI scans of 113 healthy controls: our method produces clinically-interpretable regions where specific iron changes are associated with healthy aging. Together with results across multiple simulation studies, we conclude that our approach identifies regions that are more strongly associated with the variable of interest, more accurate, and more stable with respect to training data variability. This work makes progress toward a stable and interpretable multimodal imaging analysis framework for studying disease-related changes in brain structure and can be extended for classification and disease prediction tasks. (shrink)

We show that an infinite field is interpretable in a stable torsion-free nilpotent groupG of classk, k>1. Furthermore we prove thatG/Z k-1 (G) must be divisible. By generalising methods of Belegradek we classify some stable torsion-free nilpotent groups modulo isomorphism and elementary equivalence.

We prove (Proposition 2.1) that if $\mu$ is a generically stable measure in an NIP (no independence property) theory, and $\mu(\phi(x,b))=0$ for all $b$ , then for some $n$ , $\mu^{(n)}(\exists y(\phi(x_{1},y)\wedge \cdots \wedge\phi(x_{n},y)))=0$ . As a consequence we show (Proposition 3.2) that if $G$ is a definable group with fsg (finitely satisfiable generics) in an NIP theory, and $X$ is a definable subset of $G$ , then $X$ is generic if and only if every translate of $X$ does (...) not fork over $\emptyset$ , precisely as in stable groups, answering positively an earlier problem posed by the first two authors. (shrink)

We generalize tools and results from first order stable theories to groups inside a simple stable strongly homogeneous model.

We study groups definable in tame expansions of ω-stable theories. Assuming several tameness conditions, we obtain structural theorems for groups definable and interpretable in these expansions. As our main example, by characterizing independence in the pair, where K is an algebraically closed field and G is a multiplicative subgroup of K× with the Mann property, we show that the pair satisfies the assumptions. In particular, this provides a characterization of definable and interpretable groups in in terms (...) of algebraic groups in K and interpretable groups in G. Furthermore, we compute the Morley rank and the U-rank in and both ranks agree. (shrink)

We prove that in a continuous ℵ₀-stable theory every type-definable group is definable. The two main ingredients in the proof are: 1. Results concerning Morley ranks (i.e., Cantor-Bendixson ranks) from [Ben08], allowing us to prove the theorem in case the metric is invariant under the group action; and 2. Results concerning the existence of translation-invariant definable metrics on type-definable groups and the extension of partial definable metrics to total ones.

We prove that in a nilpotent-by-finite stable group an equation that holds generically holds everywhere. Combining this result with results of Wagner and Bryant, we conclude that a soluble-by-finite stable group of generic exponent n has exponent n.

If G is an omega-stable group with a normal definable subgroup H, then the Sylow-2-subgroups of G/H are the images of the Sylow-2-subgroups of G. /// Sei G eine omega-stabile Gruppe und H ein definierbarer Normalteiler von G. Dann sind die Sylow-2-Untergruppen von G/H Bilder der Sylow-2-Untergruppen von G.

If * is a binary partial function which happens to be a group law on some infinite subset of some model of a stable theory, then this subset can be embedded into a definable group such that * becomes the group operation.

Let M be an arbitrary structure. Then we say that an M -formula φ defines a stable set inM if every formula φ ∧ α is stable. We prove: If G is an M -definable group and every definable stable subset of G has U -rank at most n , 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. (shrink)

We solve two problems from a work of Haskel and Pillay concerning maximal stable quotients of groups ∧-definable in NIP theories. The first result says that if G is a ∧-definable group in a distal theory, then Gst=G00 (where Gst is the smallest ∧-definable subgroup with G∕Gst stable, and G00 is the smallest ∧-definable subgroup of bounded index). In order to get it, we prove that distality is preserved under passing from T to the hyperimaginary expansion Theq. (...) The second result is an example of a group G definable in a nondistal NIP theory for which G=G00, but Gst is not an intersection of definable groups. Our example is a saturated extension of (R,+,[0,1]). Moreover, we make some observations on the question whether there is such an example which is a group of finite exponent. We also take the opportunity and give several characterizations of stability of hyperdefinable sets involving continuous logic. (shrink)

Assume that G is a definable group in a stable structure M. Newelski showed that the semigroup SG of complete types concentrated on G is an inverse limit of the ∞-definable semigroups SG,Δ. He also showed that it is strongly π-regular: for every p∈SG,Δ, there exists n∈N such that pn is in a subgroup of SG,Δ. We show that SG,Δ is in fact an intersection of definable semigroups, so SG is an inverse limit of definable semigroups, and that the (...) latter property is enjoyed by all ∞-definable semigroups in stable structures. (shrink)

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.

Hrushovski originated the study of “flat” stable structures in constructing a new strongly minimal set and a stable 0-categorical pseudoplane. We exhibit a set of axioms which for collections of finite structure with dimension function δ give rise to stable generic models. In addition to the Hrushovski examples, this formalization includes Baldwin's almost strongly minimal non-Desarguesian projective plane and several others. We develop the new case where finite sets may have infinite closures with respect to the dimension (...) function δ. In particular, the generic structure need not be ω-saturated and so the argument for stability is significantly more complicated. We further show that these structures are “flat” and do not interpret a group. (shrink)

If all differences in behavior are explainable in terms of universal values pursued under variable constraints, then much ethical theorizing is pointless. A strong presumption in favor of universal values can be established by showing that differences in behavior that were previously thought to be explainable only in terms of differences in values, can in fact be explained in terms of differences in constraints. Eleven such cases are briefly discussed, including cases of differences among racial, religious and other groups (...) in crime, culinary practices and the acceptance of innovation. (shrink)

A first-order structure $\mathfrak {A}$ is called monadically stable iff every expansion of $\mathfrak {A}$ by unary predicates is stable. In this paper we give a classification of the class $\mathcal {M}$ of $\omega $ -categorical monadically stable structure in terms of their automorphism groups. We prove in turn that $\mathcal {M}$ is the smallest class of structures which contains the one-element pure set, is closed under isomorphisms, and is closed under taking finite disjoint unions, infinite (...) copies, and finite index first-order reducts. Using our classification we show that every structure in $\mathcal {M}$ is first-order interdefinable with a finitely bounded homogeneous structure. We also prove that every structure in $\mathcal {M}$ has finitely many reducts up to interdefinability, thereby confirming Thomas’ conjecture for the class $\mathcal {M}$. (shrink)

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.

: Models that fail to satisfy the Markov condition are unstable in the sense that changes in state variable values may cause changes in the values of background variables, and these changes in background lead to predictive error. This sort of error arises exactly from the failure of non-Markovian models to track the set of causal relations upon which the values of response variables depend. The result has implications for discussions of the level of selection: under certain plausible conditions the (...) models of selection presented in such debates will not satisfy the Markov condition when fit to data from real populations. Since this is true both for group and individual level models, models of neither sort correctly represent the causal structure generating, nor correctly explain, the phenomena of interest. (shrink)

For a NIP theory T, a sufficiently saturated model ${\mathfrak C}$ of T, and an invariant (over some small subset of ${\mathfrak C}$ ) global type p, we prove that there exists a finest relatively type-definable over a small set of parameters from ${\mathfrak C}$ equivalence relation on the set of realizations of p which has stable quotient. This is a counterpart for equivalence relations of the main result of [2] on the existence of maximal stable quotients of (...) type-definable groups in NIP theories. Our proof adapts the ideas of the proof of this result, working with relatively type-definable subsets of the group of automorphisms of the monster model as defined in [3]. (shrink)