Related papers: Derived Models in PFA

We study the continuous reducibility of isomorphism relations in the space of regresive functions in $\kappa^\kappa$. We show for inaccessible $\kappa$, that if $\mathcal{T}$ is a theory with less than $\kappa$ non-isomorphic models of size…

We prove that $\delta$-derivations of a simple finite-dimensional Lie algebra over a field of characteristic zero, with values in a finite-dimensional module, are either inner derivations, or, in the case of adjoint module, multiplications…

We derive a lower bound for a second moment of the reciprocal of the derivative of the Riemann zeta-function averaged over the zeros of the zeta-function that is half the size of the conjectured value. Our result is conditional upon the…

Let K^0_lambda be the class of structures < lambda,<,A>, where A subseteq lambda is disjoint from a club, and let K^1_lambda be the class of structures < lambda,<,A>, where A subseteq lambda contains a club. We prove that if lambda =…

We introduce a class of notions of forcing which we call $\Sigma$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $\Sigma$-Prikry. We show that given…

Hidden variable graphical models can sometimes imply constraints on the observable distribution that are more complex than simple conditional independence relations. These observable constraints can falsify assumptions of the model that…

We answer a question of Woodin by showing that assuming an inaccessible cardinal $\kappa$ which is a limit of ${<}\kappa$-supercompact cardinals exists, there is a stationary set preserving forcing $\mathbb{P}$ so that $V^{\mathbb…

A descent conjecture of Wittenberg [Wit24, Conjecture 3.7.4] predicts that if all the twists of a rationally connected torsor over a smooth base satisfy weak approximation with Brauer-Manin obstruction, then so does the base. We give an…

We prove the Effective Bogomolov Conjecture, and so the Bogomolov Conjecture, over a function field of characteristic 0 by proving Zhang's Conjecture about certain invariants of metrized graphs. In the function field case, these conjectures…

Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…

In some theory development tasks, a problem is satisfactorily solved once it is shown that a theorem (conjecture) is derivable from the background theory (premises). Depending on one's motivations, the details of the derivation of the…

We have previously established that $\Pi^1_1$-comprehension is equivalent to the statement that every dilator has a well-founded Bachmann-Howard fixed point, over $\mathbf{ATR_0}$. In the present paper we show that the base theory can be…

The notion of stationary reflection is one of the most important notions of combinatorial set theory. We investigate weak reflection, which is, as the name suggests, a weak version of stationary reflection. This sort of reflection was…

One of the most common pitfalls often found in high dimensional biological data sets are correlations between the features. This may lead to statistical and machine learning methodologies overvaluing or undervaluing these correlated…

Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…

By forcing with $\mathbb{P}_{\rm max}$ over strong models of determinacy, we obtain models where different square principles at $\omega_2$ and $\omega_3$ fail. In particular, we obtain a model of $2^{\aleph_0}=2^{\aleph_1}=\aleph_2 +…

The original proof of Dacorogna-Moser theorem on the prescribed Jacobian PDE, $\text{det}\,\nabla\varphi=f$, can be modified in order to obtain control of support of the solutions from that of the initial data, while keeping optimal…

Modern statistical analyses often involve testing large numbers of hypotheses. In many situations, these hypotheses may have an underlying tree structure that not only helps determine the order that tests should be conducted but also…

We propose an alternative refined de Sitter conjecture. It is given by a natural condition on a combination of the first and second derivatives of the scalar potential. We derive our conjecture in the same weak coupling, semi-classical…

The first two authors of this paper asserted in Lemma 4 of "New Farkas-type constraint qualifications in convex infinite programming" (DOI: 10.1051/cocv:2007027) that a given reverse convex inequality is consequence of a given convex system…