Metraipolis › archive › dc_6739ffaeb812

Scott topologies on meet-continuous domains — arXiv:2609.21274

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.21274
License (as archived)
CC0-1.0
Archived
2026-10-10T02:22:38.190Z
SHA-256 of the archived text
803ce4b20ee15df65b706d6cfbff3405d7c01a622d5b42618cb0060a354fb57f
Stable URL of this page
https://metraipolis.com/documento/dc_6739ffaeb812

How to cite

Scott topologies on meet-continuous domains — arXiv:2609.21274 — arXiv (en), https://arxiv.org/abs/2609.21274 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6739ffaeb812 (Metraipolis archive dc_6739ffaeb812, sha256 803ce4b20ee15df65b706d6cfbff3405d7c01a622d5b42618cb0060a354fb57f)
BibTeX
@misc{dc6739ffaeb812,
  title = {Scott topologies on meet-continuous domains — arXiv:2609.21274},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.21274},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6739ffaeb812; sha256 803ce4b20ee15df65b706d6cfbff3405d7c01a622d5b42618cb0060a354fb57f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21274. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in math.LO).
Categorie arXiv: Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.21274 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T02:04:46.834Z dalla pagina https://arxiv.org/catchup/math.LO/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).