REVIEW 3 major objections 4 minor 9 references
A Glimpse of Arithmetic Dynamics
T0 review · 3 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read For $f(t)=t^{p^m}+c$ over every finite field, no point is preperiodic: every orbit is a cycle.
desk verdict An expository undergraduate note with a true core result but a flawed proof and an invalid appendix proof of existence of finite fields. 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 object is the Frobenius endomorphism $\varphi:\mathbb{F}_{p^n}\to\mathbb{F}_{p^n}$, $a\mapsto a^p$. Because every field homomorphism is injective and $\mathbb{F}_{p^n}$ is finite, $\varphi$ is an automorphism; this makes $t\mapsto t^{p^m}$ injective for every $m$ by induction, and translation by $c$ does not change injectivity. For the Fermat proof, the machinery is the map $T_n(x)=nx-\lfloor nx\rfloor$ on $[0,1]$, whose fixed points are easy to count and which satisfies $T_m\circ T_\ell=T_{m\ell}$; the count of period-$p$ points then forces divisibility.
What would settle it
Choose any $p$, $m$, $n$, and $c$ in the theorem's scope, for example $p=3$, $m=2$, $c=2$ over $\mathbb{F}_3$, and enumerate the orbit of every element of $\mathbb{F}_{p^n}$ under $f(t)=t^{p^m}+c$. The theorem predicts every orbit is a pure cycle; if even one element takes a step before entering a cycle, the theorem is false.
Extended reading notes
Core claim
The paper's central claim is Theorem 1: for a prime $p$, a natural number $m$, and a constant $c\in\mathbb{F}_p$, the dynamical system generated by $f(t)=t^{p^m}+c$ has no preperiodic points over $\mathbb{F}_{p^n}$ for every natural number $n$. The proof identifies the Frobenius endomorphism $\varphi(a)=a^p$ with an automorphism of $\mathbb{F}_{p^n}$; since $\varphi$ is injective, induction on $m$ shows that $t\mapsto t^{p^m}$ is injective, and adding $c$ preserves injectivity. An injective self-map of a finite set is bijective, so every orbit is periodic and the functional graph is a disjoint union of directed cycles. The note's secondary self-contained result is a dynamical proof of Fermat's Little Theorem: counting the fixed points of the $p$-fold iterate of $T_a$ on the unit interval gives $a^p$ points, of which $a$ are already fixed by $T_a$, and the remaining $a^p-a$ points form $(a^p-a)/p$ orbits of length $p$, proving $p$ divides $a^p-a$.
Load-bearing premise
The load-bearing premise is that the Frobenius map $a\mapsto a^p$ is one-to-one on every finite field $\mathbb{F}_{p^n}$; if a nonzero element could be sent to zero by a field homomorphism, the injectivity of $f(t)=t^{p^m}+c$ would not follow and preperiodic points could appear.
Editorial extensions
If this is right
- For every choice of $p$, $m$, $c\in\mathbb{F}_p$, and $n$, the directed graph of $f(t)=t^{p^m}+c$ on $\mathbb{F}_{p^n}$ is a disjoint union of cycles: no orbit has a tail leading into a cycle.
- The theorem explains the paper's example of $f(t)=t^2+1$ over $\mathbb{F}_8$: the absence of preperiodic points there is a special case of a general phenomenon.
- Fermat's Little Theorem follows from a period-counting argument, giving a dynamical proof that $p$ divides $a^p-a$ for every prime $p$ and integer $a$.
- The property of having no preperiodic points does not characterize the family $t^{p^m}+c$: the paper notes that over $\mathbb{F}_2$, $f(z)=z^3$ has only fixed points, yet it is not of that form.
Reading between the lines
- The proof of Theorem 1 needs only cancellation of $c$, so the same conclusion holds for any constant $c\in\mathbb{F}_{p^n}$, a generalization the paper does not state.
- Because the theorem gives maps with no preperiodic points at all, the corresponding preperiodic zeta function is trivial; this provides a zero baseline for the open question about preperiodic zeta functions raised in the paper.
- The underlying mechanism is general: any injective polynomial on a finite field has only periodic orbits, so other injective polynomials besides Frobenius-power maps would share the no-preperiodic-point property; this could be tested by enumeration.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. This note is an expository introduction to arithmetic dynamics over finite fields. It introduces discrete dynamical systems and finite fields, illustrates orbit types with directed graphs and explicit F8 and F9 examples, and proves Theorem 1: for a prime p, a natural number m, and c in F_p, the map f(t)=t^{p^m}+c has no preperiodic points over F_{p^n}. It then presents Iga's dynamical proof of Fermat's Little Theorem and proposes open questions about preperiodic zeta functions. An appendix sketches existence and uniqueness of finite fields and a proof that no field has order divisible by two distinct primes.
Significance. If corrected, the note would be a useful undergraduate bridge between abstract algebra and arithmetic dynamics. Theorem 1 is a genuine, clean result whose proof is meant to illustrate the Frobenius automorphism; the examples and open questions are appropriate for the intended audience. The Iga proof gives an accessible alternate route to Fermat's Little Theorem. The paper ships no machine-checked proofs or code, so its value is pedagogical rather than computational. The main theorem is true, but the written proof relies on an erroneous exponent identity, and the appendix's existence proof is mathematically invalid as stated. Both issues are repairable, but they are load-bearing as written.
major comments (3)
- [Section 3, Theorem 1 proof] The induction step asserts a^{p^{N+1}}=a^p a^{p^N} and b^{p^{N+1}}=b^p b^{p^N}. These identities are false; the correct identity is a^{p^{N+1}}=(a^{p^N})^p. Consequently the deduction 'applying the inductive hypothesis ... we conclude a^p=b^p' is invalid: the induction hypothesis would apply only to equal p^N-th powers of two elements, while the equality at hand is (a^{p^N})^p=(b^{p^N})^p. The theorem remains true, and the proof can be repaired by correcting the exponent identity and applying Proposition 1, or by observing that f is the composition of the Frobenius automorphism with a translation, so f is a permutation of F_{p^n}. As written, however, the proof of the paper's central theorem has a genuine gap.
- [Appendix, Theorem 2 (Existence)] The proof says: 'As Z is a principal ideal domain, the ideal generated by p(x) in Z[x] is maximal, so Z[x]/(p(x)) is a field. It is straightforward to verify that Z[x]/(p(x)) has p^n elements.' This is false at two points: Z[x] is not a PID, and for irreducible p(x) the ideal (p(x)) is not maximal; for example Z[x]/(x^2+1) is isomorphic to Z[i], which is not a field. Moreover, Z[x]/(p(x)) is infinite, not of cardinality p^n. The standard repair is to work in F_p[x] and take a quotient by an irreducible polynomial of degree n. This invalidates the stated existence proof, which is load-bearing for the notation F_{p^n} used throughout the paper.
- [Appendix, Theorem 3] The sentence 'The theorem follows from a simpler proposition' is not justified by Proposition 3, which only establishes the case n=pq. For n=pqk, the product rho*delta = pq*1 in a field of characteristic l dividing n need not be zero, and one of rho, delta may itself be zero, so the zero-divisor contradiction does not carry over. The theorem is true and follows from the standard fact that a finite field has prime-power order, but the argument given does not prove it.
minor comments (4)
- [Section 2, Lemma 1] In Lemma 1 the homomorphism is named psi but the proof uses f; the domain and codomain are also inconsistently denoted. Please align the notation.
- [Section 3, Theorem 1 proof] The displayed text 'b^{p^{N+1}}=b^p b^{N+1}' is missing an exponent p on the final factor; it should read b^p b^{p^N} after the exponent identity is corrected.
- [Section 4, Proposition 2] Proposition 2(a) is asserted without proof ('the reader is encouraged to draw a graph'). Since it is used to count periodic points in the Fermat Little Theorem proof, a short argument would improve the exposition.
- [Appendix, Uniqueness sketch] The uniqueness sketch invokes the cyclicity of F_{p^n}^* without proof or reference; for the stated audience, either prove it briefly or cite a standard source explicitly.
Circularity Check
No circularity found: the proof is self-contained from independently established Frobenius facts; the induction typo is a correctness gap, not a circular step.
full rationale
The paper's central derivations do not reduce to their own inputs. Theorem 1 is proven from Proposition 1, which establishes that the Frobenius endomorphism is an automorphism using Lemma 1 (every field homomorphism is injective) and finiteness of F_{p^n}. These facts are established independently and do not assume the conclusion of Theorem 1. The map f(t)=t^{p^m}+c is then shown injective by induction on m; although the written induction step contains a false exponent identity (a^{p^{N+1}} is written as a^p a^{p^N}), this is a genuine proof gap but not circularity: the intended repair applies Proposition 1 to (a^{p^N})^p=(b^{p^N})^p to obtain a^{p^N}=b^{p^N}, and then applies the induction hypothesis. The theorem itself remains correct and is not derived from itself or from a fitted parameter. Section 4's dynamical proof of Fermat's Little Theorem follows Iga and is self-contained modulo Proposition 2; it does not assume Fermat's theorem as an input. References to external works are contextual or alternative proofs, not self-citations carrying the load. No fitted parameter is renamed as a prediction, and no known result is repackaged as a new derivation. Therefore the paper merits a circularity score of 0.
Assumptions & free parameters
assumptions (6)
- standard math Field axioms: the existence of additive and multiplicative identities, inverses, and distributivity.
- standard math The Frobenius map a ↦ a^p is a field homomorphism and an automorphism of F_{p^n}.
- standard math Finiteness of the field implies that an injective map is surjective.
- standard math Unique factorization and splitting field uniqueness for polynomials over fields.
- standard math The group of units of a finite field is cyclic.
- standard math Sylow theorems, used to claim the additive group of a field of order pq is cyclic.
Cite this review
Pith. "Pith review of A Glimpse of Arithmetic Dynamics." pith.science (2026). https://pith.science/paper/NDCBU5P6
@misc{pith2026190801831,
author = {Pith},
title = {Pith review of: A Glimpse of Arithmetic Dynamics},
year = {2026},
howpublished = {\url{https://pith.science/paper/NDCBU5P6}},
note = {Machine review of arXiv:1908.01831}
}
read the original abstract
In this note, we offer a palatable introduction to the field of arithmetic dynamics. That is, we study the patterns that arise when iterating a polynomial map. This note is accessible to those who have taken an introductory proof based course and some linear algebra; the appendix utilizes abstract algebra.
Reference graph
Works this paper leans on
-
[1]
Robert Benedetto, Laura DeMarco, Patrick Ingram, Rafe Jon es, Michelle Manes, Joseph H. Silverman, Thomas J. Tucker. Current Trends and Open Problems in Arithmetic Dynamics . https://arxiv.org/abs/1806.04980
-
[2]
Polynomial dynamics and a proof of the Fermat little theorem
Dragovi´ c, Vladimir. Polynomial dynamics and a proof of the Fermat little theorem. Amer. Math. Monthly 120 (2013), no. 2, 171–173
work page 2013
-
[3]
Abstract algebra, Third edition
Dummit, David S.; Foote, Richard M. Abstract algebra, Third edition. John Wiley & Sons, Inc., Hoboken, NJ, 2004
work page 2004
-
[4]
Preperiodic dynatomic curves for z ↦→zd +c
Gao, Yan. Preperiodic dynatomic curves for z ↦→zd +c. F und. Math. 233 (2016), no. 1, 37–69
work page 2016
-
[5]
A Dynamical Systems Proof of Fermat’s Little Theorem
Iga, Kevin. A Dynamical Systems Proof of Fermat’s Little Theorem . Math. Mag. 76 (2003), no. 1, 48–51
work page 2003
-
[6]
Introduction to the modern theory of dynamical systems
Katok, Anatole; Hasselblatt, Boris. Introduction to the modern theory of dynamical systems . With a supplementary chapter by Katok and Leonardo Mendoza. Encyclopedia of Mathematics and its Applications, 54 . Cambridge University Press, Cambridge, 1995
work page 1995
-
[7]
Galois groups of periodic points
Morton, Patrick. Galois groups of periodic points . J. Algebra 201 (1998), no. 2, 401–428
work page 1998
-
[8]
The arithmetic of dynamical systems
Silverman, Joseph H. The arithmetic of dynamical systems . Graduate T exts in Mathematics, 241 . Springer, New York, 2007
work page 2007
Show all 9 references
-
[9]
Zeta functions and asymptotic formulae for preperiodic orbits of hyperbolic rational maps
Waddington, Simon. Zeta functions and asymptotic formulae for preperiodic orbits of hyperbolic rational maps . Math. Nachr. 186 (1997), 259–284. About the authors: Ryan Grady Ryan Grady is an Assistant Professor of Mathematics and Director of the Di- rected Reading Program in ...
1997
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.