DOCSLIB.ORG

GENERATIVE EFFECTS: POSETS and ADJUNCTIONS C, Then a Is Connected to C—That Is, All A, B, and C Are Connected

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
GENERATIVE EFFECTS: POSETS and ADJUNCTIONS C, Then a Is Connected to C—That Is, All A, B, and C Are Connected Chapter 1 Generative effects: Posets and adjunctions 1.1 Motivation Your brain as a whole is conscious. On the other hand, your brain is made up of neurons, none of which are conscious. Where does the consciousness come from? A generative effect is a property of a interconnected system that cannot be explained solely in terms of properties of the constituent subsystems. As such, we will begin our foray into category theory by talking not about compositionality per se, but about the failure of compositionality: how new effects can be generated when systems are joined. The use of category theory to explore generative effects follows work by Adam [Adam:2017a]. Much of this chapter, however, can also be considered a classical, order-theoretic warm up for the full-fledged category theory to come. To explore the notion of a generative effect we must first provide at least a rudi- mentary formalization of systems, including how they are joined and what it means to observe properties. To get some intuition for how we do this, let’s take a simpler example. Consider three points; we’ll call them , and . • ◦ ∗ In this example, a system will simply be a way of connecting these points together. We might think of our points as sites on a power grid, with a system describing connection by power lines, or as people susceptible to some disease, with a system describing possible contagion. As an abstract example of a system, there is a system where and are connected, but neither are connected to . We shall draw this like • ◦ ∗ so: • ∗ ◦ Connections are symmetric, so if a is connected to b, then b is connected to a. Con- nections are also transitive, meaning that if a is connected to b, and b is connected to 1 2 CHAPTER 1. GENERATIVE EFFECTS: POSETS AND ADJUNCTIONS c, then a is connected to c—that is, all a, b, and c are connected. Friendship is not transitive—my friend’s friend is not necessarily my friend—but word-of-mouth is. Let’s depict two more systems. Here is a system in which none of the points are connected: • ∗ ◦ And here is the system is which all three points are connected: • ∗ ◦ The property of these systems that we will measure is whether is connected to • . A measurement will be an assignment of either true or false to a system; we will ∗ assign true if is connected to , and false otherwise. We thus assign the value true • ∗ to the systems: • ∗ • ∗ ◦ ◦ and we will assign the value false to the remaining systems: • ∗ • ∗ • ∗ ◦ ◦ ◦ We have thus decided what we shall mean, in this simple case, by system and property. But what does it mean to join systems? We shall join two systems A and B simply by combining their connections. That is, we shall say the joined system A B of A and B has point x connected to point y _ if there are some points z1;:::; zn such that, in at least one of A or B, it is true that a is connected to z1, zi is connected to zi+1, and zn is connected to y. In a three-point system, the above definition is overkill, but we want to say something that works in any number of elements. In our three-element, it means for example that • ∗ • ∗ • ∗ _ ◦ ◦ ◦ and • ∗ • ∗ • ∗ (1.1) _ ◦ ◦ ◦ 1.1. MOTIVATION 3 Exercise 1.1. What is the result of joining the following two systems? 11 12 13 11 12 13 • • • • • • _ 21 22 23 21 22 23 • • • • • • ♦ Let’s return to the second example above, Eq. (1.1). Here we can see a generative effect. Let’s write Φ for the above function measuring whether is connected to . • ∗ • ∗ • ∗ Now Φ ◦ Φ ◦ false. That is, for both the systems on the left hand side, is ¹ º ¹ º • not connected to . ∗ • ∗ • ∗ On the other hand, when we join these two systems, we see that Φ ◦ ◦ • ∗ ¹ _ º Φ ◦ true: in the joined system, is connected to . Thus the joined system has a ¹ º • ∗ property that neither of the constituent subsystems has—this property is a generative effect. Such effects, or at least their potential to exist, can be incredibly important to deduce. For example, the two constituent systems could be the views of two local authorities on possibly contagion between an infected person and a vulnerable • person . In this case, each authority would conclude from their own model that no ∗ infection can occur, but combining their information would show the opposite. 1.1.1 Ordering systems We can obtain the notion of joining systems from a more basic structure: order. Namely, we note that the systems themselves are ordered in a hierarchy. Given systems A and B, we say that A B if whenever x is connected to y in A then x is ≤ connected to y in B. For example, • ∗ • ∗ ≤ ◦ ◦ 4 CHAPTER 1. GENERATIVE EFFECTS: POSETS AND ADJUNCTIONS This leads to the diagram • ∗ ◦ • ∗ • ∗ • ∗ ◦ ◦ ◦ • ∗ ◦ (1.2) where we draw an arrow from system A to system B if A B. Such diagrams are ≤ known as Hasse diagrams. Now the notion of join, , is derived from this order: A B is the smallest system _ _ that is bigger than both A and B. That is, A A B and B A B , and for any ≤ ¹ _ º ≤ ¹ _ º C, if A C and B C then A B C. ≤ ≤ ¹ _ º ≤ Exercise 1.2. Try it yourself. 1. Write down all the partitions of a two element set ; , order them as above, f• ∗g and draw the Hasse diagram. 2. Now do the same thing for a four element-set, say 1; 2; 3; 4 . There should be f g 15 partitions. Choose any two systems in your 15-element Hasse diagram, call them A and B. 3. What is A B? _ 4. Find all the systems C with A C and B C. ≤ ≤ 5. Is A B under all such C, i.e. is it true that A B C? _ ¹ _ º ≤ ♦ The properties true and false also have an order, false true: ≤ true false For any A; B in true; false , we can again write A B to mean the least element f g _ that is greater than both A and B. 1.2. POSETS 5 Exercise 1.3. In the order true; false , where false true, what is: f g ≤ 1. true false _ 2. false true _ 3. true true _ 4. false false? _ ♦ Let’s return to our systems with , , and , and our “ is connected to ” function, • ◦ ∗ • ∗ which we called Φ. It takes any such system and returns either true or false. Note that the map Φ preserves the order: if A B and there is a connection between ≤ ≤ • and in A, then there is such a connection in B too. The existence of the generative ∗ effect, however, is captured in the equation Φ A Φ B , Φ A B : (1.3) ¹ º _ ¹ º ¹ _ º That is, we have two systems with no connection and , which obtain the property • ∗ when they are combined. Equation (1.3) is how we define a generative effect of Φ. These ideas capture the most basic ideas in category theory. In particular, we see hints of the notions of category, functor, colimit, and adjunction. In this chapter we will explore these ideas in the elementary setting of ordered sets. 1.2 Posets We will not give a definition of set here, but informally we will think of it as a collection of things, known as elements. These things could be all the leaves on a tree, or the names of your favourite fruits, or simply some symbols a, b, c. For example, we write X h; 1 to denote the set, called X, that contains exactly two elements, one called f g h and one called 1. If x is element of X, we write x X; so we have h X and 1 X. 2 2 2 Given a set X, we call a collection, possibly empty, of elements of X a subset of X. Given two sets X and Y, the product X Y of X and Y is the set of pairs x; y , where × ¹ º x X and y Y. 2 2 Exercise 1.4. Let X h; 1 and Y 1; 2; 3 . There are six elements in X Y; write them out. ♦ f g f g × A particularly important sort of subset is a subset of the product of a set with itself. Definition 1.5. Let X be a set. A (binary) relation on X is a subset R X X. ⊆ × In Section 1.1, we several times used the symbol to denote a sort of order. Here ≤ is a formal definition of ordered set. Definition 1.6. A preorder on a set X is a binary relation R on X, where we write x y ≤ if x; y R, such that ¹ º 2 1. x x and ≤ 6 CHAPTER 1. GENERATIVE EFFECTS: POSETS AND ADJUNCTIONS 2. if x y and y z, then x z. ≤ ≤ ≤ The first condition is called reflexivity and the second is called transitivity. We call a set with a preorder a poset, although we note that this term often denotes a partially ordered set, in which the additional condition holds that if x y and y x ≤ ≤ then x y. The difference is a fairly minor one. Example 1.7. Let X be the set of partitions of ; ; ; it has five elements, shown in f• ◦ ∗g Eq. (1.2).
Load more

Recommended publications
  • Scott Spaces and the Dcpo Category
    SCOTT SPACES AND THE DCPO CATEGORY JORDAN BROWN Abstract. Directed-complete partial orders (dcpo’s) arise often in the study of λ-calculus. Here we investigate certain properties of dcpo’s and the Scott spaces they induce. We introduce a new construction which allows for the canonical extension of a partial order to a dcpo and give a proof that the dcpo introduced by Zhao, Xi, and Chen is well-filtered. Contents 1. Introduction 1 2. General Definitions and the Finite Case 2 3. Connectedness of Scott Spaces 5 4. The Categorical Structure of DCPO 6 5. Suprema and the Waybelow Relation 7 6. Hofmann-Mislove Theorem 9 7. Ordinal-Based DCPOs 11 8. Acknowledgments 13 References 13 1. Introduction Directed-complete partially ordered sets (dcpo’s) often arise in the study of λ-calculus. Namely, they are often used to construct models for λ theories. There are several versions of the λ-calculus, all of which attempt to describe the ‘computable’ functions. The first robust descriptions of λ-calculus appeared around the same time as the definition of Turing machines, and Turing’s paper introducing computing machines includes a proof that his computable functions are precisely the λ-definable ones [5] [8]. Though we do not address the λ-calculus directly here, an exposition of certain λ theories and the construction of Scott space models for them can be found in [1]. In these models, computable functions correspond to continuous functions with respect to the Scott topology. It is thus with an eye to the application of topological tools in the study of computability that we investigate the Scott topology.
    [Show full text]
  • Topological Duality and Lattice Expansions Part I: a Topological Construction of Canonical Extensions
    TOPOLOGICAL DUALITY AND LATTICE EXPANSIONS PART I: A TOPOLOGICAL CONSTRUCTION OF CANONICAL EXTENSIONS M. ANDREW MOSHIER AND PETER JIPSEN 1. INTRODUCTION The two main objectives of this paper are (a) to prove topological duality theorems for semilattices and bounded lattices, and (b) to show that the topological duality from (a) provides a construction of canonical extensions of bounded lattices. The paper is first of two parts. The main objective of the sequel is to establish a characterization of lattice expansions, i.e., lattices with additional operations, in the topological setting built in this paper. Regarding objective (a), consider the following simple question: Is there a subcategory of Top that is dually equivalent to Lat? Here, Top is the category of topological spaces and continuous maps and Lat is the category of bounded lattices and lattice homomorphisms. To date, the question has been answered positively either by specializing Lat or by generalizing Top. The earliest examples are of the former sort. Tarski [Tar29] (treated in English, e.g., in [BD74]) showed that every complete atomic Boolean lattice is represented by a powerset. Taking some historical license, we can say this result shows that the category of complete atomic Boolean lattices with complete lat- tice homomorphisms is dually equivalent to the category of discrete topological spaces. Birkhoff [Bir37] showed that every finite distributive lattice is represented by the lower sets of a finite partial order. Again, we can now say that this shows that the category of finite distributive lattices is dually equivalent to the category of finite T0 spaces and con- tinuous maps.
    [Show full text]
  • T0 Topological Spaces and T0 Posets in the Topos of M-Sets
    Theory and Applications of Categories, Vol. 33, No. 34, 2018, pp. 1059{1071. T0 TOPOLOGICAL SPACES AND T0 POSETS IN THE TOPOS OF M-SETS M.M. EBRAHIMI, M. MAHMOUDI, AND A.H. NEJAH Abstract. In this paper, we introduce the concept of a topological space in the topos M-Set of M-sets, for a monoid M. We do this by replacing the notion of open \subset" by open \subobject" in the definition of a topology. We prove that the resulting category has an open subobject classifier, which is the counterpart of the Sierpinski space in this topos. We also study the relation between the given notion of topology and the notion of a poset in this universe. In fact, the counterpart of the specialization pre-order is given for topological spaces in M-Set, and it is shown that, similar to the classic case, for a special kind of topological spaces in M-Set, namely T0 ones, it is a partial order. Furthermore, we obtain the universal T0 space, and give the adjunction between topological spaces and T0 posets, in M-Set. 1. Introduction Topoi are categories which behave like the category Set, of sets and functions between them. Naturally one tries to reconstruct the classical mathematics in such categories. The difference between classical mathematics and topos base mathematics is that the latter is in some sense constructive. In fact, the internal logic of a topos is intuitionistic, and so topoi provide a convenient set up for constructive mathematics. One of the most important features of constructive mathematics is in computer science and semantic of programing languages.
    [Show full text]
  • Z-Continuous Posets
    DISCRETE MATHEMATICS ELSEVIERI Discrete Mathematics 152 (1996) 33-45 Z-continuous posets Andrei Baranga Department ofMathematics, University ofBucharest, Str. Academiei 14, 70109, Bucharest, Romania Received 19 July 1994 Abstract The concept of 'subset system on the category Po of posets (Z-sets) was defined by Wright, Wagner and Thatcher in 1978. The term Z-set becomes meaningful if we replace Z by 'directed', 'chain', 'finite'. At the end of the paper (Wright et al. 1978), the authors suggested an attempt to study the generalized counterpart of the term 'continuous poset (lattice)' obtained by replacing directed sets by Z-sets, Z being an arbitary subset system on Po. We present here some results concerning this investigation. These results are generalized counterparts of some purely order theoretical facts about continuous posets. Keywords: Poset; Subset system; Z-set; Continuous poset; Continuous lattice; Algebraic poset; Algebraic lattice; Moore family; Closure operator; Ideal; Z-inductive poset Introduction The concept of 'subset system on the category Po of posets' (Z-sets) was defined by Wright et al. in [12]. The term Z-set becomes meaningful if we replace Z by 'directed', 'chain', 'finite', etc. On the other hand, the concept of continuous lattice was defined by Scott in [9] in a topological manner as a mathematical tool in computation theory (see [10, 11]) although it has appeared in other fields of mathematics as well, such as general topology, analysis, algebra, category theory, logic and topological algebra (see [4]), This concept was defined later in purely order theoretical terms (see [8]) and now this definition has became the one used in almost all references.
    [Show full text]
  • Arxiv:1508.05446V2 [Math.CO] 27 Sep 2018 02,5B5 16E10
    CELL COMPLEXES, POSET TOPOLOGY AND THE REPRESENTATION THEORY OF ALGEBRAS ARISING IN ALGEBRAIC COMBINATORICS AND DISCRETE GEOMETRY STUART MARGOLIS, FRANCO SALIOLA, AND BENJAMIN STEINBERG Abstract. In recent years it has been noted that a number of combi- natorial structures such as real and complex hyperplane arrangements, interval greedoids, matroids and oriented matroids have the structure of a finite monoid called a left regular band. Random walks on the monoid model a number of interesting Markov chains such as the Tsetlin library and riffle shuffle. The representation theory of left regular bands then comes into play and has had a major influence on both the combinatorics and the probability theory associated to such structures. In a recent pa- per, the authors established a close connection between algebraic and combinatorial invariants of a left regular band by showing that certain homological invariants of the algebra of a left regular band coincide with the cohomology of order complexes of posets naturally associated to the left regular band. The purpose of the present monograph is to further develop and deepen the connection between left regular bands and poset topology. This allows us to compute finite projective resolutions of all simple mod- ules of unital left regular band algebras over fields and much more. In the process, we are led to define the class of CW left regular bands as the class of left regular bands whose associated posets are the face posets of regular CW complexes. Most of the examples that have arisen in the literature belong to this class. A new and important class of ex- amples is a left regular band structure on the face poset of a CAT(0) cube complex.
    [Show full text]
  • Complete Topologized Posets and Semilattices
    COMPLETE TOPOLOGIZED POSETS AND SEMILATTICES TARAS BANAKH, SERHII BARDYLA Abstract. In this paper we discuss the notion of completeness of topologized posets and survey some recent results on closedness properties of complete topologized semilattices. 1. Introduction In this paper we discuss a notion of completeness for topologized posets and semilattices. By a poset we understand a set X endowed with a partial order ≤. A topologized poset is a poset endowed with a topology. A topologized poset X is defined to be complete if each non-empty chain C in X has inf C ∈ C¯ and sup C ∈ C¯, where C¯ stands for the closure of C in X. More details on this definition can be found in Section 2, where we prove that complete topologized posets can be equivalently defined using directed sets instead of chains. In Section 4 we study the interplay between complete and chain-compact topologized posets and in Section 5 we study complete topologized semilattices. In Section 6 we survey some known results on the absolute closedness of complete semitopological semilattices and in Section 7 we survey recent results on the closedness of the partial order in complete semitopological semilattices. 2. The completeness of topologized posets In this section we define the notion of a complete topologized poset, which is a topological counterpart of the standard notion of a complete poset, see [10]. First we recall some concepts and notations from the theory of partially ordered sets. A subset C of a poset (X, ≤) is called a chain if any two points x,y ∈ X are comparable in the partial order of X.
    [Show full text]
  • A Topology on Lattice-Ordered Groups
    Available online at www.isr-publications.com/jnsa J. Nonlinear Sci. Appl., 11 (2018), 701–712 Research Article Journal Homepage: www.isr-publications.com/jnsa A topology on lattice-ordered groups Huanrong Wu, Qingguo Li∗, Bin Yu College of Mathematics and Econometrics, Hunan University, Changsha 410082, China. Communicated by M. Bohner Abstract We introduce the concept of the strong-positive cone in a lattice-ordered group (G, 6, ·) and define the continuous lattice- ordered group. We also investigate the C-topology and bi-C-topology given on a lattice-ordered group. The main results obtained in this paper are as follows: (1) (G, 6, ·) is a continuous lattice-ordered group if and only if (G, 6) is a continuous poset; (2) for the bi-C-topology τ in a continuous lattice-ordered group (G, 6, ·), (G, ·, τ) is a topological group and (G, 6, τ) is a topological lattice. Keywords: Lattice-ordered group, continuous, topology, topological group, topological lattice. 2010 MSC: 06F15, 06B35, 54H11. c 2018 All rights reserved. 1. Introduction Lattice-ordered groups (also called l-groups) are an important class of partially ordered algebraic systems. The study of l-groups was initiated by Birkhoff [9, 12] and followed by many other researchers [6, 16, 24]. The monographs [10, 15] gave a systematic account of the basic theory of l-groups. Recently, l-groups have cropped up in many other areas of mathematics, for instance, in the theory of bezout´ domains [36, 37], ordered fields [7, 15], category theory [11], topology theory [5,8, 21] and others [22]. In the 1960s, Scott introduced domain theory [31], aiming to provide mathematical models for com- puter program languages.
    [Show full text]
  • L-Fuzzy Scott Topology and Scott Convergence of Stratified L-Filters
    Electronic Notes in Theoretical Computer Science 257 (2009) 135–152 www.elsevier.com/locate/entcs View metadata, citation and similar papers at core.ac.uk brought to you by CORE L-fuzzy Scott Topology and Scottprovided by Elsevier Convergence - Publisher Connector of Stratified L-filters on Fuzzy Dcpos 1 Wei Yao2 Department of Mathematics Hebei University of Science and Technology Shijiazhuang 050018, China Abstract On a fuzzy dcpo with a frame L as its valued lattice, we define an L-fuzzy Scott topology by means of graded convergence of stratified L-filters. It is a fuzzy counterpart of the classical Scott topology on a crisp dcpo. The properties of L-fuzzy Scott topology are investigated. We establish Scott convergence theory of stratified L-filters. We show that for an L-set, its degree of Scott openness equals to the degree of Scott continuity from the underlying fuzzy dcpo to the lattice L (also being viewed as a fuzzy poset). We also show that a fuzzy dcpo is continuous iff for any stratified L-filter, Scott convergence coincides with topological convergence (w.r.t. the L-fuzzy Scott topology). Keywords: fuzzy dcpo, stratified L-filter, L-fuzzy Scott topology, Scott convergence, topological convergence. 1 Introduction Domain Theory, a formal basis for the semantics of programming languages, originates in work by D. Scott [17,18] in the mid-1960s. Domain models for var- ious types of programming languages, including imperative, functional, non- deterministic and probabilistic languages, have been extensively studied. Quantitative Domain Theory that provides a model of concurrent systems forms a new branch of Domain Theory and has undergone active research in the past three decades.
    [Show full text]
  • Fast and Exact Analysis for LRU Caches∗†
    Fast and exact analysis for LRU caches∗y Valentin Touzeau, Claire Ma¨ıza,and David Monniaux Univ. Grenoble Alpes, CNRS, Grenoble INP,z VERIMAG, 38000 Grenoble, France Jan Reineke Saarland University, Saarbr¨ucken, Germany August 4, 2021 Abstract For applications in worst-case execution time analysis and in security, it is desirable to statically classify memory accesses into those that result in cache hits, and those that result in cache misses. Among cache replace- ment policies, the least recently used (LRU) policy has been studied the most and is considered to be the most predictable. The state-of-the-art in LRU cache analysis presents a tradeoff between precision and analysis efficiency: The classical approach to analyzing pro- grams running on LRU caches, an abstract interpretation based on a range abstraction, is very fast but can be imprecise. An exact analysis was re- cently presented, but, as a last resort, it calls a model checker, which is expensive. In this paper, we develop an analysis based on abstract interpretation that comes close to the efficiency of the classical approach, while achieving exact classification of all memory accesses as the model-checking approach. Compared with the model-checking approach we observe speedups of sev- eral orders of magnitude. As a secondary contribution we show that LRU arXiv:1811.01670v2 [cs.PL] 20 Dec 2018 cache analysis problems are in general NP-complete. ∗This work was partially supported by the European Research Council under the European Union's Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement nr. 306595 \STATOR", and by the Deutsche Forschungsgemeinschaft as part of the project PEP: Pre- cise and Efficient Prediction of Good Worst-case Performance for Contemporary and Future Architectures.
    [Show full text]
  • On the Lattice of Antichains of Finite Intervals
    On the lattice of antichains of finite intervals Paolo Boldi∗ Sebastiano Vignay Abstract Motivated by applications to information retrieval, we study the lattice of antichains of finite intervals of a locally finite, totally ordered set. Intervals are ordered by reverse inclusion; the order between antichains is induced by the lower set they generate. We discuss in general properties of such antichain completions; in particular, their connec- tion with Alexandrov completions. We prove the existence of a unique, irredundant ^-representation by ^-irreducible elements, which makes it possible to write the relative pseudo-complement in closed form. We also discuss in detail properties of additional interesting operators used in information retrieval. Finally, we give a formula for the rank of an element and for the height of the lattice. 1 Introduction Modern information-retrieval systems, such as web search engines, rely on different models to compute the answer to a query. The simplest one is the Boolean model, in which operators are just conjunction, disjunction and negation, and the answer is just “relevant” or “not relevant”. A richer model is given by minimal-interval semantics [4], which uses antichains (w.r.t. inclusion) of intervals (i.e., textual passages in the document) to represent the answer to a query; this is a very natural framework in which operators such as ordered conjunction, proximity restriction, etc., can be defined and combined freely. Each interval in the text of a document is a witness of the satisfiability of the query, that is, it represents a region of the document that satisfies the query. Words in the document are numbered (starting from 0), so regions of text are identified with integer intervals, that is, sets of consecutive natural numbers.
    [Show full text]
  • On Fuzzy Orders and Metrics Vinayak E
    The Bulletin of Society for Mathematical Services and Standards Online: 2014-06-02 ISSN: 2277-8020, Vol. 10, pp 48-52 doi:10.18052/www.scipress.com/BSMaSS.10.48 CC BY 4.0. Published by SciPress Ltd, Switzerland, 2014 On Fuzzy Orders and Metrics Vinayak E. Nikumbh P.V.P.College, Pravaranagar Keywords: fixed point,fuzzy orders,quasi metrics Abstract: In this paper we present results regarding fixed point theory using notion of fuzzy orders.We propose an approach based on quasi metrics which in a way unifies the fixed point theory for ordered sets and metric spaces. 1. Introduction: Much mathematical effort is expanded on solving fixed point equations i.e.equations of the form where is a map. A solution of such fixed point equations,when one exists,often has to be obtained by process of successive approximations.Order theory plays a role when X carries an order and when solution can be realized as joint of elements which approximates it. At some instances we find that fixed point theorems for ordered sets appear to be insufficient . In such cases , it is helpful to apply fixed point techniques in metric spaces. In this paper give some results in this direction. By using the notion of quasi metric spaces we prove a theorem simultaneously generalizing fixed point theorems for ordered structures and metric spaces.All results are interpreted in terms of fuzzy set theory. 2. Preliminaries: We recall some basic notions, is a complete completely distributive lattice. Definition 2.1 Let X be a nonempty set,a fuzzy subset of X is a function :XI.
    [Show full text]
  • The Fixed Point Property of Non-Retractable Topological Spaces
    mathematics Article The Fixed Point Property of Non-Retractable Topological Spaces Jeong Min Kang 1, Sang-Eon Han 2,* and Sik Lee 3 1 Mathematics, School of Liberal, Arts Education, University of Seoul, Seoul 02504, Korea; [email protected] 2 Department of Mathematics Education, Institute of Pure and Applied Mathematics, Chonbuk National University, Jeonju-City Jeonbuk 54896, Korea 3 Department of Mathematics Education, Chonnam National University, Gwangju 500-757, Korea; [email protected] * Correspondence: [email protected]; Tel.: +82-63-270-4449 Received: 2 September 2019; Accepted: 16 September 2019; Published: 21 September 2019 Abstract: Unlike the study of the fixed point property (FPP, for brevity) of retractable topological spaces, the research of the FPP of non-retractable topological spaces remains. The present paper deals with the issue. Based on order-theoretic foundations and fixed point theory for Khalimsky (K-, for short) topological spaces, the present paper studies the product property of the FPP for K-topological spaces. Furthermore, the paper investigates the FPP of various types of connected K-topological spaces such as non-K-retractable spaces and some points deleted K-topological (finite) planes, and so on. To be specific, after proving that not every one point deleted subspace of a finite K-topological plane X is a K-retract of X, we study the FPP of a non-retractable topological space Y, such as one point deleted space Y n fpg. Keywords: Khalimsky topology; K-retraction; non-K-retractable space; fixed point property MSC: 06A06; 54A10; 54C05; 55R15; 54C08; 54F65 1. Introduction To make the paper self-contained, we recall that a mathematical object X has the FPP if every well-behaved mapping f from X to itself has a point x 2 X such that f (x) = x.
    [Show full text]