tinytheorems - about groups - rings - modules - models atom/rss

Intro to model theory

.

Model theory is all about figuring out how certain structures (like groups, rings, and fields) satisfy certain properties (like commutativity, “xx is prime”, and other statements).

To do this, we need to rigorously define what a property is. We start with atomic formulas. An atomic formula is a relation – either it’s equality:

or some other relation like ,\le, \subseteq:

where all the symbols like +,,,+,\cup,\le,\subseteq come from some language LL of symbols. A language consists of constants (like 00), function symbols (like +,+,\cup), and relation symbols (like \le,\subseteq,RR).

For now, let’s only deal with atomic formulas, which means we won’t be using the symbols ,,¬,,\lor,\land,\lnot,\exists,\forall.

Here we define Aϕ(aˉ)A\models\phi(\bar{a}) (for atomic formulas ϕ(aˉ)\phi(\bar{a})).

One of the most important relations in model theory is Aϕ(aˉ)A\models\phi(\bar{a}), read “ϕ(xˉ)\phi(\bar{x}) is true of aˉ\bar{a} in AA” or “aˉ\bar{a} satisfies ϕ(xˉ)\phi(\bar{x}) in AA” or simply “AA models ϕ(aˉ)\phi(\bar{a})”. Here, AA is an LL-structure (it assigns meaning to symbols in LL). For instance, we might say that (Z,+,=)(\ZZ,+,=) is a structure that interprets the constant symbols 0,1,2,0,1,2, etc. as integers, the function symbol ++ as integer addition, and the relation symbol == as integer equality.

One way to see Aϕ(aˉ)A\models\phi(\bar{a}) is:

For instance, given ϕ(x,y)x+y=3\phi(x,y)\equiv x+y=3, we have (Z,+,=)ϕ(1,2)(\ZZ,+,=)\models\phi(1,2).

To precisely define the relation \models for atomic formulas, we describe two cases:

where each ti(xˉ)t_i(\bar{x}) is some term in our language LL. Then, if we let tiA(xˉ)t_i^A(\bar{x}) be AA’s interpretation of the term ti(xˉ)t_i(\bar{x}), Aϕ(xˉ)A\models\phi(\bar{x}) is the same as saying

Here we define ATA\models T (for theories TT).

A theory is a set of sentences, i.e. formulas with no parameters. A sentence is either always false or always true under a given model — unlike formulas, which could be false given certain parameters and true given other parameters. A theory is either inconsistent when it contains two sentences that cannot be logically be true at the same time (ϕ\phi and ¬ϕ\lnot\phi for some ϕ\phi), and consistent otherwise.

We can extend the definition of \models to theories TT. For now, assume that the theory TT is a set of atomic sentences. Then if AA\models every atomic sentence in TT, we can write ATA\models T. Note that inconsistent theories have no model, since it is impossible to satisfy both ϕ\phi and ¬ϕ\lnot\phi no matter the model.

An important property is that if ATA\models T, then AA\models every subset of TT as well. We’ll see later that we often prove ATA\models T by extending TT to some T+T^+ where AT+A\models T^+ is easy to prove.

Summary

We say Aϕ(aˉ)A\models\phi(\bar{a}), or “AA models ϕ(aˉ)\phi(\bar{a})” when the LL-structure AA interprets the symbols in the atomic formula ϕ(aˉ)\phi(\bar{a}) so that it is true. By “true” we mean that:

\models can be extended to work on sets of sentences, or theories. In particular, if ATA\models T, then AA\models every subset of TT as well.

< Back to category Intro to model theory (permalink)
Exploration 1: The canonical model of a theory