{"title":"滤波良好的 dcpos 类别并非忠实于 $Γ$","authors":"Hualin Miao, Huijun Hou, Xiaodong Jia, Qingguo Li","doi":"arxiv-2409.01546","DOIUrl":null,"url":null,"abstract":"The Ho-Zhao problem asks whether any two dcpo's with isomorphic Scott closed\nset lattices are themselves isomorphic, that is, whether the category\n$\\mathbf{DCPO}$ of dcpo's and Scott-continuous maps is $\\Gamma$-faithful. In\n2018, Ho, Goubault-Larrecq, Jung and Xi answered this question in the negative,\nand they introduced the category $\\mathbf{DOMI}$ of dominated dcpo's and proved\nthat it is {$\\Gamma$-faithful}. Dominated dcpo's subsume many familiar families\nof dcpo's in domain theory, such as the category of bounded-complete dcpo's and\nthat of sober dcpo's, among others. However, it is unknown whether the category\nof dominated dcpo's dominates all well-filtered dcpo's, a class strictly larger\nthan that of bounded-complete lattices and that of sober dcpo's. In this paper,\nwe address this very natural question and show that the category $\\mathbf{WF}$\nof well-filtered dcpo's is not $\\Gamma$-faithful, and as a result of it,\nwell-filtered dcpo's need not be dominated in general. Since not all dcpo's are\nwell-filtered, our work refines the results of Ho, Goubault-Larrecq, Jung and\nXi. As a second contribution, we confirm that the Lawson's category of\n$\\Omega^{*}$-compact dcpo's is $\\Gamma$-faithful. Moreover, we locate a class\nof dcpo's which we call weakly dominated dcpo's, and show that this class is\n$\\Gamma$-faithful and strictly larger than $\\mathbf{DOMI}$.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"24 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The category of well-filtered dcpos is not $Γ$-faithful\",\"authors\":\"Hualin Miao, Huijun Hou, Xiaodong Jia, Qingguo Li\",\"doi\":\"arxiv-2409.01546\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Ho-Zhao problem asks whether any two dcpo's with isomorphic Scott closed\\nset lattices are themselves isomorphic, that is, whether the category\\n$\\\\mathbf{DCPO}$ of dcpo's and Scott-continuous maps is $\\\\Gamma$-faithful. In\\n2018, Ho, Goubault-Larrecq, Jung and Xi answered this question in the negative,\\nand they introduced the category $\\\\mathbf{DOMI}$ of dominated dcpo's and proved\\nthat it is {$\\\\Gamma$-faithful}. Dominated dcpo's subsume many familiar families\\nof dcpo's in domain theory, such as the category of bounded-complete dcpo's and\\nthat of sober dcpo's, among others. However, it is unknown whether the category\\nof dominated dcpo's dominates all well-filtered dcpo's, a class strictly larger\\nthan that of bounded-complete lattices and that of sober dcpo's. In this paper,\\nwe address this very natural question and show that the category $\\\\mathbf{WF}$\\nof well-filtered dcpo's is not $\\\\Gamma$-faithful, and as a result of it,\\nwell-filtered dcpo's need not be dominated in general. Since not all dcpo's are\\nwell-filtered, our work refines the results of Ho, Goubault-Larrecq, Jung and\\nXi. As a second contribution, we confirm that the Lawson's category of\\n$\\\\Omega^{*}$-compact dcpo's is $\\\\Gamma$-faithful. Moreover, we locate a class\\nof dcpo's which we call weakly dominated dcpo's, and show that this class is\\n$\\\\Gamma$-faithful and strictly larger than $\\\\mathbf{DOMI}$.\",\"PeriodicalId\":501208,\"journal\":{\"name\":\"arXiv - CS - Logic in Computer Science\",\"volume\":\"24 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.01546\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.01546","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The category of well-filtered dcpos is not $Γ$-faithful
The Ho-Zhao problem asks whether any two dcpo's with isomorphic Scott closed
set lattices are themselves isomorphic, that is, whether the category
$\mathbf{DCPO}$ of dcpo's and Scott-continuous maps is $\Gamma$-faithful. In
2018, Ho, Goubault-Larrecq, Jung and Xi answered this question in the negative,
and they introduced the category $\mathbf{DOMI}$ of dominated dcpo's and proved
that it is {$\Gamma$-faithful}. Dominated dcpo's subsume many familiar families
of dcpo's in domain theory, such as the category of bounded-complete dcpo's and
that of sober dcpo's, among others. However, it is unknown whether the category
of dominated dcpo's dominates all well-filtered dcpo's, a class strictly larger
than that of bounded-complete lattices and that of sober dcpo's. In this paper,
we address this very natural question and show that the category $\mathbf{WF}$
of well-filtered dcpo's is not $\Gamma$-faithful, and as a result of it,
well-filtered dcpo's need not be dominated in general. Since not all dcpo's are
well-filtered, our work refines the results of Ho, Goubault-Larrecq, Jung and
Xi. As a second contribution, we confirm that the Lawson's category of
$\Omega^{*}$-compact dcpo's is $\Gamma$-faithful. Moreover, we locate a class
of dcpo's which we call weakly dominated dcpo's, and show that this class is
$\Gamma$-faithful and strictly larger than $\mathbf{DOMI}$.