Skip to main content

Tool-Based Relational Investigation of Closure-Interior Relatives for Finite Topological Spaces

  • Conference paper
  • First Online:
Relational and Algebraic Methods in Computer Science (RAMICS 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10226))

Abstract

In a topological space \((X,\mathcal {T})\) at most 7 distinct sets can be constructed from a set \(A \in 2^X\) by successive applications of the closure and interior operation in any order. If sets so constructed are called closure-interior relatives of A, then for each topological space \((X,\mathcal {T})\) with \(|X| \ge 7\) there exists a set with 7 closure-interior relatives; for \(|X| < 7\), however, 7 closure-interior relatives of a set cannot co-exist. Using relation algebra and the RelView tool we compute all closure-interior relatives for all topological spaces with less than 7 points. From these results we obtain that for all finite topological spaces \((X,\mathcal {T})\) the maximum number of closure-interior relatives of a set is |X|, with one exception: For the indiscrete topology \(\mathcal {T}= \{\emptyset ,X\}\) on a set X with \(|X|=2\) there exist two sets which possess \(|X|+1\) closure-interior relatives.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alexandroff, P.: Diskrete Räume. Mat. Sb. NS 2, 501–518 (1937)

    MATH  Google Scholar 

  2. Anusiak, J., Shum, K.P.: Remarks on finite topological spaces. Colloq. Math. 23, 217–223 (1971)

    MathSciNet  MATH  Google Scholar 

  3. Aull, C.E.: Classification of topological speces. Bull. Acad. Polon. Sci. Ser. Math. Astro. Phys. 15, 773–778 (1967)

    MathSciNet  Google Scholar 

  4. Berghammer, R., Leoniuk, B., Milanese, U.: Implementation of relational algebra using binary decision diagrams. In: de Swart, H.C.M. (ed.) RelMiCS 2001. LNCS, vol. 2561, pp. 241–257. Springer, Heidelberg (2002). doi:10.1007/3-540-36280-0_17

    Chapter  Google Scholar 

  5. Berghammer, R., Neumann, F.: RelView – an OBDD-based computer algebra system for relations. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2005. LNCS, vol. 3718, pp. 40–51. Springer, Heidelberg (2005). doi:10.1007/11555964_4

    Chapter  Google Scholar 

  6. Berghammer, R., Winter, M.: Embedding mappings and splittings with applications. Acta Inform. 47, 77–110 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Berghammer, R.: Column-wise extendible vector expressions and the relational computation of sets of sets. In: Hinze, R., Voigtländer, J. (eds.) MPC 2015. LNCS, vol. 9129, pp. 238–256. Springer, Cham (2015). doi:10.1007/978-3-319-19797-5_12

    Chapter  Google Scholar 

  8. Berghammer, R., Winter, M.: Solving computational tasks on finite topologies by means of relation algebra and the RelView tool. J. Log. Algebr. Methods Program. 88, 1–25 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  9. Chapman, T.A.: A further note on closure and interior operations. Am. Math. Mon. 68, 524–529 (1962)

    Article  MATH  Google Scholar 

  10. Erné, M., Stege, K.: Counting finite posets and topologies. Order 8, 247–265 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  11. Gardner, B.J., Jackson, M.: The Kuratowski closure-complement theorem. N. Z. J. Math. 38, 9–44 (2008)

    MathSciNet  MATH  Google Scholar 

  12. Herda, H.H., Metzler, R.C.: Closure and interior in finite topological spaces. Colloq. Math. 15, 211–216 (1966)

    MathSciNet  MATH  Google Scholar 

  13. Kelley, J.L.: General Topology. Springer, New York (1975)

    MATH  Google Scholar 

  14. Kuratowski, C.: Sur l’opération \(\overline{A}\) de l’analysis situs. Fund. Math. 3, 182–199 (1922)

    MATH  Google Scholar 

  15. Langford, E.: Characterization of Kuratowski 14-sets. Am. Math. Mon. 78, 362–367 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  16. Schmidt, G.: Relational Mathematics. Cambridge University Press, Cambridge (2010)

    Book  MATH  Google Scholar 

  17. Schmidt, G., Berghammer, R.: Contact, closure, topology, and the linking of rows and column types. J. Log. Algebr. Program. 80, 339–361 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  18. Schmidt, G.: A point-free relation-algebraic approach to general topology. In: Höfner, P., Jipsen, P., Kahl, W., Müller, M.E. (eds.) RAMICS 2014. LNCS, vol. 8428, pp. 226–241. Springer, Cham (2014). doi:10.1007/978-3-319-06251-8_14

    Chapter  Google Scholar 

  19. Sheman, D.: Variations on Kuratowski’s 14-set theorem. Am. Math. Mon. 117, 113–123 (2010)

    Article  MathSciNet  Google Scholar 

  20. RelView-homepage: http://www.informatik.uni-kiel.de/~progsys/relview/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rudolf Berghammer .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Berghammer, R. (2017). Tool-Based Relational Investigation of Closure-Interior Relatives for Finite Topological Spaces. In: Höfner, P., Pous, D., Struth, G. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2017. Lecture Notes in Computer Science(), vol 10226. Springer, Cham. https://doi.org/10.1007/978-3-319-57418-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57418-9_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57417-2

  • Online ISBN: 978-3-319-57418-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics