Math 2.0

Mathematical logic and foundations Theorem

Łoś–Tarski preservation theorem

Builds on TheoryModelSubstructureUniversal classCompactness theorem

Statement

Let σ\sigma be a first-order signature and let TT be a first-order theory in σ\sigma. Then the following are equivalent.

  1. The class of models of TT is closed under substructures: if B⊨TB \models T and AA is a substructure of BB, then A⊨TA \models T.
  2. There is a set UU of universal sentences of σ\sigma with the same models as TT; so the models of TT form a universal class.

Remarks

The direction from 2 to 1 holds because universal sentences pass from a structure to its substructures. For the other direction, let UU be the set of universal sentences that follow from TT, and let A⊨UA \models U. Expand the signature by a constant for each element of AA, and let DD be the set of quantifier-free sentences true in AA, its diagram. If T∪DT \cup D had no model, then by the compactness theorem TT would prove the negation of a finite conjunction from DD. Replacing the new constants by variables gives a universal sentence in UU that fails in AA. So T∪DT \cup D has a model BB, into which AA embeds, and condition 1 gives A⊨TA \models T.

A version for formulas holds too: a formula is preserved by substructures between models of TT exactly when it is equivalent modulo TT to a universal formula. Dually, the class of models of TT is closed under extensions exactly when TT is equivalent to a set of existential sentences.

Example: the theory of groups in the signature (⋅,−1,e)(\cdot, {}^{-1}, e) is closed under substructures, and the group axioms are indeed universal. In the signature (⋅)(\cdot) alone, a substructure of a group is only a subsemigroup, such as ℕ>0\N_{>0} in (ℤ,+)(\Z, +), and the axioms of groups in this signature need existential quantifiers.

The theorem uses compactness, and it fails when only finite structures are considered.

Going deeper

For a student

The Łoś–Tarski theorem is the first of the preservation theorems of model theory. Others in the same spirit are the Chang–Łoś–Suszko theorem, for unions of chains and ∀∃\forall\exists sentences, and Lyndon's theorem, for homomorphic images and positive sentences. In universal algebra it explains why an elementary class of algebras closed under subalgebras has a universal axiomatization. This is a first step towards the descriptions of quasivarieties and varieties. The proof method, realizing the diagram of a structure in a model of TT, is the method of diagrams used throughout model theory.

Reading path

To understand this page from the ground up, read these 8 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Model concept
  2. Satisfiability concept
  3. Sentence concept
  4. Substructure concept
  5. Theory concept
  6. Universal class concept
  7. Compactness theorem statement
  8. Łoś–Tarski preservation theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Łoś–Tarski_preservation_theorem
About this page
Tag9RN0KYXNT1
URIm2://9RN0KYXNT1
Kindstatement, theorem
WritingW0 stub
MSC03C40, 03C52
StatusThis copy of the site has no build data. Run m2 status 9RN0KYXNT1.
AboutUniversal class, Elementary class
UsesTheory, Model, Substructure, Universal class, Compactness theorem
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.