Iterating Generalised Perfect Set Forcing Along Well-Founded Orders

Abstract: Vladimir Kanovei \cite{zbMATH01335192} developed the technique of geometric iteration and used it to prove that the perfect set forcing can be iterated with countable supports along any partial order, while preserving $\aleph_1$. In \cite{Property-B} we considered a generalised perfect set forcing with respect to a filter on a cardinal $κ$ satisfying $κ<sup>{&lt;κ}=κ$, which we denoted ${\mathbb P} (\mathcal F)$, and proved that its iteration with supports of size $\leκ$ along any ordinal preserves cardinals up and including $κ<sup>+$. We show that there is a version of the geometric iteration technique that applies to ${\mathbb P} (\mathcal F)$, to yield that for $κ$ satisfying $κ<sup>{&lt;κ}=κ$, the forcing ${\mathbb P} (\FF)$ can be iterated with supports of size $\leκ$ along any well-founded partial order, while preserving cardinals up and including $κ<sup>+$.

• The paper extends perfect set forcing to arbitrary infinite cardinals, preserving cardinals through iterations along well-founded orders.
• ${\mathbb P}(\mathcal F)$ ensures $B$-$\kappa$-proper iterations, leveraging amalgamation and fusion to maintain cardinal invariants.
• Challenges of preserving higher cardinals beyond $\kappa^+$ are addressed, highlighting new potentials for generalized forcing iterations.

Iteration of Generalised Perfect Set Forcing Along Well-Founded Orders

Background and Motivation

The paper "Iterating Generalised Perfect Set Forcing Along Well-Founded Orders" (2604.10826) extends the classical method of perfect set forcing, originally formulated for $\omega$, to arbitrary infinite cardinals $\kappa$ satisfying $\kappa^{<\kappa}=\kappa$, and investigates the behavior of iterations of these forcings along well-founded partial orders. Iteration techniques for perfect set forcing have long been central in the study of forcing extensions that carefully control cardinal invariants and the structure of the continuum. Prior work, such as Kanovei’s geometric iteration framework, established that standard perfect set forcing can be iterated with countable support along any partial order while preserving $\aleph_1$; however, analogous extension to uncountable cardinals and more general forcings is highly non-trivial due to lack of corresponding topological and descriptive set-theoretic machinery.

Dzamonja introduces ${\mathbb P}(\mathcal F)$, a generalized perfect set forcing associated to a $(<\kappa)$-complete filter $\mathcal F$ on $\kappa$, and proves that for suitable $\kappa$ and $\mathcal F$ the corresponding forcing notion can be iterated, with supports of size at most $\kappa$0, along any well-founded partial order and preserves all cardinals up to and including $\kappa$1. This generalizes earlier results, which considered only ordinal-indexed (linear) iterations, to the broader class of well-founded partial orders, and clarifies structural limitations that arise in uncountable contexts.

The Forcing $\kappa$2 and Its Properties

The generalized perfect set forcing $\kappa$3 is defined on perfect subtrees of $\kappa$4, with splitting determined by a $\kappa$5-complete filter $\kappa$6 (often co-bounded subsets). Conditions are $\kappa$7-perfect: splitting at each node is into a set in $\kappa$8, the tree is closed under limits, and an additional closure requirement is imposed on nodes’ splitting histories. These properties ensure strong analogues of fusion and closure akin to Sacks and Grigorieff-like forcing, extending canonical arguments to uncountable supports.

The notion is shown to be $\kappa$9-$\kappa^{<\kappa}=\kappa$0-proper, strongly $\kappa^{<\kappa}=\kappa$1-closed, and equipped with strong fusion. These properties are central for iteration, as they ensure both preservation of relevant cardinal characteristics and coherence among iterations, particularly in the absence of compactness and topological tools available in the countable setting.

Main Technical Results: Iteration Along Well-Founded Orders

A novel definition of iteration along an arbitrary well-founded partial order $\kappa^{<\kappa}=\kappa$2 is given, using the rank function associated with the order. The iteration is a mixed-support iteration—at each stage, the iterand is determined by the initial segments of $\kappa^{<\kappa}=\kappa$3, and supports are restricted to size $\kappa^{<\kappa}=\kappa$4. Because products of these forcings may collapse cardinals (indeed, the product of $\kappa^{<\kappa}=\kappa$5 many copies collapses $\kappa^{<\kappa}=\kappa$6 if $\kappa^{<\kappa}=\kappa$7), the construction relies on careful use of the amalgamation property and strong fusion, explicitly constructed for each stage via induction on the well-founded rank.

The main theorem proves that the limit of such an iteration is strongly $\kappa^{<\kappa}=\kappa$8-closed, inherits the amalgamation property, and is $\kappa^{<\kappa}=\kappa$9-$\aleph_1$0-proper. Consequently, the iteration always preserves all cardinals up to and including $\aleph_1$1. This includes, as corollaries, linear and tree-like well-founded partial orders and shows substantial flexibility compared to prior approaches restricted to ordinals.

Effect on the Structure of Functions and Applications

Generic filters for these iterations add a function $\aleph_1$2 which dominates every ground model function on a club set, modulo the club filter. More generally, in the generic extension, $\aleph_1$3 contains a cofinal well-founded set isomorphic to any initial well-founded order $\aleph_1$4 used in the iteration. This recapitulates the situation for dominating reals in countable contexts (Hechler forcing), but requires substantial combinatorial and forcing-theoretic innovations at higher cardinals.

Limitations: Preservation of Higher Cardinals

The extension of the preservation result to cardinals above $\aleph_1$5 (i.e., $\aleph_1$6 and beyond) is demonstrated to be delicate. Products and certain long iterations can admit large antichains, depending on both the structure of $\aleph_1$7 and the model of set theory, particularly under GCH. The $\aleph_1$8-c.c. may fail unless $\aleph_1$9 is carefully chosen (e.g., has width ${\mathbb P}(\mathcal F)$0 at every stage), and a direct proof for preservation of higher cardinals is known to be difficult, with the analogous issue even unsettled for countable support iterations of Laver or Sacks forcing at ${\mathbb P}(\mathcal F)$1 in classical literature. The paper reviews historical attempts and obstacles, situating its contribution as clarifying the boundaries of known methods.

Implications and Future Directions

This work demonstrates that a significant extension of iteration techniques for "mild" combinatorial forcing notions is possible at uncountable cardinals, as long as the iteration is organized along well-founded partial orders and supports are carefully managed. The results obtained permit fine manipulation of the structure of ${\mathbb P}(\mathcal F)$2 and provide a new framework for the construction of models with pre-specified well-founded structures in the hierarchy of functions modulo club domination.

The technical hurdles in the preservation of higher cardinals point to the need for new combinatorial principles or forcing-theoretic techniques, potentially in the direction of side conditions or alternative amalgamation arguments. Further investigation of the consequences for cardinal invariants at uncountable cardinals, as well as new independence results in generalized descriptive set theory, is suggested.

Conclusion

The paper rigorously analyzes and generalizes perfect set-like forcing iterations to higher cardinalities and well-founded partial orders, establishing preservation of cardinals up to ${\mathbb P}(\mathcal F)$3 and revealing the interplay between combinatorial properties of the partial order and the iteration scheme. The findings delineate both the power and the limitations of current methods in high cardinal forcing and set the stage for further advances in the theory of generalized forcing iterations.