Search arXivSearch

arXiv · 1310.6685

Generalized Choquet spaces

Abstract

We introduce an analog to the notion of Polish space for spaces of weight $\leqκ$, where $κ$ is an uncountable regular cardinal such that $κ^{<κ}=κ$. Specifically, we consider spaces in which player II has a winning strategy in a variant of the strong Choquet game which runs for $κ$ many rounds. After discussing the basic theory of these games and spaces, we prove that there is a surjectively universal such space and that there are exactly $2^κ$ many such spaces up to homeomorphism. We also establish a Kuratowski-like theorem that under mild hypotheses, any two such spaces of size $>κ$ are isomorphic by a $κ$-Borel function. We then consider a dynamic version of the Choquet game and show that in this case the existence of a winning strategy for player II implies the existence of a winning tactic, that is, a strategy that depends only on the most recent move. We also study a generalization of Polish ultrametric spaces where the ultrametric is allowed to take values in a set of size $κ$. We show that in this context, there is a family of universal Urysohn-type spaces, and we give a characterization of such spaces which are hereditarily $κ$-Baire.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Samuel Coskey, Philipp Schlicht. 2014-10-20. Generalized Choquet spaces. https://doi.org/10.4064/fm924-12-2015

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