Search arXivSearch

arXiv · 2311.00376

Descriptive properties of I2-embeddings

Abstract

We contribute to the study of generalizations of the Perfect Set Property and the Baire Property to subsets of spaces of higher cardinalities, like the power set $P(λ)$ of a singular cardinal $λ$ of countable cofinality or products $\prod_{i<ω}λ_i$ for a strictly increasing sequence $\langleλ_i ~ \vert ~ i<ω\rangle$ of cardinals. We consider the question under which large cardinal hypotheses classes of definable subsets of these spaces possess such regularity properties, focusing on rank-into-rank axioms and classes of sets definable by $Σ_1$-formulas with parameters from various collections of sets. We prove that $ω$-many measurable cardinals, while sufficient to prove the Perfect Set Property of all $Σ_1$-definable sets with parameters in $V_λ\cup\{V_λ\}$, are not enough to prove it if there is a cofinal sequence in $λ$ in the parameters. For this conclusion, the existence of an I2-embedding is enough, but there are parameters in $V_{λ+1}$ for which I2 is still not enough. The situation is similar for the Baire Property: under I2 all sets that are $Σ_1$-definable using elements of $V_λ$ and a cofinal sequence as parameters have the Baire property, but I2 is not enough for some parameter in $V_{λ+1}$. Finally, the existence of an I0-embedding implies that all sets that are $Σ^1_n$-definable with parameters in $V_{λ+1}$ have the Baire property.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vincenzo Dimonte, Martina Iannella, Philipp Lücke. 2024-11-04. Descriptive properties of I2-embeddings. https://arxiv.org/abs/2311.00376

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