Hostname: page-component-89b8bd64d-j4x9h Total loading time: 0 Render date: 2026-05-11T21:41:49.330Z Has data issue: false hasContentIssue false

ON AUTOMORPHISMS OF ${\mathcal {P}}(\lambda )/[\lambda ]^{<\lambda }$

Part of: Set theory

Published online by Cambridge University Press:  16 May 2024

JAKOB KELLNER*
Affiliation:
INSTITUTE OF DISCRETE MATHEMATICS AND GEOMETRY TECHNISCHE UNIVERSITÄT WIEN (TU WIEN) VIENNA AUSTRIA URL: http://dmg.tuwien.ac.at/kellner/
SAHARON SHELAH
Affiliation:
EINSTEIN INSTITUTE OF MATHEMATICS THE HEBREW UNIVERSITY OF JERUSALEM JERUSALEM ISRAELand RUTGERS UNIVERSITY DEPARTMENT OF MATHEMATICS NEW JERSEY USA E-mail: shlhetal@mat.huji.ac.il URL: http://shelah.logic.at/
ANDA RAMONA TĂNASIE
Affiliation:
INSTITUT FÜR INFORMATIK FH WIENER NEUSTADT WIENER NEUSTADT AUSTRIA E-mail: anda-ramona.tanasie@fhwn.ac.at
Rights & Permissions [Opens in a new window]

Abstract

We investigate the statement “all automorphisms of ${\mathcal {P}}(\lambda )/[\lambda ]^{<\lambda }$ are trivial.” We show that MA implies the statement for regular uncountable $\lambda <2^{\aleph _0}$, that the statement is false for measurable $\lambda $ if $2^\lambda =\lambda ^+$, and that for “densely trivial” it can be forced (together with $2^\lambda =\lambda ^{++}$) for inaccessible $\lambda $.

Information

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of The Association for Symbolic Logic