Abstract
In this paper, a sound notion of “continuous” multifunctions for discrete spaces is introduced. It turns out that a multifunction is continuous (= both upper and lower semi-continuous) if and only if it is “strong”, or equivalently it takes (original) neighbours into (induced) neighbours w.r.t. Hausdor. metric. Generalizing various previous results, we show that any finite contractible graph has the almost fixed point property (afpp) for strong multifunctions. We then turn to the fixed clique property, or fcp (a desirable strengthening of afpp). We are able to establish this property only under much more explicitly geometric assumptions than in the case of afpp. Specifically, we have to restrict to convex-valued multifunctions, over spaces admitting a suitable notion of convexity; and, for the best results, to the standard n-dimensional digital space with (3n - 1)-adjacency. In this way we obtain what may be considered (with reservations, discussed in the Conclusion) as an analogue of the classical Kakutani fixed point theorem.
The second author has been partially supported by EPSRC grant on“Digital Topology and Geometry: an Axiomatic Approach with Applications to GIS and Spatial Reasoning”.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berge, C.: Espaces Topologiques: Fonctions Multivoques. Dunod(1959)
Border, K. C.: Fixed Point Theorems with Applications to Economics and Game Theory. Cambridge University Press (1985)
Boxer, L.: Digitally continuous functions. Pattern Recognition Lett. 15 (1994) 833–839
Brink, C.: Power structures. Algebra Universalis 30 (1993) 177–216.
Čech, E.: Topological Spaces. John Wiley (1966)
Duchet, P., Meyniel, H.: Ensemble convexes dans les graphes I, théorèmes de Helly et de Radon pour graphes et surfaces. European J. Combin. 4 (1983) 127–132
Duchet, P.: Convex sets in graphs II, minimal path convexity. J. Combin. Theory Ser. B 44 (1988) 307–316
Harary, F.: Graph Theory. Addison-Wesley (1969)
Klette, R.: Digital geometry-the birth of a new discipline (preprint)
Kong, T. Y., Rosenfeld, A.: Digital topology: introduction and survey. Computer Vision, Graphics and Image Processing48 (1989) 357–393
Nowakowski, R., Rival, I.: Fixed-edge theorem for graphs with loops. J. Graph Theory 3 (1979) 339–350
Poston, T.: Fuzzy geometry. Ph.D. Thesis. University of Warwick (1971)
Pultr, A.: An analogon of the fixed-point theorem and its application for graphs. Comment. Math. Univ. Carolin. (1963)
Quilliot, A.: Thèse de 3. cycle. Université de Paris VI (1978)
Quilliot, A.: On the Helly property working as a compactness criterion on graphs. J. combin. Theory Ser. A 40 (1985) 186–193
Quilliot, A.: Une extension du problème du point fixe pour des graphes simples. Discrete Math. 111 (1993) 435–445
Rosenfeld, A.: ‘Continuous’ functions on digital pictures. Pattern Recognition Lett. 4 (1986) 177–184
Smyth, M. B.: Semi-metrics, closure spaces and digital topology. Theoret. Comput. Sci. 151 (1995) 257–276
Smyth, M. B., Webster, J.: Finite approximation of functions using inverse sequences of graphs. In: Edalat, A., Jourdan, S. and McCusker, G., eds., Advances in Theory and Formal Methods in Computing: Proceedings of the Third Imperial College Workshop. Imperial College Press (1996)
Smyth, M. B., Tsaur, R.: A digital version of the Kakutani fixed point theorem for convex-valued multifunctions (to appear in Electron. Notes Theor. Comput. Sci.)
Smyth, M. B., Tsaur, R.: AFPP vs FPP: the link between almost fixed point properties of discrete structures and fixed point properties of spaces (submitted for publication)
Stoltenberg-Hansen, V., Lindström, I., Griffor, E. R.: Mathematical Theory of Domains. Cambridge Tracts in Theoretical Computer Science 22. Cambridge University Press (1994)
Tsaur, R., Smyth, M. B.: Convexity and fixed point properties in graphs: a study of many-valued functions in Helly and dismantlable graphs(in preparation)
Webster, J.: Topology and measure theory in the digital setting: on the approximation of spaces by inverse sequences of graphs. Ph.D. Thesis. Imperial College (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Tsaur, R., Smyth, M.B. (2001). “Continuous” Multifunctions in Discrete Spaces with Applications to Fixed Point Theory. In: Bertrand, G., Imiya, A., Klette, R. (eds) Digital and Image Geometry. Lecture Notes in Computer Science, vol 2243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45576-0_5
Download citation
DOI: https://doi.org/10.1007/3-540-45576-0_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43079-7
Online ISBN: 978-3-540-45576-9
eBook Packages: Springer Book Archive