Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 27 Jan 2026 in math.GN and math.LO | (2601.19999v1)

Abstract: We introduce a new parametrized diamond principle denoted (LP)\diamondsuit(\mathsf{LP}). This principle is akin to the parametrized diamonds of Moore, Hrušák, and Džamonja, each of which corresponds to some cardinal invariant of the continuum, and gives a \diamondsuit-like guessing principle implying the corresponding invariant is 1\aleph_1. Our principle (LP)\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 (LP)\diamondsuit(\mathsf{LP}) holds in many familiar models of ZFC\mathsf{ZFC} obtained by forcing, namely those obtained from a model of CH\mathsf{CH} by a length-ω2ω_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 1\aleph_1. We also prove that if (LP)\diamondsuit(\mathsf{LP}) holds over an inner model of CH\mathsf{CH} then there are nontrivial automorphisms of P(ω)/Fin\mathcal P(ω)/\mathrm{Fin}; in fact we get particularly nice automorphisms extending nontrivial involutions built around PP-points in the ground model. Additionally, we show that, like the Sacks model, all automorphisms of P(ω)/Fin\mathcal P(ω)/\mathrm{Fin} are somewhere trivial in the Mathias model. This puts a limitation on the kinds of automorphisms obtainable from (LP)\diamondsuit(\mathsf{LP}).

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.