Skip to content
DraconiticResearch
Search Sources API
190,332 studies31 sourcesUpdated 28 min ago
PreprintCC BY 4.0arXiv

Scott topologies on meet-continuous domains

Abstract

We study Scott products and sobriety of countable meet-continuous domains, meaning meet-continuous dcpos without any additional continuity or least-element assumption. Using the complete-lattice test-family theorem of Xu and Ji, we prove finite-product equality for those domains that are L-dcpos, and for the weaker class whose principal ideals have suprema of all nonempty subsets. For an arbitrary family of nonempty countable meet-continuous L-dcpos, we prove that the Scott topology on the order product equals the product of the factor Scott topologies if and only if only finitely many factors lack a least element. We also establish sobriety under bounded completeness and under additional common-upper-bound conditions. Assuming square-product equality, sobriety is characterized by Scott closedness of common-upper-bound sections associated with irreducible Scott-closed sets, with an equivalent sequential formulation in the countable case. Two extraction lemmas extend to meet-semilattice dcpos. The finite-product and sobriety questions for general countable meet-continuous domains remain unresolved here.

Related

  1. Every countable meet-continuous lattice is Scott sober
    Xiaoquan Xu, Wei Ji
    arXivPreprintCC BY 4.0Full textLogic & foundationsarXiv
  2. Scott products and sobriety of countable meet-continuous dcpos
    Xiaoquan Xu, Wei Ji
    arXivPreprintCC BY 4.0Full textLogic & foundationsarXiv
  3. Sobriety of Scott topologies under countability conditions
    Zhengmao He, Zhaochen Dong, Kaiyun Wang
    arXivPreprintCC BY 4.0Full textGeometry & topologyarXiv
  4. Scott topologies on products of countable complete Heyting algebras
    Xiaoquan Xu
    arXivPreprintCC BY 4.0Full textLogic & foundationsarXiv
  5. Scott--Isbell Coincidence for Continuous Dcpos beyond Bicompleteness
    Yuxu Chen, Yunjie Wen, Xiaoyong Xi
    arXivPreprintCC BY-NC-SA 4.0Full textGeometry & topologyarXiv
BibTeX
@misc{xu2026scott,
  title = {{Scott topologies on meet-continuous domains}},
  author = {Xiaoquan Xu},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.21274},
  eprint = {2609.21274},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.21274},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Scott topologies on meet-continuous domains
AU  - Xiaoquan Xu
PY  - 2026
DA  - 2026/09/18
PB  - arXiv
DO  - 10.48550/arxiv.2609.21274
UR  - https://arxiv.org/abs/2609.21274
AB  - We study Scott products and sobriety of countable meet-continuous domains, meaning meet-continuous dcpos without any additional continuity or least-element assumption. Using the complete-lattice test-family theorem of Xu and Ji, we prove finite-product equality for those domains that are L-dcpos, and for the weaker class whose principal ideals have suprema of all nonempty subsets. For an arbitrary family of nonempty countable meet-continuous L-dcpos, we prove that the Scott topology on the order product equals the product of the factor Scott topologies if and only if only finitely many factors lack a least element. We also establish sobriety under bounded completeness and under additional common-upper-bound conditions. Assuming square-product equality, sobriety is characterized by Scott closedness of common-upper-bound sections associated with irreducible Scott-closed sets, with an equivalent sequential formulation in the countable case. Two extraction lemmas extend to meet-semilattice dcpos. The finite-product and sobriety questions for general countable meet-continuous domains remain unresolved here.
ER  -