Search arXivSearch

arXiv · 2408.00102

Multidimensional asymptotic classes

Abstract

We develop a general framework (multidimensional asymptotic classes, or m.a.c.s) for handling classes of finite first order structures with a strong uniformity condition on cardinalities of definable sets: The condition asserts that definable families given by a formula ϕ(x,y) should take on a fixed number n_ϕof approximate sizes in any M in the class, with those sizes varying with M. The prototype is the class of all finite fields, where the uniformity is given by a theorem of Chatzidakis, van den Dries and Macintyre. It inspired the development of asymptotic classes of finite structures, which this new framework extends. The underlying theory of m.a.c.s is developed, including preservation under bi-interpretability, and a proof that for the m.a.c. condition to hold it suffices to consider formulas ϕ(x,y) with x a single variable. Many examples of m.a.c.s are given, including 2-sorted structures (F,V) where V is a vector space over a finite field F possibly equipped with a bilinear form, and an example arising from representations of quivers of finite representation type. We also give examples and structural results for multidimensional exact classes (m.e.c.s), where the definable sets take a fixed number of precisely specified cardinalities, which again vary with M. We also develop a notion of infinite generalised measurable structure, whereby definable sets are assigned values in an ordered semiring. We show that any infinite ultraproduct of a m.a.c. is generalised measurable, that values can be taken in an ordered ring if the m.a.c. is a m.e.c., and explore model-theoretic consequences of generalised measurability. Such a structure cannot have the strict order property, and stability-theoretic properties can be read off from the measures in the semiring.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sylvy Anscombe, Dugald Macpherson, Charles Steinhorn, Daniel Wolf. 2024-07-31. Multidimensional asymptotic classes. https://arxiv.org/abs/2408.00102

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