Ideal Objects in Set Theory and Topology

Total Page:16

File Type:pdf, Size:1020Kb

Ideal Objects in Set Theory and Topology Ideal objects in set theory and topology Oliver Kullmann Historical remarks Ideal objects in set theory and topology Enumerating sets Topologies and filters Bases and Oliver Kullmann subbases Computer Science Department Topology: SAT in disguise Swansea University Compactness MRes Seminar Swansea, November 17, 2008 Ideal objects in set Introduction theory and topology In this lecture some fundamental aspects of set theory Oliver Kullmann and topology related to “ideals” (and their existence) are Historical remarks discussed: Enumerating sets First we reflect upon “access” to sets in sets theory: Topologies and filters Normally framed in considerations around the “axiom Bases and of choice”, I regard the original Cantorian intuition as subbases Topology: SAT in more adequate, and thus we’ll discuss (rather briefly) disguise well-orderings. Compactness A simple applications yields the existence of (many) maximal ideals in rings. Then we discuss fundamental notions of topology, focusing on “topologies” and “filters”. Of central importance is the notion of a “subbasis”. Finally, we discuss (quasi-)compactness, and prove Tychonoff’s theorem. Ideal objects in set theory and topology Oliver Kullmann Historical remarks Enumerating sets Topologies and Often no proofs are given, but emphasise is put on the filters definitions and properties, leaving proofs as relatively Bases and straightforward exercises. subbases Topology: SAT in disguise You must fill the gaps yourself!! Compactness Ideal objects in set Overview theory and topology Oliver Kullmann Historical remarks 1 Historical remarks Enumerating sets Topologies and 2 Enumerating sets filters Bases and subbases 3 Topologies and filters Topology: SAT in disguise Compactness 4 Bases and subbases 5 Topology: SAT in disguise 6 Compactness Ideal objects in set George Boole theory and topology Oliver Kullmann Historical remarks Enumerating sets Topologies and filters Bases and subbases Topology: SAT in disguise Compactness Ideal objects in set Georg Cantor theory and topology Oliver Kullmann Historical remarks Enumerating sets Topologies and filters Bases and subbases Topology: SAT in disguise Compactness Ideal objects in set Felix Hausdorff theory and topology Oliver Kullmann Historical remarks Enumerating sets Topologies and filters Bases and subbases Topology: SAT in disguise Compactness Ideal objects in set theory and topology Oliver Kullmann Historical remarks Enumerating sets Topologies and filters Bases and subbases Topology: SAT in disguise Compactness Ideal objects in set theory and topology Oliver Kullmann Historical remarks Enumerating sets Topologies and filters Bases and subbases Topology: SAT in disguise Compactness Ideal objects in set theory and topology Oliver Kullmann Historical remarks Enumerating sets Topologies and filters Bases and subbases Topology: SAT in disguise Compactness Ideal objects in set theory and topology Oliver Kullmann Historical remarks Enumerating sets Topologies and filters Bases and subbases Topology: SAT in disguise Compactness Ideal objects in set Wellordered sets theory and topology Unter einer wohlgeordneten Menge ist jede Oliver Kullmann wohldefinirte Menge zu verstehen, bei welcher Historical remarks die Elemente durch eine bestimmt vorgegebene Enumerating sets Succession mit einander verbunden sind, Topologies and welcher gemäss es ein erstes Element der filters Bases and Menge giebt und sowohl auf jedes einzelne subbases Element (falls es nicht das letzte in der Topology: SAT in Succession ist) ein bestimmtes anderes folgt, disguise Compactness wie auch zu jeder beliebigen endlichen oder unendlichen Menge von Elementen ein bestimmtes Element gehört, welches das ihnen allen nächst folgende Element in der Succession ist (es sei denn, dass es ein ihnen allen in der Succession folgendes überhaupt nicht giebt). (Georg Cantor, Über unendliche, lineare Punktmannichfaltigkeiten, Teil 5; Mathematische Annalen, Band 21, 1883) Ideal objects in set theory and topology Translation (using modern terminology): Oliver Kullmann A “wellordered set” ist a set M together with a Historical remarks linear order ≤, such that every subset, which Enumerating sets has a strict upper bound, has a smallest strict Topologies and filters upper bound. Thus Bases and there is a smallest element of M if M is not subbases Topology: SAT in empty; disguise every element, which is not the largest Compactness element (if there is one), has a successor. Equivalently: A wellordering of a set M is a linear order on M such that every non-empty subset has a smallest element. Ideal objects in set Exhausting sets theory and topology In the same article: Oliver Kullmann Der Begriff der wohlgeordneten Menge weist Historical remarks sich als fundamental für die ganze Enumerating sets Topologies and Mannichfaltigkeitslehre aus. Dass es immer filters möglich ist, jede wohldefinirte Menge in die Bases and Form einer wohlgeordneten Menge zu bringen, subbases Topology: SAT in auf dieses, wie mir schient, grundlegende und disguise folgenreiche, durch seine Allgemeingültigkeit Compactness besonders merkwürdige Denkgesetz werde ich in einer späteren Abhandlung zurückkommen. Simplified translation: “Every set can be wellordered, and this is a fundamental property of sets.” (Where according to Cantor a mathematical object exists iff it is present in the omnipotent intellect of god.) Ideal objects in set More on exhausting sets theory and topology Oliver Kullmann Historical remarks Enumerating sets The principle behind well-ordering a set is Topologies and filters that we grab elements out the “bag”, one after Bases and another, subbases Topology: SAT in and if this doesn’t exhaust the set, then at “limit disguise steps” we make a jump, assume that the infinitely Compactness many choices have been made, and start with a new chosen element which is posited as “successor” of all the elements previously chosen. Ideal objects in set theory and Fundamental intuitions on the notion of “set” are: topology 1 A set presents an “actual infinity”, not a “potential Oliver Kullmann infinity”. Historical remarks 2 Better said, the set is “fixed” (“frozen”), it is “being”, Enumerating sets Topologies and not (like proper classes(!)), “becoming”. filters 3 Thus the set is “measurable”, where its “size” is Bases and subbases measured by a “cardinal number”. Topology: SAT in disguise 4 The successor of this cardinal number provides a Compactness powerful enough exhaustion process (by all smaller “ordinal numbers”). 5 Here the cardinality of sets just measures its size, while an ordinal number provides the details of how we (transfinitely) “enumerated” it. (So well-ordering of sets are possible iff measurement tools are powerful enough!) Ideal objects in set Exhausting sets, more precisely theory and topology Oliver Kullmann Historical remarks With Hausdorff’s “Grundzüge der Mengenlehre” (1914): Enumerating sets Aus einer unendlichen Menge A greife man Topologies and filters willkürlich ein Element heraus, daß man mit a0 Bases and bezeichne, dann aus A − {a0} ein Element a1, subbases aus A − {a , a } ein weiteres Element a usf. Topology: SAT in 0 1 2 disguise Dies ist für jede endliche Zahl möglich. Wenn Compactness die Menge {a0, a1, a2,...} noch nicht die ganze Menge A ist, so läßt sich aus A − {a0, a1, a2,...} ein weiteres Element aω auswählen, wenn damit A noch nicht erschöpft ist, ein Element aω+1 usw. Ideal objects in set Continuation theory and topology Dies Verfahren muß einmal ein Ende nehmen, Oliver Kullmann denn über der Menge W der Ordnungszahlen, Historical remarks denen man Elemente von A zuordnen kann, gibt Enumerating sets es größere Zahlen, und diesen kann man also Topologies and keine Elemente von A mehr zuordnen. Man filters Bases and kann nun leicht zeigen (s.u.), daß dann auch alle subbases Elemente von A verbraucht sind, also A mit W Topology: SAT in äquivalent ist. disguise Compactness In short: If we take a sufficiently large ordinal number, then by choosing for each smaller element (by transfinite induction) some new element of A we can exhaust A, and the obtained initial segment of ordinal numbers yields a well-ordering of A. Using for the choices the “Axiom of Choice”, we see that the Axiom of Choice is equivalent to the Wellordering Axiom. Ideal objects in set Zorn’s Lemma theory and topology Oliver Kullmann Historical remarks Enumerating sets A poset (M, ≤) is called inductive if every chain of M (a Topologies and linearly ordered subset) has an upper bound. filters Bases and For every inductive poset (M, ≤) and every x ∈ M there subbases Topology: SAT in exists a maximal element y ∈ M with x ≤ y. disguise Compactness Proof idea: Just grab bigger elements (as long as they exist), and for the limit steps (where we “jump”) use inductiveness — this process must stop with a maximal element y above the start element x. Ideal objects in set Maximal ideals in rings theory and topology Oliver Kullmann Historical remarks Enumerating sets Topologies and filters Consider a ring R and a proper ideal I of R Bases and subbases (that is, I 6= R). Then there exists a maximal Topology: SAT in proper ideal I0 of R with I ⊆ I0. disguise Compactness Proof: The poset of proper ideals of R (ordered by subset-inclusion) is inductive. Ideal objects in set Reminder: Filters theory and topology Oliver Kullmann A filter on a set M is a set system F ⊆ P(M) stable Historical remarks under finite intersection and superset formation. Enumerating sets F is called proper if F 6= (M), which is equivalent Topologies and P filters to ∅ ∈/ F. Bases and A principal filter (or trivial filter) consists exactly of subbases Topology: SAT in the supersets of {x} for some x ∈ M. disguise Compactness Since a filter does not “care” about “big sets”, every filter captures some (“robust”) notion of “small sets”. The notion of a filter is too general to allow some form of “measurement”, but to express that something holds for “small” sets, we say that it holds for all elements of the respective filter. Ideal objects in set Reminder: Topologies theory and topology Oliver Kullmann Historical remarks Recall: A topological space is a pair (X, τ) where X is a Enumerating sets set and τ is a set system on X stable under finite Topologies and intersections and arbitrary unions.
Recommended publications
  • Conjugate Convex Functions in Topological Vector Spaces
    Matematisk-fysiske Meddelelser udgivet af Det Kongelige Danske Videnskabernes Selskab Bind 34, nr. 2 Mat. Fys. Medd . Dan. Vid. Selsk. 34, no. 2 (1964) CONJUGATE CONVEX FUNCTIONS IN TOPOLOGICAL VECTOR SPACES BY ARNE BRØNDSTE D København 1964 Kommissionær : Ejnar Munksgaard Synopsis Continuing investigations by W. L . JONES (Thesis, Columbia University , 1960), the theory of conjugate convex functions in finite-dimensional Euclidea n spaces, as developed by W. FENCHEL (Canadian J . Math . 1 (1949) and Lecture No- tes, Princeton University, 1953), is generalized to functions in locally convex to- pological vector spaces . PRINTP_ll IN DENMARK BIANCO LUNOS BOGTRYKKERI A-S Introduction The purpose of the present paper is to generalize the theory of conjugat e convex functions in finite-dimensional Euclidean spaces, as initiated b y Z . BIRNBAUM and W. ORLICz [1] and S . MANDELBROJT [8] and developed by W. FENCHEL [3], [4] (cf. also S. KARLIN [6]), to infinite-dimensional spaces . To a certain extent this has been done previously by W . L . JONES in his Thesis [5] . His principal results concerning the conjugates of real function s in topological vector spaces have been included here with some improve- ments and simplified proofs (Section 3). After the present paper had bee n written, the author ' s attention was called to papers by J . J . MOREAU [9], [10] , [11] in which, by a different approach and independently of JONES, result s equivalent to many of those contained in this paper (Sections 3 and 4) are obtained. Section 1 contains a summary, based on [7], of notions and results fro m the theory of topological vector spaces applied in the following .
    [Show full text]
  • On L−Generalized Filters and Nets
    Annals of Fuzzy Mathematics and Informatics Volume x, No. x, (Month 201y), pp. 1{xx @FMI ISSN: 2093{9310 (print version) c Kyung Moon Sa Co. ISSN: 2287{6235 (electronic version) http://www.kyungmoon.com http://www.afmi.or.kr On L−generalized filters and nets G. A. Kamel Received 13 March 2017; Revised 20 April 2017; Accepted 5 May 2017 Abstract. In this paper, we consider the L−generalized filters and L−generalized nets on the non empty universal set X to be a natural generalization of the crisp generalized filters and the crisp generalized nets respectively. In each the crisp and L−generalized cases, the extended and restricted filters (nets) will be obtained respectively. The construction of convergence to limit points of the crisp generalized and L−generalized filters (nets) will be studied respectively. We also show that any crisp generalized net on the set X associates a unique L−generalized net on X; and in general the converse is not true. In addition to that we also show that for any given L−generalized filter there exists the L−generalized net, and the vice-versa is true. Finally, the relations between the convergence of the L−generalized filters and the L−generalized nets will be outlined. Moreover, to support these concepts and relations, the construction of some examples in all sections of paper will be studied. 2010 AMS Classification: 54A40 Keywords: Generalized filter, Generalized nets, L−generalized filter, L−generalized nets, Neighbourhoods generalized filter systems. Corresponding Author: G. A. Kamel ([email protected]) 1. Introduction Zadeh in his famous paper [23] introduced the concept of a fuzzy set A of the non-empty universal set X as a mapping A : X −! [0; 1]: Chang in [4] had first tried to fuzzify the concept of a topology on a non-empty set X as a subfamily of [0; 1]X , satisfying the same axioms of ordinary topology.
    [Show full text]
  • Chapter 1: Bases for Topologies Contents
    MA3421 2016–17 Chapter 1: Bases for topologies Contents 1.1 Review: metric and topological spaces . .2 1.2 Review: continuity . .7 1.3 Review: limits of sequences . .8 1.4 Base for a topology . 11 1.5 Sub-bases, weak and product topologies . 14 1.6 Neighbourhood bases . 21 1 2 Chapter 1: Bases for topologies 1.1 Review: metric and topological spaces From MA2223 last year, you should know what a metric space is and what the metric topology is. Here is a quick refresher. Definition 1.1.1. Given any set X of points and a function d: X × X ! [0; 1) ⊂ R with these 3 properties: (i) d(z; w) ≥ 0 with equality if and only if z = w; (ii) d(z; w) = d(w; z); (iii) d(z; w) ≤ d(z; v) + d(v; w) (triangle inequality), we say that d is a metric on the space X and we call the combination (X; d) a metric space. Examples 1.1.2. Rn will denote the usual n-dimensional space (over R) and Cn the complex version. We define the (standard) Euclidean distance between pairs of points in Rn by v u n uX 2 d(x; y) = t (xj − yj) j=1 2 3 (abstracting the distance formula from R or R ), for x = (x1; x2; : : : ; xn) and y = (y1; y2; : : : ; yn). For n = 1, recall d(x; y) = jx − yj. n In the case on n-tuples z = (z1; z2; : : : ; zn) and w = (w1; w2; : : : ; wn) 2 C , we also define the standard distance via v u n uX 2 d(z; w) = t jzj − wjj j=1 Recall that for z = x + iy 2 C (with x; y 2 R the real and imaginary parts of z and i2 = −1) the modulus (or absolute value) of such a z is jzj = px2 + y2.
    [Show full text]
  • Topology Proceedings
    Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: [email protected] ISSN: 0146-4124 COPYRIGHT °c by Topology Proceedings. All rights reserved. TOPOLOGY PROCEEDINGS Volume 27, No. 2, 2003 Pages 661{673 CONNECTED URYSOHN SUBTOPOLOGIES RICHARD G. WILSON∗ Abstract. We show that each second countable Urysohn space which is not Urysohn-closed can be condensed onto a connected Urysohn space and as a corollary we charac- terize those countable Urysohn spaces which have connected Urysohn subtopologies. We also answer two questions from [12] regarding condensations onto connected Hausdorff spaces. 1. Introduction and Preliminary Results Recall that a space is Urysohn if distinct points have disjoint closed neighbourhoods and a space is feebly compact if every locally finite family of open sets is finite. During the 1960's and 70's many papers appeared in which countable connected Urysohn spaces were constructed (see for example [6],[7],[8] and [9]); such spaces were in some sense considered oddities. In a previous paper [12], we proved that each disconnected Hausdorff space with a countable network can be condensed (that is to say, there is a continuous bijection) onto a connected Hausdorff space if and only if it is not feebly compact. Here we prove an analogous result for Urysohn spaces: 2000 Mathematics Subject Classification. Primary 54D05; Secondary 54D10, 54D25. Key words and phrases. Second countable connected Urysohn space, count- able network, condensation, Urysohn family, Urysohn filter, Urysohn-closed space. ∗Research supported by Consejo Nacional de Ciencia y Tecnolog´ıa(CONA- CYT), Mexico, grant no.
    [Show full text]
  • Generalisations of Filters and Uniform Spaces
    Rhodes University Department Of Mathematics Generalisations of Filters and Uniform Spaces Murugiah Muraleetharan A thesis submitted in ful¯lment of the requirements for the Degree of Master of Science In Mathematics Abstract X X The notion of a ¯lter F 2 22 has been extended to that of a : pre¯lter F 2 2I , X X generalised ¯lter f 2 I2 and fuzzy ¯lter ' 2 II . A uniformity is a ¯lter with some X£X other conditions and the notion of a uniformity D 2 22 has been extended to that of X£X X£X a : fuzzy uniformity D 2 2I , generalised uniformity d 2 I2 and super uniformity X£X ± 2 II . We establish categorical embeddings from the category of uniform spaces into the categories of fuzzy uniform spaces, generalised uniform spaces and super uniform spaces and also categorical embeddings into the category of super uniform spaces from the categories of fuzzy uniform spaces and generalised uniform spaces. KEYWORDS: Pre¯ter, Generalised ¯lter, Fuzzy ¯lter, Fuzzy uniform space, Generalised uniform space, Super uniform space, Embedding functor and Functor isomorphim. A. M. S. SUBJECT CLASSIFICATION: 03E72, 04A20, 18A22, 54A40, 54E15. Contents 1 Fuzzy Sets 1 1.1 Introduction . 1 1.2 Crisp Subsets of X Associated With a Fuzzy Set . 3 1.3 Fuzzy Sets Induced by Maps . 6 2 Fuzzy Topology 9 2.1 De¯nitions and Fundamental Properties . 9 2.2 Fuzzy Closure Operator . 11 2.3 Continuous Functions . 12 3 Filters 14 3.1 Introduction . 14 3.2 Ultra¯lters . 15 3.3 Topological Notions in Terms of Filters .
    [Show full text]
  • A Note on I-Convergence and I⋆-Convergence Of
    MATEMATIQKI VESNIK originalni nauqni rad 67, 3 (2015), 212–221 research paper September 2015 A NOTE ON I-CONVERGENCE AND I?-CONVERGENCE OF SEQUENCES AND NETS IN TOPOLOGICAL SPACES Amar Kumar Banerjee and Apurba Banerjee Abstract. In this paper, we use the idea of I-convergence and I?-convergence of sequences and nets in a topological space to study some important topological properties. Further we derive characterization of compactness in terms of these concepts. We introduce also the idea of I-sequentially compactness and derive a few basic properties in a topological space. 1. Introduction The concept of convergence of a sequence of real numbers was extended to statistical convergence independently by H. Fast [3] and I.J. Schoenberg [15] as follows: If K is a subset of the set of all natural numbers N then natural density of the jKnj set K is defined by d(K) = limn!1 n if the limit exits [4,13] where jKnj stands for the cardinality of the set Kn = fk 2 K : k · ng. A sequence fxng of real numbers is said to be statistically convergent to ` if for every " > 0 the set K(") = fk 2 N : jxk ¡ `j ¸ "g has natural density zero [3,15]. This idea of statistical convergence of real sequence was generalized to the idea of I-convergence of real sequences [6,7] using the notion of ideal I of subsets of the set of natural numbers. Several works on I-convergence and on statistical convergence have been done in [1,2,6,7,9,12]. The idea of I-convergence of real sequences coincides with the idea of ordi- nary convergence if I is the ideal of all finite subsets of N and with the statistical convergence if I is the ideal of subsets of N of natural density zero.
    [Show full text]
  • Neighbourhood Lattices – a Poset Approach to Topological Spaces
    BULL. AUSTRAL. MATH. SOC. 54AO5, 06A99, 06B99, 54C60 VOL. 39 (1989) [31-48] NEIGHBOURHOOD LATTICES - A POSET APPROACH TO TOPOLOGICAL SPACES FRANK P. PROKOP In this paper neighbourhood lattices are developed as a generalisation of topological spaces in order to examine to what extent the concepts of "openness", "closedness", and "conti- nuity" defined in topological spaces depend on the lattice structure of V(X), the power set of X . A general pre-neighbourhood system, which satisfies the poset analogues of the neigh- bourhood system of points in a topological space, is defined on an A-semi-lattice, and is used to define open elements. Neighbourhood systems, which satisfy the poset analogues of the neighbourhood system of sets in a topological space, are introduced and it is shown that it is the conditionally complete atomistic structure of "P(X) which determines the extension of pre-neighbourhoods of points to the neighbourhoods of sets. The duals of pre-neighbourhood systems are used to generate closed elements in an arbitrary lattice, independently of closure operators or complementation. These dual systems then form the backdrop for a brief discussion of the relationship between pre- neighbourhood systems, topological closure operators, algebraic closure operators, and Cech closure operators. Continuity is defined for functions between neighbourhood lattices, and it is proved that a function f: X —* Y between topological spaces is continuous if and only if cor- responding direct image function between the neighbourhood lattices V(X) and V(Y) is continuous in the neighbourhood sense. Further, it is shown that the algebraic char- acter of continuity, that is, the non-convergence aspects, depends only on the properites of pre-neighbourhood systems.
    [Show full text]
  • Postnikov Factorizations at Infinity
    Postnikov factorizations at infinity ∗yz J. Ignacio Extremiana Aldana L. Javier Hern´andez Paricio M. Teresa Rivas Rodr´ıguez Departamento de Matem´aticas y Computaci´on Universidad de La Rioja 26004 Logrono~ Email addresses: [email protected] [email protected] [email protected] October 14, 2002 Abstract We have developed Postnikov sections for Brown-Grossman homotopy groups and for Steenrod homotopy groups in the category of exterior spaces, which is an extension of the proper category. The homotopy fibre of a fibration in the factorization associated with Brown-Grossman groups is an Eilenberg-Mac Lane exterior space for this type of groups and it has two non-trivial consecutive Steenrod homotopy groups. For a space which is first countable at infinity, one of these groups is given by the inverse limit of the homotopy groups of the neighbourhoods at infinity, the other group is isomorphic to the first derived of the inverse limit of this system of groups. In the factorization associated with Steenrod groups the homotopy fibre is an Eilenberg-Mac Lane exterior space for this type of groups and it has two non-trivial consecutive Brown-Grossman homotopy groups. We also obtain a mix factorization containing both kind previous factorizations and having homotopy fibres which are Eilenberg-Mac Lane exterior spaces for both kind of groups. Given a compact metric space embedded in the Hilbert cube, its open neighbourhoods provide the Hilbert cube the structure of an exterior space and the homotopy fibres of the factorizations above are Eilengerg-Mac Lane exterior spaces with respect to inward (or approaching) Quigley groups.
    [Show full text]
  • Convergence in Neighbourhood Lattices
    BULL. AUSTRAL. MATH. SOC. 54AO5, 06A99, 06B99, 54C60 VOL. 40 (1989) [129-145] CONVERGENCE IN NEIGHBOURHOOD LATTICES FRANK P. PROKOP A consideration of the separation properties of pre-neighbourhood lattices, leads to the definition and characterisation of T\ -neighbourhood lattices in terms of the properties of the neighbourhood mapping, independently of points. It is then shown that if net conver- gence is defined in neighbourhood lattices as a consequence of replacing 'point' by 'set' in topological convergence, then the limits of convergent nets are unique. The relation- ship between continuity and convergence is established with the proof of the statement that a residuated function between conditionally complete 1\-neighbourhood lattices is continuous if and only if it preserves the limit of convergent nets. If V(X) denotes the power set of X, then the observation that a filter in a topological space (X, T) is a net in V(X) leads to a discussion of the net convergence of a filter as a special case of net convergence. Particular attention is paid to maximal filters, Frechet filters and to the filter generated by the limit elements of a net. Further, if the 'filter' convergence of a filter F in a topological space (X, T) is given by F —* x, if tj(x) C F, then the relationship between 'filter' convergence and the net convergence of a filter in V(X) is established. Finally, it is proved that, in the neighbourhood system 'lifted' from a topological space to TCP(X)), the continuous image of a filter which converges to a singleton set is a convergent filter with the appropriate image set as the limit.
    [Show full text]
  • On the Characterization of $ M $-Metrizable Spaces
    On the characterization of M-metrizable spaces Olli Hella 27 June 2017 ABSTRACT. We introduced the concept of a metric value set (MVS) in an earlier paper [1] and developed the idea further in [2]. In this paper we study locally M-metrizable spaces and the products of M-metrizable spaces. Finally we prove a characterization of commutatively metrizable topological spaces by means of the bases of a quasiuniformity. Introduction First we recall definitions from [1] and [2]. A metric value set (MVS) is a set M with at least two elements and a binary operation + satisfying the following conditions: (M1) The operation + is associative. (M2) The operation + has a (then unique) neutral element e. Let M∗ = M\{e}. (M3) If m1 + m2 = e, then m1 = m2 = e. ∗ ∗ (M4) For every m1, m2 ∈ M there are m3 ∈ M and m4, m5 ∈ M such that m1 = m3 + m4 and m2 = m3 + m5. If the operation + is also commutative, we say that M is a commutative MVS. The operation + induces the relations E and ⊳ in M defined by setting m1 E m2 if there is m3 ∈ M such that m1 + m3 = m2 and m1 ⊳ m2 if there is ∗ m3 ∈ M such that m1 + m3 = m2. We say that M is atom-free if M is commutative and for every m ∈ M∗ there exists n ∈ M∗ such that n ⊳ m. We say that M is strictly atom-free if M is commutative and for every m ∈ M∗ there exists n ∈ M∗ such that n ⊳ m ⋪ n. A quasimetric function f is a map f: X × X M from the square of a set X to an MVS M that satisfies the following conditions:→ (f1) f(x, z) E f(x, y)+ f(y, z) for every x, y, z ∈ X (triangle inequality).
    [Show full text]
  • Topology-Final.Pdf
    1 TOPOLOGY M.A. Mathematics (Previous) PAPER-III Directorate of Distance Education Maharshi Dayanand University ROHTAK – 124 001 2 Copyright © 2003, Maharshi Dayanand University, ROHTAK All Rights Reserved. No part of this publication may be reproduced or stored in a retrieval system or trans- mitted in any form or by any means; electronic, mechanical, photocopying, recording or otherwise, without the written permission of the copyright holder. Maharshi Dayanand University ROHTAK – 124 001 Developed & Produced by EXCEL BOOKS PVT. LTD., A-45 Naraina, Phase 1, New Delhi-110028 3 Contents Chapter 1 Toplogical Spaces 5 Chapter 2 Connectedness 30 Chapter 3 Compactness and Continuous Functions 38 Chapter 4 Separation Axiom (I) and Countability Axioms 49 Chapter 5 Separation Axiom (Part II) 63 Chapter 6 Embedding and Metrization 81 Chapter 7 Product Topological Spaces 87 Chapter 8 Nets & Filters 98 Chapter 9 The Fundamental Group and Covering Spaces 118 Chapter 10 Paracompact Spaces 143 4 M.A. (Previous) TOPOLOGY Paper-III M.Marks: 100 Time: 3 Hrs. Note: Question paper will consist of three sections. Section-I consisting of one question with ten parts of 2 marks each covering whole of the syllabus shall be compulsory. From Section-II, 10 questions to be set selecting two questions from each unit. The candidate will be required to attempt any seven questions each of five marks. Section-III, five questions to be set, one from each unit. The candidate will be re- quired to attempt any three questions each of fifteen marks. Unit-I Definition and examples of topological spaces, closed sets and closure, dense subsets.
    [Show full text]
  • Arxiv:Math/0307385V1
    INVERSE LIMITS OF RINGS AND MULTIPLIER RINGS GERT K. PEDERSEN & FRANCESC PERERA Abstract. It is proved that the exchange property, the Bass stable rank and the quasi-Bass property are all preserved under surjective inverse limits. This is then applied to multiplier rings by showing that these in many cases can be obtained as inverse limits. Introduction Given a sequence (Rn) of rings with connecting morphisms (i.e. ring homomorphisms) πn : Rn → Rn−1 for all n (setting R0 = R1 and π1 = id) we define the inverse limit as the ring lim R of strings x =(x ) in R , i.e. sequences such that π (x )= x − for all n. For ←− n n Q n n n n 1 each m there is a natural morphism ρ : lim R → R (the coordinate evaluation) obtained m ←− n m by evaluating a string x = (xn) at m, and we see that πn ◦ ρn = ρn−1 for every n. The ring R = lim R has the universal property that for each coherent sequence of morphisms ←− n σn : S → Rn from a ring S (i.e. πn ◦σn = σn−1 for all n) there is a unique morphism σ : S → R such that σn = ρn ◦ σ for all n. If for each m we let S = ρ (lim R ) ⊂ R , then π (S ) = S − and lim R = lim S . m m ←− n m n n n 1 ←− n ←− n This shows that every ring which can be obtained as an inverse limit can also be obtained as an inverse limit in which each morphism πn is surjective.
    [Show full text]