arxiv: 2605.10131 · v1 · submitted 2026-05-11 · 🧮 math.DS

Recognition: 2 theorem links

· Lean Theorem

Generalized rescaling limits of a sequence of rational maps

Charles Favre , Chen Gong

Authors on Pith no claims yet

Pith reviewed 2026-05-12 03:09 UTC · model grok-4.3

classification 🧮 math.DS

keywords generalized rescaling limitsrational mapstree structurequadratic mapssmall multipliersnon-Archimedean fieldsrenormalizationcomplex dynamics

0 comments

The pith

Generalized rescaling limits of sequences of degree-d rational maps form a tree whose size is bounded by d.

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

For any sequence of complex rational maps of fixed degree d at least 2, the paper defines generalized rescaling limits as renormalizations of iterates at chosen scales, possibly over non-Archimedean fields. These limits assemble into a tree structure that organizes their hierarchical relations at different scales. The tree size is bounded in terms of d alone. When restricted to quadratic rational maps, the possible trees are classified completely and this yields a uniform bound, independent of the sequence, on the number of cycles whose multipliers are small. A reader would care because the result supplies combinatorial control over local renormalization behaviors across entire sequences or families of maps.

Core claim

We introduce generalized rescaling limits as rational maps, possibly defined over a non-Archimedean field, obtained by renormalizing a fixed iterate of the sequence at some scale. Building on Kiwi's classification, we show that the set of all such limits is naturally organized as a tree and bound the size of this tree in terms of the degree d. For quadratic rational maps we describe all possible trees and obtain a uniform bound on the number of cycles with small multipliers.

What carries the argument

The tree of generalized rescaling limits, which encodes the hierarchical inclusion and scale relations among renormalized iterates at all scales.

Load-bearing premise

Extending Kiwi's classification of rescaling limits to arbitrary scales and non-Archimedean fields captures every possible generalized limit without omissions or overlaps that would destroy the tree organization.

What would settle it

An explicit sequence of quadratic rational maps in which the number of cycles with multipliers smaller than any fixed positive number exceeds the claimed uniform bound, or a sequence whose rescaling limits fail to satisfy the tree relations under the defined partial order.

Figures

Figures reproduced from arXiv: 2605.10131 by Charles Favre, Chen Gong.

**Figure 1.** Figure 1: Relating limits in projective spaces (with ε < η) Remark 1.4. We may replace X(C) N by X(H0) in the diagram above. Remark 1.5. If (k, | · |) is a non-Archimedean field, the projective distance on P 1 (k) is defined by setting d([z : 1], [z ′ : 1]) = |z − z ′ |/(max(1, |z|) max(1, |z ′ |). The map P 1 (Hε) → P 1 (Hη) are 1-Lipshitz for the projective distance if ε < η < (1) . Observe that points at projecti… view at source ↗

read the original abstract

We consider a sequence of complex rational maps (f_n) of a fixed degree d at least 2. Building on the seminal work of Kiwi, we introduce the notion of generalized rescaling limits. These are rational maps possibly defined over a non-Archimedean field obtained by renormalizing at some scale a fixed iterate of the sequence (f_n). We explain that the set of all generalized rescaling limits is naturally organized as a tree, and bound the size of this tree in term of the degree d. We apply our theory to quadratic rational maps. Using Kiwi's classification, we describe all possible trees in this case, and prove a uniform bound on the number of cycles with small multipliers.

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

Favre and Gong define generalized rescaling limits over non-Archimedean fields, organize them into a tree of size at most d, and classify the quadratic case to bound small-multiplier cycles.

read the letter

The main takeaway is that this paper extends Kiwi's rescaling limits by allowing renormalization of fixed iterates at arbitrary scales, possibly over non-Archimedean fields, and shows that the full set of such limits forms a tree whose size is bounded by the degree d. For quadratic maps they then list all possible trees and extract a uniform bound on cycles with small multipliers. That tree structure is the new piece of combinatorial organization they add to the degeneration picture. It gives a way to track how different renormalized limits relate to one another without having to pick a single scale in advance. The quadratic application is concrete and uses the tree classification to control the number of small-multiplier cycles, which could feed into questions about moduli spaces of degree-d maps. The construction looks internally consistent on the terms they set: they define the generalized limits explicitly and then prove the tree property and the size bound from that definition. The reliance on Kiwi is stated up front rather than hidden, so the circularity risk is low. The soft spot is whether the extension really catches every possible renormalized limit at every scale. If some limits at exotic scales or in certain non-Archimedean completions fall outside the framework, the tree could be incomplete and the size bound would not hold. The abstract claims the proofs are there, but the strength of the result rests on that completeness claim being verified in the details. This is aimed at people already working in complex dynamics who know Kiwi's classification and want a tool for organizing degenerations. A reader who cares about combinatorial invariants or uniform bounds on multipliers will see immediate value. The paper has enough new structure and a clear application that it deserves a serious referee rather than a desk rejection.

Referee Report

2 major / 2 minor

Summary. The paper considers a sequence of complex rational maps (f_n) of fixed degree d ≥ 2. Building on Kiwi's work, it defines generalized rescaling limits as rational maps (possibly over non-Archimedean fields) obtained by renormalizing a fixed iterate of the sequence at some scale. The authors show that the collection of all such limits organizes naturally into a tree whose size is bounded by a function of d. For quadratic rational maps, they use Kiwi's classification to enumerate all possible trees and derive a uniform bound on the number of cycles with small multipliers.

Significance. If the central claims hold, the work supplies a structural organizing principle (the tree of generalized rescaling limits) together with an explicit degree-dependent cardinality bound, extending Kiwi's classification to arbitrary scales and non-Archimedean settings. The quadratic application yields a concrete uniform bound on small-multiplier cycles, which is a falsifiable, quantitative statement with direct implications for renormalization theory and the geometry of parameter spaces in rational dynamics. The non-Archimedean generality is a notable strengthening.

major comments (2)

[§2 (definition and tree construction)] The tree organization and the bound on its size rest on the claim that the generalized rescaling limits exhaust all possible renormalized limits at arbitrary scales, including over non-Archimedean fields. The manuscript must supply a self-contained argument (or a precise reference to a complete extension of Kiwi's classification) showing that no additional limits exist outside the tree construction; any gap here directly falsifies the cardinality bound and the subsequent quadratic classification.
[§5 (quadratic application)] In the quadratic case, the uniform bound on cycles with small multipliers is obtained by enumerating all admissible trees via Kiwi's classification. The paper should explicitly verify that the list of trees is exhaustive and that the multiplier bound follows uniformly from the tree structure without additional case-by-case assumptions.

minor comments (2)

[Introduction] Clarify the precise dependence of the tree-size bound on the degree d (e.g., is it linear, quadratic, or exponential?) and state the bound explicitly in the introduction.
[References and §5] Ensure that all references to Kiwi's theorems are accompanied by the specific statements invoked, especially those used to classify the quadratic trees.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed and constructive report. The comments highlight important points regarding the completeness of the tree construction and the explicitness of the quadratic classification. We address each major comment below and will revise the manuscript accordingly to strengthen the presentation.

read point-by-point responses

Referee: [§2 (definition and tree construction)] The tree organization and the bound on its size rest on the claim that the generalized rescaling limits exhaust all possible renormalized limits at arbitrary scales, including over non-Archimedean fields. The manuscript must supply a self-contained argument (or a precise reference to a complete extension of Kiwi's classification) showing that no additional limits exist outside the tree construction; any gap here directly falsifies the cardinality bound and the subsequent quadratic classification.

Authors: We agree that a clear demonstration of exhaustiveness is essential. The definition of generalized rescaling limits in §2 extends Kiwi's framework by allowing rescalings of arbitrary fixed iterates at any scale, including over non-Archimedean fields. The tree is constructed precisely from the inclusion relations among these limits, and the cardinality bound follows from the fact that each branch corresponds to a distinct critical orbit segment whose length is controlled by the degree d. To make this fully rigorous and self-contained, the revised manuscript will include an additional lemma in §2 proving that every possible renormalized limit arising from a sequence of degree-d maps must coincide with one of the generalized rescaling limits in the tree; this will be proved by adapting the compactness and classification arguments from Kiwi to the generalized setting without assuming further results. revision: yes
Referee: [§5 (quadratic application)] In the quadratic case, the uniform bound on cycles with small multipliers is obtained by enumerating all admissible trees via Kiwi's classification. The paper should explicitly verify that the list of trees is exhaustive and that the multiplier bound follows uniformly from the tree structure without additional case-by-case assumptions.

Authors: We thank the referee for this observation. In §5 we enumerate the possible trees for quadratic maps by invoking Kiwi's complete classification of rescaling limits, which yields a finite list of admissible tree structures (with bounded depth and branching). The uniform bound on the number of small-multiplier cycles is then obtained by associating each such cycle to a leaf or internal node of the tree and using the fact that the multiplier is controlled by the rescaling factor at that node. In the revision we will add an explicit subsection that lists all admissible trees (with diagrams), confirms exhaustiveness directly from Kiwi's theorem, and derives the multiplier bound uniformly from the maximal tree size without further case distinctions. revision: yes

Circularity Check

0 steps flagged

No circularity; tree structure and bounds derived from external Kiwi classification plus new definitions

full rationale

The paper defines generalized rescaling limits by renormalizing iterates of the sequence (f_n) at chosen scales, possibly over non-Archimedean fields, then proves these limits form a tree whose size is bounded by d. This organization and bound follow directly from the definition and the extension of Kiwi's external classification of rescaling limits; the quadratic case enumerates all trees using that same external classification. No equation reduces to a prior fitted parameter or self-citation by construction, no ansatz is smuggled, and no uniqueness theorem is imported from the authors' own prior work. The derivation is therefore self-contained once the cited Kiwi results are granted as independent input.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claims rest on Kiwi's classification of rescaling limits (treated as a domain assumption) and standard properties of rational maps and non-Archimedean fields; no free parameters or new invented entities are visible in the abstract.

axioms (1)

domain assumption Kiwi's classification of rescaling limits for rational maps
Explicitly invoked in the abstract as the foundation for the quadratic case and the tree construction.

pith-pipeline@v0.9.0 · 5407 in / 1299 out tokens · 58419 ms · 2026-05-12T03:09:51.802872+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking (D=3 forcing) unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We explain that the set of all generalized rescaling limits is naturally organized as a tree, and bound the size of this tree in term of the degree d... The poset R+(f) is a simplicial tree having the fundamental rescaling as its unique minimal element. Any increasing interval of R+(f) is of cardinality at most 2d−1.
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel (J-cost uniqueness) unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Cycles of g-rescalings... baby g-rescalings... McMullen’s rigidity theorem

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

18 extracted references · 18 canonical work pages

[1]

Atiyah and I

[AM69] Michael F. Atiyah and I. G. Macdonald. Introduction to commutative algebra. Reading, Mass.-Menlo Park, Calif.-London-Don Mills, Ont.: Addison-Wesley Publishing Company (1969).,

work page 1969
[2]

Moduli of hybrid curves II: Tropical and hybrid Laplacians

[AN22] Omid Amini and Noema Nicolussi. Moduli of hybrid curves II: Tropical and hybrid Laplacians. Preprint, arXiv:2203.12785 [math.AG],

work page arXiv
[3]

Dynamics of renormalization operators

[Avi11] Artur Avila. Dynamics of renormalization operators. InProceedings of the international congress of mathematicians (ICM 2010), Hyderabad, India, August 19–27,

work page 2010
[4]

Bifurcation currents in holomorphic families of rational maps

[Ber13] François Berteloot. Bifurcation currents in holomorphic families of rational maps. InPluripotential theory. Lectures of the CIME course, Cetraro, Italy, 2011, pages 1–93. Berlin: Springer; Florence: Fondazione CIME,

work page 2011
[5]

[Dud25] Dzmitry Dudko

Id/No e6. [Dud25] Dzmitry Dudko. On the MLC Conjecture and the Renormalization Theory in Complex Dynamics. Preprint, arXiv:2512.24171 [math.DS] (2025),

work page arXiv 2025
[6]

Blow-up of multipliers in meromorphic families of rational maps

GENERALIZED RESCALING LIMITS OF A SEQUENCE OF RATIONAL MAPS 39 [Fav25] Charles Favre. Blow-up of multipliers in meromorphic families of rational maps. Preprint, arXiv:2504.20284 [math.DS],

work page arXiv
[7]

Rigidité, expansion et entropie en dynamique non- archimédienne (Rigidity, expansion and entropy in non-Archimedean dynamics)

[FRL26] Charles Favre and Juan Rivera-Letelier. Rigidité, expansion et entropie en dynamique non- archimédienne (Rigidity, expansion and entropy in non-Archimedean dynamics). Preprint, arXiv:2504.20280 [math.DS] (2026),

work page arXiv 2026
[8]

Multiplier scales of a sequence of rational maps

[Gon25] Chen Gong. Multiplier scales of a sequence of rational maps. Preprint, arXiv:2510.25029 [math.DS],

work page arXiv
[9]

New gap principle for semiabelian varieties using globally valued fields

[Hul26] Nuno Hultberg. New gap principle for semiabelian varieties using globally valued fields. Preprint, arXiv:2601.04972 [math.NT],

work page arXiv
[10]

Dynamics on Berkovich spaces in low dimensions

[Jon15] Mattias Jonsson. Dynamics on Berkovich spaces in low dimensions. InBerkovich spaces and appli- cations. Based on a workshop, Santiago de Chile, Chile, January 2008 and a summer school, Paris, France, June 2010, pages 205–366. Cham: Springer,

work page 2008
[11]

Asymptotics of Transversality in Periodic Curves of Quadratic Rational Maps

[Kiw25] Jan Kiwi. Asymptotics of Transversality in Periodic Curves of Quadratic Rational Maps. Preprint, arXiv:2501.13738 [math.DS],

work page arXiv
[12]

Uniform boundedness of small points on abelian varieties over function fields

[LY26] Nicole Looper and Jit Wu Yap. Uniform boundedness of small points on abelian varieties over function fields. Preprint, arXiv:2603.23396 [math.NT],

work page arXiv
[13]

Morgan and Peter B

[MS85] John W. Morgan and Peter B. Shalen. An introduction to compactifying spaces of hyperbolic struc- tures by actions on trees. Geometry and topology, Proc. Spec. Year, College Park/Md. 1983-84, Lect. Notes Math. 1167, 228-240 (1985).,

work page 1983
[14]

Valuative compactifications of analytic varieties

[Poi25b] Jérôme Poineau. Valuative compactifications of analytic varieties. Preprint, arXiv:2503.18643 [math.AG],

work page arXiv
[15]

Action de groupe sur la compactification hybride

[Roy25] Alexandre Roy. Action de groupe sur la compactification hybride. Preprint, arXiv:2512.00201 [math.AG],

work page arXiv
[16]

Notes Math

[Sch10] Hans Schoutens.The use of ultraproducts in commutative algebra, volume 1999 ofLect. Notes Math. Dordrecht: Springer,

work page 1999
[17]

Valuations

[Vaq00] Michel Vaquié. Valuations. InResolution of singularities. A research textbook in tribute to Oscar Zariski. Based on the courses given at the working week in Obergurgl, Austria, September 7–14, 1997, pages 539–590. Basel: Birkhäuser,

work page 1997
[18]

[Yap25] JitWuYap.OntheNumberofSmallPointsforRationalMaps.Preprint, arXiv:2510.12039[math.NT],

work page arXiv