English

The Ho-Zhao Problem

Logic in Computer Science 2023-06-22 v3

Abstract

Given a poset PP, the set, Γ(P)\Gamma(P), of all Scott closed sets ordered by inclusion forms a complete lattice. A subcategory C\mathbf{C} of Posd\mathbf{Pos}_d (the category of posets and Scott-continuous maps) is said to be Γ\Gamma-faithful if for any posets PP and QQ in C\mathbf{C}, Γ(P)Γ(Q)\Gamma(P) \cong \Gamma(Q) implies PQP \cong Q. It is known that the category of all continuous dcpos and the category of bounded complete dcpos are Γ\Gamma-faithful, while Posd\mathbf{Pos}_d is not. Ho & Zhao (2009) asked whether the category DCPO\mathbf{DCPO} of dcpos is Γ\Gamma-faithful. In this paper, we answer this question in the negative by exhibiting a counterexample. To achieve this, we introduce a new subcategory of dcpos which is Γ\Gamma-faithful. This subcategory subsumes all currently known Γ\Gamma-faithful subcategories. With this new concept in mind, we construct the desired counterexample which relies heavily on Johnstone's famous dcpo which is not sober in its Scott topology.

Cite

@article{arxiv.1607.03286,
  title  = {The Ho-Zhao Problem},
  author = {Weng Kin Ho and Jean Goubault-Larrecq and Achim Jung and Xiaoyong Xi},
  journal= {arXiv preprint arXiv:1607.03286},
  year   = {2023}
}

Comments

19 pages, 4 figures

R2 v1 2026-06-22T14:52:11.287Z