Search arXivSearch

arXiv · 2608.15044

$ω_1$-anchored labels in minimal counterexamples to Vaught's conjecture: a per-witness trichotomy and an unconditional stationary dichotomy

Abstract

Let $φ$ be a minimal counterexample to Vaught's conjecture in the sense of Montalban; such a $φ$ exists if Vaught's conjecture fails, by Steel and Harnik-Makkai. We bring into contact, at the level of statements, two bodies of work on the models of such a $φ$: the analysis of Gonzalez-Rossegger-Turetsky, in which at every countable level $β$ exactly one back-and-forth class $C_β$ is uncountable and, at fixed points of an associated function, has a distinguished member of least Scott rank (its label); and the supply of models with prescribed $ω_1^A$ from higher recursion theory, namely Montalban's Gandy-basis lemma and Sacks' $Σ_1$-hull club. All results are theorems of ZFC under standing hypotheses (H0)-(H3). We prove: (i) a per-witness trichotomy -- for every limit $λ$ in the fixed-point club above $qr(φ)$, every model $A$ of $φ$ with $ω_1^A=λ$ and Scott rank at least $λ$ either is the label $K_λ$, or lies outside $C_{λ+1}$ and so forces two non-isomorphic models of Scott rank $λ+1$, or is the label $K_{λ+1}$ and attains the Nadel bound; (ii) coordinate identities: the first and third branches are equivalent, level by level, to computations of $ω_1$ of the labels; (iii) a seeding theorem: on a club, Sacks' construction supplies at every level a model of top rank with prescribed $ω_1$, and his atomic chain consists of the labels; (iv) an unconditional stationary dichotomy: on that club, either stationarily many successor levels carry two non-isomorphic models of Scott rank $λ+1$, or stationarily many labels attain the Nadel bound. On the fiber of models with $ω_1=λ$ we further prove uniqueness of the node-saturated model and give a complete isomorphism invariant with countable spectrum. We prove nothing bearing on Vaught's conjecture itself.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohammad Assem Mahmoud. 2026-08-15. $ω_1$-anchored labels in minimal counterexamples to Vaught's conjecture: a per-witness trichotomy and an unconditional stationary dichotomy. https://arxiv.org/abs/2608.15044

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Loops, Inverse Limits and Non-Determinism

We introduce an operator on problems in Weihrauch complexity, which we call the infinite loop or inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a sequence of results in an infinite loop, using some fixed subroutine. We prove that the corresponding operator is monotone with respect to (strong) Weihrauch reducibility but that it is not a closure operator. One of our findings is that weak Kőnig's lemma is closed under infinite loops, which implies that the class of non-deterministically computable problems is also closed under this operation. Consequently, this class allows for a high degree of flexibility in programming. As our main technical tools, we present an injective version of the recursion theorem and an infinitary version of the so-called independent choice theorem. We also show that, in general, the infinite loop operator is more powerful than the composition of the diamond operator followed by the parallelization operator. However, in many practical scenarios, these compositions yield a result, which coincides with the application of the infinite loop operator. Finally, we discuss the special situation of loops for single-valued problems and for problems on Turing degrees.

math.LO

Scott topologies on meet-continuous domains

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.

math.LO

Randomized Borel $(2d+1)$-coloring of digraphs

Let $G$ be a Borel digraph with maximum out-degree $d \in \mathbb{N}$. We show that $G$ admits a random Borel $(2d+1)$-coloring for which every edge is almost surely not monochromatic. This gives a simpler proof of a recent result of Pelayo-Gómez: such a graph $G$ admits a measurable proper $(2d+1)$-coloring with respect to any Borel probability measure on $V(G)$. Our proof is an adaptation of Pelayo-Gómez's proof to the randomized Borel setting.

math.LO