Every countable meet-continuous lattice is Scott sober
Xiaoquan Xu, Wei Ji
Abstract
We prove that every countable meet-continuous lattice is Scott sober. For any family of such lattices, the Scott topology on the product equals the product of the factor Scott topologies, and the product Scott space is sober. These results answer affirmatively Questions 7.1 and 7.2 of Xu (arXiv:2609.18032v1), extending the countable-frame results beyond finite distributivity. A diagonal argument on meet coordinates extracts directed punctured intervals from nonprincipal ideals. Join translates of these intervals form a countable family detecting Scott openness and yield Scott open rectangles by successive finite choices. We also show that the cardinal spectrum of Scott non-sober meet-continuous lattices is upward closed and, under the Continuum Hypothesis, consists of all uncountable cardinals.
Create a lesson
Related papers
Logarithmic--exponential preparation in sharply o-minimal structures
Gal Binyamini, Oded Carmon, Dmitry Novikov
Stoic Logic and Natural Term Logic
Clarence Lewis Protin
From raw Solvability Complexity Index proofs to Weihrauch degrees
Christopher Sorg
Existence of bases implies the axiom of choice, a foundation-free proof
Gabriel Fernandes, Renan Maneli Mezabarba, Vinicius de Oliveira Rodrigues
A minimal type of Morley rank ω in a partial differential field
Piotr Kowalski
Coding is non-robust
Sam Sanders