{"title":"Notes on Smyth-completes and local Yoneda-completes","authors":"Zhenhua Jia, Qingguo Li","doi":"10.1016/j.tcs.2025.115148","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we first introduce the notion of <em>d</em>-net which is obtained being inspired by an elegant characterization: a quasi-metric space <span><math><mo>(</mo><mi>X</mi><mo>,</mo><mi>d</mi><mo>)</mo></math></span> is Smyth-complete if and only if <span><math><mi>B</mi><mo>(</mo><mi>X</mi><mo>,</mo><mi>d</mi><mo>)</mo></math></span> is sober in its open ball topology. Then, we obtain the characterizations of Smyth-complete quasi-metric spaces via <em>d</em>-nets in quasi-metric spaces. Or rather, we prove that a quasi-metric space is Smyth-complete if and only if every <em>d</em>-net has a <em>d</em>-limit and converges to its <em>d</em>-limit. For a local Yoneda-complete quasi-metric space, we provide a necessary and sufficient condition such that the open ball topology coincides with the Scott topology on its formal ball space. In addition, we show that local Yoneda-completeness is preserved by some constructions, such as coproducts, products, function spaces, formal ball spaces and so on. Finally, we prove that the formal ball construction <strong>B</strong> induces the monads on the categories of Smyth-complete quasi-metric spaces with 1-Lipschitz maps, local Yoneda-complete quasi-metric spaces with 1-Lipschitz maps, Smyth-complete quasi-metric spaces with Y-continuous maps and local Yoneda-complete quasi-metric spaces with Y-continuous maps.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1036 ","pages":"Article 115148"},"PeriodicalIF":0.9000,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397525000866","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
摘要
在本文中,我们首先介绍了 d 网的概念,它是受一个优雅的表征启发而获得的:当且仅当 B(X,d) 在其开球拓扑中是清醒的时候,准计量空间 (X,d) 是 Smyth-完备的。然后,我们通过准度量空间中的 d 网获得 Smyth-complete 准度量空间的特征。或者说,我们证明,当且仅当每个 d 网都有一个 d 极限并收敛于其 d 极限时,准计量空间才是 Smyth-完备的。对于局部米田完备的准度量空间,我们提供了一个必要条件和充分条件,即开球拓扑与其形式球空间上的斯科特拓扑重合。此外,我们还证明了局部米田完备性通过一些构造得以保留,如共积、积、函数空间、形式球空间等。最后,我们证明了形式球构造 B 在具有 1-Lipschitz 映射的斯密斯完备准计量空间、具有 1-Lipschitz 映射的局部米田完备准计量空间、具有 Y-continuous 映射的斯密斯完备准计量空间和具有 Y-continuous 映射的局部米田完备准计量空间类别上诱导了单子。
Notes on Smyth-completes and local Yoneda-completes
In this paper, we first introduce the notion of d-net which is obtained being inspired by an elegant characterization: a quasi-metric space is Smyth-complete if and only if is sober in its open ball topology. Then, we obtain the characterizations of Smyth-complete quasi-metric spaces via d-nets in quasi-metric spaces. Or rather, we prove that a quasi-metric space is Smyth-complete if and only if every d-net has a d-limit and converges to its d-limit. For a local Yoneda-complete quasi-metric space, we provide a necessary and sufficient condition such that the open ball topology coincides with the Scott topology on its formal ball space. In addition, we show that local Yoneda-completeness is preserved by some constructions, such as coproducts, products, function spaces, formal ball spaces and so on. Finally, we prove that the formal ball construction B induces the monads on the categories of Smyth-complete quasi-metric spaces with 1-Lipschitz maps, local Yoneda-complete quasi-metric spaces with 1-Lipschitz maps, Smyth-complete quasi-metric spaces with Y-continuous maps and local Yoneda-complete quasi-metric spaces with Y-continuous maps.
期刊介绍:
Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.