DOCSLIB.ORG

Ultraproducts and Their Applications

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

© COPYRIGHT by Amanda Purcell 2013 ALL RIGHTS RESERVED ULTRAPRODUCTS AND THEIR APPLICATIONS BY Amanda Purcell ABSTRACT An ultraproduct is a mathematical construction used primarily in abstract algebra and model theory to create a new structure by reducing a product of a family of existing structures using a class of objects referred to as filters. This thesis provides a rigorous construction of ultraproducts and investigates some of their applications in the fields of mathematical logic, nonstandard analysis, and complex analysis. An introduction to basic set theory is included and used as a foundation for the ultraproduct construction. It is shown how to use this method on a family of models of first order logic to construct a new model of first order logic, with which one can produce a proof of the Compactness Theorem that is both elegant and robust. Next, an ultraproduct is used to offer a bridge between intuition and the formalization of nonstandard analysis by providing concrete infinite and infinitesimal elements. Finally, a proof of the Ax- Grothendieck Theorem is provided in which the ultraproduct and other previous results play a critical role. Rather than examining one in depth application, this text features ultraproducts as tools to solve problems across various disciplines. ii ACKNOWLEDGMENTS I would like to give very special thanks to my advisor, Professor Ali Enayat, whose expertise, understanding, and patience, were invaluable to my pursuit of a degree in mathematics. His vast knowledge and passion for teaching inspired me throughout my collegiate and graduate career and will continue to do so. iii TABLE OF CONTENTS ABSTRACT .................................................................................................................................... ii ACKNOWLEDGMENTS ............................................................................................................. iii Chapter 1. INTRODUCTION .......................................................................................................... 1 2. FILTERS, ULTRAFILTERS, AND REDUCED PRODUCTS ..................................... 3 3. ULTRAPRODUCTS AND COMPACTNESS ............................................................ 16 4. ULTRAPRODUCTS AND NONSTANDARD UNIVERSES .................................... 31 5. THE AX-GROTHENDIECK THEOREM ................................................................... 47 BIBLIOGRAPHY ......................................................................................................................... 59 iv CHAPTER 1 INTRODUCTION The ultraproduct construction is a method used primarily in model theory and abstract algebra that creates a new structure by reducing a Cartesian product of existing structures. Its value stems from the ability for one to determine properties of the ultraproduct based solely on the properties of the structures within the reduced product and the equivalence relation by which it is reduced. The ultraproduct is attractive in its algebraic nature and the fact that it can be constructed using only basic set theoretic concepts. This thesis begins (Chapter 2) with an outline of the set theory required for the construction of ultraproducts beginning with filters (specific sets of sets). It includes important observations on the existence and uses of certain filters before providing the step-by-step construction of reduced products and describing their elements. This chapter provides the foundation for all applications of ultraproducts discussed ahead. To be able to define the notion of an ultraproduct, and to be able to understand its properties, it is necessary to provide a brief introduction to model theory, which comes in the beginning of Chapter 3. Chapter 3 then defines an ultrapoduct of models and the elements, functions, and relations on this new object. Next, this chapter instructs how to interpret sentences of first order logic in the ultraproduct model by proving the ever-important and applicable Łos’s´ Theorem which will recur throughout the text. Ultimately, Chapter 3 provides a proof of the Compactness Theorem, one of the most fundamental results in first order logic. Chapter 4 then changes gears to provide an examination of basic nonstandard analysis using the tools and elements of ultraproducts developed in earlier sections. The ultraproduct construction allows us to build ordered "nonarchimedean" fields, i.e., fields 1 2 that contain, as concrete objects, infinitely small quantities as well as infinitely large ones. Moreover, these nonarchimedean fields are shown to satisfy the same first order sentences as those that are true in the ordered field of real numbers. In chapter 4 we employ the aforementioned nonarchimedean fields to provide a new way of establishing a number of classical results in Calculus in an intuitively clear manner, with the explicit, unabashed use of infinitesimals. The final chapter (5) offers a proof of the Ax-Grothendieck Theorem, alternative to the proof from Walter Rudin [1] utilizing techniques of complex analysis. This final part highlights the rather metamathematical method of proof used a great deal in disciplines of advanced mathematics: the method in which one takes a problem from some specific area, maps the relevant pieces to a different universe in which the problem can be solved, and maps back to complete the proof. In the end, it should be clear to the reader that the ultraproduct model is not only interesting in and of itself, but is a very powerful tool that can provide answers, or methods to obtain them, in many other disciplines outside of model theory. 3 CHAPTER 2 FILTERS, ULTRAFILTERS, AND REDUCED PRODUCTS Set Theory and Construction of Filters We begin with a few basic set theoretic concepts that will be useful in our construction of filters, and ultimately in the construction of ultraproducts. • The powerset of a set X, denoted P(X), is the set of all possible subsets of X. For example, for X = fA;Bg, the powerset of X would be written P(X) = f/0;fAg;fBg;fA;Bgg, where /0denotes the “empty set,” the unique set containing no elements. • A is a subset of a set X, or X contains A (written A ⊆ X), if every element of A is also an element of X. • The union of two sets, A and B, denoted A [ B, is the collection of elements that are in A, in B, or in both A and B. • The intersection of two sets A and B, denoted A \B, is the collection of elements that are in both A and B. • The complement of a set A in relation to a background set X where A ⊆ X, denoted XnA, is the set of all elements of X that are not in the subset A. For purposes that arise in a later section, it is also important to understand the concept of cardinality. The cardinality of a set X, denoted jXj, is the number of elements in the set; numbers representing the cardinality of sets are called “cardinal numbers.” For example, the cardinality of the natural numbers (N) is ℵ0, the first infinite cardinal number. The ℵ ℵ cardinality of the real numbers (R) is 2 0 , where 2 0 > ℵ0 by a classical theorem of Cantor. 4 Armed with these basic set theoretic concepts, we are now equipped to discuss the first class of objects important to our construction of the ultraproduct: filters. Definition 1. Let X be a nonempty set. A filter F over X is a nonempty family of sets F ⊆ P(X) such that: (i) if A; B 2 F , then A \ B 2 F , and (ii) if A 2 F and A ⊆ B ⊆ X, then B 2 F . In other words, F is a set of subsets of X that is closed under intersections and supersets. For example, F = P(X) is a filter over X; this is called the “improper filter.” The set containing only X itself, fXg, also forms a filter, called the “trivial filter.” All other filters are referred to as “proper nontrivial filters.” Proposition 2. A filter F is proper if and only if /0 2= F . Proof. We prove the ) direction by way of contradiction. Suppose that F is a proper filter over X and that /0 2 F . As all subsets A ⊆ X contain /0, (/0 ⊆ A ⊆ X) ) (A 2 F ); for all A ⊆ X, and every possible subset of X is a member of F by upward closure. Therefore F = P(X), and F must be improper, contradicting our assumption. Hence, for any proper filter F over a set X, we have /0 2= F . The proof of the ( direction is trivial. Also note that for all filters F over X, the background set X will be a member of the filter F . Given that F is nonempty by definition, let A 2 F for some A ⊆ X. By upward closure, we have (A ⊆ X) ) (X 2 F ); 5 and X 2 F for all filters F over X. Some examples of proper filters include: • The principal filter: Fix some element i0 2 X, and consider the family of subsets fA ⊆ X ji0 2 Ag. This defines a filter over X, and is referred to as the principal filter generated by i0. Any filter that is not principal is referred to as free. • The Fréchet filter: Let X be an infinite set, and let F = fA ⊆ X jXnA is finiteg; i.e., the set of all co-finite subsets of X. This filter is called the Fréchet filter, a very important filter that will be utilized later. Before we can discuss more interesting properties about filters, we must first define the following property: Definition 3. A set F of subsets of X is said to have the finite intersection property, or f.i.p., if the intersection of any finite number of those subsets is nonempty, i.e., A1 \ A2 \ ::: \ An 6= /0 for Ai 2 F , 1 ≤ i ≤ n, and n 2 N. We claim that any proper filter has f.i.p., and for any set of subsets that has f.i.p., there exists a proper filter containing that set. Before we prove our claim, consider our examples of proper filters above. The principal filter generated by i0 clearly has f.i.p. as i0 will be a member of every set in the filter, and thus a member of any finite intersection.
Recommended publications
  • The Fundamental Theorem of Calculus for Lebesgue Integral

    The Fundamental Theorem of Calculus for Lebesgue Integral

    Divulgaciones Matem´aticasVol. 8 No. 1 (2000), pp. 75{85 The Fundamental Theorem of Calculus for Lebesgue Integral El Teorema Fundamental del C´alculo para la Integral de Lebesgue Di´omedesB´arcenas([email protected]) Departamento de Matem´aticas.Facultad de Ciencias. Universidad de los Andes. M´erida.Venezuela. Abstract In this paper we prove the Theorem announced in the title with- out using Vitali's Covering Lemma and have as a consequence of this approach the equivalence of this theorem with that which states that absolutely continuous functions with zero derivative almost everywhere are constant. We also prove that the decomposition of a bounded vari- ation function is unique up to a constant. Key words and phrases: Radon-Nikodym Theorem, Fundamental Theorem of Calculus, Vitali's covering Lemma. Resumen En este art´ıculose demuestra el Teorema Fundamental del C´alculo para la integral de Lebesgue sin usar el Lema del cubrimiento de Vi- tali, obteni´endosecomo consecuencia que dicho teorema es equivalente al que afirma que toda funci´onabsolutamente continua con derivada igual a cero en casi todo punto es constante. Tambi´ense prueba que la descomposici´onde una funci´onde variaci´onacotada es ´unicaa menos de una constante. Palabras y frases clave: Teorema de Radon-Nikodym, Teorema Fun- damental del C´alculo,Lema del cubrimiento de Vitali. Received: 1999/08/18. Revised: 2000/02/24. Accepted: 2000/03/01. MSC (1991): 26A24, 28A15. Supported by C.D.C.H.T-U.L.A under project C-840-97. 76 Di´omedesB´arcenas 1 Introduction The Fundamental Theorem of Calculus for Lebesgue Integral states that: A function f :[a; b] R is absolutely continuous if and only if it is ! 1 differentiable almost everywhere, its derivative f 0 L [a; b] and, for each t [a; b], 2 2 t f(t) = f(a) + f 0(s)ds: Za This theorem is extremely important in Lebesgue integration Theory and several ways of proving it are found in classical Real Analysis.
  • An Axiomatic Approach to Physical Systems

    An Axiomatic Approach to Physical Systems

    ' An Axiomatic Approach $ to Physical Systems & % Januari 2004 ❦ ' Summary $ Mereology is generally considered as a formal theory of the part-whole relation- ship concerning material bodies, such as planets, pickles and protons. We argue that mereology can be considered more generally as axiomatising the concept of a physical system, such as a planet in a gravitation-potential, a pickle in heart- burn and a proton in an electro-magnetic field. We design a theory of sets and physical systems by extending standard set-theory (ZFC) with mereological axioms. The resulting theory deductively extends both `Mereology' of Tarski & L`esniewski as well as the well-known `calculus of individuals' of Leonard & Goodman. We prove a number of theorems and demonstrate that our theory extends ZFC con- servatively and hence equiconsistently. We also erect a model of our theory in ZFC. The lesson to be learned from this paper reads that not only is a marriage between standard set-theory and mereology logically respectable, leading to a rigorous vin- dication of how physicists talk about physical systems, but in addition that sets and physical systems interact at the formal level both quite smoothly and non- trivially. & % Contents 0 Pre-Mereological Investigations 1 0.0 Overview . 1 0.1 Motivation . 1 0.2 Heuristics . 2 0.3 Requirements . 5 0.4 Extant Mereological Theories . 6 1 Mereological Investigations 8 1.0 The Language of Physical Systems . 8 1.1 The Domain of Mereological Discourse . 9 1.2 Mereological Axioms . 13 1.2.0 Plenitude vs. Parsimony . 13 1.2.1 Subsystem Axioms . 15 1.2.2 Composite Physical Systems .
  • On the Boundary Between Mereology and Topology

    On the Boundary Between Mereology and Topology

    On the Boundary Between Mereology and Topology Achille C. Varzi Istituto per la Ricerca Scientifica e Tecnologica, I-38100 Trento, Italy [email protected] (Final version published in Roberto Casati, Barry Smith, and Graham White (eds.), Philosophy and the Cognitive Sciences. Proceedings of the 16th International Wittgenstein Symposium, Vienna, Hölder-Pichler-Tempsky, 1994, pp. 423–442.) 1. Introduction Much recent work aimed at providing a formal ontology for the common-sense world has emphasized the need for a mereological account to be supplemented with topological concepts and principles. There are at least two reasons under- lying this view. The first is truly metaphysical and relates to the task of charac- terizing individual integrity or organic unity: since the notion of connectedness runs afoul of plain mereology, a theory of parts and wholes really needs to in- corporate a topological machinery of some sort. The second reason has been stressed mainly in connection with applications to certain areas of artificial in- telligence, most notably naive physics and qualitative reasoning about space and time: here mereology proves useful to account for certain basic relation- ships among things or events; but one needs topology to account for the fact that, say, two events can be continuous with each other, or that something can be inside, outside, abutting, or surrounding something else. These motivations (at times combined with others, e.g., semantic transpar- ency or computational efficiency) have led to the development of theories in which both mereological and topological notions play a pivotal role. How ex- actly these notions are related, however, and how the underlying principles should interact with one another, is still a rather unexplored issue.
  • [Math.FA] 3 Dec 1999 Rnfrneter for Theory Transference Introduction 1 Sas Ihnrah U Twl Etetdi Eaaepaper

    [Math.FA] 3 Dec 1999 Rnfrneter for Theory Transference Introduction 1 Sas Ihnrah U Twl Etetdi Eaaepaper

    Transference in Spaces of Measures Nakhl´eH. Asmar,∗ Stephen J. Montgomery–Smith,† and Sadahiro Saeki‡ 1 Introduction Transference theory for Lp spaces is a powerful tool with many fruitful applications to sin- gular integrals, ergodic theory, and spectral theory of operators [4, 5]. These methods afford a unified approach to many problems in diverse areas, which before were proved by a variety of methods. The purpose of this paper is to bring about a similar approach to spaces of measures. Our main transference result is motivated by the extensions of the classical F.&M. Riesz Theorem due to Bochner [3], Helson-Lowdenslager [10, 11], de Leeuw-Glicksberg [6], Forelli [9], and others. It might seem that these extensions should all be obtainable via transference methods, and indeed, as we will show, these are exemplary illustrations of the scope of our main result. It is not straightforward to extend the classical transference methods of Calder´on, Coif- man and Weiss to spaces of measures. First, their methods make use of averaging techniques and the amenability of the group of representations. The averaging techniques simply do not work with measures, and do not preserve analyticity. Secondly, and most importantly, their techniques require that the representation is strongly continuous. For spaces of mea- sures, this last requirement would be prohibitive, even for the simplest representations such as translations. Instead, we will introduce a much weaker requirement, which we will call ‘sup path attaining’. By working with sup path attaining representations, we are able to prove a new transference principle with interesting applications. For example, we will show how to derive with ease generalizations of Bochner’s theorem and Forelli’s main result.
  • A Translation Approach to Portable Ontology Specifications

    A Translation Approach to Portable Ontology Specifications

    Knowledge Systems Laboratory September 1992 Technical Report KSL 92-71 Revised April 1993 A Translation Approach to Portable Ontology Specifications by Thomas R. Gruber Appeared in Knowledge Acquisition, 5(2):199-220, 1993. KNOWLEDGE SYSTEMS LABORATORY Computer Science Department Stanford University Stanford, California 94305 A Translation Approach to Portable Ontology Specifications Thomas R. Gruber Knowledge System Laboratory Stanford University 701 Welch Road, Building C Palo Alto, CA 94304 [email protected] Abstract To support the sharing and reuse of formally represented knowledge among AI systems, it is useful to define the common vocabulary in which shared knowledge is represented. A specification of a representational vocabulary for a shared domain of discourse — definitions of classes, relations, functions, and other objects — is called an ontology. This paper describes a mechanism for defining ontologies that are portable over representation systems. Definitions written in a standard format for predicate calculus are translated by a system called Ontolingua into specialized representations, including frame-based systems as well as relational languages. This allows researchers to share and reuse ontologies, while retaining the computational benefits of specialized implementations. We discuss how the translation approach to portability addresses several technical problems. One problem is how to accommodate the stylistic and organizational differences among representations while preserving declarative content. Another is how
  • Model Theory and Ultraproducts

    Model Theory and Ultraproducts

    P. I. C. M. – 2018 Rio de Janeiro, Vol. 2 (101–116) MODEL THEORY AND ULTRAPRODUCTS M M Abstract The article motivates recent work on saturation of ultrapowers from a general math- ematical point of view. Introduction In the history of mathematics the idea of the limit has had a remarkable effect on organizing and making visible a certain kind of structure. Its effects can be seen from calculus to extremal graph theory. At the end of the nineteenth century, Cantor introduced infinite cardinals, which allow for a stratification of size in a potentially much deeper way. It is often thought that these ideas, however beautiful, are studied in modern mathematics primarily by set theorists, and that aside from occasional independence results, the hierarchy of infinities has not profoundly influenced, say, algebra, geometry, analysis or topology, and perhaps is not suited to do so. What this conventional wisdom misses is a powerful kind of reflection or transmutation arising from the development of model theory. As the field of model theory has developed over the last century, its methods have allowed for serious interaction with algebraic geom- etry, number theory, and general topology. One of the unique successes of model theoretic classification theory is precisely in allowing for a kind of distillation and focusing of the information gleaned from the opening up of the hierarchy of infinities into definitions and tools for studying specific mathematical structures. By the time they are used, the form of the tools may not reflect this influence. However, if we are interested in advancing further, it may be useful to remember it.
  • Generalizations of the Riemann Integral: an Investigation of the Henstock Integral

    Generalizations of the Riemann Integral: an Investigation of the Henstock Integral

    Generalizations of the Riemann Integral: An Investigation of the Henstock Integral Jonathan Wells May 15, 2011 Abstract The Henstock integral, a generalization of the Riemann integral that makes use of the δ-fine tagged partition, is studied. We first consider Lebesgue’s Criterion for Riemann Integrability, which states that a func- tion is Riemann integrable if and only if it is bounded and continuous almost everywhere, before investigating several theoretical shortcomings of the Riemann integral. Despite the inverse relationship between integra- tion and differentiation given by the Fundamental Theorem of Calculus, we find that not every derivative is Riemann integrable. We also find that the strong condition of uniform convergence must be applied to guarantee that the limit of a sequence of Riemann integrable functions remains in- tegrable. However, by slightly altering the way that tagged partitions are formed, we are able to construct a definition for the integral that allows for the integration of a much wider class of functions. We investigate sev- eral properties of this generalized Riemann integral. We also demonstrate that every derivative is Henstock integrable, and that the much looser requirements of the Monotone Convergence Theorem guarantee that the limit of a sequence of Henstock integrable functions is integrable. This paper is written without the use of Lebesgue measure theory. Acknowledgements I would like to thank Professor Patrick Keef and Professor Russell Gordon for their advice and guidance through this project. I would also like to acknowledge Kathryn Barich and Kailey Bolles for their assistance in the editing process. Introduction As the workhorse of modern analysis, the integral is without question one of the most familiar pieces of the calculus sequence.
  • Stability in the Almost Everywhere Sense: a Linear Transfer Operator Approach ∗ R

    Stability in the Almost Everywhere Sense: a Linear Transfer Operator Approach ∗ R

    CORE Metadata, citation and similar papers at core.ac.uk Provided by Elsevier - Publisher Connector J. Math. Anal. Appl. 368 (2010) 144–156 Contents lists available at ScienceDirect Journal of Mathematical Analysis and Applications www.elsevier.com/locate/jmaa Stability in the almost everywhere sense: A linear transfer operator approach ∗ R. Rajaram a, ,U.Vaidyab,M.Fardadc, B. Ganapathysubramanian d a Dept. of Math. Sci., 3300, Lake Rd West, Kent State University, Ashtabula, OH 44004, United States b Dept. of Elec. and Comp. Engineering, Iowa State University, Ames, IA 50011, United States c Dept. of Elec. Engineering and Comp. Sci., Syracuse University, Syracuse, NY 13244, United States d Dept. of Mechanical Engineering, Iowa State University, Ames, IA 50011, United States article info abstract Article history: The problem of almost everywhere stability of a nonlinear autonomous ordinary differential Received 20 April 2009 equation is studied using a linear transfer operator framework. The infinitesimal generator Available online 20 February 2010 of a linear transfer operator (Perron–Frobenius) is used to provide stability conditions of Submitted by H. Zwart an autonomous ordinary differential equation. It is shown that almost everywhere uniform stability of a nonlinear differential equation, is equivalent to the existence of a non-negative Keywords: Almost everywhere stability solution for a steady state advection type linear partial differential equation. We refer Advection equation to this non-negative solution, verifying almost everywhere global stability, as Lyapunov Density function density. A numerical method using finite element techniques is used for the computation of Lyapunov density. © 2010 Elsevier Inc. All rights reserved. 1. Introduction Stability analysis of an ordinary differential equation is one of the most fundamental problems in the theory of dynami- cal systems.
  • Connes on the Role of Hyperreals in Mathematics

    Connes on the Role of Hyperreals in Mathematics

    Found Sci DOI 10.1007/s10699-012-9316-5 Tools, Objects, and Chimeras: Connes on the Role of Hyperreals in Mathematics Vladimir Kanovei · Mikhail G. Katz · Thomas Mormann © Springer Science+Business Media Dordrecht 2012 Abstract We examine some of Connes’ criticisms of Robinson’s infinitesimals starting in 1995. Connes sought to exploit the Solovay model S as ammunition against non-standard analysis, but the model tends to boomerang, undercutting Connes’ own earlier work in func- tional analysis. Connes described the hyperreals as both a “virtual theory” and a “chimera”, yet acknowledged that his argument relies on the transfer principle. We analyze Connes’ “dart-throwing” thought experiment, but reach an opposite conclusion. In S, all definable sets of reals are Lebesgue measurable, suggesting that Connes views a theory as being “vir- tual” if it is not definable in a suitable model of ZFC. If so, Connes’ claim that a theory of the hyperreals is “virtual” is refuted by the existence of a definable model of the hyperreal field due to Kanovei and Shelah. Free ultrafilters aren’t definable, yet Connes exploited such ultrafilters both in his own earlier work on the classification of factors in the 1970s and 80s, and in Noncommutative Geometry, raising the question whether the latter may not be vulnera- ble to Connes’ criticism of virtuality. We analyze the philosophical underpinnings of Connes’ argument based on Gödel’s incompleteness theorem, and detect an apparent circularity in Connes’ logic. We document the reliance on non-constructive foundational material, and specifically on the Dixmier trace − (featured on the front cover of Connes’ magnum opus) V.
  • First Order Logic and Nonstandard Analysis

    First Order Logic and Nonstandard Analysis

    First Order Logic and Nonstandard Analysis Julian Hartman September 4, 2010 Abstract This paper is intended as an exploration of nonstandard analysis, and the rigorous use of infinitesimals and infinite elements to explore properties of the real numbers. I first define and explore first order logic, and model theory. Then, I prove the compact- ness theorem, and use this to form a nonstandard structure of the real numbers. Using this nonstandard structure, it it easy to to various proofs without the use of limits that would otherwise require their use. Contents 1 Introduction 2 2 An Introduction to First Order Logic 2 2.1 Propositional Logic . 2 2.2 Logical Symbols . 2 2.3 Predicates, Constants and Functions . 2 2.4 Well-Formed Formulas . 3 3 Models 3 3.1 Structure . 3 3.2 Truth . 4 3.2.1 Satisfaction . 5 4 The Compactness Theorem 6 4.1 Soundness and Completeness . 6 5 Nonstandard Analysis 7 5.1 Making a Nonstandard Structure . 7 5.2 Applications of a Nonstandard Structure . 9 6 Sources 10 1 1 Introduction The founders of modern calculus had a less than perfect understanding of the nuts and bolts of what made it work. Both Newton and Leibniz used the notion of infinitesimal, without a rigorous understanding of what they were. Infinitely small real numbers that were still not zero was a hard thing for mathematicians to accept, and with the rigorous development of limits by the likes of Cauchy and Weierstrass, the discussion of infinitesimals subsided. Now, using first order logic for nonstandard analysis, it is possible to create a model of the real numbers that has the same properties as the traditional conception of the real numbers, but also has rigorously defined infinite and infinitesimal elements.
  • ULTRAPRODUCTS in ANALYSIS It Appears That the Concept Of

    ULTRAPRODUCTS in ANALYSIS It Appears That the Concept Of

    ULTRAPRODUCTS IN ANALYSIS JUNG JIN LEE Abstract. Basic concepts of ultraproduct and some applications in Analysis, mainly in Banach spaces theory, will be discussed. It appears that the concept of ultraproduct, originated as a fundamental method of a model theory, is widely used as an important tool in analysis. When one studies local properties of a Banach space, for example, these constructions turned out to be useful as we will see later. In this writing we are invited to look at some basic ideas of these applications. 1. Ultrafilter and Ultralimit Let us start with the de¯nition of ¯lters on a given index set. De¯nition 1.1. A ¯lter F on a given index set I is a collection of nonempty subsets of I such that (1) A; B 2 F =) A \ B 2 F , and (2) A 2 F ;A ½ C =) C 2 F . Proposition 1.2. Each ¯lter on a given index set I is dominated by a maximal ¯lter. Proof. Immediate consequence of Zorn's lemma. ¤ De¯nition 1.3. A ¯lter which is maximal is called an ultra¯lter. We have following important characterization of an ultra¯lter. Proposition 1.4. Let F be a ¯lter on I. Then F is an ultra¯lter if and only if for any subset Y ½ I, we have either Y 2 F or Y c 2 F . Proof. (=)) Since I 2 F , suppose ; 6= Y2 = F . We have to show that Y c 2 F . De¯ne G = fZ ½ I : 9A 2 F such that A \ Y c ½ Zg.
  • Lecture 25: Ultraproducts

    Lecture 25: Ultraproducts

    LECTURE 25: ULTRAPRODUCTS CALEB STANFORD First, recall that given a collection of sets and an ultrafilter on the index set, we formed an ultraproduct of those sets. It is important to think of the ultraproduct as a set-theoretic construction rather than a model- theoretic construction, in the sense that it is a product of sets rather than a product of structures. I.e., if Xi Q are sets for i = 1; 2; 3;:::, then Xi=U is another set. The set we use does not depend on what constant, function, and relation symbols may exist and have interpretations in Xi. (There are of course profound model-theoretic consequences of this, but the underlying construction is a way of turning a collection of sets into a new set, and doesn't make use of any notions from model theory!) We are interested in the particular case where the index set is N and where there is a set X such that Q Xi = X for all i. Then Xi=U is written XN=U, and is called the ultrapower of X by U. From now on, we will consider the ultrafilter to be a fixed nonprincipal ultrafilter, and will just consider the ultrapower of X to be the ultrapower by this fixed ultrafilter. It doesn't matter which one we pick, in the sense that none of our results will require anything from U beyond its nonprincipality. The ultrapower has two important properties. The first of these is the Transfer Principle. The second is @0-saturation. 1. The Transfer Principle Let L be a language, X a set, and XL an L-structure on X.