Iterating Generalised Perfect Set Forcing Along Well-Founded Orders

Mirna D\v{z}amonja

Pith reviewed 2026-05-10 15:01 UTC · model grok-4.3

classification 🧮 math.LO

keywords perfect set forcinggeometric iterationwell-founded partial ordersforcing iterationcardinal preservationgeneralised forcingκ^{<κ}=κ

0 comments

The pith

A geometric iteration technique lets generalised perfect set forcing be iterated with small supports along any well-founded partial order while preserving cardinals up to and including κ⁺.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper adapts the geometric iteration method, first developed for ordinary perfect set forcing, to a generalised version P(F) that uses a filter on a cardinal κ with κ^{<κ}=κ. It proves that this forcing can be iterated with supports of size at most κ along any well-founded partial order, without collapsing cardinals up to κ⁺. A reader would care because the result widens the range of orders along which such forcings can be combined while keeping cardinal arithmetic controlled. The extension moves beyond earlier work that was restricted to iterations along ordinals.

Core claim

We show that there is a version of the geometric iteration technique that applies to P(F), to yield that for κ satisfying κ^{<κ}=κ, the forcing P(F) can be iterated with supports of size ≤κ along any well-founded partial order, while preserving cardinals up and including κ⁺.

What carries the argument

The geometric iteration technique adapted to the generalised perfect set forcing P(F) with respect to a filter F on κ, which organises the iteration so that conditions remain controlled along well-founded orders.

Load-bearing premise

The partial order is well-founded and the cardinal κ satisfies κ^{<κ}=κ so that P(F) is well-defined and the support size works.

What would settle it

An explicit well-founded partial order together with a descending sequence of conditions in the iterated forcing that forces a collapse of κ⁺ would show the preservation fails.

read the original 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 $\kappa$ satisfying $\kappa^{<\kappa}=\kappa$, which we denoted ${\mathbb P} (\mathcal F)$, and proved that its iteration with supports of size $\le\kappa$ along any ordinal preserves cardinals up and including $\kappa^+$. We show that there is a version of the geometric iteration technique that applies to ${\mathbb P} (\mathcal F)$, to yield that for $\kappa$ satisfying $\kappa^{<\kappa}=\kappa$, the forcing ${\mathbb P} (\FF)$ can be iterated with supports of size $\le\kappa$ along any well-founded partial order, while preserving cardinals up and including $\kappa^+$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This extends geometric iteration for P(F) to arbitrary well-founded partial orders rather than just ordinals.

read the letter

The central point is that they have figured out how to run the geometric iteration for the generalized perfect set forcing P(F) along any well-founded partial order, using supports of size at most κ, and this preserves all cardinals up to κ⁺ when κ satisfies κ^{<κ}=κ. This is a direct extension of their earlier work on ordinal iterations and Kanovei's countable support version for the ordinary perfect set forcing. What they do well is use the well-foundedness to define everything by recursion on the rank of the order. That avoids any circularity when elements are incomparable, and lets the fusion arguments go through at limit stages. The argument seems to hold up. The stress-test note points out that well-foundedness prevents dependency cycles, and the cardinal condition keeps the forcing closed enough. I don't see a flaw in the basic setup. One minor soft spot is that the details on how conditions are defined for non-linear orders would benefit from explicit examples or a small case check in the full text, though nothing suggests a major problem. The citation pattern looks appropriate, building cleanly on the prior results without overclaiming. This is for set theorists interested in advanced forcing techniques for independence proofs. Someone working on cardinal arithmetic or model constructions with complex orderings would find it useful as a technical tool. It is worth sending to a serious referee. The result is a clean generalization and adds to the toolkit without obvious errors. I recommend putting it through peer review.

Referee Report

0 major / 2 minor

Summary. The paper extends Kanovei's geometric iteration technique, previously applied to perfect set forcing along ordinals and to the generalized forcing P(F) along ordinals in the authors' earlier work, to show that for κ satisfying κ^{<κ}=κ, the poset P(F) can be iterated with supports of size ≤κ along arbitrary well-founded partial orders while preserving all cardinals ≤κ⁺.

Significance. If correct, the result meaningfully generalizes the scope of geometric iterations from linear orders to well-founded posets, providing a more flexible framework for controlled iterated forcing with perfect-set-like posets. The approach via transfinite recursion on the rank function of the well-founded order is a natural extension that avoids circularity at limit stages and supports the cardinal-preservation claim; this strengthens the available tools for consistency results involving such forcings.

minor comments (2)

[Abstract and §1] The abstract and introduction would benefit from a short explicit statement of how the geometric fusion argument is adapted when supports involve incomparable elements of the well-founded order (as opposed to the ordinal case).
[§3] Notation for the iterated poset and the support condition could be clarified with a small diagram or example for a non-linear well-founded order of height 2.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and accurate summary of our work, which correctly identifies the extension of Kanovei's geometric iteration from ordinals to arbitrary well-founded partial orders for the generalized perfect set forcing P(F). We appreciate the recognition that the transfinite recursion on the rank function provides a natural way to handle limit stages without circularity while preserving cardinals ≤κ⁺. The recommendation for minor revision is noted, and we will incorporate any such changes in the revised manuscript.

Circularity Check

0 steps flagged

No significant circularity; extension via standard recursion on well-founded rank

full rationale

The paper cites Kanovei for the original geometric iteration on arbitrary posets (for perfect set forcing) and its own prior work [Property-B] for the ordinal case of the generalized P(F). The new result extends this to well-founded partial orders by applying transfinite recursion on the rank function of the poset, using the given assumption κ^{<κ}=κ to control supports and fusion. This recursion is a standard, externally verifiable set-theoretic technique that does not reduce the central claim to a self-definition, fitted input, or unverified self-citation chain. The derivation remains self-contained against the stated assumptions and does not rename or smuggle prior results as new predictions.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the prior definition of P(F) from a filter F and the geometric iteration framework from Kanovei; no new free parameters or invented entities are introduced in the abstract statement.

axioms (1)

standard math ZFC set theory with standard forcing notions and cardinal arithmetic
The entire argument presupposes ZFC as the ambient theory for defining forcings, cardinals, and well-founded orders.

pith-pipeline@v0.9.0 · 5468 in / 1263 out tokens · 61407 ms · 2026-05-10T15:01:56.466073+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

29 extracted references · 10 canonical work pages

[1]

Proper forcing

Uri Abraham. Proper forcing. InHandbook of set theory. In 3 volumes, pages 333–394. Dordrecht: Springer, 2010.doi:10.1007/978-1-4020-5764-9_6

work page doi:10.1007/978-1-4020-5764-9_6 2010
[2]

Tomek Bartoszyński and Haim Judah.Set Theory: On the Structure of the Real Line. A.K. Peters, Ltd., 1995

1995
[3]

Baumgartner

James E. Baumgartner. Iterated forcing. In Adrian R.D. Mathias, editor,Surveys in Set Theory, volume 87 ofLondon Math. Soc. Lecture Note Ser., pages 1–59. Cam- bridge University Press, 1983

1983
[4]

Baumgartner and Richard Laver

James E. Baumgartner and Richard Laver. Iterated perfect-set forcing.Ann. Math. Logic, 17:271–288, 1979.doi:10.1016/0003-4843(79)90010-X

work page doi:10.1016/0003-4843(79)90010-x 1979
[5]

Elizabeth Theta Brown and Marcia J. Groszek. Uncountable superperfect forcing and minimality.Ann. Pure Appl. Logic, 144(1-3):73–82, 2006.doi:10.1016/j.apal. 2006.05.012

work page doi:10.1016/j.apal 2006
[6]

The generalized Borel conjecture and strongly proper orders.Trans

Paul Corazza. The generalized Borel conjecture and strongly proper orders.Trans. Am. Math. Soc., 316(1):115–140, 1989.doi:10.2307/2001276

work page doi:10.2307/2001276 1989
[7]

Cardinal invariants above the continuum

James Cummings and Saharon Shelah. Cardinal invariants above the continuum. Ann. Pure Appl. Logic, 75(3):251–268, 1995.doi:10.1016/0168-0072(95)00003-Y

work page doi:10.1016/0168-0072(95)00003-y 1995
[8]

A Baumgartner-style property that applies to preservation ofℵ1 andℵ 2 under iterations with supports of sizeℵ 1

Mirna Džamonja. A Baumgartner-style property that applies to preservation ofℵ1 andℵ 2 under iterations with supports of sizeℵ 1. submitted, arxiv 2509.19519, 09 2025

work page arXiv 2025
[9]

Jensen forcing at an inaccessible and a model of Kelley-Morse satisfyingccbut notdc ω.Manuscript, 2023

Sy-David Friedman and Victoria Gitman. Jensen forcing at an inaccessible and a model of Kelley-Morse satisfyingccbut notdc ω.Manuscript, 2023

2023
[10]

Sy-David Friedman, Tapani Hyttinen, and Vadim Kulikov.Generalized Descriptive Set Theory and Classification Theory, volume 230 ofMem. Amer. Math. Soc.2014

2014
[11]

Founda- tions of the Formal Sciences III

Stefan Geschke and Sandra Quickert. On Sacks forcing and the Sacks property. In Be- nedikt Löwe, Boris Piwinger, and Thoralf Räsch, editors,Classical and new paradigms of computation and their complexity hiearrchies: papers of the conference "Founda- tions of the Formal Sciences III", Trends in Logic, Studia Logica Library, 23, pages 95–139. Kluwer Academ...

2004
[12]

Tools for your forcing construction

Martin Goldstern. Tools for your forcing construction. In Haim Judah, editor,Set Theory of the Reals, volume 6 ofIsrael Mathematical Conference Proceedings, pages 305–360, 1993

1993
[13]

Groszek and T

M. Groszek and T. Jech. Generalized iteration of forcing.Trans. Am. Math. Soc., 324(1):1–26, 1991.doi:10.2307/2001492

work page doi:10.2307/2001492 1991
[14]

Stephen H. Hechler. On the existence of certain cofinal subsets ofωω. Axiom. Set Theor., Proc. Symp. Los Angeles 1967, 155-173 (1974)., 1974

1967
[15]

Life in the Sacks model.Acta Univ

Michal Hrušák. Life in the Sacks model.Acta Univ. Carol., Math. Phys., 42(2):43–58,
[16]

URL:https://eudml.org/doc/196355
[17]

Inamdar and Assaf Rinot

Tanmay C. Inamdar and Assaf Rinot. Walks and higher Aronszajn lines. arXiv:2410.08757v1, October 2024

work page arXiv 2024
[18]

Jech.Set theory

T. Jech.Set theory. Springer Monographs in Mathematics. Springer-Verlag, Berlin,
[19]

The third millennium edition, revised and expanded
[20]

Cambridge University Press, 1986

Thomas Jech.Multiple Forcing. Cambridge University Press, 1986. ITERATING GENERALISED PERFECT SET FORCING ALONG WELL-FOUNDED ORDERS 21

1986
[21]

Perfect-set forcing for uncountable cardinals.Ann

Akihiro Kanamori. Perfect-set forcing for uncountable cardinals.Ann. Math. Logic, 19:97–114, 1980.doi:10.1016/0003-4843(80)90021-2

work page doi:10.1016/0003-4843(80)90021-2 1980
[22]

On non-wellfounded iterations of the perfect set forcing.J

Vladimir Kanovei. On non-wellfounded iterations of the perfect set forcing.J. Symb. Log., 64(2):551–574, 1999.doi:10.2307/2586484

work page doi:10.2307/2586484 1999
[23]

North-Holland, 1980

Kenneth Kunen.Set Theory, volume 102 ofStudies in Logic and the Foundations of Mathematics. North-Holland, 1980

1980
[24]

On the consistency of Borel’s conjecture.Acta Math., 137:151–169, 1976

Richard Laver. On the consistency of Borel’s conjecture.Acta Math., 137:151–169, 1976

1976
[25]

A. A. Muchnik. Negative answer to the problem of reducibility of the theory of al- gorithms.Dokl. Akad. Nauk SSSR, 108:194–197, 1956

1956
[26]

Forcing with sequences of models of two types.Notre Dame J

Itay Neeman. Forcing with sequences of models of two types.Notre Dame J. Form. Log., 55:265–298, 2014

2014
[27]

GeraldE.Sacks.Forcingwith perfectclosed sets.InDanaScott, editor,Axiomatic Set Theory, volume 13 ofSymposia in Pure Mathematics, pages 331–355. Amer. Math. Soc., Providence, Rhode Island, 1971

1971
[28]

Notes Math.Springer, Cham, 1982

Saharon Shelah.Proper forcing, volume 940 ofLect. Notes Math.Springer, Cham, 1982

1982
[29]

Perspectives in Mathematical Logic

Saharon Shelah.Proper and Improper Forcing. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 2nd edition, 1998

1998