Papers
Topics
Authors
Recent
Search
2000 character limit reached

Scott products and sobriety of countable meet-continuous dcpos

Published 2 Oct 2026 in math.LO | (2610.02642v1)

Abstract: We study Scott-product compatibility and sobriety for countable meet-continuous directed-complete partial orders (dcpos). We construct a countable meet-continuous dcpo R\mathcal R whose Scott space is well-filtered but not sober, although the Scott topology on every finite power is the product of the factor Scott topologies. The ideals of R\mathcal R admit a unique finite-parameter description. We also construct a countable meet-continuous dcpo H\mathbb{H} with a greatest element whose Scott space is coherent and well-filtered, but whose Scott square has a topology strictly finer than the ordinary product topology. These constructions answer negatively two questions about countable meet-continuous dcpos. On the positive side, we prove that a meet-continuous LL-dcpo, meaning a dcpo whose principal ideals are complete lattices, is Scott sober whenever its Scott square carries the ordinary product topology. This answers Jia's core-compactness question affirmatively for LL-dcpos without any countability assumption. Finally, we characterize well-filteredness of LL-dcpos by boundedness of closed Rudin sets and formulate related open questions.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.