- The paper proves the exact counting identity ∑Γ degR Γ = deg R by constructing a potential whose Laplacian encodes non-attracting subtrees, then shows the normalized measures τRⁿα converge to the canonical equilibrium measure νR.
- Repelling points equidistribute for polynomials, for connected Julia sets under an indifferent-subtree negligibility condition, and for rational maps with positive Lyapunov exponent, while the general conjecture remains open.
- The results replace irregular or non-isolated Berkovich repelling-point counts with finite-degree subtree counts and isolate indifferent and shared-repelling subtrees as the main obstacles to a general proof.
Context and motivation
Let K be an algebraically closed field, complete with respect to a nontrivial non-archimedean absolute value, and let R∈K(z) be a rational function. Favre and Rivera-Letelier developed the ergodic theory of the dynamical system induced by R on the Berkovich projective line PBerk1, proving that iterated preimages of almost any point equidistribute toward the canonical equilibrium measure νR, and that periodic K-points equidistribute under conditions later relaxed by Okuyama. Their Question 1, restated as Conjecture 1 in their later work, asks whether repelling periodic points also equidistribute: writing σR=ζ∈(R)∑(degRζ)δζ, the conjecture predicts (degRn)−1σRn→νR weakly on PBerk1 (2608.14200).
The paper observes a structural obstruction to transplanting the complex-dynamical proof strategy. In the complex case, one proves equidistribution of all periodic points and then discards non-repelling cycles using Fatou's theorem, which guarantees finitely many such cycles. In the non-archimedean setting this argument fails: repelling fixed points of Rn may lie in R∈K(z)0, where they are generally not isolated and can form uncountable, non-discrete fixed loci. Moreover, the number of repelling fixed points is not governed by a uniform counting formula: it equals R∈K(z)1 for polynomials and for maps of good reduction, but can reach R∈K(z)2 in Rumely's examples. The paper's strategy is therefore to replace individual repelling points with an object admitting a regular count — the connected components of the non-attracting fixed locus — and then control the discrepancy between the two.
Non-attracting subtrees and the counting theorem
The fixed locus R∈K(z)3 decomposes into connected components, called non-attracting subtrees; an element R∈K(z)4 is repelling if it contains a repelling fixed point and indifferent otherwise. The paper assigns to each component the degree
R∈K(z)5
which is a well-defined positive integer because only finitely many points of R∈K(z)6 satisfy R∈K(z)7. For R∈K(z)8, the central object is the measure
R∈K(z)9
where R0 denotes the retraction of R1 onto R2.
The main counting theorem states that for any nonconstant R3, the measure R4 is finite of total mass R5, and consequently
R6
This is proved by potential-theoretic methods. The paper introduces a function R7, defined "diagonally" as the number of preimages of R8 (counted with local degree) whose only path to R9 passes through PBerk10, and shows that PBerk11 is locally constant and vanishes outside a quasi-finite subgraph. Integrating PBerk12 along segments from PBerk13 yields a potential PBerk14 in the Baker–Rumely space PBerk15, whose Laplacian satisfies
PBerk16
The proof of the key locality property of PBerk17 relies on Okuyama's notion of the depth PBerk18 of a direction and on the identity PBerk19.
Two structural corollaries follow immediately. If νR0 has potential good reduction, then νR1 consists of a single subtree, and νR2 is explicitly νR3 plus, when νR4, a mass νR5 at the unique point νR6 of the Julia set. The converse fails: in Rumely's degree-νR7 examples with νR8 type II repelling fixed points of local degree νR9, the counting theorem forces K0, yet for K1 the Julia set has at least K2 points, so K3 cannot have potential good reduction. This shows that the counting formula detects potential good reduction only one way.
Equidistribution of the measures K4
The second main theorem establishes that for K5 and any K6, the normalized measures K7 converge weakly to K8.
The proof is a clean potential-theoretic argument. By Brolin's theorem, the discrete measures K9 (for a non-exceptional σR=ζ∈(R)∑(degRζ)δζ0) converge to σR=ζ∈(R)∑(degRζ)δζ1. When σR=ζ∈(R)∑(degRζ)δζ2 has no potential good reduction, σR=ζ∈(R)∑(degRζ)δζ3 charges no point, so the Portmanteau theorem gives pointwise convergence of the associated distribution functions σR=ζ∈(R)∑(degRζ)δζ4; dominated convergence then yields convergence of the potentials σR=ζ∈(R)∑(degRζ)δζ5. Since σR=ζ∈(R)∑(degRζ)δζ6 is an Arakelov–Green's function relative to σR=ζ∈(R)∑(degRζ)δζ7 for every discrete probability measure σR=ζ∈(R)∑(degRζ)δζ8, and the map σR=ζ∈(R)∑(degRζ)δζ9 is continuous by a result of Favre–Jonsson, the Laplacians converge as well. The same argument applied to (degRn)−1σRn→νR0, together with the identity (degRn)−1σRn→νR1, gives the result. The potential-good-reduction case is handled directly from the explicit form of (degRn)−1σRn→νR2.
Equidistribution of repelling points in special cases
The paper decomposes the error between (degRn)−1σRn→νR3 and (degRn)−1σRn→νR4 into its positive and negative parts,
(degRn)−1σRn→νR5
where (degRn)−1σRn→νR6 places mass (degRn)−1σRn→νR7 on each indifferent subtree and (degRn)−1σRn→νR8 accounts for repelling subtrees containing more than one repelling point. Three theorems analyze cases in which one or both error terms vanish.
Polynomials. If (degRn)−1σRn→νR9 with PBerk10 and PBerk11 lies in the Fatou component of PBerk12, then PBerk13 for all PBerk14, and hence
PBerk15
The proof uses the fact that for a polynomial, the direction toward PBerk16 is the unique preimage of the direction toward PBerk17 under the map on tangent spaces. This forces each non-attracting subtree PBerk18 to have a unique repelling point, namely PBerk19, and the retraction Rn0 agrees with it for Rn1 in the basin of Rn2. A byproduct is the exact count Rn3 for polynomials, stated for lack of a suitable reference.
Connected Julia set. If Rn4 is connected, then Rn5, and for Rn6 in this set the shared-degree error vanishes: Rn7 for all Rn8. The key lemma shows that if Rn9 restricts to the identity on a nonempty open segment between two points, then that segment lies in the Fatou set; since R∈K(z)00 is connected, a repelling point R∈K(z)01 and R∈K(z)02 are joined by a segment in R∈K(z)03, forcing R∈K(z)04. Under the additional hypothesis that the number of indifferent subtrees of R∈K(z)05 is R∈K(z)06 — equivalently, R∈K(z)07 — repelling points equidistribute. The paper is explicit that the asymptotic smallness of R∈K(z)08 is an assumption, not a conclusion, and that an independent asymptotic study of either error term would require new ideas.
Positive Lyapunov exponent. The paper resolves affirmatively Conjecture 3 of Favre and Rivera-Letelier: if R∈K(z)09, then
R∈K(z)10
The proof combines the counting theorem with Favre and Rivera-Letelier's own result that repelling R∈K(z)11-points equidistribute when R∈K(z)12. The inequality R∈K(z)13 for repelling type II points bounds the mass at non-R∈K(z)14-points by twice the total degree of subtrees containing no type I repelling point, which the counting theorem identifies as R∈K(z)15. As Favre and Rivera-Letelier noted, this conjecture together with their Theorem B implies both the equidistribution of repelling points (Conjecture 1) and the equidistribution of all repelling periodic points (their Conjecture 2) in the positive-Lyapunov-exponent regime; the paper therefore delivers a complete answer to these questions under the hypothesis R∈K(z)16, and a partial answer in general.
Limitations and open questions
The paper is candid that the general Conjecture 1 of Favre and Rivera-Letelier remains open. The reduction R∈K(z)17 is exact, but the paper establishes vanishing of the error terms only in the three special cases above; in particular, for connected Julia sets the equidistribution of repelling points is conditional on the unproven smallness of the indifferent-subtree mass R∈K(z)18, and the author states that an asymptotic study of either error term in general "would seem to require new ideas." The choice of base point R∈K(z)19 also matters: the clean identities for polynomials require R∈K(z)20 in the Fatou component of R∈K(z)21, and the connected-Julia-set argument requires R∈K(z)22 in the non-R∈K(z)23-part of R∈K(z)24. Whether indifferent subtrees are asymptotically negligible for arbitrary rational functions of degree at least R∈K(z)25 is the concrete question the paper leaves unresolved.
Conclusion
The paper introduces the degree of a non-attracting subtree and proves the exact counting identity R∈K(z)26, via a Laplacian computation for an explicitly constructed potential R∈K(z)27. This yields unconditional equidistribution of the measures R∈K(z)28 toward R∈K(z)29, and — for polynomials, for maps with connected Julia set under a negligibility hypothesis, and unconditionally for positive Lyapunov exponent — the equidistribution of repelling periodic points, resolving one conjecture of Favre and Rivera-Letelier completely in the expanding case and providing the framework within which the remaining cases can be formulated.