Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-06T04:33:29.104Z Has data issue: false hasContentIssue false

10 - Isomorphic Ultrapowers

Published online by Cambridge University Press:  05 May 2013

C. Ward Henson
Affiliation:
University of Illinois, Urbana-Champaign
José Iovino
Affiliation:
University of Texas Health Science Center, San Antonio
Alexander S. Kechris
Affiliation:
California Institute of Technology
Edward Odell
Affiliation:
University of Texas, Austin
Get access

Summary

In this chapter we prove isomorphism theorems for ultrapowers and ultraproducts of normed space structures. These results show that there is a very tight connection between (a) properties that are preserved under the ultraproduct construction and (b) properties that are expressible using the logic for normed space structures that is described in this paper.

Let L be a signature and let ℳ and N be two normed space L-structures. If ℳ and N have isomorphic ultrapowers, by Corollary 9.4 they must be approximately elementarily equivalent. Theorem 10.7 below gives the converse (in a strong form). Together these results show that ultrapower equivalence of ℳ and N is the same as approximate elementary equivalence. (See the discussion of this issue in the Introduction.)

Theorem 10.8 below is a similar result for ultraproducts. Among other things, it shows that the ultrafilter guaranteed by Theorem 10.7 can be chosen in a highly uniform way and that the ultrapowers in question can be taken to be highly saturated. The uniformity will be exploited in Chapter 12 to prove the existence of ultrapowers that are highly homogeneous (in addition to being highly saturated).

The results in this chapter are analogous to the Keisler-Shelah Theorem in ordinary model theory. (See [She71] and Chapter 6 in [CK90].) Moreover, our proof follows a similar line of argument, with adjustments appropriate to the handling of positive bounded formulas and their approximations.

Type
Chapter
Information
Analysis and Logic , pp. 55 - 71
Publisher: Cambridge University Press
Print publication year: 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×