Search arXiv⌕ Search

arXiv · 2609.32338

The effects of forcing on exacting and ultraexacting cardinals

Abstract

Motivated by recent work of Aguilera--Bagaria--Lücke and Aguilera--Bagaria--Goldberg--Lücke (ABGL), we analyze various effects of set-theoretic forcing upon the classes of exacting and ultraexacting cardinals. Using Magidor support products of Prikry forcings, we prove that an I2-embedding yields a transitive, set-sized model of ZFC with a proper class of exacting cardinals. We show that under Woodin's HOD Conjecture, no exacting cardinal can be a limit of exacting cardinals. In contrast, we prove that models of ZF containing large cardinals beyond choice have forcing extensions that are models of ZFC in which a regular cardinal is a stationary limit of ultraexacting cardinals. We also show that, assuming the HOD Conjecture, an analogue of the classical Levy--Solovay theorem holds for exacting and ultraexacting cardinals. Finally, we analyze the large cardinal properties possessed by exacting cardinals in HOD. We prove that if $λ$ is exacting and $V_λ$ satisfies the HOD Hypothesis, then $λ$ has strong large cardinal properties in HOD. Carrying forward forcing constructions from ABGL, we start with a model of ZFC with an I2-embedding and produce a model of ZF in which the successor of an exacting cardinal $λ$ is extendible in all models of the form $\mathrm{HOD}_x$ for $x\subseteq λ$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Philipp Lücke, Alejandro Poveda. 2026-09-26. The effects of forcing on exacting and ultraexacting cardinals. https://arxiv.org/abs/2609.32338

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

KEEP EXPLORING

Related papers

Freely adding one layer of quantifiers to a Boolean doctrine

We describe the layer of quantifier alternation depth at most one of the quantifier completion of a Boolean doctrine over a small category. This amounts to a doctrinal version of Herbrand's theorem for formulas with quantifier alternation depth at most one modulo a universal theory. The resulting construction satisfies a universal property that makes it the free QA-one-step Boolean doctrine. To achieve this version of Herbrand's theorem, we characterize, within the doctrinal setting, the classes $A$ of quantifier-free formulas for which there is a model $M$ such that $A$ is precisely the class of formulas whose universal closure is valid in $M$.

math.LO↗

Generalized Borel Sets

Generalizing classical descriptive set theory opens foundational questions about the Borel hierarchy. In this paper we systematically study those questions, working in the general framework of Polish-like spaces relative to an uncountable cardinal $κ$, possibly singular, satisfying $2^{<κ}=κ$. We provide fundamental properties of the $κ^+$-Borel hierarchy of any regular Hausdorff space of weight at most $κ$, and establish sufficient conditions for its non-collapse. We highlight a unique phenomenon that arises in the case of singular cardinals, namely, the existence of a second, distinct Borel hierarchy, the $κ$-Borel hierarchy: we prove that it is strictly finer than the $κ^+$-Borel hierarchy, and then characterize the precise relationship between the two. Finally, for regular cardinals, we resolve three questions about the behavior of the $κ^+$-Borel hierarchy on subspaces of the generalized Baire space ${}^κκ$, constructing various models via forcing where several nontrivial constellations for the length of the $κ^+$-Borel hierarchy on the space are realized.

math.LO↗

The complexity of being monitorable

We study monitorable sets from a topological standpoint. In particular, we use descriptive set theory to describe the complexity of the family of monitorable sets in a countable space $X$. When $X$ is second countable, we observe that the family of monitorable sets is $Π^0_3$ and determine the exact complexities it can have. In contrast, we show that if $X$ is not second countable then the family of monitorable sets can be much more complex, giving an example where it is $ Π^1_1$-complete.

math.LO↗