11 Introduction to Quantifier Elimination

Definition (Definable set). Let T be an L-theory and MT. Then XMn is definable is there is some L-formula φ(x1,,xn) such that

X={a¯Mn:Mφ(a¯)}.

Definition 11.1 (Theory has quantifier elimination). An L-theory T has quantifier elimination (QE) if for any L-formula φ(x1,,xn) ther eis a quantifier free formula ψ(x1,,xn) such that

Tx¯(φ(x¯)ψ(x¯)).

(i.e. they define the same set in all models).

Example 11.2.

  • (1) Let T=Th(F), F a field in Lrings. Let φ(w,x,y,z) be the formula saying
    (wxyz) has an inverse”,

    i.e.

    s,t,u,v[(stuv)(wxyz)=(1001)].

    Then

    Tx,w,y,z(φ(w,x,y,z)wzxy0).
  • (2) Let T=Th(,,+,0,1). Consider φ(x)=y(y2=x) (this defines 0).

    Quantifier free formulas in one variable are boolean combinations of polynomial equations, i.e. define sets of size finite or cofinite. But 0 is infinite-co-infinite, so cannot be defined by a quantifier free formula.

    Remark: Th(,,+,0,1) does have quantifier elimination.

    We can show Th(,,+,0,1) and Th(,,+,0,1,<) have the same definable sets.

    This is because we can define < in Lrings in T by noting x<y if and only if

    z(z0yz2=x).

    Note: you can always find a language in which the theory of a structure has quantifier elimination: just add a relation symbol for each non quantifier-free formula. This is called the “Morleyisation” of a structure, but isn’t particularly informative.

Lemma 11.3. Assuming that:

  • T is an L-theory

  • for any quantifier-free formula φ(x1,,xn,y) there is a quantifier-free formula ψ(x1,,xn) such that

    Tx¯(yφ(x¯,y)ψ(x¯)).

Proof. Exercise: induction on the complexity of formulas.

Theorem 11.4. Assuming that:

  • T an L-theory

Then the following are equivalent:
  • (i) T has quantifier elimination
  • (ii) Let M,NT, AM, AN (substructures). For any quantifier-free formula φ(x1,,xn,y) and tuple a¯A, if My,φ(a¯,y) then Ny,φ(a¯,y).
  • (iii) For any L-structure A, TD(A) is a complete LA-theory.

Proof.

  • (i) (iii) Assume T has quantifier elimination, and let A be an L-structure. Suppose M,NTD(A). We want to show MLAN.

    Let σ be an LA-sentence, and suppose that Mσ. Then σ can be written as φ(a¯) where φ(x¯) is an L-formula and a¯A.

    By quantifier elimination, we have ψ(x¯) such that

    Tx¯(φ(x¯)ψ(x¯)).

    Now MT, so Mx¯(φ(x¯)ψ(x¯)), and Mφ(a¯). So Mψ(a¯). Now ψ(a¯)D(A) as MD(A). So Nψ(a¯), as ND(A). Hence Nφ(a¯) as NT (i.e. Nx¯(φ(x¯)ψ(x¯))). So Nσ.

  • (iii) (ii) Let M,NT, AM, AN. Let φ(x¯,y) be a quantifier free formula and let a¯A such that Myφ(a¯,y).

    As AM, AN, we have M,NTD(A), so by (iii) we have MLAN so Nφ(a¯,y).

  • (ii) (i) We want to show quantifier elimination.

    By Lemma 11.3, it is sufficient to show for φ(x¯,y) quantifier free, we can find ψ(x¯) quantifier free such that

    Tx¯(y,φ(x¯,y)ψ(x¯)).

    Let L=L{c1,,cn} where each ci is a new constant (with n=|x¯|). Let

    Γ={ψ(x¯):ψ(x¯) quantifier free formula such that Tx¯,(y,φ(x¯,y)ψ(x¯))}.

    In definable sets:

    PIC

    Claim: TΓy,φ(x¯,y).

    Proof: Suppose not. Then there is an L-structure

    NTΓ{¬y,φ(𝜀,y)}.

    Let ai=ciN, and let AN be the substructure generated by a1,,an in N.

    Then NT, AN, N¬y,φ(c¯,y). Any bA is of the form tN(a¯) for an L-term t (exercise).

    So D(A) can be viewed as an L-structure by replacing b̲ (b=tN(a¯)) with t(c¯) in L. Let

    Σ=TD(A){y,φ(x¯,y)}.

    IDEA: build MΣ, MTD(A) and My,φ(a¯,Y), contradicting (ii).

    Suffices to prove Σ is consistent.

    Assume Σ is inconsistent. Then by compactness we have ψ1(x¯),,ψn(x¯) quantifier free L-formulas with

    • ψ1(c¯),,ψm(c¯)D(A).

    • T{i=1mψi(c¯)}{y,φ(c¯,y)} is unsatisfiable.

    In definable sets:

    PIC

    Let ψ(x¯) be ¬i=1mψi(x¯), then Ty,φ(c¯,y)ψ(c¯).

    So Tx¯(y,φ(x¯,y)ψ(x¯)) so ψ(c¯)Γ. So Nψ(c¯) but also ND(A) (AN). Then

    Ni=1mψi(c¯)D(A)=¬ψ(c¯)

    contradiction. So by compactness, Σ is consistent.

    This proves the claim.

    Reminder: the claim was that TΓy,φ(x¯,y). So by compactness, there are ψ1(x¯),,ψm(x¯) quantifier free such that

    T{ψ(c¯),,ψm(c¯)}Γy,φ(x¯,y).

    Recall

    Tx¯(y,φ(x¯,y)i=1mψi(x¯))

    by choice of n. Let

    ψ(x¯)=i=1mψi(x¯).

    Then

    Tψ(c¯)y,φ(c¯,y)

    hence

    Tx¯(ψ(x¯)y,φ(x¯,y)).

    Thus Tx¯,(ψ(x¯)y,φ(x¯,y)).

Remark.

  • (1) In (iii) we may assume AMT, as otherwise TD(A) is inconsistent and hence trivially complete.
  • (2) In (ii) and (iii) we may assume A is finitely generated.