Stable theory

In the mathematical field of 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.

For differential equations, see Stability theory.

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, as mentioned, e.g., in (Grossberg, Iovino & Lessmann 2002, p. 542).

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 set 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 for any infinite cardinal κ.
  • 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 total orders without endpoints. More generally, the theory of every infinite total order is unstable.
  • 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)n∈N, 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. The ω-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:

See also

References
  • J.T. Baldwin, "Fundamentals of stability theory", Springer (1988)
  • Baldwin, J. T. (2001) [1994], "Stability theory (in logic)", Encyclopedia of Mathematics, EMS Press
  • Buechler, Steven (1996), Essential stability theory, Perspectives in Mathematical Logic, Berlin: Springer-Verlag, pp. xiv+355, doi:10.1007/978-3-642-80177-8, ISBN 978-3-540-61011-3, MR 1416106
  • Rami Grossberg, José Iovino, Olivier Lessmann, "A primer of simple theories", Arch. Math. Logic 41, 541–580 (2002) doi:10.1007/s001530100126
  • Hodges, Wilfrid (1993), Model theory, Cambridge University Press, ISBN 978-0-521-30442-9
  • D. Lascar, "Stability in model theory", Wiley (1987)
  • Marker, David (2002), Model Theory: An Introduction, Graduate Texts in Mathematics, Berlin, New York: Springer-Verlag, ISBN 978-0-387-98760-6
  • Morley, Michael (1965), "Categoricity in Power", Transactions of the American Mathematical Society, 114 (2): 514–538, doi:10.2307/1994188, JSTOR 1994188
  • T. G. Mustafin, Stable Theories [in Russian], Karaganda (1981).
  • Mustafin, T. G. (1980), "Rank functions in stable theories", Siberian Mathematical Journal, 21 (6): 815–824, doi:10.1007/BF00968468, S2CID 120691664
  • Mustafin, T. G. (1985), "Classification of superstable theories by rank functions", Algebra and Logic, 24 (1): 27–40, doi:10.1007/BF01978704, S2CID 123218263
  • Mustafin, T. G. (1990), "New concepts of stability for theories", Proc. Soviet–French Coll. Model Theory, Karaganda: 112–125
  • Palyutin, E.A.; Taitslin, M.A. (2001) [1994], "Stable and unstable theories", Encyclopedia of Mathematics, EMS Press
  • Anand Pillay, "An introduction to stability theory", Clarendon Press (1983)
  • Poizat, Bruno (2001), Stable groups, Mathematical Surveys and Monographs, 87, Providence, RI: American Mathematical Society, pp. xiv+129, doi:10.1090/surv/087, ISBN 978-0-8218-2685-0, MR 1827833 (Translated from the 1987 French original.)
  • Scanlon, Thomas (2002), "Review of "Stable groups"", Bull. Amer. Math. Soc., 39 (4): 573–579, doi:10.1090/S0273-0979-02-00953-9
  • Sela, Zlil (2006). "Diophantine Geometry over Groups VIII: Stability". arXiv:math/0609096.
  • Shelah, Saharon (1969), "Stable theories", Israel J. Math., 7 (3): 187–202, doi:10.1007/BF02787611, MR 0253889, S2CID 189780839
  • Shelah, Saharon (1990) [1978], Classification theory and the number of nonisomorphic models, Studies in Logic and the Foundations of Mathematics (2nd ed.), Elsevier, ISBN 978-0-444-70260-9
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.