nLab
hyperimaginary element

Contents

Contents

Definition

An imaginary element of a (finitary) first-order theory is an equivalence class X/EX/E of a (finitary first-order) definable set XX quotiented by a (finitary first-order) definable equivalence relation EE. A hyperimaginary is an equivalence class X/EX/E of a type-definable XX quotiented by a type-definable equivalence relation EE.

Examples

The prototypical example of a hyperimaginary is an equivalence class of the quotient of the hyperreal numbers by the equivalence relation “xx is infinitesimally close to yy”, which is definable by the countable conjunction (|xy|<1n) n\left( \left| x - y \right| &lt; \frac{1}{n} \right)_{n \in \mathbb{N}}.

Elimination of hyperimaginaries

Let X/EX/E be a hyperimaginary. TT is said to eliminate the hyperimaginary X/EX/E (c.f. elimination of imaginaries) if X/EX/E is interdefinable with a sequence of imaginaries, i.e. if every type-definable equivalence relation is, in fact, a conjunction of definable equivalence relations.

Stable theories? eliminate

hyperimaginaries. This is related to a result of Hrushovski’s that in a stable theory, (pro-definable) groupoids are pro-(definable groupoids).

Properties

  • In the same way that the automorphism group Aut(M)\operatorname{Aut}(M) of a model acts on imaginaries, Aut(M)\operatorname{Aut}(M) acts on hyperimaginaries.

  • Any hyperimaginary X/EX/E in the sense of the previous paragraph can be extended to a quotient of the entire model M αM^{\alpha} (in the (possibly infinitary) sort α\alpha of EE) by a type-definable equivalence relation EE' obtained by preserving EE on XX and extending it to be the discrete equivalence relation on M α\XM^{\alpha} \backslash X. In symbols, E=df(E(x,y)(x,y)X×X)(x=y)E' \overset{\operatorname{df}}{=} (E(x,y) \wedge (x,y) \in X \times X) \vee (x = y). (This is a special case of the fact that finite disjunctions of type-definable sets are again type-definable. It is not true that arbitrary disjunctions of type-definable sets are again type-definable, since Aut(𝕄)\operatorname{Aut}(\mathbb{M})-invariant subsets of 𝕄\mathbb{M} the monster model have this form.)

  • The process of taking points of hyperimaginaries in models (MM(X/E)M \mapsto M(X/E)) does not commute with ultraproducts. For example, if EE is the equivalence relation in the reals of being infinitesimally close together, it’s easy to see that 𝒰/E¬(/E) 𝒰\mathbb{R}^{\mathcal{U}}/E \not \simeq \left(\mathbb{R}/E \right)^{\mathcal{U}}, since /E\mathbb{R}/E \simeq \mathbb{R} (after all, the real numbers are Hausdorff) so that the right hand side is the nonstandard reals *^* \mathbb{R} again (so every number has a cloud of infinitesimals around it) while the left hand side has no points which are infinitesimally close together.

Remark

This is actually an excellent example of why we shouldn’t expect in general the process of taking points of hyperimaginaries in a model to commute with ultraproducts: on one hand, if EE is a type-definable equivalence relation on XX, and 𝒰\mathcal{U} an ultrafilter, then computing ( iIM i/𝒰)(X/E)\left(\prod_{i \in I} M_i/\mathcal{U} \right)(X/E) yields EE-equivalence classes of germs [m i] 𝒰[m_i]_{\mathcal{U}}. That is, for every condition φ(x 1,x 2)\varphi(x_1, x_2) in EE that needs to be checked to conclude that two tuples are EE-equivalent, every pair of EE-equivalent germs [m i] 𝒰[m_i]_{\mathcal{U}} and [n i] 𝒰[n_i]_{\mathcal{U}} agree on φ\varphi on some subset PIP \subseteq I for PP in 𝒰\mathcal{U}.But these PPs depend on φ\varphi. They aren’t uniform, and there’s possibly no set PP' in the ultrafilter (the intersection of all the PP‘s might be empty) on which one could decide if [m i][m_i] and [n i][n_i] are EE-equivalent for every condition φE\varphi \in E.

On the other hand, one could try computing ( iIM i(X/E))/𝒰\left( \prod_{i \in I} M_i(X/E) \right) /\mathcal{U}. One ends up instead with germs of hyperimaginaries, as in [[m i] E] 𝒰[[m_i]_E]_{\mathcal{U}}, but this is a tighter equivalence relation: ([x i] E) i([x_i]_E)_i and ([y i] E) i)([y_i]_E)_i) are 𝒰\mathcal{U}-equivalent if and only if there is a single P𝒰P \in \mathcal{U}, uniform for every iPi \in P and for every φE\varphi \in E so that M iφ(x i,y i)M_i \models \varphi(x_i, y_i). This means that the commutation of these two procedures should fail precisely when the PP‘s on the left hand side intersect to something outside of the ultrafilter.

Indeed, in the example we first mentioned, consider the sequences (1,2,3,)(1, 2, 3, \dots) and (1+1/2,2+1/3,3+1/4,)(1 + 1/2, 2 + 1/3, 3 + 1/4, \dots). If we take them mod-𝒰\mathcal{U}, then mod-EE, then they are equivalent as hyperimaginaries in *^*\mathbb{R}, since for each condition “x is less than 1/n1/n away from y”, these two sequences agree cofinitely many times (and every ultrafilter contains the cofinite filter). But these cofinite sets of indices are getting smaller and smaller and intersect to \emptyset. And if we take them mod-EE, then mod-𝒰\mathcal{U}, they remain distinct.

Related concepts

References

  • Frank Wagner, Simple Theories (2000)

  • Byunghan Kim, Simplicity Theory (2014)

  • Enrique Casanovas, Simple theories and hyperimaginaries (2011)

Last revised on June 20, 2017 at 15:34:54. See the history of this page for a list of all contributions to it.