Abstract
This note shows that several statements about fixpoints in order theory are equivalent to Knaster–Tarski Fixpoint Theorem for complete lattices. All proofs have been done in Zermelo–Fraenkel set theory without the Axiom of Choice.
Similar content being viewed by others
References
Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5(2), 285–309 (1955)
Bourbaki, N.: Sur le th\(\acute{e}\)or\(\grave{e}\)me de Zorn. Archiv der Mathematik 2, 434–437 (1949)
Witt, E.: Beweisstudien zum satz von M. Zorn. Math. Nachr. 4, 434–438 (1951)
Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, New York (2002)
Thomas, S.: Domain-Theoretic Foundations of Functional Programming. World Scientific Pub. Co., Inc., New Jersey (2006)
Markowsky, G.: Chain-complete posets and directed sets with applications. Algebra Univers. 6, 53–68 (1976)
Lang, S.: Algebra, Revised, 3rd edn. Springer, New York (2002)
Acknowledgements
Authors are grateful to the anonymous referees for their insightful suggestions which are very detailed and extremely helpful in improving the presentation of this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Presented by R. Pöschel.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This research is supported by “Double-first-class” Applied Characteristic Construction Discipline (Applied Economics) in Hunan Province (Grant no. Xiangjiaotong [2018] 469), and supported by NSF of China 61772336.
Rights and permissions
About this article
Cite this article
Huang, M., Fu, Y. A note on the Knaster–Tarski Fixpoint Theorem. Algebra Univers. 81, 47 (2020). https://doi.org/10.1007/s00012-020-00676-4
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00012-020-00676-4