Search arXivSearch

arXiv · 2301.13274

The open dihypergraph dichotomy for generalized Baire spaces and its applications

Abstract

The open graph dichotomy for a subset $X$ of the Baire space ${}^ωω$ states that any open graph on $X$ either admits a coloring in countably many colors or contains a perfect complete subgraph. This strong version of the open graph axiom for $X$ was introduced by Feng and Todorčević to study definable sets of reals. We first show that its recent generalization to infinite dimensional directed hypergraphs by Carroy, Miller and Soukup holds for all subsets of the Baire space in Solovay's model, extending a theorem of Feng in dimension $2$. The main theorem lifts this result to generalized Baire spaces ${}^κκ$ in two ways. (1) For any regular infinite cardinal $κ$, the following holds after a Lévy collapse of an inaccessible cardinal $λ>κ$ to $κ^+$. Suppose that $H$ is a $κ$-dimensional box-open directed hypergraph on a subset of ${}^κκ$ such that $H$ is definable from a $κ$-sequence of ordinals. Then either $H$ admits a coloring in $κ$ many colors or there exists a continuous homomorphism from a canonical large directed hypergraph to $H$. (2) If $λ$ is a Mahlo cardinal, then the previous result extends to all box-open directed hypergraphs on any subset of ${}^κκ$ that is definable from a $κ$-sequence of ordinals. This approach is applied to solve several problems about definable subsets of generalized Baire spaces. For instance, we obtain variants of the Hurewicz dichotomy that characterizes subsets of $K_σ$ sets, strong variants of the Kechris-Louveau-Woodin dichotomy that characterizes when two disjoint sets can be separated by an $F_σ$ set, the determinacy of Väänänen's perfect set game for all subsets of ${}^κκ$, an asymmetric version of the Baire property and an analogue of the Jayne-Rogers theorem that characterizes $G_δ$-measurable functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Philipp Schlicht, Dori Sziráki. 2026-07-19. The open dihypergraph dichotomy for generalized Baire spaces and its applications. https://arxiv.org/abs/2301.13274

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

KEEP EXPLORING

Related papers

Natural Term Logic

In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical meaning. NTL can be seen as a refinement of the ideas of Quine's paper `Variables Explained Away' and the technical concepts introduced by Bealer and Zalta. NTL is more fine-grained than Bealer's first-order intensional logic (BL): there is a many-to-one correspondence $ν$ between NTL terms and closed BL terms as well as a canonical map $β$ which assigns to each closed BL term a corresponding NTL term. The map $ν$ can be seen as assigning a core logical content of the NTL term. We define a series of reductions on NTL terms which intuitivelyy speaking capture meaning-preserving syntactic transformations ( transformations which preserved the basic logical meaning of a term) and our main result is that each NTL term $T$ reduces to a unique normal term $N$. The reductions fall into the structural, predicative and pushing-in categories. Predicative reductions decompose NTL terms so that predication is only applied to a primitive term (such terms are called prenormal). A key ingredient in the proof is the fact that $βνN = N$ when $N$ is normal. This suggests that within NTL the normal form of a term expresses the core logical content of the term.

math.LO

Hyper-hyperfiniteness and complexity

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite, then the complexity of hyperfinite countable Borel equivalence relationsis as high as possible, namely, $Σ^1_2$-complete. We also establish an implication between the question of the effectivity of hyperfiniteness and its complexity.

math.LO

Coordinate recognition: General theory, Groups, and other surprises

A class of structures \emph{recognizes coordinates} if any reduced product of structures from said class witnesses a certain kind of rigidity phenomenon. We provide several equivalent characterizations of this property. This property has (at least) two remarkable consequences, one set-theoretic and one model-theoretic, for reduced products of structures of the said class. First, under appropriate set-theoretic assumptions every isomorphism between such reduced products associated with the Fréchet ideal lifts (modulo a finite change) to an isomorphism between products of the original structures. Second, with an additional mild assumption, it implies a strong quantifier elimination result. Of note, we show that a class recognizes coordinates if and only if an individual formula witnesses a certain syntactic property. We also consider many concrete classes of structures and determine whether or not they recognize coordinates. We place heavy emphasis on well-known classes of groups, such as permutation groups, acylindircally hyperbolic groups, quasisimple groups, free products, and graph products, but we also discuss other classes of structures.

math.LO