Search arXivSearch

arXiv · 2604.15843

Polish spaces for countable and separable structures through quotient encodings

Abstract

We develop a quotient-based framework for locating natural properties of countable algebraic structures and separable Banach-type structures in the Borel hierarchy. The common idea is to present an object as a quotient of a fixed generator and to read definability from the corresponding kernel or congruence. For separable Banach-type structures, including Banach algebras, $C^*$-algebras and TROs, admissible kernels form Polish spaces; in the Wijsman topology the quotient-norm functional $K\mapsto \|x+K\|$ is continuous. This gives a uniform definability scheme with explicit Borel upper bounds. For countable algebraic structures, congruence spaces are compact zero-dimensional Polish spaces and atomic predicates are clopen. For Banach algebras we obtain, among other estimates, closedness of commutativity, the abstract uniform-algebra norm identity and Dedekind finiteness, and $G_δ$ bounds for topological stable-rank bounds. In the unital $C^*$-algebra coding based on $C^*_{\max}(F_\infty)$ we obtain closedness of stable finiteness and existence of a tracial state, $G_δ$ bounds for AF-ness, MF-ness, approximate divisibility and real-rank bounds; a $Π^0_3$ bound for nuclear dimension; Borelness of nuclearity and simplicity, and analyticity of $D$-absorption for fixed exact $D$. The $G_δ$ bounds for AF-ness, real-rank bounds and topological stable-rank bounds are shown to be sharp by continuous reductions from a canonical $Π^0_2$-complete set. We give an internal Borel coding of the $K_0$-assignment: every coordinate section is $F_σ$, and the resulting map into the standard subgroup coding of countable abelian groups is of Baire class~$2$. Suspension and Bott periodicity, combined with the known standard coding computations, yield Borel codings of $K_1$ and all higher $K$-groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tomasz Kania. 2026-06-15. Polish spaces for countable and separable structures through quotient encodings. https://arxiv.org/abs/2604.15843

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