# Compactness theorem

﻿
Compactness theorem

In mathematical logic, the compactness theorem states that a set of first-order sentences has a model if and only if every finite subset of it has a model. This theorem is an important tool in model theory, as it provides a useful method for constructing models of any set of sentences that is finitely consistent.

The compactness theorem for the propositional calculus is a consequence of Tychonoff's theorem (which says that the product of compact spaces is compact) applied to compact Stone spaces; hence, the theorem's name. Likewise, it is analogous to the finite intersection property characterization of compactness in topological spaces: a collection of closed sets in a compact space has a non-empty intersection if every finite subcollection has a non-empty intersection.

The compactness theorem is one of the two key properties, along with the downward Löwenheim–Skolem theorem, that is used in Lindström's theorem to characterize first-order logic. Although there are some generalizations of the compactness theorem to non-first-order logics, the compactness theorem itself does not hold in them.

## Applications

The compactness theorem has many applications in model theory; a few typical results are sketched here.

The compactness theorem implies Robinson's principle: If a first-order sentence holds in every field of characteristic zero, then there exists a constant p such that the sentence holds for every field of characteristic larger than p. This can be seen as follows: suppose φ is a sentence that holds in every field of characteristic zero. Then its negation ¬φ, together with the field axioms and the infinite sequence of sentences 1+1 ≠ 0, 1+1+1 ≠ 0, … , is not satisfiable (because there is no field of characteristic 0 in which ¬φ holds, and the infinite sequence of sentences ensures any model would be a field of characteristic 0). Therefore, there is a finite subset A of these sentences that is not satisfiable. We can assume that A contains ¬φ, the field axioms, and, for some k, the first k sentences of the form 1+1+...+1 ≠ 0 (because adding more sentences doesn't change unsatisfiability). Let B contains all the sentences of A except ¬φ. Then any model of B is a field of characteristic greater than k, and ¬φ together with B is not satisfiable. This means that φ must hold in every model of B, which means precisely that φ holds in every field of characteristic greater than k.

A second application of the compactness theorem shows that any theory that has arbitrarily large finite models, or a single infinite model, has models of arbitrary large cardinality (this is the Upward Löwenheim–Skolem theorem). So, for instance, there are nonstandard models of Peano arithmetic with uncountably many 'natural numbers'. To achieve this, let T be the initial theory and let κ be any cardinal number. Add to the language of T one constant symbol for every element of κ. Then add to T a collection of sentences that say that the objects denoted by any two distinct constant symbols from the new collection are distinct (this is a collection of κ2 sentences). Since every finite subset of this new theory is satisfiable by a sufficiently large finite model of T, or by any infinite model, the entire extended theory is satisfiable. But any model of the extended theory has cardinality at least κ

A third application of the compactness theorem is the construction of nonstandard models of the real numbers, that is, consistent extensions of the theory of the real numbers that contain "infinitesimal" numbers. To see this, let Σ be a first-order axiomatization of the theory of the real numbers. Consider the theory obtained by adding a new constant symbol ε to the language and adjoining to Σ the axiom ε > 0 and the axioms ε < 1/n for all positive integers n. Clearly, the standard real numbers R are a model for every finite subset of these axioms, because the real numbers satisfy everything in Σ and, by suitable choice of ε, can be made to satisfy any finite subset of the axioms about ε. By the compactness theorem, there is a model *R that satisfies Σ and also contains an infinitesimal element ε. A similar argument, adjoining axioms ω > 0, ω > 1, etc., shows that the existence of infinitely large integers cannot be ruled out by any axiomatization Σ of the reals.

## Proofs

One can prove the compactness theorem using Gödel's completeness theorem, which establishes that a set of sentences is satisfiable if and only if no contradiction can be proven from it. Since proofs are always finite and therefore involve only finitely many of the given sentences, the compactness theorem follows. In fact, the compactness theorem is equivalent to Gödel's completeness theorem, and both are equivalent to the Boolean prime ideal theorem, a weak form of the axiom of choice.

Gödel originally proved the compactness theorem in just this way, but later some "purely semantic" proofs of the compactness theorem were found, i.e., proofs that refer to truth but not to provability. One of those proofs relies on ultraproducts hinging on the axiom of choice as follows:

Proof: Fix a first-order language L, and let Σ be a collection of L-sentences such that every finite subcollection of L-sentences, i ⊆ Σ of it has a model $\mathcal{M}_i$. Also let $\prod_{i \subseteq \Sigma}\mathcal{M}_i$ be the direct product of the structures and I be the collection of finite subsets of Σ. For each i in I let Ai := { jI : ji}. The family of all these sets Ai generates a filter, so there is an ultrafilter U containing all sets of the form Ai.

Now for any formula φ in Σ we have:

• the set A{φ} is in U
• whenever j ∈ A{φ}, then φ ∈ j, hence φ holds in $\mathcal M_j$
• the set of all j with the property that φ holds in $\mathcal M_j$ is a superset of A{φ}, hence also in U

Using Łoś's theorem we see that φ holds in the ultraproduct $\prod_{i \subseteq \Sigma}\mathcal{M}_i/U$. So this ultraproduct satisfies all formulas in Σ.

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• compactness theorem — Theorem stating that any collection of well formed formulae of a language has a model, if every finite subset of the collection has a model …   Philosophy dictionary

• Mahler's compactness theorem — In mathematics, Mahler s compactness theorem, proved by Kurt Mahler (1946), is a foundational result on lattices in Euclidean space, characterising sets of lattices that are bounded in a certain definite sense. Looked at another way, it… …   Wikipedia

• Mumford's compactness theorem — In mathematics, Mumford s compactness theorem states that the space of compact Riemann surfaces of fixed genus g > 1 with no closed geodesics of length less than some fixed ε > 0 in the Poincaré metric is compact. It was …   Wikipedia

• Barwise compactness theorem — In mathematical logic, the Barwise compactness theorem, named after Jon Barwise, is a generalization of the usual compactness theorem for first order logic to a certain class of infinitary languages. It was stated and proved by Barwise in… …   Wikipedia

• Gromov's compactness theorem — can refer to either of two mathematical theorems:* Gromov s compactness theorem (geometry) in Riemannian geometry * Gromov s compactness theorem (topology) in symplectic topology …   Wikipedia

• Gromov's compactness theorem (topology) — For Gromov s compactness theorem in Riemannian geometry, see that article. In symplectic topology, Gromov s compactness theorem states that a sequence of pseudoholomorphic curves in an almost complex manifold with a uniform energy bound must have …   Wikipedia

• Gromov's compactness theorem (geometry) — For Gromov s compactness theorem in symplectic topology, see that article. In Riemannian geometry, Gromov s (pre)compactness theorem states that the set of Riemannian manifolds of a given dimension, with Ricci curvature ≥ c and diameter ≤ D is… …   Wikipedia

• compactness — See compactly. * * * ▪ mathematics       in mathematics, property of some topological spaces (a generalization of Euclidean space) that has its main use in the study of functions defined on such spaces. An open covering of a space (or set) is a… …   Universalium

• Gödel's completeness theorem — is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability in first order logic. It was first proved by Kurt Gödel in 1929. A first order formula is called logically valid if… …   Wikipedia

• De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… …   Wikipedia