Building new worlds from old ones
An ultrafilter U on an index set I is a maximal filter -- a collection of "large" subsets closed under supersets and finite intersections, satisfying the ultra property: for every A ⊆ I, either A ∈ U or I\A ∈ U. On a finite set, every ultrafilter is principal, generated by a single element. Non-principal ultrafilters on infinite sets exist by Zorn's lemma and are the key to ultraproduct constructions.
Given a family of structures (Mᵢ) indexed by I and an ultrafilter U on I, the ultraproduct ∏Mᵢ/U has as its domain the set of equivalence classes of sequences under the relation "agree on a set in U." Two sequences (aᵢ) and (bᵢ) represent the same element of the ultraproduct precisely when { i ∈ I : aᵢ = bᵢ } ∈ U.
Łoś's Theorem is the fundamental transfer principle: a first-order sentence holds in the ultraproduct if and only if the set of indices where it holds in the factors belongs to the ultrafilter. When all factors are the same structure M, the ultraproduct is an ultrapower, and the diagonal embedding M → Mᴵ/U is elementary.
Construct an ultrafilter on a finite set by selecting which subsets are "large." The axioms are checked in real time: the filter must contain the whole set, be closed under supersets and finite intersections, and satisfy the ultra property. On a finite set, every ultrafilter turns out to be principal.
Build an ultrafilter on I = {1, 2, 3, 4, 5} by clicking subsets to mark them as "large." Or quick-fill a principal ultrafilter:
Key insight: An ultrafilter partitions all subsets into "large" and "small" with no ambiguity -- for every subset A, exactly one of A or its complement belongs to the ultrafilter. On a finite set this forces the ultrafilter to be principal, concentrating all "largeness" at a single point.
Take a sequence of structures, choose an ultrafilter, and watch the ultraproduct form. Elements of the product are sequences -- one entry from each factor. Two sequences that agree on a "large" set of indices (a set in the ultrafilter) become equivalent, merging into a single element of the ultraproduct.
Factor structures: M₁ = Z/2Z, M₂ = Z/3Z, M₃ = Z/5Z, M₄ = Z/7Z, M₅ = Z/11Z. Choose an ultrafilter and build the ultraproduct.
| Sequence | Z/2Z | Z/3Z | Z/5Z | Z/7Z | Z/11Z |
|---|---|---|---|---|---|
| zero | 0 | 0 | 0 | 0 | 0 |
| ones | 1 | 1 | 1 | 1 | 1 |
| p-1 | 1 | 2 | 4 | 6 | 10 |
| alternating | 0 | 1 | 0 | 1 | 0 |
| comp. alt. | 1 | 0 | 1 | 0 | 1 |
Key insight: The ultraproduct "averages" the factor structures through the lens of the ultrafilter. A principal ultrafilter at index k simply recovers Mₖ, but a non-principal ultrafilter blends all factors together, producing a genuinely new structure that shares first-order properties with "most" of the factors.
Choose a first-order sentence and see which factor structures satisfy it. The set of "true" indices is checked against the ultrafilter: if that set belongs to U, the sentence is true in the ultraproduct. This is the content of Łoś's fundamental transfer theorem.
Key insight: Łoś's Theorem is the engine behind ultraproduct arguments in model theory. It guarantees that truth transfers from the factors to the ultraproduct in a precise, formula-by-formula way. A sentence is true in ∏Mᵢ/U if and only if it is true in "U-almost all" of the factors.