Type (model theory)

In model theory and related areas of mathematics, a type is an object that describes how a (real or possible) element or finite collection of elements in a mathematical structure might behave. More precisely, it is a set of first-order formulas in a language ''L'' with free variables ''x''₁, ''x''₂,…, ''x''_''n'' that are true of a sequence of elements of an ''L''-structure $\mathcal$. Depending on the context, types can be complete or partial and they may use a fixed set of constants, ''A'', from the structure $\mathcal$. The question of which types represent actual elements of $\mathcal$ leads to the ideas of saturated models and omitting types.

Formal definition

Consider a structure $\mathcal$ for a language ''L''. Let ''M'' be the universe of the structure. For every ''A'' ⊆ ''M'', let ''L''(''A'') be the language obtained from ''L'' by adding a constant ''c''_''a'' for every ''a'' ∈ ''A''. In other words,
:$L(A) = L \cup \.$

A 1-type (of $\mathcal$) 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''₀(''x'') ⊆ ''p''(''x'') there is some ''b'' ∈ ''M'', depending on ''p''₀(''x''), with $\mathcal \models p_0(b)$ (i.e. all formulas in ''p''₀(''x'') are true in $\mathcal$ when ''x'' is replaced by ''b'').

Similarly an ''n''-type (of $\mathcal$) over ''A'' is defined to be a set ''p''(''x''₁,…,''x''_''n'') = ''p''(''x'') of formulas in ''L''(''A''), each having its free variables occurring only among the given ''n'' free variables ''x''₁,…,''x''_''n'', such that for every finite subset ''p''₀(''x'') ⊆ ''p''(''x'') there are some elements ''b''₁,…,''b''_''n'' ∈ ''M'' with $\mathcal\models p_0(b_1,\ldots,b_n)$.

A complete type of $\mathcal$ over ''A'' is one that is maximal with respect to inclusion. Equivalently, for every $\phi(\boldsymbol) \in L(A,\boldsymbol)$ either $\phi(\boldsymbol) \in p(\boldsymbol)$ or $\lnot\phi(\boldsymbol) \in p(\boldsymbol)$. 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 realized in $\mathcal$ if there is an element ''b'' ∈ ''M''^''n'' such that $\mathcal\models p(\boldsymbol)$. 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 $\mathcal$, rather than in $\mathcal$ itself.
If a complete type is realized by ''b'' in $\mathcal$, then the type is typically denoted $tp_n^(\boldsymbol/A)$ and referred to as the complete type of ''b'' over ''A''.

A type ''p''(''x'') is said to be isolated by ''$\varphi$'', for $\varphi \in p(x)$, if for all $\psi(\boldsymbol) \in p(\boldsymbol),$ we have $\operatorname(\mathcal M) \models \varphi(\boldsymbol) \rightarrow \psi(\boldsymbol)$. Since finite subsets of a type are always realized in $\mathcal$, there is always an element ''b'' ∈ ''M''^''n'' such that ''φ''(''b'') is true in $\mathcal$; i.e. $\mathcal \models \varphi(\boldsymbol)$, 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

Consider the language with one binary connective, which we denote as $\in$. Let $\mathcal$ be the structure $\langle \omega, \in_\rangle$ for this language, which is the ordinal $\omega$ with its standard well-ordering. Let $\mathcal$ denote the theory of $\mathcal$.

Consider the set of formulas $p(x):=\$. First, we claim this is a type. Let $p_0(x)\subseteq p(x)$ be a finite subset of $p(x)$. We need to find a $b\in\omega$ that satisfies all the formulas in $p_0$. Well, we can just take the successor of the largest ordinal mentioned in the set of formulas $p_0(x)$. Then this will clearly contain all the ordinals mentioned in $p_0(x)$. Thus we have that $p(x)$ is a type.
Next, note that $p(x)$ is not realized in $\mathcal$. For, if it were there would be some $n\in\omega$ that contains every element of $\omega$.
If we wanted to realize the type, we might be tempted to consider the model $\langle \omega+1,\in_\rangle$, which is indeed a supermodel of $\mathcal$ that realizes the type. Unfortunately, this extension is not elementary, that is, this model does not have to satisfy $\mathcal$. In particular, the sentence $\exists x \forall y (y\in x \lor y=x)$ is satisfied by this model and not by $\mathcal$.

So, we wish to realize the type in an elementary extension. We can do this by defining a new structure in the language, which we will denote $\mathcal'$. The domain of the structure will be $\omega \cup \mathbb'$ where $\mathbb'$ is the set of integers adorned in such a way that $\mathbb'\cap\omega=\emptyset$. Let $<$ denote the usual order of $\mathbb'$. We interpret the symbol $\in$ in our new structure by $\in_ = \in_ \cup < \cup \,(\omega \times \mathbb')$. The idea being that we are adding a "$\mathbb$-chain", or copy of the integers, above all the finite ordinals. Clearly any element of $\mathbb'$ realizes the type $p(x)$. Moreover, one can verify that this extension is elementary.

Another example: the complete type of the number 2 over the empty set, considered as a member of the natural numbers, would be the set of all first-order statements, describing a variable ''x'', that are true when ''x'' = 2. This set would include formulas such as $\,\!x\ne 1+1+1$, $x\le 1+1+1+1+1$, and \exists y(y. This is an example of an isolated type, since, working over the theory of the naturals, the formula $x = 1+1$ implies all other formulas that are true about the number 2.

As a further example, the statements

:\forall y(y^2<2 \implies y

and

:$\forall y((y>0 \land y^2>2) \implies y>x)$

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 empty set) is not realized in the ordered field of real numbers, but is realized in the ordered field of hyperreals. If we allow 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 $x\ne 1$, $x\ne \pi$, ... 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 formulas in the free variables ''x''₁,…, ''x''_''n'' with parameters in ''A'':
:$\psi \equiv \phi \Leftrightarrow \mathcal \models \forall x_1,\ldots,x_n (\psi(x_1,\ldots,x_n) \leftrightarrow \phi(x_1,\ldots,x_n)).$
One can show that $\psi \equiv \phi$ if and only if they are contained in exactly the same complete types.

The set of formulas in free variables ''x''₁,…,''x''_''n'' over ''A'' up to this equivalence relation is a Boolean algebra (and is canonically isomorphic to the set of ''A''-definable subsets of ''M''^''n''). The complete ''n''-types correspond to ultrafilters 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, 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 1-types (over the empty set) correspond to:
*Roots of a given 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 (which is only the zero polynomial if ''r'' is transcendental). More generally, the complete ''n''-types correspond to the prime ideals of the polynomial ring Q 'x''₁,...,''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 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 two variables, there is a 2-type whose realizations are (informally) pairs (''x'',''y'') of elements with ''q''(''x'',''y'')=0.

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 that realizes ''p''.
If ''p'' is an isolated point in the Stone space, i.e. if 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 field (mathematics)#Subfields and prime fields, 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

*
*
*

{{Mathematical logic

Concepts in logic
Mathematical logic
Model theory