Compact space

In mathematics, and more specifically in general topology, compactness is a property that generalizes the notion of a subset of Euclidean space being closed (that is, containing all its limit points) and bounded (that is, having all its points lie within some fixed distance of each other). Examples include a closed interval, a rectangle, or a finite set of points. This notion is defined for more general topological spaces than Euclidean space in various ways.

One such generalization is that a space is sequentially compact if any infinite sequence of points sampled from the space must frequently (infinitely often) get arbitrarily close to some point of the space. An equivalent definition is that every sequence of points must have an infinite subsequence that converges to some point of the space. The Heine-Borel theorem states that a subset of Euclidean space is compact in this sequential sense if and only if it is closed and bounded. Thus, if one chooses an infinite number of points in the closed unit interval [0, 1] some of those points must get arbitrarily close to some real number in that space. For instance, some of the numbers 1/2, 4/5, 1/3, 5/6, 1/4, 6/7, … accumulate to 0 (others accumulate to 1). The same set of points would not accumulate to any point of the open unit interval (0, 1); so the open unit interval is not compact. Euclidean space itself is not compact since it is not bounded. In particular, the sequence of points 0, 1, 2, 3, … has no subsequence that converges to any given real number.

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.