SearcharxivSearch

arXiv · 2601.19999

A parametrized $\diamondsuit$ for the Laver property and nontrivial automorphisms of $\mathcal P(\omega)/\mathrm{Fin}$

Abstract

We introduce a new parametrized diamond principle denoted $\diamondsuit(\mathsf{LP})$. This principle is akin to the parametrized diamonds of Moore, Hru\v{s}\'ak, and D\v{z}amonja, each of which corresponds to some cardinal invariant of the continuum, and gives a $\diamondsuit$-like guessing principle implying the corresponding invariant is $\aleph_1$. Our principle $\diamondsuit(\mathsf{LP})$ is a $\diamondsuit$-like guessing principle implying the Laver property holds over a given inner model, such as the ground model in a forcing extension. We show $\diamondsuit(\mathsf{LP})$ holds in many familiar models of $\mathsf{ZFC}$ obtained by forcing, namely those obtained from a model of $\mathsf{CH}$ by a length-$\omega_2$ countable support iteration of proper Borel posets with the Laver property. This is true for essentially the same reason that the usual parametrized diamonds hold in similarly described forcing extensions where their corresponding cardinal invariant is $\aleph_1$. We also prove that if $\diamondsuit(\mathsf{LP})$ holds over an inner model of $\mathsf{CH}$ then there are nontrivial automorphisms of $\mathcal P(\omega)/\mathrm{Fin}$; in fact we get particularly nice automorphisms extending nontrivial involutions built around $P$-points in the ground model. Additionally, we show that, like the Sacks model, all automorphisms of $\mathcal P(\omega)/\mathrm{Fin}$ are somewhere trivial in the Mathias model. This puts a limitation on the kinds of automorphisms obtainable from $\diamondsuit(\mathsf{LP})$.

Explore related subjects

Keep this discovery

BibTeXRIS

Will Brian, Alan Dow. 2026-01-27. A parametrized $\diamondsuit$ for the Laver property and nontrivial automorphisms of $\mathcal P(\omega)/\mathrm{Fin}$. https://arxiv.org/abs/2601.19999

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

KEEP EXPLORING

Related papers

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.

math.GN

A continuous $3$-distributive frame that is not $\omega$-distributive

We give a negative answer to the question, posed by Ern\'e, whether every $3$-distributive lattice is $\omega$-distributive. More precisely, we exhibit a continuous frame that is $\kappa$-distributive for every integer $\kappa\geq 2$, but is not a wide coframe. The frame is the open-set lattice of a compact, locally compact, countably based $T_0$ topological meet-semilattice, obtained from Lawson's construction in the logarithmic form described by Goubault-Larrecq. The failure of $\omega$-distributivity is witnessed by an explicit matrix with countably many nonempty finite rows: all row joins are the same nonzero element, whereas every choice of one entry from each row has meet zero. The same space answers negatively Ern\'e's accompanying question whether every $4$-web space is a wide web space. All properties of the construction needed for these conclusions are proved directly.

math.GN

An overlooked weakening of perfect normality: Perfect regularity in spaces and locales

We introduce the notion of perfect regularity as an appropriate weakening of perfect normality, both for spaces and locales. Various characterizations are given, using Dedekind-MacNeille completions, injective hulls, and sublocales. We place the new class of perfectly regular frames among various well-studied classes of frames. We also introduce the construction of perfect regularization of a completely regular frame, compare it to Isbell's well-known booleanization construction, and argue that it is at least as important as the latter.

math.GN