# Stable theory

Stable theory

In model theory, a complete theory is called stable if it does not have too many types. One goal of classification theory is to divide all complete theories into those whose models can be classified and those whose models are too complicated to classify, and to classify all models in the cases where this can be done. Roughly speaking, if a theory is not stable then its models are too complicated and numerous to classify, while if a theory is stable there might be some hope of classifying its models, especially if the theory is superstable or totally transcendental.

Stability theory was started by Morley (1965), who introduced several of the fundamental concepts, such as totally transcendental theories and the Morley rank. Stable and superstable theories were first introduced by Shelah (1969), who is responsible for much of the development of stability theory. The definitive reference for stability theory is (Shelah 1990), though it is notoriously hard even for experts to read.

## Definitions

T will be a complete theory in some language.

• T is called κ-stable (for an infinite cardinal κ) if for every set A of cardinality κ the number of complete types over A has cardinality κ.
• ω-stable is an alternative name for ℵ0-stable.
• T is called stable if it is κ-stable for some infinite cardinal κ
• T is called unstable if it is not stable.
• T is called superstable if it is κ-stable for all sufficiently large cardinals κ.
• Totally transcendental theories are those such that every formula has Morley rank less than ∞.

As usual, a model of some language is said to have one of these properties if the complete theory of the model has that property.

An incomplete theory is defined to have one of these properties if every completion, or equivalently every model, has this property.

## Unstable theories

Roughly speaking, a theory is unstable if one can use it to encode the ordered set of natural numbers. More precisely, if there is a model M and a formula Φ(X,Y) in 2n variables X=x1,...,xn and Y=y1,...,yn defining a relation on Mn with an infinite totally ordered subset then the theory is unstable. (Any infinite totally ordered set has a subset isomorphic to either the positive or negative integers under the usual order, so one can assume the totally ordered subset is ordered like the positive integers.) The totally ordered subset need not be definable in the theory.

The number of models of an unstable theory T of any uncountable cardinality κ≥|T| is the maximum possible number 2κ.

Examples:

• Most sufficiently complicated theories, such as set theories and Peano arithmetic, are unstable.
• The theory of the rational numbers, considered as an ordered set, is unstable. Its theory is the theory of dense linear orders without endpoints.
• The theory of addition of the natural numbers is unstable.
• Any infinite Boolean algebra is unstable.
• Any monoid with cancellation that is not a group is unstable, because if a is an element that is not a unit then the powers of a form an infinite totally ordered set under the relation of divisibility. For a similar reason any integral domain that is not a field is unstable.
• There are many unstable nilpotent groups. One example is the infinite dimensional Heisenberg group over the integers: this is generated by elements xi, yi, z for all natural numbers i, with the relations that any of these two generators commute except that xi and yi have commutator z for any i. If ai is the element x0x1...xi−1yi then ai and aj have commutator z exactly when i<j, so they form an infinite total order under a definable relation, so the group is unstable.
• Real closed fields are unstable, as they are infinite and have a definable total order.

## Stable theories

T is called stable if it is κ-stable for some cardinal κ. Examples:

• The theory of any module over a ring is stable.
• The theory of a countable number of equivalence relations En for n a natural number such that each equivalence relation has an infinite number of equivalence classes and each equivalence class of En is the union of an infinite number of different classes of En+1 is stable but not superstable.
• Sela (2006) showed that free groups, and more generally torsion free hyperbolic groups, are stable. Free groups on more than one generator are not superstable.
• A differentially closed field is stable. If it has non-zero characteristic it is not superstable, and if it has zero characteristic it is totally transcendental.

## Superstable theories

T is called superstable if it is stable for all sufficiently large cardinals, so all superstable theories are stable. For countable T superstability is equivalent to stability for all κ≥2ω. The following conditions on a theory T are equivalent:

• T is superstable.
• All types of T are ranked by at least one notion of rank.
• T is κ-stable for all sufficiently large cardinals κ
• T is κ-stable for all cardinals κ that are at least 2|T|.

If a theory is superstable but not totally transcendental it is called strictly superstable.

The number of countable models of a countable superstable theory must be 1, ℵ0, ℵ1, or 2ω. If the number of models is 1 the theory is totally transcendental. There are examples with 1, ℵ0 or 2ω models, and it is not known if there are examples with ℵ1 models if the continuum hypothesis does not hold. If a theory T is not superstable then the number of models of cardinality κ>|T| is 2κ.

Examples:

• The additive group of integers is superstable, but not totally transcendental. It has 2ω countable models.
• The theory with a countable number of unary relations Pi with model the positive integers where Pi(n) is interpreted as saying n is divisible by the nth prime is superstable but not totally transcendental.
• An abelian group A is superstable if and only if there are only finitely many pairs (p,n) with p prime, n a natural number, with pnA/pn+1A infinite.

## Totally transcendental theories and ω-stable

• Totally transcendental theories are those such that every formula has Morley rank less than ∞. Totally transcendental theories are stable in λ whenever λ≥|T|, so they are always superstable. ω-stable is an alternative name for ℵ0-stable. ω-stable theories in a countable language are κ-stable for all infinite cardinals κ. If |T| is countable then T is totally transcendental if and only if it is ω-stable. More generally, T is totally transcendental if and only if every restriction of T to a countable language is ω-stable.

Examples:

• Any ω-stable theory is totally transcendental.
• Any finite model is totally transcendental.
• An infinite field is totally transcendental if and only if it is algebraically closed. (Macintyre's theorem.)
• A differentially closed field in characteristic 0 is totally transcendental.
• Any theory with a countable language that is categorical for some uncountable cardinal is totally transcendental.
• An abelian group is totally transcendental if and only if it is the direct sum of a divisible group and a group of bounded exponent.
• Any linear algebraic group over an algebraically closed field is totally transcendental.
• Any group of finite Morley rank is totally transcendental.

## References

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Stable (disambiguation) — Stable may refer to: *stable, a building in which livestock, usually horses, are kept. ** Stable, in professional wrestling, a group of wrestlers within a promotion who have a common element *the attribute of stability ** Chemically stable **… …   Wikipedia

• Stable group — For stable groups in homotopy theory see stable homotopy group or direct limit of groups. In model theory, a stable group is a group that is stable in the sense of stability theory. An important class of examples is provided by groups of finite… …   Wikipedia

• Stable homotopy theory — In mathematics, stable homotopy theory is that part of homotopy theory (and thus algebraic topology) concerned with all structure and phenomena that remain after sufficiently many applications of the suspension functor. A founding result was the… …   Wikipedia

• Stable model semantics — The concept of a stable model, or answer set, is used to define a declarative semantics for logic programs with negation as failure. This is one of several standard approaches to the meaning of negation in logic programming, along with program… …   Wikipedia

• Stable isotope — Graph of isotopes/nuclides by type of decay. Orange and blue nuclides are unstable, with the black squares between these regions representing stable nuclides. The unbroken line passing below many of the nuclides represents the theoretical… …   Wikipedia

• Stable polynomial — A polynomial is said to be stable if either: * all its roots lie in the open left half plane, or * all its roots lie in the open unit disk.The first condition defines Hurwitz (or continuous time) stability and the second one Schur (or discrete… …   Wikipedia

• Stable normal bundle — In surgery theory, a branch of mathematics, the stable normal bundle of a differentiable manifold is an invariant which encodes the stable normal (dually, tangential) data. It is also called the Spivak normal bundle, after Michael Spivak… …   Wikipedia

• Stable vector bundle — In mathematics, a stable vector bundle is a vector bundle that is stable in the sense of geometric invariant theory. They were defined by harvtxt|Mumford|1963table vector bundles over curvesA bundle W over an algebraic curve (or over a Riemann… …   Wikipedia

• Stable manifold theorem — In mathematics, especially in the study of dynamical systems and differential equations, the stable manifold theorem is an important result about the structure of the set of orbits approaching a given hyperbolic fixed point. Stable manifold… …   Wikipedia

• Stable map — In mathematics, specifically in symplectic topology and algebraic geometry, one can construct the moduli space of stable maps, satisfying specified conditions, from Riemann surfaces into a given symplectic manifold. This moduli space is the… …   Wikipedia