Nonstandard Analysis and Vector Lattices Managing Editor
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Lifting Convex Approximation Properties and Cyclic Operators with Vector Lattices رﻓﻊ ﺧﺼﺎﺋﺺ اﻟﺘﻘﺮﯾﺐ اﻟﻤﺤﺪب واﻟﻤﺆﺛﺮات اﻟﺪورﯾﺔ ﻣﻊ ﺷﺒﻜﺎت اﻟﻤﺘﺠﮫ
University of Sudan for Science and Technology College of graduate Studies Lifting Convex Approximation Properties and Cyclic Operators with Vector Lattices رﻓﻊ ﺧﺼﺎﺋﺺ اﻟﺘﻘﺮﯾﺐ اﻟﻤﺤﺪب واﻟﻤﺆﺛﺮات اﻟﺪورﯾﺔ ﻣﻊ ﺷﺒﻜﺎت اﻟﻤﺘﺠﮫ A thesis Submitted in Partial Fulfillment of the Requirement of the Master Degree in Mathematics By: Marwa Alyas Ahmed Supervisor: Prof. Shawgy Hussein Abdalla November 2016 1 Dedication I dedicate my dissertation work to my family, a special feeling of gratitude to my loving parents, my sisters and brothers. I also dedicate this dissertation to my friends and colleagues. I ACKNOWLEDGEMENTS First of all I thank Allah.. I wish to thank my supervisor Prof. Shawgi huSSien who was more than generous with his expertise and precious time. A special thanks to him for his countless hours of reflecting, reading, encouraging, and most of all patience throughout the entire process. I would like to acknowledge and thank Sudan University for Sciences & Technology for allowing me to conduct my research and providing any assistance requested. Special thanks goes to the all members of the university for their continued support. II Abstract We demonstrate that rather weak forms of the extendable local reflexivity and of the principle of local reflexivity are needed for the lifting of bounded convex approximation properties from Banach spaces to their dual spaces. We show that certain adjoint multiplication operators are convex- cyclic and show that some are convex- cyclic but no convex polynomial of the operator is hypercyclic. Also some adjoint multi- plication operators are convex- cyclic but not 1-weakly hypercyclic. We deal with two weaker forms of injectivity which turn out to have a rich structure behind: separable injectivity and universal separable injectivity. -
An Introduction to Nonstandard Analysis 11
AN INTRODUCTION TO NONSTANDARD ANALYSIS ISAAC DAVIS Abstract. In this paper we give an introduction to nonstandard analysis, starting with an ultrapower construction of the hyperreals. We then demon- strate how theorems in standard analysis \transfer over" to nonstandard anal- ysis, and how theorems in standard analysis can be proven using theorems in nonstandard analysis. 1. Introduction For many centuries, early mathematicians and physicists would solve problems by considering infinitesimally small pieces of a shape, or movement along a path by an infinitesimal amount. Archimedes derived the formula for the area of a circle by thinking of a circle as a polygon with infinitely many infinitesimal sides [1]. In particular, the construction of calculus was first motivated by this intuitive notion of infinitesimal change. G.W. Leibniz's derivation of calculus made extensive use of “infinitesimal” numbers, which were both nonzero but small enough to add to any real number without changing it noticeably. Although intuitively clear, infinitesi- mals were ultimately rejected as mathematically unsound, and were replaced with the common -δ method of computing limits and derivatives. However, in 1960 Abraham Robinson developed nonstandard analysis, in which the reals are rigor- ously extended to include infinitesimal numbers and infinite numbers; this new extended field is called the field of hyperreal numbers. The goal was to create a system of analysis that was more intuitively appealing than standard analysis but without losing any of the rigor of standard analysis. In this paper, we will explore the construction and various uses of nonstandard analysis. In section 2 we will introduce the notion of an ultrafilter, which will allow us to do a typical ultrapower construction of the hyperreal numbers. -
Actual Infinitesimals in Leibniz's Early Thought
Actual Infinitesimals in Leibniz’s Early Thought By RICHARD T. W. ARTHUR (HAMILTON, ONTARIO) Abstract Before establishing his mature interpretation of infinitesimals as fictions, Gottfried Leibniz had advocated their existence as actually existing entities in the continuum. In this paper I trace the development of these early attempts, distinguishing three distinct phases in his interpretation of infinitesimals prior to his adopting a fictionalist interpretation: (i) (1669) the continuum consists of assignable points separated by unassignable gaps; (ii) (1670-71) the continuum is composed of an infinity of indivisible points, or parts smaller than any assignable, with no gaps between them; (iii) (1672- 75) a continuous line is composed not of points but of infinitely many infinitesimal lines, each of which is divisible and proportional to a generating motion at an instant (conatus). In 1676, finally, Leibniz ceased to regard infinitesimals as actual, opting instead for an interpretation of them as fictitious entities which may be used as compendia loquendi to abbreviate mathematical reasonings. Introduction Gottfried Leibniz’s views on the status of infinitesimals are very subtle, and have led commentators to a variety of different interpretations. There is no proper common consensus, although the following may serve as a summary of received opinion: Leibniz developed the infinitesimal calculus in 1675-76, but during the ensuing twenty years was content to refine its techniques and explore the richness of its applications in co-operation with Johann and Jakob Bernoulli, Pierre Varignon, de l’Hospital and others, without worrying about the ontic status of infinitesimals. Only after the criticisms of Bernard Nieuwentijt and Michel Rolle did he turn himself to the question of the foundations of the calculus and 2 Richard T. -
Models of Linear Logic Based on the Schwartz $\Varepsilon $-Product
MODELS OF LINEAR LOGIC BASED ON THE SCHWARTZ ε-PRODUCT. YOANN DABROWSKI AND MARIE KERJEAN Abstract. From the interpretation of Linear Logic multiplicative disjunction as the ε-product de- fined by Laurent Schwartz, we construct several models of Differential Linear Logic based on usual mathematical notions of smooth maps. This improves on previous results in [BET] based on con- venient smoothness where only intuitionist models were built. We isolate a completeness condition, called k-quasi-completeness, and an associated notion stable by duality called k-reflexivity, allow- ing for a ∗-autonomous category of k-reflexive spaces in which the dual of the tensor product is the reflexive version of the ε product. We adapt Meise’s definition of Smooth maps into a first model of Differential Linear Logic, made of k-reflexive spaces. We also build two new models of Linear Logic with conveniently smooth maps, on categories made respectively of Mackey-complete Schwartz spaces and Mackey-complete Nuclear Spaces (with extra reflexivity conditions). Varying slightly the notion of smoothness, one also recovers models of DiLL on the same ∗-autonomous cat- egories. Throughout the article, we work within the setting of Dialogue categories where the tensor product is exactly the ε-product (without reflexivization). Contents 1. Introduction 2 1.1. A first look at the interpretation of Linear Logic constructions 6 Part 1. Three Models of MALL 7 2. Preliminaries 7 2.1. Reminder on topological vector spaces 7 2.2. Reminder on tensor products and duals of locally convex spaces. 8 2.3. Dialogue and ∗-autonomous categories 10 2.4. -
Do Simple Infinitesimal Parts Solve Zeno's Paradox of Measure?
Do Simple Infinitesimal Parts Solve Zeno's Paradox of Measure?∗ Lu Chen (Forthcoming in Synthese) Abstract In this paper, I develop an original view of the structure of space|called infinitesimal atomism|as a reply to Zeno's paradox of measure. According to this view, space is composed of ultimate parts with infinitesimal size, where infinitesimals are understood within the framework of Robinson's (1966) nonstandard analysis. Notably, this view satisfies a version of additivity: for every region that has a size, its size is the sum of the sizes of its disjoint parts. In particular, the size of a finite region is the sum of the sizes of its infinitesimal parts. Although this view is a coherent approach to Zeno's paradox and is preferable to Skyrms's (1983) infinitesimal approach, it faces both the main problem for the standard view (the problem of unmeasurable regions) and the main problem for finite atomism (Weyl's tile argument), leaving it with no clear advantage over these familiar alternatives. Keywords: continuum; Zeno's paradox of measure; infinitesimals; unmeasurable ∗Special thanks to Jeffrey Russell and Phillip Bricker for their extensive feedback on early drafts of the paper. Many thanks to the referees of Synthese for their very helpful comments. I'd also like to thank the participants of Umass dissertation seminar for their useful feedback on my first draft. 1 regions; Weyl's tile argument 1 Zeno's Paradox of Measure A continuum, such as the region of space you occupy, is commonly taken to be indefinitely divisible. But this view runs into Zeno's famous paradox of measure. -
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. -
Marie Kerjean
Tensor products and *-autonomous categories Marie Kerjean Laboratory PPS, Universit´eParis Diderot [email protected] The main use of ∗-autonomous categories is in the semantic study of Linear Logic. For this reason, it is thus natural to look for a ∗-autonomous category of locally convex topological vector spaces (tvs). On one hand, Linear Logic inherits its semantics from Linear Algebra, and it is thus natural to build models of Linear Logic from vector spaces [3,5,6,4]. On the other hand, denotational semantics has sought continuous models of computation through Scott domains [9]. Moreover, the infinite nature of the exponential of Linear Logic calls for infinite dimensional spaces, for which topology becomes necessary. One of the first intuitions that comes to mind when thinking about objects in a ∗-autonomous category is the notion of reflexive vector space, i.e. a a tvs which equals its double dual. When A is a vector space, the transpose dA : A ! (A !?) !? of the evaluation map evA :(A !?) × A !? is exactly the canonical injection of a vector space in its bidual. Then, requiring dA to be an isomorphism amounts to requiring A to be reflexive. However, the category of reflexive topological vector spaces is not ∗-autonomous, as it is not closed. Barr [2] constructs two closed subcategories of the category of tvs by re- stricting to tvs endowed with their weak topology (wtvs) or with their Mackey topology (mtvs), which are both polar topologies. Indeed, if E is a tvs, one can define its dual E0 as the space of all continuous linear form on E. -
Isomorphism Property in Nonstandard Extensions of the ZFC Universe'
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector ANNALS OF PURE AND APPLIED LOGIC Annals of Pure and Applied Logic 88 (1997) l-25 Isomorphism property in nonstandard extensions of the ZFC universe’ Vladimir Kanoveia, *,2, Michael Reekenb aDepartment of Mathematics, Moscow Transport Engineering Institute, Obraztsova 15, Moscow 101475, Russia b Fachbereich Mathematik. Bergische Universitiit GHS Wuppertal, Gauss Strasse 20, Wuppertal 42097, Germany Received 27 April 1996; received in revised form 5 February 1997; accepted 6 February 1997 Communicated by T. Jech Abstract We study models of HST (a nonstandard set theory which includes, in particular, the Re- placement and Separation schemata of ZFC in the language containing the membership and standardness predicates, and Saturation for well-orderable families of internal sets). This theory admits an adequate formulation of the isomorphism property IP, which postulates that any two elementarily equivalent internally presented structures of a well-orderable language are isomor- phic. We prove that IP is independent of HST (using the class of all sets constructible from internal sets) and consistent with HST (using generic extensions of a constructible model of HST by a sufficient number of generic isomorphisms). Keywords: Isomorphism property; Nonstandard set theory; Constructibility; Generic extensions 0. Introduction This article is a continuation of the authors’ series of papers [12-151 devoted to set theoretic foundations of nonstandard mathematics. Our aim is to accomodate an * Corresponding author. E-mail: [email protected]. ’ Expanded version of a talk presented at the Edinburg Meeting on Nonstandard Analysis (Edinburg, August 1996). -
Nonstandard Analysis (Math 649K) Spring 2008
Nonstandard Analysis (Math 649k) Spring 2008 David Ross, Department of Mathematics February 29, 2008 1 1 Introduction 1.1 Outline of course: 1. Introduction: motivation, history, and propoganda 2. Nonstandard models: definition, properties, some unavoidable logic 3. Very basic Calculus/Analysis 4. Applications of saturation 5. General Topology 6. Measure Theory 7. Functional Analysis 8. Probability 1.2 Some References: 1. Abraham Robinson (1966) Nonstandard Analysis North Holland, Amster- dam 2. Martin Davis and Reuben Hersh Nonstandard Analysis Scientific Ameri- can, June 1972 3. Davis, M. (1977) Applied Nonstandard Analysis Wiley, New York. 4. Sergio Albeverio, Jens Erik Fenstad, Raphael Høegh-Krohn, and Tom Lindstrøm (1986) Nonstandard Methods in Stochastic Analysis and Math- ematical Physics. Academic Press, New York. 5. Al Hurd and Peter Loeb (1985) An introduction to Nonstandard Real Anal- ysis Academic Press, New York. 6. Keith Stroyan and Wilhelminus Luxemburg (1976) Introduction to the Theory of Infinitesimals Academic Press, New York. 7. Keith Stroyan and Jose Bayod (1986) Foundations of Infinitesimal Stochas- tic Analysis North Holland, Amsterdam 8. Leif Arkeryd, Nigel Cutland, C. Ward Henson (eds) (1997) Nonstandard Analysis: Theory and Applications, Kluwer 9. Rob Goldblatt (1998) Lectures on the Hyperreals, Springer 2 1.3 Some history: • (xxxx) Archimedes • (1615) Kepler, Nova stereometria dolorium vinariorium • (1635) Cavalieri, Geometria indivisibilus • (1635) Excercitationes geometricae (”Rigor is the affair of philosophy rather -
Riesz Vector Spaces and Riesz Algebras Séminaire Dubreil
Séminaire Dubreil. Algèbre et théorie des nombres LÁSSLÓ FUCHS Riesz vector spaces and Riesz algebras Séminaire Dubreil. Algèbre et théorie des nombres, tome 19, no 2 (1965-1966), exp. no 23- 24, p. 1-9 <http://www.numdam.org/item?id=SD_1965-1966__19_2_A9_0> © Séminaire Dubreil. Algèbre et théorie des nombres (Secrétariat mathématique, Paris), 1965-1966, tous droits réservés. L’accès aux archives de la collection « Séminaire Dubreil. Algèbre et théorie des nombres » im- plique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/conditions). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques http://www.numdam.org/ Seminaire DUBREIL-PISOT 23-01 (Algèbre et Theorie des Nombres) 19e annee, 1965/66, nO 23-24 20 et 23 mai 1966 RIESZ VECTOR SPACES AND RIESZ ALGEBRAS by Lássló FUCHS 1. Introduction. In 1940, F. RIESZ investigated the bounded linear functionals on real function spaces S, and showed that they form a vector lattice whenever S is assumed to possess the following interpolation property. (A) Riesz interpolation property. -If f , g~ are functions in S such that g j for i = 1 , 2 and j = 1 , 2 , then there is some h E S such that Clearly, if S is a lattice then it has the Riesz interpolation property (choose e. g. h = f 1 v f~ A g 2 ~, but there exist a number of important function spaces which are not lattice-ordered and have the Riesz interpolation property. -
Weak Topologies for Linear Logic
Weak topologies for Linear Logic Marie Kerjean Laboratoire PPS, Universit´eParis Diderot, Paris, France [email protected] Abstract We construct a denotational model of Linear Logic, whose objects are all the locally convex and separated topological vector spaces endowed with their weak topology. Linear proofs are interpreted as continuous linear functions, and non-linear proofs as sequences of monomials. The duality in this interpretation of Linear Logic does not come from an orthogonality relation, thus we do not complete our constructions by a double-orthogonality operation. This yields an interpretation of polarities with respect to weak topologies. 1 Introduction Linear Logic [Gir88] can be seen as a fine analysis of classical logic, through polarities and involutive linear negation [LR03]. The linearity hypothesis has been made by Girard [Gir87] after a semantical investigation of Intuitionistic Logic. Semantics has in turn led to various discoveries around Linear Logic, as in Game Semantics or Differential λ-calculus [ER06]. However, the linear negation is often modelized with an orthogonality relation [Ehr02, Ehr05, Gir04] or with a Chu construction [Gir99]. We try to generalize this approach by considering a model whose objects are general topological vector spaces. It allows us to get closer to the algebraic intuitions of Linear Logic, and to reach analogies with functional analysis. As in Scott Domains, we interpret our functions by continuous functions, and especially our linear proofs will be interpreted by linear continuous functions between topological vector spaces. As the topological dual of a space E is not constructed from E with an orthogonality relation, we have the opportunity to construct a new kind of negation. -
4. Basic Concepts in This Section We Take X to Be Any Infinite Set Of
401 4. Basic Concepts In this section we take X to be any infinite set of individuals that contains R as a subset and we assume that ∗ : U(X) → U(∗X) is a proper nonstandard extension. The purpose of this section is to introduce three important concepts that are characteristic of arguments using nonstandard analysis: overspill and underspill (consequences of certain sets in U(∗X) not being internal); hy- perfinite sets and hyperfinite sums (combinatorics of hyperfinite objects in U(∗X)); and saturation. Overspill and underspill ∗ ∗ 4.1. Lemma. The sets N, µ(0), and fin( R) are external in U( X). Proof. Every bounded nonempty subset of N has a maximum element. By transfer we conclude that every bounded nonempty internal subset of ∗N ∗ has a maximum element. Since N is a subset of N that is bounded above ∗ (by any infinite element of N) but that has no maximum element, it follows that N is external. Every bounded nonempty subset of R has a least upper bound. By transfer ∗ we conclude that every bounded nonempty internal subset of R has a least ∗ upper bound. Since µ(0) is a bounded nonempty subset of R that has no least upper bound, it follows that µ(0) is external. ∗ ∗ ∗ If fin( R) were internal, so would N = fin( R) ∩ N be internal. Since N is ∗ external, it follows that fin( R) is also external. 4.2. Proposition. (Overspill and Underspill Principles) Let A be an in- ternal set in U(∗X). ∗ (1) (For N) A contains arbitrarily large elements of N if and only if A ∗ contains arbitrarily small infinite elements of N.