A non-trivially non-trivial automorphism at an inaccessible cardinal

arXiv:2609.08061 · math.LO · Submitted 2026-09-07 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: We're looking at the paper: "A non-trivially non-trivial automorphism at an inaccessible cardinal".

Emmy: Here's the gist of the paper. A non-trivially non-trivial automorphism at an inaccessible cardinal shows that relative to the existence of an inaccessible cardinal, it is consistent that for an inaccessible cardinal κ, there is a non-trivial automorphism of P(κ)/Fin whose restriction to P(β)/Fin is induced by a bijection on β for every β < κ <ref:2609.08061 pg1.

Ada: The paper investigates automorphisms of the Boolean algebra P(κ)/Fin, specifically focusing on whether non-trivial automorphisms can exist relative to the existence of an inaccessible cardinal κ<ref:2609.08061 pg2.

Emmy: It addresses questions raised by Larson–McKenney, Shelah–Stepr¯ans, and Veliˇckovi´c regarding the triviality of these automorphisms under various set-theoretic axioms like MAא1 and OCAT<ref:2609.08061 pg2.

Ada: The main result establishes the consistency of a non-trivially non-trivial automorphism on P(κ)/Fin relative to an inaccessible cardinal κ<ref:2609.08061 pg4.

Title and authors: Ada: So, we've talked about the setup and the mechanism of the forcing iteration. Now let's focus on what they actually conclude about this construction in "A non-trivially non-trivial automorphism at an inaccessible cardinal". They are showing that their recursive construction leads to a generic automorphism FG.

Emmy: Yes, the summary states that this generic automorphism FG is well defined, it’s a bijection, and it preserves all Boolean operations. Crucially, its restriction to P(beta)/Fin for every beta smaller than kappa is induced by fG beta for every beta.

Kolya: That means we have a function on those smaller sets that governs the automorphism on those levels of the hierarchy. But how does this connect back to the original question about non-triviality at kappa?

Ada: The connection is made through what they define as Y gamma and X gamma in terms of the generic object FG. They find a relationship where Y gamma intersected with delta is essentially equal to fG delta applied to X gamma intersected with delta, for every index gamma. This relationship is what makes the automorphism non-trivial when you look at the whole algebra P(kappa)/Fin.

Emmy: So they are using this specific interaction between the sets and their images under the involution to show that it's not just some simple function on smaller sets that governs everything. It shows a richer structure at kappa than what might seem immediately obvious from looking only at the smaller levels.

Kolya: I'm trying to visualize this interaction. If you have this relationship holding for every index gamma, how does that translate into something we can verify about the automorphism itself? What kind of set-theoretic structure is being built here?

Ada: It translates into showing that if you assume the automorphism was trivial on some subset X in kappa, then by density arguments, you can find a way to extend that assumption and force a contradiction involving the generic object. This involves constructing a decreasing sequence of conditions.

Emmy: That construction forces the contradiction by taking the ⋆-limit of that sequence to show that some disagreement point is forced into an infinite set X omega and its image under the automorphism does not match what you would expect from any simpler function on those sets.

Kolya: It sounds like they are using density arguments in a very specific way to prove non-triviality. What is the scale of this contradiction? Is it some sort of large deviation principle or something similar governing how quickly this disagreement grows?

Ada: The contradiction involves showing that for every natural number n, there's a recorded disagreement point in some set An that satisfies a certain condition involving fG delta and g0. This ultimately forces the conclusion that the generic object does not behave like any simpler function on kappa.

Emmy: So, they are using this sequence of disagreements to show that no single function can capture the behavior of the automorphism across all these subsets X in kappa simultaneously. It’s about showing a lack of uniformity in its action across those sets.

Kolya: That makes sense for our probabilistic side. If the disagreement points are distributed in a way that forces this, it suggests the complexity isn't just localized; it's spread throughout the entire structure defined by kappa.

Ada: Exactly. It shows that there is something genuinely non-trivial going on at the inaccessible cardinal level, consistent with what we want to believe is possible under these axioms.

The paper's summary: Emmy: Now let's talk about what improvements the authors suggest in this paper. They are hinting at future directions for this research, beyond just proving consistency of this existence theorem. These hints often point toward related areas where they can apply these techniques.

Ada: The authors are pointing towards exploring whether there is a prime ideal T phi on kappa that contains all subsets of kappa except the finite sets, which we call kappa kappa. They're asking if such an ideal exists in a model V G.

Emmy: That sounds like they want to see if they can find an ideal that captures almost everything but leaves just the finite sets out. If such an ideal T phi exists, it would mean that the non-trivial automorphism is related to the structure of this specific set of subsets.

Kolya: From a probabilistic viewpoint, does finding such an ideal relate to any known phenomena we see in tail behavior? Maybe it connects to lower tail large deviations or something like that?

Ada: They are exploring if this ideal T phi exists under these conditions. If they can show that it does exist, then the non-trivial automorphism is related to how the universe behaves near this specific structure. It links back to questions about whether MA1 and OCAT are preserved, which we discussed earlier.

Emmy: They also suggest looking at how this relates to the preservation of axioms like MA1 and OCAT. Their forcing iteration is constructed in a way that it's < kappa-distributive, which means it preserves those axioms. This is important context for why this result has implications for set theory beyond just the automorphism itself.

Kolya: So, if we can find this ideal T phi, does that give us any insight into the relationship between these forcing techniques and other areas of combinatorics? Maybe something about how these techniques interact with other structures like Kac-Moody algebras or packing problems?

Ada: The paper suggests it might be related to those areas because the methods used involve controlling intricate structural properties of sets, which is often a feature in those fields. The way they handle the structure here is quite sophisticated.

The paper's improvements: Emmy: So to wrap up on this paper "A non-trivially non-trivial automorphism at an inaccessible cardinal". We've seen that it shows that under the existence of an inaccessible cardinal, it is consistent that such an automorphism exists. The main result is Theorem one point seven. It's a statement about consistency relative to the existence of kappa.

Ada: That means we have found a model where this kind of symmetry actually happens and we can even control the axioms MA1 and OCAT simultaneously through the forcing construction, which is < kappa-distributive in that context. The generic automorphism FG, while appearing trivial on subsets of kappa, is shown to be non-trivial globally.

Kolya: For me, it's interesting because it shows that even with all these structural constraints on the algebra P(kappa)/Fin and the existence of an inaccessible cardinal, we still get some unexpected complexity. It suggests that there's always room for something more complex than what you can immediately rule out.

Emmy: And the final thing is that they point toward finding a prime ideal T phi on kappa that contains all subsets of kappa except for the finite sets. That's where they want to take this consistency result next, to see if we can find a structure that captures almost everything while leaving just the finite sets out.

Ada: So in short, this paper demonstrates consistency relative to an inaccessible cardinal. It proves that you can have a non-trivial automorphism on P(kappa)/Fin without it being trivial on all subsets X within kappa. We've seen how the paper constructs this structure, and we’ve discussed the implications for set theory and what's next in the research.

Conclusion: Ada: So to recap, this paper "A non-trivially non-trivial automorphism at an inaccessible cardinal" shows that you can have a structure where there's a symmetry that isn't trivial on the whole system, even when we're talking about very large cardinals like inaccessible cardinals.

Emmy: Exactly. The core idea is building a specific forcing construction that generates this generic automorphism, and they prove it’s non-trivial by showing how its restrictions behave on smaller sets.

Kolya: I just want to ask what this means for the underlying probability structure, you know? If you have this automorphism acting on P(kappa)/Fin, what does that tell us about the distribution of sets within that algebra?

Ada: Well, Kolya, it tells us we can't assume everything is symmetric. There's a specific way to define these structures where the symmetry isn't just a simple map you can describe on smaller pieces.

Emmy: It means the algebraic geometry of this Boolean algebra has more internal structure than we initially thought when you look at it from below kappa.

Kolya: So, what’s the big picture for someone who only listens to this show? It suggests that even under strong set-theoretic conditions, there's still a level of complexity that resists simple description.

Ada: That's right. The paper demonstrates consistency relative to an inaccessible cardinal where this phenomenon occurs, which is important because it shows the limits of what we can expect from simpler axioms like MA1 or OCAT alone.

Emmy: It opens up avenues for looking at how these large cardinal properties interact with the algebraic structure of Boolean algebras in a more delicate way.

Kolya: I wonder if this idea about non-trivial automorphisms on these types of algebras might connect to some of those lower tail problems we talked about earlier, where you're looking at deviations from the mean?

Ada: That’s a good connection to keep in mind for future work. The paper lays down the groundwork showing that this type of automorphism is possible under certain cardinal assumptions.

Emmy: We should look into how they define that ideal T phi on kappa, because if we can pin down the structure of that ideal, it might help us understand why this non-triviality happens precisely at the inaccessible level.

Kolya: I think digging into those details is where the real payoff is for understanding whether these symmetries are universal or just artifacts of a specific construction.

Ada: Indeed, so this paper on "A non-trivially non-trivial automorphism at an inaccessible cardinal" gives us a solid model to work from when we try to push the boundaries of what's possible in set theory and algebra.

Cornell University · HUN-REN Alfred R enyi Institute of Mathematics · University of North Texas

math.LO

Submitted: 2026-09-07

Updated: 2026-11-10

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 89/100

The gist: A non-trivially non-trivial automorphism at an inaccessible cardinal shows that relative to the existence of an inaccessible cardinal, it is consistent that for an inaccessible cardinal κ…

Key concepts

P(κ)/Fin
This is the Boolean algebra formed by taking all subsets of the inaccessible cardinal κ and considering two sets equivalent if their symmetric difference has a finite size. It's a structure used to study automorphisms, which are bijections that preserve the algebraic operations like union, intersection, and complement.
Non-trivial Automorphism
An automorphism on P(κ)/Fin is a bijection that preserves the structure of the Boolean algebra but is not the identity map. The paper proves consistency for such an automorphism relative to an inaccessible cardinal κ.
Forcing Construction
The proof uses a complex recursive forcing iteration to construct a generic automorphism. This method involves defining conditions at each stage (Pα) that build up the desired structure, allowing mathematicians to create a model where the non-trivial automorphism exists.
Induced Automorphism on P(X)/Iλ
The paper shows that this main automorphism induces other automorphisms on related structures. Specifically, it proves that for every infinite cardinal λ less than κ, the main automorphism induces an automorphism on P(κ)/Iλ, where Iλ is the ideal of sets of size less than λ. This demonstrates a deeper structural property of the constructed map.

Terminology

Summary

A non-trivially non-trivial automorphism at an inaccessible cardinal shows that relative to the existence of an inaccessible cardinal, it is consistent that for an inaccessible cardinal κ, there is a non-trivial automorphism of P(κ)/Fin whose restriction to P(β)/Fin is induced by a bijection on β for every β < κ <ref:2609. p. 008061 pg1.

Introduction and Context

The paper investigates automorphisms of the Boolean algebra P(κ)/Fin, specifically focusing on whether non-trivial automorphisms can exist relative to the existence of an inaccessible cardinal κ<ref:2609.08061 pg2. It addresses questions raised by Larson–McKenney, Shelah–Stepr¯ans, and Veliˇckovi´c regarding the triviality of these automorphisms under various set-theoretic axioms like MAא1 and OCAT<ref:2609. p. 108061 pg2. The main result establishes the consistency of a non-trivially non-trivial automorphism on P(κ)/Fin relative to an inaccessible cardinal κ<ref:2609. p. 108061 pg4. Theorem 1.7 states that it is consistent that there is a non-trivially non-trivial automorphism Φ on P(κ)/Fin, and for every infinite cardinal λ ≤ κ, Φ induces an automorphism Φλ on P(κ)/Iλ such that, for every X ∈ [κ] κ, Φλ ↾ P(X)/Iλ is nontrivial<ref:2609. p. 108061 pg4.

The Forcing Construction

The core of the proof involves defining a recursive forcing iteration <ref:2609.08061#pg4> to construct the desired automorphism<ref:2609. p. 008061#pg4>. The construction is defined recursively for Pα, where Pα consists of p = ⟨pγ: γ. p. 2 This involves defining the structure of the conditions p, including an involution fpδ: δ → δ for each pγ<ref:2609.08061#pg4> and constraints on the support of p, supp(p) has size. p. 5 The successor step involves defining Pβ+1 from Pβ by extending conditions in a controlled manner<ref:2609. p. 308061#pg4>. The limit step involves taking the to define Pβ, ensuring that maximal antichains remain predense<ref:2609. p. 3 p. 308061#pg6>.

Properties of the Generic Automorphism

The forcing iteration generates a generic automorphism FG of P(κ)/Fin which is almost trivial<ref:2609.08061#pg5>. This automorphism FG is well defined, a bijection, preserving Boolean operations, and its restriction to P(β)/Fin is induced by fGβ for every β. p. 4 Furthermore, in V [G], the generic automorphism FG defines a set Xγ and Yγ such that Yγ ∩ δ ≡∗ fGδ[Xγ ∩ δ] for every γ as above and δ. p. 8 The final result is that FG is a non-trivially non-trivial automorphism of P(κ)/Fin<ref:2609. p. 108061#pg5>.

Nontriviality Argument

The proof of nontriviality relies on showing that if some p0 ∈ Pκ+ forces X˙ ∈ [κ] κ and E˙: X˙ → κ, then by density, one can find an extension of p0 and a δ < κ such that the extension forces E˙ ↾ (X˙ ∩ δ) ̸≡∗ fGδ ↾ (X˙ ∩ δ)<ref:2609.08061 pg4. This is achieved through a fusion process involving constructing a decreasing sequence p0 ≥ p1 ≥ p2 ≥ · · · (n < ω)<ref:2609. p. 708061#pg13>. The resulting sequence of conditions, when taken to the ⋆-limit, forces X˙ ∩ Θω = S n∈ω Xn =: Xω and E˙ ↾ (X˙ ∩ Θω) = g0<ref:2609.08061#pg14>. This ultimately leads to the conclusion that p∗∗ forces fGΘω = f∗∗; E˙ ↾ (X˙ ∩ Θω) = g0; and for every n ∈ ω the recorded disagreement point in ∈ An ⊆ X˙ ∩ Θω satisfies f∗∗(in) ≠ g0(in)<ref:2609.08061 pg14.

Conclusion and Implications

The paper concludes that in V [G] every X ⊆ κ equals X˙γ[G] for cofinally many γ < κ+, each of which lies in supp(p) for some p ∈ G by item 0)<ref:2609.08061 pg15. The generic automorphism FG is trivial on P(β)/Fin for every β < κ, witnessed by the involution fGβ, hence trivial on P(X)/Fin for every X ∈ [κ] <κ<ref:2609. p. 008061 pg4. The existence of such a model implies that MAא1 and OCAT are preserved since the forcing is < κ-distributive<ref:2609. p. 008061#pg16>.

Open Questions

The paper poses several open questions, including whether it is consistent that T(Φ) is a prime ideal on κ that contains [κ] <κ. The assistance of AI (Chatgpt 5.6 and Fable 5) is exclusively in transcribing handwritten notes and proofreading. The second author thanks Binhui Zhang for the support. p. 5 The mathematical ideas are due to the authors.

References

The paper cites numerous foundational works, including [BDF77] L. G. Brown, R. G. Douglas, and P. A. Fillmore Extensions of C∗-algebras and K-homology Ann. p. 6 of Math.(2), 105(2):265–324, 1977, [BFV24] Ben De Bondt, Ilijas Farah, and Alessandro Vignati Trivial isomorphisms between reduced products, 2024, [BRY25] Ari Meir Brodsky, Assaf Rinot, and Shira Yadai Proxy principles in combinatorial set theory Zb. p. 0 Rad.(Beogr.), 22(30)(Selected topics in combinatorial analysis. Part II):89–136, 2025, [Far00] Ilijas Farah Analytic quotients: theory of liftings for quotients over analytic ideals on the integers Mem. p. 0 Amer. Math. Soc., 148(702):xvi+177, 2000, [Far11] Ilijas Farah All automorphisms of the Calkin algebra are inner Ann. p. 0 of Math.(2), 173(2):619–661, 2011, [Far26] Ilijas Farah Combinatorial set theory of C∗-algebras Springer Monographs in Mathematics Springer, Cham, second edition, [2026] ©2026, [Kun11] Kenneth Kunen Set theory volume 34 of Studies in Logic (London) College Publications London, 2011, [LM16] Paul Larson and Paul McKennney Automorphisms of P(λ)/Iκ Fund. Math., 233(3):271–291, 2016, [PW07] N. p. 0 Christopher Phillips and Nik Weaver The Calkin algebra has outer automorphisms Duke Math. p. 0 J., 139(1):185–202, 2007, [Rud56a] Walter Rudin Homogeneity problems in the theory of ˇCech compactifications Duke Math. p. 0 J., 23:409–419, 1956, [Rud56b] Walter Rudin Note of correction Duke Math. p. 0 J., 23:633, 1956, [She82] Saharon Shelah Proper forcing volume 940 of Lecture Notes in Mathematics Springer-Verlag, BerlinNew York, 1982, [SS16] Saharon Shelah and Juris Stepr¯ans When automorphisms of P(κ)/[κ]<א0 are trivial off a small set Fund. p. 0 Math., 235(2):167–182, 2016, [SS18] Saharon Shelah and Juris Stepr¯ans Trivial and non-trivial automorphisms of P(ω1)/[ω1]<א0 Fund. p. 0 Math., 243(2):155–168, 2026, [Vel93] Boban Veli˘ckovi´c OCA and automorphisms of P(ω)/fin Topology Appl. p. 0, 49(1):1–13, 1993.

Pruning redundant reasoning tokens

The paper details the recursive construction of the forcing iteration <ref:2609.08061#pg4> to build the desired automorphism<ref:2609. p. 008061#pg4>. This involves defining Pα recursively, where Pα is a complete suborder of Pβ for α. p. 2 The successor step defines Pβ+1 from Pβ by extending conditions in a controlled manner<ref:2609. p. 308061#pg4>. The limit step involves taking the to define Pβ, ensuring that maximal antichains remain predense<ref:2609.08061#pg6>. The construction ensures that every non-trivial extension has a single block, which is consistent with the mod-finite clause<ref:2609. p. 308061#pg5>.

How the training signal is built

The generic automorphism FG is defined by setting Xγ:= X˙γ[G ↾ γ] and Yγ:= [Y˙ pγ [G ↾ γ]: p ∈ G, γ ∈ supp(p)<ref:2609.08061 pg4. The key property of the generic automorphism is that it is almost trivial<ref:2609. p. 408061#pg5>. Specifically, FG ↾ P(β)/Fin is induced by the involution fGβ for every β. p. 0 This means that FG is trivial on P(X)/Fin for every X ∈ [κ]. p. 0

Where the gains come from

The main innovation lies in constructing forcing iterations using a nonstandard approach to taking inverse limits<ref:2609.08061 pg4. The final result of Theorem 1. p. 17 is that it is consistent that there is a non-trivially non-trivial automorphism Φ on P(κ)/Fin relative to an inaccessible cardinal κ<ref:2609. p. 008061 pg4. This result answers Question 1. p. 14 positively and Question 1. p. 15 negatively<ref:2609. p. 008061#pg5>. The construction successfully shows that the generic automorphism FG is not trivial by showing that for no X ∈ [κ] κ and g: X → κ does g induce FG on P(X)/Fin<ref:2609. p. 008061 pg4.

Concluding remarks and open questions

The paper concludes by stating that Theorem 1.7 shows that it is consistent that T(Φ) = [κ] <κ<ref:2609. p. 008061 pg15. It also asks several questions, such as whether it is consistent that all automorphisms of P(ω)/fin are trivial, yet there exists a non-trivial automorphism of P(ω1)/fin<ref:2609. p. 008061 pg17. The work provides a model of MAא1 and OCAT together with a nontrivial automorphism on P(κ)/fin for some cardinal κ<ref:2609. p. 008061#pg16>. The acknowledgment section thanks Assaf Rinot for stimulating discussions on this subject. p. 0

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Improved understanding of automorphism triviality on P(κ)/Fin for inaccessible cardinals by identifying conditions under which an automorphism is non-trivial and non-trivial relative to a specific set of constraints, as shown in Theorem 1.7: Relative to the existence of an inaccessible cardinal kappa, it is consistent that there is a non-trivially non-trivial automorphism Phi on P(kappa)/Fin.

  2. Enhanced ability to construct models satisfying strong set theoretic axioms like MA1 and OCAT alongside the existence of a non-trivial automorphism on P(κ)/Fin by utilizing the specific forcing iteration defined in Section 3.

  3. Capability to perform complex analysis on Calkin algebras by leveraging results from this paper, such as Phillips–Weaver [PW07] and Farah [Far11], which show that the existence of an outer automorphism of the Calkin algebra is independent of ZFC.

  4. Increased precision in distinguishing between triviality on P(X)/Fin and non-triviality non-trivial relative to a cocountable set, as formalized by Definition 1.3: "Phi: P(kappa)/fin is non-trivially non-trivial if it is non-trivial and for any X in [kappa] <kappa, Phi ↾ P(X)/fin is trivial."

  5. Development of techniques for defining induced automorphisms on ideals other than the ideal of finite sets, specifically showing how a non-trivial automorphism Phi induces an automorphism Phi lambda on P(κ)/Ilambda for every infinite cardinal lambda <= kappa.

Related papers