Type (model theory)

In model theory and related areas of mathematics, a type is a set of firstorder formulas in a language L with free variables x_{1}, x_{2},…, x_{n} which are true of a sequence of elements of an Lstructure . Loosely speaking, types describe possible elements of a mathematical structure. Depending on the context, types can be complete or partial and they may use a fixed set of constants, A, from the structure . The question of which types represent actual elements of leads to the ideas of saturated models and omitting types.
Contents
Definition
Consider a structure for a language L. Let M be the universe of the structure. For every A ⊆ M, let L(A) be the language which is obtained from L by adding a constant c_{a} for every a ∈ A. In other words,
A 1type (of ) over A is a set p(x) of formulas in L(A) with at most one free variable x (therefore 1type) such that for every finite subset p_{0}(x) ⊆ p(x) there is some b ∈ M, depending on p_{0}(x), with (i.e. all formulas in p_{0}(x) are true in when x is replaced by b).
Similarly an ntype (of ) over A is defined to be a set p(x_{1},…,x_{n}) = p(x) of formulas in L(A) such that for every finite subset p_{0}(x) ⊆ p(x) there are some elements b_{1},…,b_{n} ∈ M with .
Complete type refers to those types which are maximal with respect to inclusion, i.e. if p(x) is a complete type, then either or . Any noncomplete type is called a partial type. So, the word type in general refers to any ntype, partial or complete, over any chosen set of parameters (possibly the empty set).
An ntype p(x) is said to be realized in if there is an element b ∈ M^{n} such that . 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 , rather than in itself. If a complete type is realized by b in , then the type is typically denoted 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 . Since finite subsets of a type are always realized in , there is always an element b ∈ M^{n} such that φ(b) is true in ; i.e. , 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 ultrapower construction provides one way of producing saturated models.
Examples of types
Let have the natural numbers as domain which are ordered by . Then is a type of over : By definition anyhow. For every nonempty finite subset , we can determine the maximal natural number occurring in p_{0} and obtain .
The set p(x) is a partial type and claims "x is greater than any natural number". Yet such an element does not exist in the domain of . This can be remedied by a new structure, say, with domain where and .
is an elementary extension of (w.r.t. ) and . Hence 0' realises p(x). Of course, p(x) cannot be isolated in or else it would be isolated in since this is an elementary substructure of . But being isolated in means being realised in .
Alternatively one could simply add another element to and make c the greatest element. But then p(x) would be isolated by in the extension of . Hence this extension cannot be an elementary extension of .
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 firstorder statements describing a variable x that are true for x = 2. This set would include formulas such as , , and . This is an example of an isolated type, since the formula x = 1 + 1 implies all other formulas that are true about the number 2.
For example, the statements
and
describing the square root of 2 are consistent with the axioms of ordered fields, 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 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 , , ... 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 ntypes over A as a topological space. Consider the following equivalence relation on formulae in the free variables x_{1},…, x_{n} with parameters in M:
One can show that iff they are contained in exactly the same complete types.
The set of formulae in free variables x_{1},…,x_{n} over A up to this equivalence relation is a Boolean algebra (and is canonically isomorphic to the set of Adefinable subsets of M^{n}). The complete ntypes correspond to ultrafilters of this boolean algebra. The set of complete ntypes 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, Hausdorff, and totally disconnected.
Example. The complete theory of algebraically closed fields of characteristic 0 has quantifier elimination which allows one to show that the possible complete 1types correspond to:
 Roots of a given irreducible nonconstant 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 nonzero polynomial. This type is a point in the Stone space that is closed but not open.
In other words, the 1types 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 ntypes correspond to the prime ideals of the polynomial ring Q[x_{1},...,x_{n}], 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 2type whose realizations are (informally) pairs (x,y) of transcendental elements with q(x,y)=0.
The omitting types theorem
Given a complete ntype p one can ask if there is a model of the theory that omits p, in other words there is no ntuple 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 1type represented by elements that are transcendental over the prime field. This is a nonisolated point of the Stone space (in fact, the only nonisolated 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
 Hodges, Wilfrid (1997). A shorter model theory. Cambridge University Press. ISBN 0521587131.
 Chang, C.C.; Keisler, H. Jerome (1989). Model Theory (third edition ed.). Elsevier. ISBN 0720406927.
 Marker, David (2002). Model Theory: An Introduction. Graduate Texts in Mathematics 217. Springer. ISBN 0387987606.
Categories: Model theory
 Concepts in logic
Wikimedia Foundation. 2010.
Look at other dictionaries:
Model theory — This article is about the mathematical discipline. For the informal notion in other parts of mathematics and science, see Mathematical model. In mathematics, model theory is the study of (classes of) mathematical structures (e.g. groups, fields,… … Wikipedia
Type — may refer to:In philosophy: *A type is a category of being *Type token distinction *Type theory, basis for the study of type systemsIn mathematics: *Type (model theory) *Type or Arity, the number of operands a function takes *Type, any… … Wikipedia
Theory (mathematical logic) — This article is about theories in a formal language, as studied in mathematical logic. For other uses, see Theory (disambiguation). In mathematical logic, a theory (also called a formal theory) is a set of sentences in a formal language. Usually… … Wikipedia
Theory — The word theory has many distinct meanings in different fields of knowledge, depending on their methodologies and the context of discussion.In science a theory is a testable model of the manner of interaction of a set of natural phenomena,… … Wikipedia
Theory of relations — This article is about the theory of relations with regard to its specifically combinatorial aspects. For a general discussion of the basic definitions, see Binary relation and Finitary relation. The theory of relations treats the subject matter… … Wikipedia
Model predictive control — Model Predictive Control, or MPC, is an advanced method of process control that has been in use in the process industries such as chemical plants and oil refineries since the 1980s. Model predictive controllers rely on dynamic models of the… … Wikipedia
Modelcentered instruction — is a general theory of instructional design developed by Andrew S. Gibbons.[1] This theory can be used to design individual and group instruction for all kinds of learning in any type of learning environment. In addition, this theory may be used… … Wikipedia
Modelbased design — (MBD) is a mathematical and visual method of addressing problems associated with designing complex control,[1][2] signal processing[3] and communication systems. It is used in many motion control, industrial equipment, aerospace, and automotive… … Wikipedia
Model Technical Higher Secondary School, Kaloor — Model Technical Higher Secondary School,Kaloor. M.T.H.S.S. Kaloor Location Ernakulam, K … Wikipedia
Model Technical Higher Secondary School,Kaprassery — Model Technical Higher Secondary School, Kaprassery. Motto Manpower Development Established 1997 Type Aided Schools … Wikipedia