arXiv subjects
Publications and source records attributed to Omer Ben-Neria.
Assuming the consistency of a weakly compact cardinal above a regular uncountable cardinal $μ$, we prove the consistency of the existence of a wide $μ^+$-Aronszajn tree, i.e. a tree of height and cardinality $μ^+$ with no branches of length $μ^+$, into which every wide $μ^+$-Aronszajn tree can be embedded.
Given infinite cardinals $θ\leq κ$, we ask for the minimal VC-dimension of a cofinal family $\mathcal{F}\subseteq[κ]^{<θ}$. We show that for $θ=ω$ and $κ=\aleph_n$ it is consistent with ZFC that there exists such a family of VC-dimension $n+1$, which is known to be the lower bound. For $θ>ω$ we answer this question completely, demonstrating a strong dichotomy between the case of singular and regular $θ$. We furthermore answer some relative and generalized versions of the above question for singular $θ$, and answer a related question which appears in \cite{BBNKS}.
We study the filter versions of square bracket partition relations, focusing on Jonssonicity and Magidority. We show that the singular cardinals in a Kleinberg sequence above some strong partition cardinal are not Magidor, but the limit of the sequence is Magidor. This is done under AD. We also force over a model of AD to obtain a singular cardinal carrying a Magidor filter.
We construct a model of the form $L[A,U]$ that exhibits the simplest structural behavior of $σ$-complete ultrafilters in a model of set theory with a single measurable cardinal $κ$ , yet satisfies $2^κ= κ^{++}$. This result establishes a limitation on the extent to which structural properties of ultrafilters can determine the cardinal arithmetic at large cardinals, and answers a question posed by Goldberg concerning the failure of the Continuum Hypothesis at a measurable cardinal in a model of the Ultrapower Axiom. The construction introduces several methods in extensions of embeddings theory and fine-structure-based forcing, designed to control the behavior of non-normal ultrafilters in generic extensions.
Definable stationary sets, and specifically, ordinal definable ones, play a significant role in the study of canonical inner models of set theory and the class HOD of hereditarily ordinal definable sets. Fixing a certain notion of definability and an uncountable cardinal, one can consider the associated family of definable closed unbounded sets. In this paper, we study the extent to which such families can approximate the full closed unbounded filter, and their dependence on the defining complexity. Focusing on closed unbounded subsets of a cardinal $κ$ which are $Σ_1$-definable in parameters from $H_κ$ and ordinal parameters, we show that the ability of such closed unbounded sets to well approximate the closed unbounded filter on $κ$ can highly vary, and strongly depends on key properties of the underlying universe of set theory.
In this paper we prove that from large cardinals it is consistent that there is a singular strong limit cardinal $ν$ such that the singular cardinal hypothesis fails at $ν$ and every collection of fewer than $\mathrm{cf}(ν)$ stationary subsets of $ν^+$ reflects simultaneously. For $\mathrm{cf}(ν) > ω$, this situation was not previously known to be consistent. Using different methods, we reduce the upper bound on the consistency strength of this situation for $\mathrm{cf}(ν) = ω$ to below a single partially supercompact cardinal. The previous upper bound of infinitely many supercompact cardinals was due to Sharon.
We study cofinal systems of finite subsets of $ω_1$. We show that while such systems can be NIP, they cannot be defined in an NIP structure. We deduce a positive answer to a question of Chernikov and Simon from 2013: in an NIP theory, any uncountable externally definable set contains an infinite definable subset. A similar result holds for larger cardinals.
We study the logical properties of infinite geometric random graphs, introduced by Bonato and Janssen. These are graphs whose vertex set is a dense ``generic'' subset of a metric space, where two vertices are adjacent with probability $p>0$ provided the distance between them is bounded by some constant number. We prove that for a large class of metric spaces, including circles, spheres and the complete Urysohn space, almost all geometric random graphs on a given space are elementary equivalent. Moreover, their first-order theory can reveal geometric properties of the underlying metric space.
We introduce a combinatorial notion of measures called Rudin-Keisler capturing and use it to give a new construction of elementary substructures around singular cardinals. The new construction is used to establish mutual stationary results at the first successor of singular cardinals $\langle \aleph_{ωn + 1}\rangle_{n< ω}$.
We prove several consistency results concerning the notion of $ω$-strongly measurable cardinal in HOD. In particular, we show that is it consistent, relative to a large cardinal hypothesis weaker than $o(κ) = κ$, that every successor of a regular cardinal is $ω$-strongly measurable in HOD.
We isolate \emph{the approximating diamond principles}, which are consequences of the diamond principle at an inaccessible cardinal. We use these principles to find new methods for negating the diamond principle at large cardinals. Most notably, we demonstrate, using Gitik's overlapping extenders forcing, a new method to get the consistency of the failure of the diamond principle at a large cardinal $θ$ without changing cofinalities or adding fast clubs to $θ$. In addition, we show that the approximating diamond principles necessarily hold at a weakly compact cardinal. This result, combined with the fact that in all known models where the diamond principle fails the approximating diamond principles also fail at an inaccessible cardinal, exhibits essential combinatorial obstacles to make the diamond principle fail at a weakly compact cardinal.
We prove that it is consistent that Club Stationary Reflection and the Special Aronszajn Tree Property simultaneously hold on $ω_2$, thereby contributing to the study of the tension between compactness and incompactness in set theory. The poset which produces the final model follows the collapse of an ineffable cardinal first with an iteration of club adding (with anticipation) and second with an iteration specializing Aronszajn trees. In the first part of the paper, we prove a general theorem about specializing Aronszajn trees on $ω_2$ after forcing with what we call $\mathcal{F}$-Strongly Proper posets, where $\mathcal{F}$ is either the weakly compact filter or the filter dual to the ineffability ideal. This type of poset, of which the Levy collapse is a degenerate example, uses systems of exact residue functions to create many strongly generic conditions. We prove a new result about stationary set preservation by quotients of this kind of poset; as a corollary, we show that the original Laver-Shelah model, which starts from a weakly compact cardinal, satisfies a strong stationary reflection principle, though it fails to satisfy the full Club Stationary Reflection. In the second part, we show that the composition of collapsing and club adding (with anticipation) is an $\mathcal{F}$-Strongly Proper poset. After proving a new result about Aronszajn tree preservation, we show how to obtain the final model.
We investigate the interaction between compactness principles and guessing principles in the Radin forcing extensions. In particular, we show that in any Radin forcing extension with respect to a measure sequence on $κ$, if $κ$ is weakly compact, then $\diamondsuit(κ)$ holds. This provides contrast with a well-known theorem of Woodin, who showed that in a certain Radin extension over a suitably prepared ground model relative to the existence of large cardinals, the diamond principle fails at a strongly inaccessible Mahlo cardinal. Refining the analysis of the Radin extensions, we consistently demonstrate a scenario where a compactness principle, stronger than the diagonal stationary reflection principle, holds yet the diamond principle fails at a strongly inaccessible cardinal, improving a result from \cite{BN19}.
Shelah showed that the existence of free subsets over internally approachable subalgebras follows from the failure of the PCF conjecture on intervals of regular cardinals. We show that a stronger property called the Approachable Bounded Subset Property can be forced from the assumption of a cardinal $λ$ for which the set of Mitchell orders $\{ o(μ) \mid μ< λ\}$ is unbounded in $λ$. Furthermore, we study the related notion of continuous tree-like scales, and show that such scales must exist on all products in canonical inner models. We use this result, together with a covering-type argument, to show that the large cardinal hypothesis from the forcing part is optimal.
It is known that the behavior of the Mitchell order substantially changes at the level of rank-to-rank extenders, as it ceases to be well-founded. While the possible partial order structure of the Mitchell order below rank-to-rank extenders is considered to be well understood, little is known about the structure in the ill-founded case. The purpose of the paper is to make a first step in understanding this case, by studying the extent to which the Mitchell order can be ill-founded. Our main results are (i) in the presence of a rank-to-rank extender there is a transitive Mitchell order decreasing sequence of extenders of any countable length, and (ii) there is no such sequence of length $ω_1$.
Motivated by the goal of constructing a model in which there are no $κ$-Aronszajn trees for any regular $κ>\aleph_1$, we produce a model with many singular cardinals where both the singular cardinals hypothesis and weak square fail.
We study the consistency and consistency strength of various configurations concerning the cardinal characteristics $\mathfrak{s}_θ,\mathfrak{p}_θ,\mathfrak{g}_θ,\mathfrak{r}_θ,\mathfrak{t}_θ$ at uncountable regular cardinals $θ$. Motivated by a theorem of Raghavan-Shelah who proved that $\mathfrak{s}_θ\leq\mathfrak{b}_θ$, we explore in the first part of the paper the consistency of inequalities comparing $\mathfrak{s}_θ$ with $\mathfrak{p}_θ$ and $\mathfrak{g}_θ$. In the second part of the paper we study variations of the extender-based Radin forcing to establish several consistency results concerning $\mathfrak{r}_θ$ from hyper-measurability assumptions, results which were previously known to be consistent only from supercompactness assumptions. In doing so, we answer several questions which appeared in the literature.
We prove the consistency of the failure of the weak diamond $Φ_λ$ at strongly inaccessible cardinals. On the other hand, we show that the very weak diamond $Ψ_λ$ is equivalent to the statement $2^{<λ}<2^λ$ and hence holds at every strongly inaccessible cardinal.