nLab
ultrapower

Contents

In model theory, an ultrapower of a structure with respect to an ultrafilter is a common method for creating new structures, with applications to nonstandard arithmetic and nonstandard analysis. It is a standard construction for constructing models which embody infinite and infinitesimal quantities, as in Abraham Robinson’s nonstandard analysis.

An ultrapower is a special case of ultraproduct; see the description under the sheaf-theoretic interpretation below.

Definition

Let XX be a set, and let 𝒰\mathcal{U} be an ultrafilter on XX; that is, a collection of subsets such that

  1. If A∈𝒰A \in \mathcal{U} and A⊆B⊆XA \subseteq B \subseteq X, then B∈𝒰B \in \mathcal{U},

  2. If A,B∈𝒰A, B \in \mathcal{U}, then A∩B∈𝒰A \cap B \in \mathcal{U},

  3. ∅∉𝒰\emptyset \notin \mathcal{U},

  4. For every set A⊆XA \subseteq X, either AA belongs to 𝒰\mathcal{U} or its complement ¬A\neg A belongs to 𝒰\mathcal{U}.

(The first three axioms are the defining axioms for a filter, and the last is satisfied for maximal filters, aka ultrafilters.)

Let YY be a model of a (finitary, single-sorted) first-order theory TT (given by a signature Σ\Sigma together with a set of axioms in the language generated by Σ\Sigma). Then the ultrapower

Y X/𝒰Y^X/\mathcal{U}

is the set of ∼\sim-equivalence classes [f][f] on the set of functions f∈hom(X,Y)f \in hom(X, Y), where f∼gf \sim g if and only if

{x∈X:f(x)=g(x)}∈𝒰.\{x \in X: f(x) = g(x)\} \in \mathcal{U}.

The ultrapower is a structure of Σ\Sigma under the evident pointwise definitions: for each nn-ary function symbol ϕ\phi, define

ϕ(f 1,…,f n)(x)=ϕ Y(f 1(x),…,f n(x))\phi(f_1, \ldots, f_n)(x) = \phi_Y(f_1(x), \ldots, f_n(x))

and observe that f 1∼g 1,…,f n∼g nf_1 \sim g_1, \ldots, f_n \sim g_n implies that ϕ(f 1,…,f n)∼ϕ(g 1,…,g n)\phi(f_1, \ldots, f_n) \sim \phi(g_1, \ldots, g_n), so that the interpretation of ϕ\phi descends to equivalence classes. Similarly, for each nn-ary relation symbol RR, say ⊢R([f 1],…,[f n])\vdash R([f_1], \ldots, [f_n]) if

{x∈X:⊢ YR(f 1(x),…,f n(x))}∈𝒰\{x \in X: \vdash_Y R(f_1(x), \ldots, f_n(x))\} \in \mathcal{U}

for any chosen representatives f 1,…,f nf_1, \ldots, f_n. Note that the well-definedness of the interpretations of functions and relations depends only on the filter axioms.

That the ultrapower is a model of the theory is a consequence of Los’s theorem. (Here one needs all of the ultrafilter conditions, in particular one needs condition 4 in order to accommodate satisfaction of formulas involving instances of negation.)

Sheaf-theoretic interpretation

An ultrafilter 𝒰\mathcal{U} on a set XX may be regarded as a point in the Stone-Cech compactification βX\beta X of the discrete space X dX_d, and ultrapowers may be interpreted as a special case of taking stalks.

Namely, let i:X d↪βXi: X_d \hookrightarrow \beta X be the inclusion. This is a continuous function; hence it induces a geometric morphism i *i_* between the sheaf toposes over these spaces. Then, under the composite

Set→ΔSet/X≅Sh(X d)→i *Sh(βX)→stalk 𝒰Set,Set \stackrel{\Delta}{\to} Set/X \cong Sh(X_d) \stackrel{i_*}{\to} Sh(\beta X) \stackrel{stalk_{\mathcal{U}}}{\to} Set,

the set YY is taken to the ultrapower Y X/𝒰Y^X/\mathcal{U}.

An object of Set/XSet/X is just an XX-indexed collection Y xY_x of sets, and the more general ultraproduct ∏ xY x/𝒰\prod_x Y_x/\mathcal{U} is the value obtained by applying the composite

Set/X≅Sh(X d)→i *Sh(βX)→stalk 𝒰SetSet/X \cong Sh(X_d) \stackrel{i_*}{\to} Sh(\beta X) \stackrel{stalk_{\mathcal{U}}}{\to} Set

to the object ⟨Y x⟩ x∈X\langle Y_x \rangle_{x \in X}.

Filterquotient construction

For any filter 𝒰\mathcal{U} on a set XX, we can form the 2-colimit of the pseudofunctor

F:𝒰 op→Cat:U↦Set/UF: \mathcal{U}^{op} \to Cat: U \mapsto Set/U

Each F(i:U⊆V):Set/V→Set/UF(i: U \subseteq V): Set/V \to Set/U is the logical morphism of toposes given by the pullback functor i *i^*. The 2-colimit is itself a topos denoted Set/𝒰Set/\mathcal{U}, in fact a 2-valued topos if 𝒰\mathcal{U} is an ultrafilter, and the functor defined by

Set→ΔSet/X→Set/𝒰Set \stackrel{\Delta}{\to} Set/X \to Set/\mathcal{U}

defines a logical morphism.

Let Y 𝒰Y_{\mathcal{U}} denote the image of a set YY under this logical morphism. Then the set of global elements

Γ(Y 𝒰)=hom(1,Y 𝒰)\Gamma(Y_{\mathcal{U}}) = hom(1, Y_{\mathcal{U}})

is the ultrapower Y X/𝒰Y^X/\mathcal{U}. (Hm, is that right?)

Applications

If 𝒰\mathcal{U} is a principal ultrafilter, then the ultrapower of YY is isomorphic to YY again. Thus the interest in ultrapowers relies on the existence of non-principal ultrafilters, which requires some sort of choice principle.

An important application is to Y=ℝY = \mathbb{R} as a model of the theory of ordered fields. If 𝒰\mathcal{U} is a non-principal ultrafilter on the set of natural numbers ℕ\mathbb{N}, then the model ℝ ℕ/𝒰\mathbb{R}^{\mathbb{N}}/\mathcal{U} provides a model for nonstandard analysis (in the sense promulgated by Abraham Robinson). There are in particular infinitesimal elements in the ultrapower, for example the ∼\sim-equivalence class of the sequence ⟨1/n⟩ n∈ℕ∈ℝ ℕ\langle 1/n \rangle_{n \in \mathbb{N}} \in \mathbb{R}^{\mathbb{N}}.

At the same time, the ultrapower is elementarily equivalent to ℝ\mathbb{R}, so that the sentences true for ℝ\mathbb{R} in the first-order theory of ordered fields coincide with the sentences that are true for the ultrapower. This principle assures us that any conclusions adduced with the help of infinitesimals in the ultrapower are still valid in the standard model ℝ\mathbb{R}; in some cases, however, the arguments based on infinitesimals may offer more perspicuous proofs.

Revised on November 13, 2010 15:53:54 by Tim Porter (95.147.236.84)