|
|
| Line 1: |
Line 1: |
| {{about|saturated models in model theory|saturated models in statistics|structural equation modeling}}
| | These folks call me Gabrielle. Vermont needs always been my does not place and I will have everything that I would like here. As a complete girl what I simply like is going in the market to karaoke but I haven't made a dime as well as. I am the cashier and I'm preparing pretty good financially. See what's new on my new website here: http://prometeu.net<br><br>Check out my web site ... [http://prometeu.net clash of clans cheat engine] |
| {{No footnotes|date=January 2010}}
| |
| | |
| In [[mathematical logic]], and particularly in its subfield [[model theory]], a '''saturated model''' ''M'' is one which realizes as many [[type (model theory)|complete type]]s as may be "reasonably expected" given its size. For example, an ultrapower model of the [[hyperreals]] is <math>\aleph_1</math>-saturated, meaning that every descending nested sequence of [[internal set]]s has a nonempty intersection, see Goldblatt (1998).
| |
| | |
| ==Definition==
| |
| Let κ be a [[finite set|finite]] or [[Infinity|infinite]] [[cardinal number]] and ''M'' a model in some [[first-order language]]. Then ''M'' is called '''κ-saturated''' if for all subsets ''A'' ⊆ ''M'' of [[cardinality]] less than κ, ''M'' realizes all [[Type (model theory)|complete types]] over ''A''. The model ''M'' is called '''saturated''' if it is |''M''|-saturated where |''M''| denotes the cardinality of ''M''. That is, it realizes all complete types over sets of parameters of size less than |''M''|. According to some authors, a model ''M'' is called '''countably saturated''' if it is [[aleph-1 | <math>\aleph_1</math>]]-saturated; that is, it realizes all complete types over countable sets of parameters. According to others, it is countably saturated if it is <math>\aleph_0</math>-saturated; i.e. realizes all complete types over finite parameter sets.
| |
| | |
| ==Motivation==
| |
| {{Technical|section|date=January 2010}}
| |
| The seemingly more intuitive notion – that all complete types of the language are realized – turns out to be too weak (and is, appropriately, named '''weak saturation''', which is the same as 1-saturation). The difference lies in the fact that many structures contain elements which are not definable (for example, any [[transcendental number|transcendental]] element of '''R''' is, by definition of the word, not definable in the field language). However, they still form a part of the structure, so we need types to describe relationships with them. Thus we allow sets of parameters from the structure in our definition of types. This argument allows us to discuss specific features of the model which we may otherwise miss – for example, a ''specific'' increasing sequence ''c<sub>n</sub>'' having a bound can be expressed as realizing the type {{nowrap|{''x'' > ''c<sub>n</sub>'' : ''n'' ∈ ω},}} which uses countably many parameters. If the sequence is not definable, this fact about the structure cannot be described using the base language, so a weakly saturated structure may not bound the sequence, while an ω-saturated structure will.
| |
| | |
| The reason we only require parameter sets which are strictly smaller than the model is trivial: without this restriction, no infinite model is saturated. Consider a model ''M'', and the type {{nowrap|{''x'' ≠ ''m'' : ''m'' ∈ ''M''}.}} Each finite subset of this type is realized in the (infinite) model ''M'', so by compactness it is consistent with ''M'', but is trivially not realized. Any definition which is universally unsatisfied is useless; hence the restriction.
| |
| | |
| ==Examples==
| |
| Saturated models exist for certain theories and cardinalities:
| |
| | |
| * ('''Q''', <) – the set of [[rational number]]s with their usual ordering – is saturated. Intuitively, this is because any type consistent with the [[dense linear order|theory]] is implied by the order type; that is, the order the variables come in tells you everything there is to know about their role in the structure.
| |
| * ('''R''', <) – the set of [[real number]]s with their usual ordering – is ''not'' saturated. For example, take the type (in one variable ''x'') which contains the formula <math>\textstyle{x> -\frac{1}{n}}</math> for every natural number ''n'', as well as the formula <math>\textstyle{x<0}</math>. This type uses ω different parameters from '''R'''. Every finite subset of the type is realized on '''R''' by some real ''x'', so by compactness it is consistent with the structure, but it is not realized, as it would imply an upper bound to the sequence −1/''n'' which is less than 0 (its least upper bound). Thus ('''R''',<) is ''not'' ω<sub>1</sub>-saturated, and not saturated. However, it ''is'' ω-saturated, for essentially the same reason as '''Q''' – every finite type is given by the order type, which if consistent, is always realized, because of the density of the order.
| |
| * The [[countable random graph]], with the only non-logical symbol being the edge existence relation, is also saturated, because any complete type is implied by the finite subgraph consisting of the variables and parameters used to define the type.
| |
| | |
| Both of these theories can be shown to be [[categorical theory|ω-categorical]] through the [[back-and-forth method]]. This can be generalized as follows: the unique model of cardinality κ of a countable κ-categorical theory is saturated.
| |
| | |
| However, the statement that every model has a saturated [[elementary extension]] is not provable in [[ZFC]]. In fact, this statement is equivalent to the existence of a proper class of cardinals κ such that κ<sup><κ</sup> = κ. The latter identity implies that either {{nowrap|κ {{=}} λ<sup>+</sup> {{=}} 2<sup>λ</sup>}} for some λ, or κ is weakly inaccessible.
| |
| | |
| ==Relationship to prime models==
| |
| The notion of saturated model is dual to the notion of [[prime model]] in the following way: let ''T'' be a countable theory in a first-order language (that is, a set of mutually consistent sentences in that language) and let ''P'' be a prime model of ''T''. Then ''P'' admits an [[elementary embedding]] into any other model of ''T''. The equivalent notion for saturated models is that any "reasonably small" model of ''T'' is elementarily embedded in a saturated model, where "reasonably small" means cardinality no larger than that of the model in which it is to be embedded. Any saturated model is also [[homogeneous model|homogeneous]]. However, while for countable theories there is a unique prime model, saturated models are necessarily specific to a particular cardinality. Given certain set-theoretic assumptions, saturated models (albeit of very large cardinality) exist for arbitrary theories. For λ-[[stable theory|stable]] theories, saturated models of cardinality λ exist.
| |
| | |
| ==References==
| |
| * Chang, C. C.; Keisler, H. J. Model theory. Third edition. Studies in Logic and the Foundations of Mathematics, 73. North-Holland Publishing Co., Amsterdam, 1990. xvi+650 pp. ISBN 0-444-88054-2
| |
| * R. Goldblatt (1998). Lectures on the hyperreals. An introduction to nonstandard analysis. Springer.
| |
| * Marker, David (2002). ''Model Theory: An Introduction''. New York: Springer-Verlag. ISBN 0-387-98760-6
| |
| * Poizat, Bruno; Trans: Klein, Moses (2000), ''A Course in Model Theory'', New York: Springer-Verlag. ISBN 0-387-98655-3
| |
| *{{Citation | last1=Sacks | first1=Gerald E. | title=Saturated model theory | publisher=W. A. Benjamin, Inc., Reading, Mass. | id={{MathSciNet | id = 0398817}} | year=1972}}
| |
| [[Category:Model theory]]
| |
| [[Category:Non-standard analysis]]
| |
These folks call me Gabrielle. Vermont needs always been my does not place and I will have everything that I would like here. As a complete girl what I simply like is going in the market to karaoke but I haven't made a dime as well as. I am the cashier and I'm preparing pretty good financially. See what's new on my new website here: http://prometeu.net
Check out my web site ... clash of clans cheat engine