7 Łoś’s Theorem and Consequences

Question, how does φ(∏⁡j∈JMj∕U) relate to [φ(Mj)j∈J]?

Theorem 7.1 (Los Lemma). Assuming that:

  • L a language

  • φ an L-formula

  • (Mj)j∈J=(Mj,Ij)j∈J a non-empty family of L-structures

  • U an ultrafilter on J

  • M=(∏⁡j∈JMj∕U,IU)

Then
φ(M)=[φ(Mj)j∈J].

Proof (sketch). Induction on

  • Complexity of terms

  • Formulas

(essentially Proposition 5.8). □

Corollary 7.2. Assuming that:

  • σ an L-sentence

  • (Mj)j∈J a family of non-empty L-structures

  • U an ultrafilter on J

  • M=∏⁡j∈JMj∕U

Then M⊨σ if and only if {j∈J:Mj⊨σ}∈U.

Proof.

  • ⇒ Suppose M⊨σ. Then σ(M) is a non-empty subset of M0, i.e. its the empty tuple (). So {[(σ(Mj))j∈J]}={()}. So
    {j∈J:()∈σ(Mj)}={j∈J:Mj⊨σ}.

    Since the LHS is in U, we get that the RHS is too.

  • ⇐ Similar □

Theorem 7.3 (Compactness – ultraproduct proof). Assuming that:

  • L a language

  • Σ a set of L-sentences

Then Σ is consistent if and only if every finite subset of Σ is consistent.

Proof.

  • ⇒ Clear.
  • ⇐ Assume every finite subset of Σ is consistent. Let J be the set of all finite subsets of Σ. For each j∈J, let
    ĵ={k∈J:j⊆k}.

    Let B={ĵ:j∈J} and let

    F={A⊆J:∃⁡B∈B,B⊆A}.

    Exercise: F is a filter.

    Let U be an ultrafilter extending F. For each j∈J, let Mj⊨j. Let M=(∏⁡j∈JMj∕U).

    Claim: M⊨Σ.

    Let σ∈Σ. Then {σ}∈J and {σ}^⊆{j∈J:Mj⊨σ}.

    So {j∈J:Mj⊨σ}∈U, so M⊨σ.

    So: ∀⁡σ∈Σ,M⊨σ. □