|
|
| Line 1: |
Line 1: |
| {{inline citations|date=August 2013}}
| | Wilber Berryhill is what his spouse loves to call him and he totally enjoys this name. Ohio is where his house is and his family members loves it. The preferred pastime for him and his children is to perform lacross and he would [http://kjhkkb.net/xe/notice/374835 psychic readers] by no means give it up. [http://medialab.zendesk.com/entries/54181460-Will-You-Often-End-Up-Bored-Try-One-Of-These-Hobby-Ideas- real psychic] Invoicing is what I do for a residing but I've always needed my own business.<br><br>Look into my web site ... [http://si.dgmensa.org/xe/index.php?document_srl=48014&mid=c0102 psychic readings] |
| In [[model theory]] and related areas of [[mathematics]], a '''type''' is an object that, loosely speaking, describes how a (real or possible) element or elements in a [[structure (mathematical logic)|mathematical structure]] might behave. More precisely, it is a set of [[First-order logic|first-order]] formulas in a language ''L'' with free variables ''x''<sub>1</sub>, ''x''<sub>2</sub>,…, ''x''<sub>''n''</sub> which are true of a sequence of elements of an ''L''-structure <math>\mathcal{M}</math>. Depending on the context, types can be '''complete''' or '''partial''' and they may use a fixed set of constants, ''A'', from the structure <math>\mathcal{M}</math>. The question of which types represent actual elements of <math>\mathcal{M}</math> leads to the ideas of [[saturated model]]s and '''omitting types'''.
| |
| | |
| ==Formal definition==
| |
| Consider a [[Structure (mathematical logic)|structure]] <math>\mathcal{M}</math> for a [[Formal language|language]] ''L''. Let ''M'' be the [[Structure_(mathematical_logic)#Domain|universe]] of the structure. For every ''A'' ⊆ ''M'', let ''L''(''A'') be the language which is obtained from ''L'' by adding a constant ''c''<sub>''a''</sub> for every ''a'' ∈ ''A''. In other words,
| |
| :<math>L(A) = L \cup \{c_a : a \in A\}.</math>
| |
| | |
| A '''1-type (of <math>\mathcal{M}</math>) over''' ''A'' is a set ''p''(''x'') of formulas in ''L''(''A'') with at most one free variable ''x'' (therefore 1-type) such that for every finite subset ''p''<sub>0</sub>(''x'') ⊆ ''p''(''x'') there is some ''b'' ∈ ''M'', depending on ''p''<sub>0</sub>(''x''), with <math> \mathcal{M} \models p_0(b) </math> (i.e. all formulas in ''p''<sub>0</sub>(''x'') are true in <math>\mathcal{M}</math> when ''x'' is replaced by ''b'').
| |
| | |
| Similarly an '''''n''-type (of <math>\mathcal{M}</math>) over''' ''A'' is defined to be a set ''p''(''x''<sub>1</sub>,…,''x''<sub>''n''</sub>) = ''p''('''''x''''') of formulas in ''L''(''A'') such that for every finite subset ''p''<sub>0</sub>('''''x''''') ⊆ ''p''('''''x''''') there are some elements ''b''<sub>1</sub>,…,''b''<sub>''n''</sub> ∈ ''M'' with <math>\mathcal{M}\models p_0(b_1,\ldots,b_n)</math>.
| |
| | |
| '''Complete type''' refers to those types which are [[maximal consistent set|maximal]] with respect to inclusion, i.e. if ''p''('''''x''''') is a complete type, then <math>\forall \phi(\boldsymbol{x}) \in L(A,\boldsymbol{x})</math> either <math> \phi(\boldsymbol{x}) \in p(\boldsymbol{x})</math> or <math>\lnot\phi(\boldsymbol{x}) \in p(\boldsymbol{x})</math>. Any non-complete type is called a '''partial type'''.
| |
| So, the word '''type''' in general refers to any ''n''-type, partial or complete, over any chosen set of parameters (possibly the empty set).
| |
| | |
| An ''n''-type ''p''('''''x''''') is said to be {{anchor|realizationOfTypes}}'''realized in <math>\mathcal{M}</math>''' if there is an element '''''b''''' ∈ ''M''<sup>''n''</sup> such that <math>\mathcal{M}\models p(\boldsymbol{b})</math>. The existence of such a realization is guaranteed for any type by the [[Compactness theorem]], although the realization might take place in some [[elementary extension]] of <math>\mathcal{M}</math>, rather than in <math>\mathcal{M}</math> itself.
| |
| If a complete type is realized by '''''b''''' in <math>\mathcal{M}</math>, then the type is typically denoted <math>tp_n^{\mathcal{M}}(\boldsymbol{b}/A)</math> and referred to as '''the complete type of ''b'' over''' ''A''.
| |
| | |
| A type ''p''('''''x''''') is said to be '''isolated by ''φ''''' if there is a formula ''φ''('''''x''''') with the property that <math>\forall \psi(\boldsymbol{x}) \in p(\boldsymbol{x}), \varphi(\boldsymbol{x}) \rightarrow \psi(\boldsymbol{x})</math>. Since finite subsets of a type are always realized in <math>\mathcal{M}</math>, there is always an element '''''b''''' ∈ ''M''<sup>''n''</sup> such that ''φ''('''''b''''') is true in <math>\mathcal{M}</math>; i.e. <math>\mathcal{M} \models \varphi(\boldsymbol{b})</math>, thus '''''b''''' realizes the entire isolated type. So isolated types will be realized in every elementary substructure or extension. Because of this, isolated types can never be omitted (see below).
| |
| | |
| A model that realizes the maximum possible variety of types is called a [[saturated model]], and the [[ultraproduct|ultrapower]] construction provides one way of producing saturated models.
| |
| | |
| ==Examples of types==
| |
| Consider the language with one binary connective, which we denote as <math>\in</math>. Let <math>\mathcal{M}</math> be the model <math>\langle \omega, \in_{\omega}\rangle</math>, which is the ordinal <math>\omega</math> with its standard well-ordering. Let <math>\mathcal{T}</math> denote the theory of this model.
| |
| | |
| Consider the set of formulas <math>p(x):=\{ n \in x \mid n\in_{\omega} \omega \} </math>. First, we claim this is a type. Let <math>p_0(x)\subseteq p(x)</math>. We need to find an <math>n\in\omega</math> that satisfies all the formulas in <math>p_0</math>. Well, we can just take the successor of the largest ordinal mentioned in the set of formulas <math>p_0(x)</math>. Then this will clearly contain all the ordinals mentioned in <math>p_0(x)</math>. Thus we have that <math>p(x)</math> is a type.
| |
| Next, note that <math>p(x)</math> is not realized in <math>\mathcal{M}</math>. For, if it were there would be some <math>n\in\omega</math> that contains every element of <math>\omega</math>.
| |
| If we wanted to realize the type, we might be tempted to consider the model <math>\langle \omega+1,\in_{\omega+1}\rangle</math>, which is indeed a supermodel of <math>\mathcal{M}</math> which realizes the type. Unfortunately, this extension is not elementary, that is this model does not have satistfy <math>\mathcal{T}</math>. In particular, the sentence <math>\exists x \forall y (y\in x)</math> is satisfied by this model and not by <math>\mathcal{M}</math>.
| |
| | |
| So, we wish to realize the type in an elementary extension. We can do this by defining a new structure in this language, which we will denote <math>\mathcal{M}'</math>. The domain of the structure will be <math>\omega \cup \mathbb{Z}'</math> where <math>\mathbb{Z}'</math> is the set of integers adorned in such a way that <math>\mathbb{Z}'\cap\omega=\emptyset</math>. Let <math><</math> denote the usual order of <math>\mathbb{Z}'</math>. We interpret the symbol <math>\in</math> in our new structure by <math>\in_{\mathcal{M}'} = \in_{\omega} \cup < \cup \,(\omega \times \mathbb{Z}')</math>. The idea being that we are adding a "Z-chain", or copy of the integers, above all the finite ordinals. Clearly any element of <math>\mathbb{Z}'</math> realizes the type <math>p(x)</math>. Moreover, one can verify this extensional is elementary.
| |
| | |
| Another example: the complete type of the number 2 over the emptyset, considered as a member of the natural numbers, would be the set of all first-order statements describing a variable ''x'' that are true for ''x'' = 2. This set would include formulas such as <math>\,\!x\ne 1+1+1</math>, <math>x\le 1+1+1+1+1</math>, and <math>\exists y(y<x)</math>. This is an example of an isolated type, since the formula <math>x = 1+1</math> implies all other formulas that are true about the number 2.
| |
| | |
| For example, the statements
| |
| | |
| :<math>\forall y(y^2<2 \implies y<x)</math>
| |
| | |
| and
| |
| | |
| :<math>\forall y((y>0 \and y^2>2) \implies y>x)</math>
| |
| | |
| describing the square root of 2 are consistent with the axioms of [[ordered field]]s, and can be extended to a complete type. This type is not realized in the ordered field of rational numbers, but is realized in the ordered field of reals. Similarly, the infinite set of formulas (over the emptyset) {x>1, x>1+1, x>1+1+1, ...} is not realized in the ordered field of real numbers, but is realized in the ordered field of [[hyperreals]]. If we allow more parameters, for instance all of the reals, we can specify a type <math>\{ 0 < x < r : r \in \mathbb{R} \}</math> that is realized by an [[infinitesimal]] hyperreal that violates the [[Archimedean property]].
| |
| | |
| The reason it is useful to restrict the parameters to a certain subset of the model is that it helps to distinguish the types that can be satisfied from those that cannot. For example, using the entire set of real numbers as parameters one could generate an uncountably infinite set of formulas like <math>x\ne 1</math>, <math>x\ne \pi</math>, ... that would explicitly rule out every possible real value for ''x'', and therefore could never be realized within the real numbers.
| |
| | |
| ==Stone spaces==
| |
| | |
| It is useful to consider the set of complete ''n''-types over ''A'' as a [[topological space]]. Consider the following equivalence relation on formulae in the free variables ''x''<sub>1</sub>,…, ''x''<sub>''n''</sub> with parameters in ''M'':
| |
| :<math>\psi \equiv \phi \Leftrightarrow \mathcal{M} \models \forall x_1,\ldots,x_n (\psi(x_1,\ldots,x_n) \leftrightarrow \phi(x_1,\ldots,x_n)).</math>
| |
| One can show that <math>\psi \equiv \phi</math> iff they are contained in exactly the same complete types. | |
| | |
| The set of formulae in free variables ''x''<sub>1</sub>,…,''x''<sub>''n''</sub> over ''A'' up to this equivalence relation is a [[Boolean algebra (structure)|Boolean algebra]] (and is canonically isomorphic to the set of ''A''-definable subsets of ''M''<sup>''n''</sup>). The complete ''n''-types correspond to [[ultrafilter]]s of this boolean algebra. The set of complete ''n''-types can be made into a topological space by taking the sets of types containing a given formula as basic open sets. This constructs the [[Stone space]] which is [[compact space|compact]], [[Hausdorff space|Hausdorff]], and [[totally disconnected space|totally disconnected]].
| |
| | |
| '''Example'''. The complete theory of [[algebraically closed field]]s of [[characteristic (algebra)|characteristic]] 0 has [[quantifier elimination]] which allows one to show that the possible complete 1-types correspond to:
| |
| *[[root of a function|Root]]s of a given [[irreducible polynomial|irreducible non-constant polynomial]] over the rationals with leading coefficient 1. For example, the type of square roots of 2. Each of these types is an open point of the Stone space.
| |
| *Transcendental elements, that are not roots of any non-zero polynomial. This type is a point in the Stone space that is closed but not open.
| |
| In other words, the 1-types correspond exactly to the prime ideals of the polynomial ring '''Q'''[''x''] over the rationals '''Q''': if ''r'' is an element of the model of type ''p'', then the ideal corresponding to ''p'' is the set of polynomials with ''r'' as a root. More generally, the complete ''n''-types correspond to the prime ideals of the polynomial ring '''Q'''[''x''<sub>1</sub>,...,''x''<sub>n</sub>], in other words to the points of the [[prime spectrum]] of this ring. (The Stone space topology can in fact be viewed as the Zariski topology of a Boolean ring induced in a natural way from the lattice structure of the Boolean Algebra; while the Zariski topology is not in general Hausdorff, it is in the case of Boolean rings.) For example, if ''q''(''x'',''y'') is an irreducible polynomial in 2 variables, there is a 2-type whose realizations are (informally) pairs (''x'',''y'') of transcendental elements with ''q''(''x'',''y'')=0.
| |
| | |
| ==The omitting types theorem==
| |
| | |
| Given a complete ''n''-type ''p'' one can ask if there is a model of the theory that '''omits''' ''p'', in other words there is no ''n''-tuple in the model which realizes ''p''.
| |
| If ''p'' is an [[isolated point]] in the Stone space, i.e. if {''p''} is an open set, it is easy to see that every model realizes ''p'' (at least if the theory is complete). The '''omitting types theorem''' says that conversely if ''p'' is not isolated then there is a countable model omitting ''p'' (provided that the language is countable).
| |
| | |
| '''Example''': In the theory of algebraically closed fields of characteristic 0, there is a 1-type represented by elements that are transcendental over the prime field. This is a non-isolated point of the Stone space (in fact, the only non-isolated point). The field of algebraic numbers is a model omitting this type, and the algebraic closure of any
| |
| transcendental extension of the rationals is a model realizing this type.
| |
| | |
| All the other types are "algebraic numbers" (more precisely, they are the sets of first order statements satisfied by some given algebraic number), and all such types are realized in all algebraically closed fields of characteristic 0.
| |
| | |
| ==References== | |
| * {{ cite book | last=Hodges | first=Wilfrid | authorlink=Wilfrid Hodges | publisher=[[Cambridge University Press]] | title=A shorter model theory | year=1997 | isbn=0-521-58713-1 }}
| |
| * {{ cite book | last=Chang | first=C.C. | coauthors=[[Howard Jerome Keisler|Keisler, H. Jerome]] | publisher=[[Elsevier]] | title=Model Theory | year=1989 | edition=third edition | isbn=0-7204-0692-7 }}
| |
| * {{ cite book | last=Marker | first=David | title= Model Theory: An Introduction | publisher=Springer | year=2002 | isbn=0-387-98760-6| series=[[Graduate Texts in Mathematics]] 217}}
| |
| | |
| [[Category:Model theory]]
| |
| [[Category:Concepts in logic]]
| |