REVIEW 2 major objections 4 minor 17 references
The landing of parameter rays at non-recurrent critical portraits
T0 review · 2 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read For every non-recurrent polynomial, every parameter ray at a critical portrait lands at the polynomial.
desk verdict A promising generalization of Kiwi's ray-landing theorem with a real, likely repairable gap in the key distortion estimate. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing mechanism is a distortion theorem for univalent maps defined outside small preimage disks. The paper builds, for any rational map with no recurrent critical points and any finite set X0 of critical and periodic points satisfying conditions (A1)–(A4), a family of m-nested, λ-scattered disk systems around the backward orbit of X0: nested topological disks labelled by preimages, arranged so that under every univalent map h the punctured-plane area of the smaller disks is at most a fixed fraction of that of the containing disk. Proposition 2.4 and Theorem 2.5 turn this spreading property into a bound: any univalent map fixing three points of a Jordan disk in the Fatou set is uniformly close to the identity on that disk, with the closeness controlled by the size of the omitted disks. Theorem 3.4 is the key application: it says that for any δ>0, univalent maps defined off the pullbacks $f^{{-n}}$(B(x',δ)) are uniformly δ-close to the identity on a fixed Fatou disk. This estimate is what makes the iterated uniformization maps η_{r,n} converge to the identity and carries the landing conclusion.
What would settle it
Work through the case of a non-recurrent cubic whose critical orbit meets a second critical point after at least two iterates. If the hidden-component argument in Proposition 3.3 can be made to run for X0=Crit(f), the missing link in Remark 3.1 is supplied; if not, that failure is a concrete obstruction. A numerical test of Theorem 1.1 for such a polynomial is to compute f_r(Θ) along the ray and verify that it converges to f as r→0.
Extended reading notes
Core claim
On the paper's own terms, the central discovery is Theorem 1.1: let Θ be a critical portrait of a non-recurrent polynomial f of degree d≥2. Then the parameter ray RC_d(Θ) lands at f, meaning lim_{r→0} f_r(Θ)=f. A critical portrait records, for each critical point, the set of external ray arguments landing at it. The proof starts by cutting f along an equipotential curve and performing quasiconformal surgery so that all critical values escape at a common rate r, producing a topological polynomial F_r. It shows F_r is c-equivalent to the unique polynomial f_r(Θ) with portrait Θ and escaping rate r, then runs an iterated uniformization scheme to build a sequence f_{r,n} of polynomials converging to f_r. A new distortion result for univalent maps off nested disk systems ensures that the accompanying normalizing maps η_{r,n} are uniformly close to the identity, which forces f_{r,n}→f as r→0 and hence the ray lands.
Load-bearing premise
The load-bearing premise is that the key distortion estimate remains true when the chosen finite set X0 (the critical points plus periodic points) need not be closed under forward iteration; a critical orbit that hits another critical point after two or more steps violates condition (A4), and the paper's Remark 3.1 asserts, without proof, that the estimate survives precisely this case.
Editorial extensions
If this is right
- Every non-recurrent polynomial of degree d≥2 is the landing point of a parameter ray for each of its critical portraits.
- The earlier landing theorem for strictly pre-periodic critical portraits is included as the special case where the non-recurrent polynomial is strictly post-critically finite.
- The map r↦f_r(Θ), which was known to be an injective curve in the shift locus, extends continuously to r=0 with limit f.
- The ray landing gives a new route showing that non-recurrent polynomials lie in the closure of the shift locus along a canonically defined curve, not merely as a limit of arbitrary escaping polynomials.
- Theorem 3.4 provides a general distortion-control tool for rational maps without recurrent critical points that can be applied beyond parameter-ray landing.
Reading between the lines
- If the unproved generalization asserted in Remark 3.1 is supplied, the same construction should prove landing for parameter rays at critical portraits of non-recurrent rational maps, not only polynomials, since the surgery and distortion steps are stated for rational maps.
- The proof leaves the rate of landing unspecified; a natural testable extension is to seek a power law f_r(Θ)-f = O(r^κ) for strictly pre-periodic rays, where classical estimates may make κ explicit.
- Because a non-recurrent polynomial can admit finitely many distinct critical portraits, the theorem implies each such portrait gives its own landing curve; comparing these curves near f could reveal which portrait labels persist under small perturbations of f.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper claims to prove that for any non-recurrent polynomial f of degree d ≥ 2 and any critical portrait Θ of f, the parameter ray RC_d(Θ) lands at f, thereby generalizing a result of Kiwi. The proof strategy combines a surgery construction of topological polynomials F_r (Step I), a c-equivalence to the polynomial f_r on the parameter ray (Step II), a Thurston iteration controlled by a new distortion theorem (Theorem 3.4), and a convergence argument using the crucial estimate (4.5) to show that the polynomial limits coincide with f. The overall structure is coherent and the paper is clearly organized.
Significance. If the proof is completed, the result would be a substantial generalization of Kiwi's ray-landing theorem and would further demonstrate the applicability of the Cui–Tan distortion theory to non-recurrent dynamics. The paper's main strategy is attractive and the exposition is detailed. The central technical tool, Theorem 3.4, is a genuine extension of earlier distortion results. However, the theorem is proven under restrictive hypotheses (A1)–(A4), and the application to Theorem 1.1 requires a more general version that is only asserted, not proved, in Remark 3.1. This gap is load-bearing because the estimate (4.5) is the key input that forces the Thurston iterates to converge to the identity. The paper does not include machine-checked proofs or reproducible code; the verification is traditional.
major comments (2)
- [§3.4, Theorem 3.4 and Remark 3.1] Theorem 3.4, which supplies the essential estimate (4.5) in Step III of the proof of Theorem 1.1, is proved only for a finite set X0 satisfying (A1)–(A4). In the application, the natural choice is X0 = Crit(f), as suggested by the set W_r constructed in Step I. For a non-recurrent polynomial with a critical orbit relation f^n(c_1) = c_2 for some n ≥ 2, Assumption (A4) fails because the intermediate points f(c_1), ..., f^{n-1}(c_1) are not critical points. Remark 3.1 explicitly acknowledges this and asserts that Theorem 3.4 remains true under weaker hypotheses, but no proof is supplied. Since estimate (4.5) is precisely what forces η_{r,n} toward the identity and is used to prove χ_r → id and hence the landing, the main theorem is not established for such polynomials by the arguments in the manuscript. This is a load-bearing gap, not a presentation issue.
- [§4, Step III] The paper states that η_{r,n+1} is univalent on C \ ⋃_{0≤i≤n} F_r^{-i}(W_r) and asserts the equality F_r^{-i}(W_r) = f^{-i}(W_r). However, W_r was defined in Step I as ∪_{c∈Crit(f)} W_{r,c}, i.e., only the preimage components of the disks W_{r,v} that contain critical points. The map F_r = ζ_r ∘ f is non-holomorphic on all components of f^{-1}(W_{r,v}), including those around non-critical preimages of the critical values, so the stated equality and the univalence claim do not follow from the given definitions. This affects the domain on which Theorem 3.4 is applied and needs to be clarified or corrected.
minor comments (4)
- [Notations] There are numerous typographical errors and OCR artifacts (for example, 'punctu re plane', 'whenif', and inconsistent overline notation for the Riemann sphere) that should be cleaned up.
- [§4, Step IV] The proof that the limit χ_r is affine uses the fact that the Julia set J_{f_r} is removable for quasiconformal maps; a reference for this removability statement should be provided.
- [§4, Step I] The text references 'Figure 4' to illustrate the proof, but the figure is not included in the manuscript; please ensure the figure is present or remove the reference.
- [§3.1, (A4)] The set X0 used in the proof of Theorem 1.1 is never explicitly named or verified; the authors should state that X0 = Crit(f) and justify why the hypotheses of Theorem 3.4 (or of the asserted generalization in Remark 3.1) hold for this choice.
Circularity Check
No significant circularity found; the derivation is self-contained and relies on external distortion theorems and an independently defined parameter ray.
full rationale
The paper's central claim is that the parameter ray RC_d(Theta) lands at a non-recurrent polynomial f. The parameter ray itself is defined through Kiwi's Theorem 3.7, which is an external uniqueness/existence result for polynomials with a prescribed critical portrait and critical escape rate; this definition does not presuppose the landing point. The proof proceeds by surgery (Step I), c-equivalence to the ray polynomial f_r (Step II), and a Thurston algorithm (Step III). The crucial distortion estimate (4.5) comes from Theorem 3.4, which is derived from Theorem 2.5 and Proposition 3.3, ultimately based on Cui--Tan's distortion theory and Mañé's lemma. These are external tools whose stated assumptions do not include the conclusion that f_r converges to f. Step IV then proves the convergence f_r -> f using the distortion estimate and the normalization of the Thurston maps; the result is not assumed at any point. The self-citations that appear (e.g., [7], [17]) are not load-bearing: [7] is not used in the proof, and [17] is cited only as a source for a previously known distortion proposition. The manuscript's possible gap concerning verification of conditions (A1)-(A4) for the chosen X0 is a correctness concern, not a circularity: the claimed estimate is not built from the target ray-landing statement nor from a fitted parameter. Thus the derivation chain is not circular.
Assumptions & free parameters
assumptions (4)
- standard math Standard complex dynamics background: Mañé's lemma, local connectivity of Julia sets for non-recurrent polynomials (Carleson-Jones-Yoccoz, Yin), and Kiwi's existence theorem for parameter rays (Theorem 3.7).
- domain assumption The target polynomial f is non-recurrent, so it has connected Julia set, no bounded Fatou components, and no recurrent critical points; consequently all critical points lie in the Julia set and are not periodic.
- ad hoc to paper The finite set X0 used in the distortion construction satisfies (A1)-(A4): no recurrent points, no periodic or parabolic interactions, contains all Julia critical points, and is closed under intermediate forward orbit segments.
- ad hoc to paper Theorem 3.4 remains valid under the weaker conditions in Remark 3.1, namely that X0 contains no recurrent points and Orb(X0) is disjoint from ω-limit sets of recurrent critical points.
Cite this review
Pith. "Pith review of The landing of parameter rays at non-recurrent critical portraits." pith.science (2026). https://pith.science/paper/YO4HARZ3
@misc{pith2026190809111,
author = {Pith},
title = {Pith review of: The landing of parameter rays at non-recurrent critical portraits},
year = {2026},
howpublished = {\url{https://pith.science/paper/YO4HARZ3}},
note = {Machine review of arXiv:1908.09111}
}
read the original abstract
Based on the distortion theory developed by Cui--Tan \cite{CT15}, we prove the landing of every parameter ray at critical portraits coming from non-recurrent polynomials, thereby generalizing a result of Kiwi \cite[Corollary]{Ki05}
Figures
Reference graph
Works this paper leans on
-
[1]
B.Branner, J. H. Hubbard, The iteration of cubic polynom ials. Part I: the global topology of parameter space, Acta Math. 160(1988) 143-206
work page 1988
-
[2]
L.Carleson, P.Jones and J.C.Yoccoz. Julia and John, Bol. Soc. Bras. Mat. , 25(1994), 1-30
work page 1994
-
[3]
G.Cui, L.Tan, Distortion control of conjugacies betwee n quadratic polynomials, Science China mathematics, vol.53, no. 3(2010), 625-634
work page 2010
-
[4]
G.Cui, L.Tan, A characterization of hyperbolic rationa l maps, Invent. Math., vol. 183(2011), 451-516
work page 2011
-
[5]
G.Cui and L.Tan, Hyerbolic-parabolic deformations of r ational maps, available at arXiv:1501.01385[math.DS]
-
[6]
A.Douady and J.H.Hubbard[1984-85] ´Etude Dynamique des Polynˆ omes Complexes I and II,Publ. Math. Orsay
work page 1984
-
[7]
Y.Gao and J.Zeng, Non-recurrent parameter rays of the Ma ndelbrot set, available at arXiv:1512.08078[math.DS]
-
[8]
J.Kiwi, Combinatorial continuity in complex polynomia l dynamics, Proc. London Math. Soc. 91(2005), no.3, 215-248
work page 2005
Show all 17 references
-
[9]
Math., 169(2009), 561-193
J.Kahn and M.Lyubich, Quasi-Additivity Law in conforma l geometry, Ann. Math., 169(2009), 561-193
2009
-
[10]
O.Lehto, Univalent Functions and Teichm¨ uller Spaces, Springer-Verlag, 1987
1987
-
[11]
G.Levin and L.Sodin, Polynomials with a disconnected J ulia set, and the Green mapping, Dynamical systems and complex analysis (Russian) , 1992, 17–24
1992
-
[12]
R.Ma˜ n´ e, On a lemma of Fatou,Bol.Soc.Bras.Mat., 24(1993),1-11
1993
-
[13]
Press, Princeton, NJ, 2006
J.Milnor, Dynamics in one complex variable , 3rd ed., Princeton Univ. Press, Princeton, NJ, 2006
2006
-
[14]
Adv.Math., 229(2012), 2525-2577
W.Qiu, X.Wang and Y.Yin, Dynamics of McMullen maps. Adv.Math., 229(2012), 2525-2577
2012
-
[15]
Tan Lei), London Mathematical Society Lecture Note Ser ies 274(Cambridgy University Press, 2000) 265-279
M.Shishikura and L.Tan, An alternative proof of Ma˜ n´ e’s theorem on non-expanding Julia sets, The Mandelbrot set, theme and variations (ed. Tan Lei), London Mathematical Society Lecture Note Ser ies 274(Cambridgy University Press, 2000) 265-279
2000
-
[16]
Y.Yin, On the Julia set of semi-hyperbolic rational map s, Chinese J. Contemp. Math. ,20(4)(1999),469-476
1999
-
[17]
J.Zeng, Quasisymmetric Rigidity, Carpet Julia Sets an d the Landing of Dynamical and Parameter Rays, thesis, http://okina.univ-angers.fr/publications/ua13589/1/zjs_thesis.pdf, 2015. Yan Gao, School of Mathematics, Sichuan University, Chengd u 610064, China E-mail address : gya...
2015
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.