REVIEW 2 major objections 3 minor
On the factorization of iterates of $x^d+c$ in large degree
T0 review · 2 major / 3 minor · reviewed 2026-08-05 · deepseek-v4-flash
Pith's one-line read For many pairs (d,c), the polynomial f_{d,c}^n(x)-α has at most d irreducible factors in K[x] for every n≥1, and when α=0 the good d have positive density among all integers.
desk verdict Plausible new structural result in arithmetic dynamics, but the strong uniformity claim needs proof-checking; worth refereeing. 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 central object is the n-th iterate f_{d,c}^n(x)-α. The proof shows that this polynomial cannot split into more than d irreducible factors; the key input is the abc conjecture, which bounds the size of certain solutions that many factors would produce. For the statement about α=0, a counting argument over d shows that bad d are sparse enough to have density zero.
What would settle it
Find a number field K (or a function field) and a pair (d,c) with h(c)>0 for which some n yields more than d irreducible factors of f_{d,c}^n(x)-α—for instance, test d=2, c=1, α=0 over Q and look for a factorization into three or more irreducible factors for any n.
Extended reading notes
Core claim
The paper's central discovery is that, for many pairs (d,c), the n-th iterate f_{d,c}^n(x)-α has at most d irreducible factors in K[x], and this bound holds uniformly for all n≥1. When α=0, the set of exponents d with this property for every c of positive height has positive asymptotic density. The proof leverages the abc conjecture to rule out excessive factorization in the number-field case; over function fields the same bound holds unconditionally. As applications, the author computes the density of prime divisors in certain forward orbits and proves finiteness of integral points in certain backward orbits.
Load-bearing premise
For number fields, the proof assumes the abc conjecture; if abc fails for a number field, the theorem's conclusion for that field is unsupported.
Editorial extensions
If this is right
- For every n≥1, f_{d,c}^n(x)-α has at most d irreducible factors in K[x], so the factorization complexity of the entire orbit is bounded uniformly in n.
- For α=0, the set of exponents d that work for all c of positive height has positive asymptotic density, meaning good d form a non-negligible fraction of all integers.
- The bound on factors yields a computation of the density of prime divisors in certain forward orbits, quantifying how often primes can appear in the sequence f_{d,c}^n(0) (or a related starting point).
- The same bound implies that certain backward orbits—the sets of points whose iterates land on α—contain only finitely many integral points.
- For function fields of curves in characteristic zero, all of this is unconditional; for number fields it is a consequence of the abc conjecture.
Reading between the lines
- If abc-conjecture control fails for some number field, the theorem loses its proof not only for that field but for any d and c covered by the density statement, exposing the factorization bound as a genuinely abc-dependent phenomenon.
- The positive-density result for d likely undercounts the good exponents; one might expect that almost all d satisfy the property, with the bad d constrained by a diophantine condition that remains to be analyzed.
- For d=2, the bound says every quadratic iterate x^{2^n}+... (with the correct shifts) has at most two irreducible factors; checking this for small n and a fixed c, say c=1 over Q, could test the theorem numerically.
- The same height-based mechanism might extend to other families of polynomials beyond x^d+c, such as Lattès maps or unicritical polynomials with more general coefficients, as long as the relevant height bounds hold.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies factorization of iterates of f_{d,c}(x)=x^d+c over a field K, where K is a function field of a curve in characteristic zero or a number field over which the abc conjecture holds. For fixed alpha in K, the authors claim that for many c and d, the polynomial f_{d,c}^n(x)-alpha has at most d irreducible factors in K[x] for all n >= 1. In the case alpha=0, they claim the set of d for which this holds for all c with h(c)>0 has positive asymptotic density. Applications are announced to prime divisors in forward orbits and finiteness of integral points in backward orbits. The abstract gives no proof details and the full text was not available for review.
Significance. If the announced results are correct, they represent a substantial contribution to the arithmetic of unicritical polynomials, connecting iteration, factorization, and orbit properties. The function-field case appears to be unconditional and could be of independent interest. The abstract also promises explicit applications to prime divisors and integral points, which would be significant. However, because the full text was not provided, the scope and novelty of the proofs cannot be assessed. The paper would be strengthened by the positive-density statement's exceptional-set estimate, which is likely the technical core.
major comments (2)
- [Abstract, positive-density statement] The set {d : f_{d,c}^n(x) has at most d factors for all n>=1 and all h(c)>0} is claimed to have positive asymptotic density. This is delicate: for K=Q, d=2, and c=-625/576, f_{d,c}^2 splits into four distinct linear factors, so d=2 is excluded. The proof must therefore establish that the set of excluded d is negligible. The abstract gives no indication of the method or of the density bound. Without the full text this load-bearing estimate cannot be verified.
- [Abstract, number-field hypothesis] The number-field part is stated conditional on the abc conjecture. The phrasing 'a number field over which the abc-conjecture holds' is an external assumption, not an internal inconsistency, but it means that the theorem has no unconditional content for number fields. If abc fails, the corresponding claim is unproved. The abstract does not specify whether this is the uniform abc conjecture or a fixed-field version, which affects the strength of the result.
minor comments (3)
- [Abstract, notation] The notation h(c)>0 is used without definition; presumably h is a height function on K. The notion of 'factors' should also be made precise: irreducible factors in K[x], counted with or without multiplicity?
- [Abstract, quantifier 'many c and d'] The phrase 'for many c and d' is informal. A precise statement of the measure or density with respect to which 'many' is meant would help the reader gauge the strength of the theorem.
- [Abstract, density over which set] The 'positive asymptotic density' for the set of d requires a specified ordering or height on the set of integers d. The abstract does not state whether the density is natural density among positive integers, which should be clarified.
Circularity Check
No circularity identified in the abstract; the number-field result is explicitly conditional on the external abc conjecture.
full rationale
This is an abstract-only review, so the derivation chain is not available for inspection. The abstract states a theorem: for function fields, and for number fields over which the abc-conjecture holds, f_{d,c}^n(x)-alpha has at most d factors for many c and d, with a positive-density statement for alpha=0. No fitted parameter is renamed as a prediction, no quantity is defined in terms of the target result, and no load-bearing self-citation chain is visible. The condition 'over which the abc-conjecture holds' is an external conjecture, not a self-referential input. The positive-density set is defined explicitly in terms of the factorization property, but that is the theorem's conclusion, not an input. Without the full proof, no circular step can be exhibited, and the absence of proof is a completeness concern, not a circularity concern. Therefore the appropriate score is 0.
Assumptions & free parameters
assumptions (3)
- domain assumption The abc conjecture holds for number fields.
- domain assumption K is a function field of a curve in characteristic zero.
- standard math Standard background in arithmetic dynamics and height theory.
Cite this review
Pith. "Pith review of On the factorization of iterates of $x^d+c$ in large degree." pith.science (2026). https://pith.science/paper/DV7RDXML
@misc{pith2026250805795,
author = {Pith},
title = {Pith review of: On the factorization of iterates of $x^d+c$ in large degree},
year = {2026},
howpublished = {\url{https://pith.science/paper/DV7RDXML}},
note = {Machine review of arXiv:2508.05795}
}
abstract
Let $K$ be a function field of a curve in characteristic zero or a number field over which the $abc$-conjecture holds, fix $\alpha\in K$, and let $f_{d,c}(x)=x^d+c$ for some $d\geq2$ and some $c\in K$. Then for many $c$ and $d$, we prove that $f_{d,c}^n(x)-\alpha$ has at most $d$ factors in $K[x]$ for all $n\geq1$. For example, when $\alpha=0$ we prove that the set \[\Big\{d\,:\, f_{d,c}^n(x)\;\text{has at most $d$ factors in $K[x]$ for all $n\geq1$ and all $h(c)>0$}\Big\}\] has positive asymptotic density. We then apply this result to compute the density of prime divisors in certain forward orbits and to establish the finiteness of integral points in certain backward orbits.
Reviewed August 5, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.