13 Introduction to Types

Definition (L-formula with parameters from A). Given a language L, an L-structure M and a subset AM, we call an LA-formula an L-formula with parameters from A.

Write these as φ(x¯,a¯) for φ(x¯,y¯) an L-formula, and a¯A (identify with a̲M).

Suppose NM. What does N look like from the point of M?

SIngle formulas don’t give you much insight: suppose aN, Nϕ(a). Then there is some aM with Mϕ(a).

This changes if you consider sets of infinitely many formulas.

Notation 13.1.

Exercise: Show p is consistent if and only if every finite subest of p is consistent ( Example Sheet 2, Q8).

Definition 13.2 (n-type). Let M be an L-structure and AM. An n-type over A with respect to M is a set of L-formulas with parameters from A, in free variables x1,,xn such that pThA(M) is consistent.

An n-type is complete if for every LA-formula with n variables ϕ, either ϕp or ¬ϕp.

Let SnM(A) denote the set of all complete n-types over A with respect to M.

Definition 13.3 (tpM). Given a1,,anM, let tpM(a1,,anA) be the set of all LA-formulas ϕ(x1,,xn) such that Mϕ(a1,,an) (usually aiA).

tpM(a¯A)SnM(A) and a¯tpM(a¯A).

Proposition 13.4. Assuming that:

  • pSnM(A)

Then there is NM with a¯Nn such that p=tpN(a¯A).

Proof. By assumption pThA(M) is consistent.

Need to show pThM(M) is consistent.

Fix ΣpThM(M) finite. Σp{φ1,,φt}, φi an LM-sentence with Mφi.

Let φ be i=1tφi, then φ can be written φ(b1,,bm) where b1,,bmMA and φ(x1,,xm) an LA-formula.

Since Mφ(b1,,bm) we get Mv¯,φ(v1,,vm), so v¯φ(v¯)ThA(M).

So as ThA(M)p is consistent, we have NThA(M)p with

Expand N to an LM-structure, i.e. let

Then Nφ(b1,,bm). So Nφ, so NΣ.

Remark 13.5. If MN and AM then SnM(A)=SnN(A) since ThA(M)=ThA(N).

Remark 13.6. p is an n-type over A with respect to M if and only if qp finite, a¯Mn such that a¯q.

Proof.

  • Clear.
  • Choose NM realising p. Fix qp finite, φ(x¯) the conjunction of all LA-formulas in q. Then Nx¯,φ(x¯). So Mx¯,φ(x¯), i.e. q is realised in M.

Example 13.7. Suppose KACF, AK. We want to describe SnK(A). Fix pSnK(A). By quantifier elimination we only need to consider quantifier free formulas.

Moreover,

φψpφ,ψp¬ψpφp

So we can concentrate on atomic formulas φ, polynomials in variables x1,,xn over the field generated by A, say F (i.e. F[x¯]).

Let Ip={f(x¯)F[x¯]:f(x¯)=0p}. Then Ip is a prime ideal and pIp is a bijection SnK(A)SpecF[x¯] (SpecF[x¯] is the set of prime ideals of F[x¯]). So S1K(A) consists of

{pa:aA}{q},

where pa contains (and thus is determined by) x=a and q={xa:aF}.

|S1K(K)|=|K|.

PIC