13 Introduction to Types

Definition (L-formula with parameters from A). Given a language L, an L-structure M and a subset A⊆M, 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 N≽M. What does N look like from the point of M?

SIngle formulas don’t give you much insight: suppose a∈N, N⊨ϕ(a). Then there is some a′∈M 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 A⊆M. 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 p∪ThA(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,…,an∈M, let tpM(a1,…,an∕A) be the set of all LA-formulas ϕ(x1,…,xn) such that M⊨ϕ(a1,…,an) (usually ai∉A).

tpM(a¯∕A)∈SnM(A) and a¯⊨tpM(a¯∕A).

Proposition 13.4. Assuming that:

  • p∈SnM(A)

Then there is N≽M with a¯∈Nn such that p=tpN(a¯∕A).

Proof. By assumption p∪ThA(M) is consistent.

Need to show p∪ThM(M) is consistent.

Fix Σ⊆p∪ThM(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,…,bm∈M∖A and φ∗(x1,…,xm) an LA-formula.

Since M⊨φ∗(b1,…,bm) we get M⊨∃⁡v¯,φ∗(v1,…,vm), so ∃⁡v¯φ∗(v¯)∈ThA(M).

So as ThA(M)∪p is consistent, we have N⊨ThA(M)∪p with

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

Then N⊨φ(b1,…,bm). So N⊨φ∗, so N⊨Σ. □

Remark 13.5. If M≼N and A⊆M 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 ∀⁡q⊆p finite, ∃⁡a¯∈Mn such that a¯⁄⊨q.

Proof.

  • ⇒ Clear.
  • ⇐ Choose N≽M realising p. Fix q⊆p finite, φ(x¯) the conjunction of all LA-formulas in q. Then N⊨∃⁡x¯,φ(x¯). So M⊨∃⁡x¯,φ(x¯), i.e. q is realised in M. □

Example 13.7. Suppose K⊨ACF⁡, A⊆K. We want to describe SnK(A). Fix p∈SnK(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¯)=0∈p}. Then Ip is a prime ideal and p↦Ip is a bijection SnK(A)↦Spec⁡F[x¯] (Spec⁡F[x¯] is the set of prime ideals of F[x¯]). So S1K(A) consists of

{pa:a∈A}∪{q},

where pa contains (and thus is determined by) x=a and q={x≠a:a∈F}.

|S1K(K)|=|K|.

PIC